NO

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

Initial linear ITS problem
   Start location: __init
      0: f1_0_main_Load -> f1_0_main_Load\' : arg1'=arg1P_1, arg2'=arg2P_1, [ x14_1>-1 && arg2>1 && x15_1-2*x16_1==0 && x15_1>-1 && arg1>0 && arg1==arg1P_1 && arg2==arg2P_1 ], cost: 1
      2: f1_0_main_Load -> f1_0_main_Load\' : arg1'=arg1P_3, arg2'=arg2P_3, [ x24_1>-1 && arg2>1 && x25_1-2*x26_1==1 && x25_1>-1 && arg1>0 && arg1==arg1P_3 && arg2==arg2P_3 ], cost: 1
      1: f1_0_main_Load\' -> f131_0_loop_LT : arg1'=arg1P_2, arg2'=arg2P_2, [ x19_1>-1 && arg2>1 && x20_1-2*x21_1==0 && x20_1>-1 && arg1>0 && x20_1-2*x21_1<2 && x20_1-2*x21_1>=0 && -x19_1==arg1P_2 ], cost: 1
      3: f1_0_main_Load\' -> f130_0_loop_GT : arg1'=arg1P_4, arg2'=arg2P_4, [ arg1P_4>-1 && arg2>1 && -2*x31_1+x30_1==1 && x30_1>-1 && arg1>0 && -2*x31_1+x30_1<2 && -2*x31_1+x30_1>=0 ], cost: 1
      6: f131_0_loop_LT -> f163_0_loop_GE : arg1'=arg1P_7, arg2'=arg2P_7, [ arg1<1 && arg1<6 && arg1>-6 && arg1==arg1P_7 ], cost: 1
      4: f130_0_loop_GT -> f163_0_loop_GE : arg1'=arg1P_5, arg2'=arg2P_5, [ 0==arg1 && 0==arg1P_5 ], cost: 1
      5: f130_0_loop_GT -> f163_0_loop_GE : arg1'=arg1P_6, arg2'=arg2P_6, [ arg1>0 && arg1<6 && -1+arg1==arg1P_6 ], cost: 1
      7: f163_0_loop_GE -> f130_0_loop_GT : arg1'=arg1P_8, arg2'=arg2P_8, [ arg1>-1 && arg1==arg1P_8 ], cost: 1
      8: f163_0_loop_GE -> f131_0_loop_LT : arg1'=arg1P_9, arg2'=arg2P_9, [ arg1<0 && 1+arg1==arg1P_9 ], cost: 1
      9: __init -> f1_0_main_Load : arg1'=arg1P_10, arg2'=arg2P_10, [], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
      9: __init -> f1_0_main_Load : arg1'=arg1P_10, arg2'=arg2P_10, [], cost: 1

Simplified all rules, resulting in:
   Start location: __init
      0: f1_0_main_Load -> f1_0_main_Load\' : [ arg2>1 && 2*x16_1>-1 && arg1>0 ], cost: 1
      2: f1_0_main_Load -> f1_0_main_Load\' : [ arg2>1 && 1+2*x26_1>-1 && arg1>0 ], cost: 1
      1: f1_0_main_Load\' -> f131_0_loop_LT : arg1'=-x19_1, arg2'=arg2P_2, [ x19_1>-1 && arg2>1 && 2*x21_1>-1 && arg1>0 ], cost: 1
      3: f1_0_main_Load\' -> f130_0_loop_GT : arg1'=arg1P_4, arg2'=arg2P_4, [ arg1P_4>-1 && arg2>1 && 1+2*x31_1>-1 && arg1>0 ], cost: 1
      6: f131_0_loop_LT -> f163_0_loop_GE : arg2'=arg2P_7, [ arg1<1 && arg1>-6 ], cost: 1
      4: f130_0_loop_GT -> f163_0_loop_GE : arg1'=0, arg2'=arg2P_5, [ 0==arg1 ], cost: 1
      5: f130_0_loop_GT -> f163_0_loop_GE : arg1'=-1+arg1, arg2'=arg2P_6, [ arg1>0 && arg1<6 ], cost: 1
      7: f163_0_loop_GE -> f130_0_loop_GT : arg2'=arg2P_8, [ arg1>-1 ], cost: 1
      8: f163_0_loop_GE -> f131_0_loop_LT : arg1'=1+arg1, arg2'=arg2P_9, [ arg1<0 ], cost: 1
      9: __init -> f1_0_main_Load : arg1'=arg1P_10, arg2'=arg2P_10, [], cost: 1

