372.91/291.64 WORST_CASE(Omega(n^1), ?) 372.91/291.66 proof of /export/starexec/sandbox2/benchmark/theBenchmark.koat 372.91/291.66 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 372.91/291.66 372.91/291.66 372.91/291.66 The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(n^1, INF). 372.91/291.66 372.91/291.66 (0) CpxIntTrs 372.91/291.66 (1) Loat Proof [FINISHED, 35.7 s] 372.91/291.66 (2) BOUNDS(n^1, INF) 372.91/291.66 372.91/291.66 372.91/291.66 ---------------------------------------- 372.91/291.66 372.91/291.66 (0) 372.91/291.66 Obligation: 372.91/291.66 Complexity Int TRS consisting of the following rules: 372.91/291.66 eval_bin_search_StepSize2_start(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s) -> Com_1(eval_bin_search_StepSize2_bb0_in(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s)) :|: TRUE 372.91/291.66 eval_bin_search_StepSize2_bb0_in(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s) -> Com_1(eval_bin_search_StepSize2_0(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s)) :|: TRUE 372.91/291.66 eval_bin_search_StepSize2_0(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s) -> Com_1(eval_bin_search_StepSize2_1(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s)) :|: TRUE 372.91/291.66 eval_bin_search_StepSize2_1(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s) -> Com_1(eval_bin_search_StepSize2_2(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s)) :|: TRUE 372.91/291.66 eval_bin_search_StepSize2_2(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s) -> Com_1(eval_bin_search_StepSize2_3(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s)) :|: TRUE 372.91/291.66 eval_bin_search_StepSize2_3(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s) -> Com_1(eval_bin_search_StepSize2_4(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s)) :|: TRUE 372.91/291.66 eval_bin_search_StepSize2_4(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s) -> Com_1(eval_bin_search_StepSize2_5(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s)) :|: TRUE 372.91/291.66 eval_bin_search_StepSize2_5(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s) -> Com_1(eval_bin_search_StepSize2_6(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s)) :|: TRUE 372.91/291.66 eval_bin_search_StepSize2_6(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s) -> Com_1(eval_bin_search_StepSize2_7(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s)) :|: TRUE 372.91/291.66 eval_bin_search_StepSize2_7(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s) -> Com_1(eval_bin_search_StepSize2_8(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s)) :|: TRUE 372.91/291.66 eval_bin_search_StepSize2_8(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s) -> Com_1(eval_bin_search_StepSize2_9(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s)) :|: TRUE 372.91/291.66 eval_bin_search_StepSize2_9(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s) -> Com_1(eval_bin_search_StepSize2_10(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s)) :|: TRUE 372.91/291.66 eval_bin_search_StepSize2_10(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s) -> Com_1(eval_bin_search_StepSize2_11(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s)) :|: TRUE 372.91/291.66 eval_bin_search_StepSize2_11(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s) -> Com_1(eval_bin_search_StepSize2_12(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s)) :|: TRUE 372.91/291.66 eval_bin_search_StepSize2_12(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s) -> Com_1(eval_bin_search_StepSize2_13(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s)) :|: TRUE 372.91/291.66 eval_bin_search_StepSize2_13(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s) -> Com_1(eval_bin_search_StepSize2_14(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s)) :|: TRUE 372.91/291.66 eval_bin_search_StepSize2_14(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s) -> Com_1(eval_bin_search_StepSize2_15(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s)) :|: TRUE 372.91/291.66 eval_bin_search_StepSize2_15(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s) -> Com_1(eval_bin_search_StepSize2_bb1_in(v_s, v_0, 4, v_c_1, v_c_2, v_c_3, 0, 0, v_f_1, v_f_2, v_r, v_s)) :|: TRUE 372.91/291.66 eval_bin_search_StepSize2_bb1_in(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s) -> Com_1(eval_bin_search_StepSize2_16(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s)) :|: TRUE 372.91/291.66 eval_bin_search_StepSize2_16(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s) -> Com_1(eval_bin_search_StepSize2_17(v__0, nondef_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s)) :|: TRUE 372.91/291.66 eval_bin_search_StepSize2_17(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s) -> Com_1(eval_bin_search_StepSize2_bb12_in(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s)) :|: v_c_0 >= 1 && v_c_0 <= 1 372.91/291.66 eval_bin_search_StepSize2_17(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s) -> Com_1(eval_bin_search_StepSize2_bb2_in(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s)) :|: v_c_0 < 1 372.91/291.66 eval_bin_search_StepSize2_17(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s) -> Com_1(eval_bin_search_StepSize2_bb2_in(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s)) :|: v_c_0 > 1 372.91/291.66 eval_bin_search_StepSize2_bb2_in(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s) -> Com_1(eval_bin_search_StepSize2_bb3_in(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s)) :|: v_f_0 < 0 372.91/291.66 eval_bin_search_StepSize2_bb2_in(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s) -> Com_1(eval_bin_search_StepSize2_bb3_in(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s)) :|: v_f_0 > 0 372.91/291.66 eval_bin_search_StepSize2_bb2_in(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s) -> Com_1(eval_bin_search_StepSize2_bb4_in(v__0, v_0, v_c_0, v_c_0, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s)) :|: v_f_0 >= 0 && v_f_0 <= 0 372.91/291.66 eval_bin_search_StepSize2_bb3_in(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s) -> Com_1(eval_bin_search_StepSize2_bb4_in(v__0, v_0, v_c_0, nondef_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s)) :|: v_c_0 >= 0 && v_c_0 <= 0 && nondef_1 >= 0 && nondef_1 <= 0 372.91/291.66 eval_bin_search_StepSize2_bb3_in(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s) -> Com_1(eval_bin_search_StepSize2_bb4_in(v__0, v_0, v_c_0, nondef_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s)) :|: v_c_0 > 0 && nondef_1 >= 0 && v_c_0 - 2 * nondef_1 >= 0 && v_c_0 - 2 * nondef_1 < 2 372.91/291.66 eval_bin_search_StepSize2_bb3_in(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s) -> Com_1(eval_bin_search_StepSize2_bb4_in(v__0, v_0, v_c_0, nondef_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s)) :|: v_c_0 < 0 && nondef_1 <= 0 && -(v_c_0) + 2 * nondef_1 >= 0 && -(v_c_0) + 2 * nondef_1 < 2 372.91/291.66 eval_bin_search_StepSize2_bb4_in(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s) -> Com_1(eval_bin_search_StepSize2_bb5_in(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s)) :|: v_0 > v_r 372.91/291.66 eval_bin_search_StepSize2_bb4_in(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s) -> Com_1(eval_bin_search_StepSize2_bb8_in(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s)) :|: v_0 <= v_r 372.91/291.66 eval_bin_search_StepSize2_bb5_in(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s) -> Com_1(eval_bin_search_StepSize2_bb7_in(v__0, v_0, v_c_0, v_c_1, v_c_1, v_c_3, v_d_0, v_f_0, v_f_0, v_f_2, v_r, v_s)) :|: v_d_0 < 1 372.91/291.66 eval_bin_search_StepSize2_bb5_in(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s) -> Com_1(eval_bin_search_StepSize2_bb7_in(v__0, v_0, v_c_0, v_c_1, v_c_1, v_c_3, v_d_0, v_f_0, v_f_0, v_f_2, v_r, v_s)) :|: v_d_0 > 1 372.91/291.66 eval_bin_search_StepSize2_bb5_in(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s) -> Com_1(eval_bin_search_StepSize2_bb7_in(v__0, v_0, v_c_0, v_c_1, v_c_1, v_c_3, v_d_0, v_f_0, v_f_0, v_f_2, v_r, v_s)) :|: v_f_0 < 0 372.91/291.66 eval_bin_search_StepSize2_bb5_in(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s) -> Com_1(eval_bin_search_StepSize2_bb7_in(v__0, v_0, v_c_0, v_c_1, v_c_1, v_c_3, v_d_0, v_f_0, v_f_0, v_f_2, v_r, v_s)) :|: v_f_0 > 0 372.91/291.66 eval_bin_search_StepSize2_bb5_in(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s) -> Com_1(eval_bin_search_StepSize2_bb6_in(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s)) :|: v_d_0 >= 1 && v_d_0 <= 1 && v_f_0 >= 0 && v_f_0 <= 0 372.91/291.66 eval_bin_search_StepSize2_bb6_in(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s) -> Com_1(eval_bin_search_StepSize2_bb7_in(v__0, v_0, v_c_0, v_c_1, nondef_2, v_c_3, v_d_0, v_f_0, 1, v_f_2, v_r, v_s)) :|: v_c_1 >= 0 && v_c_1 <= 0 && nondef_2 >= 0 && nondef_2 <= 0 372.91/291.66 eval_bin_search_StepSize2_bb6_in(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s) -> Com_1(eval_bin_search_StepSize2_bb7_in(v__0, v_0, v_c_0, v_c_1, nondef_2, v_c_3, v_d_0, v_f_0, 1, v_f_2, v_r, v_s)) :|: v_c_1 > 0 && nondef_2 >= 0 && v_c_1 - 2 * nondef_2 >= 0 && v_c_1 - 2 * nondef_2 < 2 372.91/291.66 eval_bin_search_StepSize2_bb6_in(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s) -> Com_1(eval_bin_search_StepSize2_bb7_in(v__0, v_0, v_c_0, v_c_1, nondef_2, v_c_3, v_d_0, v_f_0, 1, v_f_2, v_r, v_s)) :|: v_c_1 < 0 && nondef_2 <= 0 && -(v_c_1) + 2 * nondef_2 >= 0 && -(v_c_1) + 2 * nondef_2 < 2 372.91/291.66 eval_bin_search_StepSize2_bb7_in(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s) -> Com_1(eval_bin_search_StepSize2_bb12_in(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s)) :|: v__0 + v_c_2 > 255 372.91/291.66 eval_bin_search_StepSize2_bb7_in(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s) -> Com_1(eval_bin_search_StepSize2_bb1_in(v__0 + v_c_2, v_0, v_c_2, v_c_1, v_c_2, v_c_3, 2, v_f_1, v_f_1, v_f_2, v_r, v_s)) :|: v__0 + v_c_2 <= 255 372.91/291.66 eval_bin_search_StepSize2_bb8_in(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s) -> Com_1(eval_bin_search_StepSize2_bb9_in(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s)) :|: v_0 < v_r 372.91/291.66 eval_bin_search_StepSize2_bb8_in(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s) -> Com_1(eval_bin_search_StepSize2_bb12_in(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s)) :|: v_0 >= v_r 372.91/291.66 eval_bin_search_StepSize2_bb9_in(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s) -> Com_1(eval_bin_search_StepSize2_bb11_in(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_1, v_d_0, v_f_0, v_f_1, v_f_0, v_r, v_s)) :|: v_d_0 < 2 372.91/291.66 eval_bin_search_StepSize2_bb9_in(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s) -> Com_1(eval_bin_search_StepSize2_bb11_in(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_1, v_d_0, v_f_0, v_f_1, v_f_0, v_r, v_s)) :|: v_d_0 > 2 372.91/291.66 eval_bin_search_StepSize2_bb9_in(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s) -> Com_1(eval_bin_search_StepSize2_bb11_in(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_1, v_d_0, v_f_0, v_f_1, v_f_0, v_r, v_s)) :|: v_f_0 < 0 372.91/291.66 eval_bin_search_StepSize2_bb9_in(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s) -> Com_1(eval_bin_search_StepSize2_bb11_in(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_1, v_d_0, v_f_0, v_f_1, v_f_0, v_r, v_s)) :|: v_f_0 > 0 372.91/291.66 eval_bin_search_StepSize2_bb9_in(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s) -> Com_1(eval_bin_search_StepSize2_bb10_in(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s)) :|: v_d_0 >= 2 && v_d_0 <= 2 && v_f_0 >= 0 && v_f_0 <= 0 372.91/291.66 eval_bin_search_StepSize2_bb10_in(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s) -> Com_1(eval_bin_search_StepSize2_bb11_in(v__0, v_0, v_c_0, v_c_1, v_c_2, nondef_3, v_d_0, v_f_0, v_f_1, 1, v_r, v_s)) :|: v_c_1 >= 0 && v_c_1 <= 0 && nondef_3 >= 0 && nondef_3 <= 0 372.91/291.66 eval_bin_search_StepSize2_bb10_in(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s) -> Com_1(eval_bin_search_StepSize2_bb11_in(v__0, v_0, v_c_0, v_c_1, v_c_2, nondef_3, v_d_0, v_f_0, v_f_1, 1, v_r, v_s)) :|: v_c_1 > 0 && nondef_3 >= 0 && v_c_1 - 2 * nondef_3 >= 0 && v_c_1 - 2 * nondef_3 < 2 372.91/291.66 eval_bin_search_StepSize2_bb10_in(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s) -> Com_1(eval_bin_search_StepSize2_bb11_in(v__0, v_0, v_c_0, v_c_1, v_c_2, nondef_3, v_d_0, v_f_0, v_f_1, 1, v_r, v_s)) :|: v_c_1 < 0 && nondef_3 <= 0 && -(v_c_1) + 2 * nondef_3 >= 0 && -(v_c_1) + 2 * nondef_3 < 2 372.91/291.66 eval_bin_search_StepSize2_bb11_in(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s) -> Com_1(eval_bin_search_StepSize2_bb12_in(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s)) :|: v__0 - v_c_3 < 0 372.91/291.66 eval_bin_search_StepSize2_bb11_in(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s) -> Com_1(eval_bin_search_StepSize2_bb1_in(v__0 - v_c_3, v_0, v_c_3, v_c_1, v_c_2, v_c_3, 1, v_f_2, v_f_1, v_f_2, v_r, v_s)) :|: v__0 - v_c_3 >= 0 372.91/291.66 eval_bin_search_StepSize2_bb12_in(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s) -> Com_1(eval_bin_search_StepSize2_stop(v__0, v_0, v_c_0, v_c_1, v_c_2, v_c_3, v_d_0, v_f_0, v_f_1, v_f_2, v_r, v_s)) :|: TRUE 372.91/291.66 372.91/291.66 The start-symbols are:[eval_bin_search_StepSize2_start_12] 372.91/291.66 372.91/291.66 372.91/291.66 ---------------------------------------- 372.91/291.66 372.91/291.66 (1) Loat Proof (FINISHED) 372.91/291.66 372.91/291.66 372.91/291.66 ### Pre-processing the ITS problem ### 372.91/291.66 372.91/291.66 372.91/291.66 372.91/291.66 Initial linear ITS problem 372.91/291.66 372.91/291.66 Start location: evalbinsearchStepSize2start 372.91/291.66 372.91/291.66 0: evalbinsearchStepSize2start -> evalbinsearchStepSize2bb0in : [], cost: 1 372.91/291.66 372.91/291.66 1: evalbinsearchStepSize2bb0in -> evalbinsearchStepSize20 : [], cost: 1 372.91/291.66 372.91/291.66 2: evalbinsearchStepSize20 -> evalbinsearchStepSize21 : [], cost: 1 372.91/291.66 372.91/291.66 3: evalbinsearchStepSize21 -> evalbinsearchStepSize22 : [], cost: 1 372.91/291.66 372.91/291.66 4: evalbinsearchStepSize22 -> evalbinsearchStepSize23 : [], cost: 1 372.91/291.66 372.91/291.66 5: evalbinsearchStepSize23 -> evalbinsearchStepSize24 : [], cost: 1 372.91/291.66 372.91/291.66 6: evalbinsearchStepSize24 -> evalbinsearchStepSize25 : [], cost: 1 372.91/291.66 372.91/291.66 7: evalbinsearchStepSize25 -> evalbinsearchStepSize26 : [], cost: 1 372.91/291.66 372.91/291.66 8: evalbinsearchStepSize26 -> evalbinsearchStepSize27 : [], cost: 1 372.91/291.66 372.91/291.66 9: evalbinsearchStepSize27 -> evalbinsearchStepSize28 : [], cost: 1 372.91/291.66 372.91/291.66 10: evalbinsearchStepSize28 -> evalbinsearchStepSize29 : [], cost: 1 372.91/291.66 372.91/291.66 11: evalbinsearchStepSize29 -> evalbinsearchStepSize210 : [], cost: 1 372.91/291.66 372.91/291.66 12: evalbinsearchStepSize210 -> evalbinsearchStepSize211 : [], cost: 1 372.91/291.66 372.91/291.66 13: evalbinsearchStepSize211 -> evalbinsearchStepSize212 : [], cost: 1 372.91/291.66 372.91/291.66 14: evalbinsearchStepSize212 -> evalbinsearchStepSize213 : [], cost: 1 372.91/291.66 372.91/291.66 15: evalbinsearchStepSize213 -> evalbinsearchStepSize214 : [], cost: 1 372.91/291.66 372.91/291.66 16: evalbinsearchStepSize214 -> evalbinsearchStepSize215 : [], cost: 1 372.91/291.66 372.91/291.66 17: evalbinsearchStepSize215 -> evalbinsearchStepSize2bb1in : A'=B, C'=4, D'=0, E'=0, [], cost: 1 372.91/291.66 372.91/291.66 18: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize216 : [], cost: 1 372.91/291.66 372.91/291.66 19: evalbinsearchStepSize216 -> evalbinsearchStepSize217 : F'=free, [], cost: 1 372.91/291.66 372.91/291.66 20: evalbinsearchStepSize217 -> evalbinsearchStepSize2bb12in : [ C==1 ], cost: 1 372.91/291.66 372.91/291.66 21: evalbinsearchStepSize217 -> evalbinsearchStepSize2bb2in : [ 0>=C ], cost: 1 372.91/291.66 372.91/291.66 22: evalbinsearchStepSize217 -> evalbinsearchStepSize2bb2in : [ C>=2 ], cost: 1 372.91/291.66 372.91/291.66 23: evalbinsearchStepSize2bb2in -> evalbinsearchStepSize2bb3in : [ 0>=1+E ], cost: 1 372.91/291.66 372.91/291.66 24: evalbinsearchStepSize2bb2in -> evalbinsearchStepSize2bb3in : [ E>=1 ], cost: 1 372.91/291.66 372.91/291.66 25: evalbinsearchStepSize2bb2in -> evalbinsearchStepSize2bb4in : G'=C, [ E==0 ], cost: 1 372.91/291.66 372.91/291.66 26: evalbinsearchStepSize2bb3in -> evalbinsearchStepSize2bb4in : G'=0, [ C==0 ], cost: 1 372.91/291.66 372.91/291.66 27: evalbinsearchStepSize2bb3in -> evalbinsearchStepSize2bb4in : G'=free_1, [ C>=1 && free_1>=0 && C>=2*free_1 && 1+2*free_1>=C ], cost: 1 372.91/291.66 372.91/291.66 28: evalbinsearchStepSize2bb3in -> evalbinsearchStepSize2bb4in : G'=free_2, [ 0>=1+C && 0>=free_2 && 2*free_2>=C && 1+C>=2*free_2 ], cost: 1 372.91/291.66 372.91/291.66 29: evalbinsearchStepSize2bb4in -> evalbinsearchStepSize2bb5in : [ F>=1+H ], cost: 1 372.91/291.66 372.91/291.66 30: evalbinsearchStepSize2bb4in -> evalbinsearchStepSize2bb8in : [ H>=F ], cost: 1 372.91/291.66 372.91/291.66 31: evalbinsearchStepSize2bb5in -> evalbinsearchStepSize2bb7in : Q'=G, J'=E, [ 0>=D ], cost: 1 372.91/291.66 372.91/291.66 32: evalbinsearchStepSize2bb5in -> evalbinsearchStepSize2bb7in : Q'=G, J'=E, [ D>=2 ], cost: 1 372.91/291.66 372.91/291.66 33: evalbinsearchStepSize2bb5in -> evalbinsearchStepSize2bb7in : Q'=G, J'=E, [ 0>=1+E ], cost: 1 372.91/291.66 372.91/291.66 34: evalbinsearchStepSize2bb5in -> evalbinsearchStepSize2bb7in : Q'=G, J'=E, [ E>=1 ], cost: 1 372.91/291.66 372.91/291.66 35: evalbinsearchStepSize2bb5in -> evalbinsearchStepSize2bb6in : [ D==1 && E==0 ], cost: 1 372.91/291.66 372.91/291.66 36: evalbinsearchStepSize2bb6in -> evalbinsearchStepSize2bb7in : Q'=0, J'=1, [ G==0 ], cost: 1 372.91/291.66 372.91/291.66 37: evalbinsearchStepSize2bb6in -> evalbinsearchStepSize2bb7in : Q'=free_3, J'=1, [ G>=1 && free_3>=0 && G>=2*free_3 && 1+2*free_3>=G ], cost: 1 372.91/291.66 372.91/291.66 38: evalbinsearchStepSize2bb6in -> evalbinsearchStepSize2bb7in : Q'=free_4, J'=1, [ 0>=1+G && 0>=free_4 && 2*free_4>=G && 1+G>=2*free_4 ], cost: 1 372.91/291.66 372.91/291.66 39: evalbinsearchStepSize2bb7in -> evalbinsearchStepSize2bb12in : [ Q+A>=256 ], cost: 1 372.91/291.66 372.91/291.66 40: evalbinsearchStepSize2bb7in -> evalbinsearchStepSize2bb1in : A'=Q+A, C'=Q, D'=2, E'=J, [ 255>=Q+A ], cost: 1 372.91/291.66 372.91/291.66 41: evalbinsearchStepSize2bb8in -> evalbinsearchStepSize2bb9in : [ H>=1+F ], cost: 1 372.91/291.66 372.91/291.66 42: evalbinsearchStepSize2bb8in -> evalbinsearchStepSize2bb12in : [ F>=H ], cost: 1 372.91/291.66 372.91/291.66 43: evalbinsearchStepSize2bb9in -> evalbinsearchStepSize2bb11in : K'=G, L'=E, [ 1>=D ], cost: 1 372.91/291.66 372.91/291.66 44: evalbinsearchStepSize2bb9in -> evalbinsearchStepSize2bb11in : K'=G, L'=E, [ D>=3 ], cost: 1 372.91/291.66 372.91/291.66 45: evalbinsearchStepSize2bb9in -> evalbinsearchStepSize2bb11in : K'=G, L'=E, [ 0>=1+E ], cost: 1 372.91/291.66 372.91/291.66 46: evalbinsearchStepSize2bb9in -> evalbinsearchStepSize2bb11in : K'=G, L'=E, [ E>=1 ], cost: 1 372.91/291.66 372.91/291.66 47: evalbinsearchStepSize2bb9in -> evalbinsearchStepSize2bb10in : [ D==2 && E==0 ], cost: 1 372.91/291.66 372.91/291.66 48: evalbinsearchStepSize2bb10in -> evalbinsearchStepSize2bb11in : K'=0, L'=1, [ G==0 ], cost: 1 372.91/291.66 372.91/291.66 49: evalbinsearchStepSize2bb10in -> evalbinsearchStepSize2bb11in : K'=free_5, L'=1, [ G>=1 && free_5>=0 && G>=2*free_5 && 1+2*free_5>=G ], cost: 1 372.91/291.66 372.91/291.66 50: evalbinsearchStepSize2bb10in -> evalbinsearchStepSize2bb11in : K'=free_6, L'=1, [ 0>=1+G && 0>=free_6 && 2*free_6>=G && 1+G>=2*free_6 ], cost: 1 372.91/291.66 372.91/291.66 51: evalbinsearchStepSize2bb11in -> evalbinsearchStepSize2bb12in : [ K>=1+A ], cost: 1 372.91/291.66 372.91/291.66 52: evalbinsearchStepSize2bb11in -> evalbinsearchStepSize2bb1in : A'=A-K, C'=K, D'=1, E'=L, [ A>=K ], cost: 1 372.91/291.66 372.91/291.66 53: evalbinsearchStepSize2bb12in -> evalbinsearchStepSize2stop : [], cost: 1 372.91/291.66 372.91/291.66 372.91/291.66 372.91/291.66 Removed unreachable and leaf rules: 372.91/291.66 372.91/291.66 Start location: evalbinsearchStepSize2start 372.91/291.66 372.91/291.66 0: evalbinsearchStepSize2start -> evalbinsearchStepSize2bb0in : [], cost: 1 372.91/291.66 372.91/291.66 1: evalbinsearchStepSize2bb0in -> evalbinsearchStepSize20 : [], cost: 1 372.91/291.66 372.91/291.66 2: evalbinsearchStepSize20 -> evalbinsearchStepSize21 : [], cost: 1 372.91/291.66 372.91/291.66 3: evalbinsearchStepSize21 -> evalbinsearchStepSize22 : [], cost: 1 372.91/291.66 372.91/291.66 4: evalbinsearchStepSize22 -> evalbinsearchStepSize23 : [], cost: 1 372.91/291.66 372.91/291.66 5: evalbinsearchStepSize23 -> evalbinsearchStepSize24 : [], cost: 1 372.91/291.66 372.91/291.66 6: evalbinsearchStepSize24 -> evalbinsearchStepSize25 : [], cost: 1 372.91/291.66 372.91/291.66 7: evalbinsearchStepSize25 -> evalbinsearchStepSize26 : [], cost: 1 372.91/291.66 372.91/291.66 8: evalbinsearchStepSize26 -> evalbinsearchStepSize27 : [], cost: 1 372.91/291.66 372.91/291.66 9: evalbinsearchStepSize27 -> evalbinsearchStepSize28 : [], cost: 1 372.91/291.66 372.91/291.66 10: evalbinsearchStepSize28 -> evalbinsearchStepSize29 : [], cost: 1 372.91/291.66 372.91/291.66 11: evalbinsearchStepSize29 -> evalbinsearchStepSize210 : [], cost: 1 372.91/291.66 372.91/291.66 12: evalbinsearchStepSize210 -> evalbinsearchStepSize211 : [], cost: 1 372.91/291.66 372.91/291.66 13: evalbinsearchStepSize211 -> evalbinsearchStepSize212 : [], cost: 1 372.91/291.66 372.91/291.66 14: evalbinsearchStepSize212 -> evalbinsearchStepSize213 : [], cost: 1 372.91/291.66 372.91/291.66 15: evalbinsearchStepSize213 -> evalbinsearchStepSize214 : [], cost: 1 372.91/291.66 372.91/291.66 16: evalbinsearchStepSize214 -> evalbinsearchStepSize215 : [], cost: 1 372.91/291.66 372.91/291.66 17: evalbinsearchStepSize215 -> evalbinsearchStepSize2bb1in : A'=B, C'=4, D'=0, E'=0, [], cost: 1 372.91/291.66 372.91/291.66 18: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize216 : [], cost: 1 372.91/291.66 372.91/291.66 19: evalbinsearchStepSize216 -> evalbinsearchStepSize217 : F'=free, [], cost: 1 372.91/291.66 372.91/291.66 21: evalbinsearchStepSize217 -> evalbinsearchStepSize2bb2in : [ 0>=C ], cost: 1 372.91/291.66 372.91/291.66 22: evalbinsearchStepSize217 -> evalbinsearchStepSize2bb2in : [ C>=2 ], cost: 1 372.91/291.66 372.91/291.66 23: evalbinsearchStepSize2bb2in -> evalbinsearchStepSize2bb3in : [ 0>=1+E ], cost: 1 372.91/291.66 372.91/291.66 24: evalbinsearchStepSize2bb2in -> evalbinsearchStepSize2bb3in : [ E>=1 ], cost: 1 372.91/291.66 372.91/291.66 25: evalbinsearchStepSize2bb2in -> evalbinsearchStepSize2bb4in : G'=C, [ E==0 ], cost: 1 372.91/291.66 372.91/291.66 26: evalbinsearchStepSize2bb3in -> evalbinsearchStepSize2bb4in : G'=0, [ C==0 ], cost: 1 372.91/291.66 372.91/291.66 27: evalbinsearchStepSize2bb3in -> evalbinsearchStepSize2bb4in : G'=free_1, [ C>=1 && free_1>=0 && C>=2*free_1 && 1+2*free_1>=C ], cost: 1 372.91/291.66 372.91/291.66 28: evalbinsearchStepSize2bb3in -> evalbinsearchStepSize2bb4in : G'=free_2, [ 0>=1+C && 0>=free_2 && 2*free_2>=C && 1+C>=2*free_2 ], cost: 1 372.91/291.66 372.91/291.66 29: evalbinsearchStepSize2bb4in -> evalbinsearchStepSize2bb5in : [ F>=1+H ], cost: 1 372.91/291.66 372.91/291.66 30: evalbinsearchStepSize2bb4in -> evalbinsearchStepSize2bb8in : [ H>=F ], cost: 1 372.91/291.66 372.91/291.66 31: evalbinsearchStepSize2bb5in -> evalbinsearchStepSize2bb7in : Q'=G, J'=E, [ 0>=D ], cost: 1 372.91/291.66 372.91/291.66 32: evalbinsearchStepSize2bb5in -> evalbinsearchStepSize2bb7in : Q'=G, J'=E, [ D>=2 ], cost: 1 372.91/291.66 372.91/291.66 33: evalbinsearchStepSize2bb5in -> evalbinsearchStepSize2bb7in : Q'=G, J'=E, [ 0>=1+E ], cost: 1 372.91/291.66 372.91/291.66 34: evalbinsearchStepSize2bb5in -> evalbinsearchStepSize2bb7in : Q'=G, J'=E, [ E>=1 ], cost: 1 372.91/291.66 372.91/291.66 35: evalbinsearchStepSize2bb5in -> evalbinsearchStepSize2bb6in : [ D==1 && E==0 ], cost: 1 372.91/291.66 372.91/291.66 36: evalbinsearchStepSize2bb6in -> evalbinsearchStepSize2bb7in : Q'=0, J'=1, [ G==0 ], cost: 1 372.91/291.66 372.91/291.66 37: evalbinsearchStepSize2bb6in -> evalbinsearchStepSize2bb7in : Q'=free_3, J'=1, [ G>=1 && free_3>=0 && G>=2*free_3 && 1+2*free_3>=G ], cost: 1 372.91/291.66 372.91/291.66 38: evalbinsearchStepSize2bb6in -> evalbinsearchStepSize2bb7in : Q'=free_4, J'=1, [ 0>=1+G && 0>=free_4 && 2*free_4>=G && 1+G>=2*free_4 ], cost: 1 372.91/291.66 372.91/291.66 40: evalbinsearchStepSize2bb7in -> evalbinsearchStepSize2bb1in : A'=Q+A, C'=Q, D'=2, E'=J, [ 255>=Q+A ], cost: 1 372.91/291.66 372.91/291.66 41: evalbinsearchStepSize2bb8in -> evalbinsearchStepSize2bb9in : [ H>=1+F ], cost: 1 372.91/291.66 372.91/291.66 43: evalbinsearchStepSize2bb9in -> evalbinsearchStepSize2bb11in : K'=G, L'=E, [ 1>=D ], cost: 1 372.91/291.66 372.91/291.66 44: evalbinsearchStepSize2bb9in -> evalbinsearchStepSize2bb11in : K'=G, L'=E, [ D>=3 ], cost: 1 372.91/291.66 372.91/291.66 45: evalbinsearchStepSize2bb9in -> evalbinsearchStepSize2bb11in : K'=G, L'=E, [ 0>=1+E ], cost: 1 372.91/291.66 372.91/291.66 46: evalbinsearchStepSize2bb9in -> evalbinsearchStepSize2bb11in : K'=G, L'=E, [ E>=1 ], cost: 1 372.91/291.66 372.91/291.66 47: evalbinsearchStepSize2bb9in -> evalbinsearchStepSize2bb10in : [ D==2 && E==0 ], cost: 1 372.91/291.66 372.91/291.66 48: evalbinsearchStepSize2bb10in -> evalbinsearchStepSize2bb11in : K'=0, L'=1, [ G==0 ], cost: 1 372.91/291.66 372.91/291.66 49: evalbinsearchStepSize2bb10in -> evalbinsearchStepSize2bb11in : K'=free_5, L'=1, [ G>=1 && free_5>=0 && G>=2*free_5 && 1+2*free_5>=G ], cost: 1 372.91/291.66 372.91/291.66 50: evalbinsearchStepSize2bb10in -> evalbinsearchStepSize2bb11in : K'=free_6, L'=1, [ 0>=1+G && 0>=free_6 && 2*free_6>=G && 1+G>=2*free_6 ], cost: 1 372.91/291.66 372.91/291.66 52: evalbinsearchStepSize2bb11in -> evalbinsearchStepSize2bb1in : A'=A-K, C'=K, D'=1, E'=L, [ A>=K ], cost: 1 372.91/291.66 372.91/291.66 372.91/291.66 372.91/291.66 ### Simplification by acceleration and chaining ### 372.91/291.66 372.91/291.66 372.91/291.66 372.91/291.66 Eliminated locations (on linear paths): 372.91/291.66 372.91/291.66 Start location: evalbinsearchStepSize2start 372.91/291.66 372.91/291.66 70: evalbinsearchStepSize2start -> evalbinsearchStepSize2bb1in : A'=B, C'=4, D'=0, E'=0, [], cost: 18 372.91/291.67 372.91/291.67 71: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize217 : F'=free, [], cost: 2 372.91/291.67 372.91/291.67 21: evalbinsearchStepSize217 -> evalbinsearchStepSize2bb2in : [ 0>=C ], cost: 1 372.91/291.67 372.91/291.67 22: evalbinsearchStepSize217 -> evalbinsearchStepSize2bb2in : [ C>=2 ], cost: 1 372.91/291.67 372.91/291.67 23: evalbinsearchStepSize2bb2in -> evalbinsearchStepSize2bb3in : [ 0>=1+E ], cost: 1 372.91/291.67 372.91/291.67 24: evalbinsearchStepSize2bb2in -> evalbinsearchStepSize2bb3in : [ E>=1 ], cost: 1 372.91/291.67 372.91/291.67 25: evalbinsearchStepSize2bb2in -> evalbinsearchStepSize2bb4in : G'=C, [ E==0 ], cost: 1 372.91/291.67 372.91/291.67 26: evalbinsearchStepSize2bb3in -> evalbinsearchStepSize2bb4in : G'=0, [ C==0 ], cost: 1 372.91/291.67 372.91/291.67 27: evalbinsearchStepSize2bb3in -> evalbinsearchStepSize2bb4in : G'=free_1, [ C>=1 && free_1>=0 && C>=2*free_1 && 1+2*free_1>=C ], cost: 1 372.91/291.67 372.91/291.67 28: evalbinsearchStepSize2bb3in -> evalbinsearchStepSize2bb4in : G'=free_2, [ 0>=1+C && 0>=free_2 && 2*free_2>=C && 1+C>=2*free_2 ], cost: 1 372.91/291.67 372.91/291.67 29: evalbinsearchStepSize2bb4in -> evalbinsearchStepSize2bb5in : [ F>=1+H ], cost: 1 372.91/291.67 372.91/291.67 72: evalbinsearchStepSize2bb4in -> evalbinsearchStepSize2bb9in : [ H>=1+F ], cost: 2 372.91/291.67 372.91/291.67 31: evalbinsearchStepSize2bb5in -> evalbinsearchStepSize2bb7in : Q'=G, J'=E, [ 0>=D ], cost: 1 372.91/291.67 372.91/291.67 32: evalbinsearchStepSize2bb5in -> evalbinsearchStepSize2bb7in : Q'=G, J'=E, [ D>=2 ], cost: 1 372.91/291.67 372.91/291.67 33: evalbinsearchStepSize2bb5in -> evalbinsearchStepSize2bb7in : Q'=G, J'=E, [ 0>=1+E ], cost: 1 372.91/291.67 372.91/291.67 34: evalbinsearchStepSize2bb5in -> evalbinsearchStepSize2bb7in : Q'=G, J'=E, [ E>=1 ], cost: 1 372.91/291.67 372.91/291.67 35: evalbinsearchStepSize2bb5in -> evalbinsearchStepSize2bb6in : [ D==1 && E==0 ], cost: 1 372.91/291.67 372.91/291.67 36: evalbinsearchStepSize2bb6in -> evalbinsearchStepSize2bb7in : Q'=0, J'=1, [ G==0 ], cost: 1 372.91/291.67 372.91/291.67 37: evalbinsearchStepSize2bb6in -> evalbinsearchStepSize2bb7in : Q'=free_3, J'=1, [ G>=1 && free_3>=0 && G>=2*free_3 && 1+2*free_3>=G ], cost: 1 372.91/291.67 372.91/291.67 38: evalbinsearchStepSize2bb6in -> evalbinsearchStepSize2bb7in : Q'=free_4, J'=1, [ 0>=1+G && 0>=free_4 && 2*free_4>=G && 1+G>=2*free_4 ], cost: 1 372.91/291.67 372.91/291.67 40: evalbinsearchStepSize2bb7in -> evalbinsearchStepSize2bb1in : A'=Q+A, C'=Q, D'=2, E'=J, [ 255>=Q+A ], cost: 1 372.91/291.67 372.91/291.67 43: evalbinsearchStepSize2bb9in -> evalbinsearchStepSize2bb11in : K'=G, L'=E, [ 1>=D ], cost: 1 372.91/291.67 372.91/291.67 44: evalbinsearchStepSize2bb9in -> evalbinsearchStepSize2bb11in : K'=G, L'=E, [ D>=3 ], cost: 1 372.91/291.67 372.91/291.67 45: evalbinsearchStepSize2bb9in -> evalbinsearchStepSize2bb11in : K'=G, L'=E, [ 0>=1+E ], cost: 1 372.91/291.67 372.91/291.67 46: evalbinsearchStepSize2bb9in -> evalbinsearchStepSize2bb11in : K'=G, L'=E, [ E>=1 ], cost: 1 372.91/291.67 372.91/291.67 47: evalbinsearchStepSize2bb9in -> evalbinsearchStepSize2bb10in : [ D==2 && E==0 ], cost: 1 372.91/291.67 372.91/291.67 48: evalbinsearchStepSize2bb10in -> evalbinsearchStepSize2bb11in : K'=0, L'=1, [ G==0 ], cost: 1 372.91/291.67 372.91/291.67 49: evalbinsearchStepSize2bb10in -> evalbinsearchStepSize2bb11in : K'=free_5, L'=1, [ G>=1 && free_5>=0 && G>=2*free_5 && 1+2*free_5>=G ], cost: 1 372.91/291.67 372.91/291.67 50: evalbinsearchStepSize2bb10in -> evalbinsearchStepSize2bb11in : K'=free_6, L'=1, [ 0>=1+G && 0>=free_6 && 2*free_6>=G && 1+G>=2*free_6 ], cost: 1 372.91/291.67 372.91/291.67 52: evalbinsearchStepSize2bb11in -> evalbinsearchStepSize2bb1in : A'=A-K, C'=K, D'=1, E'=L, [ A>=K ], cost: 1 372.91/291.67 372.91/291.67 372.91/291.67 372.91/291.67 Eliminated locations (on tree-shaped paths): 372.91/291.67 372.91/291.67 Start location: evalbinsearchStepSize2start 372.91/291.67 372.91/291.67 70: evalbinsearchStepSize2start -> evalbinsearchStepSize2bb1in : A'=B, C'=4, D'=0, E'=0, [], cost: 18 372.91/291.67 372.91/291.67 73: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb2in : F'=free, [ 0>=C ], cost: 3 372.91/291.67 372.91/291.67 74: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb2in : F'=free, [ C>=2 ], cost: 3 372.91/291.67 372.91/291.67 81: evalbinsearchStepSize2bb2in -> evalbinsearchStepSize2bb5in : G'=C, [ E==0 && F>=1+H ], cost: 2 372.91/291.67 372.91/291.67 82: evalbinsearchStepSize2bb2in -> evalbinsearchStepSize2bb9in : G'=C, [ E==0 && H>=1+F ], cost: 3 372.91/291.67 372.91/291.67 83: evalbinsearchStepSize2bb2in -> evalbinsearchStepSize2bb5in : G'=0, [ 0>=1+E && C==0 && F>=1+H ], cost: 3 372.91/291.67 372.91/291.67 84: evalbinsearchStepSize2bb2in -> evalbinsearchStepSize2bb9in : G'=0, [ 0>=1+E && C==0 && H>=1+F ], cost: 4 372.91/291.67 372.91/291.67 85: evalbinsearchStepSize2bb2in -> evalbinsearchStepSize2bb5in : G'=free_1, [ 0>=1+E && C>=1 && free_1>=0 && C>=2*free_1 && 1+2*free_1>=C && F>=1+H ], cost: 3 372.91/291.67 372.91/291.67 86: evalbinsearchStepSize2bb2in -> evalbinsearchStepSize2bb9in : G'=free_1, [ 0>=1+E && C>=1 && free_1>=0 && C>=2*free_1 && 1+2*free_1>=C && H>=1+F ], cost: 4 372.91/291.67 372.91/291.67 87: evalbinsearchStepSize2bb2in -> evalbinsearchStepSize2bb5in : G'=free_2, [ 0>=1+E && 0>=1+C && 0>=free_2 && 2*free_2>=C && 1+C>=2*free_2 && F>=1+H ], cost: 3 372.91/291.67 372.91/291.67 88: evalbinsearchStepSize2bb2in -> evalbinsearchStepSize2bb9in : G'=free_2, [ 0>=1+E && 0>=1+C && 0>=free_2 && 2*free_2>=C && 1+C>=2*free_2 && H>=1+F ], cost: 4 372.91/291.67 372.91/291.67 89: evalbinsearchStepSize2bb2in -> evalbinsearchStepSize2bb5in : G'=0, [ E>=1 && C==0 && F>=1+H ], cost: 3 372.91/291.67 372.91/291.67 90: evalbinsearchStepSize2bb2in -> evalbinsearchStepSize2bb9in : G'=0, [ E>=1 && C==0 && H>=1+F ], cost: 4 372.91/291.67 372.91/291.67 91: evalbinsearchStepSize2bb2in -> evalbinsearchStepSize2bb5in : G'=free_1, [ E>=1 && C>=1 && free_1>=0 && C>=2*free_1 && 1+2*free_1>=C && F>=1+H ], cost: 3 372.91/291.67 372.91/291.67 92: evalbinsearchStepSize2bb2in -> evalbinsearchStepSize2bb9in : G'=free_1, [ E>=1 && C>=1 && free_1>=0 && C>=2*free_1 && 1+2*free_1>=C && H>=1+F ], cost: 4 372.91/291.67 372.91/291.67 93: evalbinsearchStepSize2bb2in -> evalbinsearchStepSize2bb5in : G'=free_2, [ E>=1 && 0>=1+C && 0>=free_2 && 2*free_2>=C && 1+C>=2*free_2 && F>=1+H ], cost: 3 372.91/291.67 372.91/291.67 94: evalbinsearchStepSize2bb2in -> evalbinsearchStepSize2bb9in : G'=free_2, [ E>=1 && 0>=1+C && 0>=free_2 && 2*free_2>=C && 1+C>=2*free_2 && H>=1+F ], cost: 4 372.91/291.67 372.91/291.67 98: evalbinsearchStepSize2bb5in -> evalbinsearchStepSize2bb1in : A'=G+A, C'=G, D'=2, E'=E, Q'=G, J'=E, [ 0>=D && 255>=G+A ], cost: 2 372.91/291.67 372.91/291.67 99: evalbinsearchStepSize2bb5in -> evalbinsearchStepSize2bb1in : A'=G+A, C'=G, D'=2, E'=E, Q'=G, J'=E, [ D>=2 && 255>=G+A ], cost: 2 372.91/291.67 372.91/291.67 100: evalbinsearchStepSize2bb5in -> evalbinsearchStepSize2bb1in : A'=G+A, C'=G, D'=2, E'=E, Q'=G, J'=E, [ 0>=1+E && 255>=G+A ], cost: 2 372.91/291.67 372.91/291.67 101: evalbinsearchStepSize2bb5in -> evalbinsearchStepSize2bb1in : A'=G+A, C'=G, D'=2, E'=E, Q'=G, J'=E, [ E>=1 && 255>=G+A ], cost: 2 372.91/291.67 372.91/291.67 102: evalbinsearchStepSize2bb5in -> evalbinsearchStepSize2bb1in : A'=A, C'=0, D'=2, E'=1, Q'=0, J'=1, [ D==1 && E==0 && G==0 && 255>=A ], cost: 3 372.91/291.67 372.91/291.67 103: evalbinsearchStepSize2bb5in -> evalbinsearchStepSize2bb1in : A'=free_3+A, C'=free_3, D'=2, E'=1, Q'=free_3, J'=1, [ D==1 && E==0 && G>=1 && free_3>=0 && G>=2*free_3 && 1+2*free_3>=G && 255>=free_3+A ], cost: 3 372.91/291.67 372.91/291.67 104: evalbinsearchStepSize2bb5in -> evalbinsearchStepSize2bb1in : A'=A+free_4, C'=free_4, D'=2, E'=1, Q'=free_4, J'=1, [ D==1 && E==0 && 0>=1+G && 0>=free_4 && 2*free_4>=G && 1+G>=2*free_4 && 255>=A+free_4 ], cost: 3 372.91/291.67 372.91/291.67 108: evalbinsearchStepSize2bb9in -> evalbinsearchStepSize2bb1in : A'=-G+A, C'=G, D'=1, E'=E, K'=G, L'=E, [ 1>=D && A>=G ], cost: 2 372.91/291.67 372.91/291.67 109: evalbinsearchStepSize2bb9in -> evalbinsearchStepSize2bb1in : A'=-G+A, C'=G, D'=1, E'=E, K'=G, L'=E, [ D>=3 && A>=G ], cost: 2 372.91/291.67 372.91/291.67 110: evalbinsearchStepSize2bb9in -> evalbinsearchStepSize2bb1in : A'=-G+A, C'=G, D'=1, E'=E, K'=G, L'=E, [ 0>=1+E && A>=G ], cost: 2 372.91/291.67 372.91/291.67 111: evalbinsearchStepSize2bb9in -> evalbinsearchStepSize2bb1in : A'=-G+A, C'=G, D'=1, E'=E, K'=G, L'=E, [ E>=1 && A>=G ], cost: 2 372.91/291.67 372.91/291.67 112: evalbinsearchStepSize2bb9in -> evalbinsearchStepSize2bb1in : A'=A, C'=0, D'=1, E'=1, K'=0, L'=1, [ D==2 && E==0 && G==0 && A>=0 ], cost: 3 372.91/291.67 372.91/291.67 113: evalbinsearchStepSize2bb9in -> evalbinsearchStepSize2bb1in : A'=-free_5+A, C'=free_5, D'=1, E'=1, K'=free_5, L'=1, [ D==2 && E==0 && G>=1 && free_5>=0 && G>=2*free_5 && 1+2*free_5>=G && A>=free_5 ], cost: 3 372.91/291.67 372.91/291.67 114: evalbinsearchStepSize2bb9in -> evalbinsearchStepSize2bb1in : A'=-free_6+A, C'=free_6, D'=1, E'=1, K'=free_6, L'=1, [ D==2 && E==0 && 0>=1+G && 0>=free_6 && 2*free_6>=G && 1+G>=2*free_6 && A>=free_6 ], cost: 3 372.91/291.67 372.91/291.67 372.91/291.67 372.91/291.67 Eliminated locations (on tree-shaped paths): 372.91/291.67 372.91/291.67 Start location: evalbinsearchStepSize2start 372.91/291.67 372.91/291.67 70: evalbinsearchStepSize2start -> evalbinsearchStepSize2bb1in : A'=B, C'=4, D'=0, E'=0, [], cost: 18 372.91/291.67 372.91/291.67 115: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb5in : F'=free, G'=C, [ 0>=C && E==0 && free>=1+H ], cost: 5 372.91/291.67 372.91/291.67 116: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb9in : F'=free, G'=C, [ 0>=C && E==0 && H>=1+free ], cost: 6 372.91/291.67 372.91/291.67 117: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb5in : F'=free, G'=0, [ 0>=1+E && C==0 && free>=1+H ], cost: 6 372.91/291.67 372.91/291.67 118: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb9in : F'=free, G'=0, [ 0>=1+E && C==0 && H>=1+free ], cost: 7 372.91/291.67 372.91/291.67 119: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb5in : F'=free, G'=free_2, [ 0>=1+E && 0>=1+C && 0>=free_2 && 2*free_2>=C && 1+C>=2*free_2 && free>=1+H ], cost: 6 372.91/291.67 372.91/291.67 120: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb9in : F'=free, G'=free_2, [ 0>=1+E && 0>=1+C && 0>=free_2 && 2*free_2>=C && 1+C>=2*free_2 && H>=1+free ], cost: 7 372.91/291.67 372.91/291.67 121: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb5in : F'=free, G'=0, [ E>=1 && C==0 && free>=1+H ], cost: 6 372.91/291.67 372.91/291.67 122: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb9in : F'=free, G'=0, [ E>=1 && C==0 && H>=1+free ], cost: 7 372.91/291.67 372.91/291.67 123: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb5in : F'=free, G'=free_2, [ E>=1 && 0>=1+C && 0>=free_2 && 2*free_2>=C && 1+C>=2*free_2 && free>=1+H ], cost: 6 372.91/291.67 372.91/291.67 124: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb9in : F'=free, G'=free_2, [ E>=1 && 0>=1+C && 0>=free_2 && 2*free_2>=C && 1+C>=2*free_2 && H>=1+free ], cost: 7 372.91/291.67 372.91/291.67 125: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb5in : F'=free, G'=C, [ C>=2 && E==0 && free>=1+H ], cost: 5 372.91/291.67 372.91/291.67 126: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb9in : F'=free, G'=C, [ C>=2 && E==0 && H>=1+free ], cost: 6 372.91/291.67 372.91/291.67 127: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb5in : F'=free, G'=free_1, [ C>=2 && 0>=1+E && free_1>=0 && C>=2*free_1 && 1+2*free_1>=C && free>=1+H ], cost: 6 372.91/291.67 372.91/291.67 128: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb9in : F'=free, G'=free_1, [ C>=2 && 0>=1+E && free_1>=0 && C>=2*free_1 && 1+2*free_1>=C && H>=1+free ], cost: 7 372.91/291.67 372.91/291.67 129: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb5in : F'=free, G'=free_1, [ C>=2 && E>=1 && free_1>=0 && C>=2*free_1 && 1+2*free_1>=C && free>=1+H ], cost: 6 372.91/291.67 372.91/291.67 130: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb9in : F'=free, G'=free_1, [ C>=2 && E>=1 && free_1>=0 && C>=2*free_1 && 1+2*free_1>=C && H>=1+free ], cost: 7 372.91/291.67 372.91/291.67 98: evalbinsearchStepSize2bb5in -> evalbinsearchStepSize2bb1in : A'=G+A, C'=G, D'=2, E'=E, Q'=G, J'=E, [ 0>=D && 255>=G+A ], cost: 2 372.91/291.67 372.91/291.67 99: evalbinsearchStepSize2bb5in -> evalbinsearchStepSize2bb1in : A'=G+A, C'=G, D'=2, E'=E, Q'=G, J'=E, [ D>=2 && 255>=G+A ], cost: 2 372.91/291.67 372.91/291.67 100: evalbinsearchStepSize2bb5in -> evalbinsearchStepSize2bb1in : A'=G+A, C'=G, D'=2, E'=E, Q'=G, J'=E, [ 0>=1+E && 255>=G+A ], cost: 2 372.91/291.67 372.91/291.67 101: evalbinsearchStepSize2bb5in -> evalbinsearchStepSize2bb1in : A'=G+A, C'=G, D'=2, E'=E, Q'=G, J'=E, [ E>=1 && 255>=G+A ], cost: 2 372.91/291.67 372.91/291.67 102: evalbinsearchStepSize2bb5in -> evalbinsearchStepSize2bb1in : A'=A, C'=0, D'=2, E'=1, Q'=0, J'=1, [ D==1 && E==0 && G==0 && 255>=A ], cost: 3 372.91/291.67 372.91/291.67 103: evalbinsearchStepSize2bb5in -> evalbinsearchStepSize2bb1in : A'=free_3+A, C'=free_3, D'=2, E'=1, Q'=free_3, J'=1, [ D==1 && E==0 && G>=1 && free_3>=0 && G>=2*free_3 && 1+2*free_3>=G && 255>=free_3+A ], cost: 3 372.91/291.67 372.91/291.67 104: evalbinsearchStepSize2bb5in -> evalbinsearchStepSize2bb1in : A'=A+free_4, C'=free_4, D'=2, E'=1, Q'=free_4, J'=1, [ D==1 && E==0 && 0>=1+G && 0>=free_4 && 2*free_4>=G && 1+G>=2*free_4 && 255>=A+free_4 ], cost: 3 372.91/291.67 372.91/291.67 108: evalbinsearchStepSize2bb9in -> evalbinsearchStepSize2bb1in : A'=-G+A, C'=G, D'=1, E'=E, K'=G, L'=E, [ 1>=D && A>=G ], cost: 2 372.91/291.67 372.91/291.67 109: evalbinsearchStepSize2bb9in -> evalbinsearchStepSize2bb1in : A'=-G+A, C'=G, D'=1, E'=E, K'=G, L'=E, [ D>=3 && A>=G ], cost: 2 372.91/291.67 372.91/291.67 110: evalbinsearchStepSize2bb9in -> evalbinsearchStepSize2bb1in : A'=-G+A, C'=G, D'=1, E'=E, K'=G, L'=E, [ 0>=1+E && A>=G ], cost: 2 372.91/291.67 372.91/291.67 111: evalbinsearchStepSize2bb9in -> evalbinsearchStepSize2bb1in : A'=-G+A, C'=G, D'=1, E'=E, K'=G, L'=E, [ E>=1 && A>=G ], cost: 2 372.91/291.67 372.91/291.67 112: evalbinsearchStepSize2bb9in -> evalbinsearchStepSize2bb1in : A'=A, C'=0, D'=1, E'=1, K'=0, L'=1, [ D==2 && E==0 && G==0 && A>=0 ], cost: 3 372.91/291.67 372.91/291.67 113: evalbinsearchStepSize2bb9in -> evalbinsearchStepSize2bb1in : A'=-free_5+A, C'=free_5, D'=1, E'=1, K'=free_5, L'=1, [ D==2 && E==0 && G>=1 && free_5>=0 && G>=2*free_5 && 1+2*free_5>=G && A>=free_5 ], cost: 3 372.91/291.67 372.91/291.67 114: evalbinsearchStepSize2bb9in -> evalbinsearchStepSize2bb1in : A'=-free_6+A, C'=free_6, D'=1, E'=1, K'=free_6, L'=1, [ D==2 && E==0 && 0>=1+G && 0>=free_6 && 2*free_6>=G && 1+G>=2*free_6 && A>=free_6 ], cost: 3 372.91/291.67 372.91/291.67 372.91/291.67 372.91/291.67 Eliminated locations (on tree-shaped paths): 372.91/291.67 372.91/291.67 Start location: evalbinsearchStepSize2start 372.91/291.67 372.91/291.67 70: evalbinsearchStepSize2start -> evalbinsearchStepSize2bb1in : A'=B, C'=4, D'=0, E'=0, [], cost: 18 372.91/291.67 372.91/291.67 131: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=C+A, C'=C, D'=2, E'=E, F'=free, G'=C, Q'=C, J'=E, [ 0>=C && E==0 && free>=1+H && 0>=D && 255>=C+A ], cost: 7 372.91/291.67 372.91/291.67 132: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=C+A, C'=C, D'=2, E'=E, F'=free, G'=C, Q'=C, J'=E, [ 0>=C && E==0 && free>=1+H && D>=2 && 255>=C+A ], cost: 7 372.91/291.67 372.91/291.67 133: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=A, C'=0, D'=2, E'=1, F'=free, G'=C, Q'=0, J'=1, [ E==0 && free>=1+H && D==1 && C==0 && 255>=A ], cost: 8 372.91/291.67 372.91/291.67 134: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=A+free_4, C'=free_4, D'=2, E'=1, F'=free, G'=C, Q'=free_4, J'=1, [ E==0 && free>=1+H && D==1 && 0>=1+C && 0>=free_4 && 2*free_4>=C && 1+C>=2*free_4 && 255>=A+free_4 ], cost: 8 372.91/291.67 372.91/291.67 135: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=A, C'=0, D'=2, E'=E, F'=free, G'=0, Q'=0, J'=E, [ 0>=1+E && C==0 && free>=1+H && 0>=D && 255>=A ], cost: 8 372.91/291.67 372.91/291.67 136: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=A, C'=0, D'=2, E'=E, F'=free, G'=0, Q'=0, J'=E, [ 0>=1+E && C==0 && free>=1+H && D>=2 && 255>=A ], cost: 8 372.91/291.67 372.91/291.67 137: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=A, C'=0, D'=2, E'=E, F'=free, G'=0, Q'=0, J'=E, [ 0>=1+E && C==0 && free>=1+H && 255>=A ], cost: 8 372.91/291.67 372.91/291.67 138: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=free_2+A, C'=free_2, D'=2, E'=E, F'=free, G'=free_2, Q'=free_2, J'=E, [ 0>=1+E && 0>=1+C && 0>=free_2 && 2*free_2>=C && 1+C>=2*free_2 && free>=1+H && 0>=D && 255>=free_2+A ], cost: 8 372.91/291.67 372.91/291.67 139: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=free_2+A, C'=free_2, D'=2, E'=E, F'=free, G'=free_2, Q'=free_2, J'=E, [ 0>=1+E && 0>=1+C && 0>=free_2 && 2*free_2>=C && 1+C>=2*free_2 && free>=1+H && D>=2 && 255>=free_2+A ], cost: 8 372.91/291.67 372.91/291.67 140: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=free_2+A, C'=free_2, D'=2, E'=E, F'=free, G'=free_2, Q'=free_2, J'=E, [ 0>=1+E && 0>=1+C && 0>=free_2 && 2*free_2>=C && 1+C>=2*free_2 && free>=1+H && 255>=free_2+A ], cost: 8 372.91/291.67 372.91/291.67 141: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=A, C'=0, D'=2, E'=E, F'=free, G'=0, Q'=0, J'=E, [ E>=1 && C==0 && free>=1+H && 0>=D && 255>=A ], cost: 8 372.91/291.67 372.91/291.67 142: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=A, C'=0, D'=2, E'=E, F'=free, G'=0, Q'=0, J'=E, [ E>=1 && C==0 && free>=1+H && D>=2 && 255>=A ], cost: 8 372.91/291.67 372.91/291.67 143: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=A, C'=0, D'=2, E'=E, F'=free, G'=0, Q'=0, J'=E, [ E>=1 && C==0 && free>=1+H && 255>=A ], cost: 8 372.91/291.67 372.91/291.67 144: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=free_2+A, C'=free_2, D'=2, E'=E, F'=free, G'=free_2, Q'=free_2, J'=E, [ E>=1 && 0>=1+C && 0>=free_2 && 2*free_2>=C && 1+C>=2*free_2 && free>=1+H && 0>=D && 255>=free_2+A ], cost: 8 372.91/291.67 372.91/291.67 145: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=free_2+A, C'=free_2, D'=2, E'=E, F'=free, G'=free_2, Q'=free_2, J'=E, [ E>=1 && 0>=1+C && 0>=free_2 && 2*free_2>=C && 1+C>=2*free_2 && free>=1+H && D>=2 && 255>=free_2+A ], cost: 8 372.91/291.67 372.91/291.67 146: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=free_2+A, C'=free_2, D'=2, E'=E, F'=free, G'=free_2, Q'=free_2, J'=E, [ E>=1 && 0>=1+C && 0>=free_2 && 2*free_2>=C && 1+C>=2*free_2 && free>=1+H && 255>=free_2+A ], cost: 8 372.91/291.67 372.91/291.67 147: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=C+A, C'=C, D'=2, E'=E, F'=free, G'=C, Q'=C, J'=E, [ C>=2 && E==0 && free>=1+H && 0>=D && 255>=C+A ], cost: 7 372.91/291.67 372.91/291.67 148: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=C+A, C'=C, D'=2, E'=E, F'=free, G'=C, Q'=C, J'=E, [ C>=2 && E==0 && free>=1+H && D>=2 && 255>=C+A ], cost: 7 372.91/291.67 372.91/291.67 149: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=free_3+A, C'=free_3, D'=2, E'=1, F'=free, G'=C, Q'=free_3, J'=1, [ C>=2 && E==0 && free>=1+H && D==1 && free_3>=0 && C>=2*free_3 && 1+2*free_3>=C && 255>=free_3+A ], cost: 8 372.91/291.67 372.91/291.67 150: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=A+free_1, C'=free_1, D'=2, E'=E, F'=free, G'=free_1, Q'=free_1, J'=E, [ C>=2 && 0>=1+E && free_1>=0 && C>=2*free_1 && 1+2*free_1>=C && free>=1+H && 0>=D && 255>=A+free_1 ], cost: 8 372.91/291.67 372.91/291.67 151: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=A+free_1, C'=free_1, D'=2, E'=E, F'=free, G'=free_1, Q'=free_1, J'=E, [ C>=2 && 0>=1+E && free_1>=0 && C>=2*free_1 && 1+2*free_1>=C && free>=1+H && D>=2 && 255>=A+free_1 ], cost: 8 372.91/291.67 372.91/291.67 152: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=A+free_1, C'=free_1, D'=2, E'=E, F'=free, G'=free_1, Q'=free_1, J'=E, [ C>=2 && 0>=1+E && free_1>=0 && C>=2*free_1 && 1+2*free_1>=C && free>=1+H && 255>=A+free_1 ], cost: 8 372.91/291.67 372.91/291.67 153: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=A+free_1, C'=free_1, D'=2, E'=E, F'=free, G'=free_1, Q'=free_1, J'=E, [ C>=2 && E>=1 && free_1>=0 && C>=2*free_1 && 1+2*free_1>=C && free>=1+H && 0>=D && 255>=A+free_1 ], cost: 8 372.91/291.67 372.91/291.67 154: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=A+free_1, C'=free_1, D'=2, E'=E, F'=free, G'=free_1, Q'=free_1, J'=E, [ C>=2 && E>=1 && free_1>=0 && C>=2*free_1 && 1+2*free_1>=C && free>=1+H && D>=2 && 255>=A+free_1 ], cost: 8 372.91/291.67 372.91/291.67 155: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=A+free_1, C'=free_1, D'=2, E'=E, F'=free, G'=free_1, Q'=free_1, J'=E, [ C>=2 && E>=1 && free_1>=0 && C>=2*free_1 && 1+2*free_1>=C && free>=1+H && 255>=A+free_1 ], cost: 8 372.91/291.67 372.91/291.67 156: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=-C+A, C'=C, D'=1, E'=E, F'=free, G'=C, K'=C, L'=E, [ 0>=C && E==0 && H>=1+free && 1>=D && A>=C ], cost: 8 372.91/291.67 372.91/291.67 157: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=-C+A, C'=C, D'=1, E'=E, F'=free, G'=C, K'=C, L'=E, [ 0>=C && E==0 && H>=1+free && D>=3 && A>=C ], cost: 8 372.91/291.67 372.91/291.67 158: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=A, C'=0, D'=1, E'=1, F'=free, G'=C, K'=0, L'=1, [ E==0 && H>=1+free && D==2 && C==0 && A>=0 ], cost: 9 372.91/291.67 372.91/291.67 159: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=-free_6+A, C'=free_6, D'=1, E'=1, F'=free, G'=C, K'=free_6, L'=1, [ E==0 && H>=1+free && D==2 && 0>=1+C && 0>=free_6 && 2*free_6>=C && 1+C>=2*free_6 && A>=free_6 ], cost: 9 372.91/291.67 372.91/291.67 160: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=A, C'=0, D'=1, E'=E, F'=free, G'=0, K'=0, L'=E, [ 0>=1+E && C==0 && H>=1+free && 1>=D && A>=0 ], cost: 9 372.91/291.67 372.91/291.67 161: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=A, C'=0, D'=1, E'=E, F'=free, G'=0, K'=0, L'=E, [ 0>=1+E && C==0 && H>=1+free && D>=3 && A>=0 ], cost: 9 372.91/291.67 372.91/291.67 162: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=A, C'=0, D'=1, E'=E, F'=free, G'=0, K'=0, L'=E, [ 0>=1+E && C==0 && H>=1+free && A>=0 ], cost: 9 372.91/291.67 372.91/291.67 163: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=-free_2+A, C'=free_2, D'=1, E'=E, F'=free, G'=free_2, K'=free_2, L'=E, [ 0>=1+E && 0>=1+C && 0>=free_2 && 2*free_2>=C && 1+C>=2*free_2 && H>=1+free && 1>=D && A>=free_2 ], cost: 9 372.91/291.67 372.91/291.67 164: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=-free_2+A, C'=free_2, D'=1, E'=E, F'=free, G'=free_2, K'=free_2, L'=E, [ 0>=1+E && 0>=1+C && 0>=free_2 && 2*free_2>=C && 1+C>=2*free_2 && H>=1+free && D>=3 && A>=free_2 ], cost: 9 372.91/291.67 372.91/291.67 165: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=-free_2+A, C'=free_2, D'=1, E'=E, F'=free, G'=free_2, K'=free_2, L'=E, [ 0>=1+E && 0>=1+C && 0>=free_2 && 2*free_2>=C && 1+C>=2*free_2 && H>=1+free && A>=free_2 ], cost: 9 372.91/291.67 372.91/291.67 166: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=A, C'=0, D'=1, E'=E, F'=free, G'=0, K'=0, L'=E, [ E>=1 && C==0 && H>=1+free && 1>=D && A>=0 ], cost: 9 372.91/291.67 372.91/291.67 167: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=A, C'=0, D'=1, E'=E, F'=free, G'=0, K'=0, L'=E, [ E>=1 && C==0 && H>=1+free && D>=3 && A>=0 ], cost: 9 372.91/291.67 372.91/291.67 168: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=A, C'=0, D'=1, E'=E, F'=free, G'=0, K'=0, L'=E, [ E>=1 && C==0 && H>=1+free && A>=0 ], cost: 9 372.91/291.67 372.91/291.67 169: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=-free_2+A, C'=free_2, D'=1, E'=E, F'=free, G'=free_2, K'=free_2, L'=E, [ E>=1 && 0>=1+C && 0>=free_2 && 2*free_2>=C && 1+C>=2*free_2 && H>=1+free && 1>=D && A>=free_2 ], cost: 9 372.91/291.67 372.91/291.67 170: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=-free_2+A, C'=free_2, D'=1, E'=E, F'=free, G'=free_2, K'=free_2, L'=E, [ E>=1 && 0>=1+C && 0>=free_2 && 2*free_2>=C && 1+C>=2*free_2 && H>=1+free && D>=3 && A>=free_2 ], cost: 9 372.91/291.67 372.91/291.67 171: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=-free_2+A, C'=free_2, D'=1, E'=E, F'=free, G'=free_2, K'=free_2, L'=E, [ E>=1 && 0>=1+C && 0>=free_2 && 2*free_2>=C && 1+C>=2*free_2 && H>=1+free && A>=free_2 ], cost: 9 372.91/291.67 372.91/291.67 172: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=-C+A, C'=C, D'=1, E'=E, F'=free, G'=C, K'=C, L'=E, [ C>=2 && E==0 && H>=1+free && 1>=D && A>=C ], cost: 8 372.91/291.67 372.91/291.67 173: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=-C+A, C'=C, D'=1, E'=E, F'=free, G'=C, K'=C, L'=E, [ C>=2 && E==0 && H>=1+free && D>=3 && A>=C ], cost: 8 372.91/291.67 372.91/291.67 174: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=-free_5+A, C'=free_5, D'=1, E'=1, F'=free, G'=C, K'=free_5, L'=1, [ C>=2 && E==0 && H>=1+free && D==2 && free_5>=0 && C>=2*free_5 && 1+2*free_5>=C && A>=free_5 ], cost: 9 372.91/291.67 372.91/291.67 175: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=A-free_1, C'=free_1, D'=1, E'=E, F'=free, G'=free_1, K'=free_1, L'=E, [ C>=2 && 0>=1+E && free_1>=0 && C>=2*free_1 && 1+2*free_1>=C && H>=1+free && 1>=D && A>=free_1 ], cost: 9 372.91/291.67 372.91/291.67 176: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=A-free_1, C'=free_1, D'=1, E'=E, F'=free, G'=free_1, K'=free_1, L'=E, [ C>=2 && 0>=1+E && free_1>=0 && C>=2*free_1 && 1+2*free_1>=C && H>=1+free && D>=3 && A>=free_1 ], cost: 9 372.91/291.67 372.91/291.67 177: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=A-free_1, C'=free_1, D'=1, E'=E, F'=free, G'=free_1, K'=free_1, L'=E, [ C>=2 && 0>=1+E && free_1>=0 && C>=2*free_1 && 1+2*free_1>=C && H>=1+free && A>=free_1 ], cost: 9 372.91/291.67 372.91/291.67 178: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=A-free_1, C'=free_1, D'=1, E'=E, F'=free, G'=free_1, K'=free_1, L'=E, [ C>=2 && E>=1 && free_1>=0 && C>=2*free_1 && 1+2*free_1>=C && H>=1+free && 1>=D && A>=free_1 ], cost: 9 372.91/291.67 372.91/291.67 179: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=A-free_1, C'=free_1, D'=1, E'=E, F'=free, G'=free_1, K'=free_1, L'=E, [ C>=2 && E>=1 && free_1>=0 && C>=2*free_1 && 1+2*free_1>=C && H>=1+free && D>=3 && A>=free_1 ], cost: 9 372.91/291.67 372.91/291.67 180: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=A-free_1, C'=free_1, D'=1, E'=E, F'=free, G'=free_1, K'=free_1, L'=E, [ C>=2 && E>=1 && free_1>=0 && C>=2*free_1 && 1+2*free_1>=C && H>=1+free && A>=free_1 ], cost: 9 372.91/291.67 372.91/291.67 372.91/291.67 372.91/291.67 Accelerating simple loops of location 18. 372.91/291.67 372.91/291.67 Simplified some of the simple loops (and removed duplicate rules). 372.91/291.67 372.91/291.67 Accelerating the following rules: 372.91/291.67 372.91/291.67 131: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=C+A, D'=2, F'=free, G'=C, Q'=C, J'=E, [ 0>=C && E==0 && free>=1+H && 0>=D && 255>=C+A ], cost: 7 372.91/291.67 372.91/291.67 132: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=C+A, D'=2, F'=free, G'=C, Q'=C, J'=E, [ 0>=C && E==0 && free>=1+H && D>=2 && 255>=C+A ], cost: 7 372.91/291.67 372.91/291.67 133: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : C'=0, D'=2, E'=1, F'=free, G'=C, Q'=0, J'=1, [ E==0 && free>=1+H && D==1 && C==0 && 255>=A ], cost: 8 372.91/291.67 372.91/291.67 134: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=A+free_4, C'=free_4, D'=2, E'=1, F'=free, G'=C, Q'=free_4, J'=1, [ E==0 && free>=1+H && D==1 && 0>=1+C && 0>=free_4 && 2*free_4>=C && 1+C>=2*free_4 && 255>=A+free_4 ], cost: 8 372.91/291.67 372.91/291.67 135: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : C'=0, D'=2, F'=free, G'=0, Q'=0, J'=E, [ 0>=1+E && C==0 && free>=1+H && 0>=D && 255>=A ], cost: 8 372.91/291.67 372.91/291.67 136: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : C'=0, D'=2, F'=free, G'=0, Q'=0, J'=E, [ 0>=1+E && C==0 && free>=1+H && D>=2 && 255>=A ], cost: 8 372.91/291.67 372.91/291.67 137: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : C'=0, D'=2, F'=free, G'=0, Q'=0, J'=E, [ 0>=1+E && C==0 && free>=1+H && 255>=A ], cost: 8 372.91/291.67 372.91/291.67 138: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=free_2+A, C'=free_2, D'=2, F'=free, G'=free_2, Q'=free_2, J'=E, [ 0>=1+E && 0>=1+C && 0>=free_2 && 2*free_2>=C && 1+C>=2*free_2 && free>=1+H && 0>=D && 255>=free_2+A ], cost: 8 372.91/291.67 372.91/291.67 139: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=free_2+A, C'=free_2, D'=2, F'=free, G'=free_2, Q'=free_2, J'=E, [ 0>=1+E && 0>=1+C && 0>=free_2 && 2*free_2>=C && 1+C>=2*free_2 && free>=1+H && D>=2 && 255>=free_2+A ], cost: 8 372.91/291.67 372.91/291.67 140: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=free_2+A, C'=free_2, D'=2, F'=free, G'=free_2, Q'=free_2, J'=E, [ 0>=1+E && 0>=1+C && 0>=free_2 && 2*free_2>=C && 1+C>=2*free_2 && free>=1+H && 255>=free_2+A ], cost: 8 372.91/291.67 372.91/291.67 141: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : C'=0, D'=2, F'=free, G'=0, Q'=0, J'=E, [ E>=1 && C==0 && free>=1+H && 0>=D && 255>=A ], cost: 8 372.91/291.67 372.91/291.67 142: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : C'=0, D'=2, F'=free, G'=0, Q'=0, J'=E, [ E>=1 && C==0 && free>=1+H && D>=2 && 255>=A ], cost: 8 372.91/291.67 372.91/291.67 143: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : C'=0, D'=2, F'=free, G'=0, Q'=0, J'=E, [ E>=1 && C==0 && free>=1+H && 255>=A ], cost: 8 372.91/291.67 372.91/291.67 144: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=free_2+A, C'=free_2, D'=2, F'=free, G'=free_2, Q'=free_2, J'=E, [ E>=1 && 0>=1+C && 0>=free_2 && 2*free_2>=C && 1+C>=2*free_2 && free>=1+H && 0>=D && 255>=free_2+A ], cost: 8 372.91/291.67 372.91/291.67 145: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=free_2+A, C'=free_2, D'=2, F'=free, G'=free_2, Q'=free_2, J'=E, [ E>=1 && 0>=1+C && 0>=free_2 && 2*free_2>=C && 1+C>=2*free_2 && free>=1+H && D>=2 && 255>=free_2+A ], cost: 8 372.91/291.67 372.91/291.67 146: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=free_2+A, C'=free_2, D'=2, F'=free, G'=free_2, Q'=free_2, J'=E, [ E>=1 && 0>=1+C && 0>=free_2 && 2*free_2>=C && 1+C>=2*free_2 && free>=1+H && 255>=free_2+A ], cost: 8 372.91/291.67 372.91/291.67 147: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=C+A, D'=2, F'=free, G'=C, Q'=C, J'=E, [ C>=2 && E==0 && free>=1+H && 0>=D && 255>=C+A ], cost: 7 372.91/291.67 372.91/291.67 148: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=C+A, D'=2, F'=free, G'=C, Q'=C, J'=E, [ C>=2 && E==0 && free>=1+H && D>=2 && 255>=C+A ], cost: 7 372.91/291.67 372.91/291.67 149: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=free_3+A, C'=free_3, D'=2, E'=1, F'=free, G'=C, Q'=free_3, J'=1, [ C>=2 && E==0 && free>=1+H && D==1 && free_3>=0 && C>=2*free_3 && 1+2*free_3>=C && 255>=free_3+A ], cost: 8 372.91/291.67 372.91/291.67 150: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=A+free_1, C'=free_1, D'=2, F'=free, G'=free_1, Q'=free_1, J'=E, [ C>=2 && 0>=1+E && free_1>=0 && C>=2*free_1 && 1+2*free_1>=C && free>=1+H && 0>=D && 255>=A+free_1 ], cost: 8 372.91/291.67 372.91/291.67 151: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=A+free_1, C'=free_1, D'=2, F'=free, G'=free_1, Q'=free_1, J'=E, [ C>=2 && 0>=1+E && free_1>=0 && C>=2*free_1 && 1+2*free_1>=C && free>=1+H && D>=2 && 255>=A+free_1 ], cost: 8 372.91/291.67 372.91/291.67 152: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=A+free_1, C'=free_1, D'=2, F'=free, G'=free_1, Q'=free_1, J'=E, [ C>=2 && 0>=1+E && free_1>=0 && C>=2*free_1 && 1+2*free_1>=C && free>=1+H && 255>=A+free_1 ], cost: 8 372.91/291.67 372.91/291.67 153: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=A+free_1, C'=free_1, D'=2, F'=free, G'=free_1, Q'=free_1, J'=E, [ C>=2 && E>=1 && free_1>=0 && C>=2*free_1 && 1+2*free_1>=C && free>=1+H && 0>=D && 255>=A+free_1 ], cost: 8 372.91/291.67 372.91/291.67 154: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=A+free_1, C'=free_1, D'=2, F'=free, G'=free_1, Q'=free_1, J'=E, [ C>=2 && E>=1 && free_1>=0 && C>=2*free_1 && 1+2*free_1>=C && free>=1+H && D>=2 && 255>=A+free_1 ], cost: 8 372.91/291.67 372.91/291.67 155: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=A+free_1, C'=free_1, D'=2, F'=free, G'=free_1, Q'=free_1, J'=E, [ C>=2 && E>=1 && free_1>=0 && C>=2*free_1 && 1+2*free_1>=C && free>=1+H && 255>=A+free_1 ], cost: 8 372.91/291.67 372.91/291.67 156: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=-C+A, D'=1, F'=free, G'=C, K'=C, L'=E, [ 0>=C && E==0 && H>=1+free && 1>=D && A>=C ], cost: 8 372.91/291.67 372.91/291.67 157: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=-C+A, D'=1, F'=free, G'=C, K'=C, L'=E, [ 0>=C && E==0 && H>=1+free && D>=3 && A>=C ], cost: 8 372.91/291.67 372.91/291.67 158: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : C'=0, D'=1, E'=1, F'=free, G'=C, K'=0, L'=1, [ E==0 && H>=1+free && D==2 && C==0 && A>=0 ], cost: 9 372.91/291.67 372.91/291.67 159: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=-free_6+A, C'=free_6, D'=1, E'=1, F'=free, G'=C, K'=free_6, L'=1, [ E==0 && H>=1+free && D==2 && 0>=1+C && 0>=free_6 && 2*free_6>=C && 1+C>=2*free_6 && A>=free_6 ], cost: 9 372.91/291.67 372.91/291.67 160: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : C'=0, D'=1, F'=free, G'=0, K'=0, L'=E, [ 0>=1+E && C==0 && H>=1+free && 1>=D && A>=0 ], cost: 9 372.91/291.67 372.91/291.67 161: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : C'=0, D'=1, F'=free, G'=0, K'=0, L'=E, [ 0>=1+E && C==0 && H>=1+free && D>=3 && A>=0 ], cost: 9 372.91/291.67 372.91/291.67 162: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : C'=0, D'=1, F'=free, G'=0, K'=0, L'=E, [ 0>=1+E && C==0 && H>=1+free && A>=0 ], cost: 9 372.91/291.67 372.91/291.67 163: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=-free_2+A, C'=free_2, D'=1, F'=free, G'=free_2, K'=free_2, L'=E, [ 0>=1+E && 0>=1+C && 0>=free_2 && 2*free_2>=C && 1+C>=2*free_2 && H>=1+free && 1>=D && A>=free_2 ], cost: 9 372.91/291.67 372.91/291.67 164: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=-free_2+A, C'=free_2, D'=1, F'=free, G'=free_2, K'=free_2, L'=E, [ 0>=1+E && 0>=1+C && 0>=free_2 && 2*free_2>=C && 1+C>=2*free_2 && H>=1+free && D>=3 && A>=free_2 ], cost: 9 372.91/291.67 372.91/291.67 165: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=-free_2+A, C'=free_2, D'=1, F'=free, G'=free_2, K'=free_2, L'=E, [ 0>=1+E && 0>=1+C && 0>=free_2 && 2*free_2>=C && 1+C>=2*free_2 && H>=1+free && A>=free_2 ], cost: 9 372.91/291.67 372.91/291.67 166: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : C'=0, D'=1, F'=free, G'=0, K'=0, L'=E, [ E>=1 && C==0 && H>=1+free && 1>=D && A>=0 ], cost: 9 372.91/291.67 372.91/291.67 167: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : C'=0, D'=1, F'=free, G'=0, K'=0, L'=E, [ E>=1 && C==0 && H>=1+free && D>=3 && A>=0 ], cost: 9 372.91/291.67 372.91/291.67 168: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : C'=0, D'=1, F'=free, G'=0, K'=0, L'=E, [ E>=1 && C==0 && H>=1+free && A>=0 ], cost: 9 372.91/291.67 372.91/291.67 169: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=-free_2+A, C'=free_2, D'=1, F'=free, G'=free_2, K'=free_2, L'=E, [ E>=1 && 0>=1+C && 0>=free_2 && 2*free_2>=C && 1+C>=2*free_2 && H>=1+free && 1>=D && A>=free_2 ], cost: 9 372.91/291.67 372.91/291.67 170: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=-free_2+A, C'=free_2, D'=1, F'=free, G'=free_2, K'=free_2, L'=E, [ E>=1 && 0>=1+C && 0>=free_2 && 2*free_2>=C && 1+C>=2*free_2 && H>=1+free && D>=3 && A>=free_2 ], cost: 9 372.91/291.67 372.91/291.67 171: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=-free_2+A, C'=free_2, D'=1, F'=free, G'=free_2, K'=free_2, L'=E, [ E>=1 && 0>=1+C && 0>=free_2 && 2*free_2>=C && 1+C>=2*free_2 && H>=1+free && A>=free_2 ], cost: 9 372.91/291.67 372.91/291.67 172: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=-C+A, D'=1, F'=free, G'=C, K'=C, L'=E, [ C>=2 && E==0 && H>=1+free && 1>=D && A>=C ], cost: 8 372.91/291.67 372.91/291.67 173: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=-C+A, D'=1, F'=free, G'=C, K'=C, L'=E, [ C>=2 && E==0 && H>=1+free && D>=3 && A>=C ], cost: 8 372.91/291.67 372.91/291.67 174: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=-free_5+A, C'=free_5, D'=1, E'=1, F'=free, G'=C, K'=free_5, L'=1, [ C>=2 && E==0 && H>=1+free && D==2 && free_5>=0 && C>=2*free_5 && 1+2*free_5>=C && A>=free_5 ], cost: 9 372.91/291.67 372.91/291.67 175: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=A-free_1, C'=free_1, D'=1, F'=free, G'=free_1, K'=free_1, L'=E, [ C>=2 && 0>=1+E && free_1>=0 && C>=2*free_1 && 1+2*free_1>=C && H>=1+free && 1>=D && A>=free_1 ], cost: 9 372.91/291.67 372.91/291.67 176: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=A-free_1, C'=free_1, D'=1, F'=free, G'=free_1, K'=free_1, L'=E, [ C>=2 && 0>=1+E && free_1>=0 && C>=2*free_1 && 1+2*free_1>=C && H>=1+free && D>=3 && A>=free_1 ], cost: 9 372.91/291.67 372.91/291.67 177: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=A-free_1, C'=free_1, D'=1, F'=free, G'=free_1, K'=free_1, L'=E, [ C>=2 && 0>=1+E && free_1>=0 && C>=2*free_1 && 1+2*free_1>=C && H>=1+free && A>=free_1 ], cost: 9 372.91/291.67 372.91/291.67 178: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=A-free_1, C'=free_1, D'=1, F'=free, G'=free_1, K'=free_1, L'=E, [ C>=2 && E>=1 && free_1>=0 && C>=2*free_1 && 1+2*free_1>=C && H>=1+free && 1>=D && A>=free_1 ], cost: 9 372.91/291.67 372.91/291.67 179: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=A-free_1, C'=free_1, D'=1, F'=free, G'=free_1, K'=free_1, L'=E, [ C>=2 && E>=1 && free_1>=0 && C>=2*free_1 && 1+2*free_1>=C && H>=1+free && D>=3 && A>=free_1 ], cost: 9 372.91/291.67 372.91/291.67 180: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=A-free_1, C'=free_1, D'=1, F'=free, G'=free_1, K'=free_1, L'=E, [ C>=2 && E>=1 && free_1>=0 && C>=2*free_1 && 1+2*free_1>=C && H>=1+free && A>=free_1 ], cost: 9 372.91/291.67 372.91/291.67 372.91/291.67 372.91/291.67 Found no metering function for rule 131. 372.91/291.67 372.91/291.67 Accelerated rule 132 with NONTERM, yielding the new rule 181. 372.91/291.67 372.91/291.67 Accelerated rule 133 with metering function meter (where 2*meter==2-D-E), yielding the new rule 182. 372.91/291.67 372.91/291.67 Accelerated rule 134 with metering function meter_1 (where 2*meter_1==1-D-E), yielding the new rule 183. 372.91/291.67 372.91/291.67 Found no metering function for rule 135. 372.91/291.67 372.91/291.67 Accelerated rule 136 with NONTERM, yielding the new rule 184. 372.91/291.67 372.91/291.67 Accelerated rule 137 with NONTERM, yielding the new rule 185. 372.91/291.67 372.91/291.67 During metering: Instantiating temporary variables by {free_2==0} 372.91/291.67 372.91/291.67 Accelerated rule 138 with metering function -1-C, yielding the new rule 186. 372.91/291.67 372.91/291.67 During metering: Instantiating temporary variables by {free_2==0} 372.91/291.67 372.91/291.67 Accelerated rule 139 with metering function -C, yielding the new rule 187. 372.91/291.67 372.91/291.67 During metering: Instantiating temporary variables by {free_2==0} 372.91/291.67 372.91/291.67 Accelerated rule 140 with metering function -C, yielding the new rule 188. 372.91/291.67 372.91/291.67 Found no metering function for rule 141. 372.91/291.67 372.91/291.67 Accelerated rule 142 with NONTERM, yielding the new rule 189. 372.91/291.67 372.91/291.67 Accelerated rule 143 with NONTERM, yielding the new rule 190. 372.91/291.67 372.91/291.67 During metering: Instantiating temporary variables by {free_2==0} 372.91/291.67 372.91/291.67 Accelerated rule 144 with metering function -1-C, yielding the new rule 191. 372.91/291.67 372.91/291.67 During metering: Instantiating temporary variables by {free_2==0} 372.91/291.67 372.91/291.67 Accelerated rule 145 with metering function -C, yielding the new rule 192. 372.91/291.67 372.91/291.67 During metering: Instantiating temporary variables by {free_2==0} 372.91/291.67 372.91/291.67 Accelerated rule 146 with metering function -C, yielding the new rule 193. 372.91/291.67 372.91/291.67 Found no metering function for rule 147. 372.91/291.67 372.91/291.67 Accelerated rule 148 with backward acceleration, yielding the new rule 194. 372.91/291.67 372.91/291.67 Accelerated rule 149 with metering function meter_2 (where 2*meter_2==1-D-E), yielding the new rule 195. 372.91/291.67 372.91/291.67 Accelerated rule 150 with NONTERM (after strengthening guard), yielding the new rule 196. 372.91/291.67 372.91/291.67 Accelerated rule 151 with NONTERM (after strengthening guard), yielding the new rule 197. 372.91/291.67 372.91/291.67 Accelerated rule 152 with NONTERM (after strengthening guard), yielding the new rule 198. 372.91/291.67 372.91/291.67 Accelerated rule 153 with NONTERM (after strengthening guard), yielding the new rule 199. 372.91/291.67 372.91/291.67 Accelerated rule 154 with NONTERM (after strengthening guard), yielding the new rule 200. 372.91/291.67 372.91/291.67 Accelerated rule 155 with NONTERM (after strengthening guard), yielding the new rule 201. 372.91/291.67 372.91/291.67 Accelerated rule 156 with NONTERM, yielding the new rule 202. 372.91/291.67 372.91/291.67 Found no metering function for rule 157. 372.91/291.67 372.91/291.67 Accelerated rule 158 with metering function meter_3 (where 2*meter_3==-1+D-E), yielding the new rule 203. 372.91/291.67 372.91/291.67 Accelerated rule 159 with metering function meter_4 (where 2*meter_4==-2+D-E), yielding the new rule 204. 372.91/291.67 372.91/291.67 Accelerated rule 160 with NONTERM, yielding the new rule 205. 372.91/291.67 372.91/291.67 Found no metering function for rule 161. 372.91/291.67 372.91/291.67 Accelerated rule 162 with NONTERM, yielding the new rule 206. 372.91/291.67 372.91/291.67 During metering: Instantiating temporary variables by {free_2==0} 372.91/291.67 372.91/291.67 Accelerated rule 163 with metering function -C, yielding the new rule 207. 372.91/291.67 372.91/291.67 During metering: Instantiating temporary variables by {free_2==0} 372.91/291.67 372.91/291.67 Accelerated rule 164 with metering function -1-C, yielding the new rule 208. 372.91/291.67 372.91/291.67 During metering: Instantiating temporary variables by {free_2==0} 372.91/291.67 372.91/291.67 Accelerated rule 165 with metering function -C, yielding the new rule 209. 372.91/291.67 372.91/291.67 Accelerated rule 166 with NONTERM, yielding the new rule 210. 372.91/291.67 372.91/291.67 Found no metering function for rule 167. 372.91/291.67 372.91/291.67 Accelerated rule 168 with NONTERM, yielding the new rule 211. 372.91/291.67 372.91/291.67 During metering: Instantiating temporary variables by {free_2==0} 372.91/291.67 372.91/291.67 Accelerated rule 169 with metering function -C, yielding the new rule 212. 372.91/291.67 372.91/291.67 During metering: Instantiating temporary variables by {free_2==0} 372.91/291.67 372.91/291.67 Accelerated rule 170 with metering function -1-C, yielding the new rule 213. 372.91/291.67 372.91/291.67 During metering: Instantiating temporary variables by {free_2==0} 372.91/291.67 372.91/291.67 Accelerated rule 171 with metering function -C, yielding the new rule 214. 372.91/291.67 372.91/291.67 Accelerated rule 172 with backward acceleration, yielding the new rule 215. 372.91/291.67 372.91/291.67 Found no metering function for rule 173. 372.91/291.67 372.91/291.67 Accelerated rule 174 with metering function meter_5 (where 2*meter_5==-2+D-E), yielding the new rule 216. 372.91/291.67 372.91/291.67 Accelerated rule 175 with NONTERM (after strengthening guard), yielding the new rule 217. 372.91/291.67 372.91/291.67 Accelerated rule 176 with NONTERM (after strengthening guard), yielding the new rule 218. 372.91/291.67 372.91/291.67 Accelerated rule 177 with NONTERM (after strengthening guard), yielding the new rule 219. 372.91/291.67 372.91/291.67 Accelerated rule 178 with NONTERM (after strengthening guard), yielding the new rule 220. 372.91/291.67 372.91/291.67 Accelerated rule 179 with NONTERM (after strengthening guard), yielding the new rule 221. 372.91/291.67 372.91/291.67 Accelerated rule 180 with NONTERM (after strengthening guard), yielding the new rule 222. 372.91/291.67 372.91/291.67 Removing the simple loops: 132 133 134 136 137 138 139 140 142 143 144 145 146 148 149 156 158 159 160 162 163 164 165 166 168 169 170 171 172 174. 372.91/291.67 372.91/291.67 372.91/291.67 372.91/291.67 Accelerated all simple loops using metering functions (where possible): 372.91/291.67 372.91/291.67 Start location: evalbinsearchStepSize2start 372.91/291.67 372.91/291.67 70: evalbinsearchStepSize2start -> evalbinsearchStepSize2bb1in : A'=B, C'=4, D'=0, E'=0, [], cost: 18 372.91/291.67 372.91/291.67 131: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=C+A, D'=2, F'=free, G'=C, Q'=C, J'=E, [ 0>=C && E==0 && free>=1+H && 0>=D && 255>=C+A ], cost: 7 372.91/291.67 372.91/291.67 135: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : C'=0, D'=2, F'=free, G'=0, Q'=0, J'=E, [ 0>=1+E && C==0 && free>=1+H && 0>=D && 255>=A ], cost: 8 372.91/291.67 372.91/291.67 141: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : C'=0, D'=2, F'=free, G'=0, Q'=0, J'=E, [ E>=1 && C==0 && free>=1+H && 0>=D && 255>=A ], cost: 8 372.91/291.67 372.91/291.67 147: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=C+A, D'=2, F'=free, G'=C, Q'=C, J'=E, [ C>=2 && E==0 && free>=1+H && 0>=D && 255>=C+A ], cost: 7 372.91/291.67 372.91/291.67 150: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=A+free_1, C'=free_1, D'=2, F'=free, G'=free_1, Q'=free_1, J'=E, [ C>=2 && 0>=1+E && free_1>=0 && C>=2*free_1 && 1+2*free_1>=C && free>=1+H && 0>=D && 255>=A+free_1 ], cost: 8 372.91/291.67 372.91/291.67 151: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=A+free_1, C'=free_1, D'=2, F'=free, G'=free_1, Q'=free_1, J'=E, [ C>=2 && 0>=1+E && free_1>=0 && C>=2*free_1 && 1+2*free_1>=C && free>=1+H && D>=2 && 255>=A+free_1 ], cost: 8 372.91/291.67 372.91/291.67 152: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=A+free_1, C'=free_1, D'=2, F'=free, G'=free_1, Q'=free_1, J'=E, [ C>=2 && 0>=1+E && free_1>=0 && C>=2*free_1 && 1+2*free_1>=C && free>=1+H && 255>=A+free_1 ], cost: 8 372.91/291.67 372.91/291.67 153: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=A+free_1, C'=free_1, D'=2, F'=free, G'=free_1, Q'=free_1, J'=E, [ C>=2 && E>=1 && free_1>=0 && C>=2*free_1 && 1+2*free_1>=C && free>=1+H && 0>=D && 255>=A+free_1 ], cost: 8 372.91/291.67 372.91/291.67 154: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=A+free_1, C'=free_1, D'=2, F'=free, G'=free_1, Q'=free_1, J'=E, [ C>=2 && E>=1 && free_1>=0 && C>=2*free_1 && 1+2*free_1>=C && free>=1+H && D>=2 && 255>=A+free_1 ], cost: 8 372.91/291.67 372.91/291.67 155: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=A+free_1, C'=free_1, D'=2, F'=free, G'=free_1, Q'=free_1, J'=E, [ C>=2 && E>=1 && free_1>=0 && C>=2*free_1 && 1+2*free_1>=C && free>=1+H && 255>=A+free_1 ], cost: 8 372.91/291.67 372.91/291.67 157: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=-C+A, D'=1, F'=free, G'=C, K'=C, L'=E, [ 0>=C && E==0 && H>=1+free && D>=3 && A>=C ], cost: 8 372.91/291.67 372.91/291.67 161: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : C'=0, D'=1, F'=free, G'=0, K'=0, L'=E, [ 0>=1+E && C==0 && H>=1+free && D>=3 && A>=0 ], cost: 9 372.91/291.67 372.91/291.67 167: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : C'=0, D'=1, F'=free, G'=0, K'=0, L'=E, [ E>=1 && C==0 && H>=1+free && D>=3 && A>=0 ], cost: 9 372.91/291.67 372.91/291.67 173: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=-C+A, D'=1, F'=free, G'=C, K'=C, L'=E, [ C>=2 && E==0 && H>=1+free && D>=3 && A>=C ], cost: 8 372.91/291.67 372.91/291.67 175: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=A-free_1, C'=free_1, D'=1, F'=free, G'=free_1, K'=free_1, L'=E, [ C>=2 && 0>=1+E && free_1>=0 && C>=2*free_1 && 1+2*free_1>=C && H>=1+free && 1>=D && A>=free_1 ], cost: 9 372.91/291.67 372.91/291.67 176: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=A-free_1, C'=free_1, D'=1, F'=free, G'=free_1, K'=free_1, L'=E, [ C>=2 && 0>=1+E && free_1>=0 && C>=2*free_1 && 1+2*free_1>=C && H>=1+free && D>=3 && A>=free_1 ], cost: 9 372.91/291.67 372.91/291.67 177: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=A-free_1, C'=free_1, D'=1, F'=free, G'=free_1, K'=free_1, L'=E, [ C>=2 && 0>=1+E && free_1>=0 && C>=2*free_1 && 1+2*free_1>=C && H>=1+free && A>=free_1 ], cost: 9 372.91/291.67 372.91/291.67 178: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=A-free_1, C'=free_1, D'=1, F'=free, G'=free_1, K'=free_1, L'=E, [ C>=2 && E>=1 && free_1>=0 && C>=2*free_1 && 1+2*free_1>=C && H>=1+free && 1>=D && A>=free_1 ], cost: 9 372.91/291.67 372.91/291.67 179: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=A-free_1, C'=free_1, D'=1, F'=free, G'=free_1, K'=free_1, L'=E, [ C>=2 && E>=1 && free_1>=0 && C>=2*free_1 && 1+2*free_1>=C && H>=1+free && D>=3 && A>=free_1 ], cost: 9 372.91/291.67 372.91/291.67 180: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=A-free_1, C'=free_1, D'=1, F'=free, G'=free_1, K'=free_1, L'=E, [ C>=2 && E>=1 && free_1>=0 && C>=2*free_1 && 1+2*free_1>=C && H>=1+free && A>=free_1 ], cost: 9 372.91/291.67 372.91/291.67 181: evalbinsearchStepSize2bb1in -> [33] : [ 0>=C && E==0 && free>=1+H && D>=2 && 255>=C+A ], cost: INF 372.91/291.67 372.91/291.67 182: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : C'=0, D'=2, E'=1, F'=free, G'=0, Q'=0, J'=1, [ E==0 && free>=1+H && D==1 && C==0 && 255>=A && 2*meter==2-D-E && meter>=1 ], cost: 8*meter 372.91/291.67 372.91/291.67 183: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=meter_1*free_4+A, C'=free_4, D'=2, E'=1, F'=free, G'=free_4, Q'=free_4, J'=1, [ E==0 && free>=1+H && D==1 && 0>=1+C && 0>=free_4 && 2*free_4>=C && 1+C>=2*free_4 && 255>=A+free_4 && 2*meter_1==1-D-E && meter_1>=1 ], cost: 8*meter_1 372.91/291.67 372.91/291.67 184: evalbinsearchStepSize2bb1in -> [33] : [ 0>=1+E && C==0 && free>=1+H && D>=2 && 255>=A ], cost: INF 372.91/291.67 372.91/291.67 185: evalbinsearchStepSize2bb1in -> [33] : [ 0>=1+E && C==0 && free>=1+H && 255>=A ], cost: INF 372.91/291.67 372.91/291.67 186: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=A, C'=0, D'=2, F'=free, G'=0, Q'=0, J'=E, [ 0>=1+E && 1+C>=0 && free>=1+H && 0>=D && 255>=A && -1-C>=1 ], cost: -8-8*C 372.91/291.67 372.91/291.67 187: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=A, C'=0, D'=2, F'=free, G'=0, Q'=0, J'=E, [ 0>=1+E && 0>=1+C && 1+C>=0 && free>=1+H && D>=2 && 255>=A ], cost: -8*C 372.91/291.67 372.91/291.67 188: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=A, C'=0, D'=2, F'=free, G'=0, Q'=0, J'=E, [ 0>=1+E && 0>=1+C && 1+C>=0 && free>=1+H && 255>=A ], cost: -8*C 372.91/291.67 372.91/291.67 189: evalbinsearchStepSize2bb1in -> [33] : [ E>=1 && C==0 && free>=1+H && D>=2 && 255>=A ], cost: INF 372.91/291.67 372.91/291.67 190: evalbinsearchStepSize2bb1in -> [33] : [ E>=1 && C==0 && free>=1+H && 255>=A ], cost: INF 372.91/291.67 372.91/291.67 191: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=A, C'=0, D'=2, F'=free, G'=0, Q'=0, J'=E, [ E>=1 && 1+C>=0 && free>=1+H && 0>=D && 255>=A && -1-C>=1 ], cost: -8-8*C 372.91/291.67 372.91/291.67 192: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=A, C'=0, D'=2, F'=free, G'=0, Q'=0, J'=E, [ E>=1 && 0>=1+C && 1+C>=0 && free>=1+H && D>=2 && 255>=A ], cost: -8*C 372.91/291.67 372.91/291.67 193: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=A, C'=0, D'=2, F'=free, G'=0, Q'=0, J'=E, [ E>=1 && 0>=1+C && 1+C>=0 && free>=1+H && 255>=A ], cost: -8*C 372.91/291.67 372.91/291.67 194: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=k*C+A, D'=2, F'=free, G'=C, Q'=C, J'=E, [ C>=2 && E==0 && free>=1+H && D>=2 && 255>=C+A && k>0 && 255>=C*(-1+k)+C+A ], cost: 7*k 372.91/291.67 372.91/291.67 195: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=meter_2*free_3+A, C'=free_3, D'=2, E'=1, F'=free, G'=free_3, Q'=free_3, J'=1, [ C>=2 && E==0 && free>=1+H && D==1 && free_3>=0 && C>=2*free_3 && 1+2*free_3>=C && 255>=free_3+A && 2*meter_2==1-D-E && meter_2>=1 ], cost: 8*meter_2 372.91/291.67 372.91/291.67 196: evalbinsearchStepSize2bb1in -> [33] : [ C>=2 && 0>=1+E && C>=2*free_1 && 1+2*free_1>=C && free>=1+H && 0>=D && 255>=A+free_1 && free_1>=2 && free_1>=2*free_1 ], cost: INF 372.91/291.67 372.91/291.67 197: evalbinsearchStepSize2bb1in -> [33] : [ C>=2 && 0>=1+E && C>=2*free_1 && 1+2*free_1>=C && free>=1+H && D>=2 && 255>=A+free_1 && free_1>=2 && free_1>=2*free_1 ], cost: INF 372.91/291.67 372.91/291.67 198: evalbinsearchStepSize2bb1in -> [33] : [ C>=2 && 0>=1+E && C>=2*free_1 && 1+2*free_1>=C && free>=1+H && 255>=A+free_1 && free_1>=2 && free_1>=2*free_1 ], cost: INF 372.91/291.67 372.91/291.67 199: evalbinsearchStepSize2bb1in -> [33] : [ C>=2 && E>=1 && C>=2*free_1 && 1+2*free_1>=C && free>=1+H && 0>=D && 255>=A+free_1 && free_1>=2 && free_1>=2*free_1 ], cost: INF 372.91/291.67 372.91/291.67 200: evalbinsearchStepSize2bb1in -> [33] : [ C>=2 && E>=1 && C>=2*free_1 && 1+2*free_1>=C && free>=1+H && D>=2 && 255>=A+free_1 && free_1>=2 && free_1>=2*free_1 ], cost: INF 372.91/291.67 372.91/291.67 201: evalbinsearchStepSize2bb1in -> [33] : [ C>=2 && E>=1 && C>=2*free_1 && 1+2*free_1>=C && free>=1+H && 255>=A+free_1 && free_1>=2 && free_1>=2*free_1 ], cost: INF 372.91/291.67 372.91/291.67 202: evalbinsearchStepSize2bb1in -> [33] : [ 0>=C && E==0 && H>=1+free && 1>=D && A>=C ], cost: INF 372.91/291.67 372.91/291.67 203: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : C'=0, D'=1, E'=1, F'=free, G'=0, K'=0, L'=1, [ E==0 && H>=1+free && D==2 && C==0 && A>=0 && 2*meter_3==-1+D-E && meter_3>=1 ], cost: 9*meter_3 372.91/291.67 372.91/291.67 204: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=A-free_6*meter_4, C'=free_6, D'=1, E'=1, F'=free, G'=free_6, K'=free_6, L'=1, [ E==0 && H>=1+free && D==2 && 0>=1+C && 0>=free_6 && 2*free_6>=C && 1+C>=2*free_6 && A>=free_6 && 2*meter_4==-2+D-E && meter_4>=1 ], cost: 9*meter_4 372.91/291.67 372.91/291.67 205: evalbinsearchStepSize2bb1in -> [33] : [ 0>=1+E && C==0 && H>=1+free && 1>=D && A>=0 ], cost: INF 372.91/291.67 372.91/291.67 206: evalbinsearchStepSize2bb1in -> [33] : [ 0>=1+E && C==0 && H>=1+free && A>=0 ], cost: INF 372.91/291.67 372.91/291.67 207: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=A, C'=0, D'=1, F'=free, G'=0, K'=0, L'=E, [ 0>=1+E && 0>=1+C && 1+C>=0 && H>=1+free && 1>=D && A>=0 ], cost: -9*C 372.91/291.67 372.91/291.67 208: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=A, C'=0, D'=1, F'=free, G'=0, K'=0, L'=E, [ 0>=1+E && 1+C>=0 && H>=1+free && D>=3 && A>=0 && -1-C>=1 ], cost: -9-9*C 372.91/291.67 372.91/291.67 209: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=A, C'=0, D'=1, F'=free, G'=0, K'=0, L'=E, [ 0>=1+E && 0>=1+C && 1+C>=0 && H>=1+free && A>=0 ], cost: -9*C 372.91/291.67 372.91/291.67 210: evalbinsearchStepSize2bb1in -> [33] : [ E>=1 && C==0 && H>=1+free && 1>=D && A>=0 ], cost: INF 372.91/291.67 372.91/291.67 211: evalbinsearchStepSize2bb1in -> [33] : [ E>=1 && C==0 && H>=1+free && A>=0 ], cost: INF 372.91/291.67 372.91/291.67 212: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=A, C'=0, D'=1, F'=free, G'=0, K'=0, L'=E, [ E>=1 && 0>=1+C && 1+C>=0 && H>=1+free && 1>=D && A>=0 ], cost: -9*C 372.91/291.67 372.91/291.67 213: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=A, C'=0, D'=1, F'=free, G'=0, K'=0, L'=E, [ E>=1 && 1+C>=0 && H>=1+free && D>=3 && A>=0 && -1-C>=1 ], cost: -9-9*C 372.91/291.67 372.91/291.67 214: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=A, C'=0, D'=1, F'=free, G'=0, K'=0, L'=E, [ E>=1 && 0>=1+C && 1+C>=0 && H>=1+free && A>=0 ], cost: -9*C 372.91/291.67 372.91/291.67 215: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=-C*k_1+A, D'=1, F'=free, G'=C, K'=C, L'=E, [ C>=2 && E==0 && H>=1+free && 1>=D && A>=C && k_1>0 && -C*(-1+k_1)+A>=C ], cost: 8*k_1 372.91/291.67 372.91/291.67 216: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=A-free_5*meter_5, C'=free_5, D'=1, E'=1, F'=free, G'=free_5, K'=free_5, L'=1, [ C>=2 && E==0 && H>=1+free && D==2 && free_5>=0 && C>=2*free_5 && 1+2*free_5>=C && A>=free_5 && 2*meter_5==-2+D-E && meter_5>=1 ], cost: 9*meter_5 372.91/291.67 372.91/291.67 217: evalbinsearchStepSize2bb1in -> [33] : [ C>=2 && 0>=1+E && C>=2*free_1 && 1+2*free_1>=C && H>=1+free && 1>=D && A>=free_1 && free_1>=2 && free_1>=2*free_1 ], cost: INF 372.91/291.67 372.91/291.67 218: evalbinsearchStepSize2bb1in -> [33] : [ C>=2 && 0>=1+E && C>=2*free_1 && 1+2*free_1>=C && H>=1+free && D>=3 && A>=free_1 && free_1>=2 && free_1>=2*free_1 ], cost: INF 372.91/291.67 372.91/291.67 219: evalbinsearchStepSize2bb1in -> [33] : [ C>=2 && 0>=1+E && C>=2*free_1 && 1+2*free_1>=C && H>=1+free && A>=free_1 && free_1>=2 && free_1>=2*free_1 ], cost: INF 372.91/291.67 372.91/291.67 220: evalbinsearchStepSize2bb1in -> [33] : [ C>=2 && E>=1 && C>=2*free_1 && 1+2*free_1>=C && H>=1+free && 1>=D && A>=free_1 && free_1>=2 && free_1>=2*free_1 ], cost: INF 372.91/291.67 372.91/291.67 221: evalbinsearchStepSize2bb1in -> [33] : [ C>=2 && E>=1 && C>=2*free_1 && 1+2*free_1>=C && H>=1+free && D>=3 && A>=free_1 && free_1>=2 && free_1>=2*free_1 ], cost: INF 372.91/291.67 372.91/291.67 222: evalbinsearchStepSize2bb1in -> [33] : [ C>=2 && E>=1 && C>=2*free_1 && 1+2*free_1>=C && H>=1+free && A>=free_1 && free_1>=2 && free_1>=2*free_1 ], cost: INF 372.91/291.67 372.91/291.67 372.91/291.67 372.91/291.67 Chained accelerated rules (with incoming rules): 372.91/291.67 372.91/291.67 Start location: evalbinsearchStepSize2start 372.91/291.67 372.91/291.67 70: evalbinsearchStepSize2start -> evalbinsearchStepSize2bb1in : A'=B, C'=4, D'=0, E'=0, [], cost: 18 372.91/291.67 372.91/291.67 223: evalbinsearchStepSize2start -> evalbinsearchStepSize2bb1in : A'=4+B, C'=4, D'=2, E'=0, F'=free, G'=4, Q'=4, J'=0, [ free>=1+H && 255>=4+B ], cost: 25 372.91/291.67 372.91/291.67 224: evalbinsearchStepSize2start -> evalbinsearchStepSize2bb1in : A'=-4*k_1+B, C'=4, D'=1, E'=0, F'=free, G'=4, K'=4, L'=0, [ H>=1+free && B>=4 && k_1>0 && 4-4*k_1+B>=4 ], cost: 18+8*k_1 372.91/291.67 372.91/291.67 372.91/291.67 372.91/291.67 Removed unreachable locations (and leaf rules with constant cost): 372.91/291.67 372.91/291.67 Start location: evalbinsearchStepSize2start 372.91/291.67 372.91/291.67 224: evalbinsearchStepSize2start -> evalbinsearchStepSize2bb1in : A'=-4*k_1+B, C'=4, D'=1, E'=0, F'=free, G'=4, K'=4, L'=0, [ H>=1+free && B>=4 && k_1>0 && 4-4*k_1+B>=4 ], cost: 18+8*k_1 372.91/291.67 372.91/291.67 372.91/291.67 372.91/291.67 ### Computing asymptotic complexity ### 372.91/291.67 372.91/291.67 372.91/291.67 372.91/291.67 Fully simplified ITS problem 372.91/291.67 372.91/291.67 Start location: evalbinsearchStepSize2start 372.91/291.67 372.91/291.67 224: evalbinsearchStepSize2start -> evalbinsearchStepSize2bb1in : A'=-4*k_1+B, C'=4, D'=1, E'=0, F'=free, G'=4, K'=4, L'=0, [ H>=1+free && B>=4 && k_1>0 && 4-4*k_1+B>=4 ], cost: 18+8*k_1 372.91/291.67 372.91/291.67 372.91/291.67 372.91/291.67 Computing asymptotic complexity for rule 224 372.91/291.67 372.91/291.67 Simplified the guard: 372.91/291.67 372.91/291.67 224: evalbinsearchStepSize2start -> evalbinsearchStepSize2bb1in : A'=-4*k_1+B, C'=4, D'=1, E'=0, F'=free, G'=4, K'=4, L'=0, [ H>=1+free && k_1>0 && 4-4*k_1+B>=4 ], cost: 18+8*k_1 372.91/291.67 372.91/291.67 Solved the limit problem by the following transformations: 372.91/291.67 372.91/291.67 Created initial limit problem: 372.91/291.67 372.91/291.67 k_1 (+/+!), -free+H (+/+!), 18+8*k_1 (+), 1-4*k_1+B (+/+!) [not solved] 372.91/291.67 372.91/291.67 372.91/291.67 372.91/291.67 removing all constraints (solved by SMT) 372.91/291.67 372.91/291.67 resulting limit problem: [solved] 372.91/291.67 372.91/291.67 372.91/291.67 372.91/291.67 applying transformation rule (C) using substitution {k_1==n,free==0,H==1,B==5*n} 372.91/291.67 372.91/291.67 resulting limit problem: 372.91/291.67 372.91/291.67 [solved] 372.91/291.67 372.91/291.67 372.91/291.67 372.91/291.67 Solved the limit problem by the following transformations: 372.91/291.67 372.91/291.67 Created initial limit problem: 372.91/291.67 372.91/291.67 k_1 (+/+!), -free+H (+/+!), 18+8*k_1 (+), 1-4*k_1+B (+/+!) [not solved] 372.91/291.67 372.91/291.67 372.91/291.67 372.91/291.67 applying transformation rule (C) using substitution {H==1+free} 372.91/291.67 372.91/291.67 resulting limit problem: 372.91/291.67 372.91/291.67 1 (+/+!), k_1 (+/+!), 18+8*k_1 (+), 1-4*k_1+B (+/+!) [not solved] 372.91/291.67 372.91/291.67 372.91/291.67 372.91/291.67 applying transformation rule (B), deleting 1 (+/+!) 372.91/291.67 372.91/291.67 resulting limit problem: 372.91/291.67 372.91/291.67 k_1 (+/+!), 18+8*k_1 (+), 1-4*k_1+B (+/+!) [not solved] 372.91/291.67 372.91/291.67 372.91/291.67 372.91/291.67 removing all constraints (solved by SMT) 372.91/291.67 372.91/291.67 resulting limit problem: [solved] 372.91/291.67 372.91/291.67 372.91/291.67 372.91/291.67 applying transformation rule (C) using substitution {k_1==n,B==5*n} 372.91/291.67 372.91/291.67 resulting limit problem: 372.91/291.67 372.91/291.67 [solved] 372.91/291.67 372.91/291.67 372.91/291.67 372.91/291.67 Solution: 372.91/291.67 372.91/291.67 k_1 / n 372.91/291.67 372.91/291.67 free / 0 372.91/291.67 372.91/291.67 H / 1 372.91/291.67 372.91/291.67 B / 5*n 372.91/291.67 372.91/291.67 Resulting cost 18+8*n has complexity: Poly(n^1) 372.91/291.67 372.91/291.67 372.91/291.67 372.91/291.67 Found new complexity Poly(n^1). 372.91/291.67 372.91/291.67 372.91/291.67 372.91/291.67 Obtained the following overall complexity (w.r.t. the length of the input n): 372.91/291.67 372.91/291.67 Complexity: Poly(n^1) 372.91/291.67 372.91/291.67 Cpx degree: 1 372.91/291.67 372.91/291.67 Solved cost: 18+8*n 372.91/291.67 372.91/291.67 Rule cost: 18+8*k_1 372.91/291.67 372.91/291.67 Rule guard: [ H>=1+free && k_1>0 && 4-4*k_1+B>=4 ] 372.91/291.67 372.91/291.67 372.91/291.67 372.91/291.67 WORST_CASE(Omega(n^1),?) 372.91/291.67 372.91/291.67 372.91/291.67 ---------------------------------------- 372.91/291.67 372.91/291.67 (2) 372.91/291.67 BOUNDS(n^1, INF) 372.91/291.70 EOF