NO

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

Initial linear ITS problem
   Start location: l9
      0: l0 -> l1 : a_13^0'=a_13^post_1, a_21^0'=a_21^post_1, nondet_12^0'=nondet_12^post_1, result_11^0'=result_11^post_1, temp0_14^0'=temp0_14^post_1, x_15^0'=x_15^post_1, [ a_13^0==a_13^post_1 && a_21^0==a_21^post_1 && nondet_12^0==nondet_12^post_1 && result_11^0==result_11^post_1 && temp0_14^0==temp0_14^post_1 && x_15^0==x_15^post_1 ], cost: 1
      1: l1 -> l2 : a_13^0'=a_13^post_2, a_21^0'=a_21^post_2, nondet_12^0'=nondet_12^post_2, result_11^0'=result_11^post_2, temp0_14^0'=temp0_14^post_2, x_15^0'=x_15^post_2, [ 1+a_13^0<=1 && result_11^post_2==temp0_14^0 && a_13^0==a_13^post_2 && a_21^0==a_21^post_2 && nondet_12^0==nondet_12^post_2 && temp0_14^0==temp0_14^post_2 && x_15^0==x_15^post_2 ], cost: 1
      2: l1 -> l3 : a_13^0'=a_13^post_3, a_21^0'=a_21^post_3, nondet_12^0'=nondet_12^post_3, result_11^0'=result_11^post_3, temp0_14^0'=temp0_14^post_3, x_15^0'=x_15^post_3, [ 1<=a_13^0 && nondet_12^1_1==nondet_12^1_1 && x_15^post_3==nondet_12^1_1 && nondet_12^post_3==nondet_12^post_3 && a_13^0<=2*x_15^post_3 && 2*x_15^post_3<=a_13^0 && a_13^post_3==x_15^post_3 && a_13^post_3<=x_15^post_3 && x_15^post_3<=a_13^post_3 && 1<=2*x_15^post_3 && a_21^0==a_21^post_3 && result_11^0==result_11^post_3 && temp0_14^0==temp0_14^post_3 ], cost: 1
      4: l1 -> l5 : a_13^0'=a_13^post_5, a_21^0'=a_21^post_5, nondet_12^0'=nondet_12^post_5, result_11^0'=result_11^post_5, temp0_14^0'=temp0_14^post_5, x_15^0'=x_15^post_5, [ a_21^post_5==a_21^post_5 && 1<=a_13^0 && nondet_12^1_2==nondet_12^1_2 && x_15^post_5==nondet_12^1_2 && nondet_12^post_5==nondet_12^post_5 && a_13^0==a_13^post_5 && result_11^0==result_11^post_5 && temp0_14^0==temp0_14^post_5 ], cost: 1
      3: l3 -> l1 : a_13^0'=a_13^post_4, a_21^0'=a_21^post_4, nondet_12^0'=nondet_12^post_4, result_11^0'=result_11^post_4, temp0_14^0'=temp0_14^post_4, x_15^0'=x_15^post_4, [ a_13^0==a_13^post_4 && a_21^0==a_21^post_4 && nondet_12^0==nondet_12^post_4 && result_11^0==result_11^post_4 && temp0_14^0==temp0_14^post_4 && x_15^0==x_15^post_4 ], cost: 1
      5: l5 -> l6 : a_13^0'=a_13^post_6, a_21^0'=a_21^post_6, nondet_12^0'=nondet_12^post_6, result_11^0'=result_11^post_6, temp0_14^0'=temp0_14^post_6, x_15^0'=x_15^post_6, [ 1+a_13^0<=2*x_15^0 && a_13^0==a_13^post_6 && a_21^0==a_21^post_6 && nondet_12^0==nondet_12^post_6 && result_11^0==result_11^post_6 && temp0_14^0==temp0_14^post_6 && x_15^0==x_15^post_6 ], cost: 1
      6: l5 -> l6 : a_13^0'=a_13^post_7, a_21^0'=a_21^post_7, nondet_12^0'=nondet_12^post_7, result_11^0'=result_11^post_7, temp0_14^0'=temp0_14^post_7, x_15^0'=x_15^post_7, [ 1+2*x_15^0<=a_13^0 && a_13^0==a_13^post_7 && a_21^0==a_21^post_7 && nondet_12^0==nondet_12^post_7 && result_11^0==result_11^post_7 && temp0_14^0==temp0_14^post_7 && x_15^0==x_15^post_7 ], cost: 1
      7: l6 -> l7 : a_13^0'=a_13^post_8, a_21^0'=a_21^post_8, nondet_12^0'=nondet_12^post_8, result_11^0'=result_11^post_8, temp0_14^0'=temp0_14^post_8, x_15^0'=x_15^post_8, [ a_13^post_8==1+3*a_13^0 && a_13^post_8<=1+3*a_21^0 && 1+3*a_21^0<=a_13^post_8 && a_21^0==a_21^post_8 && nondet_12^0==nondet_12^post_8 && result_11^0==result_11^post_8 && temp0_14^0==temp0_14^post_8 && x_15^0==x_15^post_8 ], cost: 1
      8: l7 -> l8 : a_13^0'=a_13^post_9, a_21^0'=a_21^post_9, nondet_12^0'=nondet_12^post_9, result_11^0'=result_11^post_9, temp0_14^0'=temp0_14^post_9, x_15^0'=x_15^post_9, [ 1+a_21^0<=2*x_15^0 && a_13^0==a_13^post_9 && a_21^0==a_21^post_9 && nondet_12^0==nondet_12^post_9 && result_11^0==result_11^post_9 && temp0_14^0==temp0_14^post_9 && x_15^0==x_15^post_9 ], cost: 1
      9: l7 -> l8 : a_13^0'=a_13^post_10, a_21^0'=a_21^post_10, nondet_12^0'=nondet_12^post_10, result_11^0'=result_11^post_10, temp0_14^0'=temp0_14^post_10, x_15^0'=x_15^post_10, [ 1+2*x_15^0<=a_21^0 && a_13^0==a_13^post_10 && a_21^0==a_21^post_10 && nondet_12^0==nondet_12^post_10 && result_11^0==result_11^post_10 && temp0_14^0==temp0_14^post_10 && x_15^0==x_15^post_10 ], cost: 1
     10: l8 -> l4 : a_13^0'=a_13^post_11, a_21^0'=a_21^post_11, nondet_12^0'=nondet_12^post_11, result_11^0'=result_11^post_11, temp0_14^0'=temp0_14^post_11, x_15^0'=x_15^post_11, [ 1<=a_21^0 && a_13^0==a_13^post_11 && a_21^0==a_21^post_11 && nondet_12^0==nondet_12^post_11 && result_11^0==result_11^post_11 && temp0_14^0==temp0_14^post_11 && x_15^0==x_15^post_11 ], cost: 1
     11: l4 -> l1 : a_13^0'=a_13^post_12, a_21^0'=a_21^post_12, nondet_12^0'=nondet_12^post_12, result_11^0'=result_11^post_12, temp0_14^0'=temp0_14^post_12, x_15^0'=x_15^post_12, [ a_13^0==a_13^post_12 && a_21^0==a_21^post_12 && nondet_12^0==nondet_12^post_12 && result_11^0==result_11^post_12 && temp0_14^0==temp0_14^post_12 && x_15^0==x_15^post_12 ], cost: 1
     12: l9 -> l0 : a_13^0'=a_13^post_13, a_21^0'=a_21^post_13, nondet_12^0'=nondet_12^post_13, result_11^0'=result_11^post_13, temp0_14^0'=temp0_14^post_13, x_15^0'=x_15^post_13, [ a_13^0==a_13^post_13 && a_21^0==a_21^post_13 && nondet_12^0==nondet_12^post_13 && result_11^0==result_11^post_13 && temp0_14^0==temp0_14^post_13 && x_15^0==x_15^post_13 ], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
     12: l9 -> l0 : a_13^0'=a_13^post_13, a_21^0'=a_21^post_13, nondet_12^0'=nondet_12^post_13, result_11^0'=result_11^post_13, temp0_14^0'=temp0_14^post_13, x_15^0'=x_15^post_13, [ a_13^0==a_13^post_13 && a_21^0==a_21^post_13 && nondet_12^0==nondet_12^post_13 && result_11^0==result_11^post_13 && temp0_14^0==temp0_14^post_13 && x_15^0==x_15^post_13 ], cost: 1

