NO

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

Initial linear ITS problem
   Start location: l6
      0: l0 -> l1 : fvalue3^0'=fvalue3^post_1, low6^0'=low6^post_1, mid4^0'=mid4^post_1, ret_binary_search7^0'=ret_binary_search7^post_1, tmp^0'=tmp^post_1, up5^0'=up5^post_1, x2^0'=x2^post_1, [ fvalue3^0==fvalue3^post_1 && low6^0==low6^post_1 && mid4^0==mid4^post_1 && ret_binary_search7^0==ret_binary_search7^post_1 && tmp^0==tmp^post_1 && up5^0==up5^post_1 && x2^0==x2^post_1 ], cost: 1
      1: l0 -> l2 : fvalue3^0'=fvalue3^post_2, low6^0'=low6^post_2, mid4^0'=mid4^post_2, ret_binary_search7^0'=ret_binary_search7^post_2, tmp^0'=tmp^post_2, up5^0'=up5^post_2, x2^0'=x2^post_2, [ up5^post_2==-1+low6^0 && fvalue3^post_2==fvalue3^post_2 && low6^0==low6^post_2 && mid4^0==mid4^post_2 && ret_binary_search7^0==ret_binary_search7^post_2 && tmp^0==tmp^post_2 && x2^0==x2^post_2 ], cost: 1
      2: l0 -> l1 : fvalue3^0'=fvalue3^post_3, low6^0'=low6^post_3, mid4^0'=mid4^post_3, ret_binary_search7^0'=ret_binary_search7^post_3, tmp^0'=tmp^post_3, up5^0'=up5^post_3, x2^0'=x2^post_3, [ fvalue3^0==fvalue3^post_3 && low6^0==low6^post_3 && mid4^0==mid4^post_3 && ret_binary_search7^0==ret_binary_search7^post_3 && tmp^0==tmp^post_3 && up5^0==up5^post_3 && x2^0==x2^post_3 ], cost: 1
      6: l1 -> l2 : fvalue3^0'=fvalue3^post_7, low6^0'=low6^post_7, mid4^0'=mid4^post_7, ret_binary_search7^0'=ret_binary_search7^post_7, tmp^0'=tmp^post_7, up5^0'=up5^post_7, x2^0'=x2^post_7, [ low6^post_7==1+mid4^0 && fvalue3^0==fvalue3^post_7 && mid4^0==mid4^post_7 && ret_binary_search7^0==ret_binary_search7^post_7 && tmp^0==tmp^post_7 && up5^0==up5^post_7 && x2^0==x2^post_7 ], cost: 1
      7: l1 -> l2 : fvalue3^0'=fvalue3^post_8, low6^0'=low6^post_8, mid4^0'=mid4^post_8, ret_binary_search7^0'=ret_binary_search7^post_8, tmp^0'=tmp^post_8, up5^0'=up5^post_8, x2^0'=x2^post_8, [ up5^post_8==-1+mid4^0 && fvalue3^0==fvalue3^post_8 && low6^0==low6^post_8 && mid4^0==mid4^post_8 && ret_binary_search7^0==ret_binary_search7^post_8 && tmp^0==tmp^post_8 && x2^0==x2^post_8 ], cost: 1
      5: l2 -> l3 : fvalue3^0'=fvalue3^post_6, low6^0'=low6^post_6, mid4^0'=mid4^post_6, ret_binary_search7^0'=ret_binary_search7^post_6, tmp^0'=tmp^post_6, up5^0'=up5^post_6, x2^0'=x2^post_6, [ fvalue3^0==fvalue3^post_6 && low6^0==low6^post_6 && mid4^0==mid4^post_6 && ret_binary_search7^0==ret_binary_search7^post_6 && tmp^0==tmp^post_6 && up5^0==up5^post_6 && x2^0==x2^post_6 ], cost: 1
      3: l3 -> l4 : fvalue3^0'=fvalue3^post_4, low6^0'=low6^post_4, mid4^0'=mid4^post_4, ret_binary_search7^0'=ret_binary_search7^post_4, tmp^0'=tmp^post_4, up5^0'=up5^post_4, x2^0'=x2^post_4, [ 1+up5^0<=low6^0 && ret_binary_search7^post_4==fvalue3^0 && tmp^post_4==ret_binary_search7^post_4 && fvalue3^0==fvalue3^post_4 && low6^0==low6^post_4 && mid4^0==mid4^post_4 && up5^0==up5^post_4 && x2^0==x2^post_4 ], cost: 1
      4: l3 -> l0 : fvalue3^0'=fvalue3^post_5, low6^0'=low6^post_5, mid4^0'=mid4^post_5, ret_binary_search7^0'=ret_binary_search7^post_5, tmp^0'=tmp^post_5, up5^0'=up5^post_5, x2^0'=x2^post_5, [ low6^0<=up5^0 && mid4^post_5==mid4^post_5 && fvalue3^0==fvalue3^post_5 && low6^0==low6^post_5 && ret_binary_search7^0==ret_binary_search7^post_5 && tmp^0==tmp^post_5 && up5^0==up5^post_5 && x2^0==x2^post_5 ], cost: 1
      8: l5 -> l2 : fvalue3^0'=fvalue3^post_9, low6^0'=low6^post_9, mid4^0'=mid4^post_9, ret_binary_search7^0'=ret_binary_search7^post_9, tmp^0'=tmp^post_9, up5^0'=up5^post_9, x2^0'=x2^post_9, [ x2^post_9==8 && low6^post_9==0 && up5^post_9==14 && fvalue3^post_9==-1 && mid4^0==mid4^post_9 && ret_binary_search7^0==ret_binary_search7^post_9 && tmp^0==tmp^post_9 ], cost: 1
      9: l6 -> l5 : fvalue3^0'=fvalue3^post_10, low6^0'=low6^post_10, mid4^0'=mid4^post_10, ret_binary_search7^0'=ret_binary_search7^post_10, tmp^0'=tmp^post_10, up5^0'=up5^post_10, x2^0'=x2^post_10, [ fvalue3^0==fvalue3^post_10 && low6^0==low6^post_10 && mid4^0==mid4^post_10 && ret_binary_search7^0==ret_binary_search7^post_10 && tmp^0==tmp^post_10 && up5^0==up5^post_10 && x2^0==x2^post_10 ], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
      9: l6 -> l5 : fvalue3^0'=fvalue3^post_10, low6^0'=low6^post_10, mid4^0'=mid4^post_10, ret_binary_search7^0'=ret_binary_search7^post_10, tmp^0'=tmp^post_10, up5^0'=up5^post_10, x2^0'=x2^post_10, [ fvalue3^0==fvalue3^post_10 && low6^0==low6^post_10 && mid4^0==mid4^post_10 && ret_binary_search7^0==ret_binary_search7^post_10 && tmp^0==tmp^post_10 && up5^0==up5^post_10 && x2^0==x2^post_10 ], cost: 1

