NO

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

Initial linear ITS problem
   Start location: __init
      0: f1_0_main_Load -> f962_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: f962_0_main_LE -> f962_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: f962_0_main_LE -> f962_0_main_LE : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, arg5'=arg5P_3, arg6'=arg6P_3, [ arg3>0 && x13_1>0 && arg1P_3<=arg1 && -1+arg1P_3<=arg2 && arg1>0 && arg2>-1 && arg1P_3>0 && arg2P_3>2 && -1+arg3==arg3P_3 ], cost: 1
      4: f962_0_main_LE -> f1548_0_flatten_NULL : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, arg5'=arg5P_5, arg6'=arg6P_5, [ arg1P_5<=arg2 && x30_1>0 && arg2P_5<=arg2 && arg1>0 && arg2>-1 && arg1P_5>-1 && arg2P_5>-1 && 0==arg3 ], cost: 1
      7: f962_0_main_LE -> f2482_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, arg5'=arg5P_8, arg6'=arg6P_8, [ arg3P_8>0 && x46_1>0 && arg3>0 && arg4>-1 && -1+arg1P_8<=arg1 && -2+arg1P_8<=arg2 && -1+arg2P_8<=arg1 && -2+arg2P_8<=arg2 && arg1>0 && arg2>-1 && arg1P_8>1 && arg2P_8>1 ], cost: 1
     14: f962_0_main_LE -> f1223_0_random_ArrayAccess : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_15, arg4'=arg4P_15, arg5'=arg5P_15, arg6'=arg6P_15, [ x104_1>0 && x98_1>0 && arg3>0 && arg4>-1 && arg1P_15<=arg1 && -1+arg1P_15<=arg2 && arg1>0 && arg2>-1 && arg1P_15>0 && 1+arg4==arg2P_15 ], cost: 1
      3: f1714_0_createTree_Return -> f962_0_main_LE : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, arg5'=arg5P_4, arg6'=arg6P_4, [ arg1P_4<=arg1 && 1+arg1P_4<=arg4 && arg1>0 && arg4>1 && arg1P_4>0 && arg2P_4>3 && 2+arg6<=arg4 && -1+arg3==arg3P_4 && arg5==arg4P_4 ], cost: 1
      5: f1548_0_flatten_NULL -> f1548_0_flatten_NULL : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ 2+arg1P_6<=arg1 && 2+arg1P_6<=arg2 && 2+arg2P_6<=arg1 && 2+arg2P_6<=arg2 && arg1>1 && arg2>1 && arg1P_6>-1 && arg2P_6>-1 ], cost: 1
      6: f1548_0_flatten_NULL -> f1548_0_flatten_NULL : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ -2+arg1P_7<=arg1 && -2+arg1P_7<=arg2 && -2+arg2P_7<=arg1 && -2+arg2P_7<=arg2 && arg1>2 && arg2>2 && arg1P_7>2 && arg2P_7>2 ], cost: 1
      8: f2482_0_createTree_LE -> f2482_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>0 && arg2>2 && arg1P_9>0 && arg2P_9>0 && -1+arg3==arg3P_9 && 1+arg4==arg4P_9 ], cost: 1
      9: f2482_0_createTree_LE -> f2482_0_createTree_LE : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ arg3>0 && x67_1>0 && arg4>-1 && arg1P_10<=arg1 && 2+arg2P_10<=arg2 && arg1>0 && arg2>2 && arg1P_10>0 && arg2P_10>0 && -1+arg3==arg3P_10 && 1+arg4==arg4P_10 ], cost: 1
     10: f2482_0_createTree_LE -> f2482_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, arg5'=arg5P_11, arg6'=arg6P_11, [ arg4>-1 && x75_1>0 && arg3>0 && arg1>0 && arg2>1 && arg1P_11>0 && arg2P_11>0 && -1+arg3==arg3P_11 ], cost: 1
     11: f2482_0_createTree_LE -> f2482_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg3P_12, arg4'=arg4P_12, arg5'=arg5P_12, arg6'=arg6P_12, [ arg3>0 && arg4>-1 && arg1>0 && arg2>1 && arg1P_12>0 && arg2P_12>0 && -1+arg3==arg3P_12 ], cost: 1
     12: f2482_0_createTree_LE -> f2482_0_createTree_LE : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, arg5'=arg5P_13, arg6'=arg6P_13, [ arg3>0 && arg4>-1 && -2+arg1P_13<=arg1 && -2+arg1P_13<=arg2 && -2+arg2P_13<=arg1 && -2+arg2P_13<=arg2 && arg1>1 && arg2>1 && arg1P_13>3 && arg2P_13>3 && -1+arg3==arg3P_13 ], cost: 1
     13: f2482_0_createTree_LE -> f2482_0_createTree_LE : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=arg3P_14, arg4'=arg4P_14, arg5'=arg5P_14, arg6'=arg6P_14, [ arg4>-1 && x97_1>0 && arg3>0 && -2+arg1P_14<=arg1 && -2+arg1P_14<=arg2 && -2+arg2P_14<=arg1 && -2+arg2P_14<=arg2 && arg1>1 && arg2>1 && arg1P_14>3 && arg2P_14>3 && -1+arg3==arg3P_14 ], cost: 1
     15: f2482_0_createTree_LE -> f1223_0_random_ArrayAccess : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_16, arg4'=arg4P_16, arg5'=arg5P_16, arg6'=arg6P_16, [ arg3>0 && arg4>-1 && arg1P_16<=arg1 && 1+arg1P_16<=arg2 && arg1>0 && arg2>1 && arg1P_16>0 && 1+arg4==arg2P_16 ], cost: 1
     16: f2482_0_createTree_LE -> f1223_0_random_ArrayAccess : arg1'=arg1P_17, arg2'=arg2P_17, arg3'=arg3P_17, arg4'=arg4P_17, arg5'=arg5P_17, arg6'=arg6P_17, [ arg4>-1 && x117_1>0 && arg3>0 && arg1P_17<=arg1 && 1+arg1P_17<=arg2 && arg1>0 && arg2>1 && arg1P_17>0 && 1+arg4==arg2P_17 ], cost: 1
     17: __init -> f1_0_main_Load : arg1'=arg1P_18, arg2'=arg2P_18, arg3'=arg3P_18, arg4'=arg4P_18, arg5'=arg5P_18, arg6'=arg6P_18, [], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
     17: __init -> f1_0_main_Load : arg1'=arg1P_18, arg2'=arg2P_18, arg3'=arg3P_18, arg4'=arg4P_18, arg5'=arg5P_18, arg6'=arg6P_18, [], cost: 1

