WORST_CASE(Omega(1),?)

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

Initial linear ITS problem
   Start location: __init
      0: f1_0_main_Load -> f495_0_createTree_GT : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, arg5'=arg5P_1, arg6'=arg6P_1, [ arg1P_1>-1 && arg2>0 && arg1>0 && arg2==arg2P_1 && 1==arg3P_1 ], cost: 1
      1: f1_0_main_Load -> f1016_0_main_InvokeMethod : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, arg5'=arg5P_2, arg6'=arg6P_2, [ x8_1>-1 && arg2>0 && arg1P_2<=arg1 && arg1>0 && arg1P_2>0 && arg2P_2>-1 ], cost: 1
      4: f495_0_createTree_GT -> f998_0_createTree_GE : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, arg5'=arg5P_5, arg6'=arg6P_5, [ arg2>-1 && arg1>0 && arg3>0 && arg3<arg2 && arg4P_5>-1 && arg1==arg1P_5 && -1+arg1==arg2P_5 && 0==arg3P_5 && arg2==arg5P_5 && 1+arg3==arg6P_5 ], cost: 1
      3: f1016_0_main_InvokeMethod -> f1034_0_growList_NONNULL : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, arg5'=arg5P_4, arg6'=arg6P_4, [ x14_1>0 && arg3>1 && arg1P_4<=arg2 && arg1>0 && arg2>-1 && arg1P_4>-1 && arg3==arg2P_4 ], cost: 1
      2: f348_0_createTree_Return -> f1016_0_main_InvokeMethod : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, arg5'=arg5P_3, arg6'=arg6P_3, [ arg1P_3<=arg1 && 1+arg2P_3<=arg1 && arg1>0 && arg1P_3>0 && arg2P_3>-1 && arg2==arg3P_3 ], cost: 1
      8: f1034_0_growList_NONNULL -> f1034_0_growList_NONNULL : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [ 2+arg1P_9<=arg1 && arg2>1 && arg1>1 && arg1P_9>-1 && arg2==arg2P_9 ], cost: 1
      9: f1034_0_growList_NONNULL -> f1232_0_growList_InvokeMethod : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ 1+arg2P_10<=arg1 && arg2>1 && 1+arg5P_10<=arg1 && arg1>0 && arg1P_10>4 && arg2P_10>-1 && arg5P_10>-1 && arg2==arg4P_10 ], cost: 1
     11: f1034_0_growList_NONNULL -> f1232_0_growList_InvokeMethod : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg3P_12, arg4'=arg4P_12, arg5'=arg5P_12, arg6'=arg6P_12, [ -7+arg1P_12<=arg1 && arg2>1 && 1+arg2P_12<=arg1 && 1+arg5P_12<=arg1 && arg1>0 && arg1P_12>7 && arg2P_12>-1 && arg5P_12>-1 && arg2==arg4P_12 ], cost: 1
     13: f1034_0_growList_NONNULL -> f1034_0_growList_NONNULL : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=arg3P_14, arg4'=arg4P_14, arg5'=arg5P_14, arg6'=arg6P_14, [ 4+arg1P_14<=arg1 && arg2>1 && arg1>4 && arg1P_14>0 && arg2==arg2P_14 ], cost: 1
      5: f998_0_createTree_GE -> f495_0_createTree_GT : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg4>0 && arg4>arg3 && arg1>0 && arg6>1 && arg2<arg1 && -1+arg2<arg1 && arg2>-1 && -1+arg2<arg2 && -1+arg2==arg1P_6 && arg5==arg2P_6 && arg6==arg3P_6 ], cost: 1
      6: f998_0_createTree_GE -> f998_0_createTree_GE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ arg4>0 && arg4>arg3 && arg1>0 && arg6>1 && arg2<arg1 && -1+arg2<arg1 && arg2>-1 && -1+arg2<arg2 && arg1==arg1P_7 && arg2==arg2P_7 && 1+arg3==arg3P_7 && arg4==arg4P_7 && arg5==arg5P_7 && arg6==arg6P_7 ], cost: 1
      7: f998_0_createTree_GE -> f998_0_createTree_GE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, arg5'=arg5P_8, arg6'=arg6P_8, [ arg4>0 && arg4>arg3 && arg1>0 && arg6>1 && arg2<arg1 && -1+arg2<arg1 && arg2>-1 && -1+arg2<arg2 && arg1==arg1P_8 && arg2==arg2P_8 && 1+arg3==arg3P_8 && arg4==arg4P_8 && arg5==arg5P_8 ], cost: 1
     12: f1232_0_growList_InvokeMethod -> f1034_0_growList_NONNULL : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, arg5'=arg5P_13, arg6'=arg6P_13, [ 2+arg1P_13<=arg1 && arg4>1 && arg1P_13<=arg2 && arg1P_13<=arg5 && arg1>4 && arg2>-1 && arg5>-1 && arg1P_13>-1 && arg4==arg2P_13 ], cost: 1
     10: f1168_0_growTree_Return -> f1232_0_growList_InvokeMethod : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, arg5'=arg5P_11, arg6'=arg6P_11, [ arg1P_11<=arg1 && 2+arg2P_11<=arg1 && arg2P_11<=arg5 && 2+arg5P_11<=arg1 && arg5P_11<=arg5 && arg1>5 && arg5>-1 && arg1P_11>5 && arg2P_11>-1 && arg5P_11>-1 && 6+arg4<=arg1 && arg2==arg3P_11 && arg3==arg4P_11 ], cost: 1
     14: __init -> f1_0_main_Load : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_15, arg4'=arg4P_15, arg5'=arg5P_15, arg6'=arg6P_15, [], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
     14: __init -> f1_0_main_Load : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_15, arg4'=arg4P_15, arg5'=arg5P_15, arg6'=arg6P_15, [], cost: 1

Removed unreachable and leaf rules:
   Start location: __init
      0: f1_0_main_Load -> f495_0_createTree_GT : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, arg5'=arg5P_1, arg6'=arg6P_1, [ arg1P_1>-1 && arg2>0 && arg1>0 && arg2==arg2P_1 && 1==arg3P_1 ], cost: 1
      1: f1_0_main_Load -> f1016_0_main_InvokeMethod : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, arg5'=arg5P_2, arg6'=arg6P_2, [ x8_1>-1 && arg2>0 && arg1P_2<=arg1 && arg1>0 && arg1P_2>0 && arg2P_2>-1 ], cost: 1
      4: f495_0_createTree_GT -> f998_0_createTree_GE : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, arg5'=arg5P_5, arg6'=arg6P_5, [ arg2>-1 && arg1>0 && arg3>0 && arg3<arg2 && arg4P_5>-1 && arg1==arg1P_5 && -1+arg1==arg2P_5 && 0==arg3P_5 && arg2==arg5P_5 && 1+arg3==arg6P_5 ], cost: 1
      3: f1016_0_main_InvokeMethod -> f1034_0_growList_NONNULL : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, arg5'=arg5P_4, arg6'=arg6P_4, [ x14_1>0 && arg3>1 && arg1P_4<=arg2 && arg1>0 && arg2>-1 && arg1P_4>-1 && arg3==arg2P_4 ], cost: 1
      8: f1034_0_growList_NONNULL -> f1034_0_growList_NONNULL : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [ 2+arg1P_9<=arg1 && arg2>1 && arg1>1 && arg1P_9>-1 && arg2==arg2P_9 ], cost: 1
      9: f1034_0_growList_NONNULL -> f1232_0_growList_InvokeMethod : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ 1+arg2P_10<=arg1 && arg2>1 && 1+arg5P_10<=arg1 && arg1>0 && arg1P_10>4 && arg2P_10>-1 && arg5P_10>-1 && arg2==arg4P_10 ], cost: 1
     11: f1034_0_growList_NONNULL -> f1232_0_growList_InvokeMethod : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg3P_12, arg4'=arg4P_12, arg5'=arg5P_12, arg6'=arg6P_12, [ -7+arg1P_12<=arg1 && arg2>1 && 1+arg2P_12<=arg1 && 1+arg5P_12<=arg1 && arg1>0 && arg1P_12>7 && arg2P_12>-1 && arg5P_12>-1 && arg2==arg4P_12 ], cost: 1
     13: f1034_0_growList_NONNULL -> f1034_0_growList_NONNULL : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=arg3P_14, arg4'=arg4P_14, arg5'=arg5P_14, arg6'=arg6P_14, [ 4+arg1P_14<=arg1 && arg2>1 && arg1>4 && arg1P_14>0 && arg2==arg2P_14 ], cost: 1
      5: f998_0_createTree_GE -> f495_0_createTree_GT : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg4>0 && arg4>arg3 && arg1>0 && arg6>1 && arg2<arg1 && -1+arg2<arg1 && arg2>-1 && -1+arg2<arg2 && -1+arg2==arg1P_6 && arg5==arg2P_6 && arg6==arg3P_6 ], cost: 1
      6: f998_0_createTree_GE -> f998_0_createTree_GE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ arg4>0 && arg4>arg3 && arg1>0 && arg6>1 && arg2<arg1 && -1+arg2<arg1 && arg2>-1 && -1+arg2<arg2 && arg1==arg1P_7 && arg2==arg2P_7 && 1+arg3==arg3P_7 && arg4==arg4P_7 && arg5==arg5P_7 && arg6==arg6P_7 ], cost: 1
      7: f998_0_createTree_GE -> f998_0_createTree_GE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, arg5'=arg5P_8, arg6'=arg6P_8, [ arg4>0 && arg4>arg3 && arg1>0 && arg6>1 && arg2<arg1 && -1+arg2<arg1 && arg2>-1 && -1+arg2<arg2 && arg1==arg1P_8 && arg2==arg2P_8 && 1+arg3==arg3P_8 && arg4==arg4P_8 && arg5==arg5P_8 ], cost: 1
     12: f1232_0_growList_InvokeMethod -> f1034_0_growList_NONNULL : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, arg5'=arg5P_13, arg6'=arg6P_13, [ 2+arg1P_13<=arg1 && arg4>1 && arg1P_13<=arg2 && arg1P_13<=arg5 && arg1>4 && arg2>-1 && arg5>-1 && arg1P_13>-1 && arg4==arg2P_13 ], cost: 1
     14: __init -> f1_0_main_Load : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_15, arg4'=arg4P_15, arg5'=arg5P_15, arg6'=arg6P_15, [], cost: 1

