WORST_CASE(Omega(1),?)

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

Initial linear ITS problem
   Start location: __init
      0: f1_0_main_Load -> f577_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 -> f1116_0_dupTree_FieldAccess : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, arg5'=arg5P_2, arg6'=arg6P_2, [ 1+arg1P_2<=arg1 && arg2>0 && arg1>0 && arg1P_2>-1 ], cost: 1
      2: f1_0_main_Load -> f1098_0_main_InvokeMethod : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, arg5'=arg5P_3, arg6'=arg6P_3, [ x11_1>-1 && arg2>0 && arg1P_3<=arg1 && arg1>0 && arg1P_3>0 && arg2P_3>0 ], cost: 1
      5: f577_0_createTree_GT -> f1081_0_createTree_GE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg2>-1 && arg1>0 && arg3>0 && arg3<arg2 && arg4P_6>-1 && arg1==arg1P_6 && -1+arg1==arg2P_6 && 0==arg3P_6 && arg2==arg5P_6 && 1+arg3==arg6P_6 ], cost: 1
      9: f1116_0_dupTree_FieldAccess -> f1152_0_dupList_NONNULL : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ 1+arg1P_10<=arg1 && arg1>0 && arg1P_10>-1 ], cost: 1
      4: f1098_0_main_InvokeMethod -> f1116_0_dupTree_FieldAccess : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, arg5'=arg5P_5, arg6'=arg6P_5, [ x17_1>0 && arg3>1 && arg1P_5<=arg2 && arg1>0 && arg2>0 && arg1P_5>0 ], cost: 1
      3: f394_0_createTree_Return -> f1098_0_main_InvokeMethod : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, arg5'=arg5P_4, arg6'=arg6P_4, [ arg1P_4<=arg1 && -1+arg2P_4<=arg1 && arg1>0 && arg1P_4>0 && arg2P_4>1 && arg2==arg3P_4 ], cost: 1
      6: f1081_0_createTree_GE -> f577_0_createTree_GT : 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 && -1+arg2==arg1P_7 && arg5==arg2P_7 && arg6==arg3P_7 ], cost: 1
      7: f1081_0_createTree_GE -> f1081_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 && arg6==arg6P_8 ], cost: 1
      8: f1081_0_createTree_GE -> f1081_0_createTree_GE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [ arg4>0 && arg4>arg3 && arg1>0 && arg6>1 && arg2<arg1 && -1+arg2<arg1 && arg2>-1 && -1+arg2<arg2 && arg1==arg1P_9 && arg2==arg2P_9 && 1+arg3==arg3P_9 && arg4==arg4P_9 && arg5==arg5P_9 ], cost: 1
     10: f1152_0_dupList_NONNULL -> f1116_0_dupTree_FieldAccess : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, arg5'=arg5P_11, arg6'=arg6P_11, [ 1+arg1P_11<=arg1 && arg1>0 && arg1P_11>-1 ], cost: 1
     11: f1152_0_dupList_NONNULL -> f1349_0_dupList_InvokeMethod : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg3P_12, arg4'=arg4P_12, arg5'=arg5P_12, arg6'=arg6P_12, [ -2+arg1P_12<=arg1 && 2+arg2P_12<=arg1 && 2+arg4P_12<=arg1 && arg1>3 && arg1P_12>5 && arg2P_12>-1 && arg4P_12>-1 && arg2==arg3P_12 ], cost: 1
     12: f1152_0_dupList_NONNULL -> f1349_0_dupList_InvokeMethod : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, arg5'=arg5P_13, arg6'=arg6P_13, [ 1+arg2P_13<=arg1 && 1+arg4P_13<=arg1 && arg1>0 && arg1P_13>10 && arg2P_13>-1 && arg4P_13>-1 && arg2==arg3P_13 ], cost: 1
     13: f1349_0_dupList_InvokeMethod -> f1152_0_dupList_NONNULL : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=arg3P_14, arg4'=arg4P_14, arg5'=arg5P_14, arg6'=arg6P_14, [ 4+arg1P_14<=arg1 && arg1P_14<=arg2 && arg1P_14<=arg4 && arg1>4 && arg2>-1 && arg4>-1 && arg1P_14>-1 && arg3==arg2P_14 ], 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 -> f577_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 -> f1116_0_dupTree_FieldAccess : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, arg5'=arg5P_2, arg6'=arg6P_2, [ 1+arg1P_2<=arg1 && arg2>0 && arg1>0 && arg1P_2>-1 ], cost: 1
      2: f1_0_main_Load -> f1098_0_main_InvokeMethod : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, arg5'=arg5P_3, arg6'=arg6P_3, [ x11_1>-1 && arg2>0 && arg1P_3<=arg1 && arg1>0 && arg1P_3>0 && arg2P_3>0 ], cost: 1
      5: f577_0_createTree_GT -> f1081_0_createTree_GE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg2>-1 && arg1>0 && arg3>0 && arg3<arg2 && arg4P_6>-1 && arg1==arg1P_6 && -1+arg1==arg2P_6 && 0==arg3P_6 && arg2==arg5P_6 && 1+arg3==arg6P_6 ], cost: 1
      9: f1116_0_dupTree_FieldAccess -> f1152_0_dupList_NONNULL : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ 1+arg1P_10<=arg1 && arg1>0 && arg1P_10>-1 ], cost: 1
      4: f1098_0_main_InvokeMethod -> f1116_0_dupTree_FieldAccess : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, arg5'=arg5P_5, arg6'=arg6P_5, [ x17_1>0 && arg3>1 && arg1P_5<=arg2 && arg1>0 && arg2>0 && arg1P_5>0 ], cost: 1
      6: f1081_0_createTree_GE -> f577_0_createTree_GT : 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 && -1+arg2==arg1P_7 && arg5==arg2P_7 && arg6==arg3P_7 ], cost: 1
      7: f1081_0_createTree_GE -> f1081_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 && arg6==arg6P_8 ], cost: 1
      8: f1081_0_createTree_GE -> f1081_0_createTree_GE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [ arg4>0 && arg4>arg3 && arg1>0 && arg6>1 && arg2<arg1 && -1+arg2<arg1 && arg2>-1 && -1+arg2<arg2 && arg1==arg1P_9 && arg2==arg2P_9 && 1+arg3==arg3P_9 && arg4==arg4P_9 && arg5==arg5P_9 ], cost: 1
     10: f1152_0_dupList_NONNULL -> f1116_0_dupTree_FieldAccess : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, arg5'=arg5P_11, arg6'=arg6P_11, [ 1+arg1P_11<=arg1 && arg1>0 && arg1P_11>-1 ], cost: 1
     11: f1152_0_dupList_NONNULL -> f1349_0_dupList_InvokeMethod : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg3P_12, arg4'=arg4P_12, arg5'=arg5P_12, arg6'=arg6P_12, [ -2+arg1P_12<=arg1 && 2+arg2P_12<=arg1 && 2+arg4P_12<=arg1 && arg1>3 && arg1P_12>5 && arg2P_12>-1 && arg4P_12>-1 && arg2==arg3P_12 ], cost: 1
     12: f1152_0_dupList_NONNULL -> f1349_0_dupList_InvokeMethod : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, arg5'=arg5P_13, arg6'=arg6P_13, [ 1+arg2P_13<=arg1 && 1+arg4P_13<=arg1 && arg1>0 && arg1P_13>10 && arg2P_13>-1 && arg4P_13>-1 && arg2==arg3P_13 ], cost: 1
     13: f1349_0_dupList_InvokeMethod -> f1152_0_dupList_NONNULL : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=arg3P_14, arg4'=arg4P_14, arg5'=arg5P_14, arg6'=arg6P_14, [ 4+arg1P_14<=arg1 && arg1P_14<=arg2 && arg1P_14<=arg4 && arg1>4 && arg2>-1 && arg4>-1 && arg1P_14>-1 && arg3==arg2P_14 ], 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 -> f577_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 -> f1116_0_dupTree_FieldAccess : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, arg5'=arg5P_2, arg6'=arg6P_2, [ 1+arg1P_2<=arg1 && arg2>0 && arg1>0 && arg1P_2>-1 ], cost: 1
      2: f1_0_main_Load -> f1098_0_main_InvokeMethod : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, arg5'=arg5P_3, arg6'=arg6P_3, [ arg2>0 && arg1P_3<=arg1 && arg1>0 && arg1P_3>0 && arg2P_3>0 ], cost: 1
      5: f577_0_createTree_GT -> f1081_0_createTree_GE : arg2'=-1+arg1, arg3'=0, arg4'=arg4P_6, arg5'=arg2, arg6'=1+arg3, [ arg1>0 && arg3>0 && arg3<arg2 && arg4P_6>-1 ], cost: 1
      9: f1116_0_dupTree_FieldAccess -> f1152_0_dupList_NONNULL : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ 1+arg1P_10<=arg1 && arg1>0 && arg1P_10>-1 ], cost: 1
      4: f1098_0_main_InvokeMethod -> f1116_0_dupTree_FieldAccess : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, arg5'=arg5P_5, arg6'=arg6P_5, [ arg3>1 && arg1P_5<=arg2 && arg1>0 && arg2>0 && arg1P_5>0 ], cost: 1
      6: f1081_0_createTree_GE -> f577_0_createTree_GT : arg1'=-1+arg2, arg2'=arg5, arg3'=arg6, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ arg4>0 && arg4>arg3 && arg6>1 && arg2<arg1 && arg2>-1 ], cost: 1
      7: f1081_0_createTree_GE -> f1081_0_createTree_GE : arg3'=1+arg3, [ arg4>0 && arg4>arg3 && arg6>1 && arg2<arg1 && arg2>-1 ], cost: 1
      8: f1081_0_createTree_GE -> f1081_0_createTree_GE : arg3'=1+arg3, arg6'=arg6P_9, [ arg4>0 && arg4>arg3 && arg6>1 && arg2<arg1 && arg2>-1 ], cost: 1
     10: f1152_0_dupList_NONNULL -> f1116_0_dupTree_FieldAccess : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, arg5'=arg5P_11, arg6'=arg6P_11, [ 1+arg1P_11<=arg1 && arg1>0 && arg1P_11>-1 ], cost: 1
     11: f1152_0_dupList_NONNULL -> f1349_0_dupList_InvokeMethod : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg2, arg4'=arg4P_12, arg5'=arg5P_12, arg6'=arg6P_12, [ -2+arg1P_12<=arg1 && 2+arg2P_12<=arg1 && 2+arg4P_12<=arg1 && arg1>3 && arg1P_12>5 && arg2P_12>-1 && arg4P_12>-1 ], cost: 1
     12: f1152_0_dupList_NONNULL -> f1349_0_dupList_InvokeMethod : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=arg2, arg4'=arg4P_13, arg5'=arg5P_13, arg6'=arg6P_13, [ 1+arg2P_13<=arg1 && 1+arg4P_13<=arg1 && arg1>0 && arg1P_13>10 && arg2P_13>-1 && arg4P_13>-1 ], cost: 1
     13: f1349_0_dupList_InvokeMethod -> f1152_0_dupList_NONNULL : arg1'=arg1P_14, arg2'=arg3, arg3'=arg3P_14, arg4'=arg4P_14, arg5'=arg5P_14, arg6'=arg6P_14, [ 4+arg1P_14<=arg1 && arg1P_14<=arg2 && arg1P_14<=arg4 && arg1>4 && arg2>-1 && arg4>-1 && arg1P_14>-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 5.
   Accelerating the following rules:
      7: f1081_0_createTree_GE -> f1081_0_createTree_GE : arg3'=1+arg3, [ arg4>0 && arg4>arg3 && arg6>1 && arg2<arg1 && arg2>-1 ], cost: 1
      8: f1081_0_createTree_GE -> f1081_0_createTree_GE : arg3'=1+arg3, arg6'=arg6P_9, [ arg4>0 && arg4>arg3 && arg6>1 && arg2<arg1 && arg2>-1 ], cost: 1

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

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
      0: f1_0_main_Load -> f577_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 -> f1116_0_dupTree_FieldAccess : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, arg5'=arg5P_2, arg6'=arg6P_2, [ 1+arg1P_2<=arg1 && arg2>0 && arg1>0 && arg1P_2>-1 ], cost: 1
      2: f1_0_main_Load -> f1098_0_main_InvokeMethod : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, arg5'=arg5P_3, arg6'=arg6P_3, [ arg2>0 && arg1P_3<=arg1 && arg1>0 && arg1P_3>0 && arg2P_3>0 ], cost: 1
      5: f577_0_createTree_GT -> f1081_0_createTree_GE : arg2'=-1+arg1, arg3'=0, arg4'=arg4P_6, arg5'=arg2, arg6'=1+arg3, [ arg1>0 && arg3>0 && arg3<arg2 && arg4P_6>-1 ], cost: 1
      9: f1116_0_dupTree_FieldAccess -> f1152_0_dupList_NONNULL : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ 1+arg1P_10<=arg1 && arg1>0 && arg1P_10>-1 ], cost: 1
      4: f1098_0_main_InvokeMethod -> f1116_0_dupTree_FieldAccess : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, arg5'=arg5P_5, arg6'=arg6P_5, [ arg3>1 && arg1P_5<=arg2 && arg1>0 && arg2>0 && arg1P_5>0 ], cost: 1
      6: f1081_0_createTree_GE -> f577_0_createTree_GT : arg1'=-1+arg2, arg2'=arg5, arg3'=arg6, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ arg4>0 && arg4>arg3 && arg6>1 && arg2<arg1 && arg2>-1 ], cost: 1
      8: f1081_0_createTree_GE -> f1081_0_createTree_GE : arg3'=1+arg3, arg6'=arg6P_9, [ arg4>0 && arg4>arg3 && arg6>1 && arg2<arg1 && arg2>-1 ], cost: 1
     15: f1081_0_createTree_GE -> f1081_0_createTree_GE : arg3'=arg4, [ arg4>0 && arg6>1 && arg2<arg1 && arg2>-1 && -arg3+arg4>=0 ], cost: -arg3+arg4
     16: f1081_0_createTree_GE -> f1081_0_createTree_GE : arg3'=2*k_2+arg3, arg6'=arg6P_9, [ arg4>0 && arg6>1 && arg2<arg1 && arg2>-1 && arg6P_9>1 && k_2>=1 && arg4>-1+2*k_2+arg3 ], cost: 2*k_2
     17: f1081_0_createTree_GE -> f1081_0_createTree_GE : arg3'=1+2*k_2+arg3, arg6'=arg6P_9, [ arg4>0 && arg4>arg3 && arg6>1 && arg2<arg1 && arg2>-1 && arg6P_9>1 && k_2>=1 && arg4>2*k_2+arg3 ], cost: 1+2*k_2
     10: f1152_0_dupList_NONNULL -> f1116_0_dupTree_FieldAccess : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, arg5'=arg5P_11, arg6'=arg6P_11, [ 1+arg1P_11<=arg1 && arg1>0 && arg1P_11>-1 ], cost: 1
     11: f1152_0_dupList_NONNULL -> f1349_0_dupList_InvokeMethod : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg2, arg4'=arg4P_12, arg5'=arg5P_12, arg6'=arg6P_12, [ -2+arg1P_12<=arg1 && 2+arg2P_12<=arg1 && 2+arg4P_12<=arg1 && arg1>3 && arg1P_12>5 && arg2P_12>-1 && arg4P_12>-1 ], cost: 1
     12: f1152_0_dupList_NONNULL -> f1349_0_dupList_InvokeMethod : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=arg2, arg4'=arg4P_13, arg5'=arg5P_13, arg6'=arg6P_13, [ 1+arg2P_13<=arg1 && 1+arg4P_13<=arg1 && arg1>0 && arg1P_13>10 && arg2P_13>-1 && arg4P_13>-1 ], cost: 1
     13: f1349_0_dupList_InvokeMethod -> f1152_0_dupList_NONNULL : arg1'=arg1P_14, arg2'=arg3, arg3'=arg3P_14, arg4'=arg4P_14, arg5'=arg5P_14, arg6'=arg6P_14, [ 4+arg1P_14<=arg1 && arg1P_14<=arg2 && arg1P_14<=arg4 && arg1>4 && arg2>-1 && arg4>-1 && arg1P_14>-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 -> f577_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 -> f1116_0_dupTree_FieldAccess : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, arg5'=arg5P_2, arg6'=arg6P_2, [ 1+arg1P_2<=arg1 && arg2>0 && arg1>0 && arg1P_2>-1 ], cost: 1
      2: f1_0_main_Load -> f1098_0_main_InvokeMethod : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, arg5'=arg5P_3, arg6'=arg6P_3, [ arg2>0 && arg1P_3<=arg1 && arg1>0 && arg1P_3>0 && arg2P_3>0 ], cost: 1
      5: f577_0_createTree_GT -> f1081_0_createTree_GE : arg2'=-1+arg1, arg3'=0, arg4'=arg4P_6, arg5'=arg2, arg6'=1+arg3, [ arg1>0 && arg3>0 && arg3<arg2 && arg4P_6>-1 ], cost: 1
     18: f577_0_createTree_GT -> f1081_0_createTree_GE : arg2'=-1+arg1, arg3'=1, arg4'=arg4P_6, arg5'=arg2, arg6'=arg6P_9, [ arg1>0 && arg3>0 && arg3<arg2 && arg4P_6>0 ], cost: 2
     19: f577_0_createTree_GT -> f1081_0_createTree_GE : arg2'=-1+arg1, arg3'=arg4P_6, arg4'=arg4P_6, arg5'=arg2, arg6'=1+arg3, [ arg1>0 && arg3>0 && arg3<arg2 && arg4P_6>0 ], cost: 1+arg4P_6
     20: f577_0_createTree_GT -> f1081_0_createTree_GE : arg2'=-1+arg1, arg3'=2*k_2, arg4'=arg4P_6, arg5'=arg2, arg6'=arg6P_9, [ arg1>0 && arg3>0 && arg3<arg2 && arg4P_6>0 && arg6P_9>1 && k_2>=1 && arg4P_6>-1+2*k_2 ], cost: 1+2*k_2
     21: f577_0_createTree_GT -> f1081_0_createTree_GE : arg2'=-1+arg1, arg3'=1+2*k_2, arg4'=arg4P_6, arg5'=arg2, arg6'=arg6P_9, [ arg1>0 && arg3>0 && arg3<arg2 && arg4P_6>0 && arg6P_9>1 && k_2>=1 && arg4P_6>2*k_2 ], cost: 2+2*k_2
      9: f1116_0_dupTree_FieldAccess -> f1152_0_dupList_NONNULL : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ 1+arg1P_10<=arg1 && arg1>0 && arg1P_10>-1 ], cost: 1
      4: f1098_0_main_InvokeMethod -> f1116_0_dupTree_FieldAccess : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, arg5'=arg5P_5, arg6'=arg6P_5, [ arg3>1 && arg1P_5<=arg2 && arg1>0 && arg2>0 && arg1P_5>0 ], cost: 1
      6: f1081_0_createTree_GE -> f577_0_createTree_GT : arg1'=-1+arg2, arg2'=arg5, arg3'=arg6, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ arg4>0 && arg4>arg3 && arg6>1 && arg2<arg1 && arg2>-1 ], cost: 1
     10: f1152_0_dupList_NONNULL -> f1116_0_dupTree_FieldAccess : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, arg5'=arg5P_11, arg6'=arg6P_11, [ 1+arg1P_11<=arg1 && arg1>0 && arg1P_11>-1 ], cost: 1
     11: f1152_0_dupList_NONNULL -> f1349_0_dupList_InvokeMethod : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg2, arg4'=arg4P_12, arg5'=arg5P_12, arg6'=arg6P_12, [ -2+arg1P_12<=arg1 && 2+arg2P_12<=arg1 && 2+arg4P_12<=arg1 && arg1>3 && arg1P_12>5 && arg2P_12>-1 && arg4P_12>-1 ], cost: 1
     12: f1152_0_dupList_NONNULL -> f1349_0_dupList_InvokeMethod : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=arg2, arg4'=arg4P_13, arg5'=arg5P_13, arg6'=arg6P_13, [ 1+arg2P_13<=arg1 && 1+arg4P_13<=arg1 && arg1>0 && arg1P_13>10 && arg2P_13>-1 && arg4P_13>-1 ], cost: 1
     13: f1349_0_dupList_InvokeMethod -> f1152_0_dupList_NONNULL : arg1'=arg1P_14, arg2'=arg3, arg3'=arg3P_14, arg4'=arg4P_14, arg5'=arg5P_14, arg6'=arg6P_14, [ 4+arg1P_14<=arg1 && arg1P_14<=arg2 && arg1P_14<=arg4 && arg1>4 && arg2>-1 && arg4>-1 && arg1P_14>-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

Eliminated locations (on linear paths):
   Start location: __init
      0: f1_0_main_Load -> f577_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 -> f1116_0_dupTree_FieldAccess : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, arg5'=arg5P_2, arg6'=arg6P_2, [ 1+arg1P_2<=arg1 && arg2>0 && arg1>0 && arg1P_2>-1 ], cost: 1
     22: f1_0_main_Load -> f1116_0_dupTree_FieldAccess : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, arg5'=arg5P_5, arg6'=arg6P_5, [ arg2>0 && arg1P_3<=arg1 && arg1>0 && arg1P_3>0 && arg2P_3>0 && arg3P_3>1 && arg1P_5<=arg2P_3 && arg1P_5>0 ], cost: 2
      5: f577_0_createTree_GT -> f1081_0_createTree_GE : arg2'=-1+arg1, arg3'=0, arg4'=arg4P_6, arg5'=arg2, arg6'=1+arg3, [ arg1>0 && arg3>0 && arg3<arg2 && arg4P_6>-1 ], cost: 1
     18: f577_0_createTree_GT -> f1081_0_createTree_GE : arg2'=-1+arg1, arg3'=1, arg4'=arg4P_6, arg5'=arg2, arg6'=arg6P_9, [ arg1>0 && arg3>0 && arg3<arg2 && arg4P_6>0 ], cost: 2
     19: f577_0_createTree_GT -> f1081_0_createTree_GE : arg2'=-1+arg1, arg3'=arg4P_6, arg4'=arg4P_6, arg5'=arg2, arg6'=1+arg3, [ arg1>0 && arg3>0 && arg3<arg2 && arg4P_6>0 ], cost: 1+arg4P_6
     20: f577_0_createTree_GT -> f1081_0_createTree_GE : arg2'=-1+arg1, arg3'=2*k_2, arg4'=arg4P_6, arg5'=arg2, arg6'=arg6P_9, [ arg1>0 && arg3>0 && arg3<arg2 && arg4P_6>0 && arg6P_9>1 && k_2>=1 && arg4P_6>-1+2*k_2 ], cost: 1+2*k_2
     21: f577_0_createTree_GT -> f1081_0_createTree_GE : arg2'=-1+arg1, arg3'=1+2*k_2, arg4'=arg4P_6, arg5'=arg2, arg6'=arg6P_9, [ arg1>0 && arg3>0 && arg3<arg2 && arg4P_6>0 && arg6P_9>1 && k_2>=1 && arg4P_6>2*k_2 ], cost: 2+2*k_2
      9: f1116_0_dupTree_FieldAccess -> f1152_0_dupList_NONNULL : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ 1+arg1P_10<=arg1 && arg1>0 && arg1P_10>-1 ], cost: 1
      6: f1081_0_createTree_GE -> f577_0_createTree_GT : arg1'=-1+arg2, arg2'=arg5, arg3'=arg6, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ arg4>0 && arg4>arg3 && arg6>1 && arg2<arg1 && arg2>-1 ], cost: 1
     10: f1152_0_dupList_NONNULL -> f1116_0_dupTree_FieldAccess : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, arg5'=arg5P_11, arg6'=arg6P_11, [ 1+arg1P_11<=arg1 && arg1>0 && arg1P_11>-1 ], cost: 1
     11: f1152_0_dupList_NONNULL -> f1349_0_dupList_InvokeMethod : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg2, arg4'=arg4P_12, arg5'=arg5P_12, arg6'=arg6P_12, [ -2+arg1P_12<=arg1 && 2+arg2P_12<=arg1 && 2+arg4P_12<=arg1 && arg1>3 && arg1P_12>5 && arg2P_12>-1 && arg4P_12>-1 ], cost: 1
     12: f1152_0_dupList_NONNULL -> f1349_0_dupList_InvokeMethod : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=arg2, arg4'=arg4P_13, arg5'=arg5P_13, arg6'=arg6P_13, [ 1+arg2P_13<=arg1 && 1+arg4P_13<=arg1 && arg1>0 && arg1P_13>10 && arg2P_13>-1 && arg4P_13>-1 ], cost: 1
     13: f1349_0_dupList_InvokeMethod -> f1152_0_dupList_NONNULL : arg1'=arg1P_14, arg2'=arg3, arg3'=arg3P_14, arg4'=arg4P_14, arg5'=arg5P_14, arg6'=arg6P_14, [ 4+arg1P_14<=arg1 && arg1P_14<=arg2 && arg1P_14<=arg4 && arg1>4 && arg2>-1 && arg4>-1 && arg1P_14>-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

Eliminated locations (on tree-shaped paths):
   Start location: __init
     26: f577_0_createTree_GT -> f577_0_createTree_GT : arg1'=-2+arg1, arg2'=arg2, arg3'=1+arg3, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ arg1>0 && arg3>0 && arg3<arg2 && arg4P_6>0 ], cost: 2
     27: f577_0_createTree_GT -> f577_0_createTree_GT : arg1'=-2+arg1, arg2'=arg2, arg3'=arg6P_9, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ arg1>0 && arg3>0 && arg3<arg2 && arg4P_6>1 && arg6P_9>1 ], cost: 3
     28: f577_0_createTree_GT -> f577_0_createTree_GT : arg1'=-2+arg1, arg2'=arg2, arg3'=arg6P_9, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ arg1>0 && arg3>0 && arg3<arg2 && arg4P_6>0 && arg6P_9>1 && k_2>=1 && arg4P_6>2*k_2 ], cost: 2+2*k_2
     29: f577_0_createTree_GT -> f577_0_createTree_GT : arg1'=-2+arg1, arg2'=arg2, arg3'=arg6P_9, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ arg1>0 && arg3>0 && arg3<arg2 && arg4P_6>0 && arg6P_9>1 && k_2>=1 && arg4P_6>1+2*k_2 ], cost: 3+2*k_2
     30: f577_0_createTree_GT -> [10] : [ arg1>0 && arg3>0 && arg3<arg2 && arg4P_6>0 ], cost: 1+arg4P_6
      9: f1116_0_dupTree_FieldAccess -> f1152_0_dupList_NONNULL : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ 1+arg1P_10<=arg1 && arg1>0 && arg1P_10>-1 ], cost: 1
     10: f1152_0_dupList_NONNULL -> f1116_0_dupTree_FieldAccess : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, arg5'=arg5P_11, arg6'=arg6P_11, [ 1+arg1P_11<=arg1 && arg1>0 && arg1P_11>-1 ], cost: 1
     31: f1152_0_dupList_NONNULL -> f1152_0_dupList_NONNULL : arg1'=arg1P_14, arg2'=arg2, arg3'=arg3P_14, arg4'=arg4P_14, arg5'=arg5P_14, arg6'=arg6P_14, [ -2+arg1P_12<=arg1 && 2+arg2P_12<=arg1 && 2+arg4P_12<=arg1 && arg1>3 && arg1P_12>5 && arg2P_12>-1 && arg4P_12>-1 && 4+arg1P_14<=arg1P_12 && arg1P_14<=arg2P_12 && arg1P_14<=arg4P_12 && arg1P_14>-1 ], cost: 2
     32: f1152_0_dupList_NONNULL -> f1152_0_dupList_NONNULL : arg1'=arg1P_14, arg2'=arg2, arg3'=arg3P_14, arg4'=arg4P_14, arg5'=arg5P_14, arg6'=arg6P_14, [ 1+arg2P_13<=arg1 && 1+arg4P_13<=arg1 && arg1>0 && arg1P_13>10 && arg2P_13>-1 && arg4P_13>-1 && 4+arg1P_14<=arg1P_13 && arg1P_14<=arg2P_13 && arg1P_14<=arg4P_13 && arg1P_14>-1 ], cost: 2
     23: __init -> f577_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
     24: __init -> f1116_0_dupTree_FieldAccess : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, arg5'=arg5P_2, arg6'=arg6P_2, [ 1+arg1P_2<=arg1P_15 && arg2P_15>0 && arg1P_15>0 && arg1P_2>-1 ], cost: 2
     25: __init -> f1116_0_dupTree_FieldAccess : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, arg5'=arg5P_5, arg6'=arg6P_5, [ arg2P_15>0 && arg1P_3<=arg1P_15 && arg1P_15>0 && arg1P_3>0 && arg2P_3>0 && arg3P_3>1 && arg1P_5<=arg2P_3 && arg1P_5>0 ], cost: 3

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:
     26: f577_0_createTree_GT -> f577_0_createTree_GT : arg1'=-2+arg1, arg3'=1+arg3, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ arg1>0 && arg3>0 && arg3<arg2 ], cost: 2
     27: f577_0_createTree_GT -> f577_0_createTree_GT : arg1'=-2+arg1, arg3'=arg6P_9, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ arg1>0 && arg3>0 && arg3<arg2 && arg6P_9>1 ], cost: 3
     29: f577_0_createTree_GT -> f577_0_createTree_GT : arg1'=-2+arg1, arg3'=arg6P_9, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ arg1>0 && arg3>0 && arg3<arg2 && arg6P_9>1 && k_2>=1 ], cost: 3+2*k_2

   Accelerated rule 26 with backward acceleration, yielding the new rule 33.
   Failed to prove monotonicity of the guard of rule 27.
   Failed to prove monotonicity of the guard of rule 29.
