Make variables unsigned in 89-apron3/{01,02}

Avoids accidental boundedness from assume_none.

Author: sim642

tests/regression/89-apron3/01-halbwachs-phd-sec5.6.2.c

@@ -1,12 +1,12 @@
-// SKIP TERM PARAM: --set ana.activated[+] apron --set ana.apron.domain polyhedra --set sem.int.signed_overflow assume_none --set ana.activated[+] termination
+// SKIP TERM PARAM: --set ana.activated[+] apron --set ana.apron.domain polyhedra --set ana.activated[+] termination
 // fully works with --set ana.widen.delay.local 6
 // Somehow we prove termination even without and don't have good bounds on termination counter.
 // From Nicolas Halbwachs' PhD thesis, section 5.6.2.
 #include <goblint.h>
 
 int main() {
-  int i = 0;
-  int j = 0;
+  unsigned int i = 0;
+  unsigned int j = 0;
   while (i <= 10) {
     __goblint_check(j >= 0);
     __goblint_check(i - 2 * j >= 0);
@@ -22,7 +22,7 @@ int main() {
   }
 
   __goblint_check(j >= 0);
-  __goblint_check(i - 2 * j >= 0); // requires sem.int.signed_overflow assume_none without narrowing because no upper bound on j
+  __goblint_check(i - 2 * j >= 0);
   __goblint_check(11 <= i);
   __goblint_check(i <= 14); // TODO: needs one narrowing iteration
   __goblint_check(i + 2 * j <= 24); // TODO: needs one narrowing iteration

tests/regression/89-apron3/02-halbwachs-phd-sec8.3.c

@@ -1,13 +1,13 @@
-// SKIP PARAM: --set ana.activated[+] apron --set ana.apron.domain polyhedra --set sem.int.signed_overflow assume_none
+// SKIP PARAM: --set ana.activated[+] apron --set ana.apron.domain polyhedra
 // fully works with --set ana.widen.delay.local 6
 // From Nicolas Halbwachs' PhD thesis, section 8.3.
 // Same as 01-halbwachs-phd-sec5.6.2 annotated with an explicit termination counter.
 #include <goblint.h>
 
 int main() {
-  int i = 0;
-  int j = 0;
-  int k = 0; // explicit termination counter
+  unsigned int i = 0;
+  unsigned int j = 0;
+  unsigned int k = 0; // explicit termination counter
   while (k++, i <= 10) {
     __goblint_check(j >= 0);
     __goblint_check(i + 2 * j + 4 == 4 * k);
@@ -31,10 +31,10 @@ int main() {
   }
 
   __goblint_check(j >= 0);
-  __goblint_check(i + 2 * j + 4 == 4 * k); // requires sem.int.signed_overflow assume_none without narrowing because no upper bound on j
+  __goblint_check(i + 2 * j + 4 == 4 * k); // TODO: needs one narrowing iteration?
   __goblint_check(11 <= i);
   __goblint_check(i <= 14); // TODO: needs one narrowing iteration?
-  __goblint_check(2 * k <= i + 2);
+  __goblint_check(2 * k <= i + 2); // TODO: needs one narrowing iteration?
 
   // if i and j are projected out:
   __goblint_check(4 <= k);