Simplified all rules, resulting in:
   Start location: __init
      0: f1_0_main_Load -> f495_0_createTree_GT : arg1'=arg1P_1, arg3'=1, arg4'=arg4P_1, arg5'=arg5P_1, arg6'=arg6P_1, [ arg1P_1>-1 && arg2>0 && arg1>0 ], cost: 1
      1: f1_0_main_Load -> f1016_0_main_InvokeMethod : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, arg5'=arg5P_2, arg6'=arg6P_2, [ arg2>0 && arg1P_2<=arg1 && arg1>0 && arg1P_2>0 && arg2P_2>-1 ], cost: 1
      4: f495_0_createTree_GT -> f998_0_createTree_GE : arg2'=-1+arg1, arg3'=0, arg4'=arg4P_5, arg5'=arg2, arg6'=1+arg3, [ arg1>0 && arg3>0 && arg3<arg2 && arg4P_5>-1 ], cost: 1
      3: f1016_0_main_InvokeMethod -> f1034_0_growList_NONNULL : arg1'=arg1P_4, arg2'=arg3, arg3'=arg3P_4, arg4'=arg4P_4, arg5'=arg5P_4, arg6'=arg6P_4, [ arg3>1 && arg1P_4<=arg2 && arg1>0 && arg2>-1 && arg1P_4>-1 ], cost: 1
      8: f1034_0_growList_NONNULL -> f1034_0_growList_NONNULL : arg1'=arg1P_9, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [ 2+arg1P_9<=arg1 && arg2>1 && arg1>1 && arg1P_9>-1 ], cost: 1
      9: f1034_0_growList_NONNULL -> f1232_0_growList_InvokeMethod : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg2, arg5'=arg5P_10, arg6'=arg6P_10, [ 1+arg2P_10<=arg1 && arg2>1 && 1+arg5P_10<=arg1 && arg1>0 && arg1P_10>4 && arg2P_10>-1 && arg5P_10>-1 ], cost: 1
     11: f1034_0_growList_NONNULL -> f1232_0_growList_InvokeMethod : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg3P_12, arg4'=arg2, arg5'=arg5P_12, arg6'=arg6P_12, [ -7+arg1P_12<=arg1 && arg2>1 && 1+arg2P_12<=arg1 && 1+arg5P_12<=arg1 && arg1>0 && arg1P_12>7 && arg2P_12>-1 && arg5P_12>-1 ], cost: 1
     13: f1034_0_growList_NONNULL -> f1034_0_growList_NONNULL : arg1'=arg1P_14, arg3'=arg3P_14, arg4'=arg4P_14, arg5'=arg5P_14, arg6'=arg6P_14, [ 4+arg1P_14<=arg1 && arg2>1 && arg1>4 && arg1P_14>0 ], cost: 1
      5: f998_0_createTree_GE -> f495_0_createTree_GT : arg1'=-1+arg2, arg2'=arg5, arg3'=arg6, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg4>0 && arg4>arg3 && arg6>1 && arg2<arg1 && arg2>-1 ], cost: 1
      6: f998_0_createTree_GE -> f998_0_createTree_GE : arg3'=1+arg3, [ arg4>0 && arg4>arg3 && arg6>1 && arg2<arg1 && arg2>-1 ], cost: 1
      7: f998_0_createTree_GE -> f998_0_createTree_GE : arg3'=1+arg3, arg6'=arg6P_8, [ arg4>0 && arg4>arg3 && arg6>1 && arg2<arg1 && arg2>-1 ], cost: 1
     12: f1232_0_growList_InvokeMethod -> f1034_0_growList_NONNULL : arg1'=arg1P_13, arg2'=arg4, arg3'=arg3P_13, arg4'=arg4P_13, arg5'=arg5P_13, arg6'=arg6P_13, [ 2+arg1P_13<=arg1 && arg4>1 && arg1P_13<=arg2 && arg1P_13<=arg5 && arg1>4 && arg2>-1 && arg5>-1 && arg1P_13>-1 ], cost: 1
     14: __init -> f1_0_main_Load : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_15, arg4'=arg4P_15, arg5'=arg5P_15, arg6'=arg6P_15, [], cost: 1

### Simplification by acceleration and chaining ###

Accelerating simple loops of location 4.
   Accelerating the following rules:
      8: f1034_0_growList_NONNULL -> f1034_0_growList_NONNULL : arg1'=arg1P_9, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [ 2+arg1P_9<=arg1 && arg2>1 && arg1>1 && arg1P_9>-1 ], cost: 1
     13: f1034_0_growList_NONNULL -> f1034_0_growList_NONNULL : arg1'=arg1P_14, arg3'=arg3P_14, arg4'=arg4P_14, arg5'=arg5P_14, arg6'=arg6P_14, [ 4+arg1P_14<=arg1 && arg2>1 && arg1>4 && arg1P_14>0 ], cost: 1

   Failed to prove monotonicity of the guard of rule 8.
   Failed to prove monotonicity of the guard of rule 13.
[accelerate] Nesting with 2 inner and 2 outer candidates

Accelerating simple loops of location 5.
   Accelerating the following rules:
      6: f998_0_createTree_GE -> f998_0_createTree_GE : arg3'=1+arg3, [ arg4>0 && arg4>arg3 && arg6>1 && arg2<arg1 && arg2>-1 ], cost: 1
      7: f998_0_createTree_GE -> f998_0_createTree_GE : arg3'=1+arg3, arg6'=arg6P_8, [ arg4>0 && arg4>arg3 && arg6>1 && arg2<arg1 && arg2>-1 ], cost: 1

   Accelerated rule 6 with backward acceleration, yielding the new rule 15.
   Failed to prove monotonicity of the guard of rule 7.