Removed unreachable and leaf rules:
   Start location: l9
      0: l0 -> l1 : a_13^0'=a_13^post_1, a_21^0'=a_21^post_1, nondet_12^0'=nondet_12^post_1, result_11^0'=result_11^post_1, temp0_14^0'=temp0_14^post_1, x_15^0'=x_15^post_1, [ a_13^0==a_13^post_1 && a_21^0==a_21^post_1 && nondet_12^0==nondet_12^post_1 && result_11^0==result_11^post_1 && temp0_14^0==temp0_14^post_1 && x_15^0==x_15^post_1 ], cost: 1
      2: l1 -> l3 : a_13^0'=a_13^post_3, a_21^0'=a_21^post_3, nondet_12^0'=nondet_12^post_3, result_11^0'=result_11^post_3, temp0_14^0'=temp0_14^post_3, x_15^0'=x_15^post_3, [ 1<=a_13^0 && nondet_12^1_1==nondet_12^1_1 && x_15^post_3==nondet_12^1_1 && nondet_12^post_3==nondet_12^post_3 && a_13^0<=2*x_15^post_3 && 2*x_15^post_3<=a_13^0 && a_13^post_3==x_15^post_3 && a_13^post_3<=x_15^post_3 && x_15^post_3<=a_13^post_3 && 1<=2*x_15^post_3 && a_21^0==a_21^post_3 && result_11^0==result_11^post_3 && temp0_14^0==temp0_14^post_3 ], cost: 1
      4: l1 -> l5 : a_13^0'=a_13^post_5, a_21^0'=a_21^post_5, nondet_12^0'=nondet_12^post_5, result_11^0'=result_11^post_5, temp0_14^0'=temp0_14^post_5, x_15^0'=x_15^post_5, [ a_21^post_5==a_21^post_5 && 1<=a_13^0 && nondet_12^1_2==nondet_12^1_2 && x_15^post_5==nondet_12^1_2 && nondet_12^post_5==nondet_12^post_5 && a_13^0==a_13^post_5 && result_11^0==result_11^post_5 && temp0_14^0==temp0_14^post_5 ], cost: 1
      3: l3 -> l1 : a_13^0'=a_13^post_4, a_21^0'=a_21^post_4, nondet_12^0'=nondet_12^post_4, result_11^0'=result_11^post_4, temp0_14^0'=temp0_14^post_4, x_15^0'=x_15^post_4, [ a_13^0==a_13^post_4 && a_21^0==a_21^post_4 && nondet_12^0==nondet_12^post_4 && result_11^0==result_11^post_4 && temp0_14^0==temp0_14^post_4 && x_15^0==x_15^post_4 ], cost: 1
      5: l5 -> l6 : a_13^0'=a_13^post_6, a_21^0'=a_21^post_6, nondet_12^0'=nondet_12^post_6, result_11^0'=result_11^post_6, temp0_14^0'=temp0_14^post_6, x_15^0'=x_15^post_6, [ 1+a_13^0<=2*x_15^0 && a_13^0==a_13^post_6 && a_21^0==a_21^post_6 && nondet_12^0==nondet_12^post_6 && result_11^0==result_11^post_6 && temp0_14^0==temp0_14^post_6 && x_15^0==x_15^post_6 ], cost: 1
      6: l5 -> l6 : a_13^0'=a_13^post_7, a_21^0'=a_21^post_7, nondet_12^0'=nondet_12^post_7, result_11^0'=result_11^post_7, temp0_14^0'=temp0_14^post_7, x_15^0'=x_15^post_7, [ 1+2*x_15^0<=a_13^0 && a_13^0==a_13^post_7 && a_21^0==a_21^post_7 && nondet_12^0==nondet_12^post_7 && result_11^0==result_11^post_7 && temp0_14^0==temp0_14^post_7 && x_15^0==x_15^post_7 ], cost: 1
      7: l6 -> l7 : a_13^0'=a_13^post_8, a_21^0'=a_21^post_8, nondet_12^0'=nondet_12^post_8, result_11^0'=result_11^post_8, temp0_14^0'=temp0_14^post_8, x_15^0'=x_15^post_8, [ a_13^post_8==1+3*a_13^0 && a_13^post_8<=1+3*a_21^0 && 1+3*a_21^0<=a_13^post_8 && a_21^0==a_21^post_8 && nondet_12^0==nondet_12^post_8 && result_11^0==result_11^post_8 && temp0_14^0==temp0_14^post_8 && x_15^0==x_15^post_8 ], cost: 1
      8: l7 -> l8 : a_13^0'=a_13^post_9, a_21^0'=a_21^post_9, nondet_12^0'=nondet_12^post_9, result_11^0'=result_11^post_9, temp0_14^0'=temp0_14^post_9, x_15^0'=x_15^post_9, [ 1+a_21^0<=2*x_15^0 && a_13^0==a_13^post_9 && a_21^0==a_21^post_9 && nondet_12^0==nondet_12^post_9 && result_11^0==result_11^post_9 && temp0_14^0==temp0_14^post_9 && x_15^0==x_15^post_9 ], cost: 1
      9: l7 -> l8 : a_13^0'=a_13^post_10, a_21^0'=a_21^post_10, nondet_12^0'=nondet_12^post_10, result_11^0'=result_11^post_10, temp0_14^0'=temp0_14^post_10, x_15^0'=x_15^post_10, [ 1+2*x_15^0<=a_21^0 && a_13^0==a_13^post_10 && a_21^0==a_21^post_10 && nondet_12^0==nondet_12^post_10 && result_11^0==result_11^post_10 && temp0_14^0==temp0_14^post_10 && x_15^0==x_15^post_10 ], cost: 1
     10: l8 -> l4 : a_13^0'=a_13^post_11, a_21^0'=a_21^post_11, nondet_12^0'=nondet_12^post_11, result_11^0'=result_11^post_11, temp0_14^0'=temp0_14^post_11, x_15^0'=x_15^post_11, [ 1<=a_21^0 && a_13^0==a_13^post_11 && a_21^0==a_21^post_11 && nondet_12^0==nondet_12^post_11 && result_11^0==result_11^post_11 && temp0_14^0==temp0_14^post_11 && x_15^0==x_15^post_11 ], cost: 1
     11: l4 -> l1 : a_13^0'=a_13^post_12, a_21^0'=a_21^post_12, nondet_12^0'=nondet_12^post_12, result_11^0'=result_11^post_12, temp0_14^0'=temp0_14^post_12, x_15^0'=x_15^post_12, [ a_13^0==a_13^post_12 && a_21^0==a_21^post_12 && nondet_12^0==nondet_12^post_12 && result_11^0==result_11^post_12 && temp0_14^0==temp0_14^post_12 && x_15^0==x_15^post_12 ], cost: 1
     12: l9 -> l0 : a_13^0'=a_13^post_13, a_21^0'=a_21^post_13, nondet_12^0'=nondet_12^post_13, result_11^0'=result_11^post_13, temp0_14^0'=temp0_14^post_13, x_15^0'=x_15^post_13, [ a_13^0==a_13^post_13 && a_21^0==a_21^post_13 && nondet_12^0==nondet_12^post_13 && result_11^0==result_11^post_13 && temp0_14^0==temp0_14^post_13 && x_15^0==x_15^post_13 ], cost: 1