Removed unreachable and leaf rules:
   Start location: l6
      0: l0 -> l1 : fvalue3^0'=fvalue3^post_1, low6^0'=low6^post_1, mid4^0'=mid4^post_1, ret_binary_search7^0'=ret_binary_search7^post_1, tmp^0'=tmp^post_1, up5^0'=up5^post_1, x2^0'=x2^post_1, [ fvalue3^0==fvalue3^post_1 && low6^0==low6^post_1 && mid4^0==mid4^post_1 && ret_binary_search7^0==ret_binary_search7^post_1 && tmp^0==tmp^post_1 && up5^0==up5^post_1 && x2^0==x2^post_1 ], cost: 1
      1: l0 -> l2 : fvalue3^0'=fvalue3^post_2, low6^0'=low6^post_2, mid4^0'=mid4^post_2, ret_binary_search7^0'=ret_binary_search7^post_2, tmp^0'=tmp^post_2, up5^0'=up5^post_2, x2^0'=x2^post_2, [ up5^post_2==-1+low6^0 && fvalue3^post_2==fvalue3^post_2 && low6^0==low6^post_2 && mid4^0==mid4^post_2 && ret_binary_search7^0==ret_binary_search7^post_2 && tmp^0==tmp^post_2 && x2^0==x2^post_2 ], cost: 1
      2: l0 -> l1 : fvalue3^0'=fvalue3^post_3, low6^0'=low6^post_3, mid4^0'=mid4^post_3, ret_binary_search7^0'=ret_binary_search7^post_3, tmp^0'=tmp^post_3, up5^0'=up5^post_3, x2^0'=x2^post_3, [ fvalue3^0==fvalue3^post_3 && low6^0==low6^post_3 && mid4^0==mid4^post_3 && ret_binary_search7^0==ret_binary_search7^post_3 && tmp^0==tmp^post_3 && up5^0==up5^post_3 && x2^0==x2^post_3 ], cost: 1
      6: l1 -> l2 : fvalue3^0'=fvalue3^post_7, low6^0'=low6^post_7, mid4^0'=mid4^post_7, ret_binary_search7^0'=ret_binary_search7^post_7, tmp^0'=tmp^post_7, up5^0'=up5^post_7, x2^0'=x2^post_7, [ low6^post_7==1+mid4^0 && fvalue3^0==fvalue3^post_7 && mid4^0==mid4^post_7 && ret_binary_search7^0==ret_binary_search7^post_7 && tmp^0==tmp^post_7 && up5^0==up5^post_7 && x2^0==x2^post_7 ], cost: 1
      7: l1 -> l2 : fvalue3^0'=fvalue3^post_8, low6^0'=low6^post_8, mid4^0'=mid4^post_8, ret_binary_search7^0'=ret_binary_search7^post_8, tmp^0'=tmp^post_8, up5^0'=up5^post_8, x2^0'=x2^post_8, [ up5^post_8==-1+mid4^0 && fvalue3^0==fvalue3^post_8 && low6^0==low6^post_8 && mid4^0==mid4^post_8 && ret_binary_search7^0==ret_binary_search7^post_8 && tmp^0==tmp^post_8 && x2^0==x2^post_8 ], cost: 1
      5: l2 -> l3 : fvalue3^0'=fvalue3^post_6, low6^0'=low6^post_6, mid4^0'=mid4^post_6, ret_binary_search7^0'=ret_binary_search7^post_6, tmp^0'=tmp^post_6, up5^0'=up5^post_6, x2^0'=x2^post_6, [ fvalue3^0==fvalue3^post_6 && low6^0==low6^post_6 && mid4^0==mid4^post_6 && ret_binary_search7^0==ret_binary_search7^post_6 && tmp^0==tmp^post_6 && up5^0==up5^post_6 && x2^0==x2^post_6 ], cost: 1
      4: l3 -> l0 : fvalue3^0'=fvalue3^post_5, low6^0'=low6^post_5, mid4^0'=mid4^post_5, ret_binary_search7^0'=ret_binary_search7^post_5, tmp^0'=tmp^post_5, up5^0'=up5^post_5, x2^0'=x2^post_5, [ low6^0<=up5^0 && mid4^post_5==mid4^post_5 && fvalue3^0==fvalue3^post_5 && low6^0==low6^post_5 && ret_binary_search7^0==ret_binary_search7^post_5 && tmp^0==tmp^post_5 && up5^0==up5^post_5 && x2^0==x2^post_5 ], cost: 1
      8: l5 -> l2 : fvalue3^0'=fvalue3^post_9, low6^0'=low6^post_9, mid4^0'=mid4^post_9, ret_binary_search7^0'=ret_binary_search7^post_9, tmp^0'=tmp^post_9, up5^0'=up5^post_9, x2^0'=x2^post_9, [ x2^post_9==8 && low6^post_9==0 && up5^post_9==14 && fvalue3^post_9==-1 && mid4^0==mid4^post_9 && ret_binary_search7^0==ret_binary_search7^post_9 && tmp^0==tmp^post_9 ], cost: 1
      9: l6 -> l5 : fvalue3^0'=fvalue3^post_10, low6^0'=low6^post_10, mid4^0'=mid4^post_10, ret_binary_search7^0'=ret_binary_search7^post_10, tmp^0'=tmp^post_10, up5^0'=up5^post_10, x2^0'=x2^post_10, [ fvalue3^0==fvalue3^post_10 && low6^0==low6^post_10 && mid4^0==mid4^post_10 && ret_binary_search7^0==ret_binary_search7^post_10 && tmp^0==tmp^post_10 && up5^0==up5^post_10 && x2^0==x2^post_10 ], cost: 1

