WORST_CASE(Omega(1),?)

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

Initial linear ITS problem
   Start location: l18
      0: l0 -> l2 : Result_4^0'=Result_4^post_1, w_5^0'=w_5^post_1, x_6^0'=x_6^post_1, [ 2-x_6^0<=0 && 0<=2-w_5^0 && x_6^post_1==1+x_6^0 && w_5^post_1==1+w_5^0 && Result_4^0==Result_4^post_1 ], cost: 1
      6: l0 -> l5 : Result_4^0'=Result_4^post_7, w_5^0'=w_5^post_7, x_6^0'=x_6^post_7, [ 2-x_6^0<=0 && 0<=2-w_5^0 && x_6^post_7==1+x_6^0 && w_5^post_7==1+w_5^0 && Result_4^0==Result_4^post_7 ], cost: 1
     11: l0 -> l8 : Result_4^0'=Result_4^post_12, w_5^0'=w_5^post_12, x_6^0'=x_6^post_12, [ 0<=1-x_6^0 && x_6^post_12==1+x_6^0 && w_5^post_12==1+w_5^0 && Result_4^0==Result_4^post_12 ], cost: 1
     17: l0 -> l11 : Result_4^0'=Result_4^post_18, w_5^0'=w_5^post_18, x_6^0'=x_6^post_18, [ 0<=1-x_6^0 && x_6^post_18==1+x_6^0 && w_5^post_18==1+w_5^0 && Result_4^0==Result_4^post_18 ], cost: 1
     22: l0 -> l14 : Result_4^0'=Result_4^post_23, w_5^0'=w_5^post_23, x_6^0'=x_6^post_23, [ 0<=1-x_6^0 && x_6^post_23==1+x_6^0 && w_5^post_23==1+w_5^0 && x_6^post_23<=2 && 2<=x_6^post_23 && Result_4^0==Result_4^post_23 ], cost: 1
     26: l0 -> l15 : Result_4^0'=Result_4^post_27, w_5^0'=w_5^post_27, x_6^0'=x_6^post_27, [ 0<=1-x_6^0 && x_6^post_27==1+x_6^0 && w_5^1_1==1+w_5^0 && x_6^post_27<=2 && 2<=x_6^post_27 && w_5^1_1<=2 && 2<=w_5^1_1 && w_5^post_27==1 && Result_4^0==Result_4^post_27 ], cost: 1
     28: l0 -> l16 : Result_4^0'=Result_4^post_29, w_5^0'=w_5^post_29, x_6^0'=x_6^post_29, [ 2-x_6^0<=0 && 3-w_5^0<=0 && Result_4^post_29==Result_4^post_29 && w_5^0==w_5^post_29 && x_6^0==x_6^post_29 ], cost: 1
      1: l2 -> l3 : Result_4^0'=Result_4^post_2, w_5^0'=w_5^post_2, x_6^0'=x_6^post_2, [ 1+x_6^0<=2 && Result_4^0==Result_4^post_2 && w_5^0==w_5^post_2 && x_6^0==x_6^post_2 ], cost: 1
      2: l2 -> l3 : Result_4^0'=Result_4^post_3, w_5^0'=w_5^post_3, x_6^0'=x_6^post_3, [ 3<=x_6^0 && Result_4^0==Result_4^post_3 && w_5^0==w_5^post_3 && x_6^0==x_6^post_3 ], cost: 1
      3: l3 -> l1 : Result_4^0'=Result_4^post_4, w_5^0'=w_5^post_4, x_6^0'=x_6^post_4, [ 1+w_5^0<=2 && Result_4^0==Result_4^post_4 && w_5^0==w_5^post_4 && x_6^0==x_6^post_4 ], cost: 1
      4: l3 -> l1 : Result_4^0'=Result_4^post_5, w_5^0'=w_5^post_5, x_6^0'=x_6^post_5, [ 3<=w_5^0 && Result_4^0==Result_4^post_5 && w_5^0==w_5^post_5 && x_6^0==x_6^post_5 ], cost: 1
      5: l1 -> l0 : Result_4^0'=Result_4^post_6, w_5^0'=w_5^post_6, x_6^0'=x_6^post_6, [ Result_4^0==Result_4^post_6 && w_5^0==w_5^post_6 && x_6^0==x_6^post_6 ], cost: 1
      7: l5 -> l6 : Result_4^0'=Result_4^post_8, w_5^0'=w_5^post_8, x_6^0'=x_6^post_8, [ 1+x_6^0<=2 && Result_4^0==Result_4^post_8 && w_5^0==w_5^post_8 && x_6^0==x_6^post_8 ], cost: 1
      8: l5 -> l6 : Result_4^0'=Result_4^post_9, w_5^0'=w_5^post_9, x_6^0'=x_6^post_9, [ 3<=x_6^0 && Result_4^0==Result_4^post_9 && w_5^0==w_5^post_9 && x_6^0==x_6^post_9 ], cost: 1
      9: l6 -> l4 : Result_4^0'=Result_4^post_10, w_5^0'=w_5^post_10, x_6^0'=x_6^post_10, [ w_5^0<=2 && 2<=w_5^0 && w_5^post_10==1 && Result_4^0==Result_4^post_10 && x_6^0==x_6^post_10 ], cost: 1
     10: l4 -> l0 : Result_4^0'=Result_4^post_11, w_5^0'=w_5^post_11, x_6^0'=x_6^post_11, [ Result_4^0==Result_4^post_11 && w_5^0==w_5^post_11 && x_6^0==x_6^post_11 ], cost: 1
     12: l8 -> l9 : Result_4^0'=Result_4^post_13, w_5^0'=w_5^post_13, x_6^0'=x_6^post_13, [ 1+x_6^0<=2 && Result_4^0==Result_4^post_13 && w_5^0==w_5^post_13 && x_6^0==x_6^post_13 ], cost: 1
     13: l8 -> l9 : Result_4^0'=Result_4^post_14, w_5^0'=w_5^post_14, x_6^0'=x_6^post_14, [ 3<=x_6^0 && Result_4^0==Result_4^post_14 && w_5^0==w_5^post_14 && x_6^0==x_6^post_14 ], cost: 1
     14: l9 -> l7 : Result_4^0'=Result_4^post_15, w_5^0'=w_5^post_15, x_6^0'=x_6^post_15, [ 1+w_5^0<=2 && Result_4^0==Result_4^post_15 && w_5^0==w_5^post_15 && x_6^0==x_6^post_15 ], cost: 1
     15: l9 -> l7 : Result_4^0'=Result_4^post_16, w_5^0'=w_5^post_16, x_6^0'=x_6^post_16, [ 3<=w_5^0 && Result_4^0==Result_4^post_16 && w_5^0==w_5^post_16 && x_6^0==x_6^post_16 ], cost: 1
     16: l7 -> l0 : Result_4^0'=Result_4^post_17, w_5^0'=w_5^post_17, x_6^0'=x_6^post_17, [ Result_4^0==Result_4^post_17 && w_5^0==w_5^post_17 && x_6^0==x_6^post_17 ], cost: 1
     18: l11 -> l12 : Result_4^0'=Result_4^post_19, w_5^0'=w_5^post_19, x_6^0'=x_6^post_19, [ 1+x_6^0<=2 && Result_4^0==Result_4^post_19 && w_5^0==w_5^post_19 && x_6^0==x_6^post_19 ], cost: 1
     19: l11 -> l12 : Result_4^0'=Result_4^post_20, w_5^0'=w_5^post_20, x_6^0'=x_6^post_20, [ 3<=x_6^0 && Result_4^0==Result_4^post_20 && w_5^0==w_5^post_20 && x_6^0==x_6^post_20 ], cost: 1
     20: l12 -> l10 : Result_4^0'=Result_4^post_21, w_5^0'=w_5^post_21, x_6^0'=x_6^post_21, [ w_5^0<=2 && 2<=w_5^0 && w_5^post_21==1 && Result_4^0==Result_4^post_21 && x_6^0==x_6^post_21 ], cost: 1
     21: l10 -> l0 : Result_4^0'=Result_4^post_22, w_5^0'=w_5^post_22, x_6^0'=x_6^post_22, [ Result_4^0==Result_4^post_22 && w_5^0==w_5^post_22 && x_6^0==x_6^post_22 ], cost: 1
     23: l14 -> l13 : Result_4^0'=Result_4^post_24, w_5^0'=w_5^post_24, x_6^0'=x_6^post_24, [ 1+w_5^0<=2 && Result_4^0==Result_4^post_24 && w_5^0==w_5^post_24 && x_6^0==x_6^post_24 ], cost: 1
     24: l14 -> l13 : Result_4^0'=Result_4^post_25, w_5^0'=w_5^post_25, x_6^0'=x_6^post_25, [ 3<=w_5^0 && Result_4^0==Result_4^post_25 && w_5^0==w_5^post_25 && x_6^0==x_6^post_25 ], cost: 1
     25: l13 -> l0 : Result_4^0'=Result_4^post_26, w_5^0'=w_5^post_26, x_6^0'=x_6^post_26, [ Result_4^0==Result_4^post_26 && w_5^0==w_5^post_26 && x_6^0==x_6^post_26 ], cost: 1
     27: l15 -> l0 : Result_4^0'=Result_4^post_28, w_5^0'=w_5^post_28, x_6^0'=x_6^post_28, [ Result_4^0==Result_4^post_28 && w_5^0==w_5^post_28 && x_6^0==x_6^post_28 ], cost: 1
     29: l17 -> l0 : Result_4^0'=Result_4^post_30, w_5^0'=w_5^post_30, x_6^0'=x_6^post_30, [ Result_4^0==Result_4^post_30 && w_5^0==w_5^post_30 && x_6^0==x_6^post_30 ], cost: 1
     30: l18 -> l17 : Result_4^0'=Result_4^post_31, w_5^0'=w_5^post_31, x_6^0'=x_6^post_31, [ Result_4^0==Result_4^post_31 && w_5^0==w_5^post_31 && x_6^0==x_6^post_31 ], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
     30: l18 -> l17 : Result_4^0'=Result_4^post_31, w_5^0'=w_5^post_31, x_6^0'=x_6^post_31, [ Result_4^0==Result_4^post_31 && w_5^0==w_5^post_31 && x_6^0==x_6^post_31 ], cost: 1

