NO

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

Initial linear ITS problem
   Start location: l10
      0: l0 -> l1 : IsochResourceData^0'=IsochResourceData^post_1, ResourceIrp^0'=ResourceIrp^post_1, StackSize^0'=StackSize^post_1, ___rho_99_^0'=___rho_99_^post_1, k4^0'=k4^post_1, keA^0'=keA^post_1, keR^0'=keR^post_1, ntStatus^0'=ntStatus^post_1, pIrb^0'=pIrb^post_1, [ IsochResourceData^0==IsochResourceData^post_1 && ResourceIrp^0==ResourceIrp^post_1 && StackSize^0==StackSize^post_1 && ___rho_99_^0==___rho_99_^post_1 && k4^0==k4^post_1 && keA^0==keA^post_1 && keR^0==keR^post_1 && ntStatus^0==ntStatus^post_1 && pIrb^0==pIrb^post_1 ], cost: 1
      1: l1 -> l0 : IsochResourceData^0'=IsochResourceData^post_2, ResourceIrp^0'=ResourceIrp^post_2, StackSize^0'=StackSize^post_2, ___rho_99_^0'=___rho_99_^post_2, k4^0'=k4^post_2, keA^0'=keA^post_2, keR^0'=keR^post_2, ntStatus^0'=ntStatus^post_2, pIrb^0'=pIrb^post_2, [ IsochResourceData^0==IsochResourceData^post_2 && ResourceIrp^0==ResourceIrp^post_2 && StackSize^0==StackSize^post_2 && ___rho_99_^0==___rho_99_^post_2 && k4^0==k4^post_2 && keA^0==keA^post_2 && keR^0==keR^post_2 && ntStatus^0==ntStatus^post_2 && pIrb^0==pIrb^post_2 ], cost: 1
      2: l2 -> l3 : IsochResourceData^0'=IsochResourceData^post_3, ResourceIrp^0'=ResourceIrp^post_3, StackSize^0'=StackSize^post_3, ___rho_99_^0'=___rho_99_^post_3, k4^0'=k4^post_3, keA^0'=keA^post_3, keR^0'=keR^post_3, ntStatus^0'=ntStatus^post_3, pIrb^0'=pIrb^post_3, [ IsochResourceData^0==IsochResourceData^post_3 && ResourceIrp^0==ResourceIrp^post_3 && StackSize^0==StackSize^post_3 && ___rho_99_^0==___rho_99_^post_3 && k4^0==k4^post_3 && keA^0==keA^post_3 && keR^0==keR^post_3 && ntStatus^0==ntStatus^post_3 && pIrb^0==pIrb^post_3 ], cost: 1
     13: l3 -> l8 : IsochResourceData^0'=IsochResourceData^post_14, ResourceIrp^0'=ResourceIrp^post_14, StackSize^0'=StackSize^post_14, ___rho_99_^0'=___rho_99_^post_14, k4^0'=k4^post_14, keA^0'=keA^post_14, keR^0'=keR^post_14, ntStatus^0'=ntStatus^post_14, pIrb^0'=pIrb^post_14, [ keA^1_1==1 && keA^post_14==0 && IsochResourceData^0==IsochResourceData^post_14 && ResourceIrp^0==ResourceIrp^post_14 && StackSize^0==StackSize^post_14 && ___rho_99_^0==___rho_99_^post_14 && k4^0==k4^post_14 && keR^0==keR^post_14 && ntStatus^0==ntStatus^post_14 && pIrb^0==pIrb^post_14 ], cost: 1
      3: l4 -> l2 : IsochResourceData^0'=IsochResourceData^post_4, ResourceIrp^0'=ResourceIrp^post_4, StackSize^0'=StackSize^post_4, ___rho_99_^0'=___rho_99_^post_4, k4^0'=k4^post_4, keA^0'=keA^post_4, keR^0'=keR^post_4, ntStatus^0'=ntStatus^post_4, pIrb^0'=pIrb^post_4, [ 1<=pIrb^0 && ntStatus^post_4==ntStatus^post_4 && IsochResourceData^0==IsochResourceData^post_4 && ResourceIrp^0==ResourceIrp^post_4 && StackSize^0==StackSize^post_4 && ___rho_99_^0==___rho_99_^post_4 && k4^0==k4^post_4 && keA^0==keA^post_4 && keR^0==keR^post_4 && pIrb^0==pIrb^post_4 ], cost: 1
      4: l4 -> l2 : IsochResourceData^0'=IsochResourceData^post_5, ResourceIrp^0'=ResourceIrp^post_5, StackSize^0'=StackSize^post_5, ___rho_99_^0'=___rho_99_^post_5, k4^0'=k4^post_5, keA^0'=keA^post_5, keR^0'=keR^post_5, ntStatus^0'=ntStatus^post_5, pIrb^0'=pIrb^post_5, [ pIrb^0<=0 && IsochResourceData^0==IsochResourceData^post_5 && ResourceIrp^0==ResourceIrp^post_5 && StackSize^0==StackSize^post_5 && ___rho_99_^0==___rho_99_^post_5 && k4^0==k4^post_5 && keA^0==keA^post_5 && keR^0==keR^post_5 && ntStatus^0==ntStatus^post_5 && pIrb^0==pIrb^post_5 ], cost: 1
      5: l5 -> l4 : IsochResourceData^0'=IsochResourceData^post_6, ResourceIrp^0'=ResourceIrp^post_6, StackSize^0'=StackSize^post_6, ___rho_99_^0'=___rho_99_^post_6, k4^0'=k4^post_6, keA^0'=keA^post_6, keR^0'=keR^post_6, ntStatus^0'=ntStatus^post_6, pIrb^0'=pIrb^post_6, [ pIrb^post_6==pIrb^post_6 && IsochResourceData^0==IsochResourceData^post_6 && ResourceIrp^0==ResourceIrp^post_6 && StackSize^0==StackSize^post_6 && ___rho_99_^0==___rho_99_^post_6 && k4^0==k4^post_6 && keA^0==keA^post_6 && keR^0==keR^post_6 && ntStatus^0==ntStatus^post_6 ], cost: 1
      6: l6 -> l5 : IsochResourceData^0'=IsochResourceData^post_7, ResourceIrp^0'=ResourceIrp^post_7, StackSize^0'=StackSize^post_7, ___rho_99_^0'=___rho_99_^post_7, k4^0'=k4^post_7, keA^0'=keA^post_7, keR^0'=keR^post_7, ntStatus^0'=ntStatus^post_7, pIrb^0'=pIrb^post_7, [ 1+ResourceIrp^0<=0 && IsochResourceData^0==IsochResourceData^post_7 && ResourceIrp^0==ResourceIrp^post_7 && StackSize^0==StackSize^post_7 && ___rho_99_^0==___rho_99_^post_7 && k4^0==k4^post_7 && keA^0==keA^post_7 && keR^0==keR^post_7 && ntStatus^0==ntStatus^post_7 && pIrb^0==pIrb^post_7 ], cost: 1
      7: l6 -> l5 : IsochResourceData^0'=IsochResourceData^post_8, ResourceIrp^0'=ResourceIrp^post_8, StackSize^0'=StackSize^post_8, ___rho_99_^0'=___rho_99_^post_8, k4^0'=k4^post_8, keA^0'=keA^post_8, keR^0'=keR^post_8, ntStatus^0'=ntStatus^post_8, pIrb^0'=pIrb^post_8, [ 1<=ResourceIrp^0 && IsochResourceData^0==IsochResourceData^post_8 && ResourceIrp^0==ResourceIrp^post_8 && StackSize^0==StackSize^post_8 && ___rho_99_^0==___rho_99_^post_8 && k4^0==k4^post_8 && keA^0==keA^post_8 && keR^0==keR^post_8 && ntStatus^0==ntStatus^post_8 && pIrb^0==pIrb^post_8 ], cost: 1
      8: l6 -> l2 : IsochResourceData^0'=IsochResourceData^post_9, ResourceIrp^0'=ResourceIrp^post_9, StackSize^0'=StackSize^post_9, ___rho_99_^0'=___rho_99_^post_9, k4^0'=k4^post_9, keA^0'=keA^post_9, keR^0'=keR^post_9, ntStatus^0'=ntStatus^post_9, pIrb^0'=pIrb^post_9, [ ResourceIrp^0<=0 && 0<=ResourceIrp^0 && IsochResourceData^0==IsochResourceData^post_9 && ResourceIrp^0==ResourceIrp^post_9 && StackSize^0==StackSize^post_9 && ___rho_99_^0==___rho_99_^post_9 && k4^0==k4^post_9 && keA^0==keA^post_9 && keR^0==keR^post_9 && ntStatus^0==ntStatus^post_9 && pIrb^0==pIrb^post_9 ], cost: 1
      9: l7 -> l2 : IsochResourceData^0'=IsochResourceData^post_10, ResourceIrp^0'=ResourceIrp^post_10, StackSize^0'=StackSize^post_10, ___rho_99_^0'=___rho_99_^post_10, k4^0'=k4^post_10, keA^0'=keA^post_10, keR^0'=keR^post_10, ntStatus^0'=ntStatus^post_10, pIrb^0'=pIrb^post_10, [ IsochResourceData^0<=0 && IsochResourceData^0==IsochResourceData^post_10 && ResourceIrp^0==ResourceIrp^post_10 && StackSize^0==StackSize^post_10 && ___rho_99_^0==___rho_99_^post_10 && k4^0==k4^post_10 && keA^0==keA^post_10 && keR^0==keR^post_10 && ntStatus^0==ntStatus^post_10 && pIrb^0==pIrb^post_10 ], cost: 1
     10: l7 -> l6 : IsochResourceData^0'=IsochResourceData^post_11, ResourceIrp^0'=ResourceIrp^post_11, StackSize^0'=StackSize^post_11, ___rho_99_^0'=___rho_99_^post_11, k4^0'=k4^post_11, keA^0'=keA^post_11, keR^0'=keR^post_11, ntStatus^0'=ntStatus^post_11, pIrb^0'=pIrb^post_11, [ 1<=IsochResourceData^0 && ResourceIrp^1_1==ResourceIrp^1_1 && StackSize^post_11==StackSize^post_11 && ___rho_99_^post_11==___rho_99_^post_11 && ResourceIrp^post_11==___rho_99_^post_11 && IsochResourceData^0==IsochResourceData^post_11 && k4^0==k4^post_11 && keA^0==keA^post_11 && keR^0==keR^post_11 && ntStatus^0==ntStatus^post_11 && pIrb^0==pIrb^post_11 ], cost: 1
     11: l8 -> l0 : IsochResourceData^0'=IsochResourceData^post_12, ResourceIrp^0'=ResourceIrp^post_12, StackSize^0'=StackSize^post_12, ___rho_99_^0'=___rho_99_^post_12, k4^0'=k4^post_12, keA^0'=keA^post_12, keR^0'=keR^post_12, ntStatus^0'=ntStatus^post_12, pIrb^0'=pIrb^post_12, [ k4^0<=0 && keR^1_1==1 && keR^post_12==0 && IsochResourceData^0==IsochResourceData^post_12 && ResourceIrp^0==ResourceIrp^post_12 && StackSize^0==StackSize^post_12 && ___rho_99_^0==___rho_99_^post_12 && k4^0==k4^post_12 && keA^0==keA^post_12 && ntStatus^0==ntStatus^post_12 && pIrb^0==pIrb^post_12 ], cost: 1
     12: l8 -> l7 : IsochResourceData^0'=IsochResourceData^post_13, ResourceIrp^0'=ResourceIrp^post_13, StackSize^0'=StackSize^post_13, ___rho_99_^0'=___rho_99_^post_13, k4^0'=k4^post_13, keA^0'=keA^post_13, keR^0'=keR^post_13, ntStatus^0'=ntStatus^post_13, pIrb^0'=pIrb^post_13, [ 1<=k4^0 && k4^post_13==-1+k4^0 && keR^1_2==1 && keR^post_13==0 && IsochResourceData^0==IsochResourceData^post_13 && ResourceIrp^0==ResourceIrp^post_13 && StackSize^0==StackSize^post_13 && ___rho_99_^0==___rho_99_^post_13 && keA^0==keA^post_13 && ntStatus^0==ntStatus^post_13 && pIrb^0==pIrb^post_13 ], cost: 1
     14: l9 -> l3 : IsochResourceData^0'=IsochResourceData^post_15, ResourceIrp^0'=ResourceIrp^post_15, StackSize^0'=StackSize^post_15, ___rho_99_^0'=___rho_99_^post_15, k4^0'=k4^post_15, keA^0'=keA^post_15, keR^0'=keR^post_15, ntStatus^0'=ntStatus^post_15, pIrb^0'=pIrb^post_15, [ keA^post_15==0 && keR^post_15==0 && IsochResourceData^0==IsochResourceData^post_15 && ResourceIrp^0==ResourceIrp^post_15 && StackSize^0==StackSize^post_15 && ___rho_99_^0==___rho_99_^post_15 && k4^0==k4^post_15 && ntStatus^0==ntStatus^post_15 && pIrb^0==pIrb^post_15 ], cost: 1
     15: l10 -> l9 : IsochResourceData^0'=IsochResourceData^post_16, ResourceIrp^0'=ResourceIrp^post_16, StackSize^0'=StackSize^post_16, ___rho_99_^0'=___rho_99_^post_16, k4^0'=k4^post_16, keA^0'=keA^post_16, keR^0'=keR^post_16, ntStatus^0'=ntStatus^post_16, pIrb^0'=pIrb^post_16, [ IsochResourceData^0==IsochResourceData^post_16 && ResourceIrp^0==ResourceIrp^post_16 && StackSize^0==StackSize^post_16 && ___rho_99_^0==___rho_99_^post_16 && k4^0==k4^post_16 && keA^0==keA^post_16 && keR^0==keR^post_16 && ntStatus^0==ntStatus^post_16 && pIrb^0==pIrb^post_16 ], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
     15: l10 -> l9 : IsochResourceData^0'=IsochResourceData^post_16, ResourceIrp^0'=ResourceIrp^post_16, StackSize^0'=StackSize^post_16, ___rho_99_^0'=___rho_99_^post_16, k4^0'=k4^post_16, keA^0'=keA^post_16, keR^0'=keR^post_16, ntStatus^0'=ntStatus^post_16, pIrb^0'=pIrb^post_16, [ IsochResourceData^0==IsochResourceData^post_16 && ResourceIrp^0==ResourceIrp^post_16 && StackSize^0==StackSize^post_16 && ___rho_99_^0==___rho_99_^post_16 && k4^0==k4^post_16 && keA^0==keA^post_16 && keR^0==keR^post_16 && ntStatus^0==ntStatus^post_16 && pIrb^0==pIrb^post_16 ], cost: 1

