12.50/4.51	YES
12.50/4.53	proof of /export/starexec/sandbox/benchmark/theBenchmark.c
12.50/4.53	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
12.50/4.53	
12.50/4.53	
12.50/4.53	Termination of the given C Problem could be proven:
12.50/4.53	
12.50/4.53	(0) C Problem
12.50/4.53	(1) CToIRSProof [EQUIVALENT, 0 ms]
12.50/4.53	(2) IntTRS
12.50/4.53	(3) IRS2T2 [EQUIVALENT, 0 ms]
12.50/4.53	(4) T2IntSys
12.50/4.53	(5) T2 [EQUIVALENT, 2315 ms]
12.50/4.53	(6) YES
12.50/4.53	
12.50/4.53	
12.50/4.53	----------------------------------------
12.50/4.53	
12.50/4.53	(0)
12.50/4.53	Obligation:
12.50/4.53	c file /export/starexec/sandbox/benchmark/theBenchmark.c
12.50/4.53	----------------------------------------
12.50/4.53	
12.50/4.53	(1) CToIRSProof (EQUIVALENT)
12.50/4.53	Parsed C Integer Program as IRS.
12.50/4.53	----------------------------------------
12.50/4.53	
12.50/4.53	(2)
12.50/4.53	Obligation:
12.50/4.53	Rules:
12.50/4.53	f1(x, y, z) -> f2(x_1, y, z) :|: TRUE
12.50/4.53	f2(x1, x2, x3) -> f3(x1, x4, x3) :|: TRUE
12.50/4.53	f3(x5, x6, x7) -> f4(x5, x6, x8) :|: TRUE
12.50/4.53	f8(x9, x10, x11) -> f9(arith, x10, x11) :|: TRUE && arith = x9 - 1
12.50/4.53	f10(x51, x52, x53) -> f11(x54, x52, x53) :|: TRUE && x54 = x51 + 1
12.50/4.53	f11(x55, x56, x57) -> f12(x55, x56, x58) :|: TRUE && x58 = x57 - 1
12.50/4.53	f9(x18, x19, x20) -> f10(x18, x19, x20) :|: x19 < x20
12.50/4.53	f12(x21, x22, x23) -> f9(x21, x22, x23) :|: TRUE
12.50/4.53	f9(x24, x25, x26) -> f13(x24, x25, x26) :|: x25 >= x26
12.50/4.53	f13(x59, x60, x61) -> f14(x59, x62, x61) :|: TRUE && x62 = x59 + x60
12.50/4.53	f5(x30, x31, x32) -> f8(x30, x31, x32) :|: x31 >= 1
12.50/4.53	f14(x33, x34, x35) -> f5(x33, x34, x35) :|: TRUE
12.50/4.53	f5(x36, x37, x38) -> f15(x36, x37, x38) :|: x37 < 1
12.50/4.53	f4(x39, x40, x41) -> f5(x39, x40, x41) :|: x39 <= 10000 && x39 >= 0 - 10000 && x40 <= 10000 && x41 <= 10000
12.50/4.53	f4(x42, x43, x44) -> f6(x42, x43, x44) :|: x44 > 10000
12.50/4.53	f4(x63, x64, x65) -> f6(x63, x64, x65) :|: x64 > 10000
12.50/4.53	f4(x66, x67, x68) -> f6(x66, x67, x68) :|: x66 > 10000
12.50/4.53	f4(x69, x70, x71) -> f6(x69, x70, x71) :|: x69 < 0 - 10000
12.50/4.53	f15(x45, x46, x47) -> f7(x45, x46, x47) :|: TRUE
12.50/4.53	f6(x48, x49, x50) -> f7(x48, x49, x50) :|: TRUE
12.50/4.53	Start term: f1(x, y, z)
12.50/4.53	
12.50/4.53	----------------------------------------
12.50/4.53	
12.50/4.53	(3) IRS2T2 (EQUIVALENT)
12.50/4.53	Transformed input IRS into an integer transition system.Used the following mapping from defined symbols to location IDs:
12.50/4.53	
12.50/4.53	   (f1_3,1)
12.50/4.53	   (f2_3,2)
12.50/4.53	   (f3_3,3)
12.50/4.53	   (f4_3,4)
12.50/4.53	   (f8_3,5)
12.50/4.53	   (f9_3,6)
12.50/4.53	   (f10_3,7)
12.50/4.53	   (f11_3,8)
12.50/4.53	   (f12_3,9)
12.50/4.53	   (f13_3,10)
12.50/4.53	   (f14_3,11)
12.50/4.53	   (f5_3,12)
12.50/4.53	   (f15_3,13)
12.50/4.53	   (f6_3,14)
12.50/4.53	   (f7_3,15)
12.50/4.53	
12.50/4.53	----------------------------------------
12.50/4.53	
12.50/4.53	(4)
12.50/4.53	Obligation:
12.50/4.53	START: 1;
12.50/4.53	
12.50/4.53	FROM: 1;
12.50/4.53	oldX0 := x0;
12.50/4.53	oldX1 := x1;
12.50/4.53	oldX2 := x2;
12.50/4.53	oldX3 := nondet();
12.50/4.53	assume(0 = 0);
12.50/4.53	x0 := oldX3;
12.50/4.53	x1 := oldX1;
12.50/4.53	x2 := oldX2;
12.50/4.53	TO: 2;
12.50/4.53	
12.50/4.53	FROM: 2;
12.50/4.53	oldX0 := x0;
12.50/4.53	oldX1 := x1;
12.50/4.53	oldX2 := x2;
12.50/4.53	oldX3 := nondet();
12.50/4.53	assume(0 = 0);
12.50/4.53	x0 := oldX0;
12.50/4.53	x1 := oldX3;
12.50/4.53	x2 := oldX2;
12.50/4.53	TO: 3;
12.50/4.53	
12.50/4.53	FROM: 3;
12.50/4.53	oldX0 := x0;
12.50/4.53	oldX1 := x1;
12.50/4.53	oldX2 := x2;
12.50/4.53	oldX3 := nondet();
12.50/4.53	assume(0 = 0);
12.50/4.53	x0 := oldX0;
12.50/4.53	x1 := oldX1;
12.50/4.53	x2 := oldX3;
12.50/4.53	TO: 4;
12.50/4.53	
12.50/4.53	FROM: 5;
12.50/4.53	oldX0 := x0;
12.50/4.53	oldX1 := x1;
12.50/4.53	oldX2 := x2;
12.50/4.53	oldX3 := -(1 - oldX0);
12.50/4.53	assume(0 = 0 && oldX3 = oldX0 - 1);
12.50/4.53	x0 := -(1 - oldX0);
12.50/4.53	x1 := oldX1;
12.50/4.53	x2 := oldX2;
12.50/4.53	TO: 6;
12.50/4.53	
12.50/4.53	FROM: 7;
12.50/4.53	oldX0 := x0;
12.50/4.53	oldX1 := x1;
12.50/4.53	oldX2 := x2;
12.50/4.53	oldX3 := -(-(oldX0 + 1));
12.50/4.53	assume(0 = 0 && oldX3 = oldX0 + 1);
12.50/4.53	x0 := -(-(oldX0 + 1));
12.50/4.53	x1 := oldX1;
12.50/4.53	x2 := oldX2;
12.50/4.53	TO: 8;
12.50/4.53	
12.50/4.53	FROM: 8;
12.50/4.53	oldX0 := x0;
12.50/4.53	oldX1 := x1;
12.50/4.53	oldX2 := x2;
12.50/4.53	oldX3 := -(1 - oldX2);
12.50/4.53	assume(0 = 0 && oldX3 = oldX2 - 1);
12.50/4.53	x0 := oldX0;
12.50/4.53	x1 := oldX1;
12.50/4.53	x2 := -(1 - oldX2);
12.50/4.53	TO: 9;
12.50/4.53	
12.50/4.53	FROM: 6;
12.50/4.53	oldX0 := x0;
12.50/4.53	oldX1 := x1;
12.50/4.53	oldX2 := x2;
12.50/4.53	assume(oldX1 < oldX2);
12.50/4.53	x0 := oldX0;
12.50/4.53	x1 := oldX1;
12.50/4.53	x2 := oldX2;
12.50/4.53	TO: 7;
12.50/4.53	
12.50/4.53	FROM: 9;
12.50/4.53	oldX0 := x0;
12.50/4.53	oldX1 := x1;
12.50/4.53	oldX2 := x2;
12.50/4.53	assume(0 = 0);
12.50/4.53	x0 := oldX0;
12.50/4.53	x1 := oldX1;
12.50/4.53	x2 := oldX2;
12.50/4.53	TO: 6;
12.50/4.53	
12.50/4.53	FROM: 6;
12.50/4.53	oldX0 := x0;
12.50/4.53	oldX1 := x1;
12.50/4.53	oldX2 := x2;
12.50/4.53	assume(oldX1 >= oldX2);
12.50/4.53	x0 := oldX0;
12.50/4.53	x1 := oldX1;
12.50/4.53	x2 := oldX2;
12.50/4.53	TO: 10;
12.50/4.53	
12.50/4.53	FROM: 10;
12.50/4.53	oldX0 := x0;
12.50/4.53	oldX1 := x1;
12.50/4.53	oldX2 := x2;
12.50/4.53	oldX3 := -(-(oldX0 + oldX1));
12.50/4.53	assume(0 = 0 && oldX3 = oldX0 + oldX1);
12.50/4.53	x0 := oldX0;
12.50/4.53	x1 := -(-(oldX0 + oldX1));
12.50/4.53	x2 := oldX2;
12.50/4.53	TO: 11;
12.50/4.53	
12.50/4.53	FROM: 12;
12.50/4.53	oldX0 := x0;
12.50/4.53	oldX1 := x1;
12.50/4.53	oldX2 := x2;
12.50/4.53	assume(oldX1 >= 1);
12.50/4.53	x0 := oldX0;
12.50/4.53	x1 := oldX1;
12.50/4.53	x2 := oldX2;
12.50/4.53	TO: 5;
12.50/4.53	
12.50/4.53	FROM: 11;
12.50/4.53	oldX0 := x0;
12.50/4.53	oldX1 := x1;
12.50/4.53	oldX2 := x2;
12.50/4.53	assume(0 = 0);
12.50/4.53	x0 := oldX0;
12.50/4.53	x1 := oldX1;
12.50/4.53	x2 := oldX2;
12.50/4.53	TO: 12;
12.50/4.53	
12.50/4.53	FROM: 12;
12.50/4.53	oldX0 := x0;
12.50/4.53	oldX1 := x1;
12.50/4.53	oldX2 := x2;
12.50/4.53	assume(oldX1 < 1);
12.50/4.53	x0 := oldX0;
12.50/4.53	x1 := oldX1;
12.50/4.53	x2 := oldX2;
12.50/4.53	TO: 13;
12.50/4.53	
12.50/4.53	FROM: 4;
12.50/4.53	oldX0 := x0;
12.50/4.53	oldX1 := x1;
12.50/4.53	oldX2 := x2;
12.50/4.53	assume(oldX0 <= 10000 && oldX0 >= 0 - 10000 && oldX1 <= 10000 && oldX2 <= 10000);
12.70/4.53	x0 := oldX0;
12.70/4.53	x1 := oldX1;
12.70/4.53	x2 := oldX2;
12.70/4.53	TO: 12;
12.70/4.53	
12.70/4.53	FROM: 4;
12.70/4.53	oldX0 := x0;
12.70/4.53	oldX1 := x1;
12.70/4.53	oldX2 := x2;
12.70/4.53	assume(oldX2 > 10000);
12.70/4.53	x0 := oldX0;
12.70/4.53	x1 := oldX1;
12.70/4.53	x2 := oldX2;
12.70/4.53	TO: 14;
12.70/4.53	
12.70/4.53	FROM: 4;
12.70/4.53	oldX0 := x0;
12.70/4.53	oldX1 := x1;
12.70/4.53	oldX2 := x2;
12.70/4.53	assume(oldX1 > 10000);
12.70/4.53	x0 := oldX0;
12.70/4.53	x1 := oldX1;
12.70/4.53	x2 := oldX2;
12.70/4.53	TO: 14;
12.70/4.53	
12.70/4.53	FROM: 4;
12.70/4.53	oldX0 := x0;
12.70/4.53	oldX1 := x1;
12.70/4.53	oldX2 := x2;
12.70/4.53	assume(oldX0 > 10000);
12.70/4.53	x0 := oldX0;
12.70/4.53	x1 := oldX1;
12.70/4.53	x2 := oldX2;
12.70/4.53	TO: 14;
12.70/4.53	
12.70/4.53	FROM: 4;
12.70/4.53	oldX0 := x0;
12.70/4.53	oldX1 := x1;
12.70/4.53	oldX2 := x2;
12.70/4.53	assume(oldX0 < 0 - 10000);
12.70/4.53	x0 := oldX0;
12.70/4.53	x1 := oldX1;
12.70/4.53	x2 := oldX2;
12.70/4.53	TO: 14;
12.70/4.53	
12.70/4.53	FROM: 13;
12.70/4.53	oldX0 := x0;
12.70/4.53	oldX1 := x1;
12.70/4.53	oldX2 := x2;
12.70/4.53	assume(0 = 0);
12.70/4.53	x0 := oldX0;
12.70/4.53	x1 := oldX1;
12.70/4.53	x2 := oldX2;
12.70/4.53	TO: 15;
12.70/4.53	
12.70/4.53	FROM: 14;
12.70/4.53	oldX0 := x0;
12.70/4.53	oldX1 := x1;
12.70/4.53	oldX2 := x2;
12.70/4.53	assume(0 = 0);
12.70/4.53	x0 := oldX0;
12.70/4.53	x1 := oldX1;
12.70/4.53	x2 := oldX2;
12.70/4.53	TO: 15;
12.70/4.53	
12.70/4.53	
12.70/4.53	----------------------------------------
12.70/4.53	
12.70/4.53	(5) T2 (EQUIVALENT)
12.70/4.53	Initially, performed program simplifications using lexicographic rank functions:
12.70/4.53	 * Removed transitions 17 using the following rank functions:
12.70/4.53	    - Rank function 1:
12.70/4.53	      RF for loc. 9: 3*x2
12.70/4.53	      RF for loc. 11: 3*x2
12.70/4.53	      RF for loc. 15: 3*x2
12.70/4.53	      Bound for (chained) transitions 17: 6
12.70/4.53	Used the following cutpoint-specific lexicographic rank functions:
12.70/4.53	 * For cutpoint 9, used the following rank functions/bounds (in descending priority order):
12.70/4.53	    - RF x2-x1, bound 1
12.70/4.53	
12.70/4.53	----------------------------------------
12.70/4.53	
12.70/4.53	(6)
12.70/4.53	YES
12.70/4.57	EOF