[accelerate] Nesting with 2 inner and 2 outer candidates
   Nested simple loops 6 (outer loop) and 7 (inner loop) with Rule(5 | arg4>0, arg6>1, arg2<arg1, arg2>-1, arg6P_8>1, k_2>=1, arg4>-1+2*k_2+arg3, | 2*k_2 || 5 | 2=2*k_2+arg3, 5=arg6P_8, ), resulting in the new rules: 16, 17.
   Removing the simple loops: 6.

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
      0: f1_0_main_Load -> f495_0_createTree_GT : arg1'=arg1P_1, arg3'=1, arg4'=arg4P_1, arg5'=arg5P_1, arg6'=arg6P_1, [ arg1P_1>-1 && arg2>0 && arg1>0 ], cost: 1
      1: f1_0_main_Load -> f1016_0_main_InvokeMethod : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, arg5'=arg5P_2, arg6'=arg6P_2, [ arg2>0 && arg1P_2<=arg1 && arg1>0 && arg1P_2>0 && arg2P_2>-1 ], cost: 1
      4: f495_0_createTree_GT -> f998_0_createTree_GE : arg2'=-1+arg1, arg3'=0, arg4'=arg4P_5, arg5'=arg2, arg6'=1+arg3, [ arg1>0 && arg3>0 && arg3<arg2 && arg4P_5>-1 ], cost: 1
      3: f1016_0_main_InvokeMethod -> f1034_0_growList_NONNULL : arg1'=arg1P_4, arg2'=arg3, arg3'=arg3P_4, arg4'=arg4P_4, arg5'=arg5P_4, arg6'=arg6P_4, [ arg3>1 && arg1P_4<=arg2 && arg1>0 && arg2>-1 && arg1P_4>-1 ], cost: 1
      8: f1034_0_growList_NONNULL -> f1034_0_growList_NONNULL : arg1'=arg1P_9, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [ 2+arg1P_9<=arg1 && arg2>1 && arg1>1 && arg1P_9>-1 ], cost: 1
      9: f1034_0_growList_NONNULL -> f1232_0_growList_InvokeMethod : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg2, arg5'=arg5P_10, arg6'=arg6P_10, [ 1+arg2P_10<=arg1 && arg2>1 && 1+arg5P_10<=arg1 && arg1>0 && arg1P_10>4 && arg2P_10>-1 && arg5P_10>-1 ], cost: 1
     11: f1034_0_growList_NONNULL -> f1232_0_growList_InvokeMethod : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg3P_12, arg4'=arg2, arg5'=arg5P_12, arg6'=arg6P_12, [ -7+arg1P_12<=arg1 && arg2>1 && 1+arg2P_12<=arg1 && 1+arg5P_12<=arg1 && arg1>0 && arg1P_12>7 && arg2P_12>-1 && arg5P_12>-1 ], cost: 1
     13: f1034_0_growList_NONNULL -> f1034_0_growList_NONNULL : arg1'=arg1P_14, arg3'=arg3P_14, arg4'=arg4P_14, arg5'=arg5P_14, arg6'=arg6P_14, [ 4+arg1P_14<=arg1 && arg2>1 && arg1>4 && arg1P_14>0 ], cost: 1
      5: f998_0_createTree_GE -> f495_0_createTree_GT : arg1'=-1+arg2, arg2'=arg5, arg3'=arg6, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg4>0 && arg4>arg3 && arg6>1 && arg2<arg1 && arg2>-1 ], cost: 1
      7: f998_0_createTree_GE -> f998_0_createTree_GE : arg3'=1+arg3, arg6'=arg6P_8, [ arg4>0 && arg4>arg3 && arg6>1 && arg2<arg1 && arg2>-1 ], cost: 1
     15: f998_0_createTree_GE -> f998_0_createTree_GE : arg3'=arg4, [ arg4>0 && arg6>1 && arg2<arg1 && arg2>-1 && -arg3+arg4>=0 ], cost: -arg3+arg4
     16: f998_0_createTree_GE -> f998_0_createTree_GE : arg3'=2*k_2+arg3, arg6'=arg6P_8, [ arg4>0 && arg6>1 && arg2<arg1 && arg2>-1 && arg6P_8>1 && k_2>=1 && arg4>-1+2*k_2+arg3 ], cost: 2*k_2
     17: f998_0_createTree_GE -> f998_0_createTree_GE : arg3'=1+2*k_2+arg3, arg6'=arg6P_8, [ arg4>0 && arg4>arg3 && arg6>1 && arg2<arg1 && arg2>-1 && arg6P_8>1 && k_2>=1 && arg4>2*k_2+arg3 ], cost: 1+2*k_2
     12: f1232_0_growList_InvokeMethod -> f1034_0_growList_NONNULL : arg1'=arg1P_13, arg2'=arg4, arg3'=arg3P_13, arg4'=arg4P_13, arg5'=arg5P_13, arg6'=arg6P_13, [ 2+arg1P_13<=arg1 && arg4>1 && arg1P_13<=arg2 && arg1P_13<=arg5 && arg1>4 && arg2>-1 && arg5>-1 && arg1P_13>-1 ], cost: 1
     14: __init -> f1_0_main_Load : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_15, arg4'=arg4P_15, arg5'=arg5P_15, arg6'=arg6P_15, [], cost: 1

Chained accelerated rules (with incoming rules):
   Start location: __init
      0: f1_0_main_Load -> f495_0_createTree_GT : arg1'=arg1P_1, arg3'=1, arg4'=arg4P_1, arg5'=arg5P_1, arg6'=arg6P_1, [ arg1P_1>-1 && arg2>0 && arg1>0 ], cost: 1
      1: f1_0_main_Load -> f1016_0_main_InvokeMethod : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, arg5'=arg5P_2, arg6'=arg6P_2, [ arg2>0 && arg1P_2<=arg1 && arg1>0 && arg1P_2>0 && arg2P_2>-1 ], cost: 1
      4: f495_0_createTree_GT -> f998_0_createTree_GE : arg2'=-1+arg1, arg3'=0, arg4'=arg4P_5, arg5'=arg2, arg6'=1+arg3, [ arg1>0 && arg3>0 && arg3<arg2 && arg4P_5>-1 ], cost: 1
     22: f495_0_createTree_GT -> f998_0_createTree_GE : arg2'=-1+arg1, arg3'=1, arg4'=arg4P_5, arg5'=arg2, arg6'=arg6P_8, [ arg1>0 && arg3>0 && arg3<arg2 && arg4P_5>0 ], cost: 2
     23: f495_0_createTree_GT -> f998_0_createTree_GE : arg2'=-1+arg1, arg3'=arg4P_5, arg4'=arg4P_5, arg5'=arg2, arg6'=1+arg3, [ arg1>0 && arg3>0 && arg3<arg2 && arg4P_5>0 ], cost: 1+arg4P_5
     24: f495_0_createTree_GT -> f998_0_createTree_GE : arg2'=-1+arg1, arg3'=2*k_2, arg4'=arg4P_5, arg5'=arg2, arg6'=arg6P_8, [ arg1>0 && arg3>0 && arg3<arg2 && arg4P_5>0 && arg6P_8>1 && k_2>=1 && arg4P_5>-1+2*k_2 ], cost: 1+2*k_2
     25: f495_0_createTree_GT -> f998_0_createTree_GE : arg2'=-1+arg1, arg3'=1+2*k_2, arg4'=arg4P_5, arg5'=arg2, arg6'=arg6P_8, [ arg1>0 && arg3>0 && arg3<arg2 && arg4P_5>0 && arg6P_8>1 && k_2>=1 && arg4P_5>2*k_2 ], cost: 2+2*k_2
      3: f1016_0_main_InvokeMethod -> f1034_0_growList_NONNULL : arg1'=arg1P_4, arg2'=arg3, arg3'=arg3P_4, arg4'=arg4P_4, arg5'=arg5P_4, arg6'=arg6P_4, [ arg3>1 && arg1P_4<=arg2 && arg1>0 && arg2>-1 && arg1P_4>-1 ], cost: 1
     18: f1016_0_main_InvokeMethod -> f1034_0_growList_NONNULL : arg1'=arg1P_9, arg2'=arg3, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [ arg3>1 && arg1>0 && arg1P_9>-1 && 2+arg1P_9<=arg2 && 2<=arg2 ], cost: 2
     20: f1016_0_main_InvokeMethod -> f1034_0_growList_NONNULL : arg1'=arg1P_14, arg2'=arg3, arg3'=arg3P_14, arg4'=arg4P_14, arg5'=arg5P_14, arg6'=arg6P_14, [ arg3>1 && arg1>0 && arg1P_14>0 && 4+arg1P_14<=arg2 && 5<=arg2 ], cost: 2
      9: f1034_0_growList_NONNULL -> f1232_0_growList_InvokeMethod : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg2, arg5'=arg5P_10, arg6'=arg6P_10, [ 1+arg2P_10<=arg1 && arg2>1 && 1+arg5P_10<=arg1 && arg1>0 && arg1P_10>4 && arg2P_10>-1 && arg5P_10>-1 ], cost: 1
     11: f1034_0_growList_NONNULL -> f1232_0_growList_InvokeMethod : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg3P_12, arg4'=arg2, arg5'=arg5P_12, arg6'=arg6P_12, [ -7+arg1P_12<=arg1 && arg2>1 && 1+arg2P_12<=arg1 && 1+arg5P_12<=arg1 && arg1>0 && arg1P_12>7 && arg2P_12>-1 && arg5P_12>-1 ], cost: 1
      5: f998_0_createTree_GE -> f495_0_createTree_GT : arg1'=-1+arg2, arg2'=arg5, arg3'=arg6, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg4>0 && arg4>arg3 && arg6>1 && arg2<arg1 && arg2>-1 ], cost: 1
     12: f1232_0_growList_InvokeMethod -> f1034_0_growList_NONNULL : arg1'=arg1P_13, arg2'=arg4, arg3'=arg3P_13, arg4'=arg4P_13, arg5'=arg5P_13, arg6'=arg6P_13, [ 2+arg1P_13<=arg1 && arg4>1 && arg1P_13<=arg2 && arg1P_13<=arg5 && arg1>4 && arg2>-1 && arg5>-1 && arg1P_13>-1 ], cost: 1
     19: f1232_0_growList_InvokeMethod -> f1034_0_growList_NONNULL : arg1'=arg1P_9, arg2'=arg4, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [ arg4>1 && arg1>4 && arg1P_9>-1 && 2+arg1P_9<=-2+arg1 && 2+arg1P_9<=arg2 && 2<=arg2 && 2+arg1P_9<=arg5 && 2<=arg5 ], cost: 2
     21: f1232_0_growList_InvokeMethod -> f1034_0_growList_NONNULL : arg1'=arg1P_14, arg2'=arg4, arg3'=arg3P_14, arg4'=arg4P_14, arg5'=arg5P_14, arg6'=arg6P_14, [ arg4>1 && arg1P_14>0 && 4+arg1P_14<=-2+arg1 && 5<=-2+arg1 && 4+arg1P_14<=arg2 && 5<=arg2 && 4+arg1P_14<=arg5 && 5<=arg5 ], cost: 2
     14: __init -> f1_0_main_Load : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_15, arg4'=arg4P_15, arg5'=arg5P_15, arg6'=arg6P_15, [], cost: 1

