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


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


YES
proof of /export/starexec/sandbox2/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, 1054 ms]
(6) YES


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

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

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

(2)
Obligation:
Rules:
f1(x, y, d) -> f2(x_1, y, d) :|: TRUE
f2(x1, x2, x3) -> f3(x1, x4, x3) :|: TRUE
f3(x5, x6, x7) -> f4(x5, x6, x8) :|: TRUE
f6(x9, x10, x11) -> f9(arith, x10, x11) :|: TRUE && arith = x9 - 1
f9(x12, x13, x14) -> f10(x12, x13, x15) :|: TRUE
f7(x16, x17, x18) -> f11(x19, x17, x18) :|: TRUE
f11(x49, x50, x51) -> f12(x49, x52, x51) :|: TRUE && x52 = x50 - 1
f12(x53, x54, x55) -> f13(x53, x54, x56) :|: TRUE && x56 = x55 - 1
f5(x26, x27, x28) -> f6(x26, x27, x28) :|: x29 < 0
f5(x57, x58, x59) -> f6(x57, x58, x59) :|: x60 > 0
f5(x30, x31, x32) -> f7(x30, x31, x32) :|: x33 = 0
f10(x34, x35, x36) -> f8(x34, x35, x36) :|: TRUE
f13(x37, x38, x39) -> f8(x37, x38, x39) :|: TRUE
f4(x40, x41, x42) -> f5(x40, x41, x42) :|: x40 > 0 && x41 > 0 && x42 > 0
f8(x43, x44, x45) -> f4(x43, x44, x45) :|: TRUE
f4(x46, x47, x48) -> f14(x46, x47, x48) :|: x48 <= 0
f4(x61, x62, x63) -> f14(x61, x62, x63) :|: x61 <= 0
f4(x64, x65, x66) -> f14(x64, x65, x66) :|: x65 <= 0
Start term: f1(x, y, d)

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

(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)
   (f6_3,5)
   (f9_3,6)
   (f10_3,7)
   (f7_3,8)
   (f11_3,9)
   (f12_3,10)
   (f13_3,11)
   (f5_3,12)
   (f8_3,13)
   (f14_3,14)

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

(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: 6;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
oldX3 := nondet();
assume(0 = 0);
x0 := oldX0;
x1 := oldX1;
x2 := oldX3;
TO: 7;

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

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

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

FROM: 12;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
oldX3 := nondet();
assume(oldX3 < 0);
x0 := oldX0;
x1 := oldX1;
x2 := oldX2;
TO: 5;

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

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

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

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

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

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

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

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

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


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

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

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

(6)
YES