Removed unreachable and leaf rules:
   Start location: l18
      0: l0 -> l2 : Result_4^0'=Result_4^post_1, w_5^0'=w_5^post_1, x_6^0'=x_6^post_1, [ 2-x_6^0<=0 && 0<=2-w_5^0 && x_6^post_1==1+x_6^0 && w_5^post_1==1+w_5^0 && Result_4^0==Result_4^post_1 ], cost: 1
      6: l0 -> l5 : Result_4^0'=Result_4^post_7, w_5^0'=w_5^post_7, x_6^0'=x_6^post_7, [ 2-x_6^0<=0 && 0<=2-w_5^0 && x_6^post_7==1+x_6^0 && w_5^post_7==1+w_5^0 && Result_4^0==Result_4^post_7 ], cost: 1
     11: l0 -> l8 : Result_4^0'=Result_4^post_12, w_5^0'=w_5^post_12, x_6^0'=x_6^post_12, [ 0<=1-x_6^0 && x_6^post_12==1+x_6^0 && w_5^post_12==1+w_5^0 && Result_4^0==Result_4^post_12 ], cost: 1
     17: l0 -> l11 : Result_4^0'=Result_4^post_18, w_5^0'=w_5^post_18, x_6^0'=x_6^post_18, [ 0<=1-x_6^0 && x_6^post_18==1+x_6^0 && w_5^post_18==1+w_5^0 && Result_4^0==Result_4^post_18 ], cost: 1
     22: l0 -> l14 : Result_4^0'=Result_4^post_23, w_5^0'=w_5^post_23, x_6^0'=x_6^post_23, [ 0<=1-x_6^0 && x_6^post_23==1+x_6^0 && w_5^post_23==1+w_5^0 && x_6^post_23<=2 && 2<=x_6^post_23 && Result_4^0==Result_4^post_23 ], cost: 1
     26: l0 -> l15 : Result_4^0'=Result_4^post_27, w_5^0'=w_5^post_27, x_6^0'=x_6^post_27, [ 0<=1-x_6^0 && x_6^post_27==1+x_6^0 && w_5^1_1==1+w_5^0 && x_6^post_27<=2 && 2<=x_6^post_27 && w_5^1_1<=2 && 2<=w_5^1_1 && w_5^post_27==1 && Result_4^0==Result_4^post_27 ], cost: 1
      1: l2 -> l3 : Result_4^0'=Result_4^post_2, w_5^0'=w_5^post_2, x_6^0'=x_6^post_2, [ 1+x_6^0<=2 && Result_4^0==Result_4^post_2 && w_5^0==w_5^post_2 && x_6^0==x_6^post_2 ], cost: 1
      2: l2 -> l3 : Result_4^0'=Result_4^post_3, w_5^0'=w_5^post_3, x_6^0'=x_6^post_3, [ 3<=x_6^0 && Result_4^0==Result_4^post_3 && w_5^0==w_5^post_3 && x_6^0==x_6^post_3 ], cost: 1
      3: l3 -> l1 : Result_4^0'=Result_4^post_4, w_5^0'=w_5^post_4, x_6^0'=x_6^post_4, [ 1+w_5^0<=2 && Result_4^0==Result_4^post_4 && w_5^0==w_5^post_4 && x_6^0==x_6^post_4 ], cost: 1
      4: l3 -> l1 : Result_4^0'=Result_4^post_5, w_5^0'=w_5^post_5, x_6^0'=x_6^post_5, [ 3<=w_5^0 && Result_4^0==Result_4^post_5 && w_5^0==w_5^post_5 && x_6^0==x_6^post_5 ], cost: 1
      5: l1 -> l0 : Result_4^0'=Result_4^post_6, w_5^0'=w_5^post_6, x_6^0'=x_6^post_6, [ Result_4^0==Result_4^post_6 && w_5^0==w_5^post_6 && x_6^0==x_6^post_6 ], cost: 1
      7: l5 -> l6 : Result_4^0'=Result_4^post_8, w_5^0'=w_5^post_8, x_6^0'=x_6^post_8, [ 1+x_6^0<=2 && Result_4^0==Result_4^post_8 && w_5^0==w_5^post_8 && x_6^0==x_6^post_8 ], cost: 1
      8: l5 -> l6 : Result_4^0'=Result_4^post_9, w_5^0'=w_5^post_9, x_6^0'=x_6^post_9, [ 3<=x_6^0 && Result_4^0==Result_4^post_9 && w_5^0==w_5^post_9 && x_6^0==x_6^post_9 ], cost: 1
      9: l6 -> l4 : Result_4^0'=Result_4^post_10, w_5^0'=w_5^post_10, x_6^0'=x_6^post_10, [ w_5^0<=2 && 2<=w_5^0 && w_5^post_10==1 && Result_4^0==Result_4^post_10 && x_6^0==x_6^post_10 ], cost: 1
     10: l4 -> l0 : Result_4^0'=Result_4^post_11, w_5^0'=w_5^post_11, x_6^0'=x_6^post_11, [ Result_4^0==Result_4^post_11 && w_5^0==w_5^post_11 && x_6^0==x_6^post_11 ], cost: 1
     12: l8 -> l9 : Result_4^0'=Result_4^post_13, w_5^0'=w_5^post_13, x_6^0'=x_6^post_13, [ 1+x_6^0<=2 && Result_4^0==Result_4^post_13 && w_5^0==w_5^post_13 && x_6^0==x_6^post_13 ], cost: 1
     13: l8 -> l9 : Result_4^0'=Result_4^post_14, w_5^0'=w_5^post_14, x_6^0'=x_6^post_14, [ 3<=x_6^0 && Result_4^0==Result_4^post_14 && w_5^0==w_5^post_14 && x_6^0==x_6^post_14 ], cost: 1
     14: l9 -> l7 : Result_4^0'=Result_4^post_15, w_5^0'=w_5^post_15, x_6^0'=x_6^post_15, [ 1+w_5^0<=2 && Result_4^0==Result_4^post_15 && w_5^0==w_5^post_15 && x_6^0==x_6^post_15 ], cost: 1
     15: l9 -> l7 : Result_4^0'=Result_4^post_16, w_5^0'=w_5^post_16, x_6^0'=x_6^post_16, [ 3<=w_5^0 && Result_4^0==Result_4^post_16 && w_5^0==w_5^post_16 && x_6^0==x_6^post_16 ], cost: 1
     16: l7 -> l0 : Result_4^0'=Result_4^post_17, w_5^0'=w_5^post_17, x_6^0'=x_6^post_17, [ Result_4^0==Result_4^post_17 && w_5^0==w_5^post_17 && x_6^0==x_6^post_17 ], cost: 1
     18: l11 -> l12 : Result_4^0'=Result_4^post_19, w_5^0'=w_5^post_19, x_6^0'=x_6^post_19, [ 1+x_6^0<=2 && Result_4^0==Result_4^post_19 && w_5^0==w_5^post_19 && x_6^0==x_6^post_19 ], cost: 1
     19: l11 -> l12 : Result_4^0'=Result_4^post_20, w_5^0'=w_5^post_20, x_6^0'=x_6^post_20, [ 3<=x_6^0 && Result_4^0==Result_4^post_20 && w_5^0==w_5^post_20 && x_6^0==x_6^post_20 ], cost: 1
     20: l12 -> l10 : Result_4^0'=Result_4^post_21, w_5^0'=w_5^post_21, x_6^0'=x_6^post_21, [ w_5^0<=2 && 2<=w_5^0 && w_5^post_21==1 && Result_4^0==Result_4^post_21 && x_6^0==x_6^post_21 ], cost: 1
     21: l10 -> l0 : Result_4^0'=Result_4^post_22, w_5^0'=w_5^post_22, x_6^0'=x_6^post_22, [ Result_4^0==Result_4^post_22 && w_5^0==w_5^post_22 && x_6^0==x_6^post_22 ], cost: 1
     23: l14 -> l13 : Result_4^0'=Result_4^post_24, w_5^0'=w_5^post_24, x_6^0'=x_6^post_24, [ 1+w_5^0<=2 && Result_4^0==Result_4^post_24 && w_5^0==w_5^post_24 && x_6^0==x_6^post_24 ], cost: 1
     24: l14 -> l13 : Result_4^0'=Result_4^post_25, w_5^0'=w_5^post_25, x_6^0'=x_6^post_25, [ 3<=w_5^0 && Result_4^0==Result_4^post_25 && w_5^0==w_5^post_25 && x_6^0==x_6^post_25 ], cost: 1
     25: l13 -> l0 : Result_4^0'=Result_4^post_26, w_5^0'=w_5^post_26, x_6^0'=x_6^post_26, [ Result_4^0==Result_4^post_26 && w_5^0==w_5^post_26 && x_6^0==x_6^post_26 ], cost: 1
     27: l15 -> l0 : Result_4^0'=Result_4^post_28, w_5^0'=w_5^post_28, x_6^0'=x_6^post_28, [ Result_4^0==Result_4^post_28 && w_5^0==w_5^post_28 && x_6^0==x_6^post_28 ], cost: 1
     29: l17 -> l0 : Result_4^0'=Result_4^post_30, w_5^0'=w_5^post_30, x_6^0'=x_6^post_30, [ Result_4^0==Result_4^post_30 && w_5^0==w_5^post_30 && x_6^0==x_6^post_30 ], cost: 1
     30: l18 -> l17 : Result_4^0'=Result_4^post_31, w_5^0'=w_5^post_31, x_6^0'=x_6^post_31, [ Result_4^0==Result_4^post_31 && w_5^0==w_5^post_31 && x_6^0==x_6^post_31 ], cost: 1

