10.86/3.60	YES
10.86/3.60	proof of /export/starexec/sandbox2/benchmark/theBenchmark.c
10.86/3.60	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
10.86/3.60	
10.86/3.60	
10.86/3.60	Termination of the given C Problem could be proven:
10.86/3.60	
10.86/3.60	(0) C Problem
10.86/3.60	(1) CToIRSProof [EQUIVALENT, 0 ms]
10.86/3.60	(2) IntTRS
10.86/3.60	(3) IRS2T2 [EQUIVALENT, 0 ms]
10.86/3.60	(4) T2IntSys
10.86/3.60	(5) T2 [EQUIVALENT, 1714 ms]
10.86/3.60	(6) YES
10.86/3.60	
10.86/3.60	
10.86/3.60	----------------------------------------
10.86/3.60	
10.86/3.60	(0)
10.86/3.60	Obligation:
10.86/3.60	c file /export/starexec/sandbox2/benchmark/theBenchmark.c
10.86/3.60	----------------------------------------
10.86/3.60	
10.86/3.60	(1) CToIRSProof (EQUIVALENT)
10.86/3.60	Parsed C Integer Program as IRS.
10.86/3.60	----------------------------------------
10.86/3.60	
10.86/3.60	(2)
10.86/3.60	Obligation:
10.86/3.60	Rules:
10.86/3.60	f1(c, x, y) -> f2(c, x_1, y) :|: TRUE
10.86/3.60	f2(x1, x2, x3) -> f3(x1, x2, x4) :|: TRUE
10.86/3.60	f3(x5, x6, x7) -> f4(0, x6, x7) :|: TRUE
10.86/3.60	f5(x8, x9, x10) -> f6(x8, x9, 1) :|: TRUE
10.86/3.60	f7(x11, x12, x13) -> f8(x11, x12, arith) :|: TRUE && arith = 2 * x13
10.86/3.60	f8(x38, x39, x40) -> f9(x41, x39, x40) :|: TRUE && x41 = x38 + 1
10.86/3.60	f6(x17, x18, x19) -> f7(x17, x18, x19) :|: x18 > x19
10.86/3.60	f9(x20, x21, x22) -> f6(x20, x21, x22) :|: TRUE
10.86/3.60	f6(x23, x24, x25) -> f10(x23, x24, x25) :|: x24 <= x25
10.86/3.60	f10(x42, x43, x44) -> f11(x42, x45, x44) :|: TRUE && x45 = x43 - 1
10.86/3.60	f4(x29, x30, x31) -> f5(x29, x30, x31) :|: x30 >= 0
10.86/3.60	f11(x32, x33, x34) -> f4(x32, x33, x34) :|: TRUE
10.86/3.60	f4(x35, x36, x37) -> f12(x35, x36, x37) :|: x36 < 0
10.86/3.60	Start term: f1(c, x, y)
10.86/3.60	
10.86/3.60	----------------------------------------
10.86/3.60	
10.86/3.60	(3) IRS2T2 (EQUIVALENT)
10.86/3.60	Transformed input IRS into an integer transition system.Used the following mapping from defined symbols to location IDs:
10.86/3.60	
10.86/3.60	   (f1_3,1)
10.86/3.60	   (f2_3,2)
10.86/3.60	   (f3_3,3)
10.86/3.60	   (f4_3,4)
10.86/3.60	   (f5_3,5)
10.86/3.60	   (f6_3,6)
10.86/3.60	   (f7_3,7)
10.86/3.60	   (f8_3,8)
10.86/3.60	   (f9_3,9)
10.86/3.60	   (f10_3,10)
10.86/3.60	   (f11_3,11)
10.86/3.60	   (f12_3,12)
10.86/3.60	
10.86/3.60	----------------------------------------
10.86/3.60	
10.86/3.60	(4)
10.86/3.60	Obligation:
10.86/3.60	START: 1;
10.86/3.60	
10.86/3.60	FROM: 1;
10.86/3.60	oldX0 := x0;
10.86/3.60	oldX1 := x1;
10.86/3.60	oldX2 := x2;
10.86/3.60	oldX3 := nondet();
10.86/3.60	assume(0 = 0);
10.86/3.60	x0 := oldX0;
10.86/3.60	x1 := oldX3;
10.86/3.60	x2 := oldX2;
10.86/3.60	TO: 2;
10.86/3.60	
10.86/3.60	FROM: 2;
10.86/3.60	oldX0 := x0;
10.86/3.60	oldX1 := x1;
10.86/3.60	oldX2 := x2;
10.86/3.60	oldX3 := nondet();
10.86/3.60	assume(0 = 0);
10.86/3.60	x0 := oldX0;
10.86/3.60	x1 := oldX1;
10.86/3.60	x2 := oldX3;
10.86/3.60	TO: 3;
10.86/3.60	
10.86/3.60	FROM: 3;
10.86/3.60	oldX0 := x0;
10.86/3.60	oldX1 := x1;
10.86/3.60	oldX2 := x2;
10.86/3.60	assume(0 = 0);
10.86/3.60	x0 := 0;
10.86/3.60	x1 := oldX1;
10.86/3.60	x2 := oldX2;
10.86/3.60	TO: 4;
10.86/3.60	
10.86/3.60	FROM: 5;
10.86/3.60	oldX0 := x0;
10.86/3.60	oldX1 := x1;
10.86/3.60	oldX2 := x2;
10.86/3.60	assume(0 = 0);
10.86/3.60	x0 := oldX0;
10.86/3.60	x1 := oldX1;
10.86/3.60	x2 := 1;
10.86/3.60	TO: 6;
10.86/3.60	
10.86/3.60	FROM: 7;
10.86/3.60	oldX0 := x0;
10.86/3.60	oldX1 := x1;
10.86/3.60	oldX2 := x2;
10.86/3.60	oldX3 := nondet();
10.86/3.60	assume(0 = 0 && oldX3 = 2 * oldX2);
10.86/3.60	x0 := oldX0;
10.86/3.60	x1 := oldX1;
10.86/3.60	x2 := oldX3;
10.86/3.60	TO: 8;
10.86/3.60	
10.86/3.60	FROM: 8;
10.86/3.60	oldX0 := x0;
10.86/3.60	oldX1 := x1;
10.86/3.60	oldX2 := x2;
10.86/3.60	oldX3 := -(-(oldX0 + 1));
10.86/3.60	assume(0 = 0 && oldX3 = oldX0 + 1);
10.86/3.60	x0 := -(-(oldX0 + 1));
10.86/3.60	x1 := oldX1;
10.86/3.60	x2 := oldX2;
10.86/3.60	TO: 9;
10.86/3.60	
10.86/3.60	FROM: 6;
10.86/3.60	oldX0 := x0;
10.86/3.60	oldX1 := x1;
10.86/3.60	oldX2 := x2;
10.86/3.60	assume(oldX1 > oldX2);
10.86/3.60	x0 := oldX0;
10.86/3.60	x1 := oldX1;
10.86/3.60	x2 := oldX2;
10.86/3.60	TO: 7;
10.86/3.60	
10.86/3.60	FROM: 9;
10.86/3.60	oldX0 := x0;
10.86/3.60	oldX1 := x1;
10.86/3.60	oldX2 := x2;
10.86/3.60	assume(0 = 0);
10.86/3.60	x0 := oldX0;
10.86/3.60	x1 := oldX1;
10.86/3.60	x2 := oldX2;
10.86/3.60	TO: 6;
10.86/3.60	
10.86/3.60	FROM: 6;
10.86/3.60	oldX0 := x0;
10.86/3.60	oldX1 := x1;
10.86/3.60	oldX2 := x2;
10.86/3.60	assume(oldX1 <= oldX2);
10.86/3.60	x0 := oldX0;
10.86/3.60	x1 := oldX1;
10.86/3.60	x2 := oldX2;
10.86/3.60	TO: 10;
10.86/3.60	
10.86/3.60	FROM: 10;
10.86/3.60	oldX0 := x0;
10.86/3.60	oldX1 := x1;
10.86/3.60	oldX2 := x2;
10.86/3.60	oldX3 := -(1 - oldX1);
10.86/3.60	assume(0 = 0 && oldX3 = oldX1 - 1);
10.86/3.60	x0 := oldX0;
10.86/3.60	x1 := -(1 - oldX1);
10.86/3.60	x2 := oldX2;
10.86/3.60	TO: 11;
10.86/3.60	
10.86/3.60	FROM: 4;
10.86/3.60	oldX0 := x0;
10.86/3.60	oldX1 := x1;
10.86/3.60	oldX2 := x2;
10.86/3.60	assume(oldX1 >= 0);
10.86/3.60	x0 := oldX0;
10.86/3.60	x1 := oldX1;
10.86/3.60	x2 := oldX2;
10.86/3.60	TO: 5;
10.86/3.60	
10.86/3.60	FROM: 11;
10.86/3.60	oldX0 := x0;
10.86/3.60	oldX1 := x1;
10.86/3.60	oldX2 := x2;
10.86/3.60	assume(0 = 0);
10.86/3.60	x0 := oldX0;
10.86/3.60	x1 := oldX1;
10.86/3.60	x2 := oldX2;
10.86/3.60	TO: 4;
10.86/3.60	
10.86/3.60	FROM: 4;
10.86/3.60	oldX0 := x0;
10.86/3.60	oldX1 := x1;
10.86/3.60	oldX2 := x2;
10.86/3.60	assume(oldX1 < 0);
10.86/3.60	x0 := oldX0;
10.86/3.60	x1 := oldX1;
10.86/3.60	x2 := oldX2;
10.86/3.60	TO: 12;
10.86/3.60	
10.86/3.60	
10.86/3.60	----------------------------------------
10.86/3.60	
10.86/3.60	(5) T2 (EQUIVALENT)
10.86/3.60	Initially, performed program simplifications using lexicographic rank functions:
10.86/3.60	 * Removed transitions 9, 14, 17, 18 using the following rank functions:
10.86/3.60	    - Rank function 1:
10.86/3.60	      RF for loc. 8: 2*x1
10.86/3.60	      RF for loc. 9: 2*x1
10.86/3.60	      RF for loc. 13: 1+2*x1
10.86/3.60	      Bound for (chained) transitions 17: 1
10.86/3.60	    - Rank function 2:
10.86/3.60	      RF for loc. 8: 2*x1
10.86/3.60	      RF for loc. 9: 2*x1
10.86/3.60	      RF for loc. 13: 1+2*x1
10.86/3.60	      Bound for (chained) transitions 18: 1
10.86/3.60	    - Rank function 3:
10.86/3.60	      RF for loc. 8: 0
10.86/3.60	      RF for loc. 9: 0
10.86/3.60	      RF for loc. 13: -1
10.86/3.60	      Bound for (chained) transitions 9, 14: 0
10.86/3.60	Used the following cutpoint-specific lexicographic rank functions:
10.86/3.61	 * For cutpoint 8, used the following rank functions/bounds (in descending priority order):
10.86/3.61	    - RF -x2+oldX1, bound 1
10.86/3.61	
10.86/3.61	----------------------------------------
10.86/3.61	
10.86/3.61	(6)
10.86/3.61	YES
10.98/3.68	EOF