Eliminated locations (on tree-shaped paths):
   Start location: __init
     28: f495_0_createTree_GT -> f495_0_createTree_GT : arg1'=-2+arg1, arg2'=arg2, arg3'=1+arg3, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg1>0 && arg3>0 && arg3<arg2 && arg4P_5>0 ], cost: 2
     29: f495_0_createTree_GT -> f495_0_createTree_GT : arg1'=-2+arg1, arg2'=arg2, arg3'=arg6P_8, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg1>0 && arg3>0 && arg3<arg2 && arg4P_5>1 && arg6P_8>1 ], cost: 3
     30: f495_0_createTree_GT -> f495_0_createTree_GT : arg1'=-2+arg1, arg2'=arg2, arg3'=arg6P_8, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg1>0 && arg3>0 && arg3<arg2 && arg4P_5>0 && arg6P_8>1 && k_2>=1 && arg4P_5>2*k_2 ], cost: 2+2*k_2
     31: f495_0_createTree_GT -> f495_0_createTree_GT : arg1'=-2+arg1, arg2'=arg2, arg3'=arg6P_8, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg1>0 && arg3>0 && arg3<arg2 && arg4P_5>0 && arg6P_8>1 && k_2>=1 && arg4P_5>1+2*k_2 ], cost: 3+2*k_2
     32: f495_0_createTree_GT -> [11] : [ arg1>0 && arg3>0 && arg3<arg2 && arg4P_5>0 ], cost: 1+arg4P_5
      3: f1016_0_main_InvokeMethod -> f1034_0_growList_NONNULL : arg1'=arg1P_4, arg2'=arg3, arg3'=arg3P_4, arg4'=arg4P_4, arg5'=arg5P_4, arg6'=arg6P_4, [ arg3>1 && arg1P_4<=arg2 && arg1>0 && arg2>-1 && arg1P_4>-1 ], cost: 1
     18: f1016_0_main_InvokeMethod -> f1034_0_growList_NONNULL : arg1'=arg1P_9, arg2'=arg3, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [ arg3>1 && arg1>0 && arg1P_9>-1 && 2+arg1P_9<=arg2 && 2<=arg2 ], cost: 2
     20: f1016_0_main_InvokeMethod -> f1034_0_growList_NONNULL : arg1'=arg1P_14, arg2'=arg3, arg3'=arg3P_14, arg4'=arg4P_14, arg5'=arg5P_14, arg6'=arg6P_14, [ arg3>1 && arg1>0 && arg1P_14>0 && 4+arg1P_14<=arg2 && 5<=arg2 ], cost: 2
     33: f1034_0_growList_NONNULL -> f1034_0_growList_NONNULL : arg1'=arg1P_13, arg2'=arg2, arg3'=arg3P_13, arg4'=arg4P_13, arg5'=arg5P_13, arg6'=arg6P_13, [ 1+arg2P_10<=arg1 && arg2>1 && 1+arg5P_10<=arg1 && arg1>0 && arg1P_10>4 && arg2P_10>-1 && arg5P_10>-1 && 2+arg1P_13<=arg1P_10 && arg1P_13<=arg2P_10 && arg1P_13<=arg5P_10 && arg1P_13>-1 ], cost: 2
     34: f1034_0_growList_NONNULL -> f1034_0_growList_NONNULL : arg1'=arg1P_9, arg2'=arg2, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [ 1+arg2P_10<=arg1 && arg2>1 && 1+arg5P_10<=arg1 && arg1>0 && arg1P_10>4 && arg1P_9>-1 && 2+arg1P_9<=-2+arg1P_10 && 2+arg1P_9<=arg2P_10 && 2<=arg2P_10 && 2+arg1P_9<=arg5P_10 && 2<=arg5P_10 ], cost: 3
     35: f1034_0_growList_NONNULL -> f1034_0_growList_NONNULL : arg1'=arg1P_14, arg2'=arg2, arg3'=arg3P_14, arg4'=arg4P_14, arg5'=arg5P_14, arg6'=arg6P_14, [ 1+arg2P_10<=arg1 && arg2>1 && 1+arg5P_10<=arg1 && arg1>0 && arg1P_14>0 && 4+arg1P_14<=-2+arg1P_10 && 5<=-2+arg1P_10 && 4+arg1P_14<=arg2P_10 && 5<=arg2P_10 && 4+arg1P_14<=arg5P_10 && 5<=arg5P_10 ], cost: 3
     36: f1034_0_growList_NONNULL -> f1034_0_growList_NONNULL : arg1'=arg1P_13, arg2'=arg2, arg3'=arg3P_13, arg4'=arg4P_13, arg5'=arg5P_13, arg6'=arg6P_13, [ -7+arg1P_12<=arg1 && arg2>1 && 1+arg2P_12<=arg1 && 1+arg5P_12<=arg1 && arg1>0 && arg1P_12>7 && arg2P_12>-1 && arg5P_12>-1 && 2+arg1P_13<=arg1P_12 && arg1P_13<=arg2P_12 && arg1P_13<=arg5P_12 && arg1P_13>-1 ], cost: 2
     37: f1034_0_growList_NONNULL -> f1034_0_growList_NONNULL : arg1'=arg1P_9, arg2'=arg2, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [ -7+arg1P_12<=arg1 && arg2>1 && 1+arg2P_12<=arg1 && 1+arg5P_12<=arg1 && arg1>0 && arg1P_12>7 && arg1P_9>-1 && 2+arg1P_9<=-2+arg1P_12 && 2+arg1P_9<=arg2P_12 && 2<=arg2P_12 && 2+arg1P_9<=arg5P_12 && 2<=arg5P_12 ], cost: 3
     38: f1034_0_growList_NONNULL -> f1034_0_growList_NONNULL : arg1'=arg1P_14, arg2'=arg2, arg3'=arg3P_14, arg4'=arg4P_14, arg5'=arg5P_14, arg6'=arg6P_14, [ -7+arg1P_12<=arg1 && arg2>1 && 1+arg2P_12<=arg1 && 1+arg5P_12<=arg1 && arg1>0 && arg1P_12>7 && arg1P_14>0 && 4+arg1P_14<=-2+arg1P_12 && 4+arg1P_14<=arg2P_12 && 5<=arg2P_12 && 4+arg1P_14<=arg5P_12 && 5<=arg5P_12 ], cost: 3
     26: __init -> f495_0_createTree_GT : arg1'=arg1P_1, arg2'=arg2P_15, arg3'=1, arg4'=arg4P_1, arg5'=arg5P_1, arg6'=arg6P_1, [ arg1P_1>-1 && arg2P_15>0 && arg1P_15>0 ], cost: 2
     27: __init -> f1016_0_main_InvokeMethod : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, arg5'=arg5P_2, arg6'=arg6P_2, [ arg2P_15>0 && arg1P_2<=arg1P_15 && arg1P_15>0 && arg1P_2>0 && arg2P_2>-1 ], cost: 2