Simplified all rules, resulting in:
   Start location: l10
      0: l0 -> l1 : [], cost: 1
      1: l1 -> l0 : [], cost: 1
      2: l2 -> l3 : [], cost: 1
     13: l3 -> l8 : keA^0'=0, [], cost: 1
      3: l4 -> l2 : ntStatus^0'=ntStatus^post_4, [ 1<=pIrb^0 ], cost: 1
      4: l4 -> l2 : [ pIrb^0<=0 ], cost: 1
      5: l5 -> l4 : pIrb^0'=pIrb^post_6, [], cost: 1
      6: l6 -> l5 : [ 1+ResourceIrp^0<=0 ], cost: 1
      7: l6 -> l5 : [ 1<=ResourceIrp^0 ], cost: 1
      8: l6 -> l2 : [ ResourceIrp^0==0 ], cost: 1
      9: l7 -> l2 : [ IsochResourceData^0<=0 ], cost: 1
     10: l7 -> l6 : ResourceIrp^0'=___rho_99_^post_11, StackSize^0'=StackSize^post_11, ___rho_99_^0'=___rho_99_^post_11, [ 1<=IsochResourceData^0 ], cost: 1
     11: l8 -> l0 : keR^0'=0, [ k4^0<=0 ], cost: 1
     12: l8 -> l7 : k4^0'=-1+k4^0, keR^0'=0, [ 1<=k4^0 ], cost: 1
     14: l9 -> l3 : keA^0'=0, keR^0'=0, [], cost: 1
     15: l10 -> l9 : [], cost: 1

