/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, 1137 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, xtmp, res, restmp) -> f2(x_1, xtmp, res, restmp) :|: TRUE
f2(x1, x2, x3, x4) -> f3(x1, x2, 0, x4) :|: TRUE
f4(x5, x6, x7, x8) -> f5(x5, x5, x7, x8) :|: TRUE
f5(x9, x10, x11, x12) -> f6(x9, x10, x11, 0) :|: TRUE
f7(x13, x14, x15, x16) -> f8(x13, arith, x15, x16) :|: TRUE && arith = x14 - 2
f8(x53, x54, x55, x56) -> f9(x53, x54, x55, x57) :|: TRUE && x57 = x56 + 1
f6(x21, x22, x23, x24) -> f7(x21, x22, x23, x24) :|: x22 > 1
f9(x25, x26, x27, x28) -> f6(x25, x26, x27, x28) :|: TRUE
f6(x29, x30, x31, x32) -> f10(x29, x30, x31, x32) :|: x30 <= 1
f10(x33, x34, x35, x36) -> f11(x34, x34, x35, x36) :|: TRUE
f11(x58, x59, x60, x61) -> f12(x58, x59, x62, x61) :|: TRUE && x62 = x60 + 1
f3(x41, x42, x43, x44) -> f4(x41, x42, x43, x44) :|: x41 > 1
f12(x45, x46, x47, x48) -> f3(x45, x46, x47, x48) :|: TRUE
f3(x49, x50, x51, x52) -> f13(x49, x50, x51, x52) :|: x49 <= 1
Start term: f1(x, xtmp, res, restmp)

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

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

   (f1_4,1)
   (f2_4,2)
   (f3_4,3)
   (f4_4,4)
   (f5_4,5)
   (f6_4,6)
   (f7_4,7)
   (f8_4,8)
   (f9_4,9)
   (f10_4,10)
   (f11_4,11)
   (f12_4,12)
   (f13_4,13)

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

(4)
Obligation:
START: 1;

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

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

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

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

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

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

FROM: 6;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
oldX3 := x3;
assume(oldX1 > 1);
x0 := oldX0;
x1 := oldX1;
x2 := oldX2;
x3 := oldX3;
TO: 7;

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

FROM: 6;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
oldX3 := x3;
assume(oldX1 <= 1);
x0 := oldX0;
x1 := oldX1;
x2 := oldX2;
x3 := oldX3;
TO: 10;

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

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

FROM: 3;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
oldX3 := x3;
assume(oldX0 > 1);
x0 := oldX0;
x1 := oldX1;
x2 := oldX2;
x3 := oldX3;
TO: 4;

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

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


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

(5) T2 (EQUIVALENT)
Initially, performed program simplifications using lexicographic rank functions:
 * Removed transitions 7, 9, 10, 11, 14, 17, 18 using the following rank functions:
    - Rank function 1:
      RF for loc. 8: 3+x1
      RF for loc. 9: 3+x1
      RF for loc. 13: 3*x0
      Bound for (chained) transitions 10: 5
      Bound for (chained) transitions 11: 5
      Bound for (chained) transitions 17: 6
      Bound for (chained) transitions 18: 6
    - Rank function 2:
      RF for loc. 8: 0
      RF for loc. 9: -1
      RF for loc. 13: -1
      Bound for (chained) transitions 7: 0
      Bound for (chained) transitions 9, 14: 0

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

(6)
YES