/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, 1076 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(p, q) -> f2(p, x_1) :|: TRUE
f2(x, x1) -> f3(x2, x1) :|: TRUE
f5(x3, x4) -> f8(x3, arith) :|: TRUE && arith = x4 - 1
f9(x29, x30) -> f12(x31, x30) :|: TRUE && x31 = x29 - 1
f6(x7, x8) -> f9(x7, x8) :|: x7 < x8
f6(x9, x10) -> f10(x9, x10) :|: x9 >= x10
f12(x11, x12) -> f11(x11, x12) :|: TRUE
f10(x13, x14) -> f11(x13, x14) :|: TRUE
f4(x15, x16) -> f5(x15, x16) :|: x16 < x15
f4(x17, x18) -> f6(x17, x18) :|: x18 >= x17
f8(x19, x20) -> f7(x19, x20) :|: TRUE
f11(x21, x22) -> f7(x21, x22) :|: TRUE
f3(x23, x24) -> f4(x23, x24) :|: x24 > 0 && x23 > 0 && x23 < x24
f3(x32, x33) -> f4(x32, x33) :|: x33 > 0 && x32 > 0 && x32 > x33
f7(x25, x26) -> f3(x25, x26) :|: TRUE
f3(x27, x28) -> f13(x27, x28) :|: x27 = x28
f3(x34, x35) -> f13(x34, x35) :|: x35 <= 0
f3(x36, x37) -> f13(x36, x37) :|: x36 <= 0
Start term: f1(p, q)

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

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

   (f1_2,1)
   (f2_2,2)
   (f3_2,3)
   (f5_2,4)
   (f8_2,5)
   (f9_2,6)
   (f12_2,7)
   (f6_2,8)
   (f10_2,9)
   (f11_2,10)
   (f4_2,11)
   (f7_2,12)
   (f13_2,13)

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

(4)
Obligation:
START: 1;

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

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

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

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

FROM: 8;
oldX0 := x0;
oldX1 := x1;
assume(oldX0 < oldX1);
x0 := oldX0;
x1 := oldX1;
TO: 6;

FROM: 8;
oldX0 := x0;
oldX1 := x1;
assume(oldX0 >= oldX1);
x0 := oldX0;
x1 := oldX1;
TO: 9;

FROM: 7;
oldX0 := x0;
oldX1 := x1;
assume(0 = 0);
x0 := oldX0;
x1 := oldX1;
TO: 10;

FROM: 9;
oldX0 := x0;
oldX1 := x1;
assume(0 = 0);
x0 := oldX0;
x1 := oldX1;
TO: 10;

FROM: 11;
oldX0 := x0;
oldX1 := x1;
assume(oldX1 < oldX0);
x0 := oldX0;
x1 := oldX1;
TO: 4;

FROM: 11;
oldX0 := x0;
oldX1 := x1;
assume(oldX1 >= oldX0);
x0 := oldX0;
x1 := oldX1;
TO: 8;

FROM: 5;
oldX0 := x0;
oldX1 := x1;
assume(0 = 0);
x0 := oldX0;
x1 := oldX1;
TO: 12;

FROM: 10;
oldX0 := x0;
oldX1 := x1;
assume(0 = 0);
x0 := oldX0;
x1 := oldX1;
TO: 12;

FROM: 3;
oldX0 := x0;
oldX1 := x1;
assume(oldX1 > 0 && oldX0 > 0 && oldX0 < oldX1);
x0 := oldX0;
x1 := oldX1;
TO: 11;

FROM: 3;
oldX0 := x0;
oldX1 := x1;
assume(oldX1 > 0 && oldX0 > 0 && oldX0 > oldX1);
x0 := oldX0;
x1 := oldX1;
TO: 11;

FROM: 12;
oldX0 := x0;
oldX1 := x1;
assume(0 = 0);
x0 := oldX0;
x1 := oldX1;
TO: 3;

FROM: 3;
oldX0 := x0;
oldX1 := x1;
assume(oldX0 = oldX1);
x0 := oldX0;
x1 := oldX1;
TO: 13;

FROM: 3;
oldX0 := x0;
oldX1 := x1;
assume(oldX1 <= 0);
x0 := oldX0;
x1 := oldX1;
TO: 13;

FROM: 3;
oldX0 := x0;
oldX1 := x1;
assume(oldX0 <= 0);
x0 := oldX0;
x1 := oldX1;
TO: 13;


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

(5) T2 (EQUIVALENT)
Initially, performed program simplifications using lexicographic rank functions:
 * Removed transitions 13, 15 using the following rank functions:
    - Rank function 1:
      RF for loc. 11: x0+x1
      RF for loc. 12: x0+x1
      RF for loc. 13: x0+x1
      RF for loc. 14: x0+x1
      RF for loc. 15: x0+x1
      Bound for (chained) transitions 13: 2
      Bound for (chained) transitions 15: 2

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

(6)
YES