Removed unreachable and leaf rules:
   Start location: __init
      0: f1_0_main_Load -> f962_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: f962_0_main_LE -> f962_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: f962_0_main_LE -> f962_0_main_LE : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, arg5'=arg5P_3, arg6'=arg6P_3, [ arg3>0 && x13_1>0 && arg1P_3<=arg1 && -1+arg1P_3<=arg2 && arg1>0 && arg2>-1 && arg1P_3>0 && arg2P_3>2 && -1+arg3==arg3P_3 ], cost: 1
      4: f962_0_main_LE -> f1548_0_flatten_NULL : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, arg5'=arg5P_5, arg6'=arg6P_5, [ arg1P_5<=arg2 && x30_1>0 && arg2P_5<=arg2 && arg1>0 && arg2>-1 && arg1P_5>-1 && arg2P_5>-1 && 0==arg3 ], cost: 1
      7: f962_0_main_LE -> f2482_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, arg5'=arg5P_8, arg6'=arg6P_8, [ arg3P_8>0 && x46_1>0 && arg3>0 && arg4>-1 && -1+arg1P_8<=arg1 && -2+arg1P_8<=arg2 && -1+arg2P_8<=arg1 && -2+arg2P_8<=arg2 && arg1>0 && arg2>-1 && arg1P_8>1 && arg2P_8>1 ], cost: 1
      5: f1548_0_flatten_NULL -> f1548_0_flatten_NULL : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ 2+arg1P_6<=arg1 && 2+arg1P_6<=arg2 && 2+arg2P_6<=arg1 && 2+arg2P_6<=arg2 && arg1>1 && arg2>1 && arg1P_6>-1 && arg2P_6>-1 ], cost: 1
      6: f1548_0_flatten_NULL -> f1548_0_flatten_NULL : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ -2+arg1P_7<=arg1 && -2+arg1P_7<=arg2 && -2+arg2P_7<=arg1 && -2+arg2P_7<=arg2 && arg1>2 && arg2>2 && arg1P_7>2 && arg2P_7>2 ], cost: 1
      8: f2482_0_createTree_LE -> f2482_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>0 && arg2>2 && arg1P_9>0 && arg2P_9>0 && -1+arg3==arg3P_9 && 1+arg4==arg4P_9 ], cost: 1
      9: f2482_0_createTree_LE -> f2482_0_createTree_LE : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ arg3>0 && x67_1>0 && arg4>-1 && arg1P_10<=arg1 && 2+arg2P_10<=arg2 && arg1>0 && arg2>2 && arg1P_10>0 && arg2P_10>0 && -1+arg3==arg3P_10 && 1+arg4==arg4P_10 ], cost: 1
     10: f2482_0_createTree_LE -> f2482_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, arg5'=arg5P_11, arg6'=arg6P_11, [ arg4>-1 && x75_1>0 && arg3>0 && arg1>0 && arg2>1 && arg1P_11>0 && arg2P_11>0 && -1+arg3==arg3P_11 ], cost: 1
     11: f2482_0_createTree_LE -> f2482_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg3P_12, arg4'=arg4P_12, arg5'=arg5P_12, arg6'=arg6P_12, [ arg3>0 && arg4>-1 && arg1>0 && arg2>1 && arg1P_12>0 && arg2P_12>0 && -1+arg3==arg3P_12 ], cost: 1
     12: f2482_0_createTree_LE -> f2482_0_createTree_LE : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, arg5'=arg5P_13, arg6'=arg6P_13, [ arg3>0 && arg4>-1 && -2+arg1P_13<=arg1 && -2+arg1P_13<=arg2 && -2+arg2P_13<=arg1 && -2+arg2P_13<=arg2 && arg1>1 && arg2>1 && arg1P_13>3 && arg2P_13>3 && -1+arg3==arg3P_13 ], cost: 1
     13: f2482_0_createTree_LE -> f2482_0_createTree_LE : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=arg3P_14, arg4'=arg4P_14, arg5'=arg5P_14, arg6'=arg6P_14, [ arg4>-1 && x97_1>0 && arg3>0 && -2+arg1P_14<=arg1 && -2+arg1P_14<=arg2 && -2+arg2P_14<=arg1 && -2+arg2P_14<=arg2 && arg1>1 && arg2>1 && arg1P_14>3 && arg2P_14>3 && -1+arg3==arg3P_14 ], cost: 1
     17: __init -> f1_0_main_Load : arg1'=arg1P_18, arg2'=arg2P_18, arg3'=arg3P_18, arg4'=arg4P_18, arg5'=arg5P_18, arg6'=arg6P_18, [], cost: 1

