10.89/3.67	NO
10.89/3.68	proof of /export/starexec/sandbox/benchmark/theBenchmark.c
10.89/3.68	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
10.89/3.68	
10.89/3.68	
10.89/3.68	Termination of the given C Problem could be disproven:
10.89/3.68	
10.89/3.68	(0) C Problem
10.89/3.68	(1) CToIRSProof [EQUIVALENT, 0 ms]
10.89/3.68	(2) IntTRS
10.89/3.68	(3) IRS2T2 [EQUIVALENT, 0 ms]
10.89/3.68	(4) T2IntSys
10.89/3.68	(5) T2 [COMPLETE, 1774 ms]
10.89/3.68	(6) NO
10.89/3.68	
10.89/3.68	
10.89/3.68	----------------------------------------
10.89/3.68	
10.89/3.68	(0)
10.89/3.68	Obligation:
10.89/3.68	c file /export/starexec/sandbox/benchmark/theBenchmark.c
10.89/3.68	----------------------------------------
10.89/3.68	
10.89/3.68	(1) CToIRSProof (EQUIVALENT)
10.89/3.68	Parsed C Integer Program as IRS.
10.89/3.68	----------------------------------------
10.89/3.68	
10.89/3.68	(2)
10.89/3.68	Obligation:
10.89/3.68	Rules:
10.89/3.68	f1(x, y) -> f2(x_1, y) :|: TRUE
10.89/3.68	f2(x1, x2) -> f3(x1, x3) :|: TRUE
10.89/3.68	f4(x4, x5) -> f5(arith, x5) :|: TRUE && arith = 10 * x5 - 2 * x4
10.89/3.68	f3(x6, x7) -> f4(x6, x7) :|: x6 > 0 && x7 > 0
10.89/3.68	f5(x8, x9) -> f3(x8, x9) :|: TRUE
10.89/3.68	f3(x10, x11) -> f6(x10, x11) :|: x10 <= 0
10.89/3.68	f3(x12, x13) -> f6(x12, x13) :|: x13 <= 0
10.89/3.68	Start term: f1(x, y)
10.89/3.68	
10.89/3.68	----------------------------------------
10.89/3.68	
10.89/3.68	(3) IRS2T2 (EQUIVALENT)
10.89/3.68	Transformed input IRS into an integer transition system.Used the following mapping from defined symbols to location IDs:
10.89/3.68	
10.89/3.68	   (f1_2,1)
10.89/3.68	   (f2_2,2)
10.89/3.68	   (f3_2,3)
10.89/3.68	   (f4_2,4)
10.89/3.68	   (f5_2,5)
10.89/3.68	   (f6_2,6)
10.89/3.68	
10.89/3.68	----------------------------------------
10.89/3.68	
10.89/3.68	(4)
10.89/3.68	Obligation:
10.89/3.68	START: 1;
10.89/3.68	
10.89/3.68	FROM: 1;
10.89/3.68	oldX0 := x0;
10.89/3.68	oldX1 := x1;
10.89/3.68	oldX2 := nondet();
10.89/3.68	assume(0 = 0);
10.89/3.68	x0 := oldX2;
10.89/3.68	x1 := oldX1;
10.89/3.68	TO: 2;
10.89/3.68	
10.89/3.68	FROM: 2;
10.89/3.68	oldX0 := x0;
10.89/3.68	oldX1 := x1;
10.89/3.68	oldX2 := nondet();
10.89/3.68	assume(0 = 0);
10.89/3.68	x0 := oldX0;
10.89/3.68	x1 := oldX2;
10.89/3.68	TO: 3;
10.89/3.68	
10.89/3.68	FROM: 4;
10.89/3.68	oldX0 := x0;
10.89/3.68	oldX1 := x1;
10.89/3.68	oldX2 := nondet();
10.89/3.68	assume(0 = 0 && oldX2 = 10 * oldX1 - 2 * oldX0);
10.89/3.68	x0 := oldX2;
10.89/3.68	x1 := oldX1;
10.89/3.68	TO: 5;
10.89/3.68	
10.89/3.68	FROM: 3;
10.89/3.68	oldX0 := x0;
10.89/3.68	oldX1 := x1;
10.89/3.68	assume(oldX0 > 0 && oldX1 > 0);
10.89/3.68	x0 := oldX0;
10.89/3.68	x1 := oldX1;
10.89/3.68	TO: 4;
10.89/3.68	
10.89/3.68	FROM: 5;
10.89/3.68	oldX0 := x0;
10.89/3.68	oldX1 := x1;
10.89/3.68	assume(0 = 0);
10.89/3.68	x0 := oldX0;
10.89/3.68	x1 := oldX1;
10.89/3.68	TO: 3;
10.89/3.68	
10.89/3.68	FROM: 3;
10.89/3.68	oldX0 := x0;
10.89/3.68	oldX1 := x1;
10.89/3.68	assume(oldX0 <= 0);
10.89/3.68	x0 := oldX0;
10.89/3.68	x1 := oldX1;
10.89/3.68	TO: 6;
10.89/3.68	
10.89/3.68	FROM: 3;
10.89/3.68	oldX0 := x0;
10.89/3.68	oldX1 := x1;
10.89/3.68	assume(oldX1 <= 0);
10.89/3.68	x0 := oldX0;
10.89/3.68	x1 := oldX1;
10.89/3.68	TO: 6;
10.89/3.68	
10.89/3.68	
10.89/3.68	----------------------------------------
10.89/3.68	
10.89/3.68	(5) T2 (COMPLETE)
10.89/3.68	Found this recurrent set for cutpoint 6: oldX2 == 10 and x0 == 10 and x1 == 3
10.89/3.68	
10.89/3.68	----------------------------------------
10.89/3.68	
10.89/3.68	(6)
10.89/3.68	NO
11.24/3.72	EOF