[accelerate] Nesting with 3 inner and 3 outer candidates
   Nested simple loops 29 (outer loop) and 27 (inner loop) with Rule(1 | arg3>0, arg3<arg2, arg6P_9>1, arg6P_9<arg2, k_2>=1, k_6>=1, 2+arg1-4*k_6>0, | 2*k_2*k_6+6*k_6 || 1 | 0=arg1-4*k_6, 2=arg6P_9, 3=arg4P_7, 4=arg5P_7, 5=arg6P_7, ), resulting in the new rules: 34, 35.
   Removing the simple loops: 26 29.

Accelerating simple loops of location 6.
   Simplified some of the simple loops (and removed duplicate rules).
   Accelerating the following rules:
     31: f1152_0_dupList_NONNULL -> f1152_0_dupList_NONNULL : arg1'=arg1P_14, arg3'=arg3P_14, arg4'=arg4P_14, arg5'=arg5P_14, arg6'=arg6P_14, [ arg1>3 && arg1P_14>-1 && arg1P_14<=-2+arg1 ], cost: 2
     32: f1152_0_dupList_NONNULL -> f1152_0_dupList_NONNULL : arg1'=arg1P_14, arg3'=arg3P_14, arg4'=arg4P_14, arg5'=arg5P_14, arg6'=arg6P_14, [ arg1>0 && arg1P_14>-1 && arg1P_14<=-1+arg1 ], cost: 2

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

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
     27: f577_0_createTree_GT -> f577_0_createTree_GT : arg1'=-2+arg1, arg3'=arg6P_9, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ arg1>0 && arg3>0 && arg3<arg2 && arg6P_9>1 ], cost: 3
     30: f577_0_createTree_GT -> [10] : [ arg1>0 && arg3>0 && arg3<arg2 && arg4P_6>0 ], cost: 1+arg4P_6
     33: f577_0_createTree_GT -> f577_0_createTree_GT : arg1'=-2*k_3+arg1, arg3'=arg3+k_3, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ arg3>0 && k_3>=1 && 2-2*k_3+arg1>0 && -1+arg3+k_3<arg2 ], cost: 2*k_3
     34: f577_0_createTree_GT -> f577_0_createTree_GT : arg1'=arg1-4*k_6, arg3'=arg6P_9, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ arg3>0 && arg3<arg2 && arg6P_9>1 && arg6P_9<arg2 && k_2>=1 && k_6>=1 && 2+arg1-4*k_6>0 ], cost: 2*k_2*k_6+6*k_6
     35: f577_0_createTree_GT -> f577_0_createTree_GT : arg1'=-2+arg1-4*k_6, arg3'=arg6P_9, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ arg1>0 && arg3>0 && arg3<arg2 && arg6P_9>1 && k_2>=1 && arg6P_9<arg2 && k_6>=1 && arg1-4*k_6>0 ], cost: 3+2*k_2+2*k_2*k_6+6*k_6
      9: f1116_0_dupTree_FieldAccess -> f1152_0_dupList_NONNULL : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ 1+arg1P_10<=arg1 && arg1>0 && arg1P_10>-1 ], cost: 1
     10: f1152_0_dupList_NONNULL -> f1116_0_dupTree_FieldAccess : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, arg5'=arg5P_11, arg6'=arg6P_11, [ 1+arg1P_11<=arg1 && arg1>0 && arg1P_11>-1 ], cost: 1
     31: f1152_0_dupList_NONNULL -> f1152_0_dupList_NONNULL : arg1'=arg1P_14, arg3'=arg3P_14, arg4'=arg4P_14, arg5'=arg5P_14, arg6'=arg6P_14, [ arg1>3 && arg1P_14>-1 && arg1P_14<=-2+arg1 ], cost: 2
     32: f1152_0_dupList_NONNULL -> f1152_0_dupList_NONNULL : arg1'=arg1P_14, arg3'=arg3P_14, arg4'=arg4P_14, arg5'=arg5P_14, arg6'=arg6P_14, [ arg1>0 && arg1P_14>-1 && arg1P_14<=-1+arg1 ], cost: 2
     23: __init -> f577_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
     24: __init -> f1116_0_dupTree_FieldAccess : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, arg5'=arg5P_2, arg6'=arg6P_2, [ 1+arg1P_2<=arg1P_15 && arg2P_15>0 && arg1P_15>0 && arg1P_2>-1 ], cost: 2
     25: __init -> f1116_0_dupTree_FieldAccess : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, arg5'=arg5P_5, arg6'=arg6P_5, [ arg2P_15>0 && arg1P_3<=arg1P_15 && arg1P_15>0 && arg1P_3>0 && arg2P_3>0 && arg3P_3>1 && arg1P_5<=arg2P_3 && arg1P_5>0 ], cost: 3