Simplified all rules, resulting in:
   Start location: __init
      0: f1_0_main_Load -> f962_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: f962_0_main_LE -> f962_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: f962_0_main_LE -> f962_0_main_LE : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=-1+arg3, arg4'=arg4P_3, arg5'=arg5P_3, arg6'=arg6P_3, [ arg3>0 && arg1P_3<=arg1 && -1+arg1P_3<=arg2 && arg1>0 && arg2>-1 && arg1P_3>0 && arg2P_3>2 ], cost: 1
      4: f962_0_main_LE -> f1548_0_flatten_NULL : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, arg5'=arg5P_5, arg6'=arg6P_5, [ arg1P_5<=arg2 && arg2P_5<=arg2 && arg1>0 && arg2>-1 && arg1P_5>-1 && arg2P_5>-1 && 0==arg3 ], cost: 1
      7: f962_0_main_LE -> f2482_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, arg5'=arg5P_8, arg6'=arg6P_8, [ arg3P_8>0 && arg3>0 && arg4>-1 && -1+arg1P_8<=arg1 && -2+arg1P_8<=arg2 && -1+arg2P_8<=arg1 && -2+arg2P_8<=arg2 && arg1>0 && arg2>-1 && arg1P_8>1 && arg2P_8>1 ], cost: 1
      5: f1548_0_flatten_NULL -> f1548_0_flatten_NULL : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ 2+arg1P_6<=arg1 && 2+arg1P_6<=arg2 && 2+arg2P_6<=arg1 && 2+arg2P_6<=arg2 && arg1>1 && arg2>1 && arg1P_6>-1 && arg2P_6>-1 ], cost: 1
      6: f1548_0_flatten_NULL -> f1548_0_flatten_NULL : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ -2+arg1P_7<=arg1 && -2+arg1P_7<=arg2 && -2+arg2P_7<=arg1 && -2+arg2P_7<=arg2 && arg1>2 && arg2>2 && arg1P_7>2 && arg2P_7>2 ], cost: 1
      8: f2482_0_createTree_LE -> f2482_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>0 && arg2>2 && arg1P_9>0 && arg2P_9>0 ], cost: 1
      9: f2482_0_createTree_LE -> f2482_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>0 && arg2>2 && arg1P_10>0 && arg2P_10>0 ], cost: 1
     10: f2482_0_createTree_LE -> f2482_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=-1+arg3, arg4'=arg4P_11, arg5'=arg5P_11, arg6'=arg6P_11, [ arg4>-1 && arg3>0 && arg1>0 && arg2>1 && arg1P_11>0 && arg2P_11>0 ], cost: 1
     11: f2482_0_createTree_LE -> f2482_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=-1+arg3, arg4'=arg4P_12, arg5'=arg5P_12, arg6'=arg6P_12, [ arg3>0 && arg4>-1 && arg1>0 && arg2>1 && arg1P_12>0 && arg2P_12>0 ], cost: 1
     12: f2482_0_createTree_LE -> f2482_0_createTree_LE : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=-1+arg3, arg4'=arg4P_13, arg5'=arg5P_13, arg6'=arg6P_13, [ arg3>0 && arg4>-1 && -2+arg1P_13<=arg1 && -2+arg1P_13<=arg2 && -2+arg2P_13<=arg1 && -2+arg2P_13<=arg2 && arg1>1 && arg2>1 && arg1P_13>3 && arg2P_13>3 ], cost: 1
     13: f2482_0_createTree_LE -> f2482_0_createTree_LE : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=-1+arg3, arg4'=arg4P_14, arg5'=arg5P_14, arg6'=arg6P_14, [ arg4>-1 && arg3>0 && -2+arg1P_14<=arg1 && -2+arg1P_14<=arg2 && -2+arg2P_14<=arg1 && -2+arg2P_14<=arg2 && arg1>1 && arg2>1 && arg1P_14>3 && arg2P_14>3 ], cost: 1
     17: __init -> f1_0_main_Load : arg1'=arg1P_18, arg2'=arg2P_18, arg3'=arg3P_18, arg4'=arg4P_18, arg5'=arg5P_18, arg6'=arg6P_18, [], cost: 1

### Simplification by acceleration and chaining ###

Accelerating simple loops of location 1.
   Accelerating the following rules:
      1: f962_0_main_LE -> f962_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: f962_0_main_LE -> f962_0_main_LE : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=-1+arg3, arg4'=arg4P_3, arg5'=arg5P_3, arg6'=arg6P_3, [ arg3>0 && arg1P_3<=arg1 && -1+arg1P_3<=arg2 && arg1>0 && arg2>-1 && arg1P_3>0 && arg2P_3>2 ], 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 18.
      During metering: Instantiating temporary variables by {arg2P_3==3,arg1P_3==1}
   Accelerated rule 2 with metering function arg3, yielding the new rule 19.
   Removing the simple loops: 1 2.

Accelerating simple loops of location 3.
   Accelerating the following rules:
      5: f1548_0_flatten_NULL -> f1548_0_flatten_NULL : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ 2+arg1P_6<=arg1 && 2+arg1P_6<=arg2 && 2+arg2P_6<=arg1 && 2+arg2P_6<=arg2 && arg1>1 && arg2>1 && arg1P_6>-1 && arg2P_6>-1 ], cost: 1
      6: f1548_0_flatten_NULL -> f1548_0_flatten_NULL : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ -2+arg1P_7<=arg1 && -2+arg1P_7<=arg2 && -2+arg2P_7<=arg1 && -2+arg2P_7<=arg2 && arg1>2 && arg2>2 && arg1P_7>2 && arg2P_7>2 ], cost: 1

      During metering: Instantiating temporary variables by {arg2P_6==-2+arg2,arg1P_6==-2+arg1}
   Accelerated rule 5 with metering function arg1-arg2, yielding the new rule 20.
   Accelerated rule 6 with NONTERM (after strengthening guard), yielding the new rule 21.
   Removing the simple loops: 5.

