WORST_CASE(Omega(1),?)

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

Initial linear ITS problem
   Start location: __init
      0: f1_0_main_Load -> f499_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 -> f1061_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: f499_0_createTree_GT -> f1039_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: f1061_0_main_InvokeMethod -> f1079_0_mirror_NULL : 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: f350_0_createTree_Return -> f1061_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: f1079_0_mirror_NULL -> f1079_0_mirror_NULL : 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>2 && arg1P_9>0 && arg2==arg2P_9 ], cost: 1
      9: f1079_0_mirror_NULL -> f1079_0_mirror_NULL : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ 4+arg1P_10<=arg1 && arg2>1 && arg1>3 && arg1P_10>-1 && arg2==arg2P_10 ], cost: 1
     10: f1079_0_mirror_NULL -> f1400_0_mirror_FieldAccess : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, arg5'=arg5P_11, arg6'=arg6P_11, [ arg1P_11<=arg1 && arg2>1 && 2+arg3P_11<=arg1 && arg1>2 && arg1P_11>1 && arg2P_11>2 && arg3P_11>-1 && arg2==arg5P_11 ], cost: 1
     11: f1079_0_mirror_NULL -> f1400_0_mirror_FieldAccess : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg3P_12, arg4'=arg4P_12, arg5'=arg5P_12, arg6'=arg6P_12, [ arg1P_12<=arg1 && arg2>1 && 2+arg3P_12<=arg1 && arg1>2 && arg1P_12>1 && arg2P_12>5 && arg3P_12>-1 && arg2==arg5P_12 ], cost: 1
      5: f1039_0_createTree_GE -> f499_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: f1039_0_createTree_GE -> f1039_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: f1039_0_createTree_GE -> f1039_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: f1400_0_mirror_FieldAccess -> f1079_0_mirror_NULL : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, arg5'=arg5P_13, arg6'=arg6P_13, [ 3+arg1P_13<=arg1 && arg5>1 && 1+arg1P_13<=arg3 && arg1>2 && arg2>0 && arg3>0 && arg1P_13>-1 && arg5==arg2P_13 ], cost: 1
     13: f1400_0_mirror_FieldAccess -> f1463_0_mirror_FieldAccess : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=arg3P_14, arg4'=arg4P_14, arg5'=arg5P_14, arg6'=arg6P_14, [ arg1P_14<=arg2 && arg5>1 && arg2P_14<=arg1 && -3+arg2P_14<=arg2 && -2+arg2P_14<=arg3 && arg1>3 && arg2>0 && arg3>1 && arg1P_14>0 && arg2P_14>3 ], cost: 1
     14: f1400_0_mirror_FieldAccess -> f1463_0_mirror_FieldAccess : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_15, arg4'=arg4P_15, arg5'=arg5P_15, arg6'=arg6P_15, [ arg1P_15<=arg2 && arg5>1 && arg2P_15<=arg1 && -2+arg2P_15<=arg3 && arg1>5 && arg2>0 && arg3>3 && arg1P_15>0 && arg2P_15>5 ], cost: 1
     15: f1400_0_mirror_FieldAccess -> f1463_0_mirror_FieldAccess : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_16, arg4'=arg4P_16, arg5'=arg5P_16, arg6'=arg6P_16, [ arg1P_16<=arg2 && arg5>1 && arg1>2 && arg2>0 && arg3>0 && arg1P_16>0 && arg2P_16>5 ], cost: 1
     16: __init -> f1_0_main_Load : arg1'=arg1P_17, arg2'=arg2P_17, arg3'=arg3P_17, arg4'=arg4P_17, arg5'=arg5P_17, arg6'=arg6P_17, [], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
     16: __init -> f1_0_main_Load : arg1'=arg1P_17, arg2'=arg2P_17, arg3'=arg3P_17, arg4'=arg4P_17, arg5'=arg5P_17, arg6'=arg6P_17, [], cost: 1

Removed unreachable and leaf rules:
   Start location: __init
      0: f1_0_main_Load -> f499_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 -> f1061_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: f499_0_createTree_GT -> f1039_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: f1061_0_main_InvokeMethod -> f1079_0_mirror_NULL : 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: f1079_0_mirror_NULL -> f1079_0_mirror_NULL : 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>2 && arg1P_9>0 && arg2==arg2P_9 ], cost: 1
      9: f1079_0_mirror_NULL -> f1079_0_mirror_NULL : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ 4+arg1P_10<=arg1 && arg2>1 && arg1>3 && arg1P_10>-1 && arg2==arg2P_10 ], cost: 1
     10: f1079_0_mirror_NULL -> f1400_0_mirror_FieldAccess : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, arg5'=arg5P_11, arg6'=arg6P_11, [ arg1P_11<=arg1 && arg2>1 && 2+arg3P_11<=arg1 && arg1>2 && arg1P_11>1 && arg2P_11>2 && arg3P_11>-1 && arg2==arg5P_11 ], cost: 1
     11: f1079_0_mirror_NULL -> f1400_0_mirror_FieldAccess : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg3P_12, arg4'=arg4P_12, arg5'=arg5P_12, arg6'=arg6P_12, [ arg1P_12<=arg1 && arg2>1 && 2+arg3P_12<=arg1 && arg1>2 && arg1P_12>1 && arg2P_12>5 && arg3P_12>-1 && arg2==arg5P_12 ], cost: 1
      5: f1039_0_createTree_GE -> f499_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: f1039_0_createTree_GE -> f1039_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: f1039_0_createTree_GE -> f1039_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: f1400_0_mirror_FieldAccess -> f1079_0_mirror_NULL : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, arg5'=arg5P_13, arg6'=arg6P_13, [ 3+arg1P_13<=arg1 && arg5>1 && 1+arg1P_13<=arg3 && arg1>2 && arg2>0 && arg3>0 && arg1P_13>-1 && arg5==arg2P_13 ], cost: 1
     16: __init -> f1_0_main_Load : arg1'=arg1P_17, arg2'=arg2P_17, arg3'=arg3P_17, arg4'=arg4P_17, arg5'=arg5P_17, arg6'=arg6P_17, [], cost: 1

