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