Simplified all rules, resulting in:
   Start location: l9
      0: l0 -> l1 : [], cost: 1
      2: l1 -> l3 : a_13^0'=nondet_12^1_1, nondet_12^0'=nondet_12^post_3, x_15^0'=nondet_12^1_1, [ 1<=a_13^0 && -2*nondet_12^1_1+a_13^0==0 ], cost: 1
      4: l1 -> l5 : a_21^0'=a_21^post_5, nondet_12^0'=nondet_12^post_5, x_15^0'=nondet_12^1_2, [ 1<=a_13^0 ], cost: 1
      3: l3 -> l1 : [], cost: 1
      5: l5 -> l6 : [ 1+a_13^0<=2*x_15^0 ], cost: 1
      6: l5 -> l6 : [ 1+2*x_15^0<=a_13^0 ], cost: 1
      7: l6 -> l7 : a_13^0'=1+3*a_13^0, [ -3*a_21^0+3*a_13^0==0 ], cost: 1
      8: l7 -> l8 : [ 1+a_21^0<=2*x_15^0 ], cost: 1
      9: l7 -> l8 : [ 1+2*x_15^0<=a_21^0 ], cost: 1
     10: l8 -> l4 : [ 1<=a_21^0 ], cost: 1
     11: l4 -> l1 : [], cost: 1
     12: l9 -> l0 : [], cost: 1

