9.36/3.21	YES
9.36/3.22	proof of /export/starexec/sandbox/benchmark/theBenchmark.c
9.36/3.22	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
9.36/3.22	
9.36/3.22	
9.36/3.22	Termination of the given C Problem could be proven:
9.36/3.22	
9.36/3.22	(0) C Problem
9.36/3.22	(1) CToIRSProof [EQUIVALENT, 0 ms]
9.36/3.22	(2) IntTRS
9.36/3.22	(3) IRS2T2 [EQUIVALENT, 0 ms]
9.36/3.22	(4) T2IntSys
9.36/3.22	(5) T2 [EQUIVALENT, 1497 ms]
9.36/3.22	(6) YES
9.36/3.22	
9.36/3.22	
9.36/3.22	----------------------------------------
9.36/3.22	
9.36/3.22	(0)
9.36/3.22	Obligation:
9.36/3.22	c file /export/starexec/sandbox/benchmark/theBenchmark.c
9.36/3.22	----------------------------------------
9.36/3.22	
9.36/3.22	(1) CToIRSProof (EQUIVALENT)
9.36/3.22	Parsed C Integer Program as IRS.
9.36/3.22	----------------------------------------
9.36/3.22	
9.36/3.22	(2)
9.36/3.22	Obligation:
9.36/3.22	Rules:
9.36/3.22	f1(i, m, n) -> f2(i, m, x_1) :|: TRUE
9.36/3.22	f2(x, x1, x2) -> f3(x, x3, x2) :|: TRUE
9.36/3.22	f4(x4, x5, x6) -> f7(x6, x5, x6) :|: TRUE
9.36/3.22	f9(x7, x8, x9) -> f12(arith, x8, x9) :|: TRUE && arith = x7 - 1
9.36/3.22	f10(x46, x47, x48) -> f13(x49, x47, x48) :|: TRUE && x49 = x46 - x47
9.36/3.22	f8(x13, x14, x15) -> f9(x13, x14, x15) :|: x13 < x14
9.36/3.22	f8(x16, x17, x18) -> f10(x16, x17, x18) :|: x16 >= x17
9.36/3.22	f12(x19, x20, x21) -> f11(x19, x20, x21) :|: TRUE
9.36/3.22	f13(x22, x23, x24) -> f11(x22, x23, x24) :|: TRUE
9.36/3.22	f7(x25, x26, x27) -> f8(x25, x26, x27) :|: x25 > 0
9.36/3.22	f11(x28, x29, x30) -> f7(x28, x29, x30) :|: TRUE
9.36/3.22	f7(x31, x32, x33) -> f14(x31, x32, x33) :|: x31 <= 0
9.36/3.22	f3(x34, x35, x36) -> f4(x34, x35, x36) :|: x35 > 0 && x36 > x35
9.36/3.22	f3(x37, x38, x39) -> f5(x37, x38, x39) :|: x38 <= 0
9.36/3.22	f3(x50, x51, x52) -> f5(x50, x51, x52) :|: x52 <= x51
9.36/3.22	f14(x40, x41, x42) -> f6(x40, x41, x42) :|: TRUE
9.36/3.22	f5(x43, x44, x45) -> f6(x43, x44, x45) :|: TRUE
9.36/3.22	Start term: f1(i, m, n)
9.36/3.22	
9.36/3.22	----------------------------------------
9.36/3.22	
9.36/3.22	(3) IRS2T2 (EQUIVALENT)
9.36/3.22	Transformed input IRS into an integer transition system.Used the following mapping from defined symbols to location IDs:
9.36/3.22	
9.36/3.22	   (f1_3,1)
9.36/3.22	   (f2_3,2)
9.36/3.22	   (f3_3,3)
9.36/3.22	   (f4_3,4)
9.36/3.22	   (f7_3,5)
9.36/3.22	   (f9_3,6)
9.36/3.22	   (f12_3,7)
9.36/3.22	   (f10_3,8)
9.36/3.22	   (f13_3,9)
9.36/3.22	   (f8_3,10)
9.36/3.22	   (f11_3,11)
9.36/3.22	   (f14_3,12)
9.36/3.22	   (f5_3,13)
9.36/3.22	   (f6_3,14)
9.36/3.22	
9.36/3.22	----------------------------------------
9.36/3.22	
9.36/3.22	(4)
9.36/3.22	Obligation:
9.36/3.22	START: 1;
9.36/3.22	
9.36/3.22	FROM: 1;
9.36/3.22	oldX0 := x0;
9.36/3.22	oldX1 := x1;
9.36/3.22	oldX2 := x2;
9.36/3.22	oldX3 := nondet();
9.36/3.22	assume(0 = 0);
9.36/3.22	x0 := oldX0;
9.36/3.22	x1 := oldX1;
9.36/3.22	x2 := oldX3;
9.36/3.22	TO: 2;
9.36/3.22	
9.36/3.22	FROM: 2;
9.36/3.22	oldX0 := x0;
9.36/3.22	oldX1 := x1;
9.36/3.22	oldX2 := x2;
9.36/3.22	oldX3 := nondet();
9.36/3.22	assume(0 = 0);
9.36/3.22	x0 := oldX0;
9.36/3.22	x1 := oldX3;
9.36/3.22	x2 := oldX2;
9.36/3.22	TO: 3;
9.36/3.22	
9.36/3.22	FROM: 4;
9.36/3.22	oldX0 := x0;
9.36/3.22	oldX1 := x1;
9.36/3.22	oldX2 := x2;
9.36/3.22	assume(0 = 0);
9.36/3.22	x0 := oldX2;
9.36/3.22	x1 := oldX1;
9.36/3.22	x2 := oldX2;
9.36/3.22	TO: 5;
9.36/3.22	
9.36/3.22	FROM: 6;
9.36/3.22	oldX0 := x0;
9.36/3.22	oldX1 := x1;
9.36/3.22	oldX2 := x2;
9.36/3.22	oldX3 := -(1 - oldX0);
9.36/3.22	assume(0 = 0 && oldX3 = oldX0 - 1);
9.36/3.22	x0 := -(1 - oldX0);
9.36/3.22	x1 := oldX1;
9.36/3.22	x2 := oldX2;
9.36/3.22	TO: 7;
9.36/3.22	
9.36/3.22	FROM: 8;
9.36/3.22	oldX0 := x0;
9.36/3.22	oldX1 := x1;
9.36/3.22	oldX2 := x2;
9.36/3.22	oldX3 := -(oldX1 - oldX0);
9.36/3.22	assume(0 = 0 && oldX3 = oldX0 - oldX1);
9.36/3.22	x0 := -(oldX1 - oldX0);
9.36/3.22	x1 := oldX1;
9.36/3.22	x2 := oldX2;
9.36/3.22	TO: 9;
9.36/3.22	
9.36/3.22	FROM: 10;
9.36/3.22	oldX0 := x0;
9.36/3.22	oldX1 := x1;
9.36/3.22	oldX2 := x2;
9.36/3.22	assume(oldX0 < oldX1);
9.36/3.22	x0 := oldX0;
9.36/3.22	x1 := oldX1;
9.36/3.22	x2 := oldX2;
9.36/3.22	TO: 6;
9.36/3.22	
9.36/3.22	FROM: 10;
9.36/3.22	oldX0 := x0;
9.36/3.22	oldX1 := x1;
9.36/3.22	oldX2 := x2;
9.36/3.22	assume(oldX0 >= oldX1);
9.36/3.22	x0 := oldX0;
9.36/3.22	x1 := oldX1;
9.36/3.22	x2 := oldX2;
9.36/3.22	TO: 8;
9.36/3.22	
9.36/3.22	FROM: 7;
9.36/3.22	oldX0 := x0;
9.36/3.22	oldX1 := x1;
9.36/3.22	oldX2 := x2;
9.36/3.22	assume(0 = 0);
9.36/3.22	x0 := oldX0;
9.36/3.22	x1 := oldX1;
9.36/3.22	x2 := oldX2;
9.36/3.22	TO: 11;
9.36/3.22	
9.36/3.22	FROM: 9;
9.36/3.22	oldX0 := x0;
9.36/3.22	oldX1 := x1;
9.36/3.22	oldX2 := x2;
9.36/3.22	assume(0 = 0);
9.36/3.22	x0 := oldX0;
9.36/3.22	x1 := oldX1;
9.36/3.22	x2 := oldX2;
9.36/3.22	TO: 11;
9.36/3.22	
9.36/3.22	FROM: 5;
9.36/3.22	oldX0 := x0;
9.36/3.22	oldX1 := x1;
9.36/3.22	oldX2 := x2;
9.36/3.22	assume(oldX0 > 0);
9.36/3.22	x0 := oldX0;
9.36/3.22	x1 := oldX1;
9.36/3.22	x2 := oldX2;
9.36/3.22	TO: 10;
9.36/3.22	
9.36/3.22	FROM: 11;
9.36/3.22	oldX0 := x0;
9.36/3.22	oldX1 := x1;
9.36/3.22	oldX2 := x2;
9.36/3.22	assume(0 = 0);
9.36/3.22	x0 := oldX0;
9.36/3.22	x1 := oldX1;
9.36/3.22	x2 := oldX2;
9.36/3.22	TO: 5;
9.36/3.22	
9.36/3.22	FROM: 5;
9.36/3.22	oldX0 := x0;
9.36/3.22	oldX1 := x1;
9.36/3.22	oldX2 := x2;
9.36/3.22	assume(oldX0 <= 0);
9.36/3.22	x0 := oldX0;
9.36/3.22	x1 := oldX1;
9.36/3.22	x2 := oldX2;
9.36/3.22	TO: 12;
9.36/3.22	
9.36/3.22	FROM: 3;
9.36/3.22	oldX0 := x0;
9.36/3.22	oldX1 := x1;
9.36/3.22	oldX2 := x2;
9.36/3.22	assume(oldX1 > 0 && oldX2 > oldX1);
9.36/3.22	x0 := oldX0;
9.36/3.22	x1 := oldX1;
9.36/3.22	x2 := oldX2;
9.36/3.22	TO: 4;
9.36/3.22	
9.36/3.22	FROM: 3;
9.36/3.22	oldX0 := x0;
9.36/3.22	oldX1 := x1;
9.36/3.22	oldX2 := x2;
9.36/3.22	assume(oldX1 <= 0);
9.36/3.22	x0 := oldX0;
9.36/3.22	x1 := oldX1;
9.36/3.22	x2 := oldX2;
9.36/3.22	TO: 13;
9.36/3.22	
9.36/3.22	FROM: 3;
9.36/3.22	oldX0 := x0;
9.36/3.22	oldX1 := x1;
9.36/3.22	oldX2 := x2;
9.36/3.22	assume(oldX2 <= oldX1);
9.36/3.22	x0 := oldX0;
9.36/3.22	x1 := oldX1;
9.36/3.22	x2 := oldX2;
9.36/3.22	TO: 13;
9.36/3.22	
9.36/3.22	FROM: 12;
9.36/3.22	oldX0 := x0;
9.36/3.22	oldX1 := x1;
9.36/3.22	oldX2 := x2;
9.36/3.22	assume(0 = 0);
9.36/3.22	x0 := oldX0;
9.36/3.22	x1 := oldX1;
9.36/3.22	x2 := oldX2;
9.36/3.22	TO: 14;
9.36/3.22	
9.36/3.22	FROM: 13;
9.36/3.22	oldX0 := x0;
9.36/3.22	oldX1 := x1;
9.36/3.22	oldX2 := x2;
9.36/3.22	assume(0 = 0);
9.36/3.22	x0 := oldX0;
9.36/3.22	x1 := oldX1;
9.36/3.22	x2 := oldX2;
9.36/3.22	TO: 14;
9.36/3.22	
9.36/3.22	
9.36/3.22	----------------------------------------
9.36/3.22	
9.36/3.22	(5) T2 (EQUIVALENT)
9.36/3.22	Initially, performed program simplifications using lexicographic rank functions:
9.36/3.22	 * Removed transitions 11, 12, 13, 16, 17, 20 using the following rank functions:
9.36/3.22	    - Rank function 1:
9.36/3.22	      RF for loc. 10: 3*x0
9.36/3.22	      RF for loc. 11: 2+3*x0
9.36/3.22	      RF for loc. 13: 1+3*x0
9.36/3.22	      Bound for (chained) transitions 11: 3
9.36/3.22	      Bound for (chained) transitions 16: 4
9.36/3.22	      Bound for (chained) transitions 17: 4
9.36/3.22	    - Rank function 2:
9.36/3.22	      RF for loc. 10: 2*x0
9.36/3.22	      RF for loc. 11: oldX1
9.36/3.22	      RF for loc. 13: 0
9.36/3.22	      Bound for (chained) transitions 13, 20: 1
9.36/3.22	    - Rank function 3:
9.36/3.22	      RF for loc. 10: oldX1
9.36/3.22	      RF for loc. 11: 0
9.36/3.22	      Bound for (chained) transitions 12: 1
9.36/3.22	
9.36/3.22	----------------------------------------
9.36/3.22	
9.36/3.22	(6)
9.36/3.22	YES
9.84/3.30	EOF