Simplified all rules, resulting in:
   Start location: __init
      0: f1_0_main_Load -> f499_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 -> f1061_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: f499_0_createTree_GT -> f1039_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: f1061_0_main_InvokeMethod -> f1079_0_mirror_NULL : 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: f1079_0_mirror_NULL -> f1079_0_mirror_NULL : arg1'=arg1P_9, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [ 2+arg1P_9<=arg1 && arg2>1 && arg1>2 && arg1P_9>0 ], cost: 1
      9: f1079_0_mirror_NULL -> f1079_0_mirror_NULL : arg1'=arg1P_10, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ 4+arg1P_10<=arg1 && arg2>1 && arg1>3 && arg1P_10>-1 ], cost: 1
     10: f1079_0_mirror_NULL -> f1400_0_mirror_FieldAccess : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, arg5'=arg2, arg6'=arg6P_11, [ arg1P_11<=arg1 && arg2>1 && 2+arg3P_11<=arg1 && arg1>2 && arg1P_11>1 && arg2P_11>2 && arg3P_11>-1 ], cost: 1
     11: f1079_0_mirror_NULL -> f1400_0_mirror_FieldAccess : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg3P_12, arg4'=arg4P_12, arg5'=arg2, arg6'=arg6P_12, [ arg1P_12<=arg1 && arg2>1 && 2+arg3P_12<=arg1 && arg1>2 && arg1P_12>1 && arg2P_12>5 && arg3P_12>-1 ], cost: 1
      5: f1039_0_createTree_GE -> f499_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: f1039_0_createTree_GE -> f1039_0_createTree_GE : arg3'=1+arg3, [ arg4>0 && arg4>arg3 && arg6>1 && arg2<arg1 && arg2>-1 ], cost: 1
      7: f1039_0_createTree_GE -> f1039_0_createTree_GE : arg3'=1+arg3, arg6'=arg6P_8, [ arg4>0 && arg4>arg3 && arg6>1 && arg2<arg1 && arg2>-1 ], cost: 1
     12: f1400_0_mirror_FieldAccess -> f1079_0_mirror_NULL : arg1'=arg1P_13, arg2'=arg5, arg3'=arg3P_13, arg4'=arg4P_13, arg5'=arg5P_13, arg6'=arg6P_13, [ 3+arg1P_13<=arg1 && arg5>1 && 1+arg1P_13<=arg3 && arg1>2 && arg2>0 && arg3>0 && arg1P_13>-1 ], cost: 1
     16: __init -> f1_0_main_Load : arg1'=arg1P_17, arg2'=arg2P_17, arg3'=arg3P_17, arg4'=arg4P_17, arg5'=arg5P_17, arg6'=arg6P_17, [], cost: 1

### Simplification by acceleration and chaining ###

Accelerating simple loops of location 4.
   Accelerating the following rules:
      8: f1079_0_mirror_NULL -> f1079_0_mirror_NULL : arg1'=arg1P_9, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [ 2+arg1P_9<=arg1 && arg2>1 && arg1>2 && arg1P_9>0 ], cost: 1
      9: f1079_0_mirror_NULL -> f1079_0_mirror_NULL : arg1'=arg1P_10, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ 4+arg1P_10<=arg1 && arg2>1 && arg1>3 && arg1P_10>-1 ], cost: 1

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

Accelerating simple loops of location 5.
   Accelerating the following rules:
      6: f1039_0_createTree_GE -> f1039_0_createTree_GE : arg3'=1+arg3, [ arg4>0 && arg4>arg3 && arg6>1 && arg2<arg1 && arg2>-1 ], cost: 1
      7: f1039_0_createTree_GE -> f1039_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 17.
   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: 18, 19.
   Removing the simple loops: 6.

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
      0: f1_0_main_Load -> f499_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 -> f1061_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: f499_0_createTree_GT -> f1039_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: f1061_0_main_InvokeMethod -> f1079_0_mirror_NULL : 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: f1079_0_mirror_NULL -> f1079_0_mirror_NULL : arg1'=arg1P_9, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [ 2+arg1P_9<=arg1 && arg2>1 && arg1>2 && arg1P_9>0 ], cost: 1
      9: f1079_0_mirror_NULL -> f1079_0_mirror_NULL : arg1'=arg1P_10, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ 4+arg1P_10<=arg1 && arg2>1 && arg1>3 && arg1P_10>-1 ], cost: 1
     10: f1079_0_mirror_NULL -> f1400_0_mirror_FieldAccess : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, arg5'=arg2, arg6'=arg6P_11, [ arg1P_11<=arg1 && arg2>1 && 2+arg3P_11<=arg1 && arg1>2 && arg1P_11>1 && arg2P_11>2 && arg3P_11>-1 ], cost: 1
     11: f1079_0_mirror_NULL -> f1400_0_mirror_FieldAccess : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg3P_12, arg4'=arg4P_12, arg5'=arg2, arg6'=arg6P_12, [ arg1P_12<=arg1 && arg2>1 && 2+arg3P_12<=arg1 && arg1>2 && arg1P_12>1 && arg2P_12>5 && arg3P_12>-1 ], cost: 1
      5: f1039_0_createTree_GE -> f499_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: f1039_0_createTree_GE -> f1039_0_createTree_GE : arg3'=1+arg3, arg6'=arg6P_8, [ arg4>0 && arg4>arg3 && arg6>1 && arg2<arg1 && arg2>-1 ], cost: 1
     17: f1039_0_createTree_GE -> f1039_0_createTree_GE : arg3'=arg4, [ arg4>0 && arg6>1 && arg2<arg1 && arg2>-1 && -arg3+arg4>=0 ], cost: -arg3+arg4
     18: f1039_0_createTree_GE -> f1039_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
     19: f1039_0_createTree_GE -> f1039_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: f1400_0_mirror_FieldAccess -> f1079_0_mirror_NULL : arg1'=arg1P_13, arg2'=arg5, arg3'=arg3P_13, arg4'=arg4P_13, arg5'=arg5P_13, arg6'=arg6P_13, [ 3+arg1P_13<=arg1 && arg5>1 && 1+arg1P_13<=arg3 && arg1>2 && arg2>0 && arg3>0 && arg1P_13>-1 ], cost: 1
     16: __init -> f1_0_main_Load : arg1'=arg1P_17, arg2'=arg2P_17, arg3'=arg3P_17, arg4'=arg4P_17, arg5'=arg5P_17, arg6'=arg6P_17, [], cost: 1

