WORST_CASE(INF,?)

### 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

      During metering: Instantiating temporary variables by {arg1P_9==-2+arg1}
   Accelerated rule 8 with metering function meter (where 2*meter==-2+arg1), yielding the new rule 17.
      During metering: Instantiating temporary variables by {arg1P_10==-4+arg1}
   Accelerated rule 9 with metering function meter_1 (where 4*meter_1==-3+arg1), yielding the new rule 18.
   Nested simple loops 8 (outer loop) and 18 (inner loop) with metering function 1-arg1P_9, resulting in the new rules: 19.
   Removing the simple loops: 8 9.

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 metering function -arg3+arg4, yielding the new rule 20.
   Accelerated rule 7 with metering function -arg3+arg4 (after strengthening guard), yielding the new rule 21.
   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
     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
     17: f1079_0_mirror_NULL -> f1079_0_mirror_NULL : arg1'=-2*meter+arg1, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [ arg2>1 && arg1>2 && 2*meter==-2+arg1 && meter>=1 ], cost: meter
     18: f1079_0_mirror_NULL -> f1079_0_mirror_NULL : arg1'=-4*meter_1+arg1, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ arg2>1 && arg1>3 && 4*meter_1==-3+arg1 && meter_1>=1 ], cost: meter_1
     19: 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 && arg1>3 && 4*meter_1==-3+arg1 && meter_1>=1 && 2+arg1P_9<=-4*meter_1+arg1 && arg1P_9>0 && 1-arg1P_9>=1 ], cost: 1-meter_1*(-1+arg1P_9)-arg1P_9
      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
     20: f1039_0_createTree_GE -> f1039_0_createTree_GE : arg3'=arg4, [ arg4>0 && arg4>arg3 && arg6>1 && arg2<arg1 && arg2>-1 ], cost: -arg3+arg4
     21: f1039_0_createTree_GE -> f1039_0_createTree_GE : arg3'=arg4, arg6'=arg6P_8, [ arg4>0 && arg4>arg3 && arg6>1 && arg2<arg1 && arg2>-1 && arg6P_8>1 ], cost: -arg3+arg4
     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
     26: 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
     27: 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
     28: f499_0_createTree_GT -> f1039_0_createTree_GE : arg2'=-1+arg1, arg3'=arg4P_5, arg4'=arg4P_5, arg5'=arg2, arg6'=arg6P_8, [ arg1>0 && arg3>0 && arg3<arg2 && arg4P_5>0 && arg6P_8>1 ], 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
     22: f1061_0_main_InvokeMethod -> f1079_0_mirror_NULL : arg1'=2, arg2'=arg3, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [ arg3>1 && 2+2*meter<=arg2 && arg1>0 && arg2>-1 && 2+2*meter>2 && meter>=1 ], cost: 1+meter
     24: f1061_0_main_InvokeMethod -> f1079_0_mirror_NULL : arg1'=3, arg2'=arg3, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ arg3>1 && 3+4*meter_1<=arg2 && arg1>0 && arg2>-1 && 3+4*meter_1>3 && meter_1>=1 ], cost: 1+meter_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
     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
     23: f1400_0_mirror_FieldAccess -> f1079_0_mirror_NULL : arg1'=2, arg2'=arg5, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [ 5+2*meter<=arg1 && arg5>1 && 3+2*meter<=arg3 && arg1>2 && arg2>0 && arg3>0 && 2+2*meter>2 && meter>=1 ], cost: 1+meter
     25: f1400_0_mirror_FieldAccess -> f1079_0_mirror_NULL : arg1'=3, arg2'=arg5, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ 6+4*meter_1<=arg1 && arg5>1 && 4+4*meter_1<=arg3 && arg1>2 && arg2>0 && arg3>0 && 3+4*meter_1>3 && meter_1>=1 ], cost: 1+meter_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

