WORST_CASE(INF,?)

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

Initial linear ITS problem
   Start location: __init
      0: f1_0_main_Load -> f811_0_main_LE : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, arg5'=arg5P_1, arg6'=arg6P_1, [ arg2>-1 && arg3P_1>-1 && arg1P_1<=arg1 && 1+arg2P_1<=arg1 && arg1>0 && arg1P_1>0 && arg2P_1>-1 && 1==arg4P_1 ], cost: 1
      1: f811_0_main_LE -> f811_0_main_LE : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, arg5'=arg5P_2, arg6'=arg6P_2, [ arg3>0 && x5_1>0 && arg1>=arg1P_2 && arg2>=-1+arg1P_2 && arg2>=-2+arg2P_2 && arg1>0 && arg2>-1 && arg1P_2>0 && arg2P_2>1 && -1+arg3==arg3P_2 ], cost: 1
      2: f811_0_main_LE -> f1404_0_flatten_NULL : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, arg5'=arg5P_3, arg6'=arg6P_3, [ arg1P_3<=arg2 && arg1>0 && arg2>-1 && arg1P_3>-1 && 0==arg3 ], cost: 1
      5: f811_0_main_LE -> f811_0_main_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg3>0 && x22_1>0 && arg1P_6<=arg1 && -1+arg1P_6<=arg2 && arg1>0 && arg2>-1 && arg1P_6>0 && arg2P_6>4 && -1+arg3==arg3P_6 ], cost: 1
      7: f811_0_main_LE -> f2226_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, arg5'=arg5P_8, arg6'=arg6P_8, [ arg3P_8>0 && x39_1>0 && arg3>0 && arg4>-1 && -2+arg1P_8<=arg1 && -3+arg1P_8<=arg2 && -2+arg2P_8<=arg1 && -3+arg2P_8<=arg2 && arg1>0 && arg2>-1 && arg1P_8>2 && arg2P_8>2 && 1+arg4==arg4P_8 ], cost: 1
      3: f1404_0_flatten_NULL -> f1404_0_flatten_NULL : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, arg5'=arg5P_4, arg6'=arg6P_4, [ 2+arg1P_4<=arg1 && arg1>1 && arg1P_4>-1 ], cost: 1
      4: f1404_0_flatten_NULL -> f1404_0_flatten_NULL : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, arg5'=arg5P_5, arg6'=arg6P_5, [ -2+arg1P_5<=arg1 && arg1>2 && arg1P_5>2 ], cost: 1
      6: f1282_0_createTree_Return -> f811_0_main_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ arg1P_7<=arg1 && 2+arg1P_7<=arg4 && arg1>0 && arg4>2 && arg1P_7>0 && arg2P_7>4 && 2+arg6<=arg4 && -1+arg3==arg3P_7 && arg5==arg4P_7 ], cost: 1
      8: f2226_0_createTree_LE -> f2226_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [ arg4>-1 && arg3>0 && arg1P_9<=arg1 && 2+arg2P_9<=arg2 && arg1>2 && arg2>2 && arg1P_9>2 && arg2P_9>0 && -1+arg3==arg3P_9 && 1+arg4==arg4P_9 ], cost: 1
      9: f2226_0_createTree_LE -> f2226_0_createTree_LE : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ arg3>0 && x59_1>0 && arg4>-1 && arg1P_10<=arg1 && 2+arg2P_10<=arg2 && arg1>2 && arg2>2 && arg1P_10>2 && arg2P_10>0 && -1+arg3==arg3P_10 && 1+arg4==arg4P_10 ], cost: 1
     10: f2226_0_createTree_LE -> f2226_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, arg5'=arg5P_11, arg6'=arg6P_11, [ arg3>0 && x66_1>0 && arg4>-1 && arg1>2 && arg2>1 && arg1P_11>2 && arg2P_11>2 && -1+arg3==arg3P_11 && 1+arg4==arg4P_11 ], cost: 1
     11: f2226_0_createTree_LE -> f2226_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg3P_12, arg4'=arg4P_12, arg5'=arg5P_12, arg6'=arg6P_12, [ arg4>-1 && arg3>0 && arg1>2 && arg2>1 && arg1P_12>2 && arg2P_12>2 && -1+arg3==arg3P_12 && 1+arg4==arg4P_12 ], cost: 1
     12: f2226_0_createTree_LE -> f2226_0_createTree_LE : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, arg5'=arg5P_13, arg6'=arg6P_13, [ arg4>-1 && arg3>0 && -2+arg1P_13<=arg1 && -2+arg1P_13<=arg2 && -2+arg2P_13<=arg1 && -2+arg2P_13<=arg2 && arg1>2 && arg2>2 && arg1P_13>4 && arg2P_13>4 && -1+arg3==arg3P_13 && 1+arg4==arg4P_13 ], cost: 1
     13: f2226_0_createTree_LE -> f2226_0_createTree_LE : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=arg3P_14, arg4'=arg4P_14, arg5'=arg5P_14, arg6'=arg6P_14, [ arg3>0 && x85_1>0 && arg4>-1 && -2+arg1P_14<=arg1 && -2+arg1P_14<=arg2 && -2+arg2P_14<=arg1 && -2+arg2P_14<=arg2 && arg1>2 && arg2>2 && arg1P_14>4 && arg2P_14>4 && -1+arg3==arg3P_14 && 1+arg4==arg4P_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 -> f811_0_main_LE : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, arg5'=arg5P_1, arg6'=arg6P_1, [ arg2>-1 && arg3P_1>-1 && arg1P_1<=arg1 && 1+arg2P_1<=arg1 && arg1>0 && arg1P_1>0 && arg2P_1>-1 && 1==arg4P_1 ], cost: 1
      1: f811_0_main_LE -> f811_0_main_LE : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, arg5'=arg5P_2, arg6'=arg6P_2, [ arg3>0 && x5_1>0 && arg1>=arg1P_2 && arg2>=-1+arg1P_2 && arg2>=-2+arg2P_2 && arg1>0 && arg2>-1 && arg1P_2>0 && arg2P_2>1 && -1+arg3==arg3P_2 ], cost: 1
      2: f811_0_main_LE -> f1404_0_flatten_NULL : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, arg5'=arg5P_3, arg6'=arg6P_3, [ arg1P_3<=arg2 && arg1>0 && arg2>-1 && arg1P_3>-1 && 0==arg3 ], cost: 1
      5: f811_0_main_LE -> f811_0_main_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg3>0 && x22_1>0 && arg1P_6<=arg1 && -1+arg1P_6<=arg2 && arg1>0 && arg2>-1 && arg1P_6>0 && arg2P_6>4 && -1+arg3==arg3P_6 ], cost: 1
      7: f811_0_main_LE -> f2226_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, arg5'=arg5P_8, arg6'=arg6P_8, [ arg3P_8>0 && x39_1>0 && arg3>0 && arg4>-1 && -2+arg1P_8<=arg1 && -3+arg1P_8<=arg2 && -2+arg2P_8<=arg1 && -3+arg2P_8<=arg2 && arg1>0 && arg2>-1 && arg1P_8>2 && arg2P_8>2 && 1+arg4==arg4P_8 ], cost: 1
      3: f1404_0_flatten_NULL -> f1404_0_flatten_NULL : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, arg5'=arg5P_4, arg6'=arg6P_4, [ 2+arg1P_4<=arg1 && arg1>1 && arg1P_4>-1 ], cost: 1
      4: f1404_0_flatten_NULL -> f1404_0_flatten_NULL : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, arg5'=arg5P_5, arg6'=arg6P_5, [ -2+arg1P_5<=arg1 && arg1>2 && arg1P_5>2 ], cost: 1
      8: f2226_0_createTree_LE -> f2226_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [ arg4>-1 && arg3>0 && arg1P_9<=arg1 && 2+arg2P_9<=arg2 && arg1>2 && arg2>2 && arg1P_9>2 && arg2P_9>0 && -1+arg3==arg3P_9 && 1+arg4==arg4P_9 ], cost: 1
      9: f2226_0_createTree_LE -> f2226_0_createTree_LE : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ arg3>0 && x59_1>0 && arg4>-1 && arg1P_10<=arg1 && 2+arg2P_10<=arg2 && arg1>2 && arg2>2 && arg1P_10>2 && arg2P_10>0 && -1+arg3==arg3P_10 && 1+arg4==arg4P_10 ], cost: 1
     10: f2226_0_createTree_LE -> f2226_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, arg5'=arg5P_11, arg6'=arg6P_11, [ arg3>0 && x66_1>0 && arg4>-1 && arg1>2 && arg2>1 && arg1P_11>2 && arg2P_11>2 && -1+arg3==arg3P_11 && 1+arg4==arg4P_11 ], cost: 1
     11: f2226_0_createTree_LE -> f2226_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg3P_12, arg4'=arg4P_12, arg5'=arg5P_12, arg6'=arg6P_12, [ arg4>-1 && arg3>0 && arg1>2 && arg2>1 && arg1P_12>2 && arg2P_12>2 && -1+arg3==arg3P_12 && 1+arg4==arg4P_12 ], cost: 1
     12: f2226_0_createTree_LE -> f2226_0_createTree_LE : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, arg5'=arg5P_13, arg6'=arg6P_13, [ arg4>-1 && arg3>0 && -2+arg1P_13<=arg1 && -2+arg1P_13<=arg2 && -2+arg2P_13<=arg1 && -2+arg2P_13<=arg2 && arg1>2 && arg2>2 && arg1P_13>4 && arg2P_13>4 && -1+arg3==arg3P_13 && 1+arg4==arg4P_13 ], cost: 1
     13: f2226_0_createTree_LE -> f2226_0_createTree_LE : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=arg3P_14, arg4'=arg4P_14, arg5'=arg5P_14, arg6'=arg6P_14, [ arg3>0 && x85_1>0 && arg4>-1 && -2+arg1P_14<=arg1 && -2+arg1P_14<=arg2 && -2+arg2P_14<=arg1 && -2+arg2P_14<=arg2 && arg1>2 && arg2>2 && arg1P_14>4 && arg2P_14>4 && -1+arg3==arg3P_14 && 1+arg4==arg4P_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 -> f811_0_main_LE : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=1, arg5'=arg5P_1, arg6'=arg6P_1, [ arg2>-1 && arg3P_1>-1 && arg1P_1<=arg1 && 1+arg2P_1<=arg1 && arg1>0 && arg1P_1>0 && arg2P_1>-1 ], cost: 1
      1: f811_0_main_LE -> f811_0_main_LE : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=-1+arg3, arg4'=arg4P_2, arg5'=arg5P_2, arg6'=arg6P_2, [ arg3>0 && arg1>=arg1P_2 && arg2>=-1+arg1P_2 && arg2>=-2+arg2P_2 && arg1>0 && arg2>-1 && arg1P_2>0 && arg2P_2>1 ], cost: 1
      2: f811_0_main_LE -> f1404_0_flatten_NULL : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, arg5'=arg5P_3, arg6'=arg6P_3, [ arg1P_3<=arg2 && arg1>0 && arg2>-1 && arg1P_3>-1 && 0==arg3 ], cost: 1
      5: f811_0_main_LE -> f811_0_main_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=-1+arg3, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg3>0 && arg1P_6<=arg1 && -1+arg1P_6<=arg2 && arg1>0 && arg2>-1 && arg1P_6>0 && arg2P_6>4 ], cost: 1
      7: f811_0_main_LE -> f2226_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=1+arg4, arg5'=arg5P_8, arg6'=arg6P_8, [ arg3P_8>0 && arg3>0 && arg4>-1 && -2+arg1P_8<=arg1 && -3+arg1P_8<=arg2 && -2+arg2P_8<=arg1 && -3+arg2P_8<=arg2 && arg1>0 && arg2>-1 && arg1P_8>2 && arg2P_8>2 ], cost: 1
      3: f1404_0_flatten_NULL -> f1404_0_flatten_NULL : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, arg5'=arg5P_4, arg6'=arg6P_4, [ 2+arg1P_4<=arg1 && arg1>1 && arg1P_4>-1 ], cost: 1
      4: f1404_0_flatten_NULL -> f1404_0_flatten_NULL : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, arg5'=arg5P_5, arg6'=arg6P_5, [ -2+arg1P_5<=arg1 && arg1>2 && arg1P_5>2 ], cost: 1
      8: f2226_0_createTree_LE -> f2226_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=-1+arg3, arg4'=1+arg4, arg5'=arg5P_9, arg6'=arg6P_9, [ arg4>-1 && arg3>0 && arg1P_9<=arg1 && 2+arg2P_9<=arg2 && arg1>2 && arg2>2 && arg1P_9>2 && arg2P_9>0 ], cost: 1
      9: f2226_0_createTree_LE -> f2226_0_createTree_LE : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=-1+arg3, arg4'=1+arg4, arg5'=arg5P_10, arg6'=arg6P_10, [ arg3>0 && arg4>-1 && arg1P_10<=arg1 && 2+arg2P_10<=arg2 && arg1>2 && arg2>2 && arg1P_10>2 && arg2P_10>0 ], cost: 1
     10: f2226_0_createTree_LE -> f2226_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=-1+arg3, arg4'=1+arg4, arg5'=arg5P_11, arg6'=arg6P_11, [ arg3>0 && arg4>-1 && arg1>2 && arg2>1 && arg1P_11>2 && arg2P_11>2 ], cost: 1
     11: f2226_0_createTree_LE -> f2226_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=-1+arg3, arg4'=1+arg4, arg5'=arg5P_12, arg6'=arg6P_12, [ arg4>-1 && arg3>0 && arg1>2 && arg2>1 && arg1P_12>2 && arg2P_12>2 ], cost: 1
     12: f2226_0_createTree_LE -> f2226_0_createTree_LE : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=-1+arg3, arg4'=1+arg4, arg5'=arg5P_13, arg6'=arg6P_13, [ arg4>-1 && arg3>0 && -2+arg1P_13<=arg1 && -2+arg1P_13<=arg2 && -2+arg2P_13<=arg1 && -2+arg2P_13<=arg2 && arg1>2 && arg2>2 && arg1P_13>4 && arg2P_13>4 ], cost: 1
     13: f2226_0_createTree_LE -> f2226_0_createTree_LE : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=-1+arg3, arg4'=1+arg4, arg5'=arg5P_14, arg6'=arg6P_14, [ arg3>0 && arg4>-1 && -2+arg1P_14<=arg1 && -2+arg1P_14<=arg2 && -2+arg2P_14<=arg1 && -2+arg2P_14<=arg2 && arg1>2 && arg2>2 && arg1P_14>4 && arg2P_14>4 ], 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 1.
   Accelerating the following rules:
      1: f811_0_main_LE -> f811_0_main_LE : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=-1+arg3, arg4'=arg4P_2, arg5'=arg5P_2, arg6'=arg6P_2, [ arg3>0 && arg1>=arg1P_2 && arg2>=-1+arg1P_2 && arg2>=-2+arg2P_2 && arg1>0 && arg2>-1 && arg1P_2>0 && arg2P_2>1 ], cost: 1
      5: f811_0_main_LE -> f811_0_main_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=-1+arg3, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg3>0 && arg1P_6<=arg1 && -1+arg1P_6<=arg2 && arg1>0 && arg2>-1 && arg1P_6>0 && arg2P_6>4 ], cost: 1

      During metering: Instantiating temporary variables by {arg1P_2==1,arg2P_2==2+arg2}
   Accelerated rule 1 with metering function arg3, yielding the new rule 15.
      During metering: Instantiating temporary variables by {arg1P_6==1,arg2P_6==5}
   Accelerated rule 5 with metering function arg3, yielding the new rule 16.
   Removing the simple loops: 1 5.