### Simplification by acceleration and chaining ###

Eliminated locations (on tree-shaped paths):
   Start location: __init
      1: f1_0_main_Load\' -> f131_0_loop_LT : arg1'=-x19_1, arg2'=arg2P_2, [ x19_1>-1 && arg2>1 && 2*x21_1>-1 && arg1>0 ], cost: 1
      3: f1_0_main_Load\' -> f130_0_loop_GT : arg1'=arg1P_4, arg2'=arg2P_4, [ arg1P_4>-1 && arg2>1 && 1+2*x31_1>-1 && arg1>0 ], cost: 1
      6: f131_0_loop_LT -> f163_0_loop_GE : arg2'=arg2P_7, [ arg1<1 && arg1>-6 ], cost: 1
      4: f130_0_loop_GT -> f163_0_loop_GE : arg1'=0, arg2'=arg2P_5, [ 0==arg1 ], cost: 1
      5: f130_0_loop_GT -> f163_0_loop_GE : arg1'=-1+arg1, arg2'=arg2P_6, [ arg1>0 && arg1<6 ], cost: 1
      7: f163_0_loop_GE -> f130_0_loop_GT : arg2'=arg2P_8, [ arg1>-1 ], cost: 1
      8: f163_0_loop_GE -> f131_0_loop_LT : arg1'=1+arg1, arg2'=arg2P_9, [ arg1<0 ], cost: 1
     10: __init -> f1_0_main_Load\' : arg1'=arg1P_10, arg2'=arg2P_10, [ arg2P_10>1 && 2*x16_1>-1 && arg1P_10>0 ], cost: 2
     11: __init -> f1_0_main_Load\' : arg1'=arg1P_10, arg2'=arg2P_10, [ arg2P_10>1 && 1+2*x26_1>-1 && arg1P_10>0 ], cost: 2

Eliminated locations (on tree-shaped paths):
   Start location: __init
      6: f131_0_loop_LT -> f163_0_loop_GE : arg2'=arg2P_7, [ arg1<1 && arg1>-6 ], cost: 1
      4: f130_0_loop_GT -> f163_0_loop_GE : arg1'=0, arg2'=arg2P_5, [ 0==arg1 ], cost: 1
      5: f130_0_loop_GT -> f163_0_loop_GE : arg1'=-1+arg1, arg2'=arg2P_6, [ arg1>0 && arg1<6 ], cost: 1
      7: f163_0_loop_GE -> f130_0_loop_GT : arg2'=arg2P_8, [ arg1>-1 ], cost: 1
      8: f163_0_loop_GE -> f131_0_loop_LT : arg1'=1+arg1, arg2'=arg2P_9, [ arg1<0 ], cost: 1
     12: __init -> f131_0_loop_LT : arg1'=-x19_1, arg2'=arg2P_2, [ arg2P_10>1 && 2*x16_1>-1 && arg1P_10>0 && x19_1>-1 && 2*x21_1>-1 ], cost: 3
     13: __init -> f130_0_loop_GT : arg1'=arg1P_4, arg2'=arg2P_4, [ arg2P_10>1 && 2*x16_1>-1 && arg1P_10>0 && arg1P_4>-1 && 1+2*x31_1>-1 ], cost: 3
     14: __init -> f131_0_loop_LT : arg1'=-x19_1, arg2'=arg2P_2, [ arg2P_10>1 && 1+2*x26_1>-1 && arg1P_10>0 && x19_1>-1 && 2*x21_1>-1 ], cost: 3
     15: __init -> f130_0_loop_GT : arg1'=arg1P_4, arg2'=arg2P_4, [ arg2P_10>1 && 1+2*x26_1>-1 && arg1P_10>0 && arg1P_4>-1 && 1+2*x31_1>-1 ], cost: 3