### Simplification by acceleration and chaining ###

Eliminated locations (on linear paths):
   Start location: l9
      4: l1 -> l5 : a_21^0'=a_21^post_5, nondet_12^0'=nondet_12^post_5, x_15^0'=nondet_12^1_2, [ 1<=a_13^0 ], cost: 1
     14: l1 -> l1 : a_13^0'=nondet_12^1_1, nondet_12^0'=nondet_12^post_3, x_15^0'=nondet_12^1_1, [ 1<=a_13^0 && -2*nondet_12^1_1+a_13^0==0 ], cost: 2
      5: l5 -> l6 : [ 1+a_13^0<=2*x_15^0 ], cost: 1
      6: l5 -> l6 : [ 1+2*x_15^0<=a_13^0 ], cost: 1
      7: l6 -> l7 : a_13^0'=1+3*a_13^0, [ -3*a_21^0+3*a_13^0==0 ], cost: 1
      8: l7 -> l8 : [ 1+a_21^0<=2*x_15^0 ], cost: 1
      9: l7 -> l8 : [ 1+2*x_15^0<=a_21^0 ], cost: 1
     15: l8 -> l1 : [ 1<=a_21^0 ], cost: 2
     13: l9 -> l1 : [], cost: 2

Accelerating simple loops of location 1.
   Accelerating the following rules:
     14: l1 -> l1 : a_13^0'=nondet_12^1_1, nondet_12^0'=nondet_12^post_3, x_15^0'=nondet_12^1_1, [ 1<=a_13^0 && -2*nondet_12^1_1+a_13^0==0 ], cost: 2

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

