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