Eliminated locations (on tree-shaped paths):
   Start location: __init
     31: 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
     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>1 && arg6P_8>1 ], cost: 3
     33: f499_0_createTree_GT -> [11] : [ arg1>0 && arg3>0 && arg3<arg2 && arg4P_5>0 ], cost: 1+arg4P_5
     34: f499_0_createTree_GT -> [11] : [ arg1>0 && arg3>0 && arg3<arg2 && arg4P_5>0 && arg6P_8>1 ], 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
     22: f1061_0_main_InvokeMethod -> f1079_0_mirror_NULL : arg1'=2, arg2'=arg3, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [ arg3>1 && 2+2*meter<=arg2 && arg1>0 && arg2>-1 && 2+2*meter>2 && meter>=1 ], cost: 1+meter
     24: f1061_0_main_InvokeMethod -> f1079_0_mirror_NULL : arg1'=3, arg2'=arg3, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ arg3>1 && 3+4*meter_1<=arg2 && arg1>0 && arg2>-1 && 3+4*meter_1>3 && meter_1>=1 ], cost: 1+meter_1
     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'=2, 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 && 5+2*meter<=arg1P_11 && 3+2*meter<=arg3P_11 && arg1P_11>2 && arg3P_11>0 && 2+2*meter>2 && meter>=1 ], cost: 2+meter
     37: f1079_0_mirror_NULL -> f1079_0_mirror_NULL : arg1'=3, 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 && 6+4*meter_1<=arg1P_11 && 4+4*meter_1<=arg3P_11 && arg1P_11>2 && arg3P_11>0 && 3+4*meter_1>3 && meter_1>=1 ], cost: 2+meter_1
     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'=2, 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 && 5+2*meter<=arg1P_12 && 3+2*meter<=arg3P_12 && arg1P_12>2 && arg3P_12>0 && 2+2*meter>2 && meter>=1 ], cost: 2+meter
     40: f1079_0_mirror_NULL -> f1079_0_mirror_NULL : arg1'=3, 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 && 6+4*meter_1<=arg1P_12 && 4+4*meter_1<=arg3P_12 && arg1P_12>2 && arg3P_12>0 && 3+4*meter_1>3 && meter_1>=1 ], cost: 2+meter_1
     29: __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
     30: __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
     31: 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
     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>1 && arg6P_8>1 ], cost: 3
     33: f499_0_createTree_GT -> [11] : [ arg1>0 && arg3>0 && arg3<arg2 && arg4P_5>0 ], cost: 1+arg4P_5
     34: f499_0_createTree_GT -> [11] : [ arg1>0 && arg3>0 && arg3<arg2 && arg4P_5>0 && arg6P_8>1 ], 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
     22: f1061_0_main_InvokeMethod -> f1079_0_mirror_NULL : arg1'=2, arg2'=arg3, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [ arg3>1 && 2+2*meter<=arg2 && arg1>0 && arg2>-1 && 2+2*meter>2 && meter>=1 ], cost: 1+meter
     24: f1061_0_main_InvokeMethod -> f1079_0_mirror_NULL : arg1'=3, arg2'=arg3, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ arg3>1 && 3+4*meter_1<=arg2 && arg1>0 && arg2>-1 && 3+4*meter_1>3 && meter_1>=1 ], cost: 1+meter_1
     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'=2, 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 && 5+2*meter<=arg1P_11 && 3+2*meter<=arg3P_11 && arg1P_11>2 && arg3P_11>0 && 2+2*meter>2 && meter>=1 ], cost: 2+meter
     37: f1079_0_mirror_NULL -> f1079_0_mirror_NULL : arg1'=3, 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 && 6+4*meter_1<=arg1P_11 && 4+4*meter_1<=arg3P_11 && arg1P_11>2 && arg3P_11>0 && 3+4*meter_1>3 && meter_1>=1 ], cost: 2+meter_1
     39: f1079_0_mirror_NULL -> f1079_0_mirror_NULL : arg1'=2, 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 && 5+2*meter<=arg1P_12 && 3+2*meter<=arg3P_12 && arg1P_12>2 && arg3P_12>0 && 2+2*meter>2 && meter>=1 ], cost: 2+meter
     40: f1079_0_mirror_NULL -> f1079_0_mirror_NULL : arg1'=3, 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 && 6+4*meter_1<=arg1P_12 && 4+4*meter_1<=arg3P_12 && arg1P_12>2 && arg3P_12>0 && 3+4*meter_1>3 && meter_1>=1 ], cost: 2+meter_1
     29: __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
     30: __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.
   Simplified some of the simple loops (and removed duplicate rules).
   Accelerating the following rules:
     31: 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
     32: 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

   Found no metering function for rule 31.
   Accelerated rule 32 with metering function meter_2 (where 2*meter_2==arg1) (after strengthening guard), yielding the new rule 41.
      During metering: Instantiating temporary variables by {meter_2==1,arg6P_8==-1+arg2}
   Removing the simple loops:.

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
     39: f1079_0_mirror_NULL -> f1079_0_mirror_NULL : arg1'=2, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [ arg2>1 && arg1>2 && 2+2*meter>2 && meter>=1 && 5+2*meter<=arg1 ], cost: 2+meter
     40: f1079_0_mirror_NULL -> f1079_0_mirror_NULL : arg1'=3, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ arg2>1 && arg1>2 && 3+4*meter_1>3 && meter_1>=1 && 6+4*meter_1<=arg1 ], cost: 2+meter_1

      During metering: Instantiating temporary variables by {arg1P_13==-3+arg1}
   Accelerated rule 35 with metering function meter_4 (where 3*meter_4==-2+arg1), yielding the new rule 42.
   Accelerated rule 39 with NONTERM (after strengthening guard), yielding the new rule 43.
   Accelerated rule 40 with NONTERM (after strengthening guard), yielding the new rule 44.
   Removing the simple loops: 35.

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'=1+arg3, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg1>0 && arg3>0 && arg3<arg2 ], cost: 2
     32: 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 -> [11] : [ arg1>0 && arg3>0 && arg3<arg2 && arg4P_5>0 ], cost: 1+arg4P_5
     34: f499_0_createTree_GT -> [11] : [ arg1>0 && arg3>0 && arg3<arg2 && arg4P_5>0 && arg6P_8>1 ], cost: 1+arg4P_5
     41: f499_0_createTree_GT -> f499_0_createTree_GT : arg1'=-2*meter_2+arg1, arg3'=arg6P_8, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg1>0 && arg3>0 && arg3<arg2 && arg6P_8>1 && arg6P_8<arg2 && 2*meter_2==arg1 && meter_2>=1 ], cost: 3*meter_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
     22: f1061_0_main_InvokeMethod -> f1079_0_mirror_NULL : arg1'=2, arg2'=arg3, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [ arg3>1 && 2+2*meter<=arg2 && arg1>0 && arg2>-1 && 2+2*meter>2 && meter>=1 ], cost: 1+meter
     24: f1061_0_main_InvokeMethod -> f1079_0_mirror_NULL : arg1'=3, arg2'=arg3, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ arg3>1 && 3+4*meter_1<=arg2 && arg1>0 && arg2>-1 && 3+4*meter_1>3 && meter_1>=1 ], cost: 1+meter_1
     39: f1079_0_mirror_NULL -> f1079_0_mirror_NULL : arg1'=2, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [ arg2>1 && arg1>2 && 2+2*meter>2 && meter>=1 && 5+2*meter<=arg1 ], cost: 2+meter
     40: f1079_0_mirror_NULL -> f1079_0_mirror_NULL : arg1'=3, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ arg2>1 && arg1>2 && 3+4*meter_1>3 && meter_1>=1 && 6+4*meter_1<=arg1 ], cost: 2+meter_1
     42: f1079_0_mirror_NULL -> f1079_0_mirror_NULL : arg1'=arg1-3*meter_4, arg3'=arg3P_13, arg4'=arg4P_13, arg5'=arg5P_13, arg6'=arg6P_13, [ arg2>1 && arg1>2 && 3*meter_4==-2+arg1 && meter_4>=1 ], cost: 2*meter_4
     43: f1079_0_mirror_NULL -> [13] : [ arg2>1 && arg1>2 && 2+2*meter>2 && meter>=1 && 5+2*meter<=arg1 && 5+2*meter<=2 ], cost: NONTERM
     44: f1079_0_mirror_NULL -> [13] : [ arg2>1 && arg1>2 && 3+4*meter_1>3 && meter_1>=1 && 6+4*meter_1<=arg1 && 6+4*meter_1<=3 ], cost: NONTERM
     29: __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
     30: __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
     33: f499_0_createTree_GT -> [11] : [ arg1>0 && arg3>0 && arg3<arg2 && arg4P_5>0 ], cost: 1+arg4P_5
     34: f499_0_createTree_GT -> [11] : [ arg1>0 && arg3>0 && arg3<arg2 && arg4P_5>0 && arg6P_8>1 ], 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
     22: f1061_0_main_InvokeMethod -> f1079_0_mirror_NULL : arg1'=2, arg2'=arg3, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [ arg3>1 && 2+2*meter<=arg2 && arg1>0 && arg2>-1 && 2+2*meter>2 && meter>=1 ], cost: 1+meter
     24: f1061_0_main_InvokeMethod -> f1079_0_mirror_NULL : arg1'=3, arg2'=arg3, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ arg3>1 && 3+4*meter_1<=arg2 && arg1>0 && arg2>-1 && 3+4*meter_1>3 && meter_1>=1 ], cost: 1+meter_1
     48: f1061_0_main_InvokeMethod -> f1079_0_mirror_NULL : arg1'=2, arg2'=arg3, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [ arg3>1 && arg1>0 && 2+2*meter>2 && meter>=1 && 3<=arg2 && 5+2*meter<=arg2 ], cost: 3+meter
     49: f1061_0_main_InvokeMethod -> f1079_0_mirror_NULL : arg1'=3, arg2'=arg3, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ arg3>1 && arg1>0 && 3+4*meter_1>3 && meter_1>=1 && 3<=arg2 && 6+4*meter_1<=arg2 ], cost: 3+meter_1
     50: f1061_0_main_InvokeMethod -> f1079_0_mirror_NULL : arg1'=2, arg2'=arg3, arg3'=arg3P_13, arg4'=arg4P_13, arg5'=arg5P_13, arg6'=arg6P_13, [ arg3>1 && 2+3*meter_4<=arg2 && arg1>0 && arg2>-1 && 2+3*meter_4>2 && meter_4>=1 ], cost: 1+2*meter_4
     29: __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
     30: __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'=2, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg1P_1>0 && 1<arg2P_17 ], cost: 4
     46: __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
     47: __init -> f499_0_createTree_GT : arg1'=0, arg2'=arg2P_17, arg3'=arg6P_8, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ 2*meter_2>0 && 1<arg2P_17 && arg6P_8>1 && arg6P_8<arg2P_17 && meter_2>=1 ], cost: 2+3*meter_2

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
     33: f499_0_createTree_GT -> [11] : [ arg1>0 && arg3>0 && arg3<arg2 && arg4P_5>0 ], cost: 1+arg4P_5
     34: f499_0_createTree_GT -> [11] : [ arg1>0 && arg3>0 && arg3<arg2 && arg4P_5>0 && arg6P_8>1 ], cost: 1+arg4P_5
     22: f1061_0_main_InvokeMethod -> f1079_0_mirror_NULL : arg1'=2, arg2'=arg3, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [ arg3>1 && 2+2*meter<=arg2 && arg1>0 && arg2>-1 && 2+2*meter>2 && meter>=1 ], cost: 1+meter
     24: f1061_0_main_InvokeMethod -> f1079_0_mirror_NULL : arg1'=3, arg2'=arg3, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ arg3>1 && 3+4*meter_1<=arg2 && arg1>0 && arg2>-1 && 3+4*meter_1>3 && meter_1>=1 ], cost: 1+meter_1
     48: f1061_0_main_InvokeMethod -> f1079_0_mirror_NULL : arg1'=2, arg2'=arg3, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [ arg3>1 && arg1>0 && 2+2*meter>2 && meter>=1 && 3<=arg2 && 5+2*meter<=arg2 ], cost: 3+meter
     49: f1061_0_main_InvokeMethod -> f1079_0_mirror_NULL : arg1'=3, arg2'=arg3, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ arg3>1 && arg1>0 && 3+4*meter_1>3 && meter_1>=1 && 3<=arg2 && 6+4*meter_1<=arg2 ], cost: 3+meter_1
     50: f1061_0_main_InvokeMethod -> f1079_0_mirror_NULL : arg1'=2, arg2'=arg3, arg3'=arg3P_13, arg4'=arg4P_13, arg5'=arg5P_13, arg6'=arg6P_13, [ arg3>1 && 2+3*meter_4<=arg2 && arg1>0 && arg2>-1 && 2+3*meter_4>2 && meter_4>=1 ], cost: 1+2*meter_4
     29: __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
     30: __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'=2, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg1P_1>0 && 1<arg2P_17 ], cost: 4
     46: __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
     47: __init -> f499_0_createTree_GT : arg1'=0, arg2'=arg2P_17, arg3'=arg6P_8, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ 2*meter_2>0 && 1<arg2P_17 && arg6P_8>1 && arg6P_8<arg2P_17 && meter_2>=1 ], cost: 2+3*meter_2