Eliminated location f131_0_loop_LT (as a last resort):
   Start location: __init
      4: f130_0_loop_GT -> f163_0_loop_GE : arg1'=0, arg2'=arg2P_5, [ 0==arg1 ], cost: 1
      5: f130_0_loop_GT -> f163_0_loop_GE : arg1'=-1+arg1, arg2'=arg2P_6, [ arg1>0 && arg1<6 ], cost: 1
      7: f163_0_loop_GE -> f130_0_loop_GT : arg2'=arg2P_8, [ arg1>-1 ], cost: 1
     16: f163_0_loop_GE -> f163_0_loop_GE : arg1'=1+arg1, arg2'=arg2P_7, [ arg1<0 && 1+arg1>-6 ], cost: 2
     13: __init -> f130_0_loop_GT : arg1'=arg1P_4, arg2'=arg2P_4, [ arg2P_10>1 && 2*x16_1>-1 && arg1P_10>0 && arg1P_4>-1 && 1+2*x31_1>-1 ], cost: 3
     15: __init -> f130_0_loop_GT : arg1'=arg1P_4, arg2'=arg2P_4, [ arg2P_10>1 && 1+2*x26_1>-1 && arg1P_10>0 && arg1P_4>-1 && 1+2*x31_1>-1 ], cost: 3
     17: __init -> f163_0_loop_GE : arg1'=-x19_1, arg2'=arg2P_7, [ arg2P_10>1 && 2*x16_1>-1 && arg1P_10>0 && x19_1>-1 && 2*x21_1>-1 && -x19_1>-6 ], cost: 4
     18: __init -> f163_0_loop_GE : arg1'=-x19_1, arg2'=arg2P_7, [ arg2P_10>1 && 1+2*x26_1>-1 && arg1P_10>0 && x19_1>-1 && 2*x21_1>-1 && -x19_1>-6 ], cost: 4

Accelerating simple loops of location 4.
   Accelerating the following rules:
     16: f163_0_loop_GE -> f163_0_loop_GE : arg1'=1+arg1, arg2'=arg2P_7, [ arg1<0 && 1+arg1>-6 ], cost: 2

   Accelerated rule 16 with backward acceleration, yielding the new rule 19.
[accelerate] Nesting with 1 inner and 1 outer candidates
   Removing the simple loops: 16.

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
      4: f130_0_loop_GT -> f163_0_loop_GE : arg1'=0, arg2'=arg2P_5, [ 0==arg1 ], cost: 1
      5: f130_0_loop_GT -> f163_0_loop_GE : arg1'=-1+arg1, arg2'=arg2P_6, [ arg1>0 && arg1<6 ], cost: 1
      7: f163_0_loop_GE -> f130_0_loop_GT : arg2'=arg2P_8, [ arg1>-1 ], cost: 1
     19: f163_0_loop_GE -> f163_0_loop_GE : arg1'=0, arg2'=arg2P_7, [ 1+arg1>-6 && -arg1>=1 ], cost: -2*arg1
     13: __init -> f130_0_loop_GT : arg1'=arg1P_4, arg2'=arg2P_4, [ arg2P_10>1 && 2*x16_1>-1 && arg1P_10>0 && arg1P_4>-1 && 1+2*x31_1>-1 ], cost: 3
     15: __init -> f130_0_loop_GT : arg1'=arg1P_4, arg2'=arg2P_4, [ arg2P_10>1 && 1+2*x26_1>-1 && arg1P_10>0 && arg1P_4>-1 && 1+2*x31_1>-1 ], cost: 3
     17: __init -> f163_0_loop_GE : arg1'=-x19_1, arg2'=arg2P_7, [ arg2P_10>1 && 2*x16_1>-1 && arg1P_10>0 && x19_1>-1 && 2*x21_1>-1 && -x19_1>-6 ], cost: 4
     18: __init -> f163_0_loop_GE : arg1'=-x19_1, arg2'=arg2P_7, [ arg2P_10>1 && 1+2*x26_1>-1 && arg1P_10>0 && x19_1>-1 && 2*x21_1>-1 && -x19_1>-6 ], cost: 4

