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


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


MAYBE
proof of /export/starexec/sandbox/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, 32.9 s]
(2) BOUNDS(1, INF)


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

(0)
Obligation:
Complexity Int TRS consisting of the following rules:
evalbinsearchStepSize2start(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2entryin(A, B, C, D, E, F, G, H, I)) :|: TRUE
evalbinsearchStepSize2entryin(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bbin(0, 0, 4, A, E, F, G, H, I)) :|: TRUE
evalbinsearchStepSize2bbin(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2returnin(A, B, C, D, E, F, G, H, I)) :|: C >= 1 && C <= 1
evalbinsearchStepSize2bbin(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb1in(A, B, C, D, J, F, G, H, I)) :|: 0 >= C
evalbinsearchStepSize2bbin(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb1in(A, B, C, D, J, F, G, H, I)) :|: C >= 2
evalbinsearchStepSize2bb1in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb2in(A, B, C, D, E, F, G, H, I)) :|: 0 >= B + 1
evalbinsearchStepSize2bb1in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb2in(A, B, C, D, E, F, G, H, I)) :|: B >= 1
evalbinsearchStepSize2bb1in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb3in(A, B, C, D, E, C, G, H, I)) :|: B >= 0 && B <= 0
evalbinsearchStepSize2bb2in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb3in(A, B, C, D, E, 0, G, H, I)) :|: C >= 0 && C <= 0
evalbinsearchStepSize2bb2in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb3in(A, B, C, D, E, J, G, H, I)) :|: C >= 1 && J >= 0 && C >= 2 * J && 1 + 2 * J >= C
evalbinsearchStepSize2bb2in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb3in(A, B, C, D, E, J, G, H, I)) :|: 0 >= C + 1 && 0 >= J && 2 * J >= C && 1 + C >= 2 * J
evalbinsearchStepSize2bb3in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb4in(A, B, C, D, E, F, G, H, I)) :|: E >= G + 1
evalbinsearchStepSize2bb3in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb9in(A, B, C, D, E, F, G, H, I)) :|: G >= E
evalbinsearchStepSize2bb4in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb6in(A, B, C, D, E, F, G, H, I)) :|: A >= 1 && A <= 1 && B >= 0 && B <= 0
evalbinsearchStepSize2bb4in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb7in(A, B, C, D, E, F, G, B, F)) :|: 0 >= A
evalbinsearchStepSize2bb4in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb7in(A, B, C, D, E, F, G, B, F)) :|: A >= 2
evalbinsearchStepSize2bb4in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb7in(A, B, C, D, E, F, G, B, F)) :|: 0 >= B + 1
evalbinsearchStepSize2bb4in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb7in(A, B, C, D, E, F, G, B, F)) :|: B >= 1
evalbinsearchStepSize2bb6in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb7in(A, B, C, D, E, F, G, 1, 0)) :|: F >= 0 && F <= 0
evalbinsearchStepSize2bb6in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb7in(A, B, C, D, E, F, G, 1, J)) :|: F >= 1 && J >= 0 && F >= 2 * J && 1 + 2 * J >= F
evalbinsearchStepSize2bb6in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb7in(A, B, C, D, E, F, G, 1, J)) :|: 0 >= F + 1 && 0 >= J && 2 * J >= F && 1 + F >= 2 * J
evalbinsearchStepSize2bb7in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2returnin(A, B, C, D, E, F, G, H, I)) :|: D + I >= 256
evalbinsearchStepSize2bb7in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bbin(2, H, I, D + I, E, F, G, H, I)) :|: 255 >= D + I
evalbinsearchStepSize2bb9in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb10in(A, B, C, D, E, F, G, H, I)) :|: G >= E + 1
evalbinsearchStepSize2bb9in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2returnin(A, B, C, D, E, F, G, H, I)) :|: E >= G
evalbinsearchStepSize2bb10in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb12in(A, B, C, D, E, F, G, H, I)) :|: A >= 2 && A <= 2 && B >= 0 && B <= 0
evalbinsearchStepSize2bb10in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb13in(A, B, C, D, E, F, G, B, F)) :|: 1 >= A
evalbinsearchStepSize2bb10in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb13in(A, B, C, D, E, F, G, B, F)) :|: A >= 3
evalbinsearchStepSize2bb10in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb13in(A, B, C, D, E, F, G, B, F)) :|: 0 >= B + 1
evalbinsearchStepSize2bb10in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb13in(A, B, C, D, E, F, G, B, F)) :|: B >= 1
evalbinsearchStepSize2bb12in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb13in(A, B, C, D, E, F, G, 1, 0)) :|: F >= 0 && F <= 0
evalbinsearchStepSize2bb12in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb13in(A, B, C, D, E, F, G, 1, J)) :|: F >= 1 && J >= 0 && F >= 2 * J && 1 + 2 * J >= F
evalbinsearchStepSize2bb12in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bb13in(A, B, C, D, E, F, G, 1, J)) :|: 0 >= F + 1 && 0 >= J && 2 * J >= F && 1 + F >= 2 * J
evalbinsearchStepSize2bb13in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2returnin(A, B, C, D, E, F, G, H, I)) :|: I >= D + 1
evalbinsearchStepSize2bb13in(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2bbin(1, H, I, D - I, E, F, G, H, I)) :|: D >= I
evalbinsearchStepSize2returnin(A, B, C, D, E, F, G, H, I) -> Com_1(evalbinsearchStepSize2stop(A, B, C, D, E, F, G, H, I)) :|: TRUE

The start-symbols are:[evalbinsearchStepSize2start_9]


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

(1) Loat Proof (FINISHED)


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



Initial linear ITS problem

   Start location: evalbinsearchStepSize2start

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

      1: evalbinsearchStepSize2entryin -> evalbinsearchStepSize2bbin : A'=0, B'=0, C'=4, D'=A, [], cost: 1

      2: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2returnin : [ C==1 ], cost: 1

      3: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb1in : E'=free, [ 0>=C ], cost: 1

      4: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb1in : E'=free_1, [ C>=2 ], cost: 1

      5: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb2in : [ 0>=1+B ], cost: 1

      6: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb2in : [ B>=1 ], cost: 1

      7: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb3in : F'=C, [ B==0 ], cost: 1

      8: evalbinsearchStepSize2bb2in -> evalbinsearchStepSize2bb3in : F'=0, [ C==0 ], cost: 1

      9: evalbinsearchStepSize2bb2in -> evalbinsearchStepSize2bb3in : F'=free_2, [ C>=1 && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C ], cost: 1

     10: evalbinsearchStepSize2bb2in -> evalbinsearchStepSize2bb3in : F'=free_3, [ 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 ], cost: 1

     11: evalbinsearchStepSize2bb3in -> evalbinsearchStepSize2bb4in : [ E>=1+G ], cost: 1

     12: evalbinsearchStepSize2bb3in -> evalbinsearchStepSize2bb9in : [ G>=E ], cost: 1

     13: evalbinsearchStepSize2bb4in -> evalbinsearchStepSize2bb6in : [ A==1 && B==0 ], cost: 1

     14: evalbinsearchStepSize2bb4in -> evalbinsearchStepSize2bb7in : H'=B, Q'=F, [ 0>=A ], cost: 1

     15: evalbinsearchStepSize2bb4in -> evalbinsearchStepSize2bb7in : H'=B, Q'=F, [ A>=2 ], cost: 1

     16: evalbinsearchStepSize2bb4in -> evalbinsearchStepSize2bb7in : H'=B, Q'=F, [ 0>=1+B ], cost: 1

     17: evalbinsearchStepSize2bb4in -> evalbinsearchStepSize2bb7in : H'=B, Q'=F, [ B>=1 ], cost: 1

     18: evalbinsearchStepSize2bb6in -> evalbinsearchStepSize2bb7in : H'=1, Q'=0, [ F==0 ], cost: 1

     19: evalbinsearchStepSize2bb6in -> evalbinsearchStepSize2bb7in : H'=1, Q'=free_4, [ F>=1 && free_4>=0 && F>=2*free_4 && 1+2*free_4>=F ], cost: 1

     20: evalbinsearchStepSize2bb6in -> evalbinsearchStepSize2bb7in : H'=1, Q'=free_5, [ 0>=1+F && 0>=free_5 && 2*free_5>=F && 1+F>=2*free_5 ], cost: 1

     21: evalbinsearchStepSize2bb7in -> evalbinsearchStepSize2returnin : [ D+Q>=256 ], cost: 1

     22: evalbinsearchStepSize2bb7in -> evalbinsearchStepSize2bbin : A'=2, B'=H, C'=Q, D'=D+Q, [ 255>=D+Q ], cost: 1

     23: evalbinsearchStepSize2bb9in -> evalbinsearchStepSize2bb10in : [ G>=1+E ], cost: 1

     24: evalbinsearchStepSize2bb9in -> evalbinsearchStepSize2returnin : [ E>=G ], cost: 1

     25: evalbinsearchStepSize2bb10in -> evalbinsearchStepSize2bb12in : [ A==2 && B==0 ], cost: 1

     26: evalbinsearchStepSize2bb10in -> evalbinsearchStepSize2bb13in : H'=B, Q'=F, [ 1>=A ], cost: 1

     27: evalbinsearchStepSize2bb10in -> evalbinsearchStepSize2bb13in : H'=B, Q'=F, [ A>=3 ], cost: 1

     28: evalbinsearchStepSize2bb10in -> evalbinsearchStepSize2bb13in : H'=B, Q'=F, [ 0>=1+B ], cost: 1

     29: evalbinsearchStepSize2bb10in -> evalbinsearchStepSize2bb13in : H'=B, Q'=F, [ B>=1 ], cost: 1

     30: evalbinsearchStepSize2bb12in -> evalbinsearchStepSize2bb13in : H'=1, Q'=0, [ F==0 ], cost: 1

     31: evalbinsearchStepSize2bb12in -> evalbinsearchStepSize2bb13in : H'=1, Q'=free_6, [ F>=1 && free_6>=0 && F>=2*free_6 && 1+2*free_6>=F ], cost: 1

     32: evalbinsearchStepSize2bb12in -> evalbinsearchStepSize2bb13in : H'=1, Q'=free_7, [ 0>=1+F && 0>=free_7 && 2*free_7>=F && 1+F>=2*free_7 ], cost: 1

     33: evalbinsearchStepSize2bb13in -> evalbinsearchStepSize2returnin : [ Q>=1+D ], cost: 1

     34: evalbinsearchStepSize2bb13in -> evalbinsearchStepSize2bbin : A'=1, B'=H, C'=Q, D'=D-Q, [ D>=Q ], cost: 1

     35: evalbinsearchStepSize2returnin -> evalbinsearchStepSize2stop : [], cost: 1