Chained accelerated rules (with incoming rules):
   Start location: __init
      0: f1_0_main_Load -> f499_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 -> f1061_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: f499_0_createTree_GT -> f1039_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
     24: f499_0_createTree_GT -> f1039_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
     25: f499_0_createTree_GT -> f1039_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
     26: f499_0_createTree_GT -> f1039_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
     27: f499_0_createTree_GT -> f1039_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: f1061_0_main_InvokeMethod -> f1079_0_mirror_NULL : 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
     20: f1061_0_main_InvokeMethod -> f1079_0_mirror_NULL : arg1'=arg1P_9, arg2'=arg3, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [ arg3>1 && arg1>0 && arg1P_9>0 && 2+arg1P_9<=arg2 && 3<=arg2 ], cost: 2
     22: f1061_0_main_InvokeMethod -> f1079_0_mirror_NULL : arg1'=arg1P_10, arg2'=arg3, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ arg3>1 && arg1>0 && arg1P_10>-1 && 4+arg1P_10<=arg2 && 4<=arg2 ], cost: 2
     10: f1079_0_mirror_NULL -> f1400_0_mirror_FieldAccess : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, arg5'=arg2, arg6'=arg6P_11, [ arg1P_11<=arg1 && arg2>1 && 2+arg3P_11<=arg1 && arg1>2 && arg1P_11>1 && arg2P_11>2 && arg3P_11>-1 ], cost: 1
     11: f1079_0_mirror_NULL -> f1400_0_mirror_FieldAccess : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg3P_12, arg4'=arg4P_12, arg5'=arg2, arg6'=arg6P_12, [ arg1P_12<=arg1 && arg2>1 && 2+arg3P_12<=arg1 && arg1>2 && arg1P_12>1 && arg2P_12>5 && arg3P_12>-1 ], cost: 1
      5: f1039_0_createTree_GE -> f499_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: f1400_0_mirror_FieldAccess -> f1079_0_mirror_NULL : arg1'=arg1P_13, arg2'=arg5, arg3'=arg3P_13, arg4'=arg4P_13, arg5'=arg5P_13, arg6'=arg6P_13, [ 3+arg1P_13<=arg1 && arg5>1 && 1+arg1P_13<=arg3 && arg1>2 && arg2>0 && arg3>0 && arg1P_13>-1 ], cost: 1
     21: f1400_0_mirror_FieldAccess -> f1079_0_mirror_NULL : arg1'=arg1P_9, arg2'=arg5, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [ arg5>1 && arg2>0 && arg1P_9>0 && 2+arg1P_9<=-3+arg1 && 3<=-3+arg1 && 2+arg1P_9<=-1+arg3 && 3<=-1+arg3 ], cost: 2
     23: f1400_0_mirror_FieldAccess -> f1079_0_mirror_NULL : arg1'=arg1P_10, arg2'=arg5, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ arg5>1 && arg2>0 && arg1P_10>-1 && 4+arg1P_10<=-3+arg1 && 4<=-3+arg1 && 4+arg1P_10<=-1+arg3 && 4<=-1+arg3 ], cost: 2
     16: __init -> f1_0_main_Load : arg1'=arg1P_17, arg2'=arg2P_17, arg3'=arg3P_17, arg4'=arg4P_17, arg5'=arg5P_17, arg6'=arg6P_17, [], cost: 1