Chained accelerated rules (with incoming rules):
   Start location: __init
      4: f130_0_loop_GT -> f163_0_loop_GE : arg1'=0, arg2'=arg2P_5, [ 0==arg1 ], cost: 1
      5: f130_0_loop_GT -> f163_0_loop_GE : arg1'=-1+arg1, arg2'=arg2P_6, [ arg1>0 && arg1<6 ], cost: 1
      7: f163_0_loop_GE -> f130_0_loop_GT : arg2'=arg2P_8, [ arg1>-1 ], cost: 1
     13: __init -> f130_0_loop_GT : arg1'=arg1P_4, arg2'=arg2P_4, [ arg2P_10>1 && 2*x16_1>-1 && arg1P_10>0 && arg1P_4>-1 && 1+2*x31_1>-1 ], cost: 3
     15: __init -> f130_0_loop_GT : arg1'=arg1P_4, arg2'=arg2P_4, [ arg2P_10>1 && 1+2*x26_1>-1 && arg1P_10>0 && arg1P_4>-1 && 1+2*x31_1>-1 ], cost: 3
     17: __init -> f163_0_loop_GE : arg1'=-x19_1, arg2'=arg2P_7, [ arg2P_10>1 && 2*x16_1>-1 && arg1P_10>0 && x19_1>-1 && 2*x21_1>-1 && -x19_1>-6 ], cost: 4
     18: __init -> f163_0_loop_GE : arg1'=-x19_1, arg2'=arg2P_7, [ arg2P_10>1 && 1+2*x26_1>-1 && arg1P_10>0 && x19_1>-1 && 2*x21_1>-1 && -x19_1>-6 ], cost: 4
     20: __init -> f163_0_loop_GE : arg1'=0, arg2'=arg2P_7, [ 2*x16_1>-1 && 2*x21_1>-1 && -x19_1>-6 && x19_1>=1 ], cost: 4+2*x19_1
     21: __init -> f163_0_loop_GE : arg1'=0, arg2'=arg2P_7, [ 1+2*x26_1>-1 && 2*x21_1>-1 && -x19_1>-6 && x19_1>=1 ], cost: 4+2*x19_1

Eliminated location f130_0_loop_GT (as a last resort):
   Start location: __init
     22: f163_0_loop_GE -> f163_0_loop_GE : arg1'=0, arg2'=arg2P_5, [ 0==arg1 ], cost: 2
     23: f163_0_loop_GE -> f163_0_loop_GE : arg1'=-1+arg1, arg2'=arg2P_6, [ arg1>0 && arg1<6 ], cost: 2
     17: __init -> f163_0_loop_GE : arg1'=-x19_1, arg2'=arg2P_7, [ arg2P_10>1 && 2*x16_1>-1 && arg1P_10>0 && x19_1>-1 && 2*x21_1>-1 && -x19_1>-6 ], cost: 4
     18: __init -> f163_0_loop_GE : arg1'=-x19_1, arg2'=arg2P_7, [ arg2P_10>1 && 1+2*x26_1>-1 && arg1P_10>0 && x19_1>-1 && 2*x21_1>-1 && -x19_1>-6 ], cost: 4
     20: __init -> f163_0_loop_GE : arg1'=0, arg2'=arg2P_7, [ 2*x16_1>-1 && 2*x21_1>-1 && -x19_1>-6 && x19_1>=1 ], cost: 4+2*x19_1
     21: __init -> f163_0_loop_GE : arg1'=0, arg2'=arg2P_7, [ 1+2*x26_1>-1 && 2*x21_1>-1 && -x19_1>-6 && x19_1>=1 ], cost: 4+2*x19_1
     24: __init -> f163_0_loop_GE : arg1'=0, arg2'=arg2P_5, [ arg2P_10>1 && 2*x16_1>-1 && arg1P_10>0 && 1+2*x31_1>-1 && 0==arg1P_4 ], cost: 4
     25: __init -> f163_0_loop_GE : arg1'=-1+arg1P_4, arg2'=arg2P_6, [ arg2P_10>1 && 2*x16_1>-1 && arg1P_10>0 && 1+2*x31_1>-1 && arg1P_4>0 && arg1P_4<6 ], cost: 4
     26: __init -> f163_0_loop_GE : arg1'=0, arg2'=arg2P_5, [ arg2P_10>1 && 1+2*x26_1>-1 && arg1P_10>0 && 1+2*x31_1>-1 && 0==arg1P_4 ], cost: 4
     27: __init -> f163_0_loop_GE : arg1'=-1+arg1P_4, arg2'=arg2P_6, [ arg2P_10>1 && 1+2*x26_1>-1 && arg1P_10>0 && 1+2*x31_1>-1 && arg1P_4>0 && arg1P_4<6 ], cost: 4

