/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_.01, v_2, v_i, v_j) -> Com_1(eval_foo_bb0_in(v_.0, v_.01, v_2, v_i, v_j)) :|: TRUE
eval_foo_bb0_in(v_.0, v_.01, v_2, v_i, v_j) -> Com_1(eval_foo_bb1_in(v_i, v_i, v_2, v_i, v_j)) :|: TRUE
eval_foo_bb1_in(v_.0, v_.01, v_2, v_i, v_j) -> Com_1(eval_foo_bb2_in(v_.0, v_.01, v_2, v_i, v_j)) :|: v_.0 > 0
eval_foo_bb1_in(v_.0, v_.01, v_2, v_i, v_j) -> Com_1(eval_foo_bb9_in(v_.0, v_.01, v_2, v_i, v_j)) :|: v_.0 <= 0
eval_foo_bb2_in(v_.0, v_.01, v_2, v_i, v_j) -> Com_1(eval_foo_bb3_in(v_.0, v_.01, v_2, v_i, v_j)) :|: v_.0 >= v_.01
eval_foo_bb2_in(v_.0, v_.01, v_2, v_i, v_j) -> Com_1(eval_foo_bb6_in(v_.0, v_.01, v_2, v_i, v_j)) :|: v_.0 < v_.01
eval_foo_bb3_in(v_.0, v_.01, v_2, v_i, v_j) -> Com_1(eval_foo_bb4_in(v_.0, v_.01, v_.0 + 1, v_i, v_j)) :|: v_.01 < 5
eval_foo_bb3_in(v_.0, v_.01, v_2, v_i, v_j) -> Com_1(eval_foo_bb5_in(v_.0, v_.01, v_.0 + 1, v_i, v_j)) :|: v_.01 >= 5
eval_foo_bb4_in(v_.0, v_.01, v_2, v_i, v_j) -> Com_1(eval_foo_bb1_in(v_2 + 1, v_.01 + 1, v_2, v_i, v_j)) :|: v_2 - v_.01 - 1 > 2
eval_foo_bb4_in(v_.0, v_.01, v_2, v_i, v_j) -> Com_1(eval_foo_bb1_in(v_2, v_.01 + 1, v_2, v_i, v_j)) :|: v_2 - v_.01 - 1 > 2 && v_2 - v_.01 - 1 <= 2
eval_foo_bb4_in(v_.0, v_.01, v_2, v_i, v_j) -> Com_1(eval_foo_bb1_in(v_2 + 1, v_.01 + 2, v_2, v_i, v_j)) :|: v_2 - v_.01 - 1 <= 2 && v_2 - v_.01 - 1 > 2
eval_foo_bb4_in(v_.0, v_.01, v_2, v_i, v_j) -> Com_1(eval_foo_bb1_in(v_2, v_.01 + 2, v_2, v_i, v_j)) :|: v_2 - v_.01 - 1 <= 2
eval_foo_bb5_in(v_.0, v_.01, v_2, v_i, v_j) -> Com_1(eval_foo_bb1_in(v_2, v_.01 - 1, v_2, v_i, v_j)) :|: TRUE
eval_foo_bb6_in(v_.0, v_.01, v_2, v_i, v_j) -> Com_1(eval_foo_bb7_in(v_.0, v_.01, v_2, v_i, v_j)) :|: v_.0 > 0 && v_.01 < 0
eval_foo_bb6_in(v_.0, v_.01, v_2, v_i, v_j) -> Com_1(eval_foo_bb8_in(v_.0, v_.01, v_2, v_i, v_j)) :|: v_.0 <= 0
eval_foo_bb6_in(v_.0, v_.01, v_2, v_i, v_j) -> Com_1(eval_foo_bb8_in(v_.0, v_.01, v_2, v_i, v_j)) :|: v_.01 >= 0
eval_foo_bb7_in(v_.0, v_.01, v_2, v_i, v_j) -> Com_1(eval_foo_bb1_in(v_.0 - 1, v_.01 + 1, v_2, v_i, v_j)) :|: v_.01 < -(1)
eval_foo_bb7_in(v_.0, v_.01, v_2, v_i, v_j) -> Com_1(eval_foo_bb1_in(v_.0, v_.01 + 1, v_2, v_i, v_j)) :|: v_.01 < -(1) && v_.01 >= -(1)
eval_foo_bb7_in(v_.0, v_.01, v_2, v_i, v_j) -> Com_1(eval_foo_bb1_in(v_.0 - 1, v_.01, v_2, v_i, v_j)) :|: v_.01 >= -(1) && v_.01 < -(1)
eval_foo_bb7_in(v_.0, v_.01, v_2, v_i, v_j) -> Com_1(eval_foo_bb1_in(v_.0, v_.01, v_2, v_i, v_j)) :|: v_.01 >= -(1)
eval_foo_bb8_in(v_.0, v_.01, v_2, v_i, v_j) -> Com_1(eval_foo_bb1_in(v_.0 + 1, v_.01 - 1, v_2, v_i, v_j)) :|: 2 * v_.01 > v_.0 + 1
eval_foo_bb8_in(v_.0, v_.01, v_2, v_i, v_j) -> Com_1(eval_foo_bb1_in(v_.0 + 1, v_.01 + 1, v_2, v_i, v_j)) :|: 2 * v_.01 <= v_.0 + 1
eval_foo_bb9_in(v_.0, v_.01, v_2, v_i, v_j) -> Com_1(eval_foo_stop(v_.0, v_.01, v_2, v_i, v_j)) :|: TRUE

The start-symbols are:[eval_foo_start_5]