3.17/2.22	MAYBE
3.17/2.23	proof of /export/starexec/sandbox/output/output_files/bench.koat
3.17/2.23	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
3.17/2.23	
3.17/2.23	
3.17/2.23	The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, INF).
3.17/2.23	
3.17/2.23	(0) CpxIntTrs
3.17/2.23	
3.17/2.23	
3.17/2.23	----------------------------------------
3.17/2.23	
3.17/2.23	(0)
3.17/2.23	Obligation:
3.17/2.23	Complexity Int TRS consisting of the following rules:
3.17/2.23	eval_foo_start(v_.0, v_.01, v_3, v_oldx, v_x) -> Com_1(eval_foo_bb0_in(v_.0, v_.01, v_3, v_oldx, v_x)) :|: TRUE
3.17/2.23	eval_foo_bb0_in(v_.0, v_.01, v_3, v_oldx, v_x) -> Com_1(eval_foo_bb1_in(v_x, v_oldx, v_3, v_oldx, v_x)) :|: TRUE
3.17/2.23	eval_foo_bb1_in(v_.0, v_.01, v_3, v_oldx, v_x) -> Com_1(eval_foo_bb2_in(v_.0, v_.01, v_3, v_oldx, v_x)) :|: v_.0 > 1
3.17/2.23	eval_foo_bb1_in(v_.0, v_.01, v_3, v_oldx, v_x) -> Com_1(eval_foo_.critedge_in(v_.0, v_.01, v_3, v_oldx, v_x)) :|: v_.0 <= 1
3.17/2.23	eval_foo_bb2_in(v_.0, v_.01, v_3, v_oldx, v_x) -> Com_1(eval_foo_bb3_in(v_.0, v_.01, v_3, v_oldx, v_x)) :|: v_.0 >= 2 * v_.01
3.17/2.23	eval_foo_bb2_in(v_.0, v_.01, v_3, v_oldx, v_x) -> Com_1(eval_foo_.critedge_in(v_.0, v_.01, v_3, v_oldx, v_x)) :|: v_.0 < 2 * v_.01
3.17/2.23	eval_foo_bb3_in(v_.0, v_.01, v_3, v_oldx, v_x) -> Com_1(eval_foo_2(v_.0, v_.01, v_3, v_oldx, v_x)) :|: TRUE
3.17/2.23	eval_foo_2(v_.0, v_.01, v_3, v_oldx, v_x) -> Com_2(eval___VERIFIER_nondet_int_start(v_.0, v_.01, v_3, v_oldx, v_x), eval_foo_3(v_.0, v_.01, nondef.0, v_oldx, v_x)) :|: TRUE
3.17/2.23	eval_foo_3(v_.0, v_.01, v_3, v_oldx, v_x) -> Com_1(eval_foo_bb1_in(v_3, v_.0, v_3, v_oldx, v_x)) :|: TRUE
3.17/2.23	eval_foo_.critedge_in(v_.0, v_.01, v_3, v_oldx, v_x) -> Com_1(eval_foo_stop(v_.0, v_.01, v_3, v_oldx, v_x)) :|: TRUE
3.17/2.23	
3.17/2.23	The start-symbols are:[eval_foo_start_5]
3.17/2.23	
3.30/2.25	EOF