Simplified all rules, resulting in:
   Start location: l18
      0: l0 -> l2 : w_5^0'=1+w_5^0, x_6^0'=1+x_6^0, [ 2-x_6^0<=0 && 0<=2-w_5^0 ], cost: 1
      6: l0 -> l5 : w_5^0'=1+w_5^0, x_6^0'=1+x_6^0, [ 2-x_6^0<=0 && 0<=2-w_5^0 ], cost: 1
     11: l0 -> l8 : w_5^0'=1+w_5^0, x_6^0'=1+x_6^0, [ 0<=1-x_6^0 ], cost: 1
     17: l0 -> l11 : w_5^0'=1+w_5^0, x_6^0'=1+x_6^0, [ 0<=1-x_6^0 ], cost: 1
     22: l0 -> l14 : w_5^0'=1+w_5^0, x_6^0'=1+x_6^0, [ -1+x_6^0==0 ], cost: 1
     26: l0 -> l15 : w_5^0'=1, x_6^0'=1+x_6^0, [ -1+x_6^0==0 && -1+w_5^0==0 ], cost: 1
      1: l2 -> l3 : [ 1+x_6^0<=2 ], cost: 1
      2: l2 -> l3 : [ 3<=x_6^0 ], cost: 1
      3: l3 -> l1 : [ 1+w_5^0<=2 ], cost: 1
      4: l3 -> l1 : [ 3<=w_5^0 ], cost: 1
      5: l1 -> l0 : [], cost: 1
      7: l5 -> l6 : [ 1+x_6^0<=2 ], cost: 1
      8: l5 -> l6 : [ 3<=x_6^0 ], cost: 1
      9: l6 -> l4 : w_5^0'=1, [ -2+w_5^0==0 ], cost: 1
     10: l4 -> l0 : [], cost: 1
     12: l8 -> l9 : [ 1+x_6^0<=2 ], cost: 1
     13: l8 -> l9 : [ 3<=x_6^0 ], cost: 1
     14: l9 -> l7 : [ 1+w_5^0<=2 ], cost: 1
     15: l9 -> l7 : [ 3<=w_5^0 ], cost: 1
     16: l7 -> l0 : [], cost: 1
     18: l11 -> l12 : [ 1+x_6^0<=2 ], cost: 1
     19: l11 -> l12 : [ 3<=x_6^0 ], cost: 1
     20: l12 -> l10 : w_5^0'=1, [ -2+w_5^0==0 ], cost: 1
     21: l10 -> l0 : [], cost: 1
     23: l14 -> l13 : [ 1+w_5^0<=2 ], cost: 1
     24: l14 -> l13 : [ 3<=w_5^0 ], cost: 1
     25: l13 -> l0 : [], cost: 1
     27: l15 -> l0 : [], cost: 1
     29: l17 -> l0 : [], cost: 1
     30: l18 -> l17 : [], cost: 1

