/export/starexec/sandbox/solver/bin/starexec_run_c /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files


--------------------------------------------------------------------------------


YES
proof of /export/starexec/sandbox/benchmark/theBenchmark.c
# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty


Termination of the given C Problem could be proven:

(0) C Problem
(1) CToIRSProof [EQUIVALENT, 0 ms]
(2) IntTRS
(3) IRS2T2 [EQUIVALENT, 0 ms]
(4) T2IntSys
(5) T2 [EQUIVALENT, 2177 ms]
(6) YES


----------------------------------------

(0)
Obligation:
c file /export/starexec/sandbox/benchmark/theBenchmark.c
----------------------------------------

(1) CToIRSProof (EQUIVALENT)
Parsed C Integer Program as IRS.
----------------------------------------

(2)
Obligation:
Rules:
f1(x, y, z) -> f2(x_1, y, z) :|: TRUE
f2(x1, x2, x3) -> f3(x1, x4, x3) :|: TRUE
f3(x5, x6, x7) -> f4(x5, x6, x8) :|: TRUE
f8(x9, x10, x11) -> f9(arith, x10, x11) :|: TRUE && arith = x9 - 1
f10(x51, x52, x53) -> f11(x54, x52, x53) :|: TRUE && x54 = x51 + 1
f11(x55, x56, x57) -> f12(x55, x56, x58) :|: TRUE && x58 = x57 - 1
f9(x18, x19, x20) -> f10(x18, x19, x20) :|: x19 < x20
f12(x21, x22, x23) -> f9(x21, x22, x23) :|: TRUE
f9(x24, x25, x26) -> f13(x24, x25, x26) :|: x25 >= x26
f13(x59, x60, x61) -> f14(x59, x62, x61) :|: TRUE && x62 = x59 + x60
f5(x30, x31, x32) -> f8(x30, x31, x32) :|: x31 >= 1
f14(x33, x34, x35) -> f5(x33, x34, x35) :|: TRUE
f5(x36, x37, x38) -> f15(x36, x37, x38) :|: x37 < 1
f4(x39, x40, x41) -> f5(x39, x40, x41) :|: x39 <= 10000 && x39 >= 0 - 10000 && x40 <= 10000 && x41 <= 10000
f4(x42, x43, x44) -> f6(x42, x43, x44) :|: x44 > 10000
f4(x63, x64, x65) -> f6(x63, x64, x65) :|: x64 > 10000
f4(x66, x67, x68) -> f6(x66, x67, x68) :|: x66 > 10000
f4(x69, x70, x71) -> f6(x69, x70, x71) :|: x69 < 0 - 10000
f15(x45, x46, x47) -> f7(x45, x46, x47) :|: TRUE
f6(x48, x49, x50) -> f7(x48, x49, x50) :|: TRUE
Start term: f1(x, y, z)

----------------------------------------

(3) IRS2T2 (EQUIVALENT)
Transformed input IRS into an integer transition system.Used the following mapping from defined symbols to location IDs:

   (f1_3,1)
   (f2_3,2)
   (f3_3,3)
   (f4_3,4)
   (f8_3,5)
   (f9_3,6)
   (f10_3,7)
   (f11_3,8)
   (f12_3,9)
   (f13_3,10)
   (f14_3,11)
   (f5_3,12)
   (f15_3,13)
   (f6_3,14)
   (f7_3,15)

----------------------------------------

(4)
Obligation:
START: 1;

FROM: 1;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
oldX3 := nondet();
assume(0 = 0);
x0 := oldX3;
x1 := oldX1;
x2 := oldX2;
TO: 2;

FROM: 2;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
oldX3 := nondet();
assume(0 = 0);
x0 := oldX0;
x1 := oldX3;
x2 := oldX2;
TO: 3;

FROM: 3;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
oldX3 := nondet();
assume(0 = 0);
x0 := oldX0;
x1 := oldX1;
x2 := oldX3;
TO: 4;

FROM: 5;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
oldX3 := -(1 - oldX0);
assume(0 = 0 && oldX3 = oldX0 - 1);
x0 := -(1 - oldX0);
x1 := oldX1;
x2 := oldX2;
TO: 6;

FROM: 7;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
oldX3 := -(-(oldX0 + 1));
assume(0 = 0 && oldX3 = oldX0 + 1);
x0 := -(-(oldX0 + 1));
x1 := oldX1;
x2 := oldX2;
TO: 8;

FROM: 8;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
oldX3 := -(1 - oldX2);
assume(0 = 0 && oldX3 = oldX2 - 1);
x0 := oldX0;
x1 := oldX1;
x2 := -(1 - oldX2);
TO: 9;

FROM: 6;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
assume(oldX1 < oldX2);
x0 := oldX0;
x1 := oldX1;
x2 := oldX2;
TO: 7;

FROM: 9;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
assume(0 = 0);
x0 := oldX0;
x1 := oldX1;
x2 := oldX2;
TO: 6;

FROM: 6;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
assume(oldX1 >= oldX2);
x0 := oldX0;
x1 := oldX1;
x2 := oldX2;
TO: 10;

FROM: 10;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
oldX3 := -(-(oldX0 + oldX1));
assume(0 = 0 && oldX3 = oldX0 + oldX1);
x0 := oldX0;
x1 := -(-(oldX0 + oldX1));
x2 := oldX2;
TO: 11;

FROM: 12;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
assume(oldX1 >= 1);
x0 := oldX0;
x1 := oldX1;
x2 := oldX2;
TO: 5;

FROM: 11;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
assume(0 = 0);
x0 := oldX0;
x1 := oldX1;
x2 := oldX2;
TO: 12;

FROM: 12;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
assume(oldX1 < 1);
x0 := oldX0;
x1 := oldX1;
x2 := oldX2;
TO: 13;

FROM: 4;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
assume(oldX0 <= 10000 && oldX0 >= 0 - 10000 && oldX1 <= 10000 && oldX2 <= 10000);
x0 := oldX0;
x1 := oldX1;
x2 := oldX2;
TO: 12;

FROM: 4;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
assume(oldX2 > 10000);
x0 := oldX0;
x1 := oldX1;
x2 := oldX2;
TO: 14;

FROM: 4;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
assume(oldX1 > 10000);
x0 := oldX0;
x1 := oldX1;
x2 := oldX2;
TO: 14;

FROM: 4;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
assume(oldX0 > 10000);
x0 := oldX0;
x1 := oldX1;
x2 := oldX2;
TO: 14;

FROM: 4;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
assume(oldX0 < 0 - 10000);
x0 := oldX0;
x1 := oldX1;
x2 := oldX2;
TO: 14;

FROM: 13;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
assume(0 = 0);
x0 := oldX0;
x1 := oldX1;
x2 := oldX2;
TO: 15;

FROM: 14;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
assume(0 = 0);
x0 := oldX0;
x1 := oldX1;
x2 := oldX2;
TO: 15;


----------------------------------------

(5) T2 (EQUIVALENT)
Initially, performed program simplifications using lexicographic rank functions:
 * Removed transitions 17 using the following rank functions:
    - Rank function 1:
      RF for loc. 9: 3*x2
      RF for loc. 11: 3*x2
      RF for loc. 15: 3*x2
      Bound for (chained) transitions 17: 6
Used the following cutpoint-specific lexicographic rank functions:
 * For cutpoint 9, used the following rank functions/bounds (in descending priority order):
    - RF x2-x1, bound 1

----------------------------------------

(6)
YES