### Simplification by acceleration and chaining ###

Eliminated locations (on linear paths):
   Start location: l10
     17: l0 -> l0 : [], cost: 2
      2: l2 -> l3 : [], cost: 1
     13: l3 -> l8 : keA^0'=0, [], cost: 1
      3: l4 -> l2 : ntStatus^0'=ntStatus^post_4, [ 1<=pIrb^0 ], cost: 1
      4: l4 -> l2 : [ pIrb^0<=0 ], cost: 1
      5: l5 -> l4 : pIrb^0'=pIrb^post_6, [], cost: 1
      6: l6 -> l5 : [ 1+ResourceIrp^0<=0 ], cost: 1
      7: l6 -> l5 : [ 1<=ResourceIrp^0 ], cost: 1
      8: l6 -> l2 : [ ResourceIrp^0==0 ], cost: 1
      9: l7 -> l2 : [ IsochResourceData^0<=0 ], cost: 1
     10: l7 -> l6 : ResourceIrp^0'=___rho_99_^post_11, StackSize^0'=StackSize^post_11, ___rho_99_^0'=___rho_99_^post_11, [ 1<=IsochResourceData^0 ], cost: 1
     11: l8 -> l0 : keR^0'=0, [ k4^0<=0 ], cost: 1
     12: l8 -> l7 : k4^0'=-1+k4^0, keR^0'=0, [ 1<=k4^0 ], cost: 1
     16: l10 -> l3 : keA^0'=0, keR^0'=0, [], cost: 2

