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