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