Accelerating simple loops of location 0.
   Accelerating the following rules:
     17: l0 -> l0 : [], cost: 2

   Accelerated rule 17 with non-termination, yielding the new rule 18.
[accelerate] Nesting with 0 inner and 0 outer candidates
   Removing the simple loops: 17.

Accelerated all simple loops using metering functions (where possible):
   Start location: l10
     18: l0 -> [11] : [], cost: NONTERM
      2: l2 -> l3 : [], cost: 1
     13: l3 -> l8 : keA^0'=0, [], cost: 1
      3: l4 -> l2 : ntStatus^0'=ntStatus^post_4, [ 1<=pIrb^0 ], cost: 1
      4: l4 -> l2 : [ pIrb^0<=0 ], cost: 1
      5: l5 -> l4 : pIrb^0'=pIrb^post_6, [], cost: 1
      6: l6 -> l5 : [ 1+ResourceIrp^0<=0 ], cost: 1
      7: l6 -> l5 : [ 1<=ResourceIrp^0 ], cost: 1
      8: l6 -> l2 : [ ResourceIrp^0==0 ], cost: 1
      9: l7 -> l2 : [ IsochResourceData^0<=0 ], cost: 1
     10: l7 -> l6 : ResourceIrp^0'=___rho_99_^post_11, StackSize^0'=StackSize^post_11, ___rho_99_^0'=___rho_99_^post_11, [ 1<=IsochResourceData^0 ], cost: 1
     11: l8 -> l0 : keR^0'=0, [ k4^0<=0 ], cost: 1
     12: l8 -> l7 : k4^0'=-1+k4^0, keR^0'=0, [ 1<=k4^0 ], cost: 1
     16: l10 -> l3 : keA^0'=0, keR^0'=0, [], cost: 2

Chained accelerated rules (with incoming rules):
   Start location: l10
      2: l2 -> l3 : [], cost: 1
     13: l3 -> l8 : keA^0'=0, [], cost: 1
      3: l4 -> l2 : ntStatus^0'=ntStatus^post_4, [ 1<=pIrb^0 ], cost: 1
      4: l4 -> l2 : [ pIrb^0<=0 ], cost: 1
      5: l5 -> l4 : pIrb^0'=pIrb^post_6, [], cost: 1
      6: l6 -> l5 : [ 1+ResourceIrp^0<=0 ], cost: 1
      7: l6 -> l5 : [ 1<=ResourceIrp^0 ], cost: 1
      8: l6 -> l2 : [ ResourceIrp^0==0 ], cost: 1
      9: l7 -> l2 : [ IsochResourceData^0<=0 ], cost: 1
     10: l7 -> l6 : ResourceIrp^0'=___rho_99_^post_11, StackSize^0'=StackSize^post_11, ___rho_99_^0'=___rho_99_^post_11, [ 1<=IsochResourceData^0 ], cost: 1
     11: l8 -> l0 : keR^0'=0, [ k4^0<=0 ], cost: 1
     12: l8 -> l7 : k4^0'=-1+k4^0, keR^0'=0, [ 1<=k4^0 ], cost: 1
     19: l8 -> [11] : [ k4^0<=0 ], cost: NONTERM
     16: l10 -> l3 : keA^0'=0, keR^0'=0, [], cost: 2