Applied pruning (of leafs and parallel rules):
   Start location: __init
     28: f495_0_createTree_GT -> f495_0_createTree_GT : arg1'=-2+arg1, arg2'=arg2, arg3'=1+arg3, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg1>0 && arg3>0 && arg3<arg2 && arg4P_5>0 ], cost: 2
     29: f495_0_createTree_GT -> f495_0_createTree_GT : arg1'=-2+arg1, arg2'=arg2, arg3'=arg6P_8, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg1>0 && arg3>0 && arg3<arg2 && arg4P_5>1 && arg6P_8>1 ], cost: 3
     30: f495_0_createTree_GT -> f495_0_createTree_GT : arg1'=-2+arg1, arg2'=arg2, arg3'=arg6P_8, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg1>0 && arg3>0 && arg3<arg2 && arg4P_5>0 && arg6P_8>1 && k_2>=1 && arg4P_5>2*k_2 ], cost: 2+2*k_2
     31: f495_0_createTree_GT -> f495_0_createTree_GT : arg1'=-2+arg1, arg2'=arg2, arg3'=arg6P_8, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg1>0 && arg3>0 && arg3<arg2 && arg4P_5>0 && arg6P_8>1 && k_2>=1 && arg4P_5>1+2*k_2 ], cost: 3+2*k_2
     32: f495_0_createTree_GT -> [11] : [ arg1>0 && arg3>0 && arg3<arg2 && arg4P_5>0 ], cost: 1+arg4P_5
      3: f1016_0_main_InvokeMethod -> f1034_0_growList_NONNULL : arg1'=arg1P_4, arg2'=arg3, arg3'=arg3P_4, arg4'=arg4P_4, arg5'=arg5P_4, arg6'=arg6P_4, [ arg3>1 && arg1P_4<=arg2 && arg1>0 && arg2>-1 && arg1P_4>-1 ], cost: 1
     18: f1016_0_main_InvokeMethod -> f1034_0_growList_NONNULL : arg1'=arg1P_9, arg2'=arg3, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [ arg3>1 && arg1>0 && arg1P_9>-1 && 2+arg1P_9<=arg2 && 2<=arg2 ], cost: 2
     20: f1016_0_main_InvokeMethod -> f1034_0_growList_NONNULL : arg1'=arg1P_14, arg2'=arg3, arg3'=arg3P_14, arg4'=arg4P_14, arg5'=arg5P_14, arg6'=arg6P_14, [ arg3>1 && arg1>0 && arg1P_14>0 && 4+arg1P_14<=arg2 && 5<=arg2 ], cost: 2
     33: f1034_0_growList_NONNULL -> f1034_0_growList_NONNULL : arg1'=arg1P_13, arg2'=arg2, arg3'=arg3P_13, arg4'=arg4P_13, arg5'=arg5P_13, arg6'=arg6P_13, [ 1+arg2P_10<=arg1 && arg2>1 && 1+arg5P_10<=arg1 && arg1>0 && arg1P_10>4 && arg2P_10>-1 && arg5P_10>-1 && 2+arg1P_13<=arg1P_10 && arg1P_13<=arg2P_10 && arg1P_13<=arg5P_10 && arg1P_13>-1 ], cost: 2
     34: f1034_0_growList_NONNULL -> f1034_0_growList_NONNULL : arg1'=arg1P_9, arg2'=arg2, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [ 1+arg2P_10<=arg1 && arg2>1 && 1+arg5P_10<=arg1 && arg1>0 && arg1P_10>4 && arg1P_9>-1 && 2+arg1P_9<=-2+arg1P_10 && 2+arg1P_9<=arg2P_10 && 2<=arg2P_10 && 2+arg1P_9<=arg5P_10 && 2<=arg5P_10 ], cost: 3
     35: f1034_0_growList_NONNULL -> f1034_0_growList_NONNULL : arg1'=arg1P_14, arg2'=arg2, arg3'=arg3P_14, arg4'=arg4P_14, arg5'=arg5P_14, arg6'=arg6P_14, [ 1+arg2P_10<=arg1 && arg2>1 && 1+arg5P_10<=arg1 && arg1>0 && arg1P_14>0 && 4+arg1P_14<=-2+arg1P_10 && 5<=-2+arg1P_10 && 4+arg1P_14<=arg2P_10 && 5<=arg2P_10 && 4+arg1P_14<=arg5P_10 && 5<=arg5P_10 ], cost: 3
     36: f1034_0_growList_NONNULL -> f1034_0_growList_NONNULL : arg1'=arg1P_13, arg2'=arg2, arg3'=arg3P_13, arg4'=arg4P_13, arg5'=arg5P_13, arg6'=arg6P_13, [ -7+arg1P_12<=arg1 && arg2>1 && 1+arg2P_12<=arg1 && 1+arg5P_12<=arg1 && arg1>0 && arg1P_12>7 && arg2P_12>-1 && arg5P_12>-1 && 2+arg1P_13<=arg1P_12 && arg1P_13<=arg2P_12 && arg1P_13<=arg5P_12 && arg1P_13>-1 ], cost: 2
     38: f1034_0_growList_NONNULL -> f1034_0_growList_NONNULL : arg1'=arg1P_14, arg2'=arg2, arg3'=arg3P_14, arg4'=arg4P_14, arg5'=arg5P_14, arg6'=arg6P_14, [ -7+arg1P_12<=arg1 && arg2>1 && 1+arg2P_12<=arg1 && 1+arg5P_12<=arg1 && arg1>0 && arg1P_12>7 && arg1P_14>0 && 4+arg1P_14<=-2+arg1P_12 && 4+arg1P_14<=arg2P_12 && 5<=arg2P_12 && 4+arg1P_14<=arg5P_12 && 5<=arg5P_12 ], cost: 3
     26: __init -> f495_0_createTree_GT : arg1'=arg1P_1, arg2'=arg2P_15, arg3'=1, arg4'=arg4P_1, arg5'=arg5P_1, arg6'=arg6P_1, [ arg1P_1>-1 && arg2P_15>0 && arg1P_15>0 ], cost: 2
     27: __init -> f1016_0_main_InvokeMethod : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, arg5'=arg5P_2, arg6'=arg6P_2, [ arg2P_15>0 && arg1P_2<=arg1P_15 && arg1P_15>0 && arg1P_2>0 && arg2P_2>-1 ], cost: 2

Accelerating simple loops of location 1.
[accelerate] Removed some duplicate simple loops
   Simplified some of the simple loops (and removed duplicate rules).
   Accelerating the following rules:
     28: f495_0_createTree_GT -> f495_0_createTree_GT : arg1'=-2+arg1, arg3'=1+arg3, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg1>0 && arg3>0 && arg3<arg2 ], cost: 2
     29: f495_0_createTree_GT -> f495_0_createTree_GT : arg1'=-2+arg1, arg3'=arg6P_8, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg1>0 && arg3>0 && arg3<arg2 && arg6P_8>1 ], cost: 3
     31: f495_0_createTree_GT -> f495_0_createTree_GT : arg1'=-2+arg1, arg3'=arg6P_8, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg1>0 && arg3>0 && arg3<arg2 && arg6P_8>1 && k_2>=1 ], cost: 3+2*k_2

   Accelerated rule 28 with backward acceleration, yielding the new rule 39.
[test] deduced pseudo-invariant -arg6P_8+arg3<=0, also trying arg6P_8-arg3<=-1
   Accelerated rule 29 with backward acceleration, yielding the new rule 40.
[test] deduced pseudo-invariant -arg6P_8+arg3<=0, also trying arg6P_8-arg3<=-1
   Accelerated rule 31 with backward acceleration, yielding the new rule 41.
[accelerate] Nesting with 3 inner and 3 outer candidates
   Nested simple loops 31 (outer loop) and 40 (inner loop) with Rule(1 | arg3>0, arg6P_8>1, -arg6P_8+arg3<=0, k_5>=1, arg6P_8<arg2, k_2>=1, k_10>=1, 2-2*(-1+k_10)*k_5-2*k_10+arg1-2*k_5>0, | 2*k_10*k_2+3*k_10+3*k_10*k_5 || 1 | 0=-2*k_10+arg1-2*k_10*k_5, 2=arg6P_8, 3=arg4P_6, 4=arg5P_6, 5=arg6P_6, ), resulting in the new rules: 42, 43.
   Removing the simple loops: 28 31.