Accelerating simple loops of location 2.
   Accelerating the following rules:
      3: f1404_0_flatten_NULL -> f1404_0_flatten_NULL : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, arg5'=arg5P_4, arg6'=arg6P_4, [ 2+arg1P_4<=arg1 && arg1>1 && arg1P_4>-1 ], cost: 1
      4: f1404_0_flatten_NULL -> f1404_0_flatten_NULL : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, arg5'=arg5P_5, arg6'=arg6P_5, [ -2+arg1P_5<=arg1 && arg1>2 && arg1P_5>2 ], cost: 1

      During metering: Instantiating temporary variables by {arg1P_4==-2+arg1}
   Accelerated rule 3 with metering function meter (where 2*meter==-1+arg1), yielding the new rule 17.
   Accelerated rule 4 with NONTERM, yielding the new rule 18.
   Removing the simple loops: 3 4.

Accelerating simple loops of location 4.
   Accelerating the following rules:
      8: f2226_0_createTree_LE -> f2226_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=-1+arg3, arg4'=1+arg4, arg5'=arg5P_9, arg6'=arg6P_9, [ arg4>-1 && arg3>0 && arg1P_9<=arg1 && 2+arg2P_9<=arg2 && arg1>2 && arg2>2 && arg1P_9>2 && arg2P_9>0 ], cost: 1
      9: f2226_0_createTree_LE -> f2226_0_createTree_LE : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=-1+arg3, arg4'=1+arg4, arg5'=arg5P_10, arg6'=arg6P_10, [ arg3>0 && arg4>-1 && arg1P_10<=arg1 && 2+arg2P_10<=arg2 && arg1>2 && arg2>2 && arg1P_10>2 && arg2P_10>0 ], cost: 1
     10: f2226_0_createTree_LE -> f2226_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=-1+arg3, arg4'=1+arg4, arg5'=arg5P_11, arg6'=arg6P_11, [ arg3>0 && arg4>-1 && arg1>2 && arg2>1 && arg1P_11>2 && arg2P_11>2 ], cost: 1
     11: f2226_0_createTree_LE -> f2226_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=-1+arg3, arg4'=1+arg4, arg5'=arg5P_12, arg6'=arg6P_12, [ arg4>-1 && arg3>0 && arg1>2 && arg2>1 && arg1P_12>2 && arg2P_12>2 ], cost: 1
     12: f2226_0_createTree_LE -> f2226_0_createTree_LE : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=-1+arg3, arg4'=1+arg4, arg5'=arg5P_13, arg6'=arg6P_13, [ arg4>-1 && arg3>0 && -2+arg1P_13<=arg1 && -2+arg1P_13<=arg2 && -2+arg2P_13<=arg1 && -2+arg2P_13<=arg2 && arg1>2 && arg2>2 && arg1P_13>4 && arg2P_13>4 ], cost: 1
     13: f2226_0_createTree_LE -> f2226_0_createTree_LE : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=-1+arg3, arg4'=1+arg4, arg5'=arg5P_14, arg6'=arg6P_14, [ arg3>0 && arg4>-1 && -2+arg1P_14<=arg1 && -2+arg1P_14<=arg2 && -2+arg2P_14<=arg1 && -2+arg2P_14<=arg2 && arg1>2 && arg2>2 && arg1P_14>4 && arg2P_14>4 ], cost: 1

   Found no metering function for rule 8.
   Found no metering function for rule 9.
   Accelerated rule 10 with metering function arg3, yielding the new rule 19.
   Accelerated rule 11 with metering function arg3, yielding the new rule 20.
      During metering: Instantiating temporary variables by {arg2P_13==5,arg1P_13==2+arg2}
   Accelerated rule 12 with metering function arg3, yielding the new rule 21.
      During metering: Instantiating temporary variables by {arg1P_14==2+arg2,arg2P_14==5}
   Accelerated rule 13 with metering function arg3, yielding the new rule 22.
   Removing the simple loops: 10 11 12 13.

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
      0: f1_0_main_Load -> f811_0_main_LE : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=1, arg5'=arg5P_1, arg6'=arg6P_1, [ arg2>-1 && arg3P_1>-1 && arg1P_1<=arg1 && 1+arg2P_1<=arg1 && arg1>0 && arg1P_1>0 && arg2P_1>-1 ], cost: 1
      2: f811_0_main_LE -> f1404_0_flatten_NULL : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, arg5'=arg5P_3, arg6'=arg6P_3, [ arg1P_3<=arg2 && arg1>0 && arg2>-1 && arg1P_3>-1 && 0==arg3 ], cost: 1
      7: f811_0_main_LE -> f2226_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=1+arg4, arg5'=arg5P_8, arg6'=arg6P_8, [ arg3P_8>0 && arg3>0 && arg4>-1 && -2+arg1P_8<=arg1 && -3+arg1P_8<=arg2 && -2+arg2P_8<=arg1 && -3+arg2P_8<=arg2 && arg1>0 && arg2>-1 && arg1P_8>2 && arg2P_8>2 ], cost: 1
     15: f811_0_main_LE -> f811_0_main_LE : arg1'=1, arg2'=2*arg3+arg2, arg3'=0, arg4'=arg4P_2, arg5'=arg5P_2, arg6'=arg6P_2, [ arg3>0 && arg1>=1 && arg2>=0 ], cost: arg3
     16: f811_0_main_LE -> f811_0_main_LE : arg1'=1, arg2'=5, arg3'=0, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg3>0 && 1<=arg1 && 0<=arg2 ], cost: arg3
     17: f1404_0_flatten_NULL -> f1404_0_flatten_NULL : arg1'=-2*meter+arg1, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, arg5'=arg5P_4, arg6'=arg6P_4, [ arg1>1 && 2*meter==-1+arg1 && meter>=1 ], cost: meter
     18: f1404_0_flatten_NULL -> [7] : [ -2+arg1P_5<=arg1 && arg1>2 && arg1P_5>2 ], cost: NONTERM
      8: f2226_0_createTree_LE -> f2226_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=-1+arg3, arg4'=1+arg4, arg5'=arg5P_9, arg6'=arg6P_9, [ arg4>-1 && arg3>0 && arg1P_9<=arg1 && 2+arg2P_9<=arg2 && arg1>2 && arg2>2 && arg1P_9>2 && arg2P_9>0 ], cost: 1
      9: f2226_0_createTree_LE -> f2226_0_createTree_LE : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=-1+arg3, arg4'=1+arg4, arg5'=arg5P_10, arg6'=arg6P_10, [ arg3>0 && arg4>-1 && arg1P_10<=arg1 && 2+arg2P_10<=arg2 && arg1>2 && arg2>2 && arg1P_10>2 && arg2P_10>0 ], cost: 1
     19: f2226_0_createTree_LE -> f2226_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=0, arg4'=arg3+arg4, arg5'=arg5P_11, arg6'=arg6P_11, [ arg3>0 && arg4>-1 && arg1>2 && arg2>1 && arg1P_11>2 && arg2P_11>2 ], cost: arg3
     20: f2226_0_createTree_LE -> f2226_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=0, arg4'=arg3+arg4, arg5'=arg5P_12, arg6'=arg6P_12, [ arg4>-1 && arg3>0 && arg1>2 && arg2>1 && arg1P_12>2 && arg2P_12>2 ], cost: arg3
     21: f2226_0_createTree_LE -> f2226_0_createTree_LE : arg1'=7, arg2'=5, arg3'=0, arg4'=arg3+arg4, arg5'=arg5P_13, arg6'=arg6P_13, [ arg4>-1 && arg3>0 && arg2<=arg1 && 3<=arg1 && 3<=arg2 ], cost: arg3
     22: f2226_0_createTree_LE -> f2226_0_createTree_LE : arg1'=7, arg2'=5, arg3'=0, arg4'=arg3+arg4, arg5'=arg5P_14, arg6'=arg6P_14, [ arg3>0 && arg4>-1 && arg2<=arg1 && 3<=arg1 && 3<=arg2 ], cost: arg3
     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 -> f811_0_main_LE : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=1, arg5'=arg5P_1, arg6'=arg6P_1, [ arg2>-1 && arg3P_1>-1 && arg1P_1<=arg1 && 1+arg2P_1<=arg1 && arg1>0 && arg1P_1>0 && arg2P_1>-1 ], cost: 1
     23: f1_0_main_Load -> f811_0_main_LE : arg1'=1, arg2'=arg2P_1+2*arg3P_1, arg3'=0, arg4'=arg4P_2, arg5'=arg5P_2, arg6'=arg6P_2, [ arg2>-1 && 1+arg2P_1<=arg1 && arg1>0 && arg2P_1>-1 && arg3P_1>0 ], cost: 1+arg3P_1
     24: f1_0_main_Load -> f811_0_main_LE : arg1'=1, arg2'=5, arg3'=0, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg2>-1 && arg1>0 && arg3P_1>0 ], cost: 1+arg3P_1
      2: f811_0_main_LE -> f1404_0_flatten_NULL : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, arg5'=arg5P_3, arg6'=arg6P_3, [ arg1P_3<=arg2 && arg1>0 && arg2>-1 && arg1P_3>-1 && 0==arg3 ], cost: 1
      7: f811_0_main_LE -> f2226_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=1+arg4, arg5'=arg5P_8, arg6'=arg6P_8, [ arg3P_8>0 && arg3>0 && arg4>-1 && -2+arg1P_8<=arg1 && -3+arg1P_8<=arg2 && -2+arg2P_8<=arg1 && -3+arg2P_8<=arg2 && arg1>0 && arg2>-1 && arg1P_8>2 && arg2P_8>2 ], cost: 1
     25: f811_0_main_LE -> f1404_0_flatten_NULL : arg1'=1, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, arg5'=arg5P_4, arg6'=arg6P_4, [ 1+2*meter<=arg2 && arg1>0 && arg2>-1 && 0==arg3 && 1+2*meter>1 && meter>=1 ], cost: 1+meter
     26: f811_0_main_LE -> [7] : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, arg5'=arg5P_3, arg6'=arg6P_3, [ arg1P_3<=arg2 && arg1>0 && arg2>-1 && 0==arg3 && arg1P_3>2 ], cost: NONTERM
     27: f811_0_main_LE -> f2226_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=-1+arg3P_8, arg4'=2+arg4, arg5'=arg5P_9, arg6'=arg6P_9, [ arg3P_8>0 && arg3>0 && arg4>-1 && arg1>0 && arg2>-1 && arg1P_9>2 && arg2P_9>0 && arg1P_9<=2+arg1 && arg1P_9<=3+arg2 && 2+arg2P_9<=2+arg1 && 2+arg2P_9<=3+arg2 ], cost: 2
     28: f811_0_main_LE -> f2226_0_createTree_LE : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=-1+arg3P_8, arg4'=2+arg4, arg5'=arg5P_10, arg6'=arg6P_10, [ arg3P_8>0 && arg3>0 && arg4>-1 && arg1>0 && arg2>-1 && arg1P_10>2 && arg2P_10>0 && arg1P_10<=2+arg1 && arg1P_10<=3+arg2 && 2+arg2P_10<=2+arg1 && 2+arg2P_10<=3+arg2 ], cost: 2
     29: f811_0_main_LE -> f2226_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=0, arg4'=1+arg4+arg3P_8, arg5'=arg5P_11, arg6'=arg6P_11, [ arg3P_8>0 && arg3>0 && arg4>-1 && arg1>0 && arg2>-1 && arg1P_11>2 && arg2P_11>2 ], cost: 1+arg3P_8
     30: f811_0_main_LE -> f2226_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=0, arg4'=1+arg4+arg3P_8, arg5'=arg5P_12, arg6'=arg6P_12, [ arg3P_8>0 && arg3>0 && arg4>-1 && arg1>0 && arg2>-1 && arg1P_12>2 && arg2P_12>2 ], cost: 1+arg3P_8
     31: f811_0_main_LE -> f2226_0_createTree_LE : arg1'=7, arg2'=5, arg3'=0, arg4'=1+arg4+arg3P_8, arg5'=arg5P_13, arg6'=arg6P_13, [ arg3P_8>0 && arg3>0 && arg4>-1 && arg1>0 && arg2>-1 ], cost: 1+arg3P_8
     32: f811_0_main_LE -> f2226_0_createTree_LE : arg1'=7, arg2'=5, arg3'=0, arg4'=1+arg4+arg3P_8, arg5'=arg5P_14, arg6'=arg6P_14, [ arg3P_8>0 && arg3>0 && arg4>-1 && arg1>0 && arg2>-1 ], cost: 1+arg3P_8
     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 locations (and leaf rules with constant cost):
   Start location: __init
      0: f1_0_main_Load -> f811_0_main_LE : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=1, arg5'=arg5P_1, arg6'=arg6P_1, [ arg2>-1 && arg3P_1>-1 && arg1P_1<=arg1 && 1+arg2P_1<=arg1 && arg1>0 && arg1P_1>0 && arg2P_1>-1 ], cost: 1
     23: f1_0_main_Load -> f811_0_main_LE : arg1'=1, arg2'=arg2P_1+2*arg3P_1, arg3'=0, arg4'=arg4P_2, arg5'=arg5P_2, arg6'=arg6P_2, [ arg2>-1 && 1+arg2P_1<=arg1 && arg1>0 && arg2P_1>-1 && arg3P_1>0 ], cost: 1+arg3P_1
     24: f1_0_main_Load -> f811_0_main_LE : arg1'=1, arg2'=5, arg3'=0, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg2>-1 && arg1>0 && arg3P_1>0 ], cost: 1+arg3P_1
     25: f811_0_main_LE -> f1404_0_flatten_NULL : arg1'=1, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, arg5'=arg5P_4, arg6'=arg6P_4, [ 1+2*meter<=arg2 && arg1>0 && arg2>-1 && 0==arg3 && 1+2*meter>1 && meter>=1 ], cost: 1+meter
     26: f811_0_main_LE -> [7] : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, arg5'=arg5P_3, arg6'=arg6P_3, [ arg1P_3<=arg2 && arg1>0 && arg2>-1 && 0==arg3 && arg1P_3>2 ], cost: NONTERM
     29: f811_0_main_LE -> f2226_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=0, arg4'=1+arg4+arg3P_8, arg5'=arg5P_11, arg6'=arg6P_11, [ arg3P_8>0 && arg3>0 && arg4>-1 && arg1>0 && arg2>-1 && arg1P_11>2 && arg2P_11>2 ], cost: 1+arg3P_8
     30: f811_0_main_LE -> f2226_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=0, arg4'=1+arg4+arg3P_8, arg5'=arg5P_12, arg6'=arg6P_12, [ arg3P_8>0 && arg3>0 && arg4>-1 && arg1>0 && arg2>-1 && arg1P_12>2 && arg2P_12>2 ], cost: 1+arg3P_8
     31: f811_0_main_LE -> f2226_0_createTree_LE : arg1'=7, arg2'=5, arg3'=0, arg4'=1+arg4+arg3P_8, arg5'=arg5P_13, arg6'=arg6P_13, [ arg3P_8>0 && arg3>0 && arg4>-1 && arg1>0 && arg2>-1 ], cost: 1+arg3P_8
     32: f811_0_main_LE -> f2226_0_createTree_LE : arg1'=7, arg2'=5, arg3'=0, arg4'=1+arg4+arg3P_8, arg5'=arg5P_14, arg6'=arg6P_14, [ arg3P_8>0 && arg3>0 && arg4>-1 && arg1>0 && arg2>-1 ], cost: 1+arg3P_8
     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
     25: f811_0_main_LE -> f1404_0_flatten_NULL : arg1'=1, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, arg5'=arg5P_4, arg6'=arg6P_4, [ 1+2*meter<=arg2 && arg1>0 && arg2>-1 && 0==arg3 && 1+2*meter>1 && meter>=1 ], cost: 1+meter
     26: f811_0_main_LE -> [7] : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, arg5'=arg5P_3, arg6'=arg6P_3, [ arg1P_3<=arg2 && arg1>0 && arg2>-1 && 0==arg3 && arg1P_3>2 ], cost: NONTERM
     29: f811_0_main_LE -> f2226_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=0, arg4'=1+arg4+arg3P_8, arg5'=arg5P_11, arg6'=arg6P_11, [ arg3P_8>0 && arg3>0 && arg4>-1 && arg1>0 && arg2>-1 && arg1P_11>2 && arg2P_11>2 ], cost: 1+arg3P_8
     30: f811_0_main_LE -> f2226_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=0, arg4'=1+arg4+arg3P_8, arg5'=arg5P_12, arg6'=arg6P_12, [ arg3P_8>0 && arg3>0 && arg4>-1 && arg1>0 && arg2>-1 && arg1P_12>2 && arg2P_12>2 ], cost: 1+arg3P_8
     31: f811_0_main_LE -> f2226_0_createTree_LE : arg1'=7, arg2'=5, arg3'=0, arg4'=1+arg4+arg3P_8, arg5'=arg5P_13, arg6'=arg6P_13, [ arg3P_8>0 && arg3>0 && arg4>-1 && arg1>0 && arg2>-1 ], cost: 1+arg3P_8
     32: f811_0_main_LE -> f2226_0_createTree_LE : arg1'=7, arg2'=5, arg3'=0, arg4'=1+arg4+arg3P_8, arg5'=arg5P_14, arg6'=arg6P_14, [ arg3P_8>0 && arg3>0 && arg4>-1 && arg1>0 && arg2>-1 ], cost: 1+arg3P_8
     33: __init -> f811_0_main_LE : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=1, arg5'=arg5P_1, arg6'=arg6P_1, [ arg2P_15>-1 && arg3P_1>-1 && arg1P_1<=arg1P_15 && 1+arg2P_1<=arg1P_15 && arg1P_15>0 && arg1P_1>0 && arg2P_1>-1 ], cost: 2
     34: __init -> f811_0_main_LE : arg1'=1, arg2'=arg2P_1+2*arg3P_1, arg3'=0, arg4'=arg4P_2, arg5'=arg5P_2, arg6'=arg6P_2, [ arg2P_15>-1 && 1+arg2P_1<=arg1P_15 && arg1P_15>0 && arg2P_1>-1 && arg3P_1>0 ], cost: 2+arg3P_1
     35: __init -> f811_0_main_LE : arg1'=1, arg2'=5, arg3'=0, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg2P_15>-1 && arg1P_15>0 && arg3P_1>0 ], cost: 2+arg3P_1

