/export/starexec/sandbox/solver/bin/starexec_run_c_complexity /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?, O(n^1)) 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, n^1). (0) CpxIntTrs (1) Koat Proof [FINISHED, 190 ms] (2) BOUNDS(1, n^1) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_speedSimpleMultiple_start(v_m, v_n, v_x.0, v_y.0) -> Com_1(eval_speedSimpleMultiple_bb0_in(v_m, v_n, v_x.0, v_y.0)) :|: TRUE eval_speedSimpleMultiple_bb0_in(v_m, v_n, v_x.0, v_y.0) -> Com_1(eval_speedSimpleMultiple_bb1_in(v_m, v_n, 0, 0)) :|: TRUE eval_speedSimpleMultiple_bb1_in(v_m, v_n, v_x.0, v_y.0) -> Com_1(eval_speedSimpleMultiple_bb2_in(v_m, v_n, v_x.0, v_y.0)) :|: v_x.0 < v_n eval_speedSimpleMultiple_bb1_in(v_m, v_n, v_x.0, v_y.0) -> Com_1(eval_speedSimpleMultiple_bb3_in(v_m, v_n, v_x.0, v_y.0)) :|: v_x.0 >= v_n eval_speedSimpleMultiple_bb2_in(v_m, v_n, v_x.0, v_y.0) -> Com_1(eval_speedSimpleMultiple_bb1_in(v_m, v_n, v_x.0, v_y.0 + 1)) :|: v_y.0 < v_m eval_speedSimpleMultiple_bb2_in(v_m, v_n, v_x.0, v_y.0) -> Com_1(eval_speedSimpleMultiple_bb1_in(v_m, v_n, v_x.0 + 1, v_y.0 + 1)) :|: v_y.0 < v_m && v_y.0 >= v_m eval_speedSimpleMultiple_bb2_in(v_m, v_n, v_x.0, v_y.0) -> Com_1(eval_speedSimpleMultiple_bb1_in(v_m, v_n, v_x.0, v_y.0)) :|: v_y.0 >= v_m && v_y.0 < v_m eval_speedSimpleMultiple_bb2_in(v_m, v_n, v_x.0, v_y.0) -> Com_1(eval_speedSimpleMultiple_bb1_in(v_m, v_n, v_x.0 + 1, v_y.0)) :|: v_y.0 >= v_m eval_speedSimpleMultiple_bb3_in(v_m, v_n, v_x.0, v_y.0) -> Com_1(eval_speedSimpleMultiple_stop(v_m, v_n, v_x.0, v_y.0)) :|: TRUE The start-symbols are:[eval_speedSimpleMultiple_start_4] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 2*Ar_2 + 2*Ar_3 + 7) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) evalspeedSimpleMultiplestart(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplebb0in(Ar_0, Ar_1, Ar_2, Ar_3)) (Comp: ?, Cost: 1) evalspeedSimpleMultiplebb0in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplebb1in(0, 0, Ar_2, Ar_3)) (Comp: ?, Cost: 1) evalspeedSimpleMultiplebb1in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplebb2in(Ar_0, Ar_1, Ar_2, Ar_3)) [ Ar_2 >= Ar_0 + 1 ] (Comp: ?, Cost: 1) evalspeedSimpleMultiplebb1in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplebb3in(Ar_0, Ar_1, Ar_2, Ar_3)) [ Ar_0 >= Ar_2 ] (Comp: ?, Cost: 1) evalspeedSimpleMultiplebb2in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplebb1in(Ar_0, Ar_1 + 1, Ar_2, Ar_3)) [ Ar_3 >= Ar_1 + 1 ] (Comp: ?, Cost: 1) evalspeedSimpleMultiplebb2in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplebb1in(Ar_0 + 1, Ar_1 + 1, Ar_2, Ar_3)) [ Ar_3 >= Ar_1 + 1 /\ Ar_1 >= Ar_3 ] (Comp: ?, Cost: 1) evalspeedSimpleMultiplebb2in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplebb1in(Ar_0, Ar_1, Ar_2, Ar_3)) [ Ar_1 >= Ar_3 /\ Ar_3 >= Ar_1 + 1 ] (Comp: ?, Cost: 1) evalspeedSimpleMultiplebb2in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplebb1in(Ar_0 + 1, Ar_1, Ar_2, Ar_3)) [ Ar_1 >= Ar_3 ] (Comp: ?, Cost: 1) evalspeedSimpleMultiplebb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplestop(Ar_0, Ar_1, Ar_2, Ar_3)) (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplestart(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 Testing for reachability in the complexity graph removes the following transitions from problem 1: evalspeedSimpleMultiplebb2in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplebb1in(Ar_0 + 1, Ar_1 + 1, Ar_2, Ar_3)) [ Ar_3 >= Ar_1 + 1 /\ Ar_1 >= Ar_3 ] evalspeedSimpleMultiplebb2in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplebb1in(Ar_0, Ar_1, Ar_2, Ar_3)) [ Ar_1 >= Ar_3 /\ Ar_3 >= Ar_1 + 1 ] We thus obtain the following problem: 2: T: (Comp: ?, Cost: 1) evalspeedSimpleMultiplebb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplestop(Ar_0, Ar_1, Ar_2, Ar_3)) (Comp: ?, Cost: 1) evalspeedSimpleMultiplebb2in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplebb1in(Ar_0 + 1, Ar_1, Ar_2, Ar_3)) [ Ar_1 >= Ar_3 ] (Comp: ?, Cost: 1) evalspeedSimpleMultiplebb2in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplebb1in(Ar_0, Ar_1 + 1, Ar_2, Ar_3)) [ Ar_3 >= Ar_1 + 1 ] (Comp: ?, Cost: 1) evalspeedSimpleMultiplebb1in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplebb3in(Ar_0, Ar_1, Ar_2, Ar_3)) [ Ar_0 >= Ar_2 ] (Comp: ?, Cost: 1) evalspeedSimpleMultiplebb1in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplebb2in(Ar_0, Ar_1, Ar_2, Ar_3)) [ Ar_2 >= Ar_0 + 1 ] (Comp: ?, Cost: 1) evalspeedSimpleMultiplebb0in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplebb1in(0, 0, Ar_2, Ar_3)) (Comp: ?, Cost: 1) evalspeedSimpleMultiplestart(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplebb0in(Ar_0, Ar_1, Ar_2, Ar_3)) (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplestart(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 Repeatedly propagating knowledge in problem 2 produces the following problem: 3: T: (Comp: ?, Cost: 1) evalspeedSimpleMultiplebb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplestop(Ar_0, Ar_1, Ar_2, Ar_3)) (Comp: ?, Cost: 1) evalspeedSimpleMultiplebb2in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplebb1in(Ar_0 + 1, Ar_1, Ar_2, Ar_3)) [ Ar_1 >= Ar_3 ] (Comp: ?, Cost: 1) evalspeedSimpleMultiplebb2in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplebb1in(Ar_0, Ar_1 + 1, Ar_2, Ar_3)) [ Ar_3 >= Ar_1 + 1 ] (Comp: ?, Cost: 1) evalspeedSimpleMultiplebb1in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplebb3in(Ar_0, Ar_1, Ar_2, Ar_3)) [ Ar_0 >= Ar_2 ] (Comp: ?, Cost: 1) evalspeedSimpleMultiplebb1in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplebb2in(Ar_0, Ar_1, Ar_2, Ar_3)) [ Ar_2 >= Ar_0 + 1 ] (Comp: 1, Cost: 1) evalspeedSimpleMultiplebb0in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplebb1in(0, 0, Ar_2, Ar_3)) (Comp: 1, Cost: 1) evalspeedSimpleMultiplestart(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplebb0in(Ar_0, Ar_1, Ar_2, Ar_3)) (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplestart(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 A polynomial rank function with Pol(evalspeedSimpleMultiplebb3in) = 1 Pol(evalspeedSimpleMultiplestop) = 0 Pol(evalspeedSimpleMultiplebb2in) = 2 Pol(evalspeedSimpleMultiplebb1in) = 2 Pol(evalspeedSimpleMultiplebb0in) = 2 Pol(evalspeedSimpleMultiplestart) = 2 Pol(koat_start) = 2 orients all transitions weakly and the transitions evalspeedSimpleMultiplebb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplestop(Ar_0, Ar_1, Ar_2, Ar_3)) evalspeedSimpleMultiplebb1in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplebb3in(Ar_0, Ar_1, Ar_2, Ar_3)) [ Ar_0 >= Ar_2 ] strictly and produces the following problem: 4: T: (Comp: 2, Cost: 1) evalspeedSimpleMultiplebb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplestop(Ar_0, Ar_1, Ar_2, Ar_3)) (Comp: ?, Cost: 1) evalspeedSimpleMultiplebb2in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplebb1in(Ar_0 + 1, Ar_1, Ar_2, Ar_3)) [ Ar_1 >= Ar_3 ] (Comp: ?, Cost: 1) evalspeedSimpleMultiplebb2in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplebb1in(Ar_0, Ar_1 + 1, Ar_2, Ar_3)) [ Ar_3 >= Ar_1 + 1 ] (Comp: 2, Cost: 1) evalspeedSimpleMultiplebb1in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplebb3in(Ar_0, Ar_1, Ar_2, Ar_3)) [ Ar_0 >= Ar_2 ] (Comp: ?, Cost: 1) evalspeedSimpleMultiplebb1in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplebb2in(Ar_0, Ar_1, Ar_2, Ar_3)) [ Ar_2 >= Ar_0 + 1 ] (Comp: 1, Cost: 1) evalspeedSimpleMultiplebb0in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplebb1in(0, 0, Ar_2, Ar_3)) (Comp: 1, Cost: 1) evalspeedSimpleMultiplestart(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplebb0in(Ar_0, Ar_1, Ar_2, Ar_3)) (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplestart(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 A polynomial rank function with Pol(evalspeedSimpleMultiplebb3in) = -V_2 + V_4 Pol(evalspeedSimpleMultiplestop) = -V_2 + V_4 Pol(evalspeedSimpleMultiplebb2in) = -V_2 + V_4 Pol(evalspeedSimpleMultiplebb1in) = -V_2 + V_4 Pol(evalspeedSimpleMultiplebb0in) = V_4 Pol(evalspeedSimpleMultiplestart) = V_4 Pol(koat_start) = V_4 orients all transitions weakly and the transition evalspeedSimpleMultiplebb2in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplebb1in(Ar_0, Ar_1 + 1, Ar_2, Ar_3)) [ Ar_3 >= Ar_1 + 1 ] strictly and produces the following problem: 5: T: (Comp: 2, Cost: 1) evalspeedSimpleMultiplebb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplestop(Ar_0, Ar_1, Ar_2, Ar_3)) (Comp: ?, Cost: 1) evalspeedSimpleMultiplebb2in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplebb1in(Ar_0 + 1, Ar_1, Ar_2, Ar_3)) [ Ar_1 >= Ar_3 ] (Comp: Ar_3, Cost: 1) evalspeedSimpleMultiplebb2in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplebb1in(Ar_0, Ar_1 + 1, Ar_2, Ar_3)) [ Ar_3 >= Ar_1 + 1 ] (Comp: 2, Cost: 1) evalspeedSimpleMultiplebb1in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplebb3in(Ar_0, Ar_1, Ar_2, Ar_3)) [ Ar_0 >= Ar_2 ] (Comp: ?, Cost: 1) evalspeedSimpleMultiplebb1in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplebb2in(Ar_0, Ar_1, Ar_2, Ar_3)) [ Ar_2 >= Ar_0 + 1 ] (Comp: 1, Cost: 1) evalspeedSimpleMultiplebb0in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplebb1in(0, 0, Ar_2, Ar_3)) (Comp: 1, Cost: 1) evalspeedSimpleMultiplestart(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplebb0in(Ar_0, Ar_1, Ar_2, Ar_3)) (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplestart(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 Applied AI with 'oct' on problem 5 to obtain the following invariants: For symbol evalspeedSimpleMultiplebb1in: X_2 >= 0 /\ X_1 + X_2 >= 0 /\ X_1 >= 0 For symbol evalspeedSimpleMultiplebb2in: X_3 - 1 >= 0 /\ X_2 + X_3 - 1 >= 0 /\ X_1 + X_3 - 1 >= 0 /\ -X_1 + X_3 - 1 >= 0 /\ X_2 >= 0 /\ X_1 + X_2 >= 0 /\ X_1 >= 0 For symbol evalspeedSimpleMultiplebb3in: X_1 - X_3 >= 0 /\ X_2 >= 0 /\ X_1 + X_2 >= 0 /\ X_1 >= 0 This yielded the following problem: 6: T: (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplestart(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ] (Comp: 1, Cost: 1) evalspeedSimpleMultiplestart(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplebb0in(Ar_0, Ar_1, Ar_2, Ar_3)) (Comp: 1, Cost: 1) evalspeedSimpleMultiplebb0in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplebb1in(0, 0, Ar_2, Ar_3)) (Comp: ?, Cost: 1) evalspeedSimpleMultiplebb1in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplebb2in(Ar_0, Ar_1, Ar_2, Ar_3)) [ Ar_1 >= 0 /\ Ar_0 + Ar_1 >= 0 /\ Ar_0 >= 0 /\ Ar_2 >= Ar_0 + 1 ] (Comp: 2, Cost: 1) evalspeedSimpleMultiplebb1in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplebb3in(Ar_0, Ar_1, Ar_2, Ar_3)) [ Ar_1 >= 0 /\ Ar_0 + Ar_1 >= 0 /\ Ar_0 >= 0 /\ Ar_0 >= Ar_2 ] (Comp: Ar_3, Cost: 1) evalspeedSimpleMultiplebb2in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplebb1in(Ar_0, Ar_1 + 1, Ar_2, Ar_3)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 1 >= 0 /\ Ar_0 + Ar_2 - 1 >= 0 /\ -Ar_0 + Ar_2 - 1 >= 0 /\ Ar_1 >= 0 /\ Ar_0 + Ar_1 >= 0 /\ Ar_0 >= 0 /\ Ar_3 >= Ar_1 + 1 ] (Comp: ?, Cost: 1) evalspeedSimpleMultiplebb2in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplebb1in(Ar_0 + 1, Ar_1, Ar_2, Ar_3)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 1 >= 0 /\ Ar_0 + Ar_2 - 1 >= 0 /\ -Ar_0 + Ar_2 - 1 >= 0 /\ Ar_1 >= 0 /\ Ar_0 + Ar_1 >= 0 /\ Ar_0 >= 0 /\ Ar_1 >= Ar_3 ] (Comp: 2, Cost: 1) evalspeedSimpleMultiplebb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplestop(Ar_0, Ar_1, Ar_2, Ar_3)) [ Ar_0 - Ar_2 >= 0 /\ Ar_1 >= 0 /\ Ar_0 + Ar_1 >= 0 /\ Ar_0 >= 0 ] start location: koat_start leaf cost: 0 A polynomial rank function with Pol(koat_start) = V_3 Pol(evalspeedSimpleMultiplestart) = V_3 Pol(evalspeedSimpleMultiplebb0in) = V_3 Pol(evalspeedSimpleMultiplebb1in) = -V_1 + V_3 Pol(evalspeedSimpleMultiplebb2in) = -V_1 + V_3 Pol(evalspeedSimpleMultiplebb3in) = -V_1 + V_3 Pol(evalspeedSimpleMultiplestop) = -V_1 + V_3 orients all transitions weakly and the transition evalspeedSimpleMultiplebb2in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplebb1in(Ar_0 + 1, Ar_1, Ar_2, Ar_3)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 1 >= 0 /\ Ar_0 + Ar_2 - 1 >= 0 /\ -Ar_0 + Ar_2 - 1 >= 0 /\ Ar_1 >= 0 /\ Ar_0 + Ar_1 >= 0 /\ Ar_0 >= 0 /\ Ar_1 >= Ar_3 ] strictly and produces the following problem: 7: T: (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplestart(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ] (Comp: 1, Cost: 1) evalspeedSimpleMultiplestart(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplebb0in(Ar_0, Ar_1, Ar_2, Ar_3)) (Comp: 1, Cost: 1) evalspeedSimpleMultiplebb0in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplebb1in(0, 0, Ar_2, Ar_3)) (Comp: ?, Cost: 1) evalspeedSimpleMultiplebb1in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplebb2in(Ar_0, Ar_1, Ar_2, Ar_3)) [ Ar_1 >= 0 /\ Ar_0 + Ar_1 >= 0 /\ Ar_0 >= 0 /\ Ar_2 >= Ar_0 + 1 ] (Comp: 2, Cost: 1) evalspeedSimpleMultiplebb1in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplebb3in(Ar_0, Ar_1, Ar_2, Ar_3)) [ Ar_1 >= 0 /\ Ar_0 + Ar_1 >= 0 /\ Ar_0 >= 0 /\ Ar_0 >= Ar_2 ] (Comp: Ar_3, Cost: 1) evalspeedSimpleMultiplebb2in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplebb1in(Ar_0, Ar_1 + 1, Ar_2, Ar_3)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 1 >= 0 /\ Ar_0 + Ar_2 - 1 >= 0 /\ -Ar_0 + Ar_2 - 1 >= 0 /\ Ar_1 >= 0 /\ Ar_0 + Ar_1 >= 0 /\ Ar_0 >= 0 /\ Ar_3 >= Ar_1 + 1 ] (Comp: Ar_2, Cost: 1) evalspeedSimpleMultiplebb2in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplebb1in(Ar_0 + 1, Ar_1, Ar_2, Ar_3)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 1 >= 0 /\ Ar_0 + Ar_2 - 1 >= 0 /\ -Ar_0 + Ar_2 - 1 >= 0 /\ Ar_1 >= 0 /\ Ar_0 + Ar_1 >= 0 /\ Ar_0 >= 0 /\ Ar_1 >= Ar_3 ] (Comp: 2, Cost: 1) evalspeedSimpleMultiplebb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplestop(Ar_0, Ar_1, Ar_2, Ar_3)) [ Ar_0 - Ar_2 >= 0 /\ Ar_1 >= 0 /\ Ar_0 + Ar_1 >= 0 /\ Ar_0 >= 0 ] start location: koat_start leaf cost: 0 Repeatedly propagating knowledge in problem 7 produces the following problem: 8: T: (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplestart(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ] (Comp: 1, Cost: 1) evalspeedSimpleMultiplestart(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplebb0in(Ar_0, Ar_1, Ar_2, Ar_3)) (Comp: 1, Cost: 1) evalspeedSimpleMultiplebb0in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplebb1in(0, 0, Ar_2, Ar_3)) (Comp: Ar_2 + Ar_3 + 1, Cost: 1) evalspeedSimpleMultiplebb1in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplebb2in(Ar_0, Ar_1, Ar_2, Ar_3)) [ Ar_1 >= 0 /\ Ar_0 + Ar_1 >= 0 /\ Ar_0 >= 0 /\ Ar_2 >= Ar_0 + 1 ] (Comp: 2, Cost: 1) evalspeedSimpleMultiplebb1in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplebb3in(Ar_0, Ar_1, Ar_2, Ar_3)) [ Ar_1 >= 0 /\ Ar_0 + Ar_1 >= 0 /\ Ar_0 >= 0 /\ Ar_0 >= Ar_2 ] (Comp: Ar_3, Cost: 1) evalspeedSimpleMultiplebb2in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplebb1in(Ar_0, Ar_1 + 1, Ar_2, Ar_3)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 1 >= 0 /\ Ar_0 + Ar_2 - 1 >= 0 /\ -Ar_0 + Ar_2 - 1 >= 0 /\ Ar_1 >= 0 /\ Ar_0 + Ar_1 >= 0 /\ Ar_0 >= 0 /\ Ar_3 >= Ar_1 + 1 ] (Comp: Ar_2, Cost: 1) evalspeedSimpleMultiplebb2in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplebb1in(Ar_0 + 1, Ar_1, Ar_2, Ar_3)) [ Ar_2 - 1 >= 0 /\ Ar_1 + Ar_2 - 1 >= 0 /\ Ar_0 + Ar_2 - 1 >= 0 /\ -Ar_0 + Ar_2 - 1 >= 0 /\ Ar_1 >= 0 /\ Ar_0 + Ar_1 >= 0 /\ Ar_0 >= 0 /\ Ar_1 >= Ar_3 ] (Comp: 2, Cost: 1) evalspeedSimpleMultiplebb3in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(evalspeedSimpleMultiplestop(Ar_0, Ar_1, Ar_2, Ar_3)) [ Ar_0 - Ar_2 >= 0 /\ Ar_1 >= 0 /\ Ar_0 + Ar_1 >= 0 /\ Ar_0 >= 0 ] start location: koat_start leaf cost: 0 Complexity upper bound 2*Ar_2 + 2*Ar_3 + 7 Time: 0.155 sec (SMT: 0.130 sec) ---------------------------------------- (2) BOUNDS(1, n^1)