9.23/3.33	NO
9.23/3.34	proof of /export/starexec/sandbox/benchmark/theBenchmark.c
9.23/3.34	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
9.23/3.34	
9.23/3.34	
9.23/3.34	Termination of the given C Problem could be disproven:
9.23/3.34	
9.23/3.34	(0) C Problem
9.23/3.34	(1) CToIRSProof [EQUIVALENT, 0 ms]
9.23/3.34	(2) IntTRS
9.23/3.34	(3) IRS2T2 [EQUIVALENT, 0 ms]
9.23/3.34	(4) T2IntSys
9.23/3.34	(5) T2 [COMPLETE, 1277 ms]
9.23/3.34	(6) NO
9.23/3.34	
9.23/3.34	
9.23/3.34	----------------------------------------
9.23/3.34	
9.23/3.34	(0)
9.23/3.34	Obligation:
9.23/3.34	c file /export/starexec/sandbox/benchmark/theBenchmark.c
9.23/3.34	----------------------------------------
9.23/3.34	
9.23/3.34	(1) CToIRSProof (EQUIVALENT)
9.23/3.34	Parsed C Integer Program as IRS.
9.23/3.34	----------------------------------------
9.23/3.34	
9.23/3.34	(2)
9.23/3.34	Obligation:
9.23/3.34	Rules:
9.23/3.34	f1(x) -> f2(x_1) :|: TRUE
9.23/3.34	f3(x1) -> f4(arith) :|: TRUE && arith = x1 + x2
9.23/3.34	f2(x3) -> f3(x3) :|: x3 >= 0
9.23/3.34	f4(x4) -> f2(x4) :|: TRUE
9.23/3.34	f2(x5) -> f5(x5) :|: x5 < 0
9.23/3.34	Start term: f1(x)
9.23/3.34	
9.23/3.34	----------------------------------------
9.23/3.34	
9.23/3.34	(3) IRS2T2 (EQUIVALENT)
9.23/3.34	Transformed input IRS into an integer transition system.Used the following mapping from defined symbols to location IDs:
9.23/3.34	
9.23/3.34	   (f1_1,1)
9.23/3.34	   (f2_1,2)
9.23/3.34	   (f3_1,3)
9.23/3.34	   (f4_1,4)
9.23/3.34	   (f5_1,5)
9.23/3.34	
9.23/3.34	----------------------------------------
9.23/3.34	
9.23/3.34	(4)
9.23/3.34	Obligation:
9.23/3.34	START: 1;
9.23/3.34	
9.23/3.34	FROM: 1;
9.23/3.34	oldX0 := x0;
9.23/3.34	oldX1 := nondet();
9.23/3.34	assume(0 = 0);
9.23/3.34	x0 := oldX1;
9.23/3.34	TO: 2;
9.23/3.34	
9.23/3.34	FROM: 3;
9.23/3.34	oldX0 := x0;
9.23/3.34	oldX1 := nondet();
9.23/3.34	oldX2 := nondet();
9.23/3.34	assume(0 = 0 && oldX1 = oldX0 + oldX2);
9.23/3.34	x0 := oldX1;
9.23/3.34	TO: 4;
9.23/3.34	
9.23/3.34	FROM: 2;
9.23/3.34	oldX0 := x0;
9.23/3.34	assume(oldX0 >= 0);
9.23/3.34	x0 := oldX0;
9.23/3.34	TO: 3;
9.23/3.34	
9.23/3.34	FROM: 4;
9.23/3.34	oldX0 := x0;
9.23/3.34	assume(0 = 0);
9.23/3.34	x0 := oldX0;
9.23/3.34	TO: 2;
9.23/3.34	
9.23/3.34	FROM: 2;
9.23/3.34	oldX0 := x0;
9.23/3.34	assume(oldX0 < 0);
9.23/3.34	x0 := oldX0;
9.23/3.34	TO: 5;
9.23/3.34	
9.23/3.34	
9.23/3.34	----------------------------------------
9.23/3.34	
9.23/3.34	(5) T2 (COMPLETE)
9.23/3.34	Found this recurrent set for cutpoint 6: oldX1 == 0 and oldX2 == 0 and x0 == 0
9.23/3.34	
9.23/3.34	----------------------------------------
9.23/3.34	
9.23/3.34	(6)
9.23/3.34	NO
10.08/3.36	EOF