Removed unreachable locations (and leaf rules with constant cost):
   Start location: l10
      2: l2 -> l3 : [], cost: 1
     13: l3 -> l8 : keA^0'=0, [], cost: 1
      3: l4 -> l2 : ntStatus^0'=ntStatus^post_4, [ 1<=pIrb^0 ], cost: 1
      4: l4 -> l2 : [ pIrb^0<=0 ], cost: 1
      5: l5 -> l4 : pIrb^0'=pIrb^post_6, [], cost: 1
      6: l6 -> l5 : [ 1+ResourceIrp^0<=0 ], cost: 1
      7: l6 -> l5 : [ 1<=ResourceIrp^0 ], cost: 1
      8: l6 -> l2 : [ ResourceIrp^0==0 ], cost: 1
      9: l7 -> l2 : [ IsochResourceData^0<=0 ], cost: 1
     10: l7 -> l6 : ResourceIrp^0'=___rho_99_^post_11, StackSize^0'=StackSize^post_11, ___rho_99_^0'=___rho_99_^post_11, [ 1<=IsochResourceData^0 ], cost: 1
     12: l8 -> l7 : k4^0'=-1+k4^0, keR^0'=0, [ 1<=k4^0 ], cost: 1
     19: l8 -> [11] : [ k4^0<=0 ], cost: NONTERM
     16: l10 -> l3 : keA^0'=0, keR^0'=0, [], cost: 2

Eliminated locations (on tree-shaped paths):
   Start location: l10
      2: l2 -> l3 : [], cost: 1
     20: l3 -> l7 : k4^0'=-1+k4^0, keA^0'=0, keR^0'=0, [ 1<=k4^0 ], cost: 2
     21: l3 -> [11] : [ k4^0<=0 ], cost: NONTERM
     25: l5 -> l2 : ntStatus^0'=ntStatus^post_4, pIrb^0'=pIrb^post_6, [ 1<=pIrb^post_6 ], cost: 2
     26: l5 -> l2 : pIrb^0'=pIrb^post_6, [ pIrb^post_6<=0 ], cost: 2
      9: l7 -> l2 : [ IsochResourceData^0<=0 ], cost: 1
     22: l7 -> l5 : ResourceIrp^0'=___rho_99_^post_11, StackSize^0'=StackSize^post_11, ___rho_99_^0'=___rho_99_^post_11, [ 1<=IsochResourceData^0 && 1+___rho_99_^post_11<=0 ], cost: 2
     23: l7 -> l5 : ResourceIrp^0'=___rho_99_^post_11, StackSize^0'=StackSize^post_11, ___rho_99_^0'=___rho_99_^post_11, [ 1<=IsochResourceData^0 && 1<=___rho_99_^post_11 ], cost: 2
     24: l7 -> l2 : ResourceIrp^0'=___rho_99_^post_11, StackSize^0'=StackSize^post_11, ___rho_99_^0'=___rho_99_^post_11, [ 1<=IsochResourceData^0 && ___rho_99_^post_11==0 ], cost: 2
     16: l10 -> l3 : keA^0'=0, keR^0'=0, [], cost: 2

Eliminated locations (on tree-shaped paths):
   Start location: l10
      2: l2 -> l3 : [], cost: 1
     21: l3 -> [11] : [ k4^0<=0 ], cost: NONTERM
     27: l3 -> l2 : k4^0'=-1+k4^0, keA^0'=0, keR^0'=0, [ 1<=k4^0 && IsochResourceData^0<=0 ], cost: 3
     28: l3 -> l5 : ResourceIrp^0'=___rho_99_^post_11, StackSize^0'=StackSize^post_11, ___rho_99_^0'=___rho_99_^post_11, k4^0'=-1+k4^0, keA^0'=0, keR^0'=0, [ 1<=k4^0 && 1<=IsochResourceData^0 && 1+___rho_99_^post_11<=0 ], cost: 4
     29: l3 -> l5 : ResourceIrp^0'=___rho_99_^post_11, StackSize^0'=StackSize^post_11, ___rho_99_^0'=___rho_99_^post_11, k4^0'=-1+k4^0, keA^0'=0, keR^0'=0, [ 1<=k4^0 && 1<=IsochResourceData^0 && 1<=___rho_99_^post_11 ], cost: 4
     30: l3 -> l2 : ResourceIrp^0'=___rho_99_^post_11, StackSize^0'=StackSize^post_11, ___rho_99_^0'=___rho_99_^post_11, k4^0'=-1+k4^0, keA^0'=0, keR^0'=0, [ 1<=k4^0 && 1<=IsochResourceData^0 && ___rho_99_^post_11==0 ], cost: 4
     25: l5 -> l2 : ntStatus^0'=ntStatus^post_4, pIrb^0'=pIrb^post_6, [ 1<=pIrb^post_6 ], cost: 2
     26: l5 -> l2 : pIrb^0'=pIrb^post_6, [ pIrb^post_6<=0 ], cost: 2
     16: l10 -> l3 : keA^0'=0, keR^0'=0, [], cost: 2

