/export/starexec/sandbox2/solver/bin/starexec_run_c_complexity /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


MAYBE
proof of /export/starexec/sandbox2/output/output_files/bench.koat
# AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty


The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, INF).

(0) CpxIntTrs


----------------------------------------

(0)
Obligation:
Complexity Int TRS consisting of the following rules:
eval_foo_start(v_.0, v_0, v_x) -> Com_1(eval_foo_bb0_in(v_.0, v_0, v_x)) :|: TRUE
eval_foo_bb0_in(v_.0, v_0, v_x) -> Com_1(eval_foo_0(v_.0, v_0, v_x)) :|: TRUE
eval_foo_0(v_.0, v_0, v_x) -> Com_2(eval___VERIFIER_nondet_int_start(v_.0, v_0, v_x), eval_foo_1(v_.0, nondef.0, v_x)) :|: TRUE
eval_foo_1(v_.0, v_0, v_x) -> Com_1(eval_foo_bb1_in(v_x, v_0, v_x)) :|: v_x > v_0
eval_foo_1(v_.0, v_0, v_x) -> Com_1(eval_foo_bb3_in(v_.0, v_0, v_x)) :|: v_x <= v_0
eval_foo_bb1_in(v_.0, v_0, v_x) -> Com_1(eval_foo_bb2_in(v_.0, v_0, v_x)) :|: v_.0 < 0
eval_foo_bb1_in(v_.0, v_0, v_x) -> Com_1(eval_foo_bb2_in(v_.0, v_0, v_x)) :|: v_.0 > 0
eval_foo_bb1_in(v_.0, v_0, v_x) -> Com_1(eval_foo_bb3_in(v_.0, v_0, v_x)) :|: v_.0 >= 0 && v_.0 <= 0
eval_foo_bb2_in(v_.0, v_0, v_x) -> Com_1(eval_foo_bb1_in(v_.0 - 1, v_0, v_x)) :|: TRUE
eval_foo_bb3_in(v_.0, v_0, v_x) -> Com_1(eval_foo_stop(v_.0, v_0, v_x)) :|: TRUE

The start-symbols are:[eval_foo_start_3]