### Simplification by acceleration and chaining ###

Eliminated locations (on linear paths):
   Start location: l18
      0: l0 -> l2 : w_5^0'=1+w_5^0, x_6^0'=1+x_6^0, [ 2-x_6^0<=0 && 0<=2-w_5^0 ], cost: 1
      6: l0 -> l5 : w_5^0'=1+w_5^0, x_6^0'=1+x_6^0, [ 2-x_6^0<=0 && 0<=2-w_5^0 ], cost: 1
     11: l0 -> l8 : w_5^0'=1+w_5^0, x_6^0'=1+x_6^0, [ 0<=1-x_6^0 ], cost: 1
     17: l0 -> l11 : w_5^0'=1+w_5^0, x_6^0'=1+x_6^0, [ 0<=1-x_6^0 ], cost: 1
     22: l0 -> l14 : w_5^0'=1+w_5^0, x_6^0'=1+x_6^0, [ -1+x_6^0==0 ], cost: 1
     32: l0 -> l0 : w_5^0'=1, x_6^0'=1+x_6^0, [ -1+x_6^0==0 && -1+w_5^0==0 ], cost: 2
      1: l2 -> l3 : [ 1+x_6^0<=2 ], cost: 1
      2: l2 -> l3 : [ 3<=x_6^0 ], cost: 1
      3: l3 -> l1 : [ 1+w_5^0<=2 ], cost: 1
      4: l3 -> l1 : [ 3<=w_5^0 ], cost: 1
      5: l1 -> l0 : [], cost: 1
      7: l5 -> l6 : [ 1+x_6^0<=2 ], cost: 1
      8: l5 -> l6 : [ 3<=x_6^0 ], cost: 1
     33: l6 -> l0 : w_5^0'=1, [ -2+w_5^0==0 ], cost: 2
     12: l8 -> l9 : [ 1+x_6^0<=2 ], cost: 1
     13: l8 -> l9 : [ 3<=x_6^0 ], cost: 1
     14: l9 -> l7 : [ 1+w_5^0<=2 ], cost: 1
     15: l9 -> l7 : [ 3<=w_5^0 ], cost: 1
     16: l7 -> l0 : [], cost: 1
     18: l11 -> l12 : [ 1+x_6^0<=2 ], cost: 1
     19: l11 -> l12 : [ 3<=x_6^0 ], cost: 1
     34: l12 -> l0 : w_5^0'=1, [ -2+w_5^0==0 ], cost: 2
     23: l14 -> l13 : [ 1+w_5^0<=2 ], cost: 1
     24: l14 -> l13 : [ 3<=w_5^0 ], cost: 1
     25: l13 -> l0 : [], cost: 1
     31: l18 -> l0 : [], cost: 2