Simplified all rules, resulting in:
   Start location: l6
      1: l0 -> l2 : fvalue3^0'=fvalue3^post_2, up5^0'=-1+low6^0, [], cost: 1
      2: l0 -> l1 : [], cost: 1
      6: l1 -> l2 : low6^0'=1+mid4^0, [], cost: 1
      7: l1 -> l2 : up5^0'=-1+mid4^0, [], cost: 1
      5: l2 -> l3 : [], cost: 1
      4: l3 -> l0 : mid4^0'=mid4^post_5, [ low6^0<=up5^0 ], cost: 1
      8: l5 -> l2 : fvalue3^0'=-1, low6^0'=0, up5^0'=14, x2^0'=8, [], cost: 1
      9: l6 -> l5 : [], cost: 1

### Simplification by acceleration and chaining ###

Eliminated locations (on linear paths):
   Start location: l6
      1: l0 -> l2 : fvalue3^0'=fvalue3^post_2, up5^0'=-1+low6^0, [], cost: 1
      2: l0 -> l1 : [], cost: 1
      6: l1 -> l2 : low6^0'=1+mid4^0, [], cost: 1
      7: l1 -> l2 : up5^0'=-1+mid4^0, [], cost: 1
     11: l2 -> l0 : mid4^0'=mid4^post_5, [ low6^0<=up5^0 ], cost: 2
     10: l6 -> l2 : fvalue3^0'=-1, low6^0'=0, up5^0'=14, x2^0'=8, [], cost: 2