Eliminated locations (on tree-shaped paths):
   Start location: __init
     30: f499_0_createTree_GT -> f499_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
     31: f499_0_createTree_GT -> f499_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
     32: f499_0_createTree_GT -> f499_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
     33: f499_0_createTree_GT -> f499_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
     34: f499_0_createTree_GT -> [11] : [ arg1>0 && arg3>0 && arg3<arg2 && arg4P_5>0 ], cost: 1+arg4P_5
      3: f1061_0_main_InvokeMethod -> f1079_0_mirror_NULL : 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
     20: f1061_0_main_InvokeMethod -> f1079_0_mirror_NULL : arg1'=arg1P_9, arg2'=arg3, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [ arg3>1 && arg1>0 && arg1P_9>0 && 2+arg1P_9<=arg2 && 3<=arg2 ], cost: 2
     22: f1061_0_main_InvokeMethod -> f1079_0_mirror_NULL : arg1'=arg1P_10, arg2'=arg3, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ arg3>1 && arg1>0 && arg1P_10>-1 && 4+arg1P_10<=arg2 && 4<=arg2 ], cost: 2
     35: f1079_0_mirror_NULL -> f1079_0_mirror_NULL : arg1'=arg1P_13, arg2'=arg2, arg3'=arg3P_13, arg4'=arg4P_13, arg5'=arg5P_13, arg6'=arg6P_13, [ arg1P_11<=arg1 && arg2>1 && 2+arg3P_11<=arg1 && arg1>2 && arg2P_11>2 && 3+arg1P_13<=arg1P_11 && 1+arg1P_13<=arg3P_11 && arg1P_11>2 && arg3P_11>0 && arg1P_13>-1 ], cost: 2
     36: f1079_0_mirror_NULL -> f1079_0_mirror_NULL : arg1'=arg1P_9, arg2'=arg2, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [ arg1P_11<=arg1 && arg2>1 && 2+arg3P_11<=arg1 && arg1>2 && arg2P_11>2 && arg1P_9>0 && 2+arg1P_9<=-3+arg1P_11 && 3<=-3+arg1P_11 && 2+arg1P_9<=-1+arg3P_11 && 3<=-1+arg3P_11 ], cost: 3
     37: f1079_0_mirror_NULL -> f1079_0_mirror_NULL : arg1'=arg1P_10, arg2'=arg2, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ arg1P_11<=arg1 && arg2>1 && 2+arg3P_11<=arg1 && arg1>2 && arg2P_11>2 && arg1P_10>-1 && 4+arg1P_10<=-3+arg1P_11 && 4<=-3+arg1P_11 && 4+arg1P_10<=-1+arg3P_11 && 4<=-1+arg3P_11 ], cost: 3
     38: f1079_0_mirror_NULL -> f1079_0_mirror_NULL : arg1'=arg1P_13, arg2'=arg2, arg3'=arg3P_13, arg4'=arg4P_13, arg5'=arg5P_13, arg6'=arg6P_13, [ arg1P_12<=arg1 && arg2>1 && 2+arg3P_12<=arg1 && arg1>2 && arg2P_12>5 && 3+arg1P_13<=arg1P_12 && 1+arg1P_13<=arg3P_12 && arg1P_12>2 && arg3P_12>0 && arg1P_13>-1 ], cost: 2
     39: f1079_0_mirror_NULL -> f1079_0_mirror_NULL : arg1'=arg1P_9, arg2'=arg2, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [ arg1P_12<=arg1 && arg2>1 && 2+arg3P_12<=arg1 && arg1>2 && arg2P_12>5 && arg1P_9>0 && 2+arg1P_9<=-3+arg1P_12 && 3<=-3+arg1P_12 && 2+arg1P_9<=-1+arg3P_12 && 3<=-1+arg3P_12 ], cost: 3
     40: f1079_0_mirror_NULL -> f1079_0_mirror_NULL : arg1'=arg1P_10, arg2'=arg2, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ arg1P_12<=arg1 && arg2>1 && 2+arg3P_12<=arg1 && arg1>2 && arg2P_12>5 && arg1P_10>-1 && 4+arg1P_10<=-3+arg1P_12 && 4<=-3+arg1P_12 && 4+arg1P_10<=-1+arg3P_12 && 4<=-1+arg3P_12 ], cost: 3
     28: __init -> f499_0_createTree_GT : arg1'=arg1P_1, arg2'=arg2P_17, arg3'=1, arg4'=arg4P_1, arg5'=arg5P_1, arg6'=arg6P_1, [ arg1P_1>-1 && arg2P_17>0 && arg1P_17>0 ], cost: 2
     29: __init -> f1061_0_main_InvokeMethod : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, arg5'=arg5P_2, arg6'=arg6P_2, [ arg2P_17>0 && arg1P_2<=arg1P_17 && arg1P_17>0 && arg1P_2>0 && arg2P_2>-1 ], cost: 2