Accelerating simple loops of location 0.
   Accelerating the following rules:
     32: l0 -> l0 : w_5^0'=1, x_6^0'=1+x_6^0, [ -1+x_6^0==0 && -1+w_5^0==0 ], cost: 2

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

Accelerated all simple loops using metering functions (where possible):
   Start location: l18
      0: l0 -> l2 : w_5^0'=1+w_5^0, x_6^0'=1+x_6^0, [ 2-x_6^0<=0 && 0<=2-w_5^0 ], cost: 1
      6: l0 -> l5 : w_5^0'=1+w_5^0, x_6^0'=1+x_6^0, [ 2-x_6^0<=0 && 0<=2-w_5^0 ], cost: 1
     11: l0 -> l8 : w_5^0'=1+w_5^0, x_6^0'=1+x_6^0, [ 0<=1-x_6^0 ], cost: 1
     17: l0 -> l11 : w_5^0'=1+w_5^0, x_6^0'=1+x_6^0, [ 0<=1-x_6^0 ], cost: 1
     22: l0 -> l14 : w_5^0'=1+w_5^0, x_6^0'=1+x_6^0, [ -1+x_6^0==0 ], cost: 1
     32: l0 -> l0 : w_5^0'=1, x_6^0'=1+x_6^0, [ -1+x_6^0==0 && -1+w_5^0==0 ], cost: 2
      1: l2 -> l3 : [ 1+x_6^0<=2 ], cost: 1
      2: l2 -> l3 : [ 3<=x_6^0 ], cost: 1
      3: l3 -> l1 : [ 1+w_5^0<=2 ], cost: 1
      4: l3 -> l1 : [ 3<=w_5^0 ], cost: 1
      5: l1 -> l0 : [], cost: 1
      7: l5 -> l6 : [ 1+x_6^0<=2 ], cost: 1
      8: l5 -> l6 : [ 3<=x_6^0 ], cost: 1
     33: l6 -> l0 : w_5^0'=1, [ -2+w_5^0==0 ], cost: 2
     12: l8 -> l9 : [ 1+x_6^0<=2 ], cost: 1
     13: l8 -> l9 : [ 3<=x_6^0 ], cost: 1
     14: l9 -> l7 : [ 1+w_5^0<=2 ], cost: 1
     15: l9 -> l7 : [ 3<=w_5^0 ], cost: 1
     16: l7 -> l0 : [], cost: 1
     18: l11 -> l12 : [ 1+x_6^0<=2 ], cost: 1
     19: l11 -> l12 : [ 3<=x_6^0 ], cost: 1
     34: l12 -> l0 : w_5^0'=1, [ -2+w_5^0==0 ], cost: 2
     23: l14 -> l13 : [ 1+w_5^0<=2 ], cost: 1
     24: l14 -> l13 : [ 3<=w_5^0 ], cost: 1
     25: l13 -> l0 : [], cost: 1
     31: l18 -> l0 : [], cost: 2

