9.67/3.25	YES
9.67/3.25	proof of /export/starexec/sandbox/benchmark/theBenchmark.c
9.67/3.25	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
9.67/3.25	
9.67/3.25	
9.67/3.25	Termination of the given C Problem could be proven:
9.67/3.25	
9.67/3.25	(0) C Problem
9.67/3.25	(1) CToIRSProof [EQUIVALENT, 0 ms]
9.67/3.25	(2) IntTRS
9.67/3.25	(3) IRS2T2 [EQUIVALENT, 0 ms]
9.67/3.25	(4) T2IntSys
9.67/3.25	(5) T2 [EQUIVALENT, 1538 ms]
9.67/3.25	(6) YES
9.67/3.25	
9.67/3.25	
9.67/3.25	----------------------------------------
9.67/3.25	
9.67/3.25	(0)
9.67/3.25	Obligation:
9.67/3.25	c file /export/starexec/sandbox/benchmark/theBenchmark.c
9.67/3.25	----------------------------------------
9.67/3.25	
9.67/3.25	(1) CToIRSProof (EQUIVALENT)
9.67/3.25	Parsed C Integer Program as IRS.
9.67/3.25	----------------------------------------
9.67/3.25	
9.67/3.25	(2)
9.67/3.25	Obligation:
9.67/3.25	Rules:
9.67/3.25	f1(x, y) -> f2(x_1, y) :|: TRUE
9.67/3.25	f2(x1, x2) -> f3(x1, x3) :|: TRUE
9.67/3.25	f4(x4, x5) -> f5(arith, x5) :|: TRUE && arith = 2 * x4
9.67/3.25	f5(x14, x15) -> f6(x14, x16) :|: TRUE && x16 = x15 + 1
9.67/3.25	f3(x8, x9) -> f4(x8, x9) :|: x8 > 0 && x8 < x9
9.67/3.25	f6(x10, x11) -> f3(x10, x11) :|: TRUE
9.67/3.25	f3(x12, x13) -> f7(x12, x13) :|: x12 <= 0
9.67/3.25	f3(x17, x18) -> f7(x17, x18) :|: x17 >= x18
9.67/3.25	Start term: f1(x, y)
9.67/3.25	
9.67/3.25	----------------------------------------
9.67/3.25	
9.67/3.25	(3) IRS2T2 (EQUIVALENT)
9.67/3.25	Transformed input IRS into an integer transition system.Used the following mapping from defined symbols to location IDs:
9.67/3.25	
9.67/3.25	   (f1_2,1)
9.67/3.25	   (f2_2,2)
9.67/3.25	   (f3_2,3)
9.67/3.25	   (f4_2,4)
9.67/3.25	   (f5_2,5)
9.67/3.25	   (f6_2,6)
9.67/3.25	   (f7_2,7)
9.67/3.25	
9.67/3.25	----------------------------------------
9.67/3.25	
9.67/3.25	(4)
9.67/3.25	Obligation:
9.67/3.25	START: 1;
9.67/3.25	
9.67/3.25	FROM: 1;
9.67/3.25	oldX0 := x0;
9.67/3.25	oldX1 := x1;
9.67/3.25	oldX2 := nondet();
9.67/3.25	assume(0 = 0);
9.67/3.25	x0 := oldX2;
9.67/3.25	x1 := oldX1;
9.67/3.25	TO: 2;
9.67/3.25	
9.67/3.25	FROM: 2;
9.67/3.25	oldX0 := x0;
9.67/3.25	oldX1 := x1;
9.67/3.25	oldX2 := nondet();
9.67/3.25	assume(0 = 0);
9.67/3.25	x0 := oldX0;
9.67/3.25	x1 := oldX2;
9.67/3.25	TO: 3;
9.67/3.25	
9.67/3.25	FROM: 4;
9.67/3.25	oldX0 := x0;
9.67/3.25	oldX1 := x1;
9.67/3.25	oldX2 := nondet();
9.67/3.25	assume(0 = 0 && oldX2 = 2 * oldX0);
9.67/3.25	x0 := oldX2;
9.67/3.25	x1 := oldX1;
9.67/3.25	TO: 5;
9.67/3.25	
9.67/3.25	FROM: 5;
9.67/3.25	oldX0 := x0;
9.67/3.25	oldX1 := x1;
9.67/3.25	oldX2 := -(-(oldX1 + 1));
9.67/3.25	assume(0 = 0 && oldX2 = oldX1 + 1);
9.67/3.25	x0 := oldX0;
9.67/3.25	x1 := -(-(oldX1 + 1));
9.67/3.25	TO: 6;
9.67/3.25	
9.67/3.25	FROM: 3;
9.67/3.25	oldX0 := x0;
9.67/3.25	oldX1 := x1;
9.67/3.25	assume(oldX0 > 0 && oldX0 < oldX1);
9.67/3.25	x0 := oldX0;
9.67/3.25	x1 := oldX1;
9.67/3.25	TO: 4;
9.67/3.25	
9.67/3.25	FROM: 6;
9.67/3.25	oldX0 := x0;
9.67/3.25	oldX1 := x1;
9.67/3.25	assume(0 = 0);
9.67/3.25	x0 := oldX0;
9.67/3.25	x1 := oldX1;
9.67/3.25	TO: 3;
9.67/3.25	
9.67/3.25	FROM: 3;
9.67/3.25	oldX0 := x0;
9.67/3.25	oldX1 := x1;
9.67/3.25	assume(oldX0 <= 0);
9.67/3.26	x0 := oldX0;
9.67/3.26	x1 := oldX1;
9.67/3.26	TO: 7;
9.67/3.26	
9.67/3.26	FROM: 3;
9.67/3.26	oldX0 := x0;
9.67/3.26	oldX1 := x1;
9.67/3.26	assume(oldX0 >= oldX1);
9.67/3.26	x0 := oldX0;
9.67/3.26	x1 := oldX1;
9.67/3.26	TO: 7;
9.67/3.26	
9.67/3.26	
9.67/3.26	----------------------------------------
9.67/3.26	
9.67/3.26	(5) T2 (EQUIVALENT)
9.67/3.26	No proof given by T2
9.67/3.26	----------------------------------------
9.67/3.26	
9.67/3.26	(6)
9.67/3.26	YES
9.67/3.30	EOF