Chained accelerated rules (with incoming rules):
   Start location: __init
     30: f577_0_createTree_GT -> [10] : [ arg1>0 && arg3>0 && arg3<arg2 && arg4P_6>0 ], cost: 1+arg4P_6
      9: f1116_0_dupTree_FieldAccess -> f1152_0_dupList_NONNULL : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ 1+arg1P_10<=arg1 && arg1>0 && arg1P_10>-1 ], cost: 1
     40: f1116_0_dupTree_FieldAccess -> f1152_0_dupList_NONNULL : arg1'=arg1P_14, arg2'=arg2P_10, arg3'=arg3P_14, arg4'=arg4P_14, arg5'=arg5P_14, arg6'=arg6P_14, [ arg1P_14>-1 && 4<=-1+arg1 && 2+arg1P_14<=-1+arg1 ], cost: 3
     41: f1116_0_dupTree_FieldAccess -> f1152_0_dupList_NONNULL : arg1'=arg1P_14, arg2'=arg2P_10, arg3'=arg3P_14, arg4'=arg4P_14, arg5'=arg5P_14, arg6'=arg6P_14, [ arg1P_14>-1 && 1<=-1+arg1 && 1+arg1P_14<=-1+arg1 ], cost: 3
     10: f1152_0_dupList_NONNULL -> f1116_0_dupTree_FieldAccess : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, arg5'=arg5P_11, arg6'=arg6P_11, [ 1+arg1P_11<=arg1 && arg1>0 && arg1P_11>-1 ], cost: 1
     23: __init -> f577_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
     24: __init -> f1116_0_dupTree_FieldAccess : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, arg5'=arg5P_2, arg6'=arg6P_2, [ 1+arg1P_2<=arg1P_15 && arg2P_15>0 && arg1P_15>0 && arg1P_2>-1 ], cost: 2
     25: __init -> f1116_0_dupTree_FieldAccess : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, arg5'=arg5P_5, arg6'=arg6P_5, [ arg2P_15>0 && arg1P_3<=arg1P_15 && arg1P_15>0 && arg1P_3>0 && arg2P_3>0 && arg3P_3>1 && arg1P_5<=arg2P_3 && arg1P_5>0 ], cost: 3
     36: __init -> f577_0_createTree_GT : arg1'=-2+arg1P_1, arg2'=arg2P_15, arg3'=arg6P_9, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ arg1P_1>0 && 1<arg2P_15 && arg6P_9>1 ], cost: 5
     37: __init -> f577_0_createTree_GT : arg1'=-2*k_3+arg1P_1, arg2'=arg2P_15, arg3'=1+k_3, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ 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
     38: __init -> f577_0_createTree_GT : arg1'=arg1P_1-4*k_6, arg2'=arg2P_15, arg3'=arg6P_9, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ arg1P_1>-1 && 1<arg2P_15 && arg6P_9>1 && arg6P_9<arg2P_15 && k_2>=1 && k_6>=1 && 2+arg1P_1-4*k_6>0 ], cost: 2+2*k_2*k_6+6*k_6
     39: __init -> f577_0_createTree_GT : arg1'=-2+arg1P_1-4*k_6, arg2'=arg2P_15, arg3'=arg6P_9, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ arg1P_1>0 && 1<arg2P_15 && arg6P_9>1 && k_2>=1 && arg6P_9<arg2P_15 && k_6>=1 && arg1P_1-4*k_6>0 ], cost: 5+2*k_2+2*k_2*k_6+6*k_6

