/export/starexec/sandbox2/solver/bin/starexec_run_complexity /export/starexec/sandbox2/benchmark/theBenchmark.koat /export/starexec/sandbox2/output/output_files


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


KILLED
proof of /export/starexec/sandbox2/benchmark/theBenchmark.koat
# AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty


The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, INF).

(0) CpxIntTrs
(1) Loat Proof [FINISHED, 34.2 s]
(2) BOUNDS(1, INF)


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

(0)
Obligation:
Complexity Int TRS consisting of the following rules:
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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
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

The start-symbols are:[eval_bin_search_StepSize2_start_12]


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

(1) Loat Proof (FINISHED)


### Pre-processing the ITS problem ###



Initial linear ITS problem

   Start location: evalbinsearchStepSize2start

      0: evalbinsearchStepSize2start -> evalbinsearchStepSize2bb0in : [], cost: 1

      1: evalbinsearchStepSize2bb0in -> evalbinsearchStepSize20 : [], cost: 1

      2: evalbinsearchStepSize20 -> evalbinsearchStepSize21 : [], cost: 1

      3: evalbinsearchStepSize21 -> evalbinsearchStepSize22 : [], cost: 1

      4: evalbinsearchStepSize22 -> evalbinsearchStepSize23 : [], cost: 1

      5: evalbinsearchStepSize23 -> evalbinsearchStepSize24 : [], cost: 1

      6: evalbinsearchStepSize24 -> evalbinsearchStepSize25 : [], cost: 1

      7: evalbinsearchStepSize25 -> evalbinsearchStepSize26 : [], cost: 1

      8: evalbinsearchStepSize26 -> evalbinsearchStepSize27 : [], cost: 1

      9: evalbinsearchStepSize27 -> evalbinsearchStepSize28 : [], cost: 1

     10: evalbinsearchStepSize28 -> evalbinsearchStepSize29 : [], cost: 1

     11: evalbinsearchStepSize29 -> evalbinsearchStepSize210 : [], cost: 1

     12: evalbinsearchStepSize210 -> evalbinsearchStepSize211 : [], cost: 1

     13: evalbinsearchStepSize211 -> evalbinsearchStepSize212 : [], cost: 1

     14: evalbinsearchStepSize212 -> evalbinsearchStepSize213 : [], cost: 1

     15: evalbinsearchStepSize213 -> evalbinsearchStepSize214 : [], cost: 1

     16: evalbinsearchStepSize214 -> evalbinsearchStepSize215 : [], cost: 1

     17: evalbinsearchStepSize215 -> evalbinsearchStepSize2bb1in : A'=B, C'=4, D'=0, E'=0, [], cost: 1

     18: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize216 : [], cost: 1

     19: evalbinsearchStepSize216 -> evalbinsearchStepSize217 : F'=free, [], cost: 1

     20: evalbinsearchStepSize217 -> evalbinsearchStepSize2bb12in : [ C==1 ], cost: 1

     21: evalbinsearchStepSize217 -> evalbinsearchStepSize2bb2in : [ 0>=C ], cost: 1

     22: evalbinsearchStepSize217 -> evalbinsearchStepSize2bb2in : [ C>=2 ], cost: 1

     23: evalbinsearchStepSize2bb2in -> evalbinsearchStepSize2bb3in : [ 0>=1+E ], cost: 1

     24: evalbinsearchStepSize2bb2in -> evalbinsearchStepSize2bb3in : [ E>=1 ], cost: 1

     25: evalbinsearchStepSize2bb2in -> evalbinsearchStepSize2bb4in : G'=C, [ E==0 ], cost: 1

     26: evalbinsearchStepSize2bb3in -> evalbinsearchStepSize2bb4in : G'=0, [ C==0 ], cost: 1

     27: evalbinsearchStepSize2bb3in -> evalbinsearchStepSize2bb4in : G'=free_1, [ C>=1 && free_1>=0 && C>=2*free_1 && 1+2*free_1>=C ], cost: 1

     28: evalbinsearchStepSize2bb3in -> evalbinsearchStepSize2bb4in : G'=free_2, [ 0>=1+C && 0>=free_2 && 2*free_2>=C && 1+C>=2*free_2 ], cost: 1

     29: evalbinsearchStepSize2bb4in -> evalbinsearchStepSize2bb5in : [ F>=1+H ], cost: 1

     30: evalbinsearchStepSize2bb4in -> evalbinsearchStepSize2bb8in : [ H>=F ], cost: 1

     31: evalbinsearchStepSize2bb5in -> evalbinsearchStepSize2bb7in : Q'=G, J'=E, [ 0>=D ], cost: 1

     32: evalbinsearchStepSize2bb5in -> evalbinsearchStepSize2bb7in : Q'=G, J'=E, [ D>=2 ], cost: 1

     33: evalbinsearchStepSize2bb5in -> evalbinsearchStepSize2bb7in : Q'=G, J'=E, [ 0>=1+E ], cost: 1

     34: evalbinsearchStepSize2bb5in -> evalbinsearchStepSize2bb7in : Q'=G, J'=E, [ E>=1 ], cost: 1

     35: evalbinsearchStepSize2bb5in -> evalbinsearchStepSize2bb6in : [ D==1 && E==0 ], cost: 1

     36: evalbinsearchStepSize2bb6in -> evalbinsearchStepSize2bb7in : Q'=0, J'=1, [ G==0 ], cost: 1

     37: evalbinsearchStepSize2bb6in -> evalbinsearchStepSize2bb7in : Q'=free_3, J'=1, [ G>=1 && free_3>=0 && G>=2*free_3 && 1+2*free_3>=G ], cost: 1

     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

     39: evalbinsearchStepSize2bb7in -> evalbinsearchStepSize2bb12in : [ A+Q>=256 ], cost: 1

     40: evalbinsearchStepSize2bb7in -> evalbinsearchStepSize2bb1in : A'=A+Q, C'=Q, D'=2, E'=J, [ 255>=A+Q ], cost: 1

     41: evalbinsearchStepSize2bb8in -> evalbinsearchStepSize2bb9in : [ H>=1+F ], cost: 1

     42: evalbinsearchStepSize2bb8in -> evalbinsearchStepSize2bb12in : [ F>=H ], cost: 1

     43: evalbinsearchStepSize2bb9in -> evalbinsearchStepSize2bb11in : K'=G, L'=E, [ 1>=D ], cost: 1

     44: evalbinsearchStepSize2bb9in -> evalbinsearchStepSize2bb11in : K'=G, L'=E, [ D>=3 ], cost: 1

     45: evalbinsearchStepSize2bb9in -> evalbinsearchStepSize2bb11in : K'=G, L'=E, [ 0>=1+E ], cost: 1

     46: evalbinsearchStepSize2bb9in -> evalbinsearchStepSize2bb11in : K'=G, L'=E, [ E>=1 ], cost: 1

     47: evalbinsearchStepSize2bb9in -> evalbinsearchStepSize2bb10in : [ D==2 && E==0 ], cost: 1

     48: evalbinsearchStepSize2bb10in -> evalbinsearchStepSize2bb11in : K'=0, L'=1, [ G==0 ], cost: 1

     49: evalbinsearchStepSize2bb10in -> evalbinsearchStepSize2bb11in : K'=free_5, L'=1, [ G>=1 && free_5>=0 && G>=2*free_5 && 1+2*free_5>=G ], cost: 1

     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

     51: evalbinsearchStepSize2bb11in -> evalbinsearchStepSize2bb12in : [ K>=1+A ], cost: 1

     52: evalbinsearchStepSize2bb11in -> evalbinsearchStepSize2bb1in : A'=A-K, C'=K, D'=1, E'=L, [ A>=K ], cost: 1

     53: evalbinsearchStepSize2bb12in -> evalbinsearchStepSize2stop : [], cost: 1