Accelerating simple loops of location 4.
   Accelerating the following rules:
      8: f2482_0_createTree_LE -> f2482_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>0 && arg2>2 && arg1P_9>0 && arg2P_9>0 ], cost: 1
      9: f2482_0_createTree_LE -> f2482_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>0 && arg2>2 && arg1P_10>0 && arg2P_10>0 ], cost: 1
     10: f2482_0_createTree_LE -> f2482_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=-1+arg3, arg4'=arg4P_11, arg5'=arg5P_11, arg6'=arg6P_11, [ arg4>-1 && arg3>0 && arg1>0 && arg2>1 && arg1P_11>0 && arg2P_11>0 ], cost: 1
     11: f2482_0_createTree_LE -> f2482_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=-1+arg3, arg4'=arg4P_12, arg5'=arg5P_12, arg6'=arg6P_12, [ arg3>0 && arg4>-1 && arg1>0 && arg2>1 && arg1P_12>0 && arg2P_12>0 ], cost: 1
     12: f2482_0_createTree_LE -> f2482_0_createTree_LE : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=-1+arg3, arg4'=arg4P_13, arg5'=arg5P_13, arg6'=arg6P_13, [ arg3>0 && arg4>-1 && -2+arg1P_13<=arg1 && -2+arg1P_13<=arg2 && -2+arg2P_13<=arg1 && -2+arg2P_13<=arg2 && arg1>1 && arg2>1 && arg1P_13>3 && arg2P_13>3 ], cost: 1
     13: f2482_0_createTree_LE -> f2482_0_createTree_LE : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=-1+arg3, arg4'=arg4P_14, arg5'=arg5P_14, arg6'=arg6P_14, [ arg4>-1 && arg3>0 && -2+arg1P_14<=arg1 && -2+arg1P_14<=arg2 && -2+arg2P_14<=arg1 && -2+arg2P_14<=arg2 && arg1>1 && arg2>1 && arg1P_14>3 && arg2P_14>3 ], cost: 1

   Found no metering function for rule 8.
   Found no metering function for rule 9.
   Accelerated rule 10 with metering function arg3 (after strengthening guard), yielding the new rule 22.
   Accelerated rule 11 with metering function arg3 (after strengthening guard), yielding the new rule 23.
   Accelerated rule 12 with metering function arg3 (after strengthening guard), yielding the new rule 24.
   Accelerated rule 13 with metering function arg3 (after strengthening guard), yielding the new rule 25.
      During metering: Instantiating temporary variables by {arg2P_13==2+arg1P_13,arg1P_13==-2+arg2P_13}
      During metering: Instantiating temporary variables by {arg2P_13==2+arg1P_13,arg1P_13==-2+arg2P_13}
      During metering: Instantiating temporary variables by {arg2P_14==2+arg1P_14,arg1P_14==-2+arg2P_14}
      During metering: Instantiating temporary variables by {arg2P_14==2+arg1P_14,arg1P_14==-2+arg2P_14}
   Removing the simple loops:.

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
      0: f1_0_main_Load -> f962_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
      4: f962_0_main_LE -> f1548_0_flatten_NULL : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, arg5'=arg5P_5, arg6'=arg6P_5, [ arg1P_5<=arg2 && arg2P_5<=arg2 && arg1>0 && arg2>-1 && arg1P_5>-1 && arg2P_5>-1 && 0==arg3 ], cost: 1
      7: f962_0_main_LE -> f2482_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, arg5'=arg5P_8, arg6'=arg6P_8, [ arg3P_8>0 && arg3>0 && arg4>-1 && -1+arg1P_8<=arg1 && -2+arg1P_8<=arg2 && -1+arg2P_8<=arg1 && -2+arg2P_8<=arg2 && arg1>0 && arg2>-1 && arg1P_8>1 && arg2P_8>1 ], cost: 1
     18: f962_0_main_LE -> f962_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
     19: f962_0_main_LE -> f962_0_main_LE : arg1'=1, arg2'=3, arg3'=0, arg4'=arg4P_3, arg5'=arg5P_3, arg6'=arg6P_3, [ arg3>0 && 1<=arg1 && 0<=arg2 ], cost: arg3
      6: f1548_0_flatten_NULL -> f1548_0_flatten_NULL : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ -2+arg1P_7<=arg1 && -2+arg1P_7<=arg2 && -2+arg2P_7<=arg1 && -2+arg2P_7<=arg2 && arg1>2 && arg2>2 && arg1P_7>2 && arg2P_7>2 ], cost: 1
     20: f1548_0_flatten_NULL -> f1548_0_flatten_NULL : arg1'=-arg1+2*arg2, arg2'=-2*arg1+3*arg2, arg3'=arg3P_6, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg1<=arg2 && arg1>1 && arg2>1 && arg1-arg2>=1 ], cost: arg1-arg2
     21: f1548_0_flatten_NULL -> [8] : [ -2+arg1P_7<=arg1 && -2+arg1P_7<=arg2 && -2+arg2P_7<=arg1 && -2+arg2P_7<=arg2 && arg1>2 && arg2>2 && arg1P_7>2 && arg2P_7>2 && -2+arg2P_7<=arg1P_7 && -2+arg1P_7<=arg2P_7 ], cost: NONTERM
      8: f2482_0_createTree_LE -> f2482_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>0 && arg2>2 && arg1P_9>0 && arg2P_9>0 ], cost: 1
      9: f2482_0_createTree_LE -> f2482_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>0 && arg2>2 && arg1P_10>0 && arg2P_10>0 ], cost: 1
     10: f2482_0_createTree_LE -> f2482_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=-1+arg3, arg4'=arg4P_11, arg5'=arg5P_11, arg6'=arg6P_11, [ arg4>-1 && arg3>0 && arg1>0 && arg2>1 && arg1P_11>0 && arg2P_11>0 ], cost: 1
     11: f2482_0_createTree_LE -> f2482_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=-1+arg3, arg4'=arg4P_12, arg5'=arg5P_12, arg6'=arg6P_12, [ arg3>0 && arg4>-1 && arg1>0 && arg2>1 && arg1P_12>0 && arg2P_12>0 ], cost: 1
     12: f2482_0_createTree_LE -> f2482_0_createTree_LE : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=-1+arg3, arg4'=arg4P_13, arg5'=arg5P_13, arg6'=arg6P_13, [ arg3>0 && arg4>-1 && -2+arg1P_13<=arg1 && -2+arg1P_13<=arg2 && -2+arg2P_13<=arg1 && -2+arg2P_13<=arg2 && arg1>1 && arg2>1 && arg1P_13>3 && arg2P_13>3 ], cost: 1
     13: f2482_0_createTree_LE -> f2482_0_createTree_LE : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=-1+arg3, arg4'=arg4P_14, arg5'=arg5P_14, arg6'=arg6P_14, [ arg4>-1 && arg3>0 && -2+arg1P_14<=arg1 && -2+arg1P_14<=arg2 && -2+arg2P_14<=arg1 && -2+arg2P_14<=arg2 && arg1>1 && arg2>1 && arg1P_14>3 && arg2P_14>3 ], cost: 1
     22: f2482_0_createTree_LE -> f2482_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=0, arg4'=arg4P_11, arg5'=arg5P_11, arg6'=arg6P_11, [ arg4>-1 && arg3>0 && arg1>0 && arg2>1 && arg1P_11>0 && arg2P_11>1 && arg4P_11>-1 ], cost: arg3
     23: f2482_0_createTree_LE -> f2482_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=0, arg4'=arg4P_12, arg5'=arg5P_12, arg6'=arg6P_12, [ arg3>0 && arg4>-1 && arg1>0 && arg2>1 && arg1P_12>0 && arg2P_12>1 && arg4P_12>-1 ], cost: arg3
     24: f2482_0_createTree_LE -> f2482_0_createTree_LE : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=0, arg4'=arg4P_13, arg5'=arg5P_13, arg6'=arg6P_13, [ arg3>0 && arg4>-1 && -2+arg1P_13<=arg1 && -2+arg1P_13<=arg2 && -2+arg2P_13<=arg1 && -2+arg2P_13<=arg2 && arg1>1 && arg2>1 && arg1P_13>3 && arg2P_13>3 && -2+arg2P_13<=arg1P_13 && -2+arg1P_13<=arg2P_13 && arg4P_13>-1 ], cost: arg3
     25: f2482_0_createTree_LE -> f2482_0_createTree_LE : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=0, arg4'=arg4P_14, arg5'=arg5P_14, arg6'=arg6P_14, [ arg4>-1 && arg3>0 && -2+arg1P_14<=arg1 && -2+arg1P_14<=arg2 && -2+arg2P_14<=arg1 && -2+arg2P_14<=arg2 && arg1>1 && arg2>1 && arg1P_14>3 && arg2P_14>3 && -2+arg2P_14<=arg1P_14 && -2+arg1P_14<=arg2P_14 && arg4P_14>-1 ], cost: arg3
     17: __init -> f1_0_main_Load : arg1'=arg1P_18, arg2'=arg2P_18, arg3'=arg3P_18, arg4'=arg4P_18, arg5'=arg5P_18, arg6'=arg6P_18, [], cost: 1