Eliminated locations (on tree-shaped paths):
   Start location: __init
     47: f1116_0_dupTree_FieldAccess -> f1116_0_dupTree_FieldAccess : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, arg5'=arg5P_11, arg6'=arg6P_11, [ 1+arg1P_10<=arg1 && arg1>0 && 1+arg1P_11<=arg1P_10 && arg1P_10>0 && arg1P_11>-1 ], cost: 2
     48: f1116_0_dupTree_FieldAccess -> f1116_0_dupTree_FieldAccess : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, arg5'=arg5P_11, arg6'=arg6P_11, [ 4<=-1+arg1 && 2+arg1P_14<=-1+arg1 && 1+arg1P_11<=arg1P_14 && arg1P_14>0 && arg1P_11>-1 ], cost: 4
     49: f1116_0_dupTree_FieldAccess -> f1116_0_dupTree_FieldAccess : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, arg5'=arg5P_11, arg6'=arg6P_11, [ 1<=-1+arg1 && 1+arg1P_14<=-1+arg1 && 1+arg1P_11<=arg1P_14 && arg1P_14>0 && arg1P_11>-1 ], cost: 4
     24: __init -> f1116_0_dupTree_FieldAccess : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, arg5'=arg5P_2, arg6'=arg6P_2, [ 1+arg1P_2<=arg1P_15 && arg2P_15>0 && arg1P_15>0 && arg1P_2>-1 ], cost: 2
     25: __init -> f1116_0_dupTree_FieldAccess : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, arg5'=arg5P_5, arg6'=arg6P_5, [ arg2P_15>0 && arg1P_3<=arg1P_15 && arg1P_15>0 && arg1P_3>0 && arg2P_3>0 && arg3P_3>1 && arg1P_5<=arg2P_3 && arg1P_5>0 ], cost: 3
     42: __init -> [10] : 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_6>0 ], cost: 3+arg4P_6
     43: __init -> [10] : arg1'=-2+arg1P_1, arg2'=arg2P_15, arg3'=arg6P_9, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ 1<arg2P_15 && arg6P_9>1 && -2+arg1P_1>0 && arg6P_9<arg2P_15 && arg4P_6>0 ], cost: 6+arg4P_6
     44: __init -> [10] : arg1'=-2*k_3+arg1P_1, arg2'=arg2P_15, arg3'=1+k_3, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ arg1P_1>-1 && arg2P_15>0 && k_3>=1 && -2*k_3+arg1P_1>0 && 1+k_3<arg2P_15 && arg4P_6>0 ], cost: 3+arg4P_6+2*k_3
     45: __init -> [10] : arg1'=arg1P_1-4*k_6, arg2'=arg2P_15, arg3'=arg6P_9, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ arg1P_1>-1 && 1<arg2P_15 && arg6P_9>1 && arg6P_9<arg2P_15 && k_2>=1 && k_6>=1 && arg1P_1-4*k_6>0 && arg4P_6>0 ], cost: 3+arg4P_6+2*k_2*k_6+6*k_6
     46: __init -> [10] : arg1'=-2+arg1P_1-4*k_6, arg2'=arg2P_15, arg3'=arg6P_9, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ arg1P_1>0 && 1<arg2P_15 && arg6P_9>1 && k_2>=1 && arg6P_9<arg2P_15 && k_6>=1 && -2+arg1P_1-4*k_6>0 && arg4P_6>0 ], cost: 6+arg4P_6+2*k_2+2*k_2*k_6+6*k_6