Checking for constant complexity:

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

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



Removed unreachable and leaf rules:

   Start location: evalbinsearchStepSize2start

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

      1: evalbinsearchStepSize2entryin -> evalbinsearchStepSize2bbin : A'=0, B'=0, C'=4, D'=A, [], cost: 1

      3: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb1in : E'=free, [ 0>=C ], cost: 1

      4: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb1in : E'=free_1, [ C>=2 ], cost: 1

      5: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb2in : [ 0>=1+B ], cost: 1

      6: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb2in : [ B>=1 ], cost: 1

      7: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb3in : F'=C, [ B==0 ], cost: 1

      8: evalbinsearchStepSize2bb2in -> evalbinsearchStepSize2bb3in : F'=0, [ C==0 ], cost: 1

      9: evalbinsearchStepSize2bb2in -> evalbinsearchStepSize2bb3in : F'=free_2, [ C>=1 && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C ], cost: 1

     10: evalbinsearchStepSize2bb2in -> evalbinsearchStepSize2bb3in : F'=free_3, [ 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 ], cost: 1

     11: evalbinsearchStepSize2bb3in -> evalbinsearchStepSize2bb4in : [ E>=1+G ], cost: 1

     12: evalbinsearchStepSize2bb3in -> evalbinsearchStepSize2bb9in : [ G>=E ], cost: 1

     13: evalbinsearchStepSize2bb4in -> evalbinsearchStepSize2bb6in : [ A==1 && B==0 ], cost: 1

     14: evalbinsearchStepSize2bb4in -> evalbinsearchStepSize2bb7in : H'=B, Q'=F, [ 0>=A ], cost: 1

     15: evalbinsearchStepSize2bb4in -> evalbinsearchStepSize2bb7in : H'=B, Q'=F, [ A>=2 ], cost: 1

     16: evalbinsearchStepSize2bb4in -> evalbinsearchStepSize2bb7in : H'=B, Q'=F, [ 0>=1+B ], cost: 1

     17: evalbinsearchStepSize2bb4in -> evalbinsearchStepSize2bb7in : H'=B, Q'=F, [ B>=1 ], cost: 1

     18: evalbinsearchStepSize2bb6in -> evalbinsearchStepSize2bb7in : H'=1, Q'=0, [ F==0 ], cost: 1

     19: evalbinsearchStepSize2bb6in -> evalbinsearchStepSize2bb7in : H'=1, Q'=free_4, [ F>=1 && free_4>=0 && F>=2*free_4 && 1+2*free_4>=F ], cost: 1

     20: evalbinsearchStepSize2bb6in -> evalbinsearchStepSize2bb7in : H'=1, Q'=free_5, [ 0>=1+F && 0>=free_5 && 2*free_5>=F && 1+F>=2*free_5 ], cost: 1

     22: evalbinsearchStepSize2bb7in -> evalbinsearchStepSize2bbin : A'=2, B'=H, C'=Q, D'=D+Q, [ 255>=D+Q ], cost: 1

     23: evalbinsearchStepSize2bb9in -> evalbinsearchStepSize2bb10in : [ G>=1+E ], cost: 1

     25: evalbinsearchStepSize2bb10in -> evalbinsearchStepSize2bb12in : [ A==2 && B==0 ], cost: 1

     26: evalbinsearchStepSize2bb10in -> evalbinsearchStepSize2bb13in : H'=B, Q'=F, [ 1>=A ], cost: 1

     27: evalbinsearchStepSize2bb10in -> evalbinsearchStepSize2bb13in : H'=B, Q'=F, [ A>=3 ], cost: 1

     28: evalbinsearchStepSize2bb10in -> evalbinsearchStepSize2bb13in : H'=B, Q'=F, [ 0>=1+B ], cost: 1

     29: evalbinsearchStepSize2bb10in -> evalbinsearchStepSize2bb13in : H'=B, Q'=F, [ B>=1 ], cost: 1

     30: evalbinsearchStepSize2bb12in -> evalbinsearchStepSize2bb13in : H'=1, Q'=0, [ F==0 ], cost: 1

     31: evalbinsearchStepSize2bb12in -> evalbinsearchStepSize2bb13in : H'=1, Q'=free_6, [ F>=1 && free_6>=0 && F>=2*free_6 && 1+2*free_6>=F ], cost: 1

     32: evalbinsearchStepSize2bb12in -> evalbinsearchStepSize2bb13in : H'=1, Q'=free_7, [ 0>=1+F && 0>=free_7 && 2*free_7>=F && 1+F>=2*free_7 ], cost: 1

     34: evalbinsearchStepSize2bb13in -> evalbinsearchStepSize2bbin : A'=1, B'=H, C'=Q, D'=D-Q, [ D>=Q ], cost: 1



### Simplification by acceleration and chaining ###