Checking for constant complexity:

   The following rule is satisfiable with cost >= 1, yielding constant complexity:

      0: evalbinsearchStepSize2start -> evalbinsearchStepSize2bb0in : [], cost: 1



Removed unreachable and leaf rules:

   Start location: evalbinsearchStepSize2start

      0: evalbinsearchStepSize2start -> evalbinsearchStepSize2bb0in : [], cost: 1

      1: evalbinsearchStepSize2bb0in -> evalbinsearchStepSize20 : [], cost: 1

      2: evalbinsearchStepSize20 -> evalbinsearchStepSize21 : [], cost: 1

      3: evalbinsearchStepSize21 -> evalbinsearchStepSize22 : [], cost: 1

      4: evalbinsearchStepSize22 -> evalbinsearchStepSize23 : [], cost: 1

      5: evalbinsearchStepSize23 -> evalbinsearchStepSize24 : [], cost: 1

      6: evalbinsearchStepSize24 -> evalbinsearchStepSize25 : [], cost: 1

      7: evalbinsearchStepSize25 -> evalbinsearchStepSize26 : [], cost: 1

      8: evalbinsearchStepSize26 -> evalbinsearchStepSize27 : [], cost: 1

      9: evalbinsearchStepSize27 -> evalbinsearchStepSize28 : [], cost: 1

     10: evalbinsearchStepSize28 -> evalbinsearchStepSize29 : [], cost: 1

     11: evalbinsearchStepSize29 -> evalbinsearchStepSize210 : [], cost: 1

     12: evalbinsearchStepSize210 -> evalbinsearchStepSize211 : [], cost: 1

     13: evalbinsearchStepSize211 -> evalbinsearchStepSize212 : [], cost: 1

     14: evalbinsearchStepSize212 -> evalbinsearchStepSize213 : [], cost: 1

     15: evalbinsearchStepSize213 -> evalbinsearchStepSize214 : [], cost: 1

     16: evalbinsearchStepSize214 -> evalbinsearchStepSize215 : [], cost: 1

     17: evalbinsearchStepSize215 -> evalbinsearchStepSize2bb1in : A'=B, C'=4, D'=0, E'=0, [], cost: 1

     18: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize216 : [], cost: 1

     19: evalbinsearchStepSize216 -> evalbinsearchStepSize217 : F'=free, [], cost: 1

     21: evalbinsearchStepSize217 -> evalbinsearchStepSize2bb2in : [ 0>=C ], cost: 1

     22: evalbinsearchStepSize217 -> evalbinsearchStepSize2bb2in : [ C>=2 ], cost: 1

     23: evalbinsearchStepSize2bb2in -> evalbinsearchStepSize2bb3in : [ 0>=1+E ], cost: 1

     24: evalbinsearchStepSize2bb2in -> evalbinsearchStepSize2bb3in : [ E>=1 ], cost: 1

     25: evalbinsearchStepSize2bb2in -> evalbinsearchStepSize2bb4in : G'=C, [ E==0 ], cost: 1

     26: evalbinsearchStepSize2bb3in -> evalbinsearchStepSize2bb4in : G'=0, [ C==0 ], cost: 1

     27: evalbinsearchStepSize2bb3in -> evalbinsearchStepSize2bb4in : G'=free_1, [ C>=1 && free_1>=0 && C>=2*free_1 && 1+2*free_1>=C ], cost: 1

     28: evalbinsearchStepSize2bb3in -> evalbinsearchStepSize2bb4in : G'=free_2, [ 0>=1+C && 0>=free_2 && 2*free_2>=C && 1+C>=2*free_2 ], cost: 1

     29: evalbinsearchStepSize2bb4in -> evalbinsearchStepSize2bb5in : [ F>=1+H ], cost: 1

     30: evalbinsearchStepSize2bb4in -> evalbinsearchStepSize2bb8in : [ H>=F ], cost: 1

     31: evalbinsearchStepSize2bb5in -> evalbinsearchStepSize2bb7in : Q'=G, J'=E, [ 0>=D ], cost: 1

     32: evalbinsearchStepSize2bb5in -> evalbinsearchStepSize2bb7in : Q'=G, J'=E, [ D>=2 ], cost: 1

     33: evalbinsearchStepSize2bb5in -> evalbinsearchStepSize2bb7in : Q'=G, J'=E, [ 0>=1+E ], cost: 1

     34: evalbinsearchStepSize2bb5in -> evalbinsearchStepSize2bb7in : Q'=G, J'=E, [ E>=1 ], cost: 1

     35: evalbinsearchStepSize2bb5in -> evalbinsearchStepSize2bb6in : [ D==1 && E==0 ], cost: 1

     36: evalbinsearchStepSize2bb6in -> evalbinsearchStepSize2bb7in : Q'=0, J'=1, [ G==0 ], cost: 1

     37: evalbinsearchStepSize2bb6in -> evalbinsearchStepSize2bb7in : Q'=free_3, J'=1, [ G>=1 && free_3>=0 && G>=2*free_3 && 1+2*free_3>=G ], cost: 1

     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

     40: evalbinsearchStepSize2bb7in -> evalbinsearchStepSize2bb1in : A'=A+Q, C'=Q, D'=2, E'=J, [ 255>=A+Q ], cost: 1

     41: evalbinsearchStepSize2bb8in -> evalbinsearchStepSize2bb9in : [ H>=1+F ], cost: 1

     43: evalbinsearchStepSize2bb9in -> evalbinsearchStepSize2bb11in : K'=G, L'=E, [ 1>=D ], cost: 1

     44: evalbinsearchStepSize2bb9in -> evalbinsearchStepSize2bb11in : K'=G, L'=E, [ D>=3 ], cost: 1

     45: evalbinsearchStepSize2bb9in -> evalbinsearchStepSize2bb11in : K'=G, L'=E, [ 0>=1+E ], cost: 1

     46: evalbinsearchStepSize2bb9in -> evalbinsearchStepSize2bb11in : K'=G, L'=E, [ E>=1 ], cost: 1

     47: evalbinsearchStepSize2bb9in -> evalbinsearchStepSize2bb10in : [ D==2 && E==0 ], cost: 1

     48: evalbinsearchStepSize2bb10in -> evalbinsearchStepSize2bb11in : K'=0, L'=1, [ G==0 ], cost: 1

     49: evalbinsearchStepSize2bb10in -> evalbinsearchStepSize2bb11in : K'=free_5, L'=1, [ G>=1 && free_5>=0 && G>=2*free_5 && 1+2*free_5>=G ], cost: 1

     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

     52: evalbinsearchStepSize2bb11in -> evalbinsearchStepSize2bb1in : A'=A-K, C'=K, D'=1, E'=L, [ A>=K ], cost: 1



