8.97/3.05 NO 8.97/3.05 proof of /export/starexec/sandbox/benchmark/theBenchmark.c 8.97/3.05 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 8.97/3.05 8.97/3.05 8.97/3.05 Termination of the given C Problem could be disproven: 8.97/3.05 8.97/3.05 (0) C Problem 8.97/3.05 (1) CToIRSProof [EQUIVALENT, 0 ms] 8.97/3.05 (2) IntTRS 8.97/3.05 (3) IRS2T2 [EQUIVALENT, 0 ms] 8.97/3.05 (4) T2IntSys 8.97/3.05 (5) T2 [COMPLETE, 1408 ms] 8.97/3.05 (6) NO 8.97/3.05 8.97/3.05 8.97/3.05 ---------------------------------------- 8.97/3.05 8.97/3.05 (0) 8.97/3.05 Obligation: 8.97/3.05 c file /export/starexec/sandbox/benchmark/theBenchmark.c 8.97/3.05 ---------------------------------------- 8.97/3.05 8.97/3.05 (1) CToIRSProof (EQUIVALENT) 8.97/3.05 Parsed C Integer Program as IRS. 8.97/3.05 ---------------------------------------- 8.97/3.05 8.97/3.05 (2) 8.97/3.05 Obligation: 8.97/3.05 Rules: 8.97/3.05 f1(x) -> f2(x_1) :|: TRUE 8.97/3.05 f4(x1) -> f7(arith) :|: TRUE && arith = x1 - 1 8.97/3.05 f5(x12) -> f8(x13) :|: TRUE && x13 = x12 + 1 8.97/3.05 f3(x3) -> f4(x3) :|: x4 < 0 8.97/3.05 f3(x14) -> f4(x14) :|: x15 > 0 8.97/3.05 f3(x5) -> f5(x5) :|: x6 = 0 8.97/3.05 f7(x7) -> f6(x7) :|: TRUE 8.97/3.05 f8(x8) -> f6(x8) :|: TRUE 8.97/3.05 f2(x9) -> f3(x9) :|: x9 >= 0 8.97/3.05 f6(x10) -> f2(x10) :|: TRUE 8.97/3.05 f2(x11) -> f9(x11) :|: x11 < 0 8.97/3.05 Start term: f1(x) 8.97/3.05 8.97/3.05 ---------------------------------------- 8.97/3.05 8.97/3.05 (3) IRS2T2 (EQUIVALENT) 8.97/3.05 Transformed input IRS into an integer transition system.Used the following mapping from defined symbols to location IDs: 8.97/3.05 8.97/3.05 (f1_1,1) 8.97/3.05 (f2_1,2) 8.97/3.05 (f4_1,3) 8.97/3.05 (f7_1,4) 8.97/3.05 (f5_1,5) 8.97/3.05 (f8_1,6) 8.97/3.05 (f3_1,7) 8.97/3.05 (f6_1,8) 8.97/3.05 (f9_1,9) 8.97/3.05 8.97/3.05 ---------------------------------------- 8.97/3.05 8.97/3.05 (4) 8.97/3.05 Obligation: 8.97/3.05 START: 1; 8.97/3.05 8.97/3.05 FROM: 1; 8.97/3.05 oldX0 := x0; 8.97/3.05 oldX1 := nondet(); 8.97/3.05 assume(0 = 0); 8.97/3.05 x0 := oldX1; 8.97/3.05 TO: 2; 8.97/3.05 8.97/3.05 FROM: 3; 8.97/3.05 oldX0 := x0; 8.97/3.05 oldX1 := -(1 - oldX0); 8.97/3.05 assume(0 = 0 && oldX1 = oldX0 - 1); 8.97/3.05 x0 := -(1 - oldX0); 8.97/3.05 TO: 4; 8.97/3.05 8.97/3.05 FROM: 5; 8.97/3.05 oldX0 := x0; 8.97/3.05 oldX1 := -(-(oldX0 + 1)); 8.97/3.05 assume(0 = 0 && oldX1 = oldX0 + 1); 8.97/3.05 x0 := -(-(oldX0 + 1)); 8.97/3.05 TO: 6; 8.97/3.05 8.97/3.05 FROM: 7; 8.97/3.05 oldX0 := x0; 8.97/3.05 oldX1 := nondet(); 8.97/3.05 assume(oldX1 < 0); 8.97/3.05 x0 := oldX0; 8.97/3.05 TO: 3; 8.97/3.05 8.97/3.05 FROM: 7; 8.97/3.05 oldX0 := x0; 8.97/3.05 oldX1 := nondet(); 8.97/3.05 assume(oldX1 > 0); 8.97/3.05 x0 := oldX0; 8.97/3.05 TO: 3; 8.97/3.05 8.97/3.05 FROM: 7; 8.97/3.05 oldX0 := x0; 8.97/3.05 oldX1 := -(0); 8.97/3.05 assume(oldX1 = 0); 8.97/3.05 x0 := oldX0; 8.97/3.05 TO: 5; 8.97/3.05 8.97/3.05 FROM: 4; 8.97/3.05 oldX0 := x0; 8.97/3.05 assume(0 = 0); 8.97/3.05 x0 := oldX0; 8.97/3.05 TO: 8; 8.97/3.05 8.97/3.05 FROM: 6; 8.97/3.05 oldX0 := x0; 8.97/3.05 assume(0 = 0); 8.97/3.05 x0 := oldX0; 8.97/3.05 TO: 8; 8.97/3.05 8.97/3.05 FROM: 2; 8.97/3.05 oldX0 := x0; 8.97/3.05 assume(oldX0 >= 0); 8.97/3.05 x0 := oldX0; 8.97/3.05 TO: 7; 8.97/3.05 8.97/3.05 FROM: 8; 8.97/3.05 oldX0 := x0; 8.97/3.05 assume(0 = 0); 8.97/3.05 x0 := oldX0; 8.97/3.05 TO: 2; 8.97/3.05 8.97/3.05 FROM: 2; 8.97/3.05 oldX0 := x0; 8.97/3.05 assume(oldX0 < 0); 8.97/3.05 x0 := oldX0; 8.97/3.05 TO: 9; 8.97/3.05 8.97/3.05 8.97/3.05 ---------------------------------------- 8.97/3.05 8.97/3.05 (5) T2 (COMPLETE) 8.97/3.05 Found this recurrent set for cutpoint 9: oldX1-x0 <= 0 and 0 <= 0 8.97/3.05 8.97/3.05 ---------------------------------------- 8.97/3.05 8.97/3.05 (6) 8.97/3.05 NO 8.97/3.09 EOF