Eliminated locations (on tree-shaped paths):
   Start location: __init
     36: __init -> f1404_0_flatten_NULL : arg1'=1, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, arg5'=arg5P_4, arg6'=arg6P_4, [ arg2P_15>-1 && arg1P_1<=arg1P_15 && 1+arg2P_1<=arg1P_15 && arg1P_15>0 && arg1P_1>0 && arg2P_1>-1 && 1+2*meter<=arg2P_1 && 0==arg3P_1 && 1+2*meter>1 && meter>=1 ], cost: 3+meter
     37: __init -> [7] : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, arg5'=arg5P_3, arg6'=arg6P_3, [ arg2P_15>-1 && arg1P_1<=arg1P_15 && 1+arg2P_1<=arg1P_15 && arg1P_15>0 && arg1P_1>0 && arg2P_1>-1 && arg1P_3<=arg2P_1 && 0==arg3P_1 && arg1P_3>2 ], cost: NONTERM
     38: __init -> f2226_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=0, arg4'=2+arg3P_8, arg5'=arg5P_11, arg6'=arg6P_11, [ arg2P_15>-1 && arg1P_1<=arg1P_15 && 1+arg2P_1<=arg1P_15 && arg1P_15>0 && arg1P_1>0 && arg2P_1>-1 && arg3P_8>0 && arg3P_1>0 && arg1P_11>2 && arg2P_11>2 ], cost: 3+arg3P_8
     39: __init -> f2226_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=0, arg4'=2+arg3P_8, arg5'=arg5P_12, arg6'=arg6P_12, [ arg2P_15>-1 && arg1P_1<=arg1P_15 && 1+arg2P_1<=arg1P_15 && arg1P_15>0 && arg1P_1>0 && arg2P_1>-1 && arg3P_8>0 && arg3P_1>0 && arg1P_12>2 && arg2P_12>2 ], cost: 3+arg3P_8
     40: __init -> f2226_0_createTree_LE : arg1'=7, arg2'=5, arg3'=0, arg4'=2+arg3P_8, arg5'=arg5P_13, arg6'=arg6P_13, [ arg2P_15>-1 && arg1P_1<=arg1P_15 && 1+arg2P_1<=arg1P_15 && arg1P_15>0 && arg1P_1>0 && arg2P_1>-1 && arg3P_8>0 && arg3P_1>0 ], cost: 3+arg3P_8
     41: __init -> f2226_0_createTree_LE : arg1'=7, arg2'=5, arg3'=0, arg4'=2+arg3P_8, arg5'=arg5P_14, arg6'=arg6P_14, [ arg2P_15>-1 && arg1P_1<=arg1P_15 && 1+arg2P_1<=arg1P_15 && arg1P_15>0 && arg1P_1>0 && arg2P_1>-1 && arg3P_8>0 && arg3P_1>0 ], cost: 3+arg3P_8
     42: __init -> f1404_0_flatten_NULL : arg1'=1, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, arg5'=arg5P_4, arg6'=arg6P_4, [ arg2P_15>-1 && 1+arg2P_1<=arg1P_15 && arg1P_15>0 && arg2P_1>-1 && arg3P_1>0 && 1+2*meter<=arg2P_1+2*arg3P_1 && arg2P_1+2*arg3P_1>-1 && 1+2*meter>1 && meter>=1 ], cost: 3+meter+arg3P_1
     43: __init -> [7] : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, arg5'=arg5P_3, arg6'=arg6P_3, [ arg2P_15>-1 && 1+arg2P_1<=arg1P_15 && arg1P_15>0 && arg2P_1>-1 && arg3P_1>0 && arg1P_3<=arg2P_1+2*arg3P_1 && arg2P_1+2*arg3P_1>-1 && arg1P_3>2 ], cost: NONTERM
     44: __init -> f1404_0_flatten_NULL : arg1'=1, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, arg5'=arg5P_4, arg6'=arg6P_4, [ arg2P_15>-1 && arg1P_15>0 && arg3P_1>0 && 1+2*meter<=5 && 1+2*meter>1 && meter>=1 ], cost: 3+meter+arg3P_1
     45: __init -> [7] : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, arg5'=arg5P_3, arg6'=arg6P_3, [ arg2P_15>-1 && arg1P_15>0 && arg3P_1>0 && arg1P_3<=5 && arg1P_3>2 ], cost: NONTERM
     46: __init -> [9] : [ arg2P_15>-1 && 1+arg2P_1<=arg1P_15 && arg1P_15>0 && arg2P_1>-1 && arg3P_1>0 ], cost: 2+arg3P_1
     47: __init -> [9] : [ arg2P_15>-1 && arg1P_15>0 && arg3P_1>0 ], cost: 2+arg3P_1

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     36: __init -> f1404_0_flatten_NULL : arg1'=1, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, arg5'=arg5P_4, arg6'=arg6P_4, [ arg2P_15>-1 && arg1P_1<=arg1P_15 && 1+arg2P_1<=arg1P_15 && arg1P_15>0 && arg1P_1>0 && arg2P_1>-1 && 1+2*meter<=arg2P_1 && 0==arg3P_1 && 1+2*meter>1 && meter>=1 ], cost: 3+meter
     37: __init -> [7] : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, arg5'=arg5P_3, arg6'=arg6P_3, [ arg2P_15>-1 && arg1P_1<=arg1P_15 && 1+arg2P_1<=arg1P_15 && arg1P_15>0 && arg1P_1>0 && arg2P_1>-1 && arg1P_3<=arg2P_1 && 0==arg3P_1 && arg1P_3>2 ], cost: NONTERM
     38: __init -> f2226_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=0, arg4'=2+arg3P_8, arg5'=arg5P_11, arg6'=arg6P_11, [ arg2P_15>-1 && arg1P_1<=arg1P_15 && 1+arg2P_1<=arg1P_15 && arg1P_15>0 && arg1P_1>0 && arg2P_1>-1 && arg3P_8>0 && arg3P_1>0 && arg1P_11>2 && arg2P_11>2 ], cost: 3+arg3P_8
     39: __init -> f2226_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=0, arg4'=2+arg3P_8, arg5'=arg5P_12, arg6'=arg6P_12, [ arg2P_15>-1 && arg1P_1<=arg1P_15 && 1+arg2P_1<=arg1P_15 && arg1P_15>0 && arg1P_1>0 && arg2P_1>-1 && arg3P_8>0 && arg3P_1>0 && arg1P_12>2 && arg2P_12>2 ], cost: 3+arg3P_8
     41: __init -> f2226_0_createTree_LE : arg1'=7, arg2'=5, arg3'=0, arg4'=2+arg3P_8, arg5'=arg5P_14, arg6'=arg6P_14, [ arg2P_15>-1 && arg1P_1<=arg1P_15 && 1+arg2P_1<=arg1P_15 && arg1P_15>0 && arg1P_1>0 && arg2P_1>-1 && arg3P_8>0 && arg3P_1>0 ], cost: 3+arg3P_8
     42: __init -> f1404_0_flatten_NULL : arg1'=1, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, arg5'=arg5P_4, arg6'=arg6P_4, [ arg2P_15>-1 && 1+arg2P_1<=arg1P_15 && arg1P_15>0 && arg2P_1>-1 && arg3P_1>0 && 1+2*meter<=arg2P_1+2*arg3P_1 && arg2P_1+2*arg3P_1>-1 && 1+2*meter>1 && meter>=1 ], cost: 3+meter+arg3P_1
     43: __init -> [7] : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, arg5'=arg5P_3, arg6'=arg6P_3, [ arg2P_15>-1 && 1+arg2P_1<=arg1P_15 && arg1P_15>0 && arg2P_1>-1 && arg3P_1>0 && arg1P_3<=arg2P_1+2*arg3P_1 && arg2P_1+2*arg3P_1>-1 && arg1P_3>2 ], cost: NONTERM
     44: __init -> f1404_0_flatten_NULL : arg1'=1, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, arg5'=arg5P_4, arg6'=arg6P_4, [ arg2P_15>-1 && arg1P_15>0 && arg3P_1>0 && 1+2*meter<=5 && 1+2*meter>1 && meter>=1 ], cost: 3+meter+arg3P_1
     45: __init -> [7] : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, arg5'=arg5P_3, arg6'=arg6P_3, [ arg2P_15>-1 && arg1P_15>0 && arg3P_1>0 && arg1P_3<=5 && arg1P_3>2 ], cost: NONTERM
     46: __init -> [9] : [ arg2P_15>-1 && 1+arg2P_1<=arg1P_15 && arg1P_15>0 && arg2P_1>-1 && arg3P_1>0 ], cost: 2+arg3P_1
     47: __init -> [9] : [ arg2P_15>-1 && arg1P_15>0 && arg3P_1>0 ], cost: 2+arg3P_1