Applied pruning (of leafs and parallel rules):
   Start location: __init
     30: f499_0_createTree_GT -> f499_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
     31: f499_0_createTree_GT -> f499_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
     32: f499_0_createTree_GT -> f499_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
     33: f499_0_createTree_GT -> f499_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
     34: f499_0_createTree_GT -> [11] : [ arg1>0 && arg3>0 && arg3<arg2 && arg4P_5>0 ], cost: 1+arg4P_5
      3: f1061_0_main_InvokeMethod -> f1079_0_mirror_NULL : 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
     20: f1061_0_main_InvokeMethod -> f1079_0_mirror_NULL : arg1'=arg1P_9, arg2'=arg3, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [ arg3>1 && arg1>0 && arg1P_9>0 && 2+arg1P_9<=arg2 && 3<=arg2 ], cost: 2
     22: f1061_0_main_InvokeMethod -> f1079_0_mirror_NULL : arg1'=arg1P_10, arg2'=arg3, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ arg3>1 && arg1>0 && arg1P_10>-1 && 4+arg1P_10<=arg2 && 4<=arg2 ], cost: 2
     35: f1079_0_mirror_NULL -> f1079_0_mirror_NULL : arg1'=arg1P_13, arg2'=arg2, arg3'=arg3P_13, arg4'=arg4P_13, arg5'=arg5P_13, arg6'=arg6P_13, [ arg1P_11<=arg1 && arg2>1 && 2+arg3P_11<=arg1 && arg1>2 && arg2P_11>2 && 3+arg1P_13<=arg1P_11 && 1+arg1P_13<=arg3P_11 && arg1P_11>2 && arg3P_11>0 && arg1P_13>-1 ], cost: 2
     36: f1079_0_mirror_NULL -> f1079_0_mirror_NULL : arg1'=arg1P_9, arg2'=arg2, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [ arg1P_11<=arg1 && arg2>1 && 2+arg3P_11<=arg1 && arg1>2 && arg2P_11>2 && arg1P_9>0 && 2+arg1P_9<=-3+arg1P_11 && 3<=-3+arg1P_11 && 2+arg1P_9<=-1+arg3P_11 && 3<=-1+arg3P_11 ], cost: 3
     37: f1079_0_mirror_NULL -> f1079_0_mirror_NULL : arg1'=arg1P_10, arg2'=arg2, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ arg1P_11<=arg1 && arg2>1 && 2+arg3P_11<=arg1 && arg1>2 && arg2P_11>2 && arg1P_10>-1 && 4+arg1P_10<=-3+arg1P_11 && 4<=-3+arg1P_11 && 4+arg1P_10<=-1+arg3P_11 && 4<=-1+arg3P_11 ], cost: 3
     38: f1079_0_mirror_NULL -> f1079_0_mirror_NULL : arg1'=arg1P_13, arg2'=arg2, arg3'=arg3P_13, arg4'=arg4P_13, arg5'=arg5P_13, arg6'=arg6P_13, [ arg1P_12<=arg1 && arg2>1 && 2+arg3P_12<=arg1 && arg1>2 && arg2P_12>5 && 3+arg1P_13<=arg1P_12 && 1+arg1P_13<=arg3P_12 && arg1P_12>2 && arg3P_12>0 && arg1P_13>-1 ], cost: 2
     40: f1079_0_mirror_NULL -> f1079_0_mirror_NULL : arg1'=arg1P_10, arg2'=arg2, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ arg1P_12<=arg1 && arg2>1 && 2+arg3P_12<=arg1 && arg1>2 && arg2P_12>5 && arg1P_10>-1 && 4+arg1P_10<=-3+arg1P_12 && 4<=-3+arg1P_12 && 4+arg1P_10<=-1+arg3P_12 && 4<=-1+arg3P_12 ], cost: 3
     28: __init -> f499_0_createTree_GT : arg1'=arg1P_1, arg2'=arg2P_17, arg3'=1, arg4'=arg4P_1, arg5'=arg5P_1, arg6'=arg6P_1, [ arg1P_1>-1 && arg2P_17>0 && arg1P_17>0 ], cost: 2
     29: __init -> f1061_0_main_InvokeMethod : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, arg5'=arg5P_2, arg6'=arg6P_2, [ arg2P_17>0 && arg1P_2<=arg1P_17 && arg1P_17>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:
     30: f499_0_createTree_GT -> f499_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
     31: f499_0_createTree_GT -> f499_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
     33: f499_0_createTree_GT -> f499_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 30 with backward acceleration, yielding the new rule 41.
[test] deduced pseudo-invariant -arg6P_8+arg3<=0, also trying arg6P_8-arg3<=-1
   Accelerated rule 31 with backward acceleration, yielding the new rule 42.
   Failed to prove monotonicity of the guard of rule 33.
[accelerate] Nesting with 3 inner and 3 outer candidates
   Nested simple loops 33 (outer loop) and 42 (inner loop) with Rule(1 | arg3>0, arg6P_8>1, -arg6P_8+arg3<=0, k_5>=1, arg6P_8<arg2, k_2>=1, k_8>=1, 2-2*(-1+k_8)*k_5-2*k_8+arg1-2*k_5>0, | 3*k_8*k_5+3*k_8+2*k_2*k_8 || 1 | 0=-2*k_8*k_5-2*k_8+arg1, 2=arg6P_8, 3=arg4P_6, 4=arg5P_6, 5=arg6P_6, ), resulting in the new rules: 43, 44.
   Removing the simple loops: 30 33.

Accelerating simple loops of location 4.
   Simplified some of the simple loops (and removed duplicate rules).
   Accelerating the following rules:
     35: f1079_0_mirror_NULL -> f1079_0_mirror_NULL : arg1'=arg1P_13, arg3'=arg3P_13, arg4'=arg4P_13, arg5'=arg5P_13, arg6'=arg6P_13, [ arg2>1 && arg1>2 && arg1P_13>-1 && 3+arg1P_13<=arg1 ], cost: 2
     36: f1079_0_mirror_NULL -> f1079_0_mirror_NULL : arg1'=arg1P_9, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [ arg2>1 && arg1P_9>0 && 5+arg1P_9<=arg1 && 6<=arg1 ], cost: 3
     37: f1079_0_mirror_NULL -> f1079_0_mirror_NULL : arg1'=arg1P_10, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ arg2>1 && arg1P_10>-1 && 7+arg1P_10<=arg1 && 7<=arg1 ], cost: 3
     38: f1079_0_mirror_NULL -> f1079_0_mirror_NULL : arg1'=arg1P_13, arg3'=arg3P_13, arg4'=arg4P_13, arg5'=arg5P_13, arg6'=arg6P_13, [ arg2>1 && arg1>2 && arg1P_13>-1 && 1+arg1P_13<=-2+arg1 ], cost: 2
     40: f1079_0_mirror_NULL -> f1079_0_mirror_NULL : arg1'=arg1P_10, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ arg2>1 && arg1P_10>-1 && 5+arg1P_10<=-2+arg1 && 5<=-2+arg1 ], cost: 3

   Failed to prove monotonicity of the guard of rule 35.
   Failed to prove monotonicity of the guard of rule 36.
   Failed to prove monotonicity of the guard of rule 37.
   Failed to prove monotonicity of the guard of rule 38.
   Failed to prove monotonicity of the guard of rule 40.
[accelerate] Nesting with 5 inner and 5 outer candidates

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
     31: f499_0_createTree_GT -> f499_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
     34: f499_0_createTree_GT -> [11] : [ arg1>0 && arg3>0 && arg3<arg2 && arg4P_5>0 ], cost: 1+arg4P_5
     41: f499_0_createTree_GT -> f499_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
     42: f499_0_createTree_GT -> f499_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
     43: f499_0_createTree_GT -> f499_0_createTree_GT : arg1'=-2*k_8*k_5-2*k_8+arg1, 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_8>=1 && 2-2*(-1+k_8)*k_5-2*k_8+arg1-2*k_5>0 ], cost: 3*k_8*k_5+3*k_8+2*k_2*k_8
     44: f499_0_createTree_GT -> f499_0_createTree_GT : arg1'=-2-2*k_8*k_5-2*k_8+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 && k_5>=1 && arg6P_8<arg2 && k_8>=1 && -2*(-1+k_8)*k_5-2*k_8+arg1-2*k_5>0 ], cost: 3+2*k_2+3*k_8*k_5+3*k_8+2*k_2*k_8
      3: f1061_0_main_InvokeMethod -> f1079_0_mirror_NULL : 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
     20: f1061_0_main_InvokeMethod -> f1079_0_mirror_NULL : arg1'=arg1P_9, arg2'=arg3, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [ arg3>1 && arg1>0 && arg1P_9>0 && 2+arg1P_9<=arg2 && 3<=arg2 ], cost: 2
     22: f1061_0_main_InvokeMethod -> f1079_0_mirror_NULL : arg1'=arg1P_10, arg2'=arg3, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ arg3>1 && arg1>0 && arg1P_10>-1 && 4+arg1P_10<=arg2 && 4<=arg2 ], cost: 2
     35: f1079_0_mirror_NULL -> f1079_0_mirror_NULL : arg1'=arg1P_13, arg3'=arg3P_13, arg4'=arg4P_13, arg5'=arg5P_13, arg6'=arg6P_13, [ arg2>1 && arg1>2 && arg1P_13>-1 && 3+arg1P_13<=arg1 ], cost: 2
     36: f1079_0_mirror_NULL -> f1079_0_mirror_NULL : arg1'=arg1P_9, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [ arg2>1 && arg1P_9>0 && 5+arg1P_9<=arg1 && 6<=arg1 ], cost: 3
     37: f1079_0_mirror_NULL -> f1079_0_mirror_NULL : arg1'=arg1P_10, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ arg2>1 && arg1P_10>-1 && 7+arg1P_10<=arg1 && 7<=arg1 ], cost: 3
     38: f1079_0_mirror_NULL -> f1079_0_mirror_NULL : arg1'=arg1P_13, arg3'=arg3P_13, arg4'=arg4P_13, arg5'=arg5P_13, arg6'=arg6P_13, [ arg2>1 && arg1>2 && arg1P_13>-1 && 1+arg1P_13<=-2+arg1 ], cost: 2
     40: f1079_0_mirror_NULL -> f1079_0_mirror_NULL : arg1'=arg1P_10, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ arg2>1 && arg1P_10>-1 && 5+arg1P_10<=-2+arg1 && 5<=-2+arg1 ], cost: 3
     28: __init -> f499_0_createTree_GT : arg1'=arg1P_1, arg2'=arg2P_17, arg3'=1, arg4'=arg4P_1, arg5'=arg5P_1, arg6'=arg6P_1, [ arg1P_1>-1 && arg2P_17>0 && arg1P_17>0 ], cost: 2
     29: __init -> f1061_0_main_InvokeMethod : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, arg5'=arg5P_2, arg6'=arg6P_2, [ arg2P_17>0 && arg1P_2<=arg1P_17 && arg1P_17>0 && arg1P_2>0 && arg2P_2>-1 ], cost: 2