Eliminated locations (on tree-shaped paths):
   Start location: l6
      6: l1 -> l2 : low6^0'=1+mid4^0, [], cost: 1
      7: l1 -> l2 : up5^0'=-1+mid4^0, [], cost: 1
     12: l2 -> l2 : fvalue3^0'=fvalue3^post_2, mid4^0'=mid4^post_5, up5^0'=-1+low6^0, [ low6^0<=up5^0 ], cost: 3
     13: l2 -> l1 : mid4^0'=mid4^post_5, [ low6^0<=up5^0 ], cost: 3
     10: l6 -> l2 : fvalue3^0'=-1, low6^0'=0, up5^0'=14, x2^0'=8, [], cost: 2

Accelerating simple loops of location 2.
   Accelerating the following rules:
     12: l2 -> l2 : fvalue3^0'=fvalue3^post_2, mid4^0'=mid4^post_5, up5^0'=-1+low6^0, [ low6^0<=up5^0 ], cost: 3

   Failed to prove monotonicity of the guard of rule 12.
[accelerate] Nesting with 1 inner and 1 outer candidates

Accelerated all simple loops using metering functions (where possible):
   Start location: l6
      6: l1 -> l2 : low6^0'=1+mid4^0, [], cost: 1
      7: l1 -> l2 : up5^0'=-1+mid4^0, [], cost: 1
     12: l2 -> l2 : fvalue3^0'=fvalue3^post_2, mid4^0'=mid4^post_5, up5^0'=-1+low6^0, [ low6^0<=up5^0 ], cost: 3
     13: l2 -> l1 : mid4^0'=mid4^post_5, [ low6^0<=up5^0 ], cost: 3
     10: l6 -> l2 : fvalue3^0'=-1, low6^0'=0, up5^0'=14, x2^0'=8, [], cost: 2