Accelerating simple loops of location 2.
   Simplified some of the simple loops (and removed duplicate rules).
   Accelerating the following rules:
     47: f1116_0_dupTree_FieldAccess -> f1116_0_dupTree_FieldAccess : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, arg5'=arg5P_11, arg6'=arg6P_11, [ arg1P_11>-1 && 1+arg1P_11<=-1+arg1 && 1<=-1+arg1 ], cost: 2
     48: f1116_0_dupTree_FieldAccess -> f1116_0_dupTree_FieldAccess : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, arg5'=arg5P_11, arg6'=arg6P_11, [ 4<=-1+arg1 && arg1P_11>-1 && 1+arg1P_11<=-3+arg1 ], cost: 4
     49: f1116_0_dupTree_FieldAccess -> f1116_0_dupTree_FieldAccess : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, arg5'=arg5P_11, arg6'=arg6P_11, [ arg1P_11>-1 && 1+arg1P_11<=-2+arg1 && 1<=-2+arg1 ], cost: 4

   Failed to prove monotonicity of the guard of rule 47.
   Failed to prove monotonicity of the guard of rule 48.
   Failed to prove monotonicity of the guard of rule 49.
[accelerate] Nesting with 3 inner and 3 outer candidates

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
     47: f1116_0_dupTree_FieldAccess -> f1116_0_dupTree_FieldAccess : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, arg5'=arg5P_11, arg6'=arg6P_11, [ arg1P_11>-1 && 1+arg1P_11<=-1+arg1 && 1<=-1+arg1 ], cost: 2
     48: f1116_0_dupTree_FieldAccess -> f1116_0_dupTree_FieldAccess : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, arg5'=arg5P_11, arg6'=arg6P_11, [ 4<=-1+arg1 && arg1P_11>-1 && 1+arg1P_11<=-3+arg1 ], cost: 4
     49: f1116_0_dupTree_FieldAccess -> f1116_0_dupTree_FieldAccess : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, arg5'=arg5P_11, arg6'=arg6P_11, [ arg1P_11>-1 && 1+arg1P_11<=-2+arg1 && 1<=-2+arg1 ], cost: 4
     24: __init -> f1116_0_dupTree_FieldAccess : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, arg5'=arg5P_2, arg6'=arg6P_2, [ 1+arg1P_2<=arg1P_15 && arg2P_15>0 && arg1P_15>0 && arg1P_2>-1 ], cost: 2
     25: __init -> f1116_0_dupTree_FieldAccess : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, arg5'=arg5P_5, arg6'=arg6P_5, [ arg2P_15>0 && arg1P_3<=arg1P_15 && arg1P_15>0 && arg1P_3>0 && arg2P_3>0 && arg3P_3>1 && arg1P_5<=arg2P_3 && arg1P_5>0 ], cost: 3
     42: __init -> [10] : 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_6>0 ], cost: 3+arg4P_6
     43: __init -> [10] : arg1'=-2+arg1P_1, arg2'=arg2P_15, arg3'=arg6P_9, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ 1<arg2P_15 && arg6P_9>1 && -2+arg1P_1>0 && arg6P_9<arg2P_15 && arg4P_6>0 ], cost: 6+arg4P_6
     44: __init -> [10] : arg1'=-2*k_3+arg1P_1, arg2'=arg2P_15, arg3'=1+k_3, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ arg1P_1>-1 && arg2P_15>0 && k_3>=1 && -2*k_3+arg1P_1>0 && 1+k_3<arg2P_15 && arg4P_6>0 ], cost: 3+arg4P_6+2*k_3
     45: __init -> [10] : arg1'=arg1P_1-4*k_6, arg2'=arg2P_15, arg3'=arg6P_9, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ arg1P_1>-1 && 1<arg2P_15 && arg6P_9>1 && arg6P_9<arg2P_15 && k_2>=1 && k_6>=1 && arg1P_1-4*k_6>0 && arg4P_6>0 ], cost: 3+arg4P_6+2*k_2*k_6+6*k_6
     46: __init -> [10] : arg1'=-2+arg1P_1-4*k_6, arg2'=arg2P_15, arg3'=arg6P_9, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ arg1P_1>0 && 1<arg2P_15 && arg6P_9>1 && k_2>=1 && arg6P_9<arg2P_15 && k_6>=1 && -2+arg1P_1-4*k_6>0 && arg4P_6>0 ], cost: 6+arg4P_6+2*k_2+2*k_2*k_6+6*k_6