Eliminated locations (on linear paths):

   Start location: evalbinsearchStepSize2start

     36: evalbinsearchStepSize2start -> evalbinsearchStepSize2bbin : A'=0, B'=0, C'=4, D'=A, [], cost: 2

      3: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb1in : E'=free, [ 0>=C ], cost: 1

      4: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb1in : E'=free_1, [ C>=2 ], cost: 1

      5: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb2in : [ 0>=1+B ], cost: 1

      6: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb2in : [ B>=1 ], cost: 1

      7: evalbinsearchStepSize2bb1in -> evalbinsearchStepSize2bb3in : F'=C, [ B==0 ], cost: 1

      8: evalbinsearchStepSize2bb2in -> evalbinsearchStepSize2bb3in : F'=0, [ C==0 ], cost: 1

      9: evalbinsearchStepSize2bb2in -> evalbinsearchStepSize2bb3in : F'=free_2, [ C>=1 && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C ], cost: 1

     10: evalbinsearchStepSize2bb2in -> evalbinsearchStepSize2bb3in : F'=free_3, [ 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 ], cost: 1

     11: evalbinsearchStepSize2bb3in -> evalbinsearchStepSize2bb4in : [ E>=1+G ], cost: 1

     37: evalbinsearchStepSize2bb3in -> evalbinsearchStepSize2bb10in : [ G>=1+E ], cost: 2

     13: evalbinsearchStepSize2bb4in -> evalbinsearchStepSize2bb6in : [ A==1 && B==0 ], cost: 1

     14: evalbinsearchStepSize2bb4in -> evalbinsearchStepSize2bb7in : H'=B, Q'=F, [ 0>=A ], cost: 1

     15: evalbinsearchStepSize2bb4in -> evalbinsearchStepSize2bb7in : H'=B, Q'=F, [ A>=2 ], cost: 1

     16: evalbinsearchStepSize2bb4in -> evalbinsearchStepSize2bb7in : H'=B, Q'=F, [ 0>=1+B ], cost: 1

     17: evalbinsearchStepSize2bb4in -> evalbinsearchStepSize2bb7in : H'=B, Q'=F, [ B>=1 ], cost: 1

     18: evalbinsearchStepSize2bb6in -> evalbinsearchStepSize2bb7in : H'=1, Q'=0, [ F==0 ], cost: 1

     19: evalbinsearchStepSize2bb6in -> evalbinsearchStepSize2bb7in : H'=1, Q'=free_4, [ F>=1 && free_4>=0 && F>=2*free_4 && 1+2*free_4>=F ], cost: 1

     20: evalbinsearchStepSize2bb6in -> evalbinsearchStepSize2bb7in : H'=1, Q'=free_5, [ 0>=1+F && 0>=free_5 && 2*free_5>=F && 1+F>=2*free_5 ], cost: 1

     22: evalbinsearchStepSize2bb7in -> evalbinsearchStepSize2bbin : A'=2, B'=H, C'=Q, D'=D+Q, [ 255>=D+Q ], cost: 1

     25: evalbinsearchStepSize2bb10in -> evalbinsearchStepSize2bb12in : [ A==2 && B==0 ], cost: 1

     26: evalbinsearchStepSize2bb10in -> evalbinsearchStepSize2bb13in : H'=B, Q'=F, [ 1>=A ], cost: 1

     27: evalbinsearchStepSize2bb10in -> evalbinsearchStepSize2bb13in : H'=B, Q'=F, [ A>=3 ], cost: 1

     28: evalbinsearchStepSize2bb10in -> evalbinsearchStepSize2bb13in : H'=B, Q'=F, [ 0>=1+B ], cost: 1

     29: evalbinsearchStepSize2bb10in -> evalbinsearchStepSize2bb13in : H'=B, Q'=F, [ B>=1 ], cost: 1

     30: evalbinsearchStepSize2bb12in -> evalbinsearchStepSize2bb13in : H'=1, Q'=0, [ F==0 ], cost: 1

     31: evalbinsearchStepSize2bb12in -> evalbinsearchStepSize2bb13in : H'=1, Q'=free_6, [ F>=1 && free_6>=0 && F>=2*free_6 && 1+2*free_6>=F ], cost: 1

     32: evalbinsearchStepSize2bb12in -> evalbinsearchStepSize2bb13in : H'=1, Q'=free_7, [ 0>=1+F && 0>=free_7 && 2*free_7>=F && 1+F>=2*free_7 ], cost: 1

     34: evalbinsearchStepSize2bb13in -> evalbinsearchStepSize2bbin : A'=1, B'=H, C'=Q, D'=D-Q, [ D>=Q ], cost: 1



Eliminated locations (on tree-shaped paths):

   Start location: evalbinsearchStepSize2start

     36: evalbinsearchStepSize2start -> evalbinsearchStepSize2bbin : A'=0, B'=0, C'=4, D'=A, [], cost: 2

     38: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb2in : E'=free, [ 0>=C && 0>=1+B ], cost: 2

     39: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb2in : E'=free, [ 0>=C && B>=1 ], cost: 2

     40: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb3in : E'=free, F'=C, [ 0>=C && B==0 ], cost: 2

     41: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb2in : E'=free_1, [ C>=2 && 0>=1+B ], cost: 2

     42: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb2in : E'=free_1, [ C>=2 && B>=1 ], cost: 2

     43: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb3in : E'=free_1, F'=C, [ C>=2 && B==0 ], cost: 2

      8: evalbinsearchStepSize2bb2in -> evalbinsearchStepSize2bb3in : F'=0, [ C==0 ], cost: 1

      9: evalbinsearchStepSize2bb2in -> evalbinsearchStepSize2bb3in : F'=free_2, [ C>=1 && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C ], cost: 1

     10: evalbinsearchStepSize2bb2in -> evalbinsearchStepSize2bb3in : F'=free_3, [ 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 ], cost: 1

     44: evalbinsearchStepSize2bb3in -> evalbinsearchStepSize2bb6in : [ E>=1+G && A==1 && B==0 ], cost: 2

     45: evalbinsearchStepSize2bb3in -> evalbinsearchStepSize2bb7in : H'=B, Q'=F, [ E>=1+G && 0>=A ], cost: 2

     46: evalbinsearchStepSize2bb3in -> evalbinsearchStepSize2bb7in : H'=B, Q'=F, [ E>=1+G && A>=2 ], cost: 2

     47: evalbinsearchStepSize2bb3in -> evalbinsearchStepSize2bb7in : H'=B, Q'=F, [ E>=1+G && 0>=1+B ], cost: 2

     48: evalbinsearchStepSize2bb3in -> evalbinsearchStepSize2bb7in : H'=B, Q'=F, [ E>=1+G && B>=1 ], cost: 2

     49: evalbinsearchStepSize2bb3in -> evalbinsearchStepSize2bb12in : [ G>=1+E && A==2 && B==0 ], cost: 3

     50: evalbinsearchStepSize2bb3in -> evalbinsearchStepSize2bb13in : H'=B, Q'=F, [ G>=1+E && 1>=A ], cost: 3

     51: evalbinsearchStepSize2bb3in -> evalbinsearchStepSize2bb13in : H'=B, Q'=F, [ G>=1+E && A>=3 ], cost: 3

     52: evalbinsearchStepSize2bb3in -> evalbinsearchStepSize2bb13in : H'=B, Q'=F, [ G>=1+E && 0>=1+B ], cost: 3

     53: evalbinsearchStepSize2bb3in -> evalbinsearchStepSize2bb13in : H'=B, Q'=F, [ G>=1+E && B>=1 ], cost: 3

     18: evalbinsearchStepSize2bb6in -> evalbinsearchStepSize2bb7in : H'=1, Q'=0, [ F==0 ], cost: 1

     19: evalbinsearchStepSize2bb6in -> evalbinsearchStepSize2bb7in : H'=1, Q'=free_4, [ F>=1 && free_4>=0 && F>=2*free_4 && 1+2*free_4>=F ], cost: 1

     20: evalbinsearchStepSize2bb6in -> evalbinsearchStepSize2bb7in : H'=1, Q'=free_5, [ 0>=1+F && 0>=free_5 && 2*free_5>=F && 1+F>=2*free_5 ], cost: 1

     22: evalbinsearchStepSize2bb7in -> evalbinsearchStepSize2bbin : A'=2, B'=H, C'=Q, D'=D+Q, [ 255>=D+Q ], cost: 1

     30: evalbinsearchStepSize2bb12in -> evalbinsearchStepSize2bb13in : H'=1, Q'=0, [ F==0 ], cost: 1

     31: evalbinsearchStepSize2bb12in -> evalbinsearchStepSize2bb13in : H'=1, Q'=free_6, [ F>=1 && free_6>=0 && F>=2*free_6 && 1+2*free_6>=F ], cost: 1

     32: evalbinsearchStepSize2bb12in -> evalbinsearchStepSize2bb13in : H'=1, Q'=free_7, [ 0>=1+F && 0>=free_7 && 2*free_7>=F && 1+F>=2*free_7 ], cost: 1

     34: evalbinsearchStepSize2bb13in -> evalbinsearchStepSize2bbin : A'=1, B'=H, C'=Q, D'=D-Q, [ D>=Q ], cost: 1



