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