Accelerated all simple loops using metering functions (where possible):
   Start location: l9
      4: l1 -> l5 : a_21^0'=a_21^post_5, nondet_12^0'=nondet_12^post_5, x_15^0'=nondet_12^1_2, [ 1<=a_13^0 ], cost: 1
     14: l1 -> l1 : a_13^0'=nondet_12^1_1, nondet_12^0'=nondet_12^post_3, x_15^0'=nondet_12^1_1, [ 1<=a_13^0 && -2*nondet_12^1_1+a_13^0==0 ], cost: 2
      5: l5 -> l6 : [ 1+a_13^0<=2*x_15^0 ], cost: 1
      6: l5 -> l6 : [ 1+2*x_15^0<=a_13^0 ], cost: 1
      7: l6 -> l7 : a_13^0'=1+3*a_13^0, [ -3*a_21^0+3*a_13^0==0 ], cost: 1
      8: l7 -> l8 : [ 1+a_21^0<=2*x_15^0 ], cost: 1
      9: l7 -> l8 : [ 1+2*x_15^0<=a_21^0 ], cost: 1
     15: l8 -> l1 : [ 1<=a_21^0 ], cost: 2
     13: l9 -> l1 : [], cost: 2

Chained accelerated rules (with incoming rules):
   Start location: l9
      4: l1 -> l5 : a_21^0'=a_21^post_5, nondet_12^0'=nondet_12^post_5, x_15^0'=nondet_12^1_2, [ 1<=a_13^0 ], cost: 1
      5: l5 -> l6 : [ 1+a_13^0<=2*x_15^0 ], cost: 1
      6: l5 -> l6 : [ 1+2*x_15^0<=a_13^0 ], cost: 1
      7: l6 -> l7 : a_13^0'=1+3*a_13^0, [ -3*a_21^0+3*a_13^0==0 ], cost: 1
      8: l7 -> l8 : [ 1+a_21^0<=2*x_15^0 ], cost: 1
      9: l7 -> l8 : [ 1+2*x_15^0<=a_21^0 ], cost: 1
     15: l8 -> l1 : [ 1<=a_21^0 ], cost: 2
     17: l8 -> l1 : a_13^0'=nondet_12^1_1, nondet_12^0'=nondet_12^post_3, x_15^0'=nondet_12^1_1, [ 1<=a_21^0 && 1<=a_13^0 && -2*nondet_12^1_1+a_13^0==0 ], cost: 4
     13: l9 -> l1 : [], cost: 2
     16: l9 -> l1 : a_13^0'=nondet_12^1_1, nondet_12^0'=nondet_12^post_3, x_15^0'=nondet_12^1_1, [ 1<=a_13^0 && -2*nondet_12^1_1+a_13^0==0 ], cost: 4

Eliminated locations (on tree-shaped paths):
   Start location: l9
     18: l1 -> l6 : a_21^0'=a_21^post_5, nondet_12^0'=nondet_12^post_5, x_15^0'=nondet_12^1_2, [ 1<=a_13^0 && 1+a_13^0<=2*nondet_12^1_2 ], cost: 2
     19: l1 -> l6 : a_21^0'=a_21^post_5, nondet_12^0'=nondet_12^post_5, x_15^0'=nondet_12^1_2, [ 1<=a_13^0 && 1+2*nondet_12^1_2<=a_13^0 ], cost: 2
     20: l6 -> l8 : a_13^0'=1+3*a_13^0, [ -3*a_21^0+3*a_13^0==0 && 1+a_21^0<=2*x_15^0 ], cost: 2
     21: l6 -> l8 : a_13^0'=1+3*a_13^0, [ -3*a_21^0+3*a_13^0==0 && 1+2*x_15^0<=a_21^0 ], cost: 2
     15: l8 -> l1 : [ 1<=a_21^0 ], cost: 2
     17: l8 -> l1 : a_13^0'=nondet_12^1_1, nondet_12^0'=nondet_12^post_3, x_15^0'=nondet_12^1_1, [ 1<=a_21^0 && 1<=a_13^0 && -2*nondet_12^1_1+a_13^0==0 ], cost: 4
     13: l9 -> l1 : [], cost: 2
     16: l9 -> l1 : a_13^0'=nondet_12^1_1, nondet_12^0'=nondet_12^post_3, x_15^0'=nondet_12^1_1, [ 1<=a_13^0 && -2*nondet_12^1_1+a_13^0==0 ], cost: 4