Eliminated locations (on tree-shaped paths):

   Start location: evalbinsearchStepSize2start

     36: evalbinsearchStepSize2start -> evalbinsearchStepSize2bbin : A'=0, B'=0, C'=4, D'=A, [], cost: 2

     60: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb6in : E'=free, F'=C, [ 0>=C && B==0 && free>=1+G && A==1 ], cost: 4

     61: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb7in : E'=free, F'=C, H'=B, Q'=C, [ 0>=C && B==0 && free>=1+G && 0>=A ], cost: 4

     62: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb7in : E'=free, F'=C, H'=B, Q'=C, [ 0>=C && B==0 && free>=1+G && A>=2 ], cost: 4

     63: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb12in : E'=free, F'=C, [ 0>=C && B==0 && G>=1+free && A==2 ], cost: 5

     64: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb13in : E'=free, F'=C, H'=B, Q'=C, [ 0>=C && B==0 && G>=1+free && 1>=A ], cost: 5

     65: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb13in : E'=free, F'=C, H'=B, Q'=C, [ 0>=C && B==0 && G>=1+free && A>=3 ], cost: 5

     66: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb6in : E'=free_1, F'=C, [ C>=2 && B==0 && free_1>=1+G && A==1 ], cost: 4

     67: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb7in : E'=free_1, F'=C, H'=B, Q'=C, [ C>=2 && B==0 && free_1>=1+G && 0>=A ], cost: 4

     68: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb7in : E'=free_1, F'=C, H'=B, Q'=C, [ C>=2 && B==0 && free_1>=1+G && A>=2 ], cost: 4

     69: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb12in : E'=free_1, F'=C, [ C>=2 && B==0 && G>=1+free_1 && A==2 ], cost: 5

     70: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb13in : E'=free_1, F'=C, H'=B, Q'=C, [ C>=2 && B==0 && G>=1+free_1 && 1>=A ], cost: 5

     71: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb13in : E'=free_1, F'=C, H'=B, Q'=C, [ C>=2 && B==0 && G>=1+free_1 && A>=3 ], cost: 5

     72: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb7in : E'=free, F'=0, H'=B, Q'=0, [ 0>=1+B && C==0 && free>=1+G && 0>=A ], cost: 5

     73: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb7in : E'=free, F'=0, H'=B, Q'=0, [ 0>=1+B && C==0 && free>=1+G && A>=2 ], cost: 5

     74: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb7in : E'=free, F'=0, H'=B, Q'=0, [ 0>=1+B && C==0 && free>=1+G ], cost: 5

     75: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb13in : E'=free, F'=0, H'=B, Q'=0, [ 0>=1+B && C==0 && G>=1+free && 1>=A ], cost: 6

     76: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb13in : E'=free, F'=0, H'=B, Q'=0, [ 0>=1+B && C==0 && G>=1+free && A>=3 ], cost: 6

     77: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb13in : E'=free, F'=0, H'=B, Q'=0, [ 0>=1+B && C==0 && G>=1+free ], cost: 6

     78: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb7in : E'=free, F'=free_3, H'=B, Q'=free_3, [ 0>=1+B && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && free>=1+G && 0>=A ], cost: 5

     79: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb7in : E'=free, F'=free_3, H'=B, Q'=free_3, [ 0>=1+B && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && free>=1+G && A>=2 ], cost: 5

     80: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb7in : E'=free, F'=free_3, H'=B, Q'=free_3, [ 0>=1+B && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && free>=1+G ], cost: 5

     81: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb13in : E'=free, F'=free_3, H'=B, Q'=free_3, [ 0>=1+B && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && G>=1+free && 1>=A ], cost: 6

     82: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb13in : E'=free, F'=free_3, H'=B, Q'=free_3, [ 0>=1+B && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && G>=1+free && A>=3 ], cost: 6

     83: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb13in : E'=free, F'=free_3, H'=B, Q'=free_3, [ 0>=1+B && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && G>=1+free ], cost: 6

     84: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb7in : E'=free, F'=0, H'=B, Q'=0, [ B>=1 && C==0 && free>=1+G && 0>=A ], cost: 5

     85: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb7in : E'=free, F'=0, H'=B, Q'=0, [ B>=1 && C==0 && free>=1+G && A>=2 ], cost: 5

     86: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb7in : E'=free, F'=0, H'=B, Q'=0, [ B>=1 && C==0 && free>=1+G ], cost: 5

     87: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb13in : E'=free, F'=0, H'=B, Q'=0, [ B>=1 && C==0 && G>=1+free && 1>=A ], cost: 6

     88: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb13in : E'=free, F'=0, H'=B, Q'=0, [ B>=1 && C==0 && G>=1+free && A>=3 ], cost: 6

     89: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb13in : E'=free, F'=0, H'=B, Q'=0, [ B>=1 && C==0 && G>=1+free ], cost: 6

     90: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb7in : E'=free, F'=free_3, H'=B, Q'=free_3, [ B>=1 && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && free>=1+G && 0>=A ], cost: 5

     91: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb7in : E'=free, F'=free_3, H'=B, Q'=free_3, [ B>=1 && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && free>=1+G && A>=2 ], cost: 5

     92: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb7in : E'=free, F'=free_3, H'=B, Q'=free_3, [ B>=1 && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && free>=1+G ], cost: 5

     93: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb13in : E'=free, F'=free_3, H'=B, Q'=free_3, [ B>=1 && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && G>=1+free && 1>=A ], cost: 6

     94: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb13in : E'=free, F'=free_3, H'=B, Q'=free_3, [ B>=1 && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && G>=1+free && A>=3 ], cost: 6

     95: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb13in : E'=free, F'=free_3, H'=B, Q'=free_3, [ B>=1 && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && G>=1+free ], cost: 6

     96: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb7in : E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && 0>=1+B && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && free_1>=1+G && 0>=A ], cost: 5

     97: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb7in : E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && 0>=1+B && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && free_1>=1+G && A>=2 ], cost: 5

     98: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb7in : E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && 0>=1+B && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && free_1>=1+G ], cost: 5

     99: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb13in : E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && 0>=1+B && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && G>=1+free_1 && 1>=A ], cost: 6

    100: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb13in : E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && 0>=1+B && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && G>=1+free_1 && A>=3 ], cost: 6

    101: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb13in : E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && 0>=1+B && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && G>=1+free_1 ], cost: 6

    102: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb7in : E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && B>=1 && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && free_1>=1+G && 0>=A ], cost: 5

    103: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb7in : E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && B>=1 && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && free_1>=1+G && A>=2 ], cost: 5

    104: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb7in : E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && B>=1 && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && free_1>=1+G ], cost: 5

    105: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb13in : E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && B>=1 && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && G>=1+free_1 && 1>=A ], cost: 6

    106: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb13in : E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && B>=1 && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && G>=1+free_1 && A>=3 ], cost: 6

    107: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bb13in : E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && B>=1 && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && G>=1+free_1 ], cost: 6

     18: evalbinsearchStepSize2bb6in -> evalbinsearchStepSize2bb7in : H'=1, Q'=0, [ F==0 ], cost: 1

     19: evalbinsearchStepSize2bb6in -> evalbinsearchStepSize2bb7in : H'=1, Q'=free_4, [ F>=1 && free_4>=0 && F>=2*free_4 && 1+2*free_4>=F ], cost: 1

     20: evalbinsearchStepSize2bb6in -> evalbinsearchStepSize2bb7in : H'=1, Q'=free_5, [ 0>=1+F && 0>=free_5 && 2*free_5>=F && 1+F>=2*free_5 ], cost: 1

     22: evalbinsearchStepSize2bb7in -> evalbinsearchStepSize2bbin : A'=2, B'=H, C'=Q, D'=D+Q, [ 255>=D+Q ], cost: 1

     30: evalbinsearchStepSize2bb12in -> evalbinsearchStepSize2bb13in : H'=1, Q'=0, [ F==0 ], cost: 1

     31: evalbinsearchStepSize2bb12in -> evalbinsearchStepSize2bb13in : H'=1, Q'=free_6, [ F>=1 && free_6>=0 && F>=2*free_6 && 1+2*free_6>=F ], cost: 1

     32: evalbinsearchStepSize2bb12in -> evalbinsearchStepSize2bb13in : H'=1, Q'=free_7, [ 0>=1+F && 0>=free_7 && 2*free_7>=F && 1+F>=2*free_7 ], cost: 1

     34: evalbinsearchStepSize2bb13in -> evalbinsearchStepSize2bbin : A'=1, B'=H, C'=Q, D'=D-Q, [ D>=Q ], cost: 1