Accelerating simple loops of location 4.
[accelerate] Removed some duplicate simple loops
   Simplified some of the simple loops (and removed duplicate rules).
   Accelerating the following rules:
     34: f1034_0_growList_NONNULL -> f1034_0_growList_NONNULL : arg1'=arg1P_9, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [ arg2>1 && arg1P_9>-1 && 2+arg1P_9<=-1+arg1 && 2<=-1+arg1 ], cost: 3
     36: f1034_0_growList_NONNULL -> f1034_0_growList_NONNULL : arg1'=arg1P_13, arg3'=arg3P_13, arg4'=arg4P_13, arg5'=arg5P_13, arg6'=arg6P_13, [ arg2>1 && arg1>0 && arg1P_13>-1 && arg1P_13<=-1+arg1 ], cost: 2
     38: f1034_0_growList_NONNULL -> f1034_0_growList_NONNULL : arg1'=arg1P_14, arg3'=arg3P_14, arg4'=arg4P_14, arg5'=arg5P_14, arg6'=arg6P_14, [ arg2>1 && arg1P_14>0 && 4+arg1P_14<=-1+arg1 && 5<=-1+arg1 ], cost: 3

   Failed to prove monotonicity of the guard of rule 34.
   Failed to prove monotonicity of the guard of rule 36.
   Failed to prove monotonicity of the guard of rule 38.
[accelerate] Nesting with 3 inner and 3 outer candidates

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
     29: f495_0_createTree_GT -> f495_0_createTree_GT : arg1'=-2+arg1, arg3'=arg6P_8, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg1>0 && arg3>0 && arg3<arg2 && arg6P_8>1 ], cost: 3
     32: f495_0_createTree_GT -> [11] : [ arg1>0 && arg3>0 && arg3<arg2 && arg4P_5>0 ], cost: 1+arg4P_5
     39: f495_0_createTree_GT -> f495_0_createTree_GT : arg1'=-2*k_3+arg1, arg3'=arg3+k_3, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg3>0 && k_3>=1 && 2-2*k_3+arg1>0 && -1+arg3+k_3<arg2 ], cost: 2*k_3
     40: f495_0_createTree_GT -> f495_0_createTree_GT : arg1'=arg1-2*k_5, arg3'=arg6P_8, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg3>0 && arg6P_8>1 && -arg6P_8+arg3<=0 && k_5>=1 && 2+arg1-2*k_5>0 && arg6P_8<arg2 ], cost: 3*k_5
     41: f495_0_createTree_GT -> f495_0_createTree_GT : arg1'=-2*k_8+arg1, arg3'=arg6P_8, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg3>0 && arg6P_8>1 && k_2>=1 && -arg6P_8+arg3<=0 && k_8>=1 && 2-2*k_8+arg1>0 && arg6P_8<arg2 ], cost: 2*k_2*k_8+3*k_8
     42: f495_0_createTree_GT -> f495_0_createTree_GT : arg1'=-2*k_10+arg1-2*k_10*k_5, arg3'=arg6P_8, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg3>0 && arg6P_8>1 && -arg6P_8+arg3<=0 && k_5>=1 && arg6P_8<arg2 && k_2>=1 && k_10>=1 && 2-2*(-1+k_10)*k_5-2*k_10+arg1-2*k_5>0 ], cost: 2*k_10*k_2+3*k_10+3*k_10*k_5
     43: f495_0_createTree_GT -> f495_0_createTree_GT : arg1'=-2-2*k_10+arg1-2*k_10*k_5, arg3'=arg6P_8, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg1>0 && arg3>0 && arg3<arg2 && arg6P_8>1 && k_2>=1 && k_5>=1 && arg6P_8<arg2 && k_10>=1 && -2*(-1+k_10)*k_5-2*k_10+arg1-2*k_5>0 ], cost: 3+2*k_10*k_2+3*k_10+2*k_2+3*k_10*k_5
      3: f1016_0_main_InvokeMethod -> f1034_0_growList_NONNULL : arg1'=arg1P_4, arg2'=arg3, arg3'=arg3P_4, arg4'=arg4P_4, arg5'=arg5P_4, arg6'=arg6P_4, [ arg3>1 && arg1P_4<=arg2 && arg1>0 && arg2>-1 && arg1P_4>-1 ], cost: 1
     18: f1016_0_main_InvokeMethod -> f1034_0_growList_NONNULL : arg1'=arg1P_9, arg2'=arg3, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [ arg3>1 && arg1>0 && arg1P_9>-1 && 2+arg1P_9<=arg2 && 2<=arg2 ], cost: 2
     20: f1016_0_main_InvokeMethod -> f1034_0_growList_NONNULL : arg1'=arg1P_14, arg2'=arg3, arg3'=arg3P_14, arg4'=arg4P_14, arg5'=arg5P_14, arg6'=arg6P_14, [ arg3>1 && arg1>0 && arg1P_14>0 && 4+arg1P_14<=arg2 && 5<=arg2 ], cost: 2
     34: f1034_0_growList_NONNULL -> f1034_0_growList_NONNULL : arg1'=arg1P_9, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [ arg2>1 && arg1P_9>-1 && 2+arg1P_9<=-1+arg1 && 2<=-1+arg1 ], cost: 3
     36: f1034_0_growList_NONNULL -> f1034_0_growList_NONNULL : arg1'=arg1P_13, arg3'=arg3P_13, arg4'=arg4P_13, arg5'=arg5P_13, arg6'=arg6P_13, [ arg2>1 && arg1>0 && arg1P_13>-1 && arg1P_13<=-1+arg1 ], cost: 2
     38: f1034_0_growList_NONNULL -> f1034_0_growList_NONNULL : arg1'=arg1P_14, arg3'=arg3P_14, arg4'=arg4P_14, arg5'=arg5P_14, arg6'=arg6P_14, [ arg2>1 && arg1P_14>0 && 4+arg1P_14<=-1+arg1 && 5<=-1+arg1 ], cost: 3
     26: __init -> f495_0_createTree_GT : arg1'=arg1P_1, arg2'=arg2P_15, arg3'=1, arg4'=arg4P_1, arg5'=arg5P_1, arg6'=arg6P_1, [ arg1P_1>-1 && arg2P_15>0 && arg1P_15>0 ], cost: 2
     27: __init -> f1016_0_main_InvokeMethod : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, arg5'=arg5P_2, arg6'=arg6P_2, [ arg2P_15>0 && arg1P_2<=arg1P_15 && arg1P_15>0 && arg1P_2>0 && arg2P_2>-1 ], cost: 2