Eliminated locations (on tree-shaped paths):
   Start location: l9
     22: l1 -> l8 : a_13^0'=1+3*a_13^0, a_21^0'=a_21^post_5, nondet_12^0'=nondet_12^post_5, x_15^0'=nondet_12^1_2, [ 1<=a_13^0 && 1+a_13^0<=2*nondet_12^1_2 && -3*a_21^post_5+3*a_13^0==0 && 1+a_21^post_5<=2*nondet_12^1_2 ], cost: 4
     23: l1 -> l8 : a_13^0'=1+3*a_13^0, a_21^0'=a_21^post_5, nondet_12^0'=nondet_12^post_5, x_15^0'=nondet_12^1_2, [ 1<=a_13^0 && 1+2*nondet_12^1_2<=a_13^0 && -3*a_21^post_5+3*a_13^0==0 && 1+2*nondet_12^1_2<=a_21^post_5 ], cost: 4
     15: l8 -> l1 : [ 1<=a_21^0 ], cost: 2
     17: l8 -> l1 : a_13^0'=nondet_12^1_1, nondet_12^0'=nondet_12^post_3, x_15^0'=nondet_12^1_1, [ 1<=a_21^0 && 1<=a_13^0 && -2*nondet_12^1_1+a_13^0==0 ], cost: 4
     13: l9 -> l1 : [], cost: 2
     16: l9 -> l1 : a_13^0'=nondet_12^1_1, nondet_12^0'=nondet_12^post_3, x_15^0'=nondet_12^1_1, [ 1<=a_13^0 && -2*nondet_12^1_1+a_13^0==0 ], cost: 4

Eliminated locations (on tree-shaped paths):
   Start location: l9
     24: l1 -> l1 : a_13^0'=1+3*a_13^0, a_21^0'=a_21^post_5, nondet_12^0'=nondet_12^post_5, x_15^0'=nondet_12^1_2, [ 1<=a_13^0 && 1+a_13^0<=2*nondet_12^1_2 && -3*a_21^post_5+3*a_13^0==0 && 1+a_21^post_5<=2*nondet_12^1_2 && 1<=a_21^post_5 ], cost: 6
     25: l1 -> l1 : a_13^0'=nondet_12^1_1, a_21^0'=a_21^post_5, nondet_12^0'=nondet_12^post_3, x_15^0'=nondet_12^1_1, [ 1<=a_13^0 && 1+a_13^0<=2*nondet_12^1_2 && -3*a_21^post_5+3*a_13^0==0 && 1+a_21^post_5<=2*nondet_12^1_2 && 1<=a_21^post_5 && 1<=1+3*a_13^0 && 1-2*nondet_12^1_1+3*a_13^0==0 ], cost: 8
     26: l1 -> l1 : a_13^0'=1+3*a_13^0, a_21^0'=a_21^post_5, nondet_12^0'=nondet_12^post_5, x_15^0'=nondet_12^1_2, [ 1<=a_13^0 && 1+2*nondet_12^1_2<=a_13^0 && -3*a_21^post_5+3*a_13^0==0 && 1+2*nondet_12^1_2<=a_21^post_5 && 1<=a_21^post_5 ], cost: 6
     27: l1 -> l1 : a_13^0'=nondet_12^1_1, a_21^0'=a_21^post_5, nondet_12^0'=nondet_12^post_3, x_15^0'=nondet_12^1_1, [ 1<=a_13^0 && 1+2*nondet_12^1_2<=a_13^0 && -3*a_21^post_5+3*a_13^0==0 && 1+2*nondet_12^1_2<=a_21^post_5 && 1<=a_21^post_5 && 1<=1+3*a_13^0 && 1-2*nondet_12^1_1+3*a_13^0==0 ], cost: 8
     13: l9 -> l1 : [], cost: 2
     16: l9 -> l1 : a_13^0'=nondet_12^1_1, nondet_12^0'=nondet_12^post_3, x_15^0'=nondet_12^1_1, [ 1<=a_13^0 && -2*nondet_12^1_1+a_13^0==0 ], cost: 4