Eliminated locations (on tree-shaped paths):

   Start location: evalbinsearchStepSize2start

     36: evalbinsearchStepSize2start -> evalbinsearchStepSize2bbin : A'=0, B'=0, C'=4, D'=A, [], cost: 2

    111: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, B'=B, C'=C, D'=C+D, E'=free, F'=C, H'=B, Q'=C, [ 0>=C && B==0 && free>=1+G && 0>=A && 255>=C+D ], cost: 5

    112: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, B'=B, C'=C, D'=C+D, E'=free, F'=C, H'=B, Q'=C, [ 0>=C && B==0 && free>=1+G && A>=2 && 255>=C+D ], cost: 5

    113: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, B'=B, C'=C, D'=C+D, E'=free_1, F'=C, H'=B, Q'=C, [ C>=2 && B==0 && free_1>=1+G && 0>=A && 255>=C+D ], cost: 5

    114: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, B'=B, C'=C, D'=C+D, E'=free_1, F'=C, H'=B, Q'=C, [ C>=2 && B==0 && free_1>=1+G && A>=2 && 255>=C+D ], cost: 5

    115: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, B'=B, C'=0, D'=D, E'=free, F'=0, H'=B, Q'=0, [ 0>=1+B && C==0 && free>=1+G && 0>=A && 255>=D ], cost: 6

    116: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, B'=B, C'=0, D'=D, E'=free, F'=0, H'=B, Q'=0, [ 0>=1+B && C==0 && free>=1+G && A>=2 && 255>=D ], cost: 6

    117: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, B'=B, C'=0, D'=D, E'=free, F'=0, H'=B, Q'=0, [ 0>=1+B && C==0 && free>=1+G && 255>=D ], cost: 6

    118: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, B'=B, C'=free_3, D'=D+free_3, E'=free, F'=free_3, H'=B, Q'=free_3, [ 0>=1+B && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && free>=1+G && 0>=A && 255>=D+free_3 ], cost: 6

    119: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, B'=B, C'=free_3, D'=D+free_3, E'=free, F'=free_3, H'=B, Q'=free_3, [ 0>=1+B && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && free>=1+G && A>=2 && 255>=D+free_3 ], cost: 6

    120: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, B'=B, C'=free_3, D'=D+free_3, E'=free, F'=free_3, H'=B, Q'=free_3, [ 0>=1+B && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && free>=1+G && 255>=D+free_3 ], cost: 6

    121: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, B'=B, C'=0, D'=D, E'=free, F'=0, H'=B, Q'=0, [ B>=1 && C==0 && free>=1+G && 0>=A && 255>=D ], cost: 6

    122: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, B'=B, C'=0, D'=D, E'=free, F'=0, H'=B, Q'=0, [ B>=1 && C==0 && free>=1+G && A>=2 && 255>=D ], cost: 6

    123: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, B'=B, C'=0, D'=D, E'=free, F'=0, H'=B, Q'=0, [ B>=1 && C==0 && free>=1+G && 255>=D ], cost: 6

    124: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, B'=B, C'=free_3, D'=D+free_3, E'=free, F'=free_3, H'=B, Q'=free_3, [ B>=1 && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && free>=1+G && 0>=A && 255>=D+free_3 ], cost: 6

    125: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, B'=B, C'=free_3, D'=D+free_3, E'=free, F'=free_3, H'=B, Q'=free_3, [ B>=1 && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && free>=1+G && A>=2 && 255>=D+free_3 ], cost: 6

    126: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, B'=B, C'=free_3, D'=D+free_3, E'=free, F'=free_3, H'=B, Q'=free_3, [ B>=1 && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && free>=1+G && 255>=D+free_3 ], cost: 6

    127: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, B'=B, C'=free_2, D'=free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && 0>=1+B && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && free_1>=1+G && 0>=A && 255>=free_2+D ], cost: 6

    128: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, B'=B, C'=free_2, D'=free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && 0>=1+B && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && free_1>=1+G && A>=2 && 255>=free_2+D ], cost: 6

    129: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, B'=B, C'=free_2, D'=free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && 0>=1+B && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && free_1>=1+G && 255>=free_2+D ], cost: 6

    130: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, B'=B, C'=free_2, D'=free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && B>=1 && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && free_1>=1+G && 0>=A && 255>=free_2+D ], cost: 6

    131: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, B'=B, C'=free_2, D'=free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && B>=1 && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && free_1>=1+G && A>=2 && 255>=free_2+D ], cost: 6

    132: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, B'=B, C'=free_2, D'=free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && B>=1 && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && free_1>=1+G && 255>=free_2+D ], cost: 6

    133: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, B'=1, C'=0, D'=D, E'=free, F'=C, H'=1, Q'=0, [ B==0 && free>=1+G && A==1 && C==0 && 255>=D ], cost: 6

    134: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, B'=1, C'=free_5, D'=free_5+D, E'=free, F'=C, H'=1, Q'=free_5, [ B==0 && free>=1+G && A==1 && 0>=1+C && 0>=free_5 && 2*free_5>=C && 1+C>=2*free_5 && 255>=free_5+D ], cost: 6

    135: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, B'=1, C'=free_4, D'=D+free_4, E'=free_1, F'=C, H'=1, Q'=free_4, [ C>=2 && B==0 && free_1>=1+G && A==1 && free_4>=0 && C>=2*free_4 && 1+2*free_4>=C && 255>=D+free_4 ], cost: 6

    139: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, B'=B, C'=C, D'=-C+D, E'=free, F'=C, H'=B, Q'=C, [ 0>=C && B==0 && G>=1+free && 1>=A && D>=C ], cost: 6

    140: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, B'=B, C'=C, D'=-C+D, E'=free, F'=C, H'=B, Q'=C, [ 0>=C && B==0 && G>=1+free && A>=3 && D>=C ], cost: 6

    141: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, B'=B, C'=C, D'=-C+D, E'=free_1, F'=C, H'=B, Q'=C, [ C>=2 && B==0 && G>=1+free_1 && 1>=A && D>=C ], cost: 6

    142: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, B'=B, C'=C, D'=-C+D, E'=free_1, F'=C, H'=B, Q'=C, [ C>=2 && B==0 && G>=1+free_1 && A>=3 && D>=C ], cost: 6

    143: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, B'=B, C'=0, D'=D, E'=free, F'=0, H'=B, Q'=0, [ 0>=1+B && C==0 && G>=1+free && 1>=A && D>=0 ], cost: 7

    144: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, B'=B, C'=0, D'=D, E'=free, F'=0, H'=B, Q'=0, [ 0>=1+B && C==0 && G>=1+free && A>=3 && D>=0 ], cost: 7

    145: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, B'=B, C'=0, D'=D, E'=free, F'=0, H'=B, Q'=0, [ 0>=1+B && C==0 && G>=1+free && D>=0 ], cost: 7

    146: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, B'=B, C'=free_3, D'=D-free_3, E'=free, F'=free_3, H'=B, Q'=free_3, [ 0>=1+B && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && G>=1+free && 1>=A && D>=free_3 ], cost: 7

    147: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, B'=B, C'=free_3, D'=D-free_3, E'=free, F'=free_3, H'=B, Q'=free_3, [ 0>=1+B && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && G>=1+free && A>=3 && D>=free_3 ], cost: 7

    148: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, B'=B, C'=free_3, D'=D-free_3, E'=free, F'=free_3, H'=B, Q'=free_3, [ 0>=1+B && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && G>=1+free && D>=free_3 ], cost: 7

    149: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, B'=B, C'=0, D'=D, E'=free, F'=0, H'=B, Q'=0, [ B>=1 && C==0 && G>=1+free && 1>=A && D>=0 ], cost: 7

    150: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, B'=B, C'=0, D'=D, E'=free, F'=0, H'=B, Q'=0, [ B>=1 && C==0 && G>=1+free && A>=3 && D>=0 ], cost: 7

    151: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, B'=B, C'=0, D'=D, E'=free, F'=0, H'=B, Q'=0, [ B>=1 && C==0 && G>=1+free && D>=0 ], cost: 7

    152: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, B'=B, C'=free_3, D'=D-free_3, E'=free, F'=free_3, H'=B, Q'=free_3, [ B>=1 && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && G>=1+free && 1>=A && D>=free_3 ], cost: 7

    153: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, B'=B, C'=free_3, D'=D-free_3, E'=free, F'=free_3, H'=B, Q'=free_3, [ B>=1 && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && G>=1+free && A>=3 && D>=free_3 ], cost: 7

    154: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, B'=B, C'=free_3, D'=D-free_3, E'=free, F'=free_3, H'=B, Q'=free_3, [ B>=1 && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && G>=1+free && D>=free_3 ], cost: 7

    155: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, B'=B, C'=free_2, D'=-free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && 0>=1+B && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && G>=1+free_1 && 1>=A && D>=free_2 ], cost: 7

    156: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, B'=B, C'=free_2, D'=-free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && 0>=1+B && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && G>=1+free_1 && A>=3 && D>=free_2 ], cost: 7

    157: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, B'=B, C'=free_2, D'=-free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && 0>=1+B && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && G>=1+free_1 && D>=free_2 ], cost: 7

    158: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, B'=B, C'=free_2, D'=-free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && B>=1 && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && G>=1+free_1 && 1>=A && D>=free_2 ], cost: 7

    159: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, B'=B, C'=free_2, D'=-free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && B>=1 && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && G>=1+free_1 && A>=3 && D>=free_2 ], cost: 7

    160: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, B'=B, C'=free_2, D'=-free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && B>=1 && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && G>=1+free_1 && D>=free_2 ], cost: 7

    161: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, B'=1, C'=0, D'=D, E'=free, F'=C, H'=1, Q'=0, [ B==0 && G>=1+free && A==2 && C==0 && D>=0 ], cost: 7

    162: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, B'=1, C'=free_7, D'=D-free_7, E'=free, F'=C, H'=1, Q'=free_7, [ B==0 && G>=1+free && A==2 && 0>=1+C && 0>=free_7 && 2*free_7>=C && 1+C>=2*free_7 && D>=free_7 ], cost: 7

    163: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, B'=1, C'=free_6, D'=D-free_6, E'=free_1, F'=C, H'=1, Q'=free_6, [ C>=2 && B==0 && G>=1+free_1 && A==2 && free_6>=0 && C>=2*free_6 && 1+2*free_6>=C && D>=free_6 ], cost: 7