Computing asymptotic complexity for rule 36
   Simplified the guard:
     36: __init -> f1404_0_flatten_NULL : arg1'=1, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, arg5'=arg5P_4, arg6'=arg6P_4, [ arg2P_15>-1 && arg1P_1<=arg1P_15 && 1+arg2P_1<=arg1P_15 && arg1P_15>0 && arg1P_1>0 && 1+2*meter<=arg2P_1 && 0==arg3P_1 && 1+2*meter>1 ], cost: 3+meter
   Solved the limit problem by the following transformations:
      Created initial limit problem:
      1-arg3P_1 (+/+!), 3+meter (+), arg1P_15 (+/+!), 2*meter (+/+!), arg1P_1 (+/+!), -2*meter+arg2P_1 (+/+!), 1+arg1P_15-arg1P_1 (+/+!), 1+arg3P_1 (+/+!), -arg2P_1+arg1P_15 (+/+!), 1+arg2P_15 (+/+!) [not solved]

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

      applying transformation rule (C) using substitution {meter==-1+n,arg2P_1==2*n,arg1P_15==1+2*n,arg1P_1==1,arg3P_1==0,arg2P_15==0}
      resulting limit problem:
      [solved]

   Solution:
      meter / -1+n
      arg2P_1 / 2*n
      arg1P_15 / 1+2*n
      arg1P_1 / 1
      arg3P_1 / 0
      arg2P_15 / 0
   Resulting cost 2+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: 2+n
   Rule cost:   3+meter
   Rule guard:  [ arg2P_15>-1 && arg1P_1<=arg1P_15 && 1+arg2P_1<=arg1P_15 && arg1P_15>0 && arg1P_1>0 && 1+2*meter<=arg2P_1 && 0==arg3P_1 && 1+2*meter>1 ]

WORST_CASE(INF,?)