Chained accelerated rules (with incoming rules):
   Start location: l18
      0: l0 -> l2 : w_5^0'=1+w_5^0, x_6^0'=1+x_6^0, [ 2-x_6^0<=0 && 0<=2-w_5^0 ], cost: 1
      6: l0 -> l5 : w_5^0'=1+w_5^0, x_6^0'=1+x_6^0, [ 2-x_6^0<=0 && 0<=2-w_5^0 ], cost: 1
     11: l0 -> l8 : w_5^0'=1+w_5^0, x_6^0'=1+x_6^0, [ 0<=1-x_6^0 ], cost: 1
     17: l0 -> l11 : w_5^0'=1+w_5^0, x_6^0'=1+x_6^0, [ 0<=1-x_6^0 ], cost: 1
     22: l0 -> l14 : w_5^0'=1+w_5^0, x_6^0'=1+x_6^0, [ -1+x_6^0==0 ], cost: 1
      1: l2 -> l3 : [ 1+x_6^0<=2 ], cost: 1
      2: l2 -> l3 : [ 3<=x_6^0 ], cost: 1
      3: l3 -> l1 : [ 1+w_5^0<=2 ], cost: 1
      4: l3 -> l1 : [ 3<=w_5^0 ], cost: 1
      5: l1 -> l0 : [], cost: 1
     35: l1 -> l0 : w_5^0'=1, x_6^0'=1+x_6^0, [ -1+x_6^0==0 && -1+w_5^0==0 ], cost: 3
      7: l5 -> l6 : [ 1+x_6^0<=2 ], cost: 1
      8: l5 -> l6 : [ 3<=x_6^0 ], cost: 1
     33: l6 -> l0 : w_5^0'=1, [ -2+w_5^0==0 ], cost: 2
     39: l6 -> l0 : w_5^0'=1, x_6^0'=1+x_6^0, [ -2+w_5^0==0 && -1+x_6^0==0 ], cost: 4
     12: l8 -> l9 : [ 1+x_6^0<=2 ], cost: 1
     13: l8 -> l9 : [ 3<=x_6^0 ], cost: 1
     14: l9 -> l7 : [ 1+w_5^0<=2 ], cost: 1
     15: l9 -> l7 : [ 3<=w_5^0 ], cost: 1
     16: l7 -> l0 : [], cost: 1
     36: l7 -> l0 : w_5^0'=1, x_6^0'=1+x_6^0, [ -1+x_6^0==0 && -1+w_5^0==0 ], cost: 3
     18: l11 -> l12 : [ 1+x_6^0<=2 ], cost: 1
     19: l11 -> l12 : [ 3<=x_6^0 ], cost: 1
     34: l12 -> l0 : w_5^0'=1, [ -2+w_5^0==0 ], cost: 2
     40: l12 -> l0 : w_5^0'=1, x_6^0'=1+x_6^0, [ -2+w_5^0==0 && -1+x_6^0==0 ], cost: 4
     23: l14 -> l13 : [ 1+w_5^0<=2 ], cost: 1
     24: l14 -> l13 : [ 3<=w_5^0 ], cost: 1
     25: l13 -> l0 : [], cost: 1
     37: l13 -> l0 : w_5^0'=1, x_6^0'=1+x_6^0, [ -1+x_6^0==0 && -1+w_5^0==0 ], cost: 3
     31: l18 -> l0 : [], cost: 2
     38: l18 -> l0 : w_5^0'=1, x_6^0'=1+x_6^0, [ -1+x_6^0==0 && -1+w_5^0==0 ], cost: 4

Eliminated locations (on tree-shaped paths):
   Start location: l18
     41: l0 -> l3 : w_5^0'=1+w_5^0, x_6^0'=1+x_6^0, [ 2-x_6^0<=0 && 0<=2-w_5^0 ], cost: 2
     42: l0 -> l6 : w_5^0'=1+w_5^0, x_6^0'=1+x_6^0, [ 2-x_6^0<=0 && 0<=2-w_5^0 ], cost: 2
     43: l0 -> l9 : w_5^0'=1+w_5^0, x_6^0'=1+x_6^0, [ 2+x_6^0<=2 ], cost: 2
     44: l0 -> l12 : w_5^0'=1+w_5^0, x_6^0'=1+x_6^0, [ 2+x_6^0<=2 ], cost: 2
     45: l0 -> l13 : w_5^0'=1+w_5^0, x_6^0'=1+x_6^0, [ -1+x_6^0==0 && 2+w_5^0<=2 ], cost: 2
     46: l0 -> l13 : w_5^0'=1+w_5^0, x_6^0'=1+x_6^0, [ -1+x_6^0==0 && 3<=1+w_5^0 ], cost: 2
     47: l3 -> l0 : [ 1+w_5^0<=2 ], cost: 2
     48: l3 -> l0 : w_5^0'=1, x_6^0'=1+x_6^0, [ -1+x_6^0==0 && -1+w_5^0==0 ], cost: 4
     49: l3 -> l0 : [ 3<=w_5^0 ], cost: 2
     33: l6 -> l0 : w_5^0'=1, [ -2+w_5^0==0 ], cost: 2
     39: l6 -> l0 : w_5^0'=1, x_6^0'=1+x_6^0, [ -2+w_5^0==0 && -1+x_6^0==0 ], cost: 4
     50: l9 -> l0 : [ 1+w_5^0<=2 ], cost: 2
     51: l9 -> l0 : w_5^0'=1, x_6^0'=1+x_6^0, [ -1+x_6^0==0 && -1+w_5^0==0 ], cost: 4
     52: l9 -> l0 : [ 3<=w_5^0 ], cost: 2
     34: l12 -> l0 : w_5^0'=1, [ -2+w_5^0==0 ], cost: 2
     40: l12 -> l0 : w_5^0'=1, x_6^0'=1+x_6^0, [ -2+w_5^0==0 && -1+x_6^0==0 ], cost: 4
     25: l13 -> l0 : [], cost: 1
     37: l13 -> l0 : w_5^0'=1, x_6^0'=1+x_6^0, [ -1+x_6^0==0 && -1+w_5^0==0 ], cost: 3
     31: l18 -> l0 : [], cost: 2
     38: l18 -> l0 : w_5^0'=1, x_6^0'=1+x_6^0, [ -1+x_6^0==0 && -1+w_5^0==0 ], cost: 4

