9.03/3.08 NO 9.03/3.11 proof of /export/starexec/sandbox/benchmark/theBenchmark.c 9.03/3.11 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 9.03/3.11 9.03/3.11 9.03/3.11 Termination of the given C Problem could be disproven: 9.03/3.11 9.03/3.11 (0) C Problem 9.03/3.11 (1) CToIRSProof [EQUIVALENT, 0 ms] 9.03/3.11 (2) IntTRS 9.03/3.11 (3) IRS2T2 [EQUIVALENT, 0 ms] 9.03/3.11 (4) T2IntSys 9.03/3.11 (5) T2 [COMPLETE, 1177 ms] 9.03/3.11 (6) NO 9.03/3.11 9.03/3.11 9.03/3.11 ---------------------------------------- 9.03/3.11 9.03/3.11 (0) 9.03/3.11 Obligation: 9.03/3.11 c file /export/starexec/sandbox/benchmark/theBenchmark.c 9.03/3.11 ---------------------------------------- 9.03/3.11 9.03/3.11 (1) CToIRSProof (EQUIVALENT) 9.03/3.11 Parsed C Integer Program as IRS. 9.03/3.11 ---------------------------------------- 9.03/3.11 9.03/3.11 (2) 9.03/3.11 Obligation: 9.03/3.11 Rules: 9.03/3.11 f1(x, y) -> f2(x_1, y) :|: TRUE 9.03/3.11 f2(x1, x2) -> f3(x1, x3) :|: TRUE 9.03/3.11 f7(x4, x5) -> f8(arith, x5) :|: TRUE && arith = x4 - x5 9.03/3.11 f4(x6, x7) -> f7(x6, x7) :|: x6 >= 0 9.03/3.11 f8(x8, x9) -> f4(x8, x9) :|: TRUE 9.03/3.11 f4(x10, x11) -> f9(x10, x11) :|: x10 < 0 9.03/3.11 f3(x12, x13) -> f4(x12, x13) :|: x13 <= x12 9.03/3.11 f3(x14, x15) -> f5(x14, x15) :|: x15 > x14 9.03/3.11 f9(x16, x17) -> f6(x16, x17) :|: TRUE 9.03/3.11 f5(x18, x19) -> f6(x18, x19) :|: TRUE 9.03/3.11 Start term: f1(x, y) 9.03/3.11 9.03/3.11 ---------------------------------------- 9.03/3.11 9.03/3.11 (3) IRS2T2 (EQUIVALENT) 9.03/3.11 Transformed input IRS into an integer transition system.Used the following mapping from defined symbols to location IDs: 9.03/3.11 9.03/3.11 (f1_2,1) 9.03/3.11 (f2_2,2) 9.03/3.11 (f3_2,3) 9.03/3.11 (f7_2,4) 9.03/3.11 (f8_2,5) 9.03/3.11 (f4_2,6) 9.03/3.11 (f9_2,7) 9.03/3.11 (f5_2,8) 9.03/3.11 (f6_2,9) 9.03/3.11 9.03/3.11 ---------------------------------------- 9.03/3.11 9.03/3.11 (4) 9.03/3.11 Obligation: 9.03/3.11 START: 1; 9.03/3.11 9.03/3.11 FROM: 1; 9.03/3.11 oldX0 := x0; 9.03/3.11 oldX1 := x1; 9.03/3.11 oldX2 := nondet(); 9.03/3.11 assume(0 = 0); 9.03/3.11 x0 := oldX2; 9.03/3.11 x1 := oldX1; 9.03/3.11 TO: 2; 9.03/3.11 9.03/3.11 FROM: 2; 9.03/3.11 oldX0 := x0; 9.03/3.11 oldX1 := x1; 9.03/3.11 oldX2 := nondet(); 9.03/3.11 assume(0 = 0); 9.03/3.11 x0 := oldX0; 9.03/3.11 x1 := oldX2; 9.03/3.11 TO: 3; 9.03/3.11 9.03/3.11 FROM: 4; 9.03/3.11 oldX0 := x0; 9.03/3.11 oldX1 := x1; 9.03/3.11 oldX2 := -(oldX1 - oldX0); 9.03/3.11 assume(0 = 0 && oldX2 = oldX0 - oldX1); 9.03/3.11 x0 := -(oldX1 - oldX0); 9.03/3.11 x1 := oldX1; 9.03/3.11 TO: 5; 9.03/3.11 9.03/3.11 FROM: 6; 9.03/3.11 oldX0 := x0; 9.03/3.11 oldX1 := x1; 9.03/3.11 assume(oldX0 >= 0); 9.03/3.11 x0 := oldX0; 9.03/3.11 x1 := oldX1; 9.03/3.11 TO: 4; 9.03/3.11 9.03/3.11 FROM: 5; 9.03/3.11 oldX0 := x0; 9.03/3.11 oldX1 := x1; 9.03/3.11 assume(0 = 0); 9.03/3.11 x0 := oldX0; 9.03/3.11 x1 := oldX1; 9.03/3.11 TO: 6; 9.03/3.11 9.03/3.11 FROM: 6; 9.03/3.11 oldX0 := x0; 9.03/3.11 oldX1 := x1; 9.03/3.11 assume(oldX0 < 0); 9.03/3.11 x0 := oldX0; 9.03/3.11 x1 := oldX1; 9.03/3.11 TO: 7; 9.03/3.11 9.03/3.11 FROM: 3; 9.03/3.11 oldX0 := x0; 9.03/3.11 oldX1 := x1; 9.03/3.11 assume(oldX1 <= oldX0); 9.03/3.11 x0 := oldX0; 9.03/3.11 x1 := oldX1; 9.03/3.11 TO: 6; 9.03/3.11 9.03/3.11 FROM: 3; 9.03/3.11 oldX0 := x0; 9.03/3.11 oldX1 := x1; 9.03/3.11 assume(oldX1 > oldX0); 9.03/3.11 x0 := oldX0; 9.03/3.11 x1 := oldX1; 9.03/3.11 TO: 8; 9.03/3.11 9.03/3.11 FROM: 7; 9.03/3.11 oldX0 := x0; 9.03/3.11 oldX1 := x1; 9.03/3.11 assume(0 = 0); 9.03/3.11 x0 := oldX0; 9.03/3.11 x1 := oldX1; 9.03/3.11 TO: 9; 9.03/3.11 9.03/3.11 FROM: 8; 9.03/3.11 oldX0 := x0; 9.03/3.11 oldX1 := x1; 9.03/3.11 assume(0 = 0); 9.03/3.11 x0 := oldX0; 9.03/3.11 x1 := oldX1; 9.03/3.11 TO: 9; 9.03/3.11 9.03/3.11 9.03/3.11 ---------------------------------------- 9.03/3.11 9.03/3.11 (5) T2 (COMPLETE) 9.03/3.11 Found this recurrent set for cutpoint 7: oldX2 == 0 and x0 == 0 and x1 == 0 9.03/3.11 9.03/3.11 ---------------------------------------- 9.03/3.11 9.03/3.11 (6) 9.03/3.11 NO 9.03/3.12 EOF