Chained accelerated rules (with incoming rules):
   Start location: __init
      0: f1_0_main_Load -> f962_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
     26: f1_0_main_Load -> f962_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
     27: f1_0_main_Load -> f962_0_main_LE : arg1'=1, arg2'=3, arg3'=0, arg4'=arg4P_3, arg5'=arg5P_3, arg6'=arg6P_3, [ arg2>-1 && arg1>0 && arg3P_1>0 ], cost: 1+arg3P_1
      4: f962_0_main_LE -> f1548_0_flatten_NULL : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, arg5'=arg5P_5, arg6'=arg6P_5, [ arg1P_5<=arg2 && arg2P_5<=arg2 && arg1>0 && arg2>-1 && arg1P_5>-1 && arg2P_5>-1 && 0==arg3 ], cost: 1
      7: f962_0_main_LE -> f2482_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, arg5'=arg5P_8, arg6'=arg6P_8, [ arg3P_8>0 && arg3>0 && arg4>-1 && -1+arg1P_8<=arg1 && -2+arg1P_8<=arg2 && -1+arg2P_8<=arg1 && -2+arg2P_8<=arg2 && arg1>0 && arg2>-1 && arg1P_8>1 && arg2P_8>1 ], cost: 1
     28: f962_0_main_LE -> f1548_0_flatten_NULL : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ arg1>0 && 0==arg3 && arg1P_7>2 && arg2P_7>2 && -2+arg1P_7<=arg2 && -2+arg2P_7<=arg2 && 3<=arg2 ], cost: 2
     29: f962_0_main_LE -> [8] : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, arg5'=arg5P_5, arg6'=arg6P_5, [ arg1P_5<=arg2 && arg2P_5<=arg2 && arg1>0 && arg2>-1 && 0==arg3 && arg1P_5>2 && arg2P_5>2 ], cost: NONTERM
     30: f962_0_main_LE -> f2482_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=-1+arg3P_8, arg4'=1+arg4P_8, arg5'=arg5P_9, arg6'=arg6P_9, [ arg3P_8>0 && arg3>0 && arg4>-1 && arg4P_8>-1 && arg1P_9>0 && arg2P_9>0 && 2+arg2P_9<=1+arg1 && 3<=1+arg1 && 2+arg2P_9<=2+arg2 && 3<=2+arg2 && arg1P_9<=1+arg1 && arg1P_9<=2+arg2 ], cost: 2
     31: f962_0_main_LE -> f2482_0_createTree_LE : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=-1+arg3P_8, arg4'=1+arg4P_8, arg5'=arg5P_10, arg6'=arg6P_10, [ arg3P_8>0 && arg3>0 && arg4>-1 && arg4P_8>-1 && arg1P_10>0 && arg2P_10>0 && 2+arg2P_10<=1+arg1 && 3<=1+arg1 && 2+arg2P_10<=2+arg2 && 3<=2+arg2 && arg1P_10<=1+arg1 && arg1P_10<=2+arg2 ], cost: 2
     32: f962_0_main_LE -> f2482_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=-1+arg3P_8, arg4'=arg4P_11, arg5'=arg5P_11, arg6'=arg6P_11, [ arg3P_8>0 && arg3>0 && arg4>-1 && arg1>0 && arg2>-1 && arg1P_11>0 && arg2P_11>0 ], cost: 2
     33: f962_0_main_LE -> f2482_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=-1+arg3P_8, arg4'=arg4P_12, arg5'=arg5P_12, arg6'=arg6P_12, [ arg3P_8>0 && arg3>0 && arg4>-1 && arg1>0 && arg2>-1 && arg1P_12>0 && arg2P_12>0 ], cost: 2
     34: f962_0_main_LE -> f2482_0_createTree_LE : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=-1+arg3P_8, arg4'=arg4P_13, arg5'=arg5P_13, arg6'=arg6P_13, [ arg3P_8>0 && arg3>0 && arg4>-1 && arg1>0 && arg2>-1 && arg1P_13>3 && arg2P_13>3 && -2+arg1P_13<=1+arg1 && -2+arg2P_13<=1+arg1 && -2+arg1P_13<=2+arg2 && -2+arg2P_13<=2+arg2 ], cost: 2
     35: f962_0_main_LE -> f2482_0_createTree_LE : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=-1+arg3P_8, arg4'=arg4P_14, arg5'=arg5P_14, arg6'=arg6P_14, [ arg3P_8>0 && arg3>0 && arg4>-1 && arg1>0 && arg2>-1 && arg1P_14>3 && arg2P_14>3 && -2+arg1P_14<=1+arg1 && -2+arg2P_14<=1+arg1 && -2+arg1P_14<=2+arg2 && -2+arg2P_14<=2+arg2 ], cost: 2
     36: f962_0_main_LE -> f2482_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=0, arg4'=arg4P_11, arg5'=arg5P_11, arg6'=arg6P_11, [ arg3P_8>0 && arg3>0 && arg4>-1 && arg1>0 && arg2>-1 && arg1P_11>0 && arg2P_11>1 && arg4P_11>-1 ], cost: 1+arg3P_8
     37: f962_0_main_LE -> f2482_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=0, arg4'=arg4P_12, arg5'=arg5P_12, arg6'=arg6P_12, [ arg3P_8>0 && arg3>0 && arg4>-1 && arg1>0 && arg2>-1 && arg1P_12>0 && arg2P_12>1 && arg4P_12>-1 ], cost: 1+arg3P_8
     38: f962_0_main_LE -> f2482_0_createTree_LE : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=0, arg4'=arg4P_13, arg5'=arg5P_13, arg6'=arg6P_13, [ arg3P_8>0 && arg3>0 && arg4>-1 && arg1>0 && arg2>-1 && arg1P_13>3 && arg2P_13>3 && -2+arg2P_13<=arg1P_13 && -2+arg1P_13<=arg2P_13 && arg4P_13>-1 && -2+arg1P_13<=1+arg1 && -2+arg2P_13<=1+arg1 && -2+arg1P_13<=2+arg2 && -2+arg2P_13<=2+arg2 ], cost: 1+arg3P_8
     39: f962_0_main_LE -> f2482_0_createTree_LE : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=0, arg4'=arg4P_14, arg5'=arg5P_14, arg6'=arg6P_14, [ arg3P_8>0 && arg3>0 && arg4>-1 && arg1>0 && arg2>-1 && arg1P_14>3 && arg2P_14>3 && -2+arg2P_14<=arg1P_14 && -2+arg1P_14<=arg2P_14 && arg4P_14>-1 && -2+arg1P_14<=1+arg1 && -2+arg2P_14<=1+arg1 && -2+arg1P_14<=2+arg2 && -2+arg2P_14<=2+arg2 ], cost: 1+arg3P_8
     17: __init -> f1_0_main_Load : arg1'=arg1P_18, arg2'=arg2P_18, arg3'=arg3P_18, arg4'=arg4P_18, arg5'=arg5P_18, arg6'=arg6P_18, [], cost: 1

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
      0: f1_0_main_Load -> f962_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
     26: f1_0_main_Load -> f962_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
     27: f1_0_main_Load -> f962_0_main_LE : arg1'=1, arg2'=3, arg3'=0, arg4'=arg4P_3, arg5'=arg5P_3, arg6'=arg6P_3, [ arg2>-1 && arg1>0 && arg3P_1>0 ], cost: 1+arg3P_1
     29: f962_0_main_LE -> [8] : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, arg5'=arg5P_5, arg6'=arg6P_5, [ arg1P_5<=arg2 && arg2P_5<=arg2 && arg1>0 && arg2>-1 && 0==arg3 && arg1P_5>2 && arg2P_5>2 ], cost: NONTERM
     36: f962_0_main_LE -> f2482_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=0, arg4'=arg4P_11, arg5'=arg5P_11, arg6'=arg6P_11, [ arg3P_8>0 && arg3>0 && arg4>-1 && arg1>0 && arg2>-1 && arg1P_11>0 && arg2P_11>1 && arg4P_11>-1 ], cost: 1+arg3P_8
     37: f962_0_main_LE -> f2482_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=0, arg4'=arg4P_12, arg5'=arg5P_12, arg6'=arg6P_12, [ arg3P_8>0 && arg3>0 && arg4>-1 && arg1>0 && arg2>-1 && arg1P_12>0 && arg2P_12>1 && arg4P_12>-1 ], cost: 1+arg3P_8
     38: f962_0_main_LE -> f2482_0_createTree_LE : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=0, arg4'=arg4P_13, arg5'=arg5P_13, arg6'=arg6P_13, [ arg3P_8>0 && arg3>0 && arg4>-1 && arg1>0 && arg2>-1 && arg1P_13>3 && arg2P_13>3 && -2+arg2P_13<=arg1P_13 && -2+arg1P_13<=arg2P_13 && arg4P_13>-1 && -2+arg1P_13<=1+arg1 && -2+arg2P_13<=1+arg1 && -2+arg1P_13<=2+arg2 && -2+arg2P_13<=2+arg2 ], cost: 1+arg3P_8
     39: f962_0_main_LE -> f2482_0_createTree_LE : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=0, arg4'=arg4P_14, arg5'=arg5P_14, arg6'=arg6P_14, [ arg3P_8>0 && arg3>0 && arg4>-1 && arg1>0 && arg2>-1 && arg1P_14>3 && arg2P_14>3 && -2+arg2P_14<=arg1P_14 && -2+arg1P_14<=arg2P_14 && arg4P_14>-1 && -2+arg1P_14<=1+arg1 && -2+arg2P_14<=1+arg1 && -2+arg1P_14<=2+arg2 && -2+arg2P_14<=2+arg2 ], cost: 1+arg3P_8
     17: __init -> f1_0_main_Load : arg1'=arg1P_18, arg2'=arg2P_18, arg3'=arg3P_18, arg4'=arg4P_18, arg5'=arg5P_18, arg6'=arg6P_18, [], cost: 1