Chained accelerated rules (with incoming rules):
   Start location: __init
     32: f495_0_createTree_GT -> [11] : [ arg1>0 && arg3>0 && arg3<arg2 && arg4P_5>0 ], cost: 1+arg4P_5
      3: f1016_0_main_InvokeMethod -> f1034_0_growList_NONNULL : arg1'=arg1P_4, arg2'=arg3, arg3'=arg3P_4, arg4'=arg4P_4, arg5'=arg5P_4, arg6'=arg6P_4, [ arg3>1 && arg1P_4<=arg2 && arg1>0 && arg2>-1 && arg1P_4>-1 ], cost: 1
     18: f1016_0_main_InvokeMethod -> f1034_0_growList_NONNULL : arg1'=arg1P_9, arg2'=arg3, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [ arg3>1 && arg1>0 && arg1P_9>-1 && 2+arg1P_9<=arg2 && 2<=arg2 ], cost: 2
     20: f1016_0_main_InvokeMethod -> f1034_0_growList_NONNULL : arg1'=arg1P_14, arg2'=arg3, arg3'=arg3P_14, arg4'=arg4P_14, arg5'=arg5P_14, arg6'=arg6P_14, [ arg3>1 && arg1>0 && arg1P_14>0 && 4+arg1P_14<=arg2 && 5<=arg2 ], cost: 2
     50: f1016_0_main_InvokeMethod -> f1034_0_growList_NONNULL : arg1'=arg1P_9, arg2'=arg3, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [ arg3>1 && arg1>0 && arg1P_9>-1 && 3+arg1P_9<=arg2 && 3<=arg2 ], cost: 4
     51: f1016_0_main_InvokeMethod -> f1034_0_growList_NONNULL : arg1'=arg1P_9, arg2'=arg3, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [ arg3>1 && arg1>0 && arg1P_9>-1 && 3+arg1P_9<=-4+arg2 && 3<=-4+arg2 ], cost: 5
     52: f1016_0_main_InvokeMethod -> f1034_0_growList_NONNULL : arg1'=arg1P_13, arg2'=arg3, arg3'=arg3P_13, arg4'=arg4P_13, arg5'=arg5P_13, arg6'=arg6P_13, [ arg3>1 && arg1>0 && arg1P_13>-1 && 1<=arg2 && 1+arg1P_13<=arg2 ], cost: 3
     53: f1016_0_main_InvokeMethod -> f1034_0_growList_NONNULL : arg1'=arg1P_13, arg2'=arg3, arg3'=arg3P_13, arg4'=arg4P_13, arg5'=arg5P_13, arg6'=arg6P_13, [ arg3>1 && arg1>0 && arg1P_13>-1 && 1<=-2+arg2 && 1+arg1P_13<=-2+arg2 ], cost: 4
     54: f1016_0_main_InvokeMethod -> f1034_0_growList_NONNULL : arg1'=arg1P_13, arg2'=arg3, arg3'=arg3P_13, arg4'=arg4P_13, arg5'=arg5P_13, arg6'=arg6P_13, [ arg3>1 && arg1>0 && 5<=arg2 && arg1P_13>-1 && 1+arg1P_13<=-4+arg2 ], cost: 4
     55: f1016_0_main_InvokeMethod -> f1034_0_growList_NONNULL : arg1'=arg1P_14, arg2'=arg3, arg3'=arg3P_14, arg4'=arg4P_14, arg5'=arg5P_14, arg6'=arg6P_14, [ arg3>1 && arg1>0 && arg1P_14>0 && 5+arg1P_14<=arg2 && 6<=arg2 ], cost: 4
     56: f1016_0_main_InvokeMethod -> f1034_0_growList_NONNULL : arg1'=arg1P_14, arg2'=arg3, arg3'=arg3P_14, arg4'=arg4P_14, arg5'=arg5P_14, arg6'=arg6P_14, [ arg3>1 && arg1>0 && arg1P_14>0 && 5+arg1P_14<=-2+arg2 && 6<=-2+arg2 ], cost: 5
     26: __init -> f495_0_createTree_GT : arg1'=arg1P_1, arg2'=arg2P_15, arg3'=1, arg4'=arg4P_1, arg5'=arg5P_1, arg6'=arg6P_1, [ arg1P_1>-1 && arg2P_15>0 && arg1P_15>0 ], cost: 2
     27: __init -> f1016_0_main_InvokeMethod : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, arg5'=arg5P_2, arg6'=arg6P_2, [ arg2P_15>0 && arg1P_2<=arg1P_15 && arg1P_15>0 && arg1P_2>0 && arg2P_2>-1 ], cost: 2
     44: __init -> f495_0_createTree_GT : arg1'=-2+arg1P_1, arg2'=arg2P_15, arg3'=arg6P_8, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg1P_1>0 && 1<arg2P_15 && arg6P_8>1 ], cost: 5
     45: __init -> f495_0_createTree_GT : arg1'=-2*k_3+arg1P_1, arg2'=arg2P_15, arg3'=1+k_3, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg1P_1>-1 && arg2P_15>0 && k_3>=1 && 2-2*k_3+arg1P_1>0 && k_3<arg2P_15 ], cost: 2+2*k_3
     46: __init -> f495_0_createTree_GT : arg1'=arg1P_1-2*k_5, arg2'=arg2P_15, arg3'=arg6P_8, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg1P_1>-1 && arg2P_15>0 && arg6P_8>1 && k_5>=1 && 2+arg1P_1-2*k_5>0 && arg6P_8<arg2P_15 ], cost: 2+3*k_5
     47: __init -> f495_0_createTree_GT : arg1'=-2*k_8+arg1P_1, arg2'=arg2P_15, arg3'=arg6P_8, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg1P_1>-1 && arg2P_15>0 && arg6P_8>1 && k_2>=1 && k_8>=1 && 2-2*k_8+arg1P_1>0 && arg6P_8<arg2P_15 ], cost: 2+2*k_2*k_8+3*k_8
     48: __init -> f495_0_createTree_GT : arg1'=-2*k_10+arg1P_1-2*k_10*k_5, arg2'=arg2P_15, arg3'=arg6P_8, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg1P_1>-1 && arg2P_15>0 && arg6P_8>1 && k_5>=1 && arg6P_8<arg2P_15 && k_2>=1 && k_10>=1 && 2-2*(-1+k_10)*k_5-2*k_10+arg1P_1-2*k_5>0 ], cost: 2+2*k_10*k_2+3*k_10+3*k_10*k_5
     49: __init -> f495_0_createTree_GT : arg1'=-2-2*k_10+arg1P_1-2*k_10*k_5, arg2'=arg2P_15, arg3'=arg6P_8, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg1P_1>0 && 1<arg2P_15 && arg6P_8>1 && k_2>=1 && k_5>=1 && arg6P_8<arg2P_15 && k_10>=1 && -2*(-1+k_10)*k_5-2*k_10+arg1P_1-2*k_5>0 ], cost: 5+2*k_10*k_2+3*k_10+2*k_2+3*k_10*k_5

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
     32: f495_0_createTree_GT -> [11] : [ arg1>0 && arg3>0 && arg3<arg2 && arg4P_5>0 ], cost: 1+arg4P_5
     26: __init -> f495_0_createTree_GT : arg1'=arg1P_1, arg2'=arg2P_15, arg3'=1, arg4'=arg4P_1, arg5'=arg5P_1, arg6'=arg6P_1, [ arg1P_1>-1 && arg2P_15>0 && arg1P_15>0 ], cost: 2
     44: __init -> f495_0_createTree_GT : arg1'=-2+arg1P_1, arg2'=arg2P_15, arg3'=arg6P_8, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg1P_1>0 && 1<arg2P_15 && arg6P_8>1 ], cost: 5
     45: __init -> f495_0_createTree_GT : arg1'=-2*k_3+arg1P_1, arg2'=arg2P_15, arg3'=1+k_3, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg1P_1>-1 && arg2P_15>0 && k_3>=1 && 2-2*k_3+arg1P_1>0 && k_3<arg2P_15 ], cost: 2+2*k_3
     46: __init -> f495_0_createTree_GT : arg1'=arg1P_1-2*k_5, arg2'=arg2P_15, arg3'=arg6P_8, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg1P_1>-1 && arg2P_15>0 && arg6P_8>1 && k_5>=1 && 2+arg1P_1-2*k_5>0 && arg6P_8<arg2P_15 ], cost: 2+3*k_5
     47: __init -> f495_0_createTree_GT : arg1'=-2*k_8+arg1P_1, arg2'=arg2P_15, arg3'=arg6P_8, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg1P_1>-1 && arg2P_15>0 && arg6P_8>1 && k_2>=1 && k_8>=1 && 2-2*k_8+arg1P_1>0 && arg6P_8<arg2P_15 ], cost: 2+2*k_2*k_8+3*k_8
     48: __init -> f495_0_createTree_GT : arg1'=-2*k_10+arg1P_1-2*k_10*k_5, arg2'=arg2P_15, arg3'=arg6P_8, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg1P_1>-1 && arg2P_15>0 && arg6P_8>1 && k_5>=1 && arg6P_8<arg2P_15 && k_2>=1 && k_10>=1 && 2-2*(-1+k_10)*k_5-2*k_10+arg1P_1-2*k_5>0 ], cost: 2+2*k_10*k_2+3*k_10+3*k_10*k_5
     49: __init -> f495_0_createTree_GT : arg1'=-2-2*k_10+arg1P_1-2*k_10*k_5, arg2'=arg2P_15, arg3'=arg6P_8, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg1P_1>0 && 1<arg2P_15 && arg6P_8>1 && k_2>=1 && k_5>=1 && arg6P_8<arg2P_15 && k_10>=1 && -2*(-1+k_10)*k_5-2*k_10+arg1P_1-2*k_5>0 ], cost: 5+2*k_10*k_2+3*k_10+2*k_2+3*k_10*k_5