### Simplification by acceleration and chaining ###



Eliminated locations (on linear paths):

   Start location: evalbinsearchStepSize2start

     70: evalbinsearchStepSize2start -> evalbinsearchStepSize2bb1in : A'=B, C'=4, D'=0, E'=0, [], cost: 18

     71: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize217 : F'=free, [], cost: 2

     21: evalbinsearchStepSize217 -> evalbinsearchStepSize2bb2in : [ 0>=C ], cost: 1

     22: evalbinsearchStepSize217 -> evalbinsearchStepSize2bb2in : [ C>=2 ], cost: 1

     23: evalbinsearchStepSize2bb2in -> evalbinsearchStepSize2bb3in : [ 0>=1+E ], cost: 1

     24: evalbinsearchStepSize2bb2in -> evalbinsearchStepSize2bb3in : [ E>=1 ], cost: 1

     25: evalbinsearchStepSize2bb2in -> evalbinsearchStepSize2bb4in : G'=C, [ E==0 ], cost: 1

     26: evalbinsearchStepSize2bb3in -> evalbinsearchStepSize2bb4in : G'=0, [ C==0 ], cost: 1

     27: evalbinsearchStepSize2bb3in -> evalbinsearchStepSize2bb4in : G'=free_1, [ C>=1 && free_1>=0 && C>=2*free_1 && 1+2*free_1>=C ], cost: 1

     28: evalbinsearchStepSize2bb3in -> evalbinsearchStepSize2bb4in : G'=free_2, [ 0>=1+C && 0>=free_2 && 2*free_2>=C && 1+C>=2*free_2 ], cost: 1

     29: evalbinsearchStepSize2bb4in -> evalbinsearchStepSize2bb5in : [ F>=1+H ], cost: 1

     72: evalbinsearchStepSize2bb4in -> evalbinsearchStepSize2bb9in : [ H>=1+F ], cost: 2

     31: evalbinsearchStepSize2bb5in -> evalbinsearchStepSize2bb7in : Q'=G, J'=E, [ 0>=D ], cost: 1

     32: evalbinsearchStepSize2bb5in -> evalbinsearchStepSize2bb7in : Q'=G, J'=E, [ D>=2 ], cost: 1

     33: evalbinsearchStepSize2bb5in -> evalbinsearchStepSize2bb7in : Q'=G, J'=E, [ 0>=1+E ], cost: 1

     34: evalbinsearchStepSize2bb5in -> evalbinsearchStepSize2bb7in : Q'=G, J'=E, [ E>=1 ], cost: 1

     35: evalbinsearchStepSize2bb5in -> evalbinsearchStepSize2bb6in : [ D==1 && E==0 ], cost: 1

     36: evalbinsearchStepSize2bb6in -> evalbinsearchStepSize2bb7in : Q'=0, J'=1, [ G==0 ], cost: 1

     37: evalbinsearchStepSize2bb6in -> evalbinsearchStepSize2bb7in : Q'=free_3, J'=1, [ G>=1 && free_3>=0 && G>=2*free_3 && 1+2*free_3>=G ], cost: 1

     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

     40: evalbinsearchStepSize2bb7in -> evalbinsearchStepSize2bb1in : A'=A+Q, C'=Q, D'=2, E'=J, [ 255>=A+Q ], cost: 1

     43: evalbinsearchStepSize2bb9in -> evalbinsearchStepSize2bb11in : K'=G, L'=E, [ 1>=D ], cost: 1

     44: evalbinsearchStepSize2bb9in -> evalbinsearchStepSize2bb11in : K'=G, L'=E, [ D>=3 ], cost: 1

     45: evalbinsearchStepSize2bb9in -> evalbinsearchStepSize2bb11in : K'=G, L'=E, [ 0>=1+E ], cost: 1

     46: evalbinsearchStepSize2bb9in -> evalbinsearchStepSize2bb11in : K'=G, L'=E, [ E>=1 ], cost: 1

     47: evalbinsearchStepSize2bb9in -> evalbinsearchStepSize2bb10in : [ D==2 && E==0 ], cost: 1

     48: evalbinsearchStepSize2bb10in -> evalbinsearchStepSize2bb11in : K'=0, L'=1, [ G==0 ], cost: 1

     49: evalbinsearchStepSize2bb10in -> evalbinsearchStepSize2bb11in : K'=free_5, L'=1, [ G>=1 && free_5>=0 && G>=2*free_5 && 1+2*free_5>=G ], cost: 1

     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

     52: evalbinsearchStepSize2bb11in -> evalbinsearchStepSize2bb1in : A'=A-K, C'=K, D'=1, E'=L, [ A>=K ], cost: 1