Eliminated locations (on tree-shaped paths):
   Start location: __init
     29: f962_0_main_LE -> [8] : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, arg5'=arg5P_5, arg6'=arg6P_5, [ arg1P_5<=arg2 && arg2P_5<=arg2 && arg1>0 && arg2>-1 && 0==arg3 && arg1P_5>2 && arg2P_5>2 ], cost: NONTERM
     36: f962_0_main_LE -> f2482_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=0, arg4'=arg4P_11, arg5'=arg5P_11, arg6'=arg6P_11, [ arg3P_8>0 && arg3>0 && arg4>-1 && arg1>0 && arg2>-1 && arg1P_11>0 && arg2P_11>1 && arg4P_11>-1 ], cost: 1+arg3P_8
     37: f962_0_main_LE -> f2482_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=0, arg4'=arg4P_12, arg5'=arg5P_12, arg6'=arg6P_12, [ arg3P_8>0 && arg3>0 && arg4>-1 && arg1>0 && arg2>-1 && arg1P_12>0 && arg2P_12>1 && arg4P_12>-1 ], cost: 1+arg3P_8
     38: f962_0_main_LE -> f2482_0_createTree_LE : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=0, arg4'=arg4P_13, arg5'=arg5P_13, arg6'=arg6P_13, [ arg3P_8>0 && arg3>0 && arg4>-1 && arg1>0 && arg2>-1 && arg1P_13>3 && arg2P_13>3 && -2+arg2P_13<=arg1P_13 && -2+arg1P_13<=arg2P_13 && arg4P_13>-1 && -2+arg1P_13<=1+arg1 && -2+arg2P_13<=1+arg1 && -2+arg1P_13<=2+arg2 && -2+arg2P_13<=2+arg2 ], cost: 1+arg3P_8
     39: f962_0_main_LE -> f2482_0_createTree_LE : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=0, arg4'=arg4P_14, arg5'=arg5P_14, arg6'=arg6P_14, [ arg3P_8>0 && arg3>0 && arg4>-1 && arg1>0 && arg2>-1 && arg1P_14>3 && arg2P_14>3 && -2+arg2P_14<=arg1P_14 && -2+arg1P_14<=arg2P_14 && arg4P_14>-1 && -2+arg1P_14<=1+arg1 && -2+arg2P_14<=1+arg1 && -2+arg1P_14<=2+arg2 && -2+arg2P_14<=2+arg2 ], cost: 1+arg3P_8
     40: __init -> f962_0_main_LE : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=1, arg5'=arg5P_1, arg6'=arg6P_1, [ arg2P_18>-1 && arg3P_1>-1 && arg1P_1<=arg1P_18 && 1+arg2P_1<=arg1P_18 && arg1P_18>0 && arg1P_1>0 && arg2P_1>-1 ], cost: 2
     41: __init -> f962_0_main_LE : arg1'=1, arg2'=arg2P_1+2*arg3P_1, arg3'=0, arg4'=arg4P_2, arg5'=arg5P_2, arg6'=arg6P_2, [ arg2P_18>-1 && 1+arg2P_1<=arg1P_18 && arg1P_18>0 && arg2P_1>-1 && arg3P_1>0 ], cost: 2+arg3P_1
     42: __init -> f962_0_main_LE : arg1'=1, arg2'=3, arg3'=0, arg4'=arg4P_3, arg5'=arg5P_3, arg6'=arg6P_3, [ arg2P_18>-1 && arg1P_18>0 && arg3P_1>0 ], cost: 2+arg3P_1

