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


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


MAYBE
proof of /export/starexec/sandbox/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_speedFails4_start(v_., v_.0, v_0, v_n, v_x) -> Com_1(eval_speedFails4_bb0_in(v_., v_.0, v_0, v_n, v_x)) :|: TRUE
eval_speedFails4_bb0_in(v_., v_.0, v_0, v_n, v_x) -> Com_1(eval_speedFails4_bb1_in(1, v_x, nondef.0, v_n, v_x)) :|: nondef.0 >= 1
eval_speedFails4_bb0_in(v_., v_.0, v_0, v_n, v_x) -> Com_1(eval_speedFails4_bb1_in(-(1), v_x, nondef.0, v_n, v_x)) :|: nondef.0 < 1
eval_speedFails4_bb1_in(v_., v_.0, v_0, v_n, v_x) -> Com_1(eval_speedFails4_bb2_in(v_., v_.0, v_0, v_n, v_x)) :|: v_.0 <= v_n
eval_speedFails4_bb1_in(v_., v_.0, v_0, v_n, v_x) -> Com_1(eval_speedFails4_bb3_in(v_., v_.0, v_0, v_n, v_x)) :|: v_.0 > v_n
eval_speedFails4_bb2_in(v_., v_.0, v_0, v_n, v_x) -> Com_1(eval_speedFails4_bb1_in(v_., v_.0 + v_., v_0, v_n, v_x)) :|: v_0 >= 1
eval_speedFails4_bb2_in(v_., v_.0, v_0, v_n, v_x) -> Com_1(eval_speedFails4_bb1_in(v_., v_.0 - v_., v_0, v_n, v_x)) :|: v_0 < 1
eval_speedFails4_bb3_in(v_., v_.0, v_0, v_n, v_x) -> Com_1(eval_speedFails4_stop(v_., v_.0, v_0, v_n, v_x)) :|: TRUE

The start-symbols are:[eval_speedFails4_start_5]