Eliminated locations (on tree-shaped paths):

   Start location: evalbinsearchStepSize2start

     70: evalbinsearchStepSize2start -> evalbinsearchStepSize2bb1in : A'=B, C'=4, D'=0, E'=0, [], cost: 18

     73: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb2in : F'=free, [ 0>=C ], cost: 3

     74: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb2in : F'=free, [ C>=2 ], cost: 3

     81: evalbinsearchStepSize2bb2in -> evalbinsearchStepSize2bb5in : G'=C, [ E==0 && F>=1+H ], cost: 2

     82: evalbinsearchStepSize2bb2in -> evalbinsearchStepSize2bb9in : G'=C, [ E==0 && H>=1+F ], cost: 3

     83: evalbinsearchStepSize2bb2in -> evalbinsearchStepSize2bb5in : G'=0, [ 0>=1+E && C==0 && F>=1+H ], cost: 3

     84: evalbinsearchStepSize2bb2in -> evalbinsearchStepSize2bb9in : G'=0, [ 0>=1+E && C==0 && H>=1+F ], cost: 4

     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

     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

     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

     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

     89: evalbinsearchStepSize2bb2in -> evalbinsearchStepSize2bb5in : G'=0, [ E>=1 && C==0 && F>=1+H ], cost: 3

     90: evalbinsearchStepSize2bb2in -> evalbinsearchStepSize2bb9in : G'=0, [ E>=1 && C==0 && H>=1+F ], cost: 4

     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

     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

     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

     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

     98: evalbinsearchStepSize2bb5in -> evalbinsearchStepSize2bb1in : A'=G+A, C'=G, D'=2, E'=E, Q'=G, J'=E, [ 0>=D && 255>=G+A ], cost: 2

     99: evalbinsearchStepSize2bb5in -> evalbinsearchStepSize2bb1in : A'=G+A, C'=G, D'=2, E'=E, Q'=G, J'=E, [ D>=2 && 255>=G+A ], cost: 2

    100: evalbinsearchStepSize2bb5in -> evalbinsearchStepSize2bb1in : A'=G+A, C'=G, D'=2, E'=E, Q'=G, J'=E, [ 0>=1+E && 255>=G+A ], cost: 2

    101: evalbinsearchStepSize2bb5in -> evalbinsearchStepSize2bb1in : A'=G+A, C'=G, D'=2, E'=E, Q'=G, J'=E, [ E>=1 && 255>=G+A ], cost: 2

    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

    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

    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

    108: evalbinsearchStepSize2bb9in -> evalbinsearchStepSize2bb1in : A'=-G+A, C'=G, D'=1, E'=E, K'=G, L'=E, [ 1>=D && A>=G ], cost: 2

    109: evalbinsearchStepSize2bb9in -> evalbinsearchStepSize2bb1in : A'=-G+A, C'=G, D'=1, E'=E, K'=G, L'=E, [ D>=3 && A>=G ], cost: 2

    110: evalbinsearchStepSize2bb9in -> evalbinsearchStepSize2bb1in : A'=-G+A, C'=G, D'=1, E'=E, K'=G, L'=E, [ 0>=1+E && A>=G ], cost: 2

    111: evalbinsearchStepSize2bb9in -> evalbinsearchStepSize2bb1in : A'=-G+A, C'=G, D'=1, E'=E, K'=G, L'=E, [ E>=1 && A>=G ], cost: 2

    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

    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

    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



