15.70/5.30	YES
15.70/5.31	proof of /export/starexec/sandbox/benchmark/theBenchmark.c
15.70/5.31	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
15.70/5.31	
15.70/5.31	
15.70/5.31	Termination of the given C Problem could be proven:
15.70/5.31	
15.70/5.31	(0) C Problem
15.70/5.31	(1) CToIRSProof [EQUIVALENT, 0 ms]
15.70/5.31	(2) IntTRS
15.70/5.31	(3) IRS2T2 [EQUIVALENT, 0 ms]
15.70/5.31	(4) T2IntSys
15.70/5.31	(5) T2 [EQUIVALENT, 1779 ms]
15.70/5.31	(6) YES
15.70/5.31	
15.70/5.31	
15.70/5.31	----------------------------------------
15.70/5.31	
15.70/5.31	(0)
15.70/5.31	Obligation:
15.70/5.31	c file /export/starexec/sandbox/benchmark/theBenchmark.c
15.70/5.31	----------------------------------------
15.70/5.31	
15.70/5.31	(1) CToIRSProof (EQUIVALENT)
15.70/5.31	Parsed C Integer Program as IRS.
15.70/5.31	----------------------------------------
15.70/5.31	
15.70/5.31	(2)
15.70/5.31	Obligation:
15.70/5.31	Rules:
15.70/5.31	f1(x, y, ytmp, res) -> f2(x_1, y, ytmp, res) :|: TRUE
15.70/5.31	f2(x1, x2, x3, x4) -> f3(x1, x5, x3, x4) :|: TRUE
15.70/5.31	f3(x6, x7, x8, x9) -> f4(x6, x7, x8, 0) :|: TRUE
15.70/5.31	f5(x10, x11, x12, x13) -> f6(x10, x11, x11, x13) :|: TRUE
15.70/5.31	f8(x14, x15, x16, x17) -> f11(x14, x15, arith, x17) :|: TRUE && arith = x16 - 1
15.70/5.31	f11(x74, x75, x76, x77) -> f12(x78, x75, x76, x77) :|: TRUE && x78 = x74 - 1
15.70/5.31	f9(x79, x80, x81, x82) -> f13(x79, x80, x83, x82) :|: TRUE && x83 = x81 + 1
15.70/5.31	f13(x84, x85, x86, x87) -> f14(x88, x85, x86, x87) :|: TRUE && x88 = x84 + 1
15.70/5.31	f7(x30, x31, x32, x33) -> f8(x30, x31, x32, x33) :|: x32 > 0
15.70/5.31	f7(x34, x35, x36, x37) -> f9(x34, x35, x36, x37) :|: x36 <= 0
15.70/5.31	f12(x38, x39, x40, x41) -> f10(x38, x39, x40, x41) :|: TRUE
15.70/5.31	f14(x42, x43, x44, x45) -> f10(x42, x43, x44, x45) :|: TRUE
15.70/5.31	f6(x46, x47, x48, x49) -> f7(x46, x47, x48, x49) :|: x48 < 0
15.70/5.31	f6(x89, x90, x91, x92) -> f7(x89, x90, x91, x92) :|: x91 > 0
15.70/5.31	f10(x50, x51, x52, x53) -> f6(x50, x51, x52, x53) :|: TRUE
15.70/5.31	f6(x54, x55, x56, x57) -> f15(x54, x55, x56, x57) :|: x56 = 0
15.70/5.31	f15(x93, x94, x95, x96) -> f16(x93, x94, x95, x97) :|: TRUE && x97 = x96 + 1
15.70/5.31	f4(x62, x63, x64, x65) -> f5(x62, x63, x64, x65) :|: x62 >= x63 && x63 > 0
15.70/5.31	f16(x66, x67, x68, x69) -> f4(x66, x67, x68, x69) :|: TRUE
15.70/5.31	f4(x70, x71, x72, x73) -> f17(x70, x71, x72, x73) :|: x70 < x71
15.70/5.31	f4(x98, x99, x100, x101) -> f17(x98, x99, x100, x101) :|: x99 <= 0
15.70/5.31	Start term: f1(x, y, ytmp, res)
15.70/5.31	
15.70/5.31	----------------------------------------
15.70/5.31	
15.70/5.31	(3) IRS2T2 (EQUIVALENT)
15.70/5.31	Transformed input IRS into an integer transition system.Used the following mapping from defined symbols to location IDs:
15.70/5.31	
15.70/5.31	   (f1_4,1)
15.70/5.31	   (f2_4,2)
15.70/5.31	   (f3_4,3)
15.70/5.31	   (f4_4,4)
15.70/5.31	   (f5_4,5)
15.70/5.31	   (f6_4,6)
15.70/5.31	   (f8_4,7)
15.70/5.31	   (f11_4,8)
15.70/5.31	   (f12_4,9)
15.70/5.31	   (f9_4,10)
15.70/5.31	   (f13_4,11)
15.70/5.31	   (f14_4,12)
15.70/5.31	   (f7_4,13)
15.70/5.31	   (f10_4,14)
15.70/5.31	   (f15_4,15)
15.70/5.31	   (f16_4,16)
15.70/5.31	   (f17_4,17)
15.70/5.31	
15.70/5.31	----------------------------------------
15.70/5.31	
15.70/5.31	(4)
15.70/5.31	Obligation:
15.70/5.31	START: 1;
15.70/5.31	
15.70/5.31	FROM: 1;
15.70/5.31	oldX0 := x0;
15.70/5.31	oldX1 := x1;
15.70/5.31	oldX2 := x2;
15.70/5.31	oldX3 := x3;
15.70/5.31	oldX4 := nondet();
15.70/5.31	assume(0 = 0);
15.70/5.31	x0 := oldX4;
15.70/5.31	x1 := oldX1;
15.70/5.31	x2 := oldX2;
15.70/5.31	x3 := oldX3;
15.70/5.31	TO: 2;
15.70/5.31	
15.70/5.31	FROM: 2;
15.70/5.31	oldX0 := x0;
15.70/5.31	oldX1 := x1;
15.70/5.31	oldX2 := x2;
15.70/5.31	oldX3 := x3;
15.70/5.31	oldX4 := nondet();
15.70/5.31	assume(0 = 0);
15.70/5.31	x0 := oldX0;
15.70/5.31	x1 := oldX4;
15.70/5.31	x2 := oldX2;
15.70/5.31	x3 := oldX3;
15.70/5.31	TO: 3;
15.70/5.31	
15.70/5.31	FROM: 3;
15.70/5.31	oldX0 := x0;
15.70/5.31	oldX1 := x1;
15.70/5.31	oldX2 := x2;
15.70/5.31	oldX3 := x3;
15.70/5.31	assume(0 = 0);
15.70/5.31	x0 := oldX0;
15.70/5.31	x1 := oldX1;
15.70/5.31	x2 := oldX2;
15.70/5.31	x3 := 0;
15.70/5.31	TO: 4;
15.70/5.31	
15.70/5.31	FROM: 5;
15.70/5.31	oldX0 := x0;
15.70/5.31	oldX1 := x1;
15.70/5.31	oldX2 := x2;
15.70/5.31	oldX3 := x3;
15.70/5.31	assume(0 = 0);
15.70/5.31	x0 := oldX0;
15.70/5.31	x1 := oldX1;
15.70/5.31	x2 := oldX1;
15.70/5.31	x3 := oldX3;
15.70/5.31	TO: 6;
15.70/5.31	
15.70/5.31	FROM: 7;
15.70/5.31	oldX0 := x0;
15.70/5.31	oldX1 := x1;
15.70/5.31	oldX2 := x2;
15.70/5.31	oldX3 := x3;
15.70/5.31	oldX4 := -(1 - oldX2);
15.70/5.31	assume(0 = 0 && oldX4 = oldX2 - 1);
15.70/5.31	x0 := oldX0;
15.70/5.31	x1 := oldX1;
15.70/5.31	x2 := -(1 - oldX2);
15.70/5.31	x3 := oldX3;
15.70/5.31	TO: 8;
15.70/5.31	
15.70/5.31	FROM: 8;
15.70/5.31	oldX0 := x0;
15.70/5.31	oldX1 := x1;
15.70/5.31	oldX2 := x2;
15.70/5.31	oldX3 := x3;
15.70/5.31	oldX4 := -(1 - oldX0);
15.70/5.31	assume(0 = 0 && oldX4 = oldX0 - 1);
15.70/5.31	x0 := -(1 - oldX0);
15.70/5.31	x1 := oldX1;
15.70/5.31	x2 := oldX2;
15.70/5.31	x3 := oldX3;
15.70/5.31	TO: 9;
15.70/5.31	
15.70/5.31	FROM: 10;
15.70/5.31	oldX0 := x0;
15.70/5.31	oldX1 := x1;
15.70/5.31	oldX2 := x2;
15.70/5.31	oldX3 := x3;
15.70/5.31	oldX4 := -(-(oldX2 + 1));
15.70/5.31	assume(0 = 0 && oldX4 = oldX2 + 1);
15.70/5.31	x0 := oldX0;
15.70/5.31	x1 := oldX1;
15.70/5.31	x2 := -(-(oldX2 + 1));
15.70/5.31	x3 := oldX3;
15.70/5.31	TO: 11;
15.70/5.31	
15.70/5.31	FROM: 11;
15.70/5.31	oldX0 := x0;
15.70/5.31	oldX1 := x1;
15.70/5.31	oldX2 := x2;
15.70/5.31	oldX3 := x3;
15.70/5.31	oldX4 := -(-(oldX0 + 1));
15.70/5.31	assume(0 = 0 && oldX4 = oldX0 + 1);
15.70/5.31	x0 := -(-(oldX0 + 1));
15.70/5.31	x1 := oldX1;
15.70/5.31	x2 := oldX2;
15.70/5.31	x3 := oldX3;
15.70/5.31	TO: 12;
15.70/5.31	
15.70/5.31	FROM: 13;
15.70/5.31	oldX0 := x0;
15.70/5.31	oldX1 := x1;
15.70/5.31	oldX2 := x2;
15.70/5.31	oldX3 := x3;
15.70/5.31	assume(oldX2 > 0);
15.70/5.31	x0 := oldX0;
15.70/5.31	x1 := oldX1;
15.70/5.31	x2 := oldX2;
15.70/5.31	x3 := oldX3;
15.70/5.31	TO: 7;
15.70/5.31	
15.70/5.31	FROM: 13;
15.70/5.31	oldX0 := x0;
15.70/5.31	oldX1 := x1;
15.70/5.31	oldX2 := x2;
15.70/5.31	oldX3 := x3;
15.70/5.31	assume(oldX2 <= 0);
15.70/5.31	x0 := oldX0;
15.70/5.31	x1 := oldX1;
15.70/5.31	x2 := oldX2;
15.70/5.31	x3 := oldX3;
15.70/5.31	TO: 10;
15.70/5.31	
15.70/5.31	FROM: 9;
15.70/5.31	oldX0 := x0;
15.70/5.31	oldX1 := x1;
15.70/5.31	oldX2 := x2;
15.70/5.31	oldX3 := x3;
15.70/5.31	assume(0 = 0);
15.70/5.31	x0 := oldX0;
15.70/5.31	x1 := oldX1;
15.70/5.31	x2 := oldX2;
15.70/5.31	x3 := oldX3;
15.70/5.31	TO: 14;
15.70/5.31	
15.70/5.31	FROM: 12;
15.70/5.31	oldX0 := x0;
15.70/5.31	oldX1 := x1;
15.70/5.31	oldX2 := x2;
15.70/5.31	oldX3 := x3;
15.70/5.31	assume(0 = 0);
15.70/5.31	x0 := oldX0;
15.70/5.31	x1 := oldX1;
15.70/5.31	x2 := oldX2;
15.70/5.31	x3 := oldX3;
15.70/5.31	TO: 14;
15.70/5.31	
15.70/5.31	FROM: 6;
15.70/5.31	oldX0 := x0;
15.70/5.31	oldX1 := x1;
15.70/5.31	oldX2 := x2;
15.70/5.31	oldX3 := x3;
15.70/5.31	assume(oldX2 < 0);
15.70/5.31	x0 := oldX0;
15.70/5.31	x1 := oldX1;
15.70/5.31	x2 := oldX2;
15.70/5.31	x3 := oldX3;
15.70/5.31	TO: 13;
15.70/5.31	
15.70/5.31	FROM: 6;
15.70/5.31	oldX0 := x0;
15.70/5.31	oldX1 := x1;
15.70/5.31	oldX2 := x2;
15.70/5.31	oldX3 := x3;
15.70/5.31	assume(oldX2 > 0);
15.70/5.31	x0 := oldX0;
15.70/5.31	x1 := oldX1;
15.70/5.31	x2 := oldX2;
15.70/5.31	x3 := oldX3;
15.70/5.31	TO: 13;
15.70/5.31	
15.70/5.31	FROM: 14;
15.70/5.31	oldX0 := x0;
15.70/5.31	oldX1 := x1;
15.70/5.31	oldX2 := x2;
15.70/5.31	oldX3 := x3;
15.70/5.31	assume(0 = 0);
15.70/5.31	x0 := oldX0;
15.70/5.31	x1 := oldX1;
15.70/5.31	x2 := oldX2;
15.70/5.31	x3 := oldX3;
15.70/5.31	TO: 6;
15.70/5.31	
15.70/5.31	FROM: 6;
15.70/5.31	oldX0 := x0;
15.70/5.31	oldX1 := x1;
15.70/5.31	oldX2 := x2;
15.70/5.31	oldX3 := x3;
15.70/5.31	assume(oldX2 = 0);
15.70/5.31	x0 := oldX0;
15.70/5.31	x1 := oldX1;
15.70/5.31	x2 := oldX2;
15.70/5.31	x3 := oldX3;
15.70/5.31	TO: 15;
15.70/5.31	
15.70/5.31	FROM: 15;
15.70/5.31	oldX0 := x0;
15.70/5.31	oldX1 := x1;
15.70/5.31	oldX2 := x2;
15.70/5.31	oldX3 := x3;
15.70/5.31	oldX4 := -(-(oldX3 + 1));
15.70/5.31	assume(0 = 0 && oldX4 = oldX3 + 1);
15.70/5.31	x0 := oldX0;
15.70/5.31	x1 := oldX1;
15.70/5.31	x2 := oldX2;
15.70/5.31	x3 := -(-(oldX3 + 1));
15.70/5.31	TO: 16;
15.70/5.31	
15.70/5.31	FROM: 4;
15.70/5.31	oldX0 := x0;
15.70/5.31	oldX1 := x1;
15.70/5.31	oldX2 := x2;
15.70/5.31	oldX3 := x3;
15.70/5.31	assume(oldX0 >= oldX1 && oldX1 > 0);
15.70/5.31	x0 := oldX0;
15.70/5.31	x1 := oldX1;
15.70/5.31	x2 := oldX2;
15.70/5.31	x3 := oldX3;
15.70/5.31	TO: 5;
15.70/5.31	
15.70/5.31	FROM: 16;
15.70/5.31	oldX0 := x0;
15.70/5.31	oldX1 := x1;
15.70/5.31	oldX2 := x2;
15.70/5.31	oldX3 := x3;
15.70/5.31	assume(0 = 0);
15.70/5.31	x0 := oldX0;
15.70/5.31	x1 := oldX1;
15.70/5.31	x2 := oldX2;
15.70/5.31	x3 := oldX3;
15.70/5.31	TO: 4;
15.70/5.31	
15.70/5.31	FROM: 4;
15.70/5.31	oldX0 := x0;
15.70/5.31	oldX1 := x1;
15.70/5.31	oldX2 := x2;
15.70/5.31	oldX3 := x3;
15.70/5.31	assume(oldX0 < oldX1);
15.70/5.31	x0 := oldX0;
15.70/5.31	x1 := oldX1;
15.70/5.31	x2 := oldX2;
15.70/5.31	x3 := oldX3;
15.70/5.31	TO: 17;
15.70/5.31	
15.70/5.31	FROM: 4;
15.70/5.31	oldX0 := x0;
15.70/5.31	oldX1 := x1;
15.70/5.31	oldX2 := x2;
15.70/5.31	oldX3 := x3;
15.70/5.31	assume(oldX1 <= 0);
15.70/5.31	x0 := oldX0;
15.70/5.31	x1 := oldX1;
15.70/5.31	x2 := oldX2;
15.70/5.31	x3 := oldX3;
15.70/5.31	TO: 17;
15.70/5.31	
15.70/5.31	
15.70/5.31	----------------------------------------
15.70/5.31	
15.70/5.31	(5) T2 (EQUIVALENT)
15.70/5.31	Initially, performed program simplifications using lexicographic rank functions:
15.70/5.31	 * Removed transitions 16, 25, 29, 30 using the following rank functions:
15.70/5.31	    - Rank function 1:
15.70/5.31	      RF for loc. 10: 1+2*x0-2*x2
15.70/5.31	      RF for loc. 11: 1+2*x0-2*x2
15.70/5.31	      RF for loc. 12: 1+2*x0-2*x2
15.70/5.31	      RF for loc. 13: 1+2*x0-2*x2
15.70/5.31	      RF for loc. 17: 2*x0
15.70/5.31	      Bound for (chained) transitions 29: 2
15.70/5.31	      Bound for (chained) transitions 30: 2
15.70/5.31	    - Rank function 2:
15.70/5.31	      RF for loc. 10: 0
15.70/5.31	      RF for loc. 11: 0
15.70/5.31	      RF for loc. 12: 0
15.70/5.31	      RF for loc. 13: 0
15.70/5.31	      RF for loc. 17: -1
15.70/5.31	      Bound for (chained) transitions 16, 25: 0
15.70/5.31	Used the following cutpoint-specific lexicographic rank functions:
15.70/5.31	 * For cutpoint 12, used the following rank functions/bounds (in descending priority order):
15.70/5.31	    - RF x2, bound 1
15.70/5.31	
15.70/5.31	----------------------------------------
15.70/5.31	
15.70/5.31	(6)
15.70/5.31	YES
16.04/5.44	EOF