NO
proof of /export/starexec/sandbox2/benchmark/theBenchmark.c
# AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty


Termination of the given C Problem could be disproven:

(0) C Problem
(1) CToIRSProof [EQUIVALENT, 0 ms]
(2) IntTRS
(3) IRS2T2 [EQUIVALENT, 0 ms]
(4) T2IntSys
(5) T2 Underapproximation [COMPLETE, 2668 ms]
(6) T2IntSys
(7) T2 [COMPLETE, 1272 ms]
(8) NO


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

(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, 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
f5(x9, x10, x11) -> f6(arith, x10, x11) :|: TRUE && arith = x9 + x10
f6(x27, x28, x29) -> f7(x27, x30, x29) :|: TRUE && x30 = x28 + x29
f7(x31, x32, x33) -> f8(x31, x32, x34) :|: TRUE && x34 = x33 + 1
f4(x18, x19, x20) -> f5(x18, x19, x20) :|: x18 > 0
f8(x21, x22, x23) -> f4(x21, x22, x23) :|: TRUE
f4(x24, x25, x26) -> f9(x24, x25, x26) :|: x24 <= 0
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)
   (f5_3,5)
   (f6_3,6)
   (f7_3,7)
   (f8_3,8)
   (f9_3,9)

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

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

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

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

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

FROM: 8;
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(oldX0 <= 0);
x0 := oldX0;
x1 := oldX1;
x2 := oldX2;
TO: 9;


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

(5) T2 Underapproximation (COMPLETE)
Added the following guard statements:



Transition 5:
assume(x0 >= 0);


Transition 6:
assume(x1 >= 0);


Transition 7:
assume(x2 >= 0);



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

(6)
Obligation:
START: 1;

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

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

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

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

FROM: 6;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
oldX3 := x1 + x2;
assume(0 = 0 && x1 + x2 = x1 + x2);
x0 := x0;
assume(x1 >= 0);
x1 := x1 + x2;
x2 := x2;
TO: 7;

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

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

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

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


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

(7) T2 (COMPLETE)
Found this recurrent set for cutpoint 6: oldX3-x2 <= 0 and -x0+1 <= 0

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

(8)
NO