Chained accelerated rules (with incoming rules):
   Start location: __init
     24: __init -> f1116_0_dupTree_FieldAccess : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, arg5'=arg5P_2, arg6'=arg6P_2, [ 1+arg1P_2<=arg1P_15 && arg2P_15>0 && arg1P_15>0 && arg1P_2>-1 ], cost: 2
     25: __init -> f1116_0_dupTree_FieldAccess : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, arg5'=arg5P_5, arg6'=arg6P_5, [ arg2P_15>0 && arg1P_3<=arg1P_15 && arg1P_15>0 && arg1P_3>0 && arg2P_3>0 && arg3P_3>1 && arg1P_5<=arg2P_3 && arg1P_5>0 ], cost: 3
     42: __init -> [10] : 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_6>0 ], cost: 3+arg4P_6
     43: __init -> [10] : arg1'=-2+arg1P_1, arg2'=arg2P_15, arg3'=arg6P_9, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ 1<arg2P_15 && arg6P_9>1 && -2+arg1P_1>0 && arg6P_9<arg2P_15 && arg4P_6>0 ], cost: 6+arg4P_6
     44: __init -> [10] : arg1'=-2*k_3+arg1P_1, arg2'=arg2P_15, arg3'=1+k_3, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ arg1P_1>-1 && arg2P_15>0 && k_3>=1 && -2*k_3+arg1P_1>0 && 1+k_3<arg2P_15 && arg4P_6>0 ], cost: 3+arg4P_6+2*k_3
     45: __init -> [10] : arg1'=arg1P_1-4*k_6, arg2'=arg2P_15, arg3'=arg6P_9, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ arg1P_1>-1 && 1<arg2P_15 && arg6P_9>1 && arg6P_9<arg2P_15 && k_2>=1 && k_6>=1 && arg1P_1-4*k_6>0 && arg4P_6>0 ], cost: 3+arg4P_6+2*k_2*k_6+6*k_6
     46: __init -> [10] : arg1'=-2+arg1P_1-4*k_6, arg2'=arg2P_15, arg3'=arg6P_9, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ arg1P_1>0 && 1<arg2P_15 && arg6P_9>1 && k_2>=1 && arg6P_9<arg2P_15 && k_6>=1 && -2+arg1P_1-4*k_6>0 && arg4P_6>0 ], cost: 6+arg4P_6+2*k_2+2*k_2*k_6+6*k_6
     50: __init -> f1116_0_dupTree_FieldAccess : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, arg5'=arg5P_11, arg6'=arg6P_11, [ arg1P_11>-1 ], cost: 4
     51: __init -> f1116_0_dupTree_FieldAccess : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, arg5'=arg5P_11, arg6'=arg6P_11, [ arg1P_11>-1 ], cost: 5
     52: __init -> f1116_0_dupTree_FieldAccess : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, arg5'=arg5P_11, arg6'=arg6P_11, [ arg1P_11>-1 ], cost: 6
     53: __init -> f1116_0_dupTree_FieldAccess : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, arg5'=arg5P_11, arg6'=arg6P_11, [ arg1P_11>-1 ], cost: 7
     54: __init -> f1116_0_dupTree_FieldAccess : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, arg5'=arg5P_11, arg6'=arg6P_11, [ arg1P_11>-1 ], cost: 6
     55: __init -> f1116_0_dupTree_FieldAccess : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, arg5'=arg5P_11, arg6'=arg6P_11, [ arg1P_11>-1 ], cost: 7

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
     42: __init -> [10] : 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_6>0 ], cost: 3+arg4P_6
     43: __init -> [10] : arg1'=-2+arg1P_1, arg2'=arg2P_15, arg3'=arg6P_9, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ 1<arg2P_15 && arg6P_9>1 && -2+arg1P_1>0 && arg6P_9<arg2P_15 && arg4P_6>0 ], cost: 6+arg4P_6
     44: __init -> [10] : arg1'=-2*k_3+arg1P_1, arg2'=arg2P_15, arg3'=1+k_3, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ arg1P_1>-1 && arg2P_15>0 && k_3>=1 && -2*k_3+arg1P_1>0 && 1+k_3<arg2P_15 && arg4P_6>0 ], cost: 3+arg4P_6+2*k_3
     45: __init -> [10] : arg1'=arg1P_1-4*k_6, arg2'=arg2P_15, arg3'=arg6P_9, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ arg1P_1>-1 && 1<arg2P_15 && arg6P_9>1 && arg6P_9<arg2P_15 && k_2>=1 && k_6>=1 && arg1P_1-4*k_6>0 && arg4P_6>0 ], cost: 3+arg4P_6+2*k_2*k_6+6*k_6
     46: __init -> [10] : arg1'=-2+arg1P_1-4*k_6, arg2'=arg2P_15, arg3'=arg6P_9, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ arg1P_1>0 && 1<arg2P_15 && arg6P_9>1 && k_2>=1 && arg6P_9<arg2P_15 && k_6>=1 && -2+arg1P_1-4*k_6>0 && arg4P_6>0 ], cost: 6+arg4P_6+2*k_2+2*k_2*k_6+6*k_6

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     42: __init -> [10] : 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_6>0 ], cost: 3+arg4P_6
     43: __init -> [10] : arg1'=-2+arg1P_1, arg2'=arg2P_15, arg3'=arg6P_9, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ 1<arg2P_15 && arg6P_9>1 && -2+arg1P_1>0 && arg6P_9<arg2P_15 && arg4P_6>0 ], cost: 6+arg4P_6
     44: __init -> [10] : arg1'=-2*k_3+arg1P_1, arg2'=arg2P_15, arg3'=1+k_3, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ arg1P_1>-1 && arg2P_15>0 && k_3>=1 && -2*k_3+arg1P_1>0 && 1+k_3<arg2P_15 && arg4P_6>0 ], cost: 3+arg4P_6+2*k_3
     45: __init -> [10] : arg1'=arg1P_1-4*k_6, arg2'=arg2P_15, arg3'=arg6P_9, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ arg1P_1>-1 && 1<arg2P_15 && arg6P_9>1 && arg6P_9<arg2P_15 && k_2>=1 && k_6>=1 && arg1P_1-4*k_6>0 && arg4P_6>0 ], cost: 3+arg4P_6+2*k_2*k_6+6*k_6
     46: __init -> [10] : arg1'=-2+arg1P_1-4*k_6, arg2'=arg2P_15, arg3'=arg6P_9, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ arg1P_1>0 && 1<arg2P_15 && arg6P_9>1 && k_2>=1 && arg6P_9<arg2P_15 && k_6>=1 && -2+arg1P_1-4*k_6>0 && arg4P_6>0 ], cost: 6+arg4P_6+2*k_2+2*k_2*k_6+6*k_6