Chained accelerated rules (with incoming rules):
   Start location: __init
     34: f499_0_createTree_GT -> [11] : [ arg1>0 && arg3>0 && arg3<arg2 && arg4P_5>0 ], cost: 1+arg4P_5
      3: f1061_0_main_InvokeMethod -> f1079_0_mirror_NULL : 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
     20: f1061_0_main_InvokeMethod -> f1079_0_mirror_NULL : arg1'=arg1P_9, arg2'=arg3, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [ arg3>1 && arg1>0 && arg1P_9>0 && 2+arg1P_9<=arg2 && 3<=arg2 ], cost: 2
     22: f1061_0_main_InvokeMethod -> f1079_0_mirror_NULL : arg1'=arg1P_10, arg2'=arg3, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ arg3>1 && arg1>0 && arg1P_10>-1 && 4+arg1P_10<=arg2 && 4<=arg2 ], cost: 2
     50: f1061_0_main_InvokeMethod -> f1079_0_mirror_NULL : arg1'=arg1P_13, arg2'=arg3, arg3'=arg3P_13, arg4'=arg4P_13, arg5'=arg5P_13, arg6'=arg6P_13, [ arg3>1 && arg1>0 && arg1P_13>-1 && 3<=arg2 && 3+arg1P_13<=arg2 ], cost: 3
     51: f1061_0_main_InvokeMethod -> f1079_0_mirror_NULL : arg1'=arg1P_13, arg2'=arg3, arg3'=arg3P_13, arg4'=arg4P_13, arg5'=arg5P_13, arg6'=arg6P_13, [ arg3>1 && arg1>0 && arg1P_13>-1 && 3<=-2+arg2 && 3+arg1P_13<=-2+arg2 ], cost: 4
     52: f1061_0_main_InvokeMethod -> f1079_0_mirror_NULL : arg1'=arg1P_13, arg2'=arg3, arg3'=arg3P_13, arg4'=arg4P_13, arg5'=arg5P_13, arg6'=arg6P_13, [ arg3>1 && arg1>0 && arg1P_13>-1 && 3<=-4+arg2 && 3+arg1P_13<=-4+arg2 ], cost: 4
     53: f1061_0_main_InvokeMethod -> f1079_0_mirror_NULL : arg1'=arg1P_9, arg2'=arg3, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [ arg3>1 && arg1>0 && arg1P_9>0 && 5+arg1P_9<=arg2 && 6<=arg2 ], cost: 4
     54: f1061_0_main_InvokeMethod -> f1079_0_mirror_NULL : arg1'=arg1P_9, arg2'=arg3, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [ arg3>1 && arg1>0 && arg1P_9>0 && 5+arg1P_9<=-4+arg2 && 6<=-4+arg2 ], cost: 5
     55: f1061_0_main_InvokeMethod -> f1079_0_mirror_NULL : arg1'=arg1P_10, arg2'=arg3, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ arg3>1 && arg1>0 && arg1P_10>-1 && 7+arg1P_10<=arg2 && 7<=arg2 ], cost: 4
     56: f1061_0_main_InvokeMethod -> f1079_0_mirror_NULL : arg1'=arg1P_10, arg2'=arg3, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ arg3>1 && arg1>0 && arg1P_10>-1 && 7+arg1P_10<=-2+arg2 && 7<=-2+arg2 ], cost: 5
     57: f1061_0_main_InvokeMethod -> f1079_0_mirror_NULL : arg1'=arg1P_13, arg2'=arg3, arg3'=arg3P_13, arg4'=arg4P_13, arg5'=arg5P_13, arg6'=arg6P_13, [ arg3>1 && arg1>0 && arg1P_13>-1 && 3<=arg2 && 3+arg1P_13<=arg2 ], cost: 3
     58: f1061_0_main_InvokeMethod -> f1079_0_mirror_NULL : arg1'=arg1P_13, arg2'=arg3, arg3'=arg3P_13, arg4'=arg4P_13, arg5'=arg5P_13, arg6'=arg6P_13, [ arg3>1 && arg1>0 && arg1P_13>-1 && 3<=-2+arg2 && 3+arg1P_13<=-2+arg2 ], cost: 4
     59: f1061_0_main_InvokeMethod -> f1079_0_mirror_NULL : arg1'=arg1P_13, arg2'=arg3, arg3'=arg3P_13, arg4'=arg4P_13, arg5'=arg5P_13, arg6'=arg6P_13, [ arg3>1 && arg1>0 && arg1P_13>-1 && 3<=-4+arg2 && 3+arg1P_13<=-4+arg2 ], cost: 4
     60: f1061_0_main_InvokeMethod -> f1079_0_mirror_NULL : arg1'=arg1P_10, arg2'=arg3, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ arg3>1 && arg1>0 && arg1P_10>-1 && 7+arg1P_10<=arg2 && 7<=arg2 ], cost: 4
     61: f1061_0_main_InvokeMethod -> f1079_0_mirror_NULL : arg1'=arg1P_10, arg2'=arg3, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ arg3>1 && arg1>0 && arg1P_10>-1 && 7+arg1P_10<=-2+arg2 && 7<=-2+arg2 ], cost: 5
     28: __init -> f499_0_createTree_GT : arg1'=arg1P_1, arg2'=arg2P_17, arg3'=1, arg4'=arg4P_1, arg5'=arg5P_1, arg6'=arg6P_1, [ arg1P_1>-1 && arg2P_17>0 && arg1P_17>0 ], cost: 2
     29: __init -> f1061_0_main_InvokeMethod : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, arg5'=arg5P_2, arg6'=arg6P_2, [ arg2P_17>0 && arg1P_2<=arg1P_17 && arg1P_17>0 && arg1P_2>0 && arg2P_2>-1 ], cost: 2
     45: __init -> f499_0_createTree_GT : arg1'=-2+arg1P_1, arg2'=arg2P_17, arg3'=arg6P_8, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg1P_1>0 && 1<arg2P_17 && arg6P_8>1 ], cost: 5
     46: __init -> f499_0_createTree_GT : arg1'=-2*k_3+arg1P_1, arg2'=arg2P_17, arg3'=1+k_3, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg1P_1>-1 && arg2P_17>0 && k_3>=1 && 2-2*k_3+arg1P_1>0 && k_3<arg2P_17 ], cost: 2+2*k_3
     47: __init -> f499_0_createTree_GT : arg1'=arg1P_1-2*k_5, arg2'=arg2P_17, arg3'=arg6P_8, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg1P_1>-1 && arg2P_17>0 && arg6P_8>1 && k_5>=1 && 2+arg1P_1-2*k_5>0 && arg6P_8<arg2P_17 ], cost: 2+3*k_5
     48: __init -> f499_0_createTree_GT : arg1'=-2*k_8*k_5-2*k_8+arg1P_1, arg2'=arg2P_17, arg3'=arg6P_8, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg1P_1>-1 && arg2P_17>0 && arg6P_8>1 && k_5>=1 && arg6P_8<arg2P_17 && k_2>=1 && k_8>=1 && 2-2*(-1+k_8)*k_5-2*k_8+arg1P_1-2*k_5>0 ], cost: 2+3*k_8*k_5+3*k_8+2*k_2*k_8
     49: __init -> f499_0_createTree_GT : arg1'=-2-2*k_8*k_5-2*k_8+arg1P_1, arg2'=arg2P_17, arg3'=arg6P_8, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg1P_1>0 && 1<arg2P_17 && arg6P_8>1 && k_2>=1 && k_5>=1 && arg6P_8<arg2P_17 && k_8>=1 && -2*(-1+k_8)*k_5-2*k_8+arg1P_1-2*k_5>0 ], cost: 5+2*k_2+3*k_8*k_5+3*k_8+2*k_2*k_8

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