Eliminated locations (on tree-shaped paths):
   Start location: l18
     53: l0 -> l0 : w_5^0'=1+w_5^0, x_6^0'=1+x_6^0, [ 2-x_6^0<=0 && 2+w_5^0<=2 ], cost: 4
     54: l0 -> l0 : w_5^0'=1+w_5^0, x_6^0'=1+x_6^0, [ 2-x_6^0<=0 && 0<=2-w_5^0 && 3<=1+w_5^0 ], cost: 4
     55: l0 -> l0 : w_5^0'=1, x_6^0'=1+x_6^0, [ 2-x_6^0<=0 && -1+w_5^0==0 ], cost: 4
     56: l0 -> l0 : w_5^0'=1+w_5^0, x_6^0'=1+x_6^0, [ 2+x_6^0<=2 && 2+w_5^0<=2 ], cost: 4
     57: l0 -> l0 : w_5^0'=1, x_6^0'=2+x_6^0, [ x_6^0==0 && w_5^0==0 ], cost: 6
     58: l0 -> l0 : w_5^0'=1+w_5^0, x_6^0'=1+x_6^0, [ 2+x_6^0<=2 && 3<=1+w_5^0 ], cost: 4
     59: l0 -> l0 : w_5^0'=1, x_6^0'=1+x_6^0, [ 2+x_6^0<=2 && -1+w_5^0==0 ], cost: 4
     60: l0 -> l0 : w_5^0'=1, x_6^0'=2+x_6^0, [ -1+w_5^0==0 && x_6^0==0 ], cost: 6
     61: l0 -> l0 : w_5^0'=1+w_5^0, x_6^0'=1+x_6^0, [ -1+x_6^0==0 && 2+w_5^0<=2 ], cost: 3
     62: l0 -> l0 : w_5^0'=1+w_5^0, x_6^0'=1+x_6^0, [ -1+x_6^0==0 && 3<=1+w_5^0 ], cost: 3
     31: l18 -> l0 : [], cost: 2
     38: l18 -> l0 : w_5^0'=1, x_6^0'=1+x_6^0, [ -1+x_6^0==0 && -1+w_5^0==0 ], cost: 4

Applied pruning (of leafs and parallel rules):
   Start location: l18
     53: l0 -> l0 : w_5^0'=1+w_5^0, x_6^0'=1+x_6^0, [ 2-x_6^0<=0 && 2+w_5^0<=2 ], cost: 4
     54: l0 -> l0 : w_5^0'=1+w_5^0, x_6^0'=1+x_6^0, [ 2-x_6^0<=0 && 0<=2-w_5^0 && 3<=1+w_5^0 ], cost: 4
     56: l0 -> l0 : w_5^0'=1+w_5^0, x_6^0'=1+x_6^0, [ 2+x_6^0<=2 && 2+w_5^0<=2 ], cost: 4
     57: l0 -> l0 : w_5^0'=1, x_6^0'=2+x_6^0, [ x_6^0==0 && w_5^0==0 ], cost: 6
     58: l0 -> l0 : w_5^0'=1+w_5^0, x_6^0'=1+x_6^0, [ 2+x_6^0<=2 && 3<=1+w_5^0 ], cost: 4
     31: l18 -> l0 : [], cost: 2
     38: l18 -> l0 : w_5^0'=1, x_6^0'=1+x_6^0, [ -1+x_6^0==0 && -1+w_5^0==0 ], cost: 4

Accelerating simple loops of location 0.
   Simplified some of the simple loops (and removed duplicate rules).
   Accelerating the following rules:
     53: l0 -> l0 : w_5^0'=1+w_5^0, x_6^0'=1+x_6^0, [ 2-x_6^0<=0 && 2+w_5^0<=2 ], cost: 4
     54: l0 -> l0 : w_5^0'=1+w_5^0, x_6^0'=1+x_6^0, [ 2-x_6^0<=0 && -2+w_5^0==0 ], cost: 4
     56: l0 -> l0 : w_5^0'=1+w_5^0, x_6^0'=1+x_6^0, [ 2+x_6^0<=2 && 2+w_5^0<=2 ], cost: 4
     57: l0 -> l0 : w_5^0'=1, x_6^0'=2+x_6^0, [ x_6^0==0 && w_5^0==0 ], cost: 6
     58: l0 -> l0 : w_5^0'=1+w_5^0, x_6^0'=1+x_6^0, [ 2+x_6^0<=2 && 3<=1+w_5^0 ], cost: 4

   Accelerated rule 53 with backward acceleration, yielding the new rule 63.
   Failed to prove monotonicity of the guard of rule 54.
   Accelerated rule 56 with backward acceleration, yielding the new rule 64.
   Accelerated rule 56 with backward acceleration, yielding the new rule 65.
   Failed to prove monotonicity of the guard of rule 57.
   Accelerated rule 58 with backward acceleration, yielding the new rule 66.