Chained accelerated rules (with incoming rules):
   Start location: l6
      6: l1 -> l2 : low6^0'=1+mid4^0, [], cost: 1
      7: l1 -> l2 : up5^0'=-1+mid4^0, [], cost: 1
     14: l1 -> l2 : fvalue3^0'=fvalue3^post_2, low6^0'=1+mid4^0, mid4^0'=mid4^post_5, up5^0'=mid4^0, [ 1+mid4^0<=up5^0 ], cost: 4
     15: l1 -> l2 : fvalue3^0'=fvalue3^post_2, mid4^0'=mid4^post_5, up5^0'=-1+low6^0, [ low6^0<=-1+mid4^0 ], cost: 4
     13: l2 -> l1 : mid4^0'=mid4^post_5, [ low6^0<=up5^0 ], cost: 3
     10: l6 -> l2 : fvalue3^0'=-1, low6^0'=0, up5^0'=14, x2^0'=8, [], cost: 2
     16: l6 -> l2 : fvalue3^0'=fvalue3^post_2, low6^0'=0, mid4^0'=mid4^post_5, up5^0'=-1, x2^0'=8, [], cost: 5

Eliminated locations (on tree-shaped paths):
   Start location: l6
     17: l2 -> l2 : low6^0'=1+mid4^post_5, mid4^0'=mid4^post_5, [ low6^0<=up5^0 ], cost: 4
     18: l2 -> l2 : mid4^0'=mid4^post_5, up5^0'=-1+mid4^post_5, [ low6^0<=up5^0 ], cost: 4
     19: l2 -> l2 : fvalue3^0'=fvalue3^post_2, low6^0'=1+mid4^post_5, mid4^0'=mid4^post_5, up5^0'=mid4^post_5, [ low6^0<=up5^0 && 1+mid4^post_5<=up5^0 ], cost: 7
     20: l2 -> l2 : fvalue3^0'=fvalue3^post_2, mid4^0'=mid4^post_5, up5^0'=-1+low6^0, [ low6^0<=up5^0 && low6^0<=-1+mid4^post_5 ], cost: 7
     10: l6 -> l2 : fvalue3^0'=-1, low6^0'=0, up5^0'=14, x2^0'=8, [], cost: 2
     16: l6 -> l2 : fvalue3^0'=fvalue3^post_2, low6^0'=0, mid4^0'=mid4^post_5, up5^0'=-1, x2^0'=8, [], cost: 5

Accelerating simple loops of location 2.
   Accelerating the following rules:
     17: l2 -> l2 : low6^0'=1+mid4^post_5, mid4^0'=mid4^post_5, [ low6^0<=up5^0 ], cost: 4
     18: l2 -> l2 : mid4^0'=mid4^post_5, up5^0'=-1+mid4^post_5, [ low6^0<=up5^0 ], cost: 4
     19: l2 -> l2 : fvalue3^0'=fvalue3^post_2, low6^0'=1+mid4^post_5, mid4^0'=mid4^post_5, up5^0'=mid4^post_5, [ low6^0<=up5^0 && 1+mid4^post_5<=up5^0 ], cost: 7
     20: l2 -> l2 : fvalue3^0'=fvalue3^post_2, mid4^0'=mid4^post_5, up5^0'=-1+low6^0, [ low6^0<=up5^0 && low6^0<=-1+mid4^post_5 ], cost: 7

[test] deduced pseudo-invariant 1-low6^0+mid4^post_5<=0, also trying -1+low6^0-mid4^post_5<=-1
   Accelerated rule 17 with non-termination, yielding the new rule 21.
   Accelerated rule 17 with non-termination, yielding the new rule 22.
   Accelerated rule 17 with backward acceleration, yielding the new rule 23.
[test] deduced pseudo-invariant 1-mid4^post_5+up5^0<=0, also trying -1+mid4^post_5-up5^0<=-1
   Accelerated rule 18 with non-termination, yielding the new rule 24.
   Accelerated rule 18 with non-termination, yielding the new rule 25.
   Accelerated rule 18 with backward acceleration, yielding the new rule 26.
   Failed to prove monotonicity of the guard of rule 19.
   Failed to prove monotonicity of the guard of rule 20.
[accelerate] Nesting with 2 inner and 4 outer candidates
   Also removing duplicate rules: 22 25.

