/export/starexec/sandbox2/solver/bin/starexec_run_c_complexity /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?, O(n^1)) 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, n^1). (0) CpxIntTrs (1) Koat Proof [FINISHED, 82 ms] (2) BOUNDS(1, n^1) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_foo_start(v_.0, v_.01, v_x, v_y) -> Com_1(eval_foo_bb0_in(v_.0, v_.01, v_x, v_y)) :|: TRUE eval_foo_bb0_in(v_.0, v_.01, v_x, v_y) -> Com_1(eval_foo_bb1_in(v_x, 23, v_x, v_y)) :|: TRUE eval_foo_bb1_in(v_.0, v_.01, v_x, v_y) -> Com_1(eval_foo_bb2_in(v_.0, v_.01, v_x, v_y)) :|: v_.0 >= 0 eval_foo_bb1_in(v_.0, v_.01, v_x, v_y) -> Com_1(eval_foo_bb3_in(v_.0, v_.01, v_x, v_y)) :|: v_.0 < 0 eval_foo_bb2_in(v_.0, v_.01, v_x, v_y) -> Com_1(eval_foo_bb1_in(v_.0 - v_.01, v_.01 + 1, v_x, v_y)) :|: TRUE eval_foo_bb3_in(v_.0, v_.01, v_x, v_y) -> Com_1(eval_foo_stop(v_.0, v_.01, v_x, v_y)) :|: TRUE The start-symbols are:[eval_foo_start_4] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 4*Ar_1 + 54) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) evalfoostart(Ar_0, Ar_1, Ar_2) -> Com_1(evalfoobb0in(Ar_0, Ar_1, Ar_2)) (Comp: ?, Cost: 1) evalfoobb0in(Ar_0, Ar_1, Ar_2) -> Com_1(evalfoobb1in(Ar_1, Ar_1, 23)) (Comp: ?, Cost: 1) evalfoobb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalfoobb2in(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 ] (Comp: ?, Cost: 1) evalfoobb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalfoobb3in(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_0 + 1 ] (Comp: ?, Cost: 1) evalfoobb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evalfoobb1in(Ar_0 - Ar_2, Ar_1, Ar_2 + 1)) (Comp: ?, Cost: 1) evalfoobb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalfoostop(Ar_0, Ar_1, Ar_2)) (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalfoostart(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 Repeatedly propagating knowledge in problem 1 produces the following problem: 2: T: (Comp: 1, Cost: 1) evalfoostart(Ar_0, Ar_1, Ar_2) -> Com_1(evalfoobb0in(Ar_0, Ar_1, Ar_2)) (Comp: 1, Cost: 1) evalfoobb0in(Ar_0, Ar_1, Ar_2) -> Com_1(evalfoobb1in(Ar_1, Ar_1, 23)) (Comp: ?, Cost: 1) evalfoobb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalfoobb2in(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 ] (Comp: ?, Cost: 1) evalfoobb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalfoobb3in(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_0 + 1 ] (Comp: ?, Cost: 1) evalfoobb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evalfoobb1in(Ar_0 - Ar_2, Ar_1, Ar_2 + 1)) (Comp: ?, Cost: 1) evalfoobb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalfoostop(Ar_0, Ar_1, Ar_2)) (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalfoostart(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 A polynomial rank function with Pol(evalfoostart) = 2 Pol(evalfoobb0in) = 2 Pol(evalfoobb1in) = 2 Pol(evalfoobb2in) = 2 Pol(evalfoobb3in) = 1 Pol(evalfoostop) = 0 Pol(koat_start) = 2 orients all transitions weakly and the transitions evalfoobb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalfoostop(Ar_0, Ar_1, Ar_2)) evalfoobb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalfoobb3in(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_0 + 1 ] strictly and produces the following problem: 3: T: (Comp: 1, Cost: 1) evalfoostart(Ar_0, Ar_1, Ar_2) -> Com_1(evalfoobb0in(Ar_0, Ar_1, Ar_2)) (Comp: 1, Cost: 1) evalfoobb0in(Ar_0, Ar_1, Ar_2) -> Com_1(evalfoobb1in(Ar_1, Ar_1, 23)) (Comp: ?, Cost: 1) evalfoobb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalfoobb2in(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= 0 ] (Comp: 2, Cost: 1) evalfoobb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalfoobb3in(Ar_0, Ar_1, Ar_2)) [ 0 >= Ar_0 + 1 ] (Comp: ?, Cost: 1) evalfoobb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evalfoobb1in(Ar_0 - Ar_2, Ar_1, Ar_2 + 1)) (Comp: 2, Cost: 1) evalfoobb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalfoostop(Ar_0, Ar_1, Ar_2)) (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalfoostart(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 Applied AI with 'oct' on problem 3 to obtain the following invariants: For symbol evalfoobb1in: X_3 - 23 >= 0 /\ -X_1 + X_2 >= 0 For symbol evalfoobb2in: X_3 - 23 >= 0 /\ X_2 + X_3 - 23 >= 0 /\ X_1 + X_3 - 23 >= 0 /\ X_2 >= 0 /\ X_1 + X_2 >= 0 /\ -X_1 + X_2 >= 0 /\ X_1 >= 0 For symbol evalfoobb3in: X_3 - 23 >= 0 /\ -X_1 + X_3 - 24 >= 0 /\ -X_1 + X_2 >= 0 /\ -X_1 - 1 >= 0 This yielded the following problem: 4: T: (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalfoostart(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ] (Comp: 2, Cost: 1) evalfoobb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalfoostop(Ar_0, Ar_1, Ar_2)) [ Ar_2 - 23 >= 0 /\ -Ar_0 + Ar_2 - 24 >= 0 /\ -Ar_0 + Ar_1 >= 0 /\ -Ar_0 - 1 >= 0 ] (Comp: ?, Cost: 1) evalfoobb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evalfoobb1in(Ar_0 - Ar_2, Ar_1, Ar_2 + 1)) [ Ar_2 - 23 >= 0 /\ Ar_1 + Ar_2 - 23 >= 0 /\ Ar_0 + Ar_2 - 23 >= 0 /\ Ar_1 >= 0 /\ Ar_0 + Ar_1 >= 0 /\ -Ar_0 + Ar_1 >= 0 /\ Ar_0 >= 0 ] (Comp: 2, Cost: 1) evalfoobb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalfoobb3in(Ar_0, Ar_1, Ar_2)) [ Ar_2 - 23 >= 0 /\ -Ar_0 + Ar_1 >= 0 /\ 0 >= Ar_0 + 1 ] (Comp: ?, Cost: 1) evalfoobb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalfoobb2in(Ar_0, Ar_1, Ar_2)) [ Ar_2 - 23 >= 0 /\ -Ar_0 + Ar_1 >= 0 /\ Ar_0 >= 0 ] (Comp: 1, Cost: 1) evalfoobb0in(Ar_0, Ar_1, Ar_2) -> Com_1(evalfoobb1in(Ar_1, Ar_1, 23)) (Comp: 1, Cost: 1) evalfoostart(Ar_0, Ar_1, Ar_2) -> Com_1(evalfoobb0in(Ar_0, Ar_1, Ar_2)) start location: koat_start leaf cost: 0 A polynomial rank function with Pol(koat_start) = 2*V_2 + 24 Pol(evalfoostart) = 2*V_2 + 24 Pol(evalfoobb3in) = 2*V_1 Pol(evalfoostop) = 2*V_1 Pol(evalfoobb2in) = 2*V_1 + 1 Pol(evalfoobb1in) = 2*V_1 + 24 Pol(evalfoobb0in) = 2*V_2 + 24 orients all transitions weakly and the transitions evalfoobb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evalfoobb1in(Ar_0 - Ar_2, Ar_1, Ar_2 + 1)) [ Ar_2 - 23 >= 0 /\ Ar_1 + Ar_2 - 23 >= 0 /\ Ar_0 + Ar_2 - 23 >= 0 /\ Ar_1 >= 0 /\ Ar_0 + Ar_1 >= 0 /\ -Ar_0 + Ar_1 >= 0 /\ Ar_0 >= 0 ] evalfoobb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalfoobb2in(Ar_0, Ar_1, Ar_2)) [ Ar_2 - 23 >= 0 /\ -Ar_0 + Ar_1 >= 0 /\ Ar_0 >= 0 ] strictly and produces the following problem: 5: T: (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evalfoostart(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ] (Comp: 2, Cost: 1) evalfoobb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evalfoostop(Ar_0, Ar_1, Ar_2)) [ Ar_2 - 23 >= 0 /\ -Ar_0 + Ar_2 - 24 >= 0 /\ -Ar_0 + Ar_1 >= 0 /\ -Ar_0 - 1 >= 0 ] (Comp: 2*Ar_1 + 24, Cost: 1) evalfoobb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evalfoobb1in(Ar_0 - Ar_2, Ar_1, Ar_2 + 1)) [ Ar_2 - 23 >= 0 /\ Ar_1 + Ar_2 - 23 >= 0 /\ Ar_0 + Ar_2 - 23 >= 0 /\ Ar_1 >= 0 /\ Ar_0 + Ar_1 >= 0 /\ -Ar_0 + Ar_1 >= 0 /\ Ar_0 >= 0 ] (Comp: 2, Cost: 1) evalfoobb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalfoobb3in(Ar_0, Ar_1, Ar_2)) [ Ar_2 - 23 >= 0 /\ -Ar_0 + Ar_1 >= 0 /\ 0 >= Ar_0 + 1 ] (Comp: 2*Ar_1 + 24, Cost: 1) evalfoobb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evalfoobb2in(Ar_0, Ar_1, Ar_2)) [ Ar_2 - 23 >= 0 /\ -Ar_0 + Ar_1 >= 0 /\ Ar_0 >= 0 ] (Comp: 1, Cost: 1) evalfoobb0in(Ar_0, Ar_1, Ar_2) -> Com_1(evalfoobb1in(Ar_1, Ar_1, 23)) (Comp: 1, Cost: 1) evalfoostart(Ar_0, Ar_1, Ar_2) -> Com_1(evalfoobb0in(Ar_0, Ar_1, Ar_2)) start location: koat_start leaf cost: 0 Complexity upper bound 4*Ar_1 + 54 Time: 0.131 sec (SMT: 0.112 sec) ---------------------------------------- (2) BOUNDS(1, n^1)