Applied pruning (of leafs and parallel rules):
   Start location: __init
     22: f163_0_loop_GE -> f163_0_loop_GE : arg1'=0, arg2'=arg2P_5, [ 0==arg1 ], cost: 2
     23: f163_0_loop_GE -> f163_0_loop_GE : arg1'=-1+arg1, arg2'=arg2P_6, [ arg1>0 && arg1<6 ], cost: 2
     17: __init -> f163_0_loop_GE : arg1'=-x19_1, arg2'=arg2P_7, [ arg2P_10>1 && 2*x16_1>-1 && arg1P_10>0 && x19_1>-1 && 2*x21_1>-1 && -x19_1>-6 ], cost: 4
     18: __init -> f163_0_loop_GE : arg1'=-x19_1, arg2'=arg2P_7, [ arg2P_10>1 && 1+2*x26_1>-1 && arg1P_10>0 && x19_1>-1 && 2*x21_1>-1 && -x19_1>-6 ], cost: 4
     21: __init -> f163_0_loop_GE : arg1'=0, arg2'=arg2P_7, [ 1+2*x26_1>-1 && 2*x21_1>-1 && -x19_1>-6 && x19_1>=1 ], cost: 4+2*x19_1
     24: __init -> f163_0_loop_GE : arg1'=0, arg2'=arg2P_5, [ arg2P_10>1 && 2*x16_1>-1 && arg1P_10>0 && 1+2*x31_1>-1 && 0==arg1P_4 ], cost: 4
     25: __init -> f163_0_loop_GE : arg1'=-1+arg1P_4, arg2'=arg2P_6, [ arg2P_10>1 && 2*x16_1>-1 && arg1P_10>0 && 1+2*x31_1>-1 && arg1P_4>0 && arg1P_4<6 ], cost: 4

Accelerating simple loops of location 4.
   Accelerating the following rules:
     22: f163_0_loop_GE -> f163_0_loop_GE : arg1'=0, arg2'=arg2P_5, [ 0==arg1 ], cost: 2
     23: f163_0_loop_GE -> f163_0_loop_GE : arg1'=-1+arg1, arg2'=arg2P_6, [ arg1>0 && arg1<6 ], cost: 2

   Accelerated rule 22 with non-termination, yielding the new rule 28.
   Accelerated rule 23 with backward acceleration, yielding the new rule 29.
[accelerate] Nesting with 1 inner and 1 outer candidates
   Removing the simple loops: 22 23.

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
     28: f163_0_loop_GE -> [7] : [ 0==arg1 ], cost: NONTERM
     29: f163_0_loop_GE -> f163_0_loop_GE : arg1'=0, arg2'=arg2P_6, [ arg1<6 && arg1>=1 ], cost: 2*arg1
     17: __init -> f163_0_loop_GE : arg1'=-x19_1, arg2'=arg2P_7, [ arg2P_10>1 && 2*x16_1>-1 && arg1P_10>0 && x19_1>-1 && 2*x21_1>-1 && -x19_1>-6 ], cost: 4
     18: __init -> f163_0_loop_GE : arg1'=-x19_1, arg2'=arg2P_7, [ arg2P_10>1 && 1+2*x26_1>-1 && arg1P_10>0 && x19_1>-1 && 2*x21_1>-1 && -x19_1>-6 ], cost: 4
     21: __init -> f163_0_loop_GE : arg1'=0, arg2'=arg2P_7, [ 1+2*x26_1>-1 && 2*x21_1>-1 && -x19_1>-6 && x19_1>=1 ], cost: 4+2*x19_1
     24: __init -> f163_0_loop_GE : arg1'=0, arg2'=arg2P_5, [ arg2P_10>1 && 2*x16_1>-1 && arg1P_10>0 && 1+2*x31_1>-1 && 0==arg1P_4 ], cost: 4
     25: __init -> f163_0_loop_GE : arg1'=-1+arg1P_4, arg2'=arg2P_6, [ arg2P_10>1 && 2*x16_1>-1 && arg1P_10>0 && 1+2*x31_1>-1 && arg1P_4>0 && arg1P_4<6 ], cost: 4