Accelerated all simple loops using metering functions (where possible):
   Start location: l6
     17: l2 -> l2 : low6^0'=1+mid4^post_5, mid4^0'=mid4^post_5, [ low6^0<=up5^0 ], cost: 4
     18: l2 -> l2 : mid4^0'=mid4^post_5, up5^0'=-1+mid4^post_5, [ low6^0<=up5^0 ], cost: 4
     19: l2 -> l2 : fvalue3^0'=fvalue3^post_2, low6^0'=1+mid4^post_5, mid4^0'=mid4^post_5, up5^0'=mid4^post_5, [ low6^0<=up5^0 && 1+mid4^post_5<=up5^0 ], cost: 7
     20: l2 -> l2 : fvalue3^0'=fvalue3^post_2, mid4^0'=mid4^post_5, up5^0'=-1+low6^0, [ low6^0<=up5^0 && low6^0<=-1+mid4^post_5 ], cost: 7
     21: l2 -> [8] : [ low6^0<=up5^0 && 1+mid4^post_5<=up5^0 ], cost: NONTERM
     23: l2 -> [8] : [ low6^0<=up5^0 && 1-low6^0+mid4^post_5<=0 ], cost: NONTERM
     24: l2 -> [8] : [ low6^0<=up5^0 && low6^0<=-1+mid4^post_5 ], cost: NONTERM
     26: l2 -> [8] : [ low6^0<=up5^0 && 1-mid4^post_5+up5^0<=0 ], cost: NONTERM
     10: l6 -> l2 : fvalue3^0'=-1, low6^0'=0, up5^0'=14, x2^0'=8, [], cost: 2
     16: l6 -> l2 : fvalue3^0'=fvalue3^post_2, low6^0'=0, mid4^0'=mid4^post_5, up5^0'=-1, x2^0'=8, [], cost: 5

Chained accelerated rules (with incoming rules):
   Start location: l6
     10: l6 -> l2 : fvalue3^0'=-1, low6^0'=0, up5^0'=14, x2^0'=8, [], cost: 2
     16: l6 -> l2 : fvalue3^0'=fvalue3^post_2, low6^0'=0, mid4^0'=mid4^post_5, up5^0'=-1, x2^0'=8, [], cost: 5
     27: l6 -> l2 : fvalue3^0'=-1, low6^0'=1+mid4^post_5, mid4^0'=mid4^post_5, up5^0'=14, x2^0'=8, [], cost: 6
     28: l6 -> l2 : fvalue3^0'=-1, low6^0'=0, mid4^0'=mid4^post_5, up5^0'=-1+mid4^post_5, x2^0'=8, [], cost: 6
     29: l6 -> l2 : fvalue3^0'=fvalue3^post_2, low6^0'=1+mid4^post_5, mid4^0'=mid4^post_5, up5^0'=mid4^post_5, x2^0'=8, [ 1+mid4^post_5<=14 ], cost: 9
     30: l6 -> l2 : fvalue3^0'=fvalue3^post_2, low6^0'=0, mid4^0'=mid4^post_5, up5^0'=-1, x2^0'=8, [ 0<=-1+mid4^post_5 ], cost: 9
     31: l6 -> [8] : [], cost: NONTERM
     32: l6 -> [8] : [], cost: NONTERM
     33: l6 -> [8] : [], cost: NONTERM
     34: l6 -> [8] : [], cost: NONTERM

Removed unreachable locations (and leaf rules with constant cost):
   Start location: l6
     31: l6 -> [8] : [], cost: NONTERM
     32: l6 -> [8] : [], cost: NONTERM
     33: l6 -> [8] : [], cost: NONTERM
     34: l6 -> [8] : [], cost: NONTERM

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: l6
     34: l6 -> [8] : [], cost: NONTERM

Computing asymptotic complexity for rule 34
   Guard is satisfiable, yielding nontermination
   Resulting cost NONTERM has complexity: Nonterm

Found new complexity Nonterm.

Obtained the following overall complexity (w.r.t. the length of the input n):
   Complexity:  Nonterm
   Cpx degree:  Nonterm
   Solved cost: NONTERM
   Rule cost:   NONTERM
   Rule guard:  []

NO