Eliminated locations (on tree-shaped paths):

   Start location: evalbinsearchStepSize2start

     70: evalbinsearchStepSize2start -> evalbinsearchStepSize2bb1in : A'=B, C'=4, D'=0, E'=0, [], cost: 18

    115: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb5in : F'=free, G'=C, [ 0>=C && E==0 && free>=1+H ], cost: 5

    116: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb9in : F'=free, G'=C, [ 0>=C && E==0 && H>=1+free ], cost: 6

    117: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb5in : F'=free, G'=0, [ 0>=1+E && C==0 && free>=1+H ], cost: 6

    118: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb9in : F'=free, G'=0, [ 0>=1+E && C==0 && H>=1+free ], cost: 7

    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

    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

    121: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb5in : F'=free, G'=0, [ E>=1 && C==0 && free>=1+H ], cost: 6

    122: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb9in : F'=free, G'=0, [ E>=1 && C==0 && H>=1+free ], cost: 7

    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

    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

    125: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb5in : F'=free, G'=C, [ C>=2 && E==0 && free>=1+H ], cost: 5

    126: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb9in : F'=free, G'=C, [ C>=2 && E==0 && H>=1+free ], cost: 6

    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

    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

    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

    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

     98: evalbinsearchStepSize2bb5in -> evalbinsearchStepSize2bb1in : A'=G+A, C'=G, D'=2, E'=E, Q'=G, J'=E, [ 0>=D && 255>=G+A ], cost: 2

     99: evalbinsearchStepSize2bb5in -> evalbinsearchStepSize2bb1in : A'=G+A, C'=G, D'=2, E'=E, Q'=G, J'=E, [ D>=2 && 255>=G+A ], cost: 2

    100: evalbinsearchStepSize2bb5in -> evalbinsearchStepSize2bb1in : A'=G+A, C'=G, D'=2, E'=E, Q'=G, J'=E, [ 0>=1+E && 255>=G+A ], cost: 2

    101: evalbinsearchStepSize2bb5in -> evalbinsearchStepSize2bb1in : A'=G+A, C'=G, D'=2, E'=E, Q'=G, J'=E, [ E>=1 && 255>=G+A ], cost: 2

    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

    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

    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

    108: evalbinsearchStepSize2bb9in -> evalbinsearchStepSize2bb1in : A'=-G+A, C'=G, D'=1, E'=E, K'=G, L'=E, [ 1>=D && A>=G ], cost: 2

    109: evalbinsearchStepSize2bb9in -> evalbinsearchStepSize2bb1in : A'=-G+A, C'=G, D'=1, E'=E, K'=G, L'=E, [ D>=3 && A>=G ], cost: 2

    110: evalbinsearchStepSize2bb9in -> evalbinsearchStepSize2bb1in : A'=-G+A, C'=G, D'=1, E'=E, K'=G, L'=E, [ 0>=1+E && A>=G ], cost: 2

    111: evalbinsearchStepSize2bb9in -> evalbinsearchStepSize2bb1in : A'=-G+A, C'=G, D'=1, E'=E, K'=G, L'=E, [ E>=1 && A>=G ], cost: 2

    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

    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

    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