Eliminated locations (on tree-shaped paths):
   Start location: __init
     57: __init -> [11] : arg1'=arg1P_1, arg2'=arg2P_15, arg3'=1, arg4'=arg4P_1, arg5'=arg5P_1, arg6'=arg6P_1, [ arg1P_15>0 && arg1P_1>0 && 1<arg2P_15 && arg4P_5>0 ], cost: 3+arg4P_5
     58: __init -> [11] : arg1'=-2+arg1P_1, arg2'=arg2P_15, arg3'=arg6P_8, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ 1<arg2P_15 && arg6P_8>1 && -2+arg1P_1>0 && arg6P_8<arg2P_15 && arg4P_5>0 ], cost: 6+arg4P_5
     59: __init -> [11] : arg1'=-2*k_3+arg1P_1, arg2'=arg2P_15, arg3'=1+k_3, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg1P_1>-1 && arg2P_15>0 && k_3>=1 && -2*k_3+arg1P_1>0 && 1+k_3<arg2P_15 && arg4P_5>0 ], cost: 3+arg4P_5+2*k_3
     60: __init -> [11] : arg1'=arg1P_1-2*k_5, arg2'=arg2P_15, arg3'=arg6P_8, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg1P_1>-1 && arg2P_15>0 && arg6P_8>1 && k_5>=1 && arg6P_8<arg2P_15 && arg1P_1-2*k_5>0 && arg4P_5>0 ], cost: 3+arg4P_5+3*k_5
     61: __init -> [11] : arg1'=-2*k_8+arg1P_1, arg2'=arg2P_15, arg3'=arg6P_8, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg1P_1>-1 && arg2P_15>0 && arg6P_8>1 && k_2>=1 && k_8>=1 && arg6P_8<arg2P_15 && -2*k_8+arg1P_1>0 && arg4P_5>0 ], cost: 3+2*k_2*k_8+arg4P_5+3*k_8
     62: __init -> [11] : arg1'=-2*k_10+arg1P_1-2*k_10*k_5, arg2'=arg2P_15, arg3'=arg6P_8, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg1P_1>-1 && arg2P_15>0 && arg6P_8>1 && k_5>=1 && arg6P_8<arg2P_15 && k_2>=1 && k_10>=1 && -2*k_10+arg1P_1-2*k_10*k_5>0 && arg4P_5>0 ], cost: 3+2*k_10*k_2+3*k_10+arg4P_5+3*k_10*k_5
     63: __init -> [11] : arg1'=-2-2*k_10+arg1P_1-2*k_10*k_5, arg2'=arg2P_15, arg3'=arg6P_8, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg1P_1>0 && 1<arg2P_15 && arg6P_8>1 && k_2>=1 && k_5>=1 && arg6P_8<arg2P_15 && k_10>=1 && -2-2*k_10+arg1P_1-2*k_10*k_5>0 && arg4P_5>0 ], cost: 6+2*k_10*k_2+3*k_10+arg4P_5+2*k_2+3*k_10*k_5

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     57: __init -> [11] : arg1'=arg1P_1, arg2'=arg2P_15, arg3'=1, arg4'=arg4P_1, arg5'=arg5P_1, arg6'=arg6P_1, [ arg1P_15>0 && arg1P_1>0 && 1<arg2P_15 && arg4P_5>0 ], cost: 3+arg4P_5
     58: __init -> [11] : arg1'=-2+arg1P_1, arg2'=arg2P_15, arg3'=arg6P_8, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ 1<arg2P_15 && arg6P_8>1 && -2+arg1P_1>0 && arg6P_8<arg2P_15 && arg4P_5>0 ], cost: 6+arg4P_5
     59: __init -> [11] : arg1'=-2*k_3+arg1P_1, arg2'=arg2P_15, arg3'=1+k_3, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg1P_1>-1 && arg2P_15>0 && k_3>=1 && -2*k_3+arg1P_1>0 && 1+k_3<arg2P_15 && arg4P_5>0 ], cost: 3+arg4P_5+2*k_3
     60: __init -> [11] : arg1'=arg1P_1-2*k_5, arg2'=arg2P_15, arg3'=arg6P_8, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg1P_1>-1 && arg2P_15>0 && arg6P_8>1 && k_5>=1 && arg6P_8<arg2P_15 && arg1P_1-2*k_5>0 && arg4P_5>0 ], cost: 3+arg4P_5+3*k_5
     61: __init -> [11] : arg1'=-2*k_8+arg1P_1, arg2'=arg2P_15, arg3'=arg6P_8, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg1P_1>-1 && arg2P_15>0 && arg6P_8>1 && k_2>=1 && k_8>=1 && arg6P_8<arg2P_15 && -2*k_8+arg1P_1>0 && arg4P_5>0 ], cost: 3+2*k_2*k_8+arg4P_5+3*k_8
     62: __init -> [11] : arg1'=-2*k_10+arg1P_1-2*k_10*k_5, arg2'=arg2P_15, arg3'=arg6P_8, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg1P_1>-1 && arg2P_15>0 && arg6P_8>1 && k_5>=1 && arg6P_8<arg2P_15 && k_2>=1 && k_10>=1 && -2*k_10+arg1P_1-2*k_10*k_5>0 && arg4P_5>0 ], cost: 3+2*k_10*k_2+3*k_10+arg4P_5+3*k_10*k_5
     63: __init -> [11] : arg1'=-2-2*k_10+arg1P_1-2*k_10*k_5, arg2'=arg2P_15, arg3'=arg6P_8, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg1P_1>0 && 1<arg2P_15 && arg6P_8>1 && k_2>=1 && k_5>=1 && arg6P_8<arg2P_15 && k_10>=1 && -2-2*k_10+arg1P_1-2*k_10*k_5>0 && arg4P_5>0 ], cost: 6+2*k_10*k_2+3*k_10+arg4P_5+2*k_2+3*k_10*k_5

Computing asymptotic complexity for rule 61
   Simplified the guard:
     61: __init -> [11] : arg1'=-2*k_8+arg1P_1, arg2'=arg2P_15, arg3'=arg6P_8, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg6P_8>1 && k_2>=1 && k_8>=1 && arg6P_8<arg2P_15 && -2*k_8+arg1P_1>0 && arg4P_5>0 ], cost: 3+2*k_2*k_8+arg4P_5+3*k_8
   Resulting cost 0 has complexity: Unknown

Computing asymptotic complexity for rule 62
   Simplified the guard:
     62: __init -> [11] : arg1'=-2*k_10+arg1P_1-2*k_10*k_5, arg2'=arg2P_15, arg3'=arg6P_8, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg6P_8>1 && k_5>=1 && arg6P_8<arg2P_15 && k_2>=1 && k_10>=1 && -2*k_10+arg1P_1-2*k_10*k_5>0 && arg4P_5>0 ], cost: 3+2*k_10*k_2+3*k_10+arg4P_5+3*k_10*k_5
   Resulting cost 0 has complexity: Unknown

Computing asymptotic complexity for rule 63
   Simplified the guard:
     63: __init -> [11] : arg1'=-2-2*k_10+arg1P_1-2*k_10*k_5, arg2'=arg2P_15, arg3'=arg6P_8, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg6P_8>1 && k_2>=1 && k_5>=1 && arg6P_8<arg2P_15 && k_10>=1 && -2-2*k_10+arg1P_1-2*k_10*k_5>0 && arg4P_5>0 ], cost: 6+2*k_10*k_2+3*k_10+arg4P_5+2*k_2+3*k_10*k_5
   Resulting cost 0 has complexity: Unknown

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

Computing asymptotic complexity for rule 58
   Simplified the guard:
     58: __init -> [11] : arg1'=-2+arg1P_1, arg2'=arg2P_15, arg3'=arg6P_8, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg6P_8>1 && -2+arg1P_1>0 && arg6P_8<arg2P_15 && arg4P_5>0 ], cost: 6+arg4P_5
   Resulting cost 0 has complexity: Unknown

Computing asymptotic complexity for rule 59
   Simplified the guard:
     59: __init -> [11] : arg1'=-2*k_3+arg1P_1, arg2'=arg2P_15, arg3'=1+k_3, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ k_3>=1 && -2*k_3+arg1P_1>0 && 1+k_3<arg2P_15 && arg4P_5>0 ], cost: 3+arg4P_5+2*k_3
   Resulting cost 0 has complexity: Unknown

Computing asymptotic complexity for rule 60
   Simplified the guard:
     60: __init -> [11] : arg1'=arg1P_1-2*k_5, arg2'=arg2P_15, arg3'=arg6P_8, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg6P_8>1 && k_5>=1 && arg6P_8<arg2P_15 && arg1P_1-2*k_5>0 && arg4P_5>0 ], cost: 3+arg4P_5+3*k_5
   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:  []

WORST_CASE(Omega(1),?)