Eliminated locations (on tree-shaped paths):
   Start location: l10
      2: l2 -> l3 : [], cost: 1
     21: l3 -> [11] : [ k4^0<=0 ], cost: NONTERM
     27: l3 -> l2 : k4^0'=-1+k4^0, keA^0'=0, keR^0'=0, [ 1<=k4^0 && IsochResourceData^0<=0 ], cost: 3
     30: l3 -> l2 : ResourceIrp^0'=___rho_99_^post_11, StackSize^0'=StackSize^post_11, ___rho_99_^0'=___rho_99_^post_11, k4^0'=-1+k4^0, keA^0'=0, keR^0'=0, [ 1<=k4^0 && 1<=IsochResourceData^0 && ___rho_99_^post_11==0 ], cost: 4
     31: l3 -> l2 : ResourceIrp^0'=___rho_99_^post_11, StackSize^0'=StackSize^post_11, ___rho_99_^0'=___rho_99_^post_11, k4^0'=-1+k4^0, keA^0'=0, keR^0'=0, ntStatus^0'=ntStatus^post_4, pIrb^0'=pIrb^post_6, [ 1<=k4^0 && 1<=IsochResourceData^0 && 1+___rho_99_^post_11<=0 && 1<=pIrb^post_6 ], cost: 6
     32: l3 -> l2 : ResourceIrp^0'=___rho_99_^post_11, StackSize^0'=StackSize^post_11, ___rho_99_^0'=___rho_99_^post_11, k4^0'=-1+k4^0, keA^0'=0, keR^0'=0, pIrb^0'=pIrb^post_6, [ 1<=k4^0 && 1<=IsochResourceData^0 && 1+___rho_99_^post_11<=0 && pIrb^post_6<=0 ], cost: 6
     33: l3 -> l2 : ResourceIrp^0'=___rho_99_^post_11, StackSize^0'=StackSize^post_11, ___rho_99_^0'=___rho_99_^post_11, k4^0'=-1+k4^0, keA^0'=0, keR^0'=0, ntStatus^0'=ntStatus^post_4, pIrb^0'=pIrb^post_6, [ 1<=k4^0 && 1<=IsochResourceData^0 && 1<=___rho_99_^post_11 && 1<=pIrb^post_6 ], cost: 6
     34: l3 -> l2 : ResourceIrp^0'=___rho_99_^post_11, StackSize^0'=StackSize^post_11, ___rho_99_^0'=___rho_99_^post_11, k4^0'=-1+k4^0, keA^0'=0, keR^0'=0, pIrb^0'=pIrb^post_6, [ 1<=k4^0 && 1<=IsochResourceData^0 && 1<=___rho_99_^post_11 && pIrb^post_6<=0 ], cost: 6
     16: l10 -> l3 : keA^0'=0, keR^0'=0, [], cost: 2

Applied pruning (of leafs and parallel rules):
   Start location: l10
      2: l2 -> l3 : [], cost: 1
     21: l3 -> [11] : [ k4^0<=0 ], cost: NONTERM
     27: l3 -> l2 : k4^0'=-1+k4^0, keA^0'=0, keR^0'=0, [ 1<=k4^0 && IsochResourceData^0<=0 ], cost: 3
     30: l3 -> l2 : ResourceIrp^0'=___rho_99_^post_11, StackSize^0'=StackSize^post_11, ___rho_99_^0'=___rho_99_^post_11, k4^0'=-1+k4^0, keA^0'=0, keR^0'=0, [ 1<=k4^0 && 1<=IsochResourceData^0 && ___rho_99_^post_11==0 ], cost: 4
     31: l3 -> l2 : ResourceIrp^0'=___rho_99_^post_11, StackSize^0'=StackSize^post_11, ___rho_99_^0'=___rho_99_^post_11, k4^0'=-1+k4^0, keA^0'=0, keR^0'=0, ntStatus^0'=ntStatus^post_4, pIrb^0'=pIrb^post_6, [ 1<=k4^0 && 1<=IsochResourceData^0 && 1+___rho_99_^post_11<=0 && 1<=pIrb^post_6 ], cost: 6
     32: l3 -> l2 : ResourceIrp^0'=___rho_99_^post_11, StackSize^0'=StackSize^post_11, ___rho_99_^0'=___rho_99_^post_11, k4^0'=-1+k4^0, keA^0'=0, keR^0'=0, pIrb^0'=pIrb^post_6, [ 1<=k4^0 && 1<=IsochResourceData^0 && 1+___rho_99_^post_11<=0 && pIrb^post_6<=0 ], cost: 6
     34: l3 -> l2 : ResourceIrp^0'=___rho_99_^post_11, StackSize^0'=StackSize^post_11, ___rho_99_^0'=___rho_99_^post_11, k4^0'=-1+k4^0, keA^0'=0, keR^0'=0, pIrb^0'=pIrb^post_6, [ 1<=k4^0 && 1<=IsochResourceData^0 && 1<=___rho_99_^post_11 && pIrb^post_6<=0 ], cost: 6
     16: l10 -> l3 : keA^0'=0, keR^0'=0, [], cost: 2