Eliminated locations (on tree-shaped paths):
   Start location: __init
     51: __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
     52: __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 && arg6P_8>1 ], cost: 3+arg4P_5
     53: __init -> [11] : arg1'=-2+arg1P_1, arg2'=arg2P_17, arg3'=2, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ -2+arg1P_1>0 && 2<arg2P_17 && arg4P_5>0 ], cost: 5+arg4P_5
     54: __init -> [11] : arg1'=-2+arg1P_1, arg2'=arg2P_17, arg3'=2, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ -2+arg1P_1>0 && 2<arg2P_17 && arg4P_5>0 && arg6P_8>1 ], cost: 5+arg4P_5
     55: __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
     56: __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
     57: __init -> [14] : [ 2*meter_2>0 && 1<arg2P_17 && arg6P_8>1 && arg6P_8<arg2P_17 && meter_2>=1 ], cost: 2+3*meter_2
     58: __init -> f1079_0_mirror_NULL : arg1'=2, arg2'=arg3P_2, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [ arg2P_17>0 && arg1P_2<=arg1P_17 && arg1P_17>0 && arg1P_2>0 && arg2P_2>-1 && arg3P_2>1 && 2+2*meter<=arg2P_2 && 2+2*meter>2 && meter>=1 ], cost: 3+meter
     59: __init -> f1079_0_mirror_NULL : arg1'=3, arg2'=arg3P_2, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ arg2P_17>0 && arg1P_2<=arg1P_17 && arg1P_17>0 && arg1P_2>0 && arg2P_2>-1 && arg3P_2>1 && 3+4*meter_1<=arg2P_2 && 3+4*meter_1>3 && meter_1>=1 ], cost: 3+meter_1
     60: __init -> f1079_0_mirror_NULL : arg1'=2, arg2'=arg3P_2, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [ arg2P_17>0 && arg1P_2<=arg1P_17 && arg1P_17>0 && arg1P_2>0 && arg3P_2>1 && 2+2*meter>2 && meter>=1 && 3<=arg2P_2 && 5+2*meter<=arg2P_2 ], cost: 5+meter
     61: __init -> f1079_0_mirror_NULL : arg1'=3, arg2'=arg3P_2, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ arg2P_17>0 && arg1P_2<=arg1P_17 && arg1P_17>0 && arg1P_2>0 && arg3P_2>1 && 3+4*meter_1>3 && meter_1>=1 && 3<=arg2P_2 && 6+4*meter_1<=arg2P_2 ], cost: 5+meter_1
     62: __init -> f1079_0_mirror_NULL : arg1'=2, arg2'=arg3P_2, arg3'=arg3P_13, arg4'=arg4P_13, arg5'=arg5P_13, arg6'=arg6P_13, [ arg2P_17>0 && arg1P_2<=arg1P_17 && arg1P_17>0 && arg1P_2>0 && arg2P_2>-1 && arg3P_2>1 && 2+3*meter_4<=arg2P_2 && 2+3*meter_4>2 && meter_4>=1 ], cost: 3+2*meter_4

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     51: __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
     52: __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 && arg6P_8>1 ], cost: 3+arg4P_5
     53: __init -> [11] : arg1'=-2+arg1P_1, arg2'=arg2P_17, arg3'=2, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ -2+arg1P_1>0 && 2<arg2P_17 && arg4P_5>0 ], cost: 5+arg4P_5
     54: __init -> [11] : arg1'=-2+arg1P_1, arg2'=arg2P_17, arg3'=2, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ -2+arg1P_1>0 && 2<arg2P_17 && arg4P_5>0 && arg6P_8>1 ], cost: 5+arg4P_5
     56: __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
     57: __init -> [14] : [ 2*meter_2>0 && 1<arg2P_17 && arg6P_8>1 && arg6P_8<arg2P_17 && meter_2>=1 ], cost: 2+3*meter_2
     58: __init -> f1079_0_mirror_NULL : arg1'=2, arg2'=arg3P_2, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [ arg2P_17>0 && arg1P_2<=arg1P_17 && arg1P_17>0 && arg1P_2>0 && arg2P_2>-1 && arg3P_2>1 && 2+2*meter<=arg2P_2 && 2+2*meter>2 && meter>=1 ], cost: 3+meter
     59: __init -> f1079_0_mirror_NULL : arg1'=3, arg2'=arg3P_2, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ arg2P_17>0 && arg1P_2<=arg1P_17 && arg1P_17>0 && arg1P_2>0 && arg2P_2>-1 && arg3P_2>1 && 3+4*meter_1<=arg2P_2 && 3+4*meter_1>3 && meter_1>=1 ], cost: 3+meter_1
     60: __init -> f1079_0_mirror_NULL : arg1'=2, arg2'=arg3P_2, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [ arg2P_17>0 && arg1P_2<=arg1P_17 && arg1P_17>0 && arg1P_2>0 && arg3P_2>1 && 2+2*meter>2 && meter>=1 && 3<=arg2P_2 && 5+2*meter<=arg2P_2 ], cost: 5+meter
     61: __init -> f1079_0_mirror_NULL : arg1'=3, arg2'=arg3P_2, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ arg2P_17>0 && arg1P_2<=arg1P_17 && arg1P_17>0 && arg1P_2>0 && arg3P_2>1 && 3+4*meter_1>3 && meter_1>=1 && 3<=arg2P_2 && 6+4*meter_1<=arg2P_2 ], cost: 5+meter_1
     62: __init -> f1079_0_mirror_NULL : arg1'=2, arg2'=arg3P_2, arg3'=arg3P_13, arg4'=arg4P_13, arg5'=arg5P_13, arg6'=arg6P_13, [ arg2P_17>0 && arg1P_2<=arg1P_17 && arg1P_17>0 && arg1P_2>0 && arg2P_2>-1 && arg3P_2>1 && 2+3*meter_4<=arg2P_2 && 2+3*meter_4>2 && meter_4>=1 ], cost: 3+2*meter_4

Computing asymptotic complexity for rule 51
   Solved the limit problem by the following transformations:
      Created initial limit problem:
      arg1P_17 (+/+!), arg1P_1 (+/+!), -1+arg2P_17 (+/+!), 3+arg4P_5 (+), arg4P_5 (+/+!) [not solved]

      removing all constraints (solved by SMT)
      resulting limit problem: [solved]

      applying transformation rule (C) using substitution {arg2P_17==n,arg1P_17==n,arg1P_1==n,arg4P_5==n}
      resulting limit problem:
      [solved]

   Solution:
      arg2P_17 / n
      arg1P_17 / n
      arg1P_1 / n
      arg4P_5 / n
   Resulting cost 3+n has complexity: Unbounded

Found new complexity Unbounded.

Obtained the following overall complexity (w.r.t. the length of the input n):
   Complexity:  Unbounded
   Cpx degree:  Unbounded
   Solved cost: 3+n
   Rule cost:   3+arg4P_5
   Rule guard:  [ arg1P_17>0 && arg1P_1>0 && 1<arg2P_17 && arg4P_5>0 ]

WORST_CASE(INF,?)