Computing asymptotic complexity for rule 45
   Simplified the guard:
     45: __init -> [10] : arg1'=arg1P_1-4*k_6, arg2'=arg2P_15, arg3'=arg6P_9, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ arg6P_9>1 && arg6P_9<arg2P_15 && k_2>=1 && k_6>=1 && arg1P_1-4*k_6>0 && arg4P_6>0 ], cost: 3+arg4P_6+2*k_2*k_6+6*k_6
   Resulting cost 0 has complexity: Unknown

Computing asymptotic complexity for rule 46
   Simplified the guard:
     46: __init -> [10] : arg1'=-2+arg1P_1-4*k_6, arg2'=arg2P_15, arg3'=arg6P_9, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ arg6P_9>1 && k_2>=1 && arg6P_9<arg2P_15 && k_6>=1 && -2+arg1P_1-4*k_6>0 && arg4P_6>0 ], cost: 6+arg4P_6+2*k_2+2*k_2*k_6+6*k_6
   Resulting cost 0 has complexity: Unknown

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

Computing asymptotic complexity for rule 43
   Simplified the guard:
     43: __init -> [10] : arg1'=-2+arg1P_1, arg2'=arg2P_15, arg3'=arg6P_9, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ arg6P_9>1 && -2+arg1P_1>0 && arg6P_9<arg2P_15 && arg4P_6>0 ], cost: 6+arg4P_6
   Resulting cost 0 has complexity: Unknown

Computing asymptotic complexity for rule 44
   Simplified the guard:
     44: __init -> [10] : arg1'=-2*k_3+arg1P_1, arg2'=arg2P_15, arg3'=1+k_3, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ k_3>=1 && -2*k_3+arg1P_1>0 && 1+k_3<arg2P_15 && arg4P_6>0 ], cost: 3+arg4P_6+2*k_3
   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),?)