2.54/1.74	WORST_CASE(?, O(n^1))
2.54/1.75	proof of /export/starexec/sandbox2/output/output_files/bench.koat
2.54/1.75	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
2.54/1.75	
2.54/1.75	
2.54/1.75	The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, n^1).
2.54/1.75	
2.54/1.75	(0) CpxIntTrs
2.54/1.75	(1) Koat Proof [FINISHED, 481 ms]
2.54/1.75	(2) BOUNDS(1, n^1)
2.54/1.75	
2.54/1.75	
2.54/1.75	----------------------------------------
2.54/1.75	
2.54/1.75	(0)
2.54/1.75	Obligation:
2.54/1.75	Complexity Int TRS consisting of the following rules:
2.54/1.75	eval_foo_start(v_.0, v_.01, v_5, v_oldx, v_x) -> Com_1(eval_foo_bb0_in(v_.0, v_.01, v_5, v_oldx, v_x)) :|: TRUE
2.54/1.75	eval_foo_bb0_in(v_.0, v_.01, v_5, v_oldx, v_x) -> Com_1(eval_foo_bb1_in(v_x, v_oldx, v_5, v_oldx, v_x)) :|: TRUE
2.54/1.75	eval_foo_bb1_in(v_.0, v_.01, v_5, v_oldx, v_x) -> Com_1(eval_foo_bb2_in(v_.0, v_.01, v_5, v_oldx, v_x)) :|: v_.0 > 0 && v_.0 < 100
2.54/1.75	eval_foo_bb1_in(v_.0, v_.01, v_5, v_oldx, v_x) -> Com_1(eval_foo_.critedge_in(v_.0, v_.01, v_5, v_oldx, v_x)) :|: v_.0 <= 0
2.54/1.75	eval_foo_bb1_in(v_.0, v_.01, v_5, v_oldx, v_x) -> Com_1(eval_foo_.critedge_in(v_.0, v_.01, v_5, v_oldx, v_x)) :|: v_.0 >= 100
2.54/1.75	eval_foo_bb2_in(v_.0, v_.01, v_5, v_oldx, v_x) -> Com_1(eval_foo_bb3_in(v_.0, v_.01, v_5, v_oldx, v_x)) :|: v_.0 >= 2 * v_.01 + 10
2.54/1.75	eval_foo_bb2_in(v_.0, v_.01, v_5, v_oldx, v_x) -> Com_1(eval_foo_.critedge_in(v_.0, v_.01, v_5, v_oldx, v_x)) :|: v_.0 < 2 * v_.01 + 10
2.54/1.75	eval_foo_bb3_in(v_.0, v_.01, v_5, v_oldx, v_x) -> Com_1(eval_foo_3(v_.0, v_.01, v_5, v_oldx, v_x)) :|: TRUE
2.54/1.75	eval_foo_3(v_.0, v_.01, v_5, v_oldx, v_x) -> Com_2(eval___VERIFIER_nondet_int_start(v_.0, v_.01, v_5, v_oldx, v_x), eval_foo_4(v_.0, v_.01, nondef.0, v_oldx, v_x)) :|: TRUE
2.54/1.75	eval_foo_4(v_.0, v_.01, v_5, v_oldx, v_x) -> Com_1(eval_foo_bb1_in(v_5, v_.0, v_5, v_oldx, v_x)) :|: TRUE
2.54/1.75	eval_foo_.critedge_in(v_.0, v_.01, v_5, v_oldx, v_x) -> Com_1(eval_foo_stop(v_.0, v_.01, v_5, v_oldx, v_x)) :|: TRUE
2.54/1.75	
2.54/1.75	The start-symbols are:[eval_foo_start_5]
2.54/1.75	
2.54/1.75	
2.54/1.75	----------------------------------------
2.54/1.75	
2.54/1.75	(1) Koat Proof (FINISHED)
2.54/1.75	YES(?, 84*ar_3 + 8257)
2.54/1.75	
2.54/1.75	
2.54/1.75	
2.54/1.75	Initial complexity problem:
2.54/1.75	
2.54/1.75	1:	T:
2.54/1.75	
2.54/1.75			(Comp: ?, Cost: 1)    evalfoostart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5))
2.54/1.75	
2.54/1.75			(Comp: ?, Cost: 1)    evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb1in(ar_1, ar_1, ar_3, ar_3, ar_4, ar_5))
2.54/1.75	
2.54/1.75			(Comp: ?, Cost: 1)    evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_0 >= 1 /\ 99 >= ar_0 ]
2.54/1.75	
2.54/1.75			(Comp: ?, Cost: 1)    evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ 0 >= ar_0 ]
2.54/1.75	
2.54/1.75			(Comp: ?, Cost: 1)    evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_0 >= 100 ]
2.54/1.75	
2.54/1.75			(Comp: ?, Cost: 1)    evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_0 >= 2*ar_2 + 10 ]
2.54/1.75	
2.54/1.75			(Comp: ?, Cost: 1)    evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ 2*ar_2 + 9 >= ar_0 ]
2.54/1.75	
2.54/1.75			(Comp: ?, Cost: 1)    evalfoobb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoo3(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5))
2.54/1.75	
2.54/1.75			(Comp: ?, Cost: 1)    evalfoo30(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalVERIFIERnondetintstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5))
2.54/1.75	
2.54/1.75			(Comp: ?, Cost: 1)    evalfoo31(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoo4(ar_0, ar_1, ar_2, ar_3, ar_5, ar_5))
2.54/1.75	
2.54/1.75			(Comp: ?, Cost: 1)    evalfoo3(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_2(evalfoo30(ar_0, ar_1, ar_2, ar_3, ar_4, g), evalfoo31(ar_0, ar_1, ar_2, ar_3, ar_4, g))
2.54/1.75	
2.54/1.75			(Comp: ?, Cost: 1)    evalfoo4(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb1in(ar_4, ar_1, ar_0, ar_3, ar_4, ar_5))
2.54/1.75	
2.54/1.75			(Comp: ?, Cost: 1)    evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoostop(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5))
2.54/1.75	
2.54/1.75			(Comp: 1, Cost: 0)    koat_start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoostart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ 0 <= 0 ]
2.54/1.75	
2.54/1.75		start location:	koat_start
2.54/1.75	
2.54/1.75		leaf cost:	0
2.54/1.75	
2.54/1.75	
2.54/1.75	
2.54/1.75	Repeatedly propagating knowledge in problem 1 produces the following problem:
2.64/1.75	
2.64/1.75	2:	T:
2.64/1.75	
2.64/1.75			(Comp: 1, Cost: 1)    evalfoostart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5))
2.64/1.75	
2.64/1.75			(Comp: 1, Cost: 1)    evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb1in(ar_1, ar_1, ar_3, ar_3, ar_4, ar_5))
2.64/1.75	
2.64/1.75			(Comp: ?, Cost: 1)    evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_0 >= 1 /\ 99 >= ar_0 ]
2.64/1.75	
2.64/1.75			(Comp: ?, Cost: 1)    evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ 0 >= ar_0 ]
2.64/1.75	
2.64/1.75			(Comp: ?, Cost: 1)    evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_0 >= 100 ]
2.64/1.75	
2.64/1.75			(Comp: ?, Cost: 1)    evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_0 >= 2*ar_2 + 10 ]
2.64/1.75	
2.64/1.75			(Comp: ?, Cost: 1)    evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ 2*ar_2 + 9 >= ar_0 ]
2.64/1.75	
2.64/1.75			(Comp: ?, Cost: 1)    evalfoobb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoo3(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5))
2.64/1.75	
2.64/1.75			(Comp: ?, Cost: 1)    evalfoo30(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalVERIFIERnondetintstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5))
2.64/1.75	
2.64/1.75			(Comp: ?, Cost: 1)    evalfoo31(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoo4(ar_0, ar_1, ar_2, ar_3, ar_5, ar_5))
2.64/1.75	
2.64/1.75			(Comp: ?, Cost: 1)    evalfoo3(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_2(evalfoo30(ar_0, ar_1, ar_2, ar_3, ar_4, g), evalfoo31(ar_0, ar_1, ar_2, ar_3, ar_4, g))
2.64/1.75	
2.64/1.75			(Comp: ?, Cost: 1)    evalfoo4(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb1in(ar_4, ar_1, ar_0, ar_3, ar_4, ar_5))
2.64/1.75	
2.64/1.75			(Comp: ?, Cost: 1)    evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoostop(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5))
2.64/1.75	
2.64/1.75			(Comp: 1, Cost: 0)    koat_start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoostart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ 0 <= 0 ]
2.64/1.75	
2.64/1.75		start location:	koat_start
2.64/1.75	
2.64/1.75		leaf cost:	0
2.64/1.75	
2.64/1.75	
2.64/1.75	
2.64/1.75	A polynomial rank function with
2.64/1.75	
2.64/1.75		Pol(evalfoostart) = 2
2.64/1.75	
2.64/1.75		Pol(evalfoobb0in) = 2
2.64/1.75	
2.64/1.75		Pol(evalfoobb1in) = 2
2.64/1.75	
2.64/1.75		Pol(evalfoobb2in) = 2
2.64/1.75	
2.64/1.75		Pol(evalfoocritedgein) = 1
2.64/1.75	
2.64/1.75		Pol(evalfoobb3in) = 2
2.64/1.75	
2.64/1.75		Pol(evalfoo3) = 2
2.64/1.75	
2.64/1.75		Pol(evalfoo30) = 0
2.64/1.75	
2.64/1.75		Pol(evalVERIFIERnondetintstart) = 0
2.64/1.75	
2.64/1.75		Pol(evalfoo31) = 2
2.64/1.75	
2.64/1.75		Pol(evalfoo4) = 2
2.64/1.75	
2.64/1.75		Pol(evalfoostop) = 0
2.64/1.75	
2.64/1.75		Pol(koat_start) = 2
2.64/1.75	
2.64/1.75	orients all transitions weakly and the transitions
2.64/1.75	
2.64/1.75		evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoostop(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5))
2.64/1.75	
2.64/1.75		evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ 2*ar_2 + 9 >= ar_0 ]
2.64/1.75	
2.64/1.75		evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_0 >= 100 ]
2.64/1.75	
2.64/1.75		evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ 0 >= ar_0 ]
2.64/1.75	
2.64/1.75	strictly and produces the following problem:
2.64/1.75	
2.64/1.75	3:	T:
2.64/1.75	
2.64/1.75			(Comp: 1, Cost: 1)    evalfoostart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5))
2.64/1.75	
2.64/1.75			(Comp: 1, Cost: 1)    evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb1in(ar_1, ar_1, ar_3, ar_3, ar_4, ar_5))
2.64/1.75	
2.64/1.75			(Comp: ?, Cost: 1)    evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_0 >= 1 /\ 99 >= ar_0 ]
2.64/1.75	
2.64/1.75			(Comp: 2, Cost: 1)    evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ 0 >= ar_0 ]
2.64/1.75	
2.64/1.75			(Comp: 2, Cost: 1)    evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_0 >= 100 ]
2.64/1.75	
2.64/1.75			(Comp: ?, Cost: 1)    evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_0 >= 2*ar_2 + 10 ]
2.64/1.75	
2.64/1.75			(Comp: 2, Cost: 1)    evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ 2*ar_2 + 9 >= ar_0 ]
2.64/1.75	
2.64/1.75			(Comp: ?, Cost: 1)    evalfoobb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoo3(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5))
2.64/1.75	
2.64/1.75			(Comp: ?, Cost: 1)    evalfoo30(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalVERIFIERnondetintstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5))
2.64/1.75	
2.64/1.75			(Comp: ?, Cost: 1)    evalfoo31(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoo4(ar_0, ar_1, ar_2, ar_3, ar_5, ar_5))
2.64/1.75	
2.64/1.75			(Comp: ?, Cost: 1)    evalfoo3(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_2(evalfoo30(ar_0, ar_1, ar_2, ar_3, ar_4, g), evalfoo31(ar_0, ar_1, ar_2, ar_3, ar_4, g))
2.64/1.75	
2.64/1.75			(Comp: ?, Cost: 1)    evalfoo4(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb1in(ar_4, ar_1, ar_0, ar_3, ar_4, ar_5))
2.64/1.75	
2.64/1.75			(Comp: 2, Cost: 1)    evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoostop(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5))
2.64/1.75	
2.64/1.75			(Comp: 1, Cost: 0)    koat_start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoostart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ 0 <= 0 ]
2.64/1.75	
2.64/1.75		start location:	koat_start
2.64/1.75	
2.64/1.75		leaf cost:	0
2.64/1.75	
2.64/1.75	
2.64/1.75	
2.64/1.75	Applied AI with 'oct' on problem 3 to obtain the following invariants:
2.64/1.75	
2.64/1.75	  For symbol evalfoo3: -X_3 + 44 >= 0 /\ X_1 - X_3 + 43 >= 0 /\ -X_1 - X_3 + 143 >= 0 /\ -X_1 + 99 >= 0 /\ X_1 - 1 >= 0
2.64/1.75	
2.64/1.75	  For symbol evalfoo30: -X_3 + 44 >= 0 /\ X_1 - X_3 + 43 >= 0 /\ -X_1 - X_3 + 143 >= 0 /\ -X_1 + 99 >= 0 /\ X_1 - 1 >= 0
2.64/1.75	
2.64/1.75	  For symbol evalfoo31: -X_3 + 44 >= 0 /\ X_1 - X_3 + 43 >= 0 /\ -X_1 - X_3 + 143 >= 0 /\ -X_1 + 99 >= 0 /\ X_1 - 1 >= 0
2.64/1.75	
2.64/1.75	  For symbol evalfoo4: X_5 - X_6 >= 0 /\ -X_5 + X_6 >= 0 /\ -X_3 + 44 >= 0 /\ X_1 - X_3 + 43 >= 0 /\ -X_1 - X_3 + 143 >= 0 /\ -X_1 + 99 >= 0 /\ X_1 - 1 >= 0
2.64/1.75	
2.64/1.75	  For symbol evalfoobb2in: -X_1 + 99 >= 0 /\ X_1 - 1 >= 0
2.64/1.75	
2.64/1.75	  For symbol evalfoobb3in: -X_3 + 44 >= 0 /\ X_1 - X_3 + 43 >= 0 /\ -X_1 - X_3 + 143 >= 0 /\ -X_1 + 99 >= 0 /\ X_1 - 1 >= 0
2.64/1.75	
2.64/1.75	
2.64/1.75	
2.64/1.75	
2.64/1.75	
2.64/1.75	This yielded the following problem:
2.64/1.75	
2.64/1.75	4:	T:
2.64/1.75	
2.64/1.75			(Comp: 1, Cost: 0)    koat_start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoostart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ 0 <= 0 ]
2.64/1.75	
2.64/1.75			(Comp: 2, Cost: 1)    evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoostop(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5))
2.64/1.75	
2.64/1.75			(Comp: ?, Cost: 1)    evalfoo4(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb1in(ar_4, ar_1, ar_0, ar_3, ar_4, ar_5)) [ ar_4 - ar_5 >= 0 /\ -ar_4 + ar_5 >= 0 /\ -ar_2 + 44 >= 0 /\ ar_0 - ar_2 + 43 >= 0 /\ -ar_0 - ar_2 + 143 >= 0 /\ -ar_0 + 99 >= 0 /\ ar_0 - 1 >= 0 ]
2.64/1.75	
2.64/1.75			(Comp: ?, Cost: 1)    evalfoo3(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_2(evalfoo30(ar_0, ar_1, ar_2, ar_3, ar_4, g), evalfoo31(ar_0, ar_1, ar_2, ar_3, ar_4, g)) [ -ar_2 + 44 >= 0 /\ ar_0 - ar_2 + 43 >= 0 /\ -ar_0 - ar_2 + 143 >= 0 /\ -ar_0 + 99 >= 0 /\ ar_0 - 1 >= 0 ]
2.64/1.75	
2.64/1.75			(Comp: ?, Cost: 1)    evalfoo31(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoo4(ar_0, ar_1, ar_2, ar_3, ar_5, ar_5)) [ -ar_2 + 44 >= 0 /\ ar_0 - ar_2 + 43 >= 0 /\ -ar_0 - ar_2 + 143 >= 0 /\ -ar_0 + 99 >= 0 /\ ar_0 - 1 >= 0 ]
2.64/1.75	
2.64/1.75			(Comp: ?, Cost: 1)    evalfoo30(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalVERIFIERnondetintstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ -ar_2 + 44 >= 0 /\ ar_0 - ar_2 + 43 >= 0 /\ -ar_0 - ar_2 + 143 >= 0 /\ -ar_0 + 99 >= 0 /\ ar_0 - 1 >= 0 ]
2.64/1.75	
2.64/1.75			(Comp: ?, Cost: 1)    evalfoobb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoo3(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ -ar_2 + 44 >= 0 /\ ar_0 - ar_2 + 43 >= 0 /\ -ar_0 - ar_2 + 143 >= 0 /\ -ar_0 + 99 >= 0 /\ ar_0 - 1 >= 0 ]
2.64/1.75	
2.64/1.75			(Comp: 2, Cost: 1)    evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ -ar_0 + 99 >= 0 /\ ar_0 - 1 >= 0 /\ 2*ar_2 + 9 >= ar_0 ]
2.64/1.75	
2.64/1.75			(Comp: ?, Cost: 1)    evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ -ar_0 + 99 >= 0 /\ ar_0 - 1 >= 0 /\ ar_0 >= 2*ar_2 + 10 ]
2.64/1.75	
2.64/1.75			(Comp: 2, Cost: 1)    evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_0 >= 100 ]
2.64/1.75	
2.64/1.75			(Comp: 2, Cost: 1)    evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ 0 >= ar_0 ]
2.64/1.75	
2.64/1.75			(Comp: ?, Cost: 1)    evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_0 >= 1 /\ 99 >= ar_0 ]
2.64/1.75	
2.64/1.75			(Comp: 1, Cost: 1)    evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb1in(ar_1, ar_1, ar_3, ar_3, ar_4, ar_5))
2.64/1.75	
2.64/1.75			(Comp: 1, Cost: 1)    evalfoostart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5))
2.64/1.75	
2.64/1.75		start location:	koat_start
2.64/1.75	
2.64/1.75		leaf cost:	0
2.64/1.75	
2.64/1.75	
2.64/1.75	
2.64/1.75	A polynomial rank function with
2.64/1.75	
2.64/1.75		Pol(koat_start) = -12*V_4 + 1178
2.64/1.75	
2.64/1.75		Pol(evalfoostart) = -12*V_4 + 1178
2.64/1.75	
2.64/1.75		Pol(evalfoocritedgein) = -12*V_3 + 1178
2.64/1.75	
2.64/1.75		Pol(evalfoostop) = -12*V_3
2.64/1.75	
2.64/1.75		Pol(evalfoo4) = -12*V_1 + 1189
2.64/1.75	
2.64/1.75		Pol(evalfoobb1in) = -12*V_3 + 1178
2.64/1.75	
2.64/1.75		Pol(evalfoo3) = -6*V_1 + 1216
2.64/1.75	
2.64/1.75		Pol(evalfoo30) = 11
2.64/1.75	
2.64/1.75		Pol(evalfoo31) = -12*V_1 + 1200
2.64/1.75	
2.64/1.75		Pol(evalVERIFIERnondetintstart) = 10
2.64/1.75	
2.64/1.75		Pol(evalfoobb3in) = -6*V_1 + 1227
2.64/1.75	
2.64/1.75		Pol(evalfoobb2in) = -12*V_3 + 1178
2.64/1.75	
2.64/1.75		Pol(evalfoobb0in) = -12*V_4 + 1178
2.64/1.75	
2.64/1.75	orients all transitions weakly and the transitions
2.64/1.75	
2.64/1.75		evalfoobb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoo3(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ -ar_2 + 44 >= 0 /\ ar_0 - ar_2 + 43 >= 0 /\ -ar_0 - ar_2 + 143 >= 0 /\ -ar_0 + 99 >= 0 /\ ar_0 - 1 >= 0 ]
2.64/1.75	
2.64/1.75		evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ -ar_0 + 99 >= 0 /\ ar_0 - 1 >= 0 /\ ar_0 >= 2*ar_2 + 10 ]
2.64/1.75	
2.64/1.75		evalfoo4(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb1in(ar_4, ar_1, ar_0, ar_3, ar_4, ar_5)) [ ar_4 - ar_5 >= 0 /\ -ar_4 + ar_5 >= 0 /\ -ar_2 + 44 >= 0 /\ ar_0 - ar_2 + 43 >= 0 /\ -ar_0 - ar_2 + 143 >= 0 /\ -ar_0 + 99 >= 0 /\ ar_0 - 1 >= 0 ]
2.64/1.75	
2.64/1.75		evalfoo31(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoo4(ar_0, ar_1, ar_2, ar_3, ar_5, ar_5)) [ -ar_2 + 44 >= 0 /\ ar_0 - ar_2 + 43 >= 0 /\ -ar_0 - ar_2 + 143 >= 0 /\ -ar_0 + 99 >= 0 /\ ar_0 - 1 >= 0 ]
2.64/1.75	
2.64/1.75		evalfoo30(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalVERIFIERnondetintstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ -ar_2 + 44 >= 0 /\ ar_0 - ar_2 + 43 >= 0 /\ -ar_0 - ar_2 + 143 >= 0 /\ -ar_0 + 99 >= 0 /\ ar_0 - 1 >= 0 ]
2.64/1.75	
2.64/1.75		evalfoo3(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_2(evalfoo30(ar_0, ar_1, ar_2, ar_3, ar_4, g), evalfoo31(ar_0, ar_1, ar_2, ar_3, ar_4, g)) [ -ar_2 + 44 >= 0 /\ ar_0 - ar_2 + 43 >= 0 /\ -ar_0 - ar_2 + 143 >= 0 /\ -ar_0 + 99 >= 0 /\ ar_0 - 1 >= 0 ]
2.64/1.75	
2.64/1.75	strictly and produces the following problem:
2.64/1.75	
2.64/1.75	5:	T:
2.64/1.75	
2.64/1.75			(Comp: 1, Cost: 0)                 koat_start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoostart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ 0 <= 0 ]
2.64/1.75	
2.64/1.75			(Comp: 2, Cost: 1)                 evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoostop(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5))
2.64/1.75	
2.64/1.75			(Comp: 12*ar_3 + 1178, Cost: 1)    evalfoo4(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb1in(ar_4, ar_1, ar_0, ar_3, ar_4, ar_5)) [ ar_4 - ar_5 >= 0 /\ -ar_4 + ar_5 >= 0 /\ -ar_2 + 44 >= 0 /\ ar_0 - ar_2 + 43 >= 0 /\ -ar_0 - ar_2 + 143 >= 0 /\ -ar_0 + 99 >= 0 /\ ar_0 - 1 >= 0 ]
2.64/1.75	
2.64/1.75			(Comp: 12*ar_3 + 1178, Cost: 1)    evalfoo3(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_2(evalfoo30(ar_0, ar_1, ar_2, ar_3, ar_4, g), evalfoo31(ar_0, ar_1, ar_2, ar_3, ar_4, g)) [ -ar_2 + 44 >= 0 /\ ar_0 - ar_2 + 43 >= 0 /\ -ar_0 - ar_2 + 143 >= 0 /\ -ar_0 + 99 >= 0 /\ ar_0 - 1 >= 0 ]
2.64/1.75	
2.64/1.75			(Comp: 12*ar_3 + 1178, Cost: 1)    evalfoo31(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoo4(ar_0, ar_1, ar_2, ar_3, ar_5, ar_5)) [ -ar_2 + 44 >= 0 /\ ar_0 - ar_2 + 43 >= 0 /\ -ar_0 - ar_2 + 143 >= 0 /\ -ar_0 + 99 >= 0 /\ ar_0 - 1 >= 0 ]
2.64/1.75	
2.64/1.75			(Comp: 12*ar_3 + 1178, Cost: 1)    evalfoo30(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalVERIFIERnondetintstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ -ar_2 + 44 >= 0 /\ ar_0 - ar_2 + 43 >= 0 /\ -ar_0 - ar_2 + 143 >= 0 /\ -ar_0 + 99 >= 0 /\ ar_0 - 1 >= 0 ]
2.64/1.75	
2.64/1.75			(Comp: 12*ar_3 + 1178, Cost: 1)    evalfoobb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoo3(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ -ar_2 + 44 >= 0 /\ ar_0 - ar_2 + 43 >= 0 /\ -ar_0 - ar_2 + 143 >= 0 /\ -ar_0 + 99 >= 0 /\ ar_0 - 1 >= 0 ]
2.64/1.75	
2.64/1.75			(Comp: 2, Cost: 1)                 evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ -ar_0 + 99 >= 0 /\ ar_0 - 1 >= 0 /\ 2*ar_2 + 9 >= ar_0 ]
2.64/1.75	
2.64/1.75			(Comp: 12*ar_3 + 1178, Cost: 1)    evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ -ar_0 + 99 >= 0 /\ ar_0 - 1 >= 0 /\ ar_0 >= 2*ar_2 + 10 ]
2.64/1.75	
2.64/1.75			(Comp: 2, Cost: 1)                 evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_0 >= 100 ]
2.64/1.75	
2.64/1.75			(Comp: 2, Cost: 1)                 evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ 0 >= ar_0 ]
2.64/1.75	
2.64/1.75			(Comp: ?, Cost: 1)                 evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_0 >= 1 /\ 99 >= ar_0 ]
2.64/1.75	
2.64/1.75			(Comp: 1, Cost: 1)                 evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb1in(ar_1, ar_1, ar_3, ar_3, ar_4, ar_5))
2.64/1.75	
2.64/1.75			(Comp: 1, Cost: 1)                 evalfoostart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5))
2.64/1.75	
2.64/1.75		start location:	koat_start
2.64/1.75	
2.64/1.75		leaf cost:	0
2.64/1.75	
2.64/1.75	
2.64/1.75	
2.64/1.75	Repeatedly propagating knowledge in problem 5 produces the following problem:
2.64/1.75	
2.64/1.75	6:	T:
2.64/1.75	
2.64/1.75			(Comp: 1, Cost: 0)                 koat_start(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoostart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ 0 <= 0 ]
2.64/1.75	
2.64/1.75			(Comp: 2, Cost: 1)                 evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoostop(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5))
2.64/1.75	
2.64/1.75			(Comp: 12*ar_3 + 1178, Cost: 1)    evalfoo4(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb1in(ar_4, ar_1, ar_0, ar_3, ar_4, ar_5)) [ ar_4 - ar_5 >= 0 /\ -ar_4 + ar_5 >= 0 /\ -ar_2 + 44 >= 0 /\ ar_0 - ar_2 + 43 >= 0 /\ -ar_0 - ar_2 + 143 >= 0 /\ -ar_0 + 99 >= 0 /\ ar_0 - 1 >= 0 ]
2.64/1.75	
2.64/1.75			(Comp: 12*ar_3 + 1178, Cost: 1)    evalfoo3(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_2(evalfoo30(ar_0, ar_1, ar_2, ar_3, ar_4, g), evalfoo31(ar_0, ar_1, ar_2, ar_3, ar_4, g)) [ -ar_2 + 44 >= 0 /\ ar_0 - ar_2 + 43 >= 0 /\ -ar_0 - ar_2 + 143 >= 0 /\ -ar_0 + 99 >= 0 /\ ar_0 - 1 >= 0 ]
2.64/1.75	
2.64/1.75			(Comp: 12*ar_3 + 1178, Cost: 1)    evalfoo31(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoo4(ar_0, ar_1, ar_2, ar_3, ar_5, ar_5)) [ -ar_2 + 44 >= 0 /\ ar_0 - ar_2 + 43 >= 0 /\ -ar_0 - ar_2 + 143 >= 0 /\ -ar_0 + 99 >= 0 /\ ar_0 - 1 >= 0 ]
2.64/1.75	
2.64/1.75			(Comp: 12*ar_3 + 1178, Cost: 1)    evalfoo30(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalVERIFIERnondetintstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ -ar_2 + 44 >= 0 /\ ar_0 - ar_2 + 43 >= 0 /\ -ar_0 - ar_2 + 143 >= 0 /\ -ar_0 + 99 >= 0 /\ ar_0 - 1 >= 0 ]
2.64/1.75	
2.64/1.75			(Comp: 12*ar_3 + 1178, Cost: 1)    evalfoobb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoo3(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ -ar_2 + 44 >= 0 /\ ar_0 - ar_2 + 43 >= 0 /\ -ar_0 - ar_2 + 143 >= 0 /\ -ar_0 + 99 >= 0 /\ ar_0 - 1 >= 0 ]
2.64/1.75	
2.64/1.75			(Comp: 2, Cost: 1)                 evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ -ar_0 + 99 >= 0 /\ ar_0 - 1 >= 0 /\ 2*ar_2 + 9 >= ar_0 ]
2.64/1.75	
2.64/1.75			(Comp: 12*ar_3 + 1178, Cost: 1)    evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ -ar_0 + 99 >= 0 /\ ar_0 - 1 >= 0 /\ ar_0 >= 2*ar_2 + 10 ]
2.64/1.75	
2.64/1.75			(Comp: 2, Cost: 1)                 evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_0 >= 100 ]
2.64/1.75	
2.64/1.75			(Comp: 2, Cost: 1)                 evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoocritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ 0 >= ar_0 ]
2.64/1.75	
2.64/1.75			(Comp: 12*ar_3 + 1179, Cost: 1)    evalfoobb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5)) [ ar_0 >= 1 /\ 99 >= ar_0 ]
2.64/1.75	
2.64/1.75			(Comp: 1, Cost: 1)                 evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb1in(ar_1, ar_1, ar_3, ar_3, ar_4, ar_5))
2.64/1.75	
2.64/1.75			(Comp: 1, Cost: 1)                 evalfoostart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5) -> Com_1(evalfoobb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5))
2.64/1.75	
2.64/1.75		start location:	koat_start
2.64/1.75	
2.64/1.75		leaf cost:	0
2.64/1.75	
2.64/1.75	
2.64/1.75	
2.64/1.75	Complexity upper bound 84*ar_3 + 8257
2.64/1.75	
2.64/1.75	
2.64/1.75	
2.64/1.75	Time: 0.464 sec (SMT: 0.371 sec)
2.64/1.75	
2.64/1.75	
2.64/1.75	----------------------------------------
2.64/1.75	
2.64/1.75	(2)
2.64/1.75	BOUNDS(1, n^1)
2.64/1.79	EOF