3.48/2.50	MAYBE
3.48/2.51	proof of /export/starexec/sandbox/output/output_files/bench.koat
3.48/2.51	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
3.48/2.51	
3.48/2.51	
3.48/2.51	The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, INF).
3.48/2.51	
3.48/2.51	(0) CpxIntTrs
3.48/2.51	
3.48/2.51	
3.48/2.51	----------------------------------------
3.48/2.51	
3.48/2.51	(0)
3.48/2.51	Obligation:
3.48/2.51	Complexity Int TRS consisting of the following rules:
3.48/2.51	eval_foo_start(v_.0, v_1, v_x) -> Com_1(eval_foo_bb0_in(v_.0, v_1, v_x)) :|: TRUE
3.48/2.51	eval_foo_bb0_in(v_.0, v_1, v_x) -> Com_1(eval_foo_bb1_in(v_x, v_1, v_x)) :|: TRUE
3.48/2.51	eval_foo_bb1_in(v_.0, v_1, v_x) -> Com_1(eval_foo_bb2_in(v_.0, v_1, v_x)) :|: v_.0 >= 0
3.48/2.51	eval_foo_bb1_in(v_.0, v_1, v_x) -> Com_1(eval_foo_bb3_in(v_.0, v_1, v_x)) :|: v_.0 < 0
3.48/2.51	eval_foo_bb2_in(v_.0, v_1, v_x) -> Com_1(eval_foo_0(v_.0, v_1, v_x)) :|: TRUE
3.48/2.51	eval_foo_0(v_.0, v_1, v_x) -> Com_2(eval___VERIFIER_nondet_int_start(v_.0, v_1, v_x), eval_foo_1(v_.0, nondef.0, v_x)) :|: TRUE
3.48/2.51	eval_foo_1(v_.0, v_1, v_x) -> Com_1(eval_foo_bb1_in(v_.0 - 1, v_1, v_x)) :|: v_1 < 0
3.48/2.51	eval_foo_1(v_.0, v_1, v_x) -> Com_1(eval_foo_bb1_in(v_.0 - 1, v_1, v_x)) :|: v_1 > 0
3.48/2.51	eval_foo_1(v_.0, v_1, v_x) -> Com_1(eval_foo_bb1_in(v_.0 + 1, v_1, v_x)) :|: v_1 >= 0 && v_1 <= 0
3.48/2.51	eval_foo_bb3_in(v_.0, v_1, v_x) -> Com_1(eval_foo_stop(v_.0, v_1, v_x)) :|: TRUE
3.48/2.51	
3.48/2.51	The start-symbols are:[eval_foo_start_3]
3.48/2.51	
3.48/2.54	EOF