/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^2)) 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^2). (0) CpxIntTrs (1) Koat Proof [FINISHED, 76 ms] (2) BOUNDS(1, n^2) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_jama_ex1_start(v_i.0, v_j.0, v_n) -> Com_1(eval_jama_ex1_bb0_in(v_i.0, v_j.0, v_n)) :|: TRUE eval_jama_ex1_bb0_in(v_i.0, v_j.0, v_n) -> Com_1(eval_jama_ex1_bb1_in(1, v_j.0, v_n)) :|: TRUE eval_jama_ex1_bb1_in(v_i.0, v_j.0, v_n) -> Com_1(eval_jama_ex1_bb2_in(v_i.0, 1, v_n)) :|: v_i.0 <= v_n eval_jama_ex1_bb1_in(v_i.0, v_j.0, v_n) -> Com_1(eval_jama_ex1_bb5_in(v_i.0, v_j.0, v_n)) :|: v_i.0 > v_n eval_jama_ex1_bb2_in(v_i.0, v_j.0, v_n) -> Com_1(eval_jama_ex1_bb3_in(v_i.0, v_j.0, v_n)) :|: v_j.0 <= v_n eval_jama_ex1_bb2_in(v_i.0, v_j.0, v_n) -> Com_1(eval_jama_ex1_bb4_in(v_i.0, v_j.0, v_n)) :|: v_j.0 > v_n eval_jama_ex1_bb3_in(v_i.0, v_j.0, v_n) -> Com_1(eval_jama_ex1_bb2_in(v_i.0, v_j.0 + 1, v_n)) :|: TRUE eval_jama_ex1_bb4_in(v_i.0, v_j.0, v_n) -> Com_1(eval_jama_ex1_bb1_in(v_i.0 + 1, v_j.0, v_n)) :|: TRUE eval_jama_ex1_bb5_in(v_i.0, v_j.0, v_n) -> Com_1(eval_jama_ex1_stop(v_i.0, v_j.0, v_n)) :|: TRUE The start-symbols are:[eval_jama_ex1_start_3] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 9*Ar_1 + 2*Ar_1^2 + 6) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) evaljamaex1start(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb0in(Ar_0, Ar_1, Ar_2)) (Comp: ?, Cost: 1) evaljamaex1bb0in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb1in(1, Ar_1, Ar_2)) (Comp: ?, Cost: 1) evaljamaex1bb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb2in(Ar_0, Ar_1, 1)) [ Ar_1 >= Ar_0 ] (Comp: ?, Cost: 1) evaljamaex1bb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb5in(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= Ar_1 + 1 ] (Comp: ?, Cost: 1) evaljamaex1bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb3in(Ar_0, Ar_1, Ar_2)) [ Ar_1 >= Ar_2 ] (Comp: ?, Cost: 1) evaljamaex1bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb4in(Ar_0, Ar_1, Ar_2)) [ Ar_2 >= Ar_1 + 1 ] (Comp: ?, Cost: 1) evaljamaex1bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb2in(Ar_0, Ar_1, Ar_2 + 1)) (Comp: ?, Cost: 1) evaljamaex1bb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb1in(Ar_0 + 1, Ar_1, Ar_2)) (Comp: ?, Cost: 1) evaljamaex1bb5in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1stop(Ar_0, Ar_1, Ar_2)) (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1start(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) evaljamaex1start(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb0in(Ar_0, Ar_1, Ar_2)) (Comp: 1, Cost: 1) evaljamaex1bb0in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb1in(1, Ar_1, Ar_2)) (Comp: ?, Cost: 1) evaljamaex1bb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb2in(Ar_0, Ar_1, 1)) [ Ar_1 >= Ar_0 ] (Comp: ?, Cost: 1) evaljamaex1bb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb5in(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= Ar_1 + 1 ] (Comp: ?, Cost: 1) evaljamaex1bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb3in(Ar_0, Ar_1, Ar_2)) [ Ar_1 >= Ar_2 ] (Comp: ?, Cost: 1) evaljamaex1bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb4in(Ar_0, Ar_1, Ar_2)) [ Ar_2 >= Ar_1 + 1 ] (Comp: ?, Cost: 1) evaljamaex1bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb2in(Ar_0, Ar_1, Ar_2 + 1)) (Comp: ?, Cost: 1) evaljamaex1bb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb1in(Ar_0 + 1, Ar_1, Ar_2)) (Comp: ?, Cost: 1) evaljamaex1bb5in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1stop(Ar_0, Ar_1, Ar_2)) (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1start(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 A polynomial rank function with Pol(evaljamaex1start) = 2 Pol(evaljamaex1bb0in) = 2 Pol(evaljamaex1bb1in) = 2 Pol(evaljamaex1bb2in) = 2 Pol(evaljamaex1bb5in) = 1 Pol(evaljamaex1bb3in) = 2 Pol(evaljamaex1bb4in) = 2 Pol(evaljamaex1stop) = 0 Pol(koat_start) = 2 orients all transitions weakly and the transitions evaljamaex1bb5in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1stop(Ar_0, Ar_1, Ar_2)) evaljamaex1bb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb5in(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= Ar_1 + 1 ] strictly and produces the following problem: 3: T: (Comp: 1, Cost: 1) evaljamaex1start(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb0in(Ar_0, Ar_1, Ar_2)) (Comp: 1, Cost: 1) evaljamaex1bb0in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb1in(1, Ar_1, Ar_2)) (Comp: ?, Cost: 1) evaljamaex1bb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb2in(Ar_0, Ar_1, 1)) [ Ar_1 >= Ar_0 ] (Comp: 2, Cost: 1) evaljamaex1bb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb5in(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= Ar_1 + 1 ] (Comp: ?, Cost: 1) evaljamaex1bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb3in(Ar_0, Ar_1, Ar_2)) [ Ar_1 >= Ar_2 ] (Comp: ?, Cost: 1) evaljamaex1bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb4in(Ar_0, Ar_1, Ar_2)) [ Ar_2 >= Ar_1 + 1 ] (Comp: ?, Cost: 1) evaljamaex1bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb2in(Ar_0, Ar_1, Ar_2 + 1)) (Comp: ?, Cost: 1) evaljamaex1bb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb1in(Ar_0 + 1, Ar_1, Ar_2)) (Comp: 2, Cost: 1) evaljamaex1bb5in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1stop(Ar_0, Ar_1, Ar_2)) (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1start(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 A polynomial rank function with Pol(evaljamaex1start) = V_2 Pol(evaljamaex1bb0in) = V_2 Pol(evaljamaex1bb1in) = -V_1 + V_2 + 1 Pol(evaljamaex1bb2in) = -V_1 + V_2 Pol(evaljamaex1bb5in) = -V_1 + V_2 Pol(evaljamaex1bb3in) = -V_1 + V_2 Pol(evaljamaex1bb4in) = -V_1 + V_2 Pol(evaljamaex1stop) = -V_1 + V_2 Pol(koat_start) = V_2 orients all transitions weakly and the transition evaljamaex1bb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb2in(Ar_0, Ar_1, 1)) [ Ar_1 >= Ar_0 ] strictly and produces the following problem: 4: T: (Comp: 1, Cost: 1) evaljamaex1start(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb0in(Ar_0, Ar_1, Ar_2)) (Comp: 1, Cost: 1) evaljamaex1bb0in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb1in(1, Ar_1, Ar_2)) (Comp: Ar_1, Cost: 1) evaljamaex1bb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb2in(Ar_0, Ar_1, 1)) [ Ar_1 >= Ar_0 ] (Comp: 2, Cost: 1) evaljamaex1bb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb5in(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= Ar_1 + 1 ] (Comp: ?, Cost: 1) evaljamaex1bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb3in(Ar_0, Ar_1, Ar_2)) [ Ar_1 >= Ar_2 ] (Comp: ?, Cost: 1) evaljamaex1bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb4in(Ar_0, Ar_1, Ar_2)) [ Ar_2 >= Ar_1 + 1 ] (Comp: ?, Cost: 1) evaljamaex1bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb2in(Ar_0, Ar_1, Ar_2 + 1)) (Comp: ?, Cost: 1) evaljamaex1bb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb1in(Ar_0 + 1, Ar_1, Ar_2)) (Comp: 2, Cost: 1) evaljamaex1bb5in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1stop(Ar_0, Ar_1, Ar_2)) (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1start(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 A polynomial rank function with Pol(evaljamaex1bb4in) = 1 Pol(evaljamaex1bb1in) = 0 Pol(evaljamaex1bb3in) = 2 Pol(evaljamaex1bb2in) = 2 and size complexities S("koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1start(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]", 0-0) = Ar_0 S("koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1start(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]", 0-1) = Ar_1 S("koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1start(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]", 0-2) = Ar_2 S("evaljamaex1bb5in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1stop(Ar_0, Ar_1, Ar_2))", 0-0) = ? S("evaljamaex1bb5in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1stop(Ar_0, Ar_1, Ar_2))", 0-1) = Ar_1 S("evaljamaex1bb5in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1stop(Ar_0, Ar_1, Ar_2))", 0-2) = ? S("evaljamaex1bb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb1in(Ar_0 + 1, Ar_1, Ar_2))", 0-0) = ? S("evaljamaex1bb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb1in(Ar_0 + 1, Ar_1, Ar_2))", 0-1) = Ar_1 S("evaljamaex1bb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb1in(Ar_0 + 1, Ar_1, Ar_2))", 0-2) = ? S("evaljamaex1bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb2in(Ar_0, Ar_1, Ar_2 + 1))", 0-0) = ? S("evaljamaex1bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb2in(Ar_0, Ar_1, Ar_2 + 1))", 0-1) = Ar_1 S("evaljamaex1bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb2in(Ar_0, Ar_1, Ar_2 + 1))", 0-2) = ? S("evaljamaex1bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb4in(Ar_0, Ar_1, Ar_2)) [ Ar_2 >= Ar_1 + 1 ]", 0-0) = ? S("evaljamaex1bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb4in(Ar_0, Ar_1, Ar_2)) [ Ar_2 >= Ar_1 + 1 ]", 0-1) = Ar_1 S("evaljamaex1bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb4in(Ar_0, Ar_1, Ar_2)) [ Ar_2 >= Ar_1 + 1 ]", 0-2) = ? S("evaljamaex1bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb3in(Ar_0, Ar_1, Ar_2)) [ Ar_1 >= Ar_2 ]", 0-0) = ? S("evaljamaex1bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb3in(Ar_0, Ar_1, Ar_2)) [ Ar_1 >= Ar_2 ]", 0-1) = Ar_1 S("evaljamaex1bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb3in(Ar_0, Ar_1, Ar_2)) [ Ar_1 >= Ar_2 ]", 0-2) = ? S("evaljamaex1bb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb5in(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= Ar_1 + 1 ]", 0-0) = ? S("evaljamaex1bb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb5in(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= Ar_1 + 1 ]", 0-1) = Ar_1 S("evaljamaex1bb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb5in(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= Ar_1 + 1 ]", 0-2) = ? S("evaljamaex1bb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb2in(Ar_0, Ar_1, 1)) [ Ar_1 >= Ar_0 ]", 0-0) = ? S("evaljamaex1bb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb2in(Ar_0, Ar_1, 1)) [ Ar_1 >= Ar_0 ]", 0-1) = Ar_1 S("evaljamaex1bb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb2in(Ar_0, Ar_1, 1)) [ Ar_1 >= Ar_0 ]", 0-2) = 1 S("evaljamaex1bb0in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb1in(1, Ar_1, Ar_2))", 0-0) = 1 S("evaljamaex1bb0in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb1in(1, Ar_1, Ar_2))", 0-1) = Ar_1 S("evaljamaex1bb0in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb1in(1, Ar_1, Ar_2))", 0-2) = Ar_2 S("evaljamaex1start(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb0in(Ar_0, Ar_1, Ar_2))", 0-0) = Ar_0 S("evaljamaex1start(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb0in(Ar_0, Ar_1, Ar_2))", 0-1) = Ar_1 S("evaljamaex1start(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb0in(Ar_0, Ar_1, Ar_2))", 0-2) = Ar_2 orients the transitions evaljamaex1bb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb1in(Ar_0 + 1, Ar_1, Ar_2)) evaljamaex1bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb2in(Ar_0, Ar_1, Ar_2 + 1)) evaljamaex1bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb4in(Ar_0, Ar_1, Ar_2)) [ Ar_2 >= Ar_1 + 1 ] evaljamaex1bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb3in(Ar_0, Ar_1, Ar_2)) [ Ar_1 >= Ar_2 ] weakly and the transitions evaljamaex1bb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb1in(Ar_0 + 1, Ar_1, Ar_2)) evaljamaex1bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb4in(Ar_0, Ar_1, Ar_2)) [ Ar_2 >= Ar_1 + 1 ] strictly and produces the following problem: 5: T: (Comp: 1, Cost: 1) evaljamaex1start(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb0in(Ar_0, Ar_1, Ar_2)) (Comp: 1, Cost: 1) evaljamaex1bb0in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb1in(1, Ar_1, Ar_2)) (Comp: Ar_1, Cost: 1) evaljamaex1bb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb2in(Ar_0, Ar_1, 1)) [ Ar_1 >= Ar_0 ] (Comp: 2, Cost: 1) evaljamaex1bb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb5in(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= Ar_1 + 1 ] (Comp: ?, Cost: 1) evaljamaex1bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb3in(Ar_0, Ar_1, Ar_2)) [ Ar_1 >= Ar_2 ] (Comp: 2*Ar_1, Cost: 1) evaljamaex1bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb4in(Ar_0, Ar_1, Ar_2)) [ Ar_2 >= Ar_1 + 1 ] (Comp: ?, Cost: 1) evaljamaex1bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb2in(Ar_0, Ar_1, Ar_2 + 1)) (Comp: 2*Ar_1, Cost: 1) evaljamaex1bb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb1in(Ar_0 + 1, Ar_1, Ar_2)) (Comp: 2, Cost: 1) evaljamaex1bb5in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1stop(Ar_0, Ar_1, Ar_2)) (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1start(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 A polynomial rank function with Pol(evaljamaex1bb3in) = V_2 - V_3 Pol(evaljamaex1bb2in) = V_2 - V_3 + 1 and size complexities S("koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1start(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]", 0-0) = Ar_0 S("koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1start(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]", 0-1) = Ar_1 S("koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1start(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]", 0-2) = Ar_2 S("evaljamaex1bb5in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1stop(Ar_0, Ar_1, Ar_2))", 0-0) = 2*Ar_1 + 20 S("evaljamaex1bb5in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1stop(Ar_0, Ar_1, Ar_2))", 0-1) = Ar_1 S("evaljamaex1bb5in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1stop(Ar_0, Ar_1, Ar_2))", 0-2) = ? S("evaljamaex1bb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb1in(Ar_0 + 1, Ar_1, Ar_2))", 0-0) = 2*Ar_1 + 4 S("evaljamaex1bb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb1in(Ar_0 + 1, Ar_1, Ar_2))", 0-1) = Ar_1 S("evaljamaex1bb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb1in(Ar_0 + 1, Ar_1, Ar_2))", 0-2) = ? S("evaljamaex1bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb2in(Ar_0, Ar_1, Ar_2 + 1))", 0-0) = 2*Ar_1 + 4 S("evaljamaex1bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb2in(Ar_0, Ar_1, Ar_2 + 1))", 0-1) = Ar_1 S("evaljamaex1bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb2in(Ar_0, Ar_1, Ar_2 + 1))", 0-2) = ? S("evaljamaex1bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb4in(Ar_0, Ar_1, Ar_2)) [ Ar_2 >= Ar_1 + 1 ]", 0-0) = 2*Ar_1 + 4 S("evaljamaex1bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb4in(Ar_0, Ar_1, Ar_2)) [ Ar_2 >= Ar_1 + 1 ]", 0-1) = Ar_1 S("evaljamaex1bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb4in(Ar_0, Ar_1, Ar_2)) [ Ar_2 >= Ar_1 + 1 ]", 0-2) = ? S("evaljamaex1bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb3in(Ar_0, Ar_1, Ar_2)) [ Ar_1 >= Ar_2 ]", 0-0) = 2*Ar_1 + 4 S("evaljamaex1bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb3in(Ar_0, Ar_1, Ar_2)) [ Ar_1 >= Ar_2 ]", 0-1) = Ar_1 S("evaljamaex1bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb3in(Ar_0, Ar_1, Ar_2)) [ Ar_1 >= Ar_2 ]", 0-2) = ? S("evaljamaex1bb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb5in(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= Ar_1 + 1 ]", 0-0) = 2*Ar_1 + 10 S("evaljamaex1bb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb5in(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= Ar_1 + 1 ]", 0-1) = Ar_1 S("evaljamaex1bb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb5in(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= Ar_1 + 1 ]", 0-2) = ? S("evaljamaex1bb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb2in(Ar_0, Ar_1, 1)) [ Ar_1 >= Ar_0 ]", 0-0) = 2*Ar_1 + 4 S("evaljamaex1bb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb2in(Ar_0, Ar_1, 1)) [ Ar_1 >= Ar_0 ]", 0-1) = Ar_1 S("evaljamaex1bb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb2in(Ar_0, Ar_1, 1)) [ Ar_1 >= Ar_0 ]", 0-2) = 1 S("evaljamaex1bb0in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb1in(1, Ar_1, Ar_2))", 0-0) = 1 S("evaljamaex1bb0in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb1in(1, Ar_1, Ar_2))", 0-1) = Ar_1 S("evaljamaex1bb0in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb1in(1, Ar_1, Ar_2))", 0-2) = Ar_2 S("evaljamaex1start(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb0in(Ar_0, Ar_1, Ar_2))", 0-0) = Ar_0 S("evaljamaex1start(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb0in(Ar_0, Ar_1, Ar_2))", 0-1) = Ar_1 S("evaljamaex1start(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb0in(Ar_0, Ar_1, Ar_2))", 0-2) = Ar_2 orients the transitions evaljamaex1bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb2in(Ar_0, Ar_1, Ar_2 + 1)) evaljamaex1bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb3in(Ar_0, Ar_1, Ar_2)) [ Ar_1 >= Ar_2 ] weakly and the transition evaljamaex1bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb3in(Ar_0, Ar_1, Ar_2)) [ Ar_1 >= Ar_2 ] strictly and produces the following problem: 6: T: (Comp: 1, Cost: 1) evaljamaex1start(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb0in(Ar_0, Ar_1, Ar_2)) (Comp: 1, Cost: 1) evaljamaex1bb0in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb1in(1, Ar_1, Ar_2)) (Comp: Ar_1, Cost: 1) evaljamaex1bb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb2in(Ar_0, Ar_1, 1)) [ Ar_1 >= Ar_0 ] (Comp: 2, Cost: 1) evaljamaex1bb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb5in(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= Ar_1 + 1 ] (Comp: Ar_1^2 + 2*Ar_1, Cost: 1) evaljamaex1bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb3in(Ar_0, Ar_1, Ar_2)) [ Ar_1 >= Ar_2 ] (Comp: 2*Ar_1, Cost: 1) evaljamaex1bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb4in(Ar_0, Ar_1, Ar_2)) [ Ar_2 >= Ar_1 + 1 ] (Comp: ?, Cost: 1) evaljamaex1bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb2in(Ar_0, Ar_1, Ar_2 + 1)) (Comp: 2*Ar_1, Cost: 1) evaljamaex1bb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb1in(Ar_0 + 1, Ar_1, Ar_2)) (Comp: 2, Cost: 1) evaljamaex1bb5in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1stop(Ar_0, Ar_1, Ar_2)) (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1start(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 Repeatedly propagating knowledge in problem 6 produces the following problem: 7: T: (Comp: 1, Cost: 1) evaljamaex1start(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb0in(Ar_0, Ar_1, Ar_2)) (Comp: 1, Cost: 1) evaljamaex1bb0in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb1in(1, Ar_1, Ar_2)) (Comp: Ar_1, Cost: 1) evaljamaex1bb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb2in(Ar_0, Ar_1, 1)) [ Ar_1 >= Ar_0 ] (Comp: 2, Cost: 1) evaljamaex1bb1in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb5in(Ar_0, Ar_1, Ar_2)) [ Ar_0 >= Ar_1 + 1 ] (Comp: Ar_1^2 + 2*Ar_1, Cost: 1) evaljamaex1bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb3in(Ar_0, Ar_1, Ar_2)) [ Ar_1 >= Ar_2 ] (Comp: 2*Ar_1, Cost: 1) evaljamaex1bb2in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb4in(Ar_0, Ar_1, Ar_2)) [ Ar_2 >= Ar_1 + 1 ] (Comp: Ar_1^2 + 2*Ar_1, Cost: 1) evaljamaex1bb3in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb2in(Ar_0, Ar_1, Ar_2 + 1)) (Comp: 2*Ar_1, Cost: 1) evaljamaex1bb4in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1bb1in(Ar_0 + 1, Ar_1, Ar_2)) (Comp: 2, Cost: 1) evaljamaex1bb5in(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1stop(Ar_0, Ar_1, Ar_2)) (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(evaljamaex1start(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 Complexity upper bound 9*Ar_1 + 2*Ar_1^2 + 6 Time: 0.068 sec (SMT: 0.054 sec) ---------------------------------------- (2) BOUNDS(1, n^2)