Accelerating simple loops of location 2.

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

   Accelerating the following rules:

    111: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, D'=C+D, E'=free, F'=C, H'=B, Q'=C, [ 0>=C && B==0 && free>=1+G && 0>=A && 255>=C+D ], cost: 5

    112: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, D'=C+D, E'=free, F'=C, H'=B, Q'=C, [ 0>=C && B==0 && free>=1+G && A>=2 && 255>=C+D ], cost: 5

    113: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, D'=C+D, E'=free_1, F'=C, H'=B, Q'=C, [ C>=2 && B==0 && free_1>=1+G && 0>=A && 255>=C+D ], cost: 5

    114: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, D'=C+D, E'=free_1, F'=C, H'=B, Q'=C, [ C>=2 && B==0 && free_1>=1+G && A>=2 && 255>=C+D ], cost: 5

    115: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, C'=0, E'=free, F'=0, H'=B, Q'=0, [ 0>=1+B && C==0 && free>=1+G && 0>=A && 255>=D ], cost: 6

    116: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, C'=0, E'=free, F'=0, H'=B, Q'=0, [ 0>=1+B && C==0 && free>=1+G && A>=2 && 255>=D ], cost: 6

    117: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, C'=0, E'=free, F'=0, H'=B, Q'=0, [ 0>=1+B && C==0 && free>=1+G && 255>=D ], cost: 6

    118: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, C'=free_3, D'=D+free_3, E'=free, F'=free_3, H'=B, Q'=free_3, [ 0>=1+B && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && free>=1+G && 0>=A && 255>=D+free_3 ], cost: 6

    119: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, C'=free_3, D'=D+free_3, E'=free, F'=free_3, H'=B, Q'=free_3, [ 0>=1+B && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && free>=1+G && A>=2 && 255>=D+free_3 ], cost: 6

    120: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, C'=free_3, D'=D+free_3, E'=free, F'=free_3, H'=B, Q'=free_3, [ 0>=1+B && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && free>=1+G && 255>=D+free_3 ], cost: 6

    121: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, C'=0, E'=free, F'=0, H'=B, Q'=0, [ B>=1 && C==0 && free>=1+G && 0>=A && 255>=D ], cost: 6

    122: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, C'=0, E'=free, F'=0, H'=B, Q'=0, [ B>=1 && C==0 && free>=1+G && A>=2 && 255>=D ], cost: 6

    123: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, C'=0, E'=free, F'=0, H'=B, Q'=0, [ B>=1 && C==0 && free>=1+G && 255>=D ], cost: 6

    124: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, C'=free_3, D'=D+free_3, E'=free, F'=free_3, H'=B, Q'=free_3, [ B>=1 && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && free>=1+G && 0>=A && 255>=D+free_3 ], cost: 6

    125: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, C'=free_3, D'=D+free_3, E'=free, F'=free_3, H'=B, Q'=free_3, [ B>=1 && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && free>=1+G && A>=2 && 255>=D+free_3 ], cost: 6

    126: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, C'=free_3, D'=D+free_3, E'=free, F'=free_3, H'=B, Q'=free_3, [ B>=1 && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && free>=1+G && 255>=D+free_3 ], cost: 6

    127: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, C'=free_2, D'=free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && 0>=1+B && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && free_1>=1+G && 0>=A && 255>=free_2+D ], cost: 6

    128: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, C'=free_2, D'=free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && 0>=1+B && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && free_1>=1+G && A>=2 && 255>=free_2+D ], cost: 6

    129: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, C'=free_2, D'=free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && 0>=1+B && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && free_1>=1+G && 255>=free_2+D ], cost: 6

    130: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, C'=free_2, D'=free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && B>=1 && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && free_1>=1+G && 0>=A && 255>=free_2+D ], cost: 6

    131: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, C'=free_2, D'=free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && B>=1 && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && free_1>=1+G && A>=2 && 255>=free_2+D ], cost: 6

    132: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, C'=free_2, D'=free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && B>=1 && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && free_1>=1+G && 255>=free_2+D ], cost: 6

    133: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, B'=1, C'=0, E'=free, F'=C, H'=1, Q'=0, [ B==0 && free>=1+G && A==1 && C==0 && 255>=D ], cost: 6

    134: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, B'=1, C'=free_5, D'=free_5+D, E'=free, F'=C, H'=1, Q'=free_5, [ B==0 && free>=1+G && A==1 && 0>=1+C && 0>=free_5 && 2*free_5>=C && 1+C>=2*free_5 && 255>=free_5+D ], cost: 6

    135: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, B'=1, C'=free_4, D'=D+free_4, E'=free_1, F'=C, H'=1, Q'=free_4, [ C>=2 && B==0 && free_1>=1+G && A==1 && free_4>=0 && C>=2*free_4 && 1+2*free_4>=C && 255>=D+free_4 ], cost: 6

    139: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, D'=-C+D, E'=free, F'=C, H'=B, Q'=C, [ 0>=C && B==0 && G>=1+free && 1>=A && D>=C ], cost: 6

    140: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, D'=-C+D, E'=free, F'=C, H'=B, Q'=C, [ 0>=C && B==0 && G>=1+free && A>=3 && D>=C ], cost: 6

    141: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, D'=-C+D, E'=free_1, F'=C, H'=B, Q'=C, [ C>=2 && B==0 && G>=1+free_1 && 1>=A && D>=C ], cost: 6

    142: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, D'=-C+D, E'=free_1, F'=C, H'=B, Q'=C, [ C>=2 && B==0 && G>=1+free_1 && A>=3 && D>=C ], cost: 6

    143: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, C'=0, E'=free, F'=0, H'=B, Q'=0, [ 0>=1+B && C==0 && G>=1+free && 1>=A && D>=0 ], cost: 7

    144: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, C'=0, E'=free, F'=0, H'=B, Q'=0, [ 0>=1+B && C==0 && G>=1+free && A>=3 && D>=0 ], cost: 7

    145: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, C'=0, E'=free, F'=0, H'=B, Q'=0, [ 0>=1+B && C==0 && G>=1+free && D>=0 ], cost: 7

    146: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, C'=free_3, D'=D-free_3, E'=free, F'=free_3, H'=B, Q'=free_3, [ 0>=1+B && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && G>=1+free && 1>=A && D>=free_3 ], cost: 7

    147: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, C'=free_3, D'=D-free_3, E'=free, F'=free_3, H'=B, Q'=free_3, [ 0>=1+B && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && G>=1+free && A>=3 && D>=free_3 ], cost: 7

    148: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, C'=free_3, D'=D-free_3, E'=free, F'=free_3, H'=B, Q'=free_3, [ 0>=1+B && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && G>=1+free && D>=free_3 ], cost: 7

    149: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, C'=0, E'=free, F'=0, H'=B, Q'=0, [ B>=1 && C==0 && G>=1+free && 1>=A && D>=0 ], cost: 7

    150: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, C'=0, E'=free, F'=0, H'=B, Q'=0, [ B>=1 && C==0 && G>=1+free && A>=3 && D>=0 ], cost: 7

    151: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, C'=0, E'=free, F'=0, H'=B, Q'=0, [ B>=1 && C==0 && G>=1+free && D>=0 ], cost: 7

    152: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, C'=free_3, D'=D-free_3, E'=free, F'=free_3, H'=B, Q'=free_3, [ B>=1 && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && G>=1+free && 1>=A && D>=free_3 ], cost: 7

    153: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, C'=free_3, D'=D-free_3, E'=free, F'=free_3, H'=B, Q'=free_3, [ B>=1 && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && G>=1+free && A>=3 && D>=free_3 ], cost: 7

    154: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, C'=free_3, D'=D-free_3, E'=free, F'=free_3, H'=B, Q'=free_3, [ B>=1 && 0>=1+C && 0>=free_3 && 2*free_3>=C && 1+C>=2*free_3 && G>=1+free && D>=free_3 ], cost: 7

    155: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, C'=free_2, D'=-free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && 0>=1+B && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && G>=1+free_1 && 1>=A && D>=free_2 ], cost: 7

    156: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, C'=free_2, D'=-free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && 0>=1+B && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && G>=1+free_1 && A>=3 && D>=free_2 ], cost: 7

    157: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, C'=free_2, D'=-free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && 0>=1+B && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && G>=1+free_1 && D>=free_2 ], cost: 7

    158: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, C'=free_2, D'=-free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && B>=1 && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && G>=1+free_1 && 1>=A && D>=free_2 ], cost: 7

    159: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, C'=free_2, D'=-free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && B>=1 && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && G>=1+free_1 && A>=3 && D>=free_2 ], cost: 7

    160: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, C'=free_2, D'=-free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && B>=1 && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && G>=1+free_1 && D>=free_2 ], cost: 7

    161: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, B'=1, C'=0, E'=free, F'=C, H'=1, Q'=0, [ B==0 && G>=1+free && A==2 && C==0 && D>=0 ], cost: 7

    162: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, B'=1, C'=free_7, D'=D-free_7, E'=free, F'=C, H'=1, Q'=free_7, [ B==0 && G>=1+free && A==2 && 0>=1+C && 0>=free_7 && 2*free_7>=C && 1+C>=2*free_7 && D>=free_7 ], cost: 7

    163: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, B'=1, C'=free_6, D'=D-free_6, E'=free_1, F'=C, H'=1, Q'=free_6, [ C>=2 && B==0 && G>=1+free_1 && A==2 && free_6>=0 && C>=2*free_6 && 1+2*free_6>=C && D>=free_6 ], cost: 7



   Found no metering function for rule 111.

   Accelerated rule 112 with NONTERM, yielding the new rule 164.

   Found no metering function for rule 113.

   Found no metering function for rule 114.

   Found no metering function for rule 115.

   Accelerated rule 116 with NONTERM, yielding the new rule 165.

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

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

   Accelerated rule 118 with metering function -1-C, yielding the new rule 167.

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

   Accelerated rule 119 with metering function -C, yielding the new rule 168.

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

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

   Found no metering function for rule 121.

   Accelerated rule 122 with NONTERM, yielding the new rule 170.

   Accelerated rule 123 with NONTERM, yielding the new rule 171.

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

   Accelerated rule 124 with metering function -1-C, yielding the new rule 172.

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

   Accelerated rule 125 with metering function -C, yielding the new rule 173.

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

   Accelerated rule 126 with metering function -C, yielding the new rule 174.

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

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

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

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

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

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

   Accelerated rule 133 with metering function meter (where 2*meter==2-A-B), yielding the new rule 181.

   Accelerated rule 134 with metering function meter_1 (where 2*meter_1==1-A-B), yielding the new rule 182.

   Accelerated rule 135 with metering function meter_2 (where 2*meter_2==1-A-B), yielding the new rule 183.

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

   Found no metering function for rule 140.

   Found no metering function for rule 141.

   Found no metering function for rule 142.

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

   Found no metering function for rule 144.

   Accelerated rule 145 with NONTERM, yielding the new rule 186.

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

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

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

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

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

   Accelerated rule 148 with metering function -C, yielding the new rule 189.

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

   Found no metering function for rule 150.

   Accelerated rule 151 with NONTERM, yielding the new rule 191.

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

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

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

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

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

   Accelerated rule 154 with metering function -C, yielding the new rule 194.

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

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

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

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

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

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

   Accelerated rule 161 with metering function meter_3 (where 2*meter_3==-1+A-B), yielding the new rule 201.

   Accelerated rule 162 with metering function meter_4 (where 2*meter_4==-2+A-B), yielding the new rule 202.

   Accelerated rule 163 with metering function meter_5 (where 2*meter_5==-2+A-B), yielding the new rule 203.

   Removing the simple loops: 112 116 117 118 119 120 122 123 124 125 126 133 134 135 139 143 145 146 147 148 149 151 152 153 154 161 162 163.



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

   Start location: evalbinsearchStepSize2start

     36: evalbinsearchStepSize2start -> evalbinsearchStepSize2bbin : A'=0, B'=0, C'=4, D'=A, [], cost: 2

    111: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, D'=C+D, E'=free, F'=C, H'=B, Q'=C, [ 0>=C && B==0 && free>=1+G && 0>=A && 255>=C+D ], cost: 5

    113: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, D'=C+D, E'=free_1, F'=C, H'=B, Q'=C, [ C>=2 && B==0 && free_1>=1+G && 0>=A && 255>=C+D ], cost: 5

    114: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, D'=C+D, E'=free_1, F'=C, H'=B, Q'=C, [ C>=2 && B==0 && free_1>=1+G && A>=2 && 255>=C+D ], cost: 5

    115: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, C'=0, E'=free, F'=0, H'=B, Q'=0, [ 0>=1+B && C==0 && free>=1+G && 0>=A && 255>=D ], cost: 6

    121: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, C'=0, E'=free, F'=0, H'=B, Q'=0, [ B>=1 && C==0 && free>=1+G && 0>=A && 255>=D ], cost: 6

    127: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, C'=free_2, D'=free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && 0>=1+B && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && free_1>=1+G && 0>=A && 255>=free_2+D ], cost: 6

    128: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, C'=free_2, D'=free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && 0>=1+B && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && free_1>=1+G && A>=2 && 255>=free_2+D ], cost: 6

    129: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, C'=free_2, D'=free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && 0>=1+B && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && free_1>=1+G && 255>=free_2+D ], cost: 6

    130: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, C'=free_2, D'=free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && B>=1 && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && free_1>=1+G && 0>=A && 255>=free_2+D ], cost: 6

    131: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, C'=free_2, D'=free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && B>=1 && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && free_1>=1+G && A>=2 && 255>=free_2+D ], cost: 6

    132: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, C'=free_2, D'=free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && B>=1 && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && free_1>=1+G && 255>=free_2+D ], cost: 6

    140: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, D'=-C+D, E'=free, F'=C, H'=B, Q'=C, [ 0>=C && B==0 && G>=1+free && A>=3 && D>=C ], cost: 6

    141: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, D'=-C+D, E'=free_1, F'=C, H'=B, Q'=C, [ C>=2 && B==0 && G>=1+free_1 && 1>=A && D>=C ], cost: 6

    142: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, D'=-C+D, E'=free_1, F'=C, H'=B, Q'=C, [ C>=2 && B==0 && G>=1+free_1 && A>=3 && D>=C ], cost: 6

    144: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, C'=0, E'=free, F'=0, H'=B, Q'=0, [ 0>=1+B && C==0 && G>=1+free && A>=3 && D>=0 ], cost: 7

    150: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, C'=0, E'=free, F'=0, H'=B, Q'=0, [ B>=1 && C==0 && G>=1+free && A>=3 && D>=0 ], cost: 7

    155: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, C'=free_2, D'=-free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && 0>=1+B && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && G>=1+free_1 && 1>=A && D>=free_2 ], cost: 7

    156: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, C'=free_2, D'=-free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && 0>=1+B && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && G>=1+free_1 && A>=3 && D>=free_2 ], cost: 7

    157: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, C'=free_2, D'=-free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && 0>=1+B && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && G>=1+free_1 && D>=free_2 ], cost: 7

    158: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, C'=free_2, D'=-free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && B>=1 && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && G>=1+free_1 && 1>=A && D>=free_2 ], cost: 7

    159: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, C'=free_2, D'=-free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && B>=1 && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && G>=1+free_1 && A>=3 && D>=free_2 ], cost: 7

    160: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, C'=free_2, D'=-free_2+D, E'=free_1, F'=free_2, H'=B, Q'=free_2, [ C>=2 && B>=1 && free_2>=0 && C>=2*free_2 && 1+2*free_2>=C && G>=1+free_1 && D>=free_2 ], cost: 7

    164: evalbinsearchStepSize2bbin -> [15] : [ 0>=C && B==0 && free>=1+G && A>=2 && 255>=C+D ], cost: NONTERM

    165: evalbinsearchStepSize2bbin -> [15] : [ 0>=1+B && C==0 && free>=1+G && A>=2 && 255>=D ], cost: NONTERM

    166: evalbinsearchStepSize2bbin -> [15] : [ 0>=1+B && C==0 && free>=1+G && 255>=D ], cost: NONTERM

    167: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, C'=0, D'=D, E'=free, F'=0, H'=B, Q'=0, [ 0>=1+B && 1+C>=0 && free>=1+G && 0>=A && 255>=D && -1-C>=1 ], cost: -6-6*C

    168: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, C'=0, D'=D, E'=free, F'=0, H'=B, Q'=0, [ 0>=1+B && 0>=1+C && 1+C>=0 && free>=1+G && A>=2 && 255>=D ], cost: -6*C

    169: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, C'=0, D'=D, E'=free, F'=0, H'=B, Q'=0, [ 0>=1+B && 0>=1+C && 1+C>=0 && free>=1+G && 255>=D ], cost: -6*C

    170: evalbinsearchStepSize2bbin -> [15] : [ B>=1 && C==0 && free>=1+G && A>=2 && 255>=D ], cost: NONTERM

    171: evalbinsearchStepSize2bbin -> [15] : [ B>=1 && C==0 && free>=1+G && 255>=D ], cost: NONTERM

    172: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, C'=0, D'=D, E'=free, F'=0, H'=B, Q'=0, [ B>=1 && 1+C>=0 && free>=1+G && 0>=A && 255>=D && -1-C>=1 ], cost: -6-6*C

    173: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, C'=0, D'=D, E'=free, F'=0, H'=B, Q'=0, [ B>=1 && 0>=1+C && 1+C>=0 && free>=1+G && A>=2 && 255>=D ], cost: -6*C

    174: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, C'=0, D'=D, E'=free, F'=0, H'=B, Q'=0, [ B>=1 && 0>=1+C && 1+C>=0 && free>=1+G && 255>=D ], cost: -6*C

    175: evalbinsearchStepSize2bbin -> [15] : [ C>=2 && 0>=1+B && C>=2*free_2 && 1+2*free_2>=C && free_1>=1+G && 0>=A && 255>=free_2+D && free_2>=2 && free_2>=2*free_2 ], cost: NONTERM

    176: evalbinsearchStepSize2bbin -> [15] : [ C>=2 && 0>=1+B && C>=2*free_2 && 1+2*free_2>=C && free_1>=1+G && A>=2 && 255>=free_2+D && free_2>=2 && free_2>=2*free_2 ], cost: NONTERM

    177: evalbinsearchStepSize2bbin -> [15] : [ C>=2 && 0>=1+B && C>=2*free_2 && 1+2*free_2>=C && free_1>=1+G && 255>=free_2+D && free_2>=2 && free_2>=2*free_2 ], cost: NONTERM

    178: evalbinsearchStepSize2bbin -> [15] : [ C>=2 && B>=1 && C>=2*free_2 && 1+2*free_2>=C && free_1>=1+G && 0>=A && 255>=free_2+D && free_2>=2 && free_2>=2*free_2 ], cost: NONTERM

    179: evalbinsearchStepSize2bbin -> [15] : [ C>=2 && B>=1 && C>=2*free_2 && 1+2*free_2>=C && free_1>=1+G && A>=2 && 255>=free_2+D && free_2>=2 && free_2>=2*free_2 ], cost: NONTERM

    180: evalbinsearchStepSize2bbin -> [15] : [ C>=2 && B>=1 && C>=2*free_2 && 1+2*free_2>=C && free_1>=1+G && 255>=free_2+D && free_2>=2 && free_2>=2*free_2 ], cost: NONTERM

    181: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, B'=1, C'=0, E'=free, F'=0, H'=1, Q'=0, [ B==0 && free>=1+G && A==1 && C==0 && 255>=D && 2*meter==2-A-B && meter>=1 ], cost: 6*meter

    182: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, B'=1, C'=free_5, D'=free_5*meter_1+D, E'=free, F'=free_5, H'=1, Q'=free_5, [ B==0 && free>=1+G && A==1 && 0>=1+C && 0>=free_5 && 2*free_5>=C && 1+C>=2*free_5 && 255>=free_5+D && 2*meter_1==1-A-B && meter_1>=1 ], cost: 6*meter_1

    183: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=2, B'=1, C'=free_4, D'=meter_2*free_4+D, E'=free_1, F'=free_4, H'=1, Q'=free_4, [ C>=2 && B==0 && free_1>=1+G && A==1 && free_4>=0 && C>=2*free_4 && 1+2*free_4>=C && 255>=D+free_4 && 2*meter_2==1-A-B && meter_2>=1 ], cost: 6*meter_2

    184: evalbinsearchStepSize2bbin -> [15] : [ 0>=C && B==0 && G>=1+free && 1>=A && D>=C ], cost: NONTERM

    185: evalbinsearchStepSize2bbin -> [15] : [ 0>=1+B && C==0 && G>=1+free && 1>=A && D>=0 ], cost: NONTERM

    186: evalbinsearchStepSize2bbin -> [15] : [ 0>=1+B && C==0 && G>=1+free && D>=0 ], cost: NONTERM

    187: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, C'=0, D'=D, E'=free, F'=0, H'=B, Q'=0, [ 0>=1+B && 0>=1+C && 1+C>=0 && G>=1+free && 1>=A && D>=0 ], cost: -7*C

    188: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, C'=0, D'=D, E'=free, F'=0, H'=B, Q'=0, [ 0>=1+B && 1+C>=0 && G>=1+free && A>=3 && D>=0 && -1-C>=1 ], cost: -7-7*C

    189: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, C'=0, D'=D, E'=free, F'=0, H'=B, Q'=0, [ 0>=1+B && 0>=1+C && 1+C>=0 && G>=1+free && D>=0 ], cost: -7*C

    190: evalbinsearchStepSize2bbin -> [15] : [ B>=1 && C==0 && G>=1+free && 1>=A && D>=0 ], cost: NONTERM

    191: evalbinsearchStepSize2bbin -> [15] : [ B>=1 && C==0 && G>=1+free && D>=0 ], cost: NONTERM

    192: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, C'=0, D'=D, E'=free, F'=0, H'=B, Q'=0, [ B>=1 && 0>=1+C && 1+C>=0 && G>=1+free && 1>=A && D>=0 ], cost: -7*C

    193: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, C'=0, D'=D, E'=free, F'=0, H'=B, Q'=0, [ B>=1 && 1+C>=0 && G>=1+free && A>=3 && D>=0 && -1-C>=1 ], cost: -7-7*C

    194: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, C'=0, D'=D, E'=free, F'=0, H'=B, Q'=0, [ B>=1 && 0>=1+C && 1+C>=0 && G>=1+free && D>=0 ], cost: -7*C

    195: evalbinsearchStepSize2bbin -> [15] : [ C>=2 && 0>=1+B && C>=2*free_2 && 1+2*free_2>=C && G>=1+free_1 && 1>=A && D>=free_2 && free_2>=2 && free_2>=2*free_2 ], cost: NONTERM

    196: evalbinsearchStepSize2bbin -> [15] : [ C>=2 && 0>=1+B && C>=2*free_2 && 1+2*free_2>=C && G>=1+free_1 && A>=3 && D>=free_2 && free_2>=2 && free_2>=2*free_2 ], cost: NONTERM

    197: evalbinsearchStepSize2bbin -> [15] : [ C>=2 && 0>=1+B && C>=2*free_2 && 1+2*free_2>=C && G>=1+free_1 && D>=free_2 && free_2>=2 && free_2>=2*free_2 ], cost: NONTERM

    198: evalbinsearchStepSize2bbin -> [15] : [ C>=2 && B>=1 && C>=2*free_2 && 1+2*free_2>=C && G>=1+free_1 && 1>=A && D>=free_2 && free_2>=2 && free_2>=2*free_2 ], cost: NONTERM

    199: evalbinsearchStepSize2bbin -> [15] : [ C>=2 && B>=1 && C>=2*free_2 && 1+2*free_2>=C && G>=1+free_1 && A>=3 && D>=free_2 && free_2>=2 && free_2>=2*free_2 ], cost: NONTERM

    200: evalbinsearchStepSize2bbin -> [15] : [ C>=2 && B>=1 && C>=2*free_2 && 1+2*free_2>=C && G>=1+free_1 && D>=free_2 && free_2>=2 && free_2>=2*free_2 ], cost: NONTERM

    201: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, B'=1, C'=0, E'=free, F'=0, H'=1, Q'=0, [ B==0 && G>=1+free && A==2 && C==0 && D>=0 && 2*meter_3==-1+A-B && meter_3>=1 ], cost: 7*meter_3

    202: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, B'=1, C'=free_7, D'=D-free_7*meter_4, E'=free, F'=free_7, H'=1, Q'=free_7, [ B==0 && G>=1+free && A==2 && 0>=1+C && 0>=free_7 && 2*free_7>=C && 1+C>=2*free_7 && D>=free_7 && 2*meter_4==-2+A-B && meter_4>=1 ], cost: 7*meter_4

    203: evalbinsearchStepSize2bbin -> evalbinsearchStepSize2bbin : A'=1, B'=1, C'=free_6, D'=-free_6*meter_5+D, E'=free_1, F'=free_6, H'=1, Q'=free_6, [ C>=2 && B==0 && G>=1+free_1 && A==2 && free_6>=0 && C>=2*free_6 && 1+2*free_6>=C && D>=free_6 && 2*meter_5==-2+A-B && meter_5>=1 ], cost: 7*meter_5



Chained accelerated rules (with incoming rules):

   Start location: evalbinsearchStepSize2start

     36: evalbinsearchStepSize2start -> evalbinsearchStepSize2bbin : A'=0, B'=0, C'=4, D'=A, [], cost: 2

    204: evalbinsearchStepSize2start -> evalbinsearchStepSize2bbin : A'=2, B'=0, C'=4, D'=4+A, E'=free_1, F'=4, H'=0, Q'=4, [ free_1>=1+G && 255>=4+A ], cost: 7

    205: evalbinsearchStepSize2start -> evalbinsearchStepSize2bbin : A'=1, B'=0, C'=4, D'=-4+A, E'=free_1, F'=4, H'=0, Q'=4, [ G>=1+free_1 && A>=4 ], cost: 8



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)