Accelerating simple loops of location 1.
   Simplified some of the simple loops (and removed duplicate rules).
   Accelerating the following rules:
     24: l1 -> l1 : a_13^0'=1+3*a_13^0, a_21^0'=a_13^0, nondet_12^0'=nondet_12^post_5, x_15^0'=nondet_12^1_2, [ 1<=a_13^0 && 1+a_13^0<=2*nondet_12^1_2 ], cost: 6
     25: l1 -> l1 : a_13^0'=nondet_12^1_1, a_21^0'=a_13^0, nondet_12^0'=nondet_12^post_3, x_15^0'=nondet_12^1_1, [ 1<=a_13^0 && 1+a_13^0<=2*nondet_12^1_2 && 1<=1+3*a_13^0 && 1-2*nondet_12^1_1+3*a_13^0==0 ], cost: 8
     26: l1 -> l1 : a_13^0'=1+3*a_13^0, a_21^0'=a_13^0, nondet_12^0'=nondet_12^post_5, x_15^0'=nondet_12^1_2, [ 1<=a_13^0 && 1+2*nondet_12^1_2<=a_13^0 ], cost: 6
     27: l1 -> l1 : a_13^0'=nondet_12^1_1, a_21^0'=a_13^0, nondet_12^0'=nondet_12^post_3, x_15^0'=nondet_12^1_1, [ 1<=a_13^0 && 1+2*nondet_12^1_2<=a_13^0 && 1<=1+3*a_13^0 && 1-2*nondet_12^1_1+3*a_13^0==0 ], cost: 8

   Accelerated rule 24 with backward acceleration, yielding the new rule 28.
   Failed to prove monotonicity of the guard of rule 25.
   Accelerated rule 26 with non-termination, yielding the new rule 29.
   Failed to prove monotonicity of the guard of rule 27.
[accelerate] Nesting with 3 inner and 3 outer candidates
   Removing the simple loops: 24 26.

Accelerated all simple loops using metering functions (where possible):
   Start location: l9
     25: l1 -> l1 : a_13^0'=nondet_12^1_1, a_21^0'=a_13^0, nondet_12^0'=nondet_12^post_3, x_15^0'=nondet_12^1_1, [ 1<=a_13^0 && 1+a_13^0<=2*nondet_12^1_2 && 1<=1+3*a_13^0 && 1-2*nondet_12^1_1+3*a_13^0==0 ], cost: 8
     27: l1 -> l1 : a_13^0'=nondet_12^1_1, a_21^0'=a_13^0, nondet_12^0'=nondet_12^post_3, x_15^0'=nondet_12^1_1, [ 1<=a_13^0 && 1+2*nondet_12^1_2<=a_13^0 && 1<=1+3*a_13^0 && 1-2*nondet_12^1_1+3*a_13^0==0 ], cost: 8
     28: l1 -> l1 : a_13^0'=-1/2+1/2*3^k+3^k*a_13^0, a_21^0'=-1/2+1/2*3^(-1+k)+3^(-1+k)*a_13^0, nondet_12^0'=nondet_12^post_5, x_15^0'=nondet_12^1_2, [ 1<=a_13^0 && k>=1 && 1/2+1/2*3^(-1+k)+3^(-1+k)*a_13^0<=2*nondet_12^1_2 ], cost: 6*k
     29: l1 -> [11] : [ 1<=a_13^0 && 1+2*nondet_12^1_2<=a_13^0 ], cost: NONTERM
     13: l9 -> l1 : [], cost: 2
     16: l9 -> l1 : a_13^0'=nondet_12^1_1, nondet_12^0'=nondet_12^post_3, x_15^0'=nondet_12^1_1, [ 1<=a_13^0 && -2*nondet_12^1_1+a_13^0==0 ], cost: 4