[accelerate] Nesting with 6 inner and 5 outer candidates
   Removing the simple loops: 53 56 58.

Accelerated all simple loops using metering functions (where possible):
   Start location: l18
     54: l0 -> l0 : w_5^0'=1+w_5^0, x_6^0'=1+x_6^0, [ 2-x_6^0<=0 && -2+w_5^0==0 ], cost: 4
     57: l0 -> l0 : w_5^0'=1, x_6^0'=2+x_6^0, [ x_6^0==0 && w_5^0==0 ], cost: 6
     63: l0 -> l0 : w_5^0'=1, x_6^0'=1-w_5^0+x_6^0, [ 2-x_6^0<=0 && 1-w_5^0>=0 ], cost: 4-4*w_5^0
     64: l0 -> l0 : w_5^0'=1+w_5^0-x_6^0, x_6^0'=1, [ 1-x_6^0>=0 && 2+w_5^0-x_6^0<=2 ], cost: 4-4*x_6^0
     65: l0 -> l0 : w_5^0'=1, x_6^0'=1-w_5^0+x_6^0, [ 1-w_5^0>=0 && 2-w_5^0+x_6^0<=2 ], cost: 4-4*w_5^0
     66: l0 -> l0 : w_5^0'=1+w_5^0-x_6^0, x_6^0'=1, [ 3<=1+w_5^0 && 1-x_6^0>=0 ], cost: 4-4*x_6^0
     31: l18 -> l0 : [], cost: 2
     38: l18 -> l0 : w_5^0'=1, x_6^0'=1+x_6^0, [ -1+x_6^0==0 && -1+w_5^0==0 ], cost: 4

Chained accelerated rules (with incoming rules):
   Start location: l18
     31: l18 -> l0 : [], cost: 2
     38: l18 -> l0 : w_5^0'=1, x_6^0'=1+x_6^0, [ -1+x_6^0==0 && -1+w_5^0==0 ], cost: 4
     67: l18 -> l0 : w_5^0'=1+w_5^0, x_6^0'=1+x_6^0, [ 2-x_6^0<=0 && -2+w_5^0==0 ], cost: 6
     68: l18 -> l0 : w_5^0'=1, x_6^0'=2+x_6^0, [ x_6^0==0 && w_5^0==0 ], cost: 8
     69: l18 -> l0 : w_5^0'=1, x_6^0'=1-w_5^0+x_6^0, [ 2-x_6^0<=0 && 1-w_5^0>=0 ], cost: 6-4*w_5^0
     70: l18 -> l0 : w_5^0'=1, x_6^0'=1+x_6^0, [ -1+x_6^0==0 && -1+w_5^0==0 ], cost: 4
     71: l18 -> l0 : w_5^0'=1+w_5^0-x_6^0, x_6^0'=1, [ 1-x_6^0>=0 && 2+w_5^0-x_6^0<=2 ], cost: 6-4*x_6^0
     72: l18 -> l0 : w_5^0'=1, x_6^0'=1-w_5^0+x_6^0, [ 1-w_5^0>=0 && 2-w_5^0+x_6^0<=2 ], cost: 6-4*w_5^0
     73: l18 -> l0 : w_5^0'=1+w_5^0-x_6^0, x_6^0'=1, [ 3<=1+w_5^0 && 1-x_6^0>=0 ], cost: 6-4*x_6^0

Removed unreachable locations (and leaf rules with constant cost):
   Start location: l18
     69: l18 -> l0 : w_5^0'=1, x_6^0'=1-w_5^0+x_6^0, [ 2-x_6^0<=0 && 1-w_5^0>=0 ], cost: 6-4*w_5^0
     71: l18 -> l0 : w_5^0'=1+w_5^0-x_6^0, x_6^0'=1, [ 1-x_6^0>=0 && 2+w_5^0-x_6^0<=2 ], cost: 6-4*x_6^0
     72: l18 -> l0 : w_5^0'=1, x_6^0'=1-w_5^0+x_6^0, [ 1-w_5^0>=0 && 2-w_5^0+x_6^0<=2 ], cost: 6-4*w_5^0
     73: l18 -> l0 : w_5^0'=1+w_5^0-x_6^0, x_6^0'=1, [ 3<=1+w_5^0 && 1-x_6^0>=0 ], cost: 6-4*x_6^0

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: l18
     69: l18 -> l0 : w_5^0'=1, x_6^0'=1-w_5^0+x_6^0, [ 2-x_6^0<=0 && 1-w_5^0>=0 ], cost: 6-4*w_5^0
     71: l18 -> l0 : w_5^0'=1+w_5^0-x_6^0, x_6^0'=1, [ 1-x_6^0>=0 && 2+w_5^0-x_6^0<=2 ], cost: 6-4*x_6^0
     72: l18 -> l0 : w_5^0'=1, x_6^0'=1-w_5^0+x_6^0, [ 1-w_5^0>=0 && 2-w_5^0+x_6^0<=2 ], cost: 6-4*w_5^0
     73: l18 -> l0 : w_5^0'=1+w_5^0-x_6^0, x_6^0'=1, [ 3<=1+w_5^0 && 1-x_6^0>=0 ], cost: 6-4*x_6^0

Computing asymptotic complexity for rule 69
   Resulting cost 0 has complexity: Unknown

Computing asymptotic complexity for rule 71
   Resulting cost 0 has complexity: Unknown

Computing asymptotic complexity for rule 72
   Resulting cost 0 has complexity: Unknown

Computing asymptotic complexity for rule 73
   Resulting cost 0 has complexity: Unknown

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:  [ Result_4^0==Result_4^post_31 && w_5^0==w_5^post_31 && x_6^0==x_6^post_31 ]

WORST_CASE(Omega(1),?)