Eliminated locations (on tree-shaped paths):

   Start location: evalbinsearchStepSize2start

     70: evalbinsearchStepSize2start -> evalbinsearchStepSize2bb1in : A'=B, C'=4, D'=0, E'=0, [], cost: 18

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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



Accelerating simple loops of location 18.

   Simplified some of the simple loops (and removed duplicate rules).

   Accelerating the following rules:

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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



   Found no metering function for rule 131.

   Accelerated rule 132 with NONTERM, yielding the new rule 181.

   Accelerated rule 133 with metering function meter (where 2*meter==2-D-E), yielding the new rule 182.

   Accelerated rule 134 with metering function meter_1 (where 2*meter_1==1-D-E), yielding the new rule 183.

   Found no metering function for rule 135.

   Accelerated rule 136 with NONTERM, yielding the new rule 184.

   Accelerated rule 137 with NONTERM, yielding the new rule 185.

      During metering: Instantiating temporary variables by {free_2==0}

   Accelerated rule 138 with metering function -1-C, yielding the new rule 186.

      During metering: Instantiating temporary variables by {free_2==0}

   Accelerated rule 139 with metering function -C, yielding the new rule 187.

      During metering: Instantiating temporary variables by {free_2==0}

   Accelerated rule 140 with metering function -C, yielding the new rule 188.

   Found no metering function for rule 141.

   Accelerated rule 142 with NONTERM, yielding the new rule 189.

   Accelerated rule 143 with NONTERM, yielding the new rule 190.

      During metering: Instantiating temporary variables by {free_2==0}

   Accelerated rule 144 with metering function -1-C, yielding the new rule 191.

      During metering: Instantiating temporary variables by {free_2==0}

   Accelerated rule 145 with metering function -C, yielding the new rule 192.

      During metering: Instantiating temporary variables by {free_2==0}

   Accelerated rule 146 with metering function -C, yielding the new rule 193.

   Found no metering function for rule 147.

   Found no metering function for rule 148.

   Accelerated rule 149 with metering function meter_2 (where 2*meter_2==1-D-E), yielding the new rule 194.

   Accelerated rule 150 with NONTERM (after strengthening guard), yielding the new rule 195.

   Accelerated rule 151 with NONTERM (after strengthening guard), yielding the new rule 196.

   Accelerated rule 152 with NONTERM (after strengthening guard), yielding the new rule 197.

   Accelerated rule 153 with NONTERM (after strengthening guard), yielding the new rule 198.

   Accelerated rule 154 with NONTERM (after strengthening guard), yielding the new rule 199.

   Accelerated rule 155 with NONTERM (after strengthening guard), yielding the new rule 200.

   Accelerated rule 156 with NONTERM, yielding the new rule 201.

   Found no metering function for rule 157.

   Accelerated rule 158 with metering function meter_3 (where 2*meter_3==-1+D-E), yielding the new rule 202.

   Accelerated rule 159 with metering function meter_4 (where 2*meter_4==-2+D-E), yielding the new rule 203.

   Accelerated rule 160 with NONTERM, yielding the new rule 204.

   Found no metering function for rule 161.

   Accelerated rule 162 with NONTERM, yielding the new rule 205.

      During metering: Instantiating temporary variables by {free_2==0}

   Accelerated rule 163 with metering function -C, yielding the new rule 206.

      During metering: Instantiating temporary variables by {free_2==0}

   Accelerated rule 164 with metering function -1-C, yielding the new rule 207.

      During metering: Instantiating temporary variables by {free_2==0}

   Accelerated rule 165 with metering function -C, yielding the new rule 208.

   Accelerated rule 166 with NONTERM, yielding the new rule 209.

   Found no metering function for rule 167.

   Accelerated rule 168 with NONTERM, yielding the new rule 210.

      During metering: Instantiating temporary variables by {free_2==0}

   Accelerated rule 169 with metering function -C, yielding the new rule 211.

      During metering: Instantiating temporary variables by {free_2==0}

   Accelerated rule 170 with metering function -1-C, yielding the new rule 212.

      During metering: Instantiating temporary variables by {free_2==0}

   Accelerated rule 171 with metering function -C, yielding the new rule 213.

   Found no metering function for rule 172.

   Found no metering function for rule 173.

   Accelerated rule 174 with metering function meter_5 (where 2*meter_5==-2+D-E), yielding the new rule 214.

   Accelerated rule 175 with NONTERM (after strengthening guard), yielding the new rule 215.

   Accelerated rule 176 with NONTERM (after strengthening guard), yielding the new rule 216.

   Accelerated rule 177 with NONTERM (after strengthening guard), yielding the new rule 217.

   Accelerated rule 178 with NONTERM (after strengthening guard), yielding the new rule 218.

   Accelerated rule 179 with NONTERM (after strengthening guard), yielding the new rule 219.

   Accelerated rule 180 with NONTERM (after strengthening guard), yielding the new rule 220.

   Removing the simple loops: 132 133 134 136 137 138 139 140 142 143 144 145 146 149 156 158 159 160 162 163 164 165 166 168 169 170 171 174.



