10.13/3.39	YES
10.13/3.41	proof of /export/starexec/sandbox/benchmark/theBenchmark.c
10.13/3.41	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
10.13/3.41	
10.13/3.41	
10.13/3.41	Termination of the given C Problem could be proven:
10.13/3.41	
10.13/3.41	(0) C Problem
10.13/3.41	(1) CToIRSProof [EQUIVALENT, 0 ms]
10.13/3.41	(2) IntTRS
10.13/3.41	(3) IRS2T2 [EQUIVALENT, 0 ms]
10.13/3.41	(4) T2IntSys
10.13/3.41	(5) T2 [EQUIVALENT, 1463 ms]
10.13/3.41	(6) YES
10.13/3.41	
10.13/3.41	
10.13/3.41	----------------------------------------
10.13/3.41	
10.13/3.41	(0)
10.13/3.41	Obligation:
10.13/3.41	c file /export/starexec/sandbox/benchmark/theBenchmark.c
10.13/3.41	----------------------------------------
10.13/3.41	
10.13/3.41	(1) CToIRSProof (EQUIVALENT)
10.13/3.41	Parsed C Integer Program as IRS.
10.13/3.41	----------------------------------------
10.13/3.41	
10.13/3.41	(2)
10.13/3.41	Obligation:
10.13/3.41	Rules:
10.13/3.41	f1(x, y) -> f2(x_1, y) :|: TRUE
10.13/3.41	f2(x1, x2) -> f3(x1, x3) :|: TRUE
10.13/3.41	f4(x4, x5) -> f5(x5, x5) :|: TRUE
10.13/3.41	f5(x6, x7) -> f6(x6, arith) :|: TRUE && arith = x7 - 1
10.13/3.41	f3(x8, x9) -> f4(x8, x9) :|: x8 > 0
10.13/3.41	f6(x10, x11) -> f3(x10, x11) :|: TRUE
10.13/3.41	f3(x12, x13) -> f7(x12, x13) :|: x12 <= 0
10.13/3.41	Start term: f1(x, y)
10.13/3.41	
10.13/3.41	----------------------------------------
10.13/3.41	
10.13/3.41	(3) IRS2T2 (EQUIVALENT)
10.13/3.41	Transformed input IRS into an integer transition system.Used the following mapping from defined symbols to location IDs:
10.13/3.41	
10.13/3.41	   (f1_2,1)
10.13/3.41	   (f2_2,2)
10.13/3.41	   (f3_2,3)
10.13/3.41	   (f4_2,4)
10.13/3.41	   (f5_2,5)
10.13/3.41	   (f6_2,6)
10.13/3.41	   (f7_2,7)
10.13/3.41	
10.13/3.41	----------------------------------------
10.13/3.41	
10.13/3.41	(4)
10.13/3.41	Obligation:
10.13/3.41	START: 1;
10.13/3.41	
10.13/3.41	FROM: 1;
10.13/3.41	oldX0 := x0;
10.13/3.41	oldX1 := x1;
10.13/3.41	oldX2 := nondet();
10.13/3.41	assume(0 = 0);
10.13/3.41	x0 := oldX2;
10.13/3.41	x1 := oldX1;
10.13/3.41	TO: 2;
10.13/3.41	
10.13/3.41	FROM: 2;
10.13/3.41	oldX0 := x0;
10.13/3.41	oldX1 := x1;
10.13/3.41	oldX2 := nondet();
10.13/3.41	assume(0 = 0);
10.13/3.41	x0 := oldX0;
10.13/3.41	x1 := oldX2;
10.13/3.41	TO: 3;
10.13/3.41	
10.13/3.41	FROM: 4;
10.13/3.41	oldX0 := x0;
10.13/3.41	oldX1 := x1;
10.13/3.41	assume(0 = 0);
10.13/3.41	x0 := oldX1;
10.13/3.41	x1 := oldX1;
10.13/3.41	TO: 5;
10.13/3.41	
10.13/3.41	FROM: 5;
10.13/3.41	oldX0 := x0;
10.13/3.41	oldX1 := x1;
10.13/3.41	oldX2 := -(1 - oldX1);
10.13/3.41	assume(0 = 0 && oldX2 = oldX1 - 1);
10.13/3.41	x0 := oldX0;
10.13/3.41	x1 := -(1 - oldX1);
10.13/3.41	TO: 6;
10.13/3.41	
10.13/3.41	FROM: 3;
10.13/3.41	oldX0 := x0;
10.13/3.41	oldX1 := x1;
10.13/3.41	assume(oldX0 > 0);
10.13/3.41	x0 := oldX0;
10.13/3.41	x1 := oldX1;
10.13/3.41	TO: 4;
10.13/3.41	
10.13/3.41	FROM: 6;
10.13/3.41	oldX0 := x0;
10.13/3.41	oldX1 := x1;
10.13/3.41	assume(0 = 0);
10.13/3.41	x0 := oldX0;
10.13/3.41	x1 := oldX1;
10.13/3.41	TO: 3;
10.13/3.41	
10.13/3.41	FROM: 3;
10.13/3.41	oldX0 := x0;
10.13/3.41	oldX1 := x1;
10.13/3.41	assume(oldX0 <= 0);
10.13/3.41	x0 := oldX0;
10.13/3.41	x1 := oldX1;
10.13/3.41	TO: 7;
10.13/3.41	
10.13/3.41	
10.13/3.41	----------------------------------------
10.13/3.41	
10.13/3.41	(5) T2 (EQUIVALENT)
10.13/3.41	No proof given by T2
10.13/3.41	----------------------------------------
10.13/3.41	
10.13/3.41	(6)
10.13/3.41	YES
10.51/3.46	EOF