Chained accelerated rules (with incoming rules):
   Start location: l9
     13: l9 -> l1 : [], cost: 2
     16: l9 -> l1 : a_13^0'=nondet_12^1_1, nondet_12^0'=nondet_12^post_3, x_15^0'=nondet_12^1_1, [ 1<=a_13^0 && -2*nondet_12^1_1+a_13^0==0 ], cost: 4
     30: l9 -> l1 : a_13^0'=nondet_12^1_1, a_21^0'=a_13^0, nondet_12^0'=nondet_12^post_3, x_15^0'=nondet_12^1_1, [ 1<=a_13^0 && 1+a_13^0<=2*nondet_12^1_2 && 1<=1+3*a_13^0 && 1-2*nondet_12^1_1+3*a_13^0==0 ], cost: 10
     31: l9 -> l1 : a_13^0'=nondet_12^1_1, a_21^0'=a_13^0, nondet_12^0'=nondet_12^post_3, x_15^0'=nondet_12^1_1, [ 1<=a_13^0 && 1+2*nondet_12^1_2<=a_13^0 && 1<=1+3*a_13^0 && 1-2*nondet_12^1_1+3*a_13^0==0 ], cost: 10
     32: l9 -> l1 : a_13^0'=-1/2+1/2*3^k+3^k*a_13^0, a_21^0'=-1/2+1/2*3^(-1+k)+3^(-1+k)*a_13^0, nondet_12^0'=nondet_12^post_5, x_15^0'=nondet_12^1_2, [ 1<=a_13^0 && k>=1 && 1/2+1/2*3^(-1+k)+3^(-1+k)*a_13^0<=2*nondet_12^1_2 ], cost: 2+6*k
     33: l9 -> l1 : a_13^0'=-1/2+1/2*3^k+3^k*nondet_12^1_1, a_21^0'=-1/2+1/2*3^(-1+k)+3^(-1+k)*nondet_12^1_1, nondet_12^0'=nondet_12^post_5, x_15^0'=nondet_12^1_2, [ 1<=a_13^0 && -2*nondet_12^1_1+a_13^0==0 && 1<=nondet_12^1_1 && k>=1 && 1/2+1/2*3^(-1+k)+3^(-1+k)*nondet_12^1_1<=2*nondet_12^1_2 ], cost: 4+6*k
     34: l9 -> [11] : [ 1<=a_13^0 && 1+2*nondet_12^1_2<=a_13^0 ], cost: NONTERM
     35: l9 -> [11] : [ 1<=a_13^0 && -2*nondet_12^1_1+a_13^0==0 && 1<=nondet_12^1_1 && 1+2*nondet_12^1_2<=nondet_12^1_1 ], cost: NONTERM

Removed unreachable locations (and leaf rules with constant cost):
   Start location: l9
     32: l9 -> l1 : a_13^0'=-1/2+1/2*3^k+3^k*a_13^0, a_21^0'=-1/2+1/2*3^(-1+k)+3^(-1+k)*a_13^0, nondet_12^0'=nondet_12^post_5, x_15^0'=nondet_12^1_2, [ 1<=a_13^0 && k>=1 && 1/2+1/2*3^(-1+k)+3^(-1+k)*a_13^0<=2*nondet_12^1_2 ], cost: 2+6*k
     33: l9 -> l1 : a_13^0'=-1/2+1/2*3^k+3^k*nondet_12^1_1, a_21^0'=-1/2+1/2*3^(-1+k)+3^(-1+k)*nondet_12^1_1, nondet_12^0'=nondet_12^post_5, x_15^0'=nondet_12^1_2, [ 1<=a_13^0 && -2*nondet_12^1_1+a_13^0==0 && 1<=nondet_12^1_1 && k>=1 && 1/2+1/2*3^(-1+k)+3^(-1+k)*nondet_12^1_1<=2*nondet_12^1_2 ], cost: 4+6*k
     34: l9 -> [11] : [ 1<=a_13^0 && 1+2*nondet_12^1_2<=a_13^0 ], cost: NONTERM
     35: l9 -> [11] : [ 1<=a_13^0 && -2*nondet_12^1_1+a_13^0==0 && 1<=nondet_12^1_1 && 1+2*nondet_12^1_2<=nondet_12^1_1 ], cost: NONTERM

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: l9
     32: l9 -> l1 : a_13^0'=-1/2+1/2*3^k+3^k*a_13^0, a_21^0'=-1/2+1/2*3^(-1+k)+3^(-1+k)*a_13^0, nondet_12^0'=nondet_12^post_5, x_15^0'=nondet_12^1_2, [ 1<=a_13^0 && k>=1 && 1/2+1/2*3^(-1+k)+3^(-1+k)*a_13^0<=2*nondet_12^1_2 ], cost: 2+6*k
     33: l9 -> l1 : a_13^0'=-1/2+1/2*3^k+3^k*nondet_12^1_1, a_21^0'=-1/2+1/2*3^(-1+k)+3^(-1+k)*nondet_12^1_1, nondet_12^0'=nondet_12^post_5, x_15^0'=nondet_12^1_2, [ 1<=a_13^0 && -2*nondet_12^1_1+a_13^0==0 && 1<=nondet_12^1_1 && k>=1 && 1/2+1/2*3^(-1+k)+3^(-1+k)*nondet_12^1_1<=2*nondet_12^1_2 ], cost: 4+6*k
     34: l9 -> [11] : [ 1<=a_13^0 && 1+2*nondet_12^1_2<=a_13^0 ], cost: NONTERM
     35: l9 -> [11] : [ 1<=a_13^0 && -2*nondet_12^1_1+a_13^0==0 && 1<=nondet_12^1_1 && 1+2*nondet_12^1_2<=nondet_12^1_1 ], 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:  [ 1<=a_13^0 && 1+2*nondet_12^1_2<=a_13^0 ]

NO