Accelerated all simple loops using metering functions (where possible):

   Start location: evalbinsearchStepSize2start

     70: evalbinsearchStepSize2start -> evalbinsearchStepSize2bb1in : A'=B, C'=4, D'=0, E'=0, [], cost: 18

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    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

    181: evalbinsearchStepSize2bb1in -> [33] : [ 0>=C && E==0 && free>=1+H && D>=2 && 255>=C+A ], cost: NONTERM

    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

    183: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=free_4*meter_1+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

    184: evalbinsearchStepSize2bb1in -> [33] : [ 0>=1+E && C==0 && free>=1+H && D>=2 && 255>=A ], cost: NONTERM

    185: evalbinsearchStepSize2bb1in -> [33] : [ 0>=1+E && C==0 && free>=1+H && 255>=A ], cost: NONTERM

    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

    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

    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

    189: evalbinsearchStepSize2bb1in -> [33] : [ E>=1 && C==0 && free>=1+H && D>=2 && 255>=A ], cost: NONTERM

    190: evalbinsearchStepSize2bb1in -> [33] : [ E>=1 && C==0 && free>=1+H && 255>=A ], cost: NONTERM

    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

    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

    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

    194: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=free_3*meter_2+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

    195: 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: NONTERM

    196: 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: NONTERM

    197: 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: NONTERM

    198: 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: NONTERM

    199: 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: NONTERM

    200: 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: NONTERM

    201: evalbinsearchStepSize2bb1in -> [33] : [ 0>=C && E==0 && H>=1+free && 1>=D && A>=C ], cost: NONTERM

    202: 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

    203: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=A-meter_4*free_6, 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

    204: evalbinsearchStepSize2bb1in -> [33] : [ 0>=1+E && C==0 && H>=1+free && 1>=D && A>=0 ], cost: NONTERM

    205: evalbinsearchStepSize2bb1in -> [33] : [ 0>=1+E && C==0 && H>=1+free && A>=0 ], cost: NONTERM

    206: 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

    207: 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

    208: 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

    209: evalbinsearchStepSize2bb1in -> [33] : [ E>=1 && C==0 && H>=1+free && 1>=D && A>=0 ], cost: NONTERM

    210: evalbinsearchStepSize2bb1in -> [33] : [ E>=1 && C==0 && H>=1+free && A>=0 ], cost: NONTERM

    211: 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

    212: 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

    213: 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

    214: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb1in : A'=-free_5*meter_5+A, 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

    215: 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: NONTERM

    216: 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: NONTERM

    217: 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: NONTERM

    218: 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: NONTERM

    219: 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: NONTERM

    220: 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: NONTERM



Chained accelerated rules (with incoming rules):

   Start location: evalbinsearchStepSize2start

     70: evalbinsearchStepSize2start -> evalbinsearchStepSize2bb1in : A'=B, C'=4, D'=0, E'=0, [], cost: 18

    221: 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

    222: evalbinsearchStepSize2start -> evalbinsearchStepSize2bb1in : A'=-4+B, C'=4, D'=1, E'=0, F'=free, G'=4, K'=4, L'=0, [ H>=1+free && B>=4 ], cost: 26



Removed unreachable locations (and leaf rules with constant cost):

   Start location: evalbinsearchStepSize2start

     <empty>



### Computing asymptotic complexity ###



Fully simplified ITS problem

   Start location: evalbinsearchStepSize2start

     <empty>



Obtained the following overall complexity (w.r.t. the length of the input n):

   Complexity:  Constant

   Cpx degree:  0

   Solved cost: 1

   Rule cost:   1

   Rule guard:  []



WORST_CASE(Omega(1),?)


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

(2)
BOUNDS(1, INF)