9.25/3.14	YES
9.25/3.15	proof of /export/starexec/sandbox/benchmark/theBenchmark.c
9.25/3.15	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
9.25/3.15	
9.25/3.15	
9.25/3.15	Termination of the given C Problem could be proven:
9.25/3.15	
9.25/3.15	(0) C Problem
9.25/3.15	(1) CToIRSProof [EQUIVALENT, 0 ms]
9.25/3.15	(2) IntTRS
9.25/3.15	(3) IRS2T2 [EQUIVALENT, 0 ms]
9.25/3.15	(4) T2IntSys
9.25/3.15	(5) T2 [EQUIVALENT, 1284 ms]
9.25/3.15	(6) YES
9.25/3.15	
9.25/3.15	
9.25/3.15	----------------------------------------
9.25/3.15	
9.25/3.15	(0)
9.25/3.15	Obligation:
9.25/3.15	c file /export/starexec/sandbox/benchmark/theBenchmark.c
9.25/3.15	----------------------------------------
9.25/3.15	
9.25/3.15	(1) CToIRSProof (EQUIVALENT)
9.25/3.15	Parsed C Integer Program as IRS.
9.25/3.15	----------------------------------------
9.25/3.15	
9.25/3.15	(2)
9.25/3.15	Obligation:
9.25/3.15	Rules:
9.25/3.15	f1(x, y, n) -> f2(x, y, x_1) :|: TRUE
9.25/3.15	f2(x1, x2, x3) -> f3(x4, x2, x3) :|: TRUE
9.25/3.15	f3(x5, x6, x7) -> f4(x5, x8, x7) :|: TRUE
9.25/3.15	f6(x9, x10, x11) -> f7(x9, arith, x11) :|: TRUE && arith = x10 - 1
9.25/3.15	f5(x12, x13, x14) -> f6(x12, x13, x14) :|: x13 >= 0 && x15 < 0
9.25/3.15	f5(x49, x50, x51) -> f6(x49, x50, x51) :|: x50 >= 0 && x52 > 0
9.25/3.15	f7(x16, x17, x18) -> f5(x16, x17, x18) :|: TRUE
9.25/3.15	f5(x19, x20, x21) -> f8(x19, x20, x21) :|: x20 < 0
9.25/3.15	f5(x53, x54, x55) -> f8(x53, x54, x55) :|: x56 = 0
9.25/3.15	f8(x57, x58, x59) -> f9(x60, x58, x59) :|: TRUE && x60 = x57 - 1
9.25/3.15	f10(x61, x62, x63) -> f11(x61, x64, x63) :|: TRUE && x64 = x62 + 1
9.25/3.15	f9(x29, x30, x31) -> f10(x29, x30, x31) :|: x30 <= x31 && x32 < 0
9.25/3.15	f9(x65, x66, x67) -> f10(x65, x66, x67) :|: x66 <= x67 && x68 > 0
9.25/3.15	f11(x33, x34, x35) -> f9(x33, x34, x35) :|: TRUE
9.25/3.15	f9(x36, x37, x38) -> f12(x36, x37, x38) :|: x37 > x38
9.25/3.15	f9(x69, x70, x71) -> f12(x69, x70, x71) :|: x72 = 0
9.25/3.15	f4(x40, x41, x42) -> f5(x40, x41, x42) :|: x40 >= 0
9.25/3.15	f12(x43, x44, x45) -> f4(x43, x44, x45) :|: TRUE
9.25/3.15	f4(x46, x47, x48) -> f13(x46, x47, x48) :|: x46 < 0
9.25/3.15	Start term: f1(x, y, n)
9.25/3.15	
9.25/3.15	----------------------------------------
9.25/3.15	
9.25/3.15	(3) IRS2T2 (EQUIVALENT)
9.25/3.15	Transformed input IRS into an integer transition system.Used the following mapping from defined symbols to location IDs:
9.25/3.15	
9.25/3.15	   (f1_3,1)
9.25/3.15	   (f2_3,2)
9.25/3.15	   (f3_3,3)
9.25/3.15	   (f4_3,4)
9.25/3.15	   (f6_3,5)
9.25/3.15	   (f7_3,6)
9.25/3.15	   (f5_3,7)
9.25/3.15	   (f8_3,8)
9.25/3.15	   (f9_3,9)
9.25/3.15	   (f10_3,10)
9.25/3.15	   (f11_3,11)
9.25/3.15	   (f12_3,12)
9.25/3.15	   (f13_3,13)
9.25/3.15	
9.25/3.15	----------------------------------------
9.25/3.15	
9.25/3.15	(4)
9.25/3.15	Obligation:
9.25/3.15	START: 1;
9.25/3.15	
9.25/3.15	FROM: 1;
9.25/3.15	oldX0 := x0;
9.25/3.15	oldX1 := x1;
9.25/3.15	oldX2 := x2;
9.25/3.15	oldX3 := nondet();
9.25/3.15	assume(0 = 0);
9.25/3.15	x0 := oldX0;
9.25/3.15	x1 := oldX1;
9.25/3.15	x2 := oldX3;
9.25/3.15	TO: 2;
9.25/3.15	
9.25/3.15	FROM: 2;
9.25/3.15	oldX0 := x0;
9.25/3.15	oldX1 := x1;
9.25/3.15	oldX2 := x2;
9.25/3.15	oldX3 := nondet();
9.25/3.15	assume(0 = 0);
9.25/3.15	x0 := oldX3;
9.25/3.15	x1 := oldX1;
9.25/3.15	x2 := oldX2;
9.25/3.15	TO: 3;
9.25/3.15	
9.25/3.15	FROM: 3;
9.25/3.15	oldX0 := x0;
9.25/3.15	oldX1 := x1;
9.25/3.15	oldX2 := x2;
9.25/3.15	oldX3 := nondet();
9.25/3.15	assume(0 = 0);
9.25/3.15	x0 := oldX0;
9.25/3.15	x1 := oldX3;
9.25/3.15	x2 := oldX2;
9.25/3.15	TO: 4;
9.25/3.15	
9.25/3.15	FROM: 5;
9.25/3.15	oldX0 := x0;
9.25/3.15	oldX1 := x1;
9.25/3.15	oldX2 := x2;
9.25/3.15	oldX3 := -(1 - oldX1);
9.25/3.15	assume(0 = 0 && oldX3 = oldX1 - 1);
9.25/3.15	x0 := oldX0;
9.25/3.15	x1 := -(1 - oldX1);
9.25/3.15	x2 := oldX2;
9.25/3.15	TO: 6;
9.25/3.15	
9.25/3.15	FROM: 7;
9.25/3.15	oldX0 := x0;
9.25/3.15	oldX1 := x1;
9.25/3.15	oldX2 := x2;
9.25/3.15	oldX3 := nondet();
9.25/3.15	assume(oldX1 >= 0 && oldX3 < 0);
9.25/3.15	x0 := oldX0;
9.25/3.15	x1 := oldX1;
9.25/3.15	x2 := oldX2;
9.25/3.15	TO: 5;
9.25/3.15	
9.25/3.15	FROM: 7;
9.25/3.15	oldX0 := x0;
9.25/3.15	oldX1 := x1;
9.25/3.15	oldX2 := x2;
9.25/3.15	oldX3 := nondet();
9.25/3.15	assume(oldX1 >= 0 && oldX3 > 0);
9.25/3.15	x0 := oldX0;
9.25/3.15	x1 := oldX1;
9.25/3.15	x2 := oldX2;
9.25/3.15	TO: 5;
9.25/3.15	
9.25/3.15	FROM: 6;
9.25/3.15	oldX0 := x0;
9.25/3.15	oldX1 := x1;
9.25/3.15	oldX2 := x2;
9.25/3.15	assume(0 = 0);
9.25/3.15	x0 := oldX0;
9.25/3.15	x1 := oldX1;
9.25/3.15	x2 := oldX2;
9.25/3.15	TO: 7;
9.25/3.15	
9.25/3.15	FROM: 7;
9.25/3.15	oldX0 := x0;
9.25/3.15	oldX1 := x1;
9.25/3.15	oldX2 := x2;
9.25/3.15	assume(oldX1 < 0);
9.25/3.15	x0 := oldX0;
9.25/3.15	x1 := oldX1;
9.25/3.15	x2 := oldX2;
9.25/3.15	TO: 8;
9.25/3.15	
9.25/3.15	FROM: 7;
9.25/3.15	oldX0 := x0;
9.25/3.15	oldX1 := x1;
9.25/3.15	oldX2 := x2;
9.25/3.15	oldX3 := -(0);
9.25/3.15	assume(oldX3 = 0);
9.25/3.15	x0 := oldX0;
9.25/3.15	x1 := oldX1;
9.25/3.15	x2 := oldX2;
9.25/3.15	TO: 8;
9.25/3.15	
9.25/3.15	FROM: 8;
9.25/3.15	oldX0 := x0;
9.25/3.15	oldX1 := x1;
9.25/3.15	oldX2 := x2;
9.25/3.15	oldX3 := -(1 - oldX0);
9.25/3.15	assume(0 = 0 && oldX3 = oldX0 - 1);
9.25/3.15	x0 := -(1 - oldX0);
9.25/3.15	x1 := oldX1;
9.25/3.15	x2 := oldX2;
9.25/3.15	TO: 9;
9.25/3.15	
9.25/3.15	FROM: 10;
9.25/3.15	oldX0 := x0;
9.25/3.15	oldX1 := x1;
9.25/3.15	oldX2 := x2;
9.25/3.15	oldX3 := -(-(oldX1 + 1));
9.25/3.15	assume(0 = 0 && oldX3 = oldX1 + 1);
9.25/3.15	x0 := oldX0;
9.25/3.15	x1 := -(-(oldX1 + 1));
9.25/3.15	x2 := oldX2;
9.25/3.15	TO: 11;
9.25/3.15	
9.25/3.15	FROM: 9;
9.25/3.15	oldX0 := x0;
9.25/3.15	oldX1 := x1;
9.25/3.15	oldX2 := x2;
9.25/3.15	oldX3 := nondet();
9.25/3.15	assume(oldX1 <= oldX2 && oldX3 < 0);
9.25/3.15	x0 := oldX0;
9.25/3.15	x1 := oldX1;
9.25/3.15	x2 := oldX2;
9.25/3.15	TO: 10;
9.25/3.15	
9.25/3.15	FROM: 9;
9.25/3.15	oldX0 := x0;
9.25/3.15	oldX1 := x1;
9.25/3.15	oldX2 := x2;
9.25/3.15	oldX3 := nondet();
9.25/3.15	assume(oldX1 <= oldX2 && oldX3 > 0);
9.25/3.15	x0 := oldX0;
9.25/3.15	x1 := oldX1;
9.25/3.15	x2 := oldX2;
9.25/3.15	TO: 10;
9.25/3.15	
9.25/3.15	FROM: 11;
9.25/3.15	oldX0 := x0;
9.25/3.15	oldX1 := x1;
9.25/3.15	oldX2 := x2;
9.25/3.15	assume(0 = 0);
9.25/3.15	x0 := oldX0;
9.25/3.15	x1 := oldX1;
9.25/3.15	x2 := oldX2;
9.25/3.15	TO: 9;
9.25/3.15	
9.25/3.15	FROM: 9;
9.25/3.15	oldX0 := x0;
9.25/3.15	oldX1 := x1;
9.25/3.15	oldX2 := x2;
9.25/3.15	assume(oldX1 > oldX2);
9.25/3.15	x0 := oldX0;
9.25/3.15	x1 := oldX1;
9.25/3.15	x2 := oldX2;
9.25/3.15	TO: 12;
9.25/3.15	
9.25/3.15	FROM: 9;
9.25/3.15	oldX0 := x0;
9.25/3.15	oldX1 := x1;
9.25/3.15	oldX2 := x2;
9.25/3.15	oldX3 := -(0);
9.25/3.15	assume(oldX3 = 0);
9.25/3.15	x0 := oldX0;
9.25/3.15	x1 := oldX1;
9.25/3.15	x2 := oldX2;
9.25/3.15	TO: 12;
9.25/3.15	
9.25/3.15	FROM: 4;
9.25/3.15	oldX0 := x0;
9.25/3.15	oldX1 := x1;
9.25/3.15	oldX2 := x2;
9.25/3.15	assume(oldX0 >= 0);
9.25/3.15	x0 := oldX0;
9.25/3.15	x1 := oldX1;
9.25/3.15	x2 := oldX2;
9.25/3.15	TO: 7;
9.25/3.15	
9.25/3.15	FROM: 12;
9.25/3.15	oldX0 := x0;
9.25/3.15	oldX1 := x1;
9.25/3.15	oldX2 := x2;
9.25/3.15	assume(0 = 0);
9.25/3.15	x0 := oldX0;
9.25/3.15	x1 := oldX1;
9.25/3.15	x2 := oldX2;
9.25/3.15	TO: 4;
9.25/3.15	
9.25/3.15	FROM: 4;
9.25/3.15	oldX0 := x0;
9.25/3.15	oldX1 := x1;
9.25/3.15	oldX2 := x2;
9.25/3.15	assume(oldX0 < 0);
9.25/3.15	x0 := oldX0;
9.25/3.15	x1 := oldX1;
9.25/3.15	x2 := oldX2;
9.25/3.15	TO: 13;
9.25/3.15	
9.25/3.15	
9.25/3.15	----------------------------------------
9.25/3.15	
9.25/3.15	(5) T2 (EQUIVALENT)
9.25/3.15	Initially, performed program simplifications using lexicographic rank functions:
9.25/3.15	 * Removed transitions 8, 9, 12, 13, 14, 15, 27, 28, 29, 32, 33, 34, 35, 47, 50, 51, 54 using the following rank functions:
9.25/3.15	    - Rank function 1:
9.25/3.15	      RF for loc. 13: 5*x0
9.25/3.15	      RF for loc. 14: 5*x0
9.25/3.15	      RF for loc. 15: -1+5*x0
9.25/3.15	      RF for loc. 16: 3+5*x0
9.25/3.15	      RF for loc. 17: 3+5*x0
9.25/3.15	      RF for loc. 18: 2+5*x0
9.25/3.15	      RF for loc. 19: 5*x0
9.25/3.15	      RF for loc. 23: 3+5*x0
9.25/3.15	      RF for loc. 27: 1+5*x0
9.25/3.15	      Bound for (chained) transitions 14: 0
9.25/3.15	      Bound for (chained) transitions 15: 0
9.25/3.15	      Bound for (chained) transitions 27: -1
9.25/3.15	      Bound for (chained) transitions 34: -2
9.25/3.15	      Bound for (chained) transitions 35: -2
9.25/3.15	      Bound for (chained) transitions 47, 54: -3
9.25/3.15	      Bound for (chained) transitions 50: 1
9.25/3.15	      Bound for (chained) transitions 51: 1
9.25/3.15	    - Rank function 2:
9.25/3.15	      RF for loc. 13: -1+3*x1
9.25/3.15	      RF for loc. 14: 1+3*x1
9.25/3.15	      RF for loc. 16: 1-3*x1+3*x2
9.25/3.15	      RF for loc. 17: -1-3*x1+3*x2
9.25/3.15	      RF for loc. 19: 3*x1
9.25/3.15	      RF for loc. 23: -3*x1+3*x2
9.25/3.15	      Bound for (chained) transitions 8: -1
9.25/3.15	      Bound for (chained) transitions 12: 0
9.25/3.15	      Bound for (chained) transitions 32: 0
9.25/3.15	      Bound for (chained) transitions 33: 0
9.25/3.15	    - Rank function 3:
9.25/3.15	      RF for loc. 13: -1
9.25/3.15	      RF for loc. 14: 1
9.25/3.15	      RF for loc. 16: 0
9.25/3.15	      RF for loc. 17: 1
9.25/3.15	      RF for loc. 19: 0
9.25/3.15	      RF for loc. 23: -1
9.25/3.15	      Bound for (chained) transitions 9: 1
9.25/3.15	      Bound for (chained) transitions 13: 0
9.25/3.15	      Bound for (chained) transitions 28: 1
9.25/3.15	      Bound for (chained) transitions 29: 0
9.25/3.15	
9.25/3.15	----------------------------------------
9.25/3.15	
9.25/3.15	(6)
9.25/3.15	YES
9.29/3.19	EOF