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


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


NO
proof of /export/starexec/sandbox2/benchmark/theBenchmark.c
# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 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 [COMPLETE, 1294 ms]
(6) 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) -> f2(x_1) :|: TRUE
f4(x1) -> f7(arith) :|: TRUE && arith = x1 + 1
f8(x33) -> f11(x34) :|: TRUE && x34 = x33 + 2
f12(x35) -> f15(x36) :|: TRUE && x36 = x35 + 3
f16(x37) -> f19(x38) :|: TRUE && x38 = x37 + 4
f17(x39) -> f20(x40) :|: TRUE && x40 = 0 - 1
f13(x6) -> f16(x6) :|: x7 < 0
f13(x41) -> f16(x41) :|: x42 > 0
f13(x8) -> f17(x8) :|: x9 = 0
f19(x10) -> f18(x10) :|: TRUE
f20(x11) -> f18(x11) :|: TRUE
f9(x12) -> f12(x12) :|: x13 < 0
f9(x43) -> f12(x43) :|: x44 > 0
f9(x14) -> f13(x14) :|: x15 = 0
f15(x16) -> f14(x16) :|: TRUE
f18(x17) -> f14(x17) :|: TRUE
f5(x18) -> f8(x18) :|: x19 < 0
f5(x45) -> f8(x45) :|: x46 > 0
f5(x20) -> f9(x20) :|: x21 = 0
f11(x22) -> f10(x22) :|: TRUE
f14(x23) -> f10(x23) :|: TRUE
f3(x24) -> f4(x24) :|: x25 < 0
f3(x47) -> f4(x47) :|: x48 > 0
f3(x26) -> f5(x26) :|: x27 = 0
f7(x28) -> f6(x28) :|: TRUE
f10(x29) -> f6(x29) :|: TRUE
f2(x30) -> f3(x30) :|: x30 >= 0
f6(x31) -> f2(x31) :|: TRUE
f2(x32) -> f21(x32) :|: x32 < 0
Start term: f1(x)

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

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

   (f1_1,1)
   (f2_1,2)
   (f4_1,3)
   (f7_1,4)
   (f8_1,5)
   (f11_1,6)
   (f12_1,7)
   (f15_1,8)
   (f16_1,9)
   (f19_1,10)
   (f17_1,11)
   (f20_1,12)
   (f13_1,13)
   (f18_1,14)
   (f9_1,15)
   (f14_1,16)
   (f5_1,17)
   (f10_1,18)
   (f3_1,19)
   (f6_1,20)
   (f21_1,21)

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

(4)
Obligation:
START: 1;

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

FROM: 3;
oldX0 := x0;
oldX1 := -(-(oldX0 + 1));
assume(0 = 0 && oldX1 = oldX0 + 1);
x0 := -(-(oldX0 + 1));
TO: 4;

FROM: 5;
oldX0 := x0;
oldX1 := -(-(oldX0 + 2));
assume(0 = 0 && oldX1 = oldX0 + 2);
x0 := -(-(oldX0 + 2));
TO: 6;

FROM: 7;
oldX0 := x0;
oldX1 := -(-(oldX0 + 3));
assume(0 = 0 && oldX1 = oldX0 + 3);
x0 := -(-(oldX0 + 3));
TO: 8;

FROM: 9;
oldX0 := x0;
oldX1 := -(-(oldX0 + 4));
assume(0 = 0 && oldX1 = oldX0 + 4);
x0 := -(-(oldX0 + 4));
TO: 10;

FROM: 11;
oldX0 := x0;
oldX1 := -(1);
assume(0 = 0 && oldX1 = 0 - 1);
x0 := -(1);
TO: 12;

FROM: 13;
oldX0 := x0;
oldX1 := nondet();
assume(oldX1 < 0);
x0 := oldX0;
TO: 9;

FROM: 13;
oldX0 := x0;
oldX1 := nondet();
assume(oldX1 > 0);
x0 := oldX0;
TO: 9;

FROM: 13;
oldX0 := x0;
oldX1 := -(0);
assume(oldX1 = 0);
x0 := oldX0;
TO: 11;

FROM: 10;
oldX0 := x0;
assume(0 = 0);
x0 := oldX0;
TO: 14;

FROM: 12;
oldX0 := x0;
assume(0 = 0);
x0 := oldX0;
TO: 14;

FROM: 15;
oldX0 := x0;
oldX1 := nondet();
assume(oldX1 < 0);
x0 := oldX0;
TO: 7;

FROM: 15;
oldX0 := x0;
oldX1 := nondet();
assume(oldX1 > 0);
x0 := oldX0;
TO: 7;

FROM: 15;
oldX0 := x0;
oldX1 := -(0);
assume(oldX1 = 0);
x0 := oldX0;
TO: 13;

FROM: 8;
oldX0 := x0;
assume(0 = 0);
x0 := oldX0;
TO: 16;

FROM: 14;
oldX0 := x0;
assume(0 = 0);
x0 := oldX0;
TO: 16;

FROM: 17;
oldX0 := x0;
oldX1 := nondet();
assume(oldX1 < 0);
x0 := oldX0;
TO: 5;

FROM: 17;
oldX0 := x0;
oldX1 := nondet();
assume(oldX1 > 0);
x0 := oldX0;
TO: 5;

FROM: 17;
oldX0 := x0;
oldX1 := -(0);
assume(oldX1 = 0);
x0 := oldX0;
TO: 15;

FROM: 6;
oldX0 := x0;
assume(0 = 0);
x0 := oldX0;
TO: 18;

FROM: 16;
oldX0 := x0;
assume(0 = 0);
x0 := oldX0;
TO: 18;

FROM: 19;
oldX0 := x0;
oldX1 := nondet();
assume(oldX1 < 0);
x0 := oldX0;
TO: 3;

FROM: 19;
oldX0 := x0;
oldX1 := nondet();
assume(oldX1 > 0);
x0 := oldX0;
TO: 3;

FROM: 19;
oldX0 := x0;
oldX1 := -(0);
assume(oldX1 = 0);
x0 := oldX0;
TO: 17;

FROM: 4;
oldX0 := x0;
assume(0 = 0);
x0 := oldX0;
TO: 20;

FROM: 18;
oldX0 := x0;
assume(0 = 0);
x0 := oldX0;
TO: 20;

FROM: 2;
oldX0 := x0;
assume(oldX0 >= 0);
x0 := oldX0;
TO: 19;

FROM: 20;
oldX0 := x0;
assume(0 = 0);
x0 := oldX0;
TO: 2;

FROM: 2;
oldX0 := x0;
assume(oldX0 < 0);
x0 := oldX0;
TO: 21;


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

(5) T2 (COMPLETE)
Found this recurrent set for cutpoint 18: oldX1-x0 <= 0 and x0-oldX1 <= 0 and 0 <= 0

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

(6)
NO