/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: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 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_., v_.01, v_b, v_i, v_n, v_t, v_x) -> Com_1(eval_foo_bb0_in(v_., v_.01, v_b, v_i, v_n, v_t, v_x)) :|: TRUE
eval_foo_bb0_in(v_., v_.01, v_b, v_i, v_n, v_t, v_x) -> Com_1(eval_foo_bb1_in(1, v_x, v_b, v_i, v_n, v_t, v_x)) :|: v_b >= 1
eval_foo_bb0_in(v_., v_.01, v_b, v_i, v_n, v_t, v_x) -> Com_1(eval_foo_bb1_in(-(1), v_x, v_b, v_i, v_n, v_t, v_x)) :|: v_b < 1
eval_foo_bb1_in(v_., v_.01, v_b, v_i, v_n, v_t, v_x) -> Com_1(eval_foo_bb2_in(v_., v_.01, v_b, v_i, v_n, v_t, v_x)) :|: v_.01 <= v_n
eval_foo_bb1_in(v_., v_.01, v_b, v_i, v_n, v_t, v_x) -> Com_1(eval_foo_bb3_in(v_., v_.01, v_b, v_i, v_n, v_t, v_x)) :|: v_.01 > v_n
eval_foo_bb2_in(v_., v_.01, v_b, v_i, v_n, v_t, v_x) -> Com_1(eval_foo_bb1_in(v_., v_.01 + v_., v_b, v_i, v_n, v_t, v_x)) :|: v_b >= 1
eval_foo_bb2_in(v_., v_.01, v_b, v_i, v_n, v_t, v_x) -> Com_1(eval_foo_bb1_in(v_., v_.01 - v_., v_b, v_i, v_n, v_t, v_x)) :|: v_b < 1
eval_foo_bb3_in(v_., v_.01, v_b, v_i, v_n, v_t, v_x) -> Com_1(eval_foo_stop(v_., v_.01, v_b, v_i, v_n, v_t, v_x)) :|: TRUE

The start-symbols are:[eval_foo_start_7]