Eliminated locations (on tree-shaped paths):
   Start location: l10
     21: l3 -> [11] : [ k4^0<=0 ], cost: NONTERM
     35: l3 -> l3 : k4^0'=-1+k4^0, keA^0'=0, keR^0'=0, [ 1<=k4^0 && IsochResourceData^0<=0 ], cost: 4
     36: l3 -> l3 : ResourceIrp^0'=___rho_99_^post_11, StackSize^0'=StackSize^post_11, ___rho_99_^0'=___rho_99_^post_11, k4^0'=-1+k4^0, keA^0'=0, keR^0'=0, [ 1<=k4^0 && 1<=IsochResourceData^0 && ___rho_99_^post_11==0 ], cost: 5
     37: l3 -> l3 : ResourceIrp^0'=___rho_99_^post_11, StackSize^0'=StackSize^post_11, ___rho_99_^0'=___rho_99_^post_11, k4^0'=-1+k4^0, keA^0'=0, keR^0'=0, ntStatus^0'=ntStatus^post_4, pIrb^0'=pIrb^post_6, [ 1<=k4^0 && 1<=IsochResourceData^0 && 1+___rho_99_^post_11<=0 && 1<=pIrb^post_6 ], cost: 7
     38: l3 -> l3 : ResourceIrp^0'=___rho_99_^post_11, StackSize^0'=StackSize^post_11, ___rho_99_^0'=___rho_99_^post_11, k4^0'=-1+k4^0, keA^0'=0, keR^0'=0, pIrb^0'=pIrb^post_6, [ 1<=k4^0 && 1<=IsochResourceData^0 && 1+___rho_99_^post_11<=0 && pIrb^post_6<=0 ], cost: 7
     39: l3 -> l3 : ResourceIrp^0'=___rho_99_^post_11, StackSize^0'=StackSize^post_11, ___rho_99_^0'=___rho_99_^post_11, k4^0'=-1+k4^0, keA^0'=0, keR^0'=0, pIrb^0'=pIrb^post_6, [ 1<=k4^0 && 1<=IsochResourceData^0 && 1<=___rho_99_^post_11 && pIrb^post_6<=0 ], cost: 7
     16: l10 -> l3 : keA^0'=0, keR^0'=0, [], cost: 2

Accelerating simple loops of location 3.
   Simplified some of the simple loops (and removed duplicate rules).
   Accelerating the following rules:
     35: l3 -> l3 : k4^0'=-1+k4^0, keA^0'=0, keR^0'=0, [ 1<=k4^0 && IsochResourceData^0<=0 ], cost: 4
     36: l3 -> l3 : ResourceIrp^0'=0, StackSize^0'=StackSize^post_11, ___rho_99_^0'=0, k4^0'=-1+k4^0, keA^0'=0, keR^0'=0, [ 1<=k4^0 && 1<=IsochResourceData^0 ], cost: 5
     37: l3 -> l3 : ResourceIrp^0'=___rho_99_^post_11, StackSize^0'=StackSize^post_11, ___rho_99_^0'=___rho_99_^post_11, k4^0'=-1+k4^0, keA^0'=0, keR^0'=0, ntStatus^0'=ntStatus^post_4, pIrb^0'=pIrb^post_6, [ 1<=k4^0 && 1<=IsochResourceData^0 && 1+___rho_99_^post_11<=0 && 1<=pIrb^post_6 ], cost: 7
     38: l3 -> l3 : ResourceIrp^0'=___rho_99_^post_11, StackSize^0'=StackSize^post_11, ___rho_99_^0'=___rho_99_^post_11, k4^0'=-1+k4^0, keA^0'=0, keR^0'=0, pIrb^0'=pIrb^post_6, [ 1<=k4^0 && 1<=IsochResourceData^0 && 1+___rho_99_^post_11<=0 && pIrb^post_6<=0 ], cost: 7
     39: l3 -> l3 : ResourceIrp^0'=___rho_99_^post_11, StackSize^0'=StackSize^post_11, ___rho_99_^0'=___rho_99_^post_11, k4^0'=-1+k4^0, keA^0'=0, keR^0'=0, pIrb^0'=pIrb^post_6, [ 1<=k4^0 && 1<=IsochResourceData^0 && 1<=___rho_99_^post_11 && pIrb^post_6<=0 ], cost: 7

   Accelerated rule 35 with backward acceleration, yielding the new rule 40.
   Accelerated rule 36 with backward acceleration, yielding the new rule 41.
   Accelerated rule 37 with backward acceleration, yielding the new rule 42.
   Accelerated rule 38 with backward acceleration, yielding the new rule 43.
   Accelerated rule 39 with backward acceleration, yielding the new rule 44.
[accelerate] Nesting with 5 inner and 5 outer candidates
   Removing the simple loops: 35 36 37 38 39.