Eliminated locations (on tree-shaped paths):
   Start location: __init
     62: __init -> [11] : arg1'=arg1P_1, arg2'=arg2P_17, arg3'=1, arg4'=arg4P_1, arg5'=arg5P_1, arg6'=arg6P_1, [ arg1P_17>0 && arg1P_1>0 && 1<arg2P_17 && arg4P_5>0 ], cost: 3+arg4P_5
     63: __init -> [11] : arg1'=-2+arg1P_1, arg2'=arg2P_17, arg3'=arg6P_8, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ 1<arg2P_17 && arg6P_8>1 && -2+arg1P_1>0 && arg6P_8<arg2P_17 && arg4P_5>0 ], cost: 6+arg4P_5
     64: __init -> [11] : arg1'=-2*k_3+arg1P_1, arg2'=arg2P_17, arg3'=1+k_3, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg1P_1>-1 && arg2P_17>0 && k_3>=1 && -2*k_3+arg1P_1>0 && 1+k_3<arg2P_17 && arg4P_5>0 ], cost: 3+arg4P_5+2*k_3
     65: __init -> [11] : arg1'=arg1P_1-2*k_5, arg2'=arg2P_17, arg3'=arg6P_8, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg1P_1>-1 && arg2P_17>0 && arg6P_8>1 && k_5>=1 && arg6P_8<arg2P_17 && arg1P_1-2*k_5>0 && arg4P_5>0 ], cost: 3+arg4P_5+3*k_5
     66: __init -> [11] : arg1'=-2*k_8*k_5-2*k_8+arg1P_1, arg2'=arg2P_17, arg3'=arg6P_8, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg1P_1>-1 && arg2P_17>0 && arg6P_8>1 && k_5>=1 && arg6P_8<arg2P_17 && k_2>=1 && k_8>=1 && -2*k_8*k_5-2*k_8+arg1P_1>0 && arg4P_5>0 ], cost: 3+3*k_8*k_5+arg4P_5+3*k_8+2*k_2*k_8
     67: __init -> [11] : arg1'=-2-2*k_8*k_5-2*k_8+arg1P_1, arg2'=arg2P_17, arg3'=arg6P_8, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg1P_1>0 && 1<arg2P_17 && arg6P_8>1 && k_2>=1 && k_5>=1 && arg6P_8<arg2P_17 && k_8>=1 && -2-2*k_8*k_5-2*k_8+arg1P_1>0 && arg4P_5>0 ], cost: 6+2*k_2+3*k_8*k_5+arg4P_5+3*k_8+2*k_2*k_8

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     62: __init -> [11] : arg1'=arg1P_1, arg2'=arg2P_17, arg3'=1, arg4'=arg4P_1, arg5'=arg5P_1, arg6'=arg6P_1, [ arg1P_17>0 && arg1P_1>0 && 1<arg2P_17 && arg4P_5>0 ], cost: 3+arg4P_5
     63: __init -> [11] : arg1'=-2+arg1P_1, arg2'=arg2P_17, arg3'=arg6P_8, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ 1<arg2P_17 && arg6P_8>1 && -2+arg1P_1>0 && arg6P_8<arg2P_17 && arg4P_5>0 ], cost: 6+arg4P_5
     64: __init -> [11] : arg1'=-2*k_3+arg1P_1, arg2'=arg2P_17, arg3'=1+k_3, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg1P_1>-1 && arg2P_17>0 && k_3>=1 && -2*k_3+arg1P_1>0 && 1+k_3<arg2P_17 && arg4P_5>0 ], cost: 3+arg4P_5+2*k_3
     65: __init -> [11] : arg1'=arg1P_1-2*k_5, arg2'=arg2P_17, arg3'=arg6P_8, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg1P_1>-1 && arg2P_17>0 && arg6P_8>1 && k_5>=1 && arg6P_8<arg2P_17 && arg1P_1-2*k_5>0 && arg4P_5>0 ], cost: 3+arg4P_5+3*k_5
     66: __init -> [11] : arg1'=-2*k_8*k_5-2*k_8+arg1P_1, arg2'=arg2P_17, arg3'=arg6P_8, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg1P_1>-1 && arg2P_17>0 && arg6P_8>1 && k_5>=1 && arg6P_8<arg2P_17 && k_2>=1 && k_8>=1 && -2*k_8*k_5-2*k_8+arg1P_1>0 && arg4P_5>0 ], cost: 3+3*k_8*k_5+arg4P_5+3*k_8+2*k_2*k_8
     67: __init -> [11] : arg1'=-2-2*k_8*k_5-2*k_8+arg1P_1, arg2'=arg2P_17, arg3'=arg6P_8, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg1P_1>0 && 1<arg2P_17 && arg6P_8>1 && k_2>=1 && k_5>=1 && arg6P_8<arg2P_17 && k_8>=1 && -2-2*k_8*k_5-2*k_8+arg1P_1>0 && arg4P_5>0 ], cost: 6+2*k_2+3*k_8*k_5+arg4P_5+3*k_8+2*k_2*k_8

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

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

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

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

Computing asymptotic complexity for rule 64
   Simplified the guard:
     64: __init -> [11] : arg1'=-2*k_3+arg1P_1, arg2'=arg2P_17, 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_17 && arg4P_5>0 ], cost: 3+arg4P_5+2*k_3
   Resulting cost 0 has complexity: Unknown

Computing asymptotic complexity for rule 65
   Simplified the guard:
     65: __init -> [11] : arg1'=arg1P_1-2*k_5, arg2'=arg2P_17, arg3'=arg6P_8, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg6P_8>1 && k_5>=1 && arg6P_8<arg2P_17 && 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),?)