Eliminated locations (on tree-shaped paths):
   Start location: __init
     43: __init -> [8] : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, arg5'=arg5P_5, arg6'=arg6P_5, [ arg2P_18>-1 && arg1P_1<=arg1P_18 && 1+arg2P_1<=arg1P_18 && arg1P_18>0 && arg1P_1>0 && arg2P_1>-1 && arg1P_5<=arg2P_1 && arg2P_5<=arg2P_1 && 0==arg3P_1 && arg1P_5>2 && arg2P_5>2 ], cost: NONTERM
     44: __init -> f2482_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=0, arg4'=arg4P_11, arg5'=arg5P_11, arg6'=arg6P_11, [ arg2P_18>-1 && arg1P_1<=arg1P_18 && 1+arg2P_1<=arg1P_18 && arg1P_18>0 && arg1P_1>0 && arg2P_1>-1 && arg3P_8>0 && arg3P_1>0 && arg1P_11>0 && arg2P_11>1 && arg4P_11>-1 ], cost: 3+arg3P_8
     45: __init -> f2482_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=0, arg4'=arg4P_12, arg5'=arg5P_12, arg6'=arg6P_12, [ arg2P_18>-1 && arg1P_1<=arg1P_18 && 1+arg2P_1<=arg1P_18 && arg1P_18>0 && arg1P_1>0 && arg2P_1>-1 && arg3P_8>0 && arg3P_1>0 && arg1P_12>0 && arg2P_12>1 && arg4P_12>-1 ], cost: 3+arg3P_8
     46: __init -> f2482_0_createTree_LE : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=0, arg4'=arg4P_13, arg5'=arg5P_13, arg6'=arg6P_13, [ arg2P_18>-1 && arg1P_1<=arg1P_18 && 1+arg2P_1<=arg1P_18 && arg1P_18>0 && arg1P_1>0 && arg2P_1>-1 && arg3P_8>0 && arg3P_1>0 && arg1P_13>3 && arg2P_13>3 && -2+arg2P_13<=arg1P_13 && -2+arg1P_13<=arg2P_13 && arg4P_13>-1 && -2+arg1P_13<=1+arg1P_1 && -2+arg2P_13<=1+arg1P_1 && -2+arg1P_13<=2+arg2P_1 && -2+arg2P_13<=2+arg2P_1 ], cost: 3+arg3P_8
     47: __init -> f2482_0_createTree_LE : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=0, arg4'=arg4P_14, arg5'=arg5P_14, arg6'=arg6P_14, [ arg2P_18>-1 && arg1P_1<=arg1P_18 && 1+arg2P_1<=arg1P_18 && arg1P_18>0 && arg1P_1>0 && arg2P_1>-1 && arg3P_8>0 && arg3P_1>0 && arg1P_14>3 && arg2P_14>3 && -2+arg2P_14<=arg1P_14 && -2+arg1P_14<=arg2P_14 && arg4P_14>-1 && -2+arg1P_14<=1+arg1P_1 && -2+arg2P_14<=1+arg1P_1 && -2+arg1P_14<=2+arg2P_1 && -2+arg2P_14<=2+arg2P_1 ], cost: 3+arg3P_8
     48: __init -> [8] : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, arg5'=arg5P_5, arg6'=arg6P_5, [ arg2P_18>-1 && 1+arg2P_1<=arg1P_18 && arg1P_18>0 && arg2P_1>-1 && arg3P_1>0 && arg1P_5<=arg2P_1+2*arg3P_1 && arg2P_5<=arg2P_1+2*arg3P_1 && arg2P_1+2*arg3P_1>-1 && arg1P_5>2 && arg2P_5>2 ], cost: NONTERM
     49: __init -> [8] : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, arg5'=arg5P_5, arg6'=arg6P_5, [ arg2P_18>-1 && arg1P_18>0 && arg3P_1>0 && arg1P_5<=3 && arg2P_5<=3 && arg1P_5>2 && arg2P_5>2 ], cost: NONTERM
     50: __init -> [10] : [ arg2P_18>-1 && 1+arg2P_1<=arg1P_18 && arg1P_18>0 && arg2P_1>-1 && arg3P_1>0 ], cost: 2+arg3P_1
     51: __init -> [10] : [ arg2P_18>-1 && arg1P_18>0 && arg3P_1>0 ], cost: 2+arg3P_1

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     43: __init -> [8] : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, arg5'=arg5P_5, arg6'=arg6P_5, [ arg2P_18>-1 && arg1P_1<=arg1P_18 && 1+arg2P_1<=arg1P_18 && arg1P_18>0 && arg1P_1>0 && arg2P_1>-1 && arg1P_5<=arg2P_1 && arg2P_5<=arg2P_1 && 0==arg3P_1 && arg1P_5>2 && arg2P_5>2 ], cost: NONTERM
     44: __init -> f2482_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=0, arg4'=arg4P_11, arg5'=arg5P_11, arg6'=arg6P_11, [ arg2P_18>-1 && arg1P_1<=arg1P_18 && 1+arg2P_1<=arg1P_18 && arg1P_18>0 && arg1P_1>0 && arg2P_1>-1 && arg3P_8>0 && arg3P_1>0 && arg1P_11>0 && arg2P_11>1 && arg4P_11>-1 ], cost: 3+arg3P_8
     45: __init -> f2482_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=0, arg4'=arg4P_12, arg5'=arg5P_12, arg6'=arg6P_12, [ arg2P_18>-1 && arg1P_1<=arg1P_18 && 1+arg2P_1<=arg1P_18 && arg1P_18>0 && arg1P_1>0 && arg2P_1>-1 && arg3P_8>0 && arg3P_1>0 && arg1P_12>0 && arg2P_12>1 && arg4P_12>-1 ], cost: 3+arg3P_8
     46: __init -> f2482_0_createTree_LE : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=0, arg4'=arg4P_13, arg5'=arg5P_13, arg6'=arg6P_13, [ arg2P_18>-1 && arg1P_1<=arg1P_18 && 1+arg2P_1<=arg1P_18 && arg1P_18>0 && arg1P_1>0 && arg2P_1>-1 && arg3P_8>0 && arg3P_1>0 && arg1P_13>3 && arg2P_13>3 && -2+arg2P_13<=arg1P_13 && -2+arg1P_13<=arg2P_13 && arg4P_13>-1 && -2+arg1P_13<=1+arg1P_1 && -2+arg2P_13<=1+arg1P_1 && -2+arg1P_13<=2+arg2P_1 && -2+arg2P_13<=2+arg2P_1 ], cost: 3+arg3P_8
     47: __init -> f2482_0_createTree_LE : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=0, arg4'=arg4P_14, arg5'=arg5P_14, arg6'=arg6P_14, [ arg2P_18>-1 && arg1P_1<=arg1P_18 && 1+arg2P_1<=arg1P_18 && arg1P_18>0 && arg1P_1>0 && arg2P_1>-1 && arg3P_8>0 && arg3P_1>0 && arg1P_14>3 && arg2P_14>3 && -2+arg2P_14<=arg1P_14 && -2+arg1P_14<=arg2P_14 && arg4P_14>-1 && -2+arg1P_14<=1+arg1P_1 && -2+arg2P_14<=1+arg1P_1 && -2+arg1P_14<=2+arg2P_1 && -2+arg2P_14<=2+arg2P_1 ], cost: 3+arg3P_8
     48: __init -> [8] : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, arg5'=arg5P_5, arg6'=arg6P_5, [ arg2P_18>-1 && 1+arg2P_1<=arg1P_18 && arg1P_18>0 && arg2P_1>-1 && arg3P_1>0 && arg1P_5<=arg2P_1+2*arg3P_1 && arg2P_5<=arg2P_1+2*arg3P_1 && arg2P_1+2*arg3P_1>-1 && arg1P_5>2 && arg2P_5>2 ], cost: NONTERM
     49: __init -> [8] : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, arg5'=arg5P_5, arg6'=arg6P_5, [ arg2P_18>-1 && arg1P_18>0 && arg3P_1>0 && arg1P_5<=3 && arg2P_5<=3 && arg1P_5>2 && arg2P_5>2 ], cost: NONTERM
     50: __init -> [10] : [ arg2P_18>-1 && 1+arg2P_1<=arg1P_18 && arg1P_18>0 && arg2P_1>-1 && arg3P_1>0 ], cost: 2+arg3P_1
     51: __init -> [10] : [ arg2P_18>-1 && arg1P_18>0 && arg3P_1>0 ], cost: 2+arg3P_1

Computing asymptotic complexity for rule 43
   Simplified the guard:
     43: __init -> [8] : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, arg5'=arg5P_5, arg6'=arg6P_5, [ arg2P_18>-1 && arg1P_1<=arg1P_18 && 1+arg2P_1<=arg1P_18 && arg1P_18>0 && arg1P_1>0 && arg1P_5<=arg2P_1 && arg2P_5<=arg2P_1 && 0==arg3P_1 && arg1P_5>2 && arg2P_5>2 ], cost: NONTERM
   Guard is satisfiable, yielding nontermination
   Resulting cost NONTERM has complexity: Nonterm

Found new complexity Nonterm.

Obtained the following overall complexity (w.r.t. the length of the input n):
   Complexity:  Nonterm
   Cpx degree:  Nonterm
   Solved cost: NONTERM
   Rule cost:   NONTERM
   Rule guard:  [ arg2P_18>-1 && arg1P_1<=arg1P_18 && 1+arg2P_1<=arg1P_18 && arg1P_18>0 && arg1P_1>0 && arg1P_5<=arg2P_1 && arg2P_5<=arg2P_1 && 0==arg3P_1 && arg1P_5>2 && arg2P_5>2 ]

NO