Accelerated all simple loops using metering functions (where possible):
   Start location: l10
     21: l3 -> [11] : [ k4^0<=0 ], cost: NONTERM
     40: l3 -> l3 : k4^0'=0, keA^0'=0, keR^0'=0, [ IsochResourceData^0<=0 && k4^0>=1 ], cost: 4*k4^0
     41: l3 -> l3 : ResourceIrp^0'=0, StackSize^0'=StackSize^post_11, ___rho_99_^0'=0, k4^0'=0, keA^0'=0, keR^0'=0, [ 1<=IsochResourceData^0 && k4^0>=1 ], cost: 5*k4^0
     42: l3 -> l3 : ResourceIrp^0'=___rho_99_^post_11, StackSize^0'=StackSize^post_11, ___rho_99_^0'=___rho_99_^post_11, k4^0'=0, keA^0'=0, keR^0'=0, ntStatus^0'=ntStatus^post_4, pIrb^0'=pIrb^post_6, [ 1<=IsochResourceData^0 && 1+___rho_99_^post_11<=0 && 1<=pIrb^post_6 && k4^0>=1 ], cost: 7*k4^0
     43: l3 -> l3 : ResourceIrp^0'=___rho_99_^post_11, StackSize^0'=StackSize^post_11, ___rho_99_^0'=___rho_99_^post_11, k4^0'=0, keA^0'=0, keR^0'=0, pIrb^0'=pIrb^post_6, [ 1<=IsochResourceData^0 && 1+___rho_99_^post_11<=0 && pIrb^post_6<=0 && k4^0>=1 ], cost: 7*k4^0
     44: l3 -> l3 : ResourceIrp^0'=___rho_99_^post_11, StackSize^0'=StackSize^post_11, ___rho_99_^0'=___rho_99_^post_11, k4^0'=0, keA^0'=0, keR^0'=0, pIrb^0'=pIrb^post_6, [ 1<=IsochResourceData^0 && 1<=___rho_99_^post_11 && pIrb^post_6<=0 && k4^0>=1 ], cost: 7*k4^0
     16: l10 -> l3 : keA^0'=0, keR^0'=0, [], cost: 2

Chained accelerated rules (with incoming rules):
   Start location: l10
     21: l3 -> [11] : [ k4^0<=0 ], cost: NONTERM
     16: l10 -> l3 : keA^0'=0, keR^0'=0, [], cost: 2
     45: l10 -> l3 : k4^0'=0, keA^0'=0, keR^0'=0, [ IsochResourceData^0<=0 && k4^0>=1 ], cost: 2+4*k4^0
     46: l10 -> l3 : ResourceIrp^0'=0, StackSize^0'=StackSize^post_11, ___rho_99_^0'=0, k4^0'=0, keA^0'=0, keR^0'=0, [ 1<=IsochResourceData^0 && k4^0>=1 ], cost: 2+5*k4^0
     47: l10 -> l3 : ResourceIrp^0'=___rho_99_^post_11, StackSize^0'=StackSize^post_11, ___rho_99_^0'=___rho_99_^post_11, k4^0'=0, keA^0'=0, keR^0'=0, ntStatus^0'=ntStatus^post_4, pIrb^0'=pIrb^post_6, [ 1<=IsochResourceData^0 && 1+___rho_99_^post_11<=0 && 1<=pIrb^post_6 && k4^0>=1 ], cost: 2+7*k4^0
     48: l10 -> l3 : ResourceIrp^0'=___rho_99_^post_11, StackSize^0'=StackSize^post_11, ___rho_99_^0'=___rho_99_^post_11, k4^0'=0, keA^0'=0, keR^0'=0, pIrb^0'=pIrb^post_6, [ 1<=IsochResourceData^0 && 1+___rho_99_^post_11<=0 && pIrb^post_6<=0 && k4^0>=1 ], cost: 2+7*k4^0
     49: l10 -> l3 : ResourceIrp^0'=___rho_99_^post_11, StackSize^0'=StackSize^post_11, ___rho_99_^0'=___rho_99_^post_11, k4^0'=0, keA^0'=0, keR^0'=0, pIrb^0'=pIrb^post_6, [ 1<=IsochResourceData^0 && 1<=___rho_99_^post_11 && pIrb^post_6<=0 && k4^0>=1 ], cost: 2+7*k4^0

Eliminated locations (on tree-shaped paths):
   Start location: l10
     50: l10 -> [11] : [ k4^0<=0 ], cost: NONTERM
     51: l10 -> [11] : [ IsochResourceData^0<=0 && k4^0>=1 ], cost: NONTERM
     52: l10 -> [11] : [ 1<=IsochResourceData^0 && k4^0>=1 ], cost: NONTERM
     53: l10 -> [11] : [ 1<=IsochResourceData^0 && 1+___rho_99_^post_11<=0 && 1<=pIrb^post_6 && k4^0>=1 ], cost: NONTERM
     54: l10 -> [11] : [ 1<=IsochResourceData^0 && 1+___rho_99_^post_11<=0 && pIrb^post_6<=0 && k4^0>=1 ], cost: NONTERM
     55: l10 -> [11] : [ 1<=IsochResourceData^0 && 1<=___rho_99_^post_11 && pIrb^post_6<=0 && k4^0>=1 ], cost: NONTERM

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: l10
     50: l10 -> [11] : [ k4^0<=0 ], cost: NONTERM
     51: l10 -> [11] : [ IsochResourceData^0<=0 && k4^0>=1 ], cost: NONTERM
     52: l10 -> [11] : [ 1<=IsochResourceData^0 && k4^0>=1 ], cost: NONTERM
     53: l10 -> [11] : [ 1<=IsochResourceData^0 && 1+___rho_99_^post_11<=0 && 1<=pIrb^post_6 && k4^0>=1 ], cost: NONTERM
     54: l10 -> [11] : [ 1<=IsochResourceData^0 && 1+___rho_99_^post_11<=0 && pIrb^post_6<=0 && k4^0>=1 ], cost: NONTERM
     55: l10 -> [11] : [ 1<=IsochResourceData^0 && 1<=___rho_99_^post_11 && pIrb^post_6<=0 && k4^0>=1 ], cost: NONTERM

Computing asymptotic complexity for rule 50
   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:  [ k4^0<=0 ]

NO