Chained accelerated rules (with incoming rules):
   Start location: __init
     17: __init -> f163_0_loop_GE : arg1'=-x19_1, arg2'=arg2P_7, [ arg2P_10>1 && 2*x16_1>-1 && arg1P_10>0 && x19_1>-1 && 2*x21_1>-1 && -x19_1>-6 ], cost: 4
     18: __init -> f163_0_loop_GE : arg1'=-x19_1, arg2'=arg2P_7, [ arg2P_10>1 && 1+2*x26_1>-1 && arg1P_10>0 && x19_1>-1 && 2*x21_1>-1 && -x19_1>-6 ], cost: 4
     21: __init -> f163_0_loop_GE : arg1'=0, arg2'=arg2P_7, [ 1+2*x26_1>-1 && 2*x21_1>-1 && -x19_1>-6 && x19_1>=1 ], cost: 4+2*x19_1
     24: __init -> f163_0_loop_GE : arg1'=0, arg2'=arg2P_5, [ arg2P_10>1 && 2*x16_1>-1 && arg1P_10>0 && 1+2*x31_1>-1 && 0==arg1P_4 ], cost: 4
     25: __init -> f163_0_loop_GE : arg1'=-1+arg1P_4, arg2'=arg2P_6, [ arg2P_10>1 && 2*x16_1>-1 && arg1P_10>0 && 1+2*x31_1>-1 && arg1P_4>0 && arg1P_4<6 ], cost: 4
     30: __init -> [7] : [ 2*x16_1>-1 && 2*x21_1>-1 ], cost: NONTERM
     31: __init -> [7] : [ 1+2*x26_1>-1 && 2*x21_1>-1 ], cost: NONTERM
     32: __init -> [7] : [ 1+2*x26_1>-1 && 2*x21_1>-1 ], cost: NONTERM
     33: __init -> [7] : [ 2*x16_1>-1 && 1+2*x31_1>-1 ], cost: NONTERM
     34: __init -> [7] : [ 2*x16_1>-1 && 1+2*x31_1>-1 ], cost: NONTERM
     35: __init -> f163_0_loop_GE : arg1'=0, arg2'=arg2P_6, [ 2*x16_1>-1 && 1+2*x31_1>-1 && arg1P_4<6 && -1+arg1P_4>=1 ], cost: 2+2*arg1P_4

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
     21: __init -> f163_0_loop_GE : arg1'=0, arg2'=arg2P_7, [ 1+2*x26_1>-1 && 2*x21_1>-1 && -x19_1>-6 && x19_1>=1 ], cost: 4+2*x19_1
     30: __init -> [7] : [ 2*x16_1>-1 && 2*x21_1>-1 ], cost: NONTERM
     31: __init -> [7] : [ 1+2*x26_1>-1 && 2*x21_1>-1 ], cost: NONTERM
     32: __init -> [7] : [ 1+2*x26_1>-1 && 2*x21_1>-1 ], cost: NONTERM
     33: __init -> [7] : [ 2*x16_1>-1 && 1+2*x31_1>-1 ], cost: NONTERM
     34: __init -> [7] : [ 2*x16_1>-1 && 1+2*x31_1>-1 ], cost: NONTERM
     35: __init -> f163_0_loop_GE : arg1'=0, arg2'=arg2P_6, [ 2*x16_1>-1 && 1+2*x31_1>-1 && arg1P_4<6 && -1+arg1P_4>=1 ], cost: 2+2*arg1P_4

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     21: __init -> f163_0_loop_GE : arg1'=0, arg2'=arg2P_7, [ 1+2*x26_1>-1 && 2*x21_1>-1 && -x19_1>-6 && x19_1>=1 ], cost: 4+2*x19_1
     30: __init -> [7] : [ 2*x16_1>-1 && 2*x21_1>-1 ], cost: NONTERM
     32: __init -> [7] : [ 1+2*x26_1>-1 && 2*x21_1>-1 ], cost: NONTERM
     34: __init -> [7] : [ 2*x16_1>-1 && 1+2*x31_1>-1 ], cost: NONTERM
     35: __init -> f163_0_loop_GE : arg1'=0, arg2'=arg2P_6, [ 2*x16_1>-1 && 1+2*x31_1>-1 && arg1P_4<6 && -1+arg1P_4>=1 ], cost: 2+2*arg1P_4

Computing asymptotic complexity for rule 30
   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:  [ 2*x16_1>-1 && 2*x21_1>-1 ]

NO