NO

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

[test] deduced pseudo-invariant -3+arg1<=0, also trying 3-arg1<=-1
[test] deduced pseudo-invariant arg2-arg1P_2-arg2P_2+arg1<=0, also trying -arg2+arg1P_2+arg2P_2-arg1<=-1
   Accelerated rule 1 with backward acceleration, yielding the new rule 15.
   Accelerated rule 1 with backward acceleration, yielding the new rule 16.
[test] deduced pseudo-invariant -arg2P_6+arg2<=0, also trying arg2P_6-arg2<=-1
   Accelerated rule 5 with backward acceleration, yielding the new rule 17.
[accelerate] Nesting with 3 inner and 2 outer candidates

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

   Failed to prove monotonicity of the guard of rule 3.
   Accelerated rule 4 with non-termination, yielding the new rule 18.
[accelerate] Nesting with 1 inner and 1 outer candidates
   Removing the simple loops: 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

   Failed to prove monotonicity of the guard of rule 8.
   Failed to prove monotonicity of the guard of rule 9.
   Accelerated rule 10 with backward acceleration, yielding the new rule 19.
   Accelerated rule 11 with backward acceleration, yielding the new rule 20.
   Failed to prove monotonicity of the guard of rule 12.
[test] deduced pseudo-invariant 8+arg2-67*arg1P_14-7*arg2P_14+67*arg1<=0, also trying -8-arg2+67*arg1P_14+7*arg2P_14-67*arg1<=-1
[test] deduced pseudo-invariant arg2-arg2P_14<=0, also trying -arg2+arg2P_14<=-1
   Failed to prove monotonicity of the guard of rule 13.
[accelerate] Nesting with 6 inner and 6 outer candidates
   Nested simple loops 10 (outer loop) and 12 (inner loop) with Rule(4 | arg4>-1, arg1>2, arg2>2, arg1P_11>2, arg2P_11>2, k_16>=1, 1+arg3-2*k_16>0, | 2*k_16 || 4 | 0=arg1P_11, 1=arg2P_11, 2=arg3-2*k_16, 3=2*k_16+arg4, 4=arg5P_11, 5=arg6P_11, ), resulting in the new rules: 21, 22.
   Nested simple loops 11 (outer loop) and 12 (inner loop) with Rule(4 | arg4>-1, arg1>2, arg2>2, arg1P_12>2, arg2P_12>2, k_17>=1, 1-2*k_17+arg3>0, | 2*k_17 || 4 | 0=arg1P_12, 1=arg2P_12, 2=-2*k_17+arg3, 3=2*k_17+arg4, 4=arg5P_12, 5=arg6P_12, ), resulting in the new rules: 23, 24.
   Nested simple loops 10 (outer loop) and 13 (inner loop) with Rule(4 | arg4>-1, arg1>2, arg2>2, arg1P_11>2, arg2P_11>2, k_18>=1, 1+arg3-2*k_18>0, | 2*k_18 || 4 | 0=arg1P_11, 1=arg2P_11, 2=arg3-2*k_18, 3=2*k_18+arg4, 4=arg5P_11, 5=arg6P_11, ), resulting in the new rules: 25, 26.
   Nested simple loops 11 (outer loop) and 13 (inner loop) with Rule(4 | arg4>-1, arg1>2, arg2>2, arg1P_12>2, arg2P_12>2, k_19>=1, 1-2*k_19+arg3>0, | 2*k_19 || 4 | 0=arg1P_12, 1=arg2P_12, 2=-2*k_19+arg3, 3=2*k_19+arg4, 4=arg5P_12, 5=arg6P_12, ), resulting in the new rules: 27, 28.
   Removing the simple loops: 10 11.

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
      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
     15: f811_0_main_LE -> f811_0_main_LE : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=0, arg4'=arg4P_2, arg5'=arg5P_2, arg6'=arg6P_2, [ arg1>=arg1P_2 && arg2>=-1+arg1P_2 && arg2>=-2+arg2P_2 && arg1>0 && arg2>-1 && arg1P_2>0 && arg2P_2>1 && -3+arg1<=0 && arg3>=1 ], cost: arg3
     16: f811_0_main_LE -> f811_0_main_LE : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=0, arg4'=arg4P_2, arg5'=arg5P_2, arg6'=arg6P_2, [ arg1>=arg1P_2 && arg2>=-1+arg1P_2 && arg2>=-2+arg2P_2 && arg1>0 && arg2>-1 && arg2P_2>1 && arg2-arg1P_2-arg2P_2+arg1<=0 && arg3>=1 && 3-arg1P_2<=-1 ], cost: arg3
     17: f811_0_main_LE -> f811_0_main_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=0, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg1P_6<=arg1 && -1+arg1P_6<=arg2 && arg1>0 && arg2>-1 && arg1P_6>0 && arg2P_6>4 && -arg2P_6+arg2<=0 && arg3>=1 ], cost: arg3
      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
     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
     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
     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, [ arg4>-1 && arg1>2 && arg2>1 && arg1P_11>2 && arg2P_11>2 && arg3>=1 ], 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 && arg1>2 && arg2>1 && arg1P_12>2 && arg2P_12>2 && arg3>=1 ], cost: arg3
     21: f2226_0_createTree_LE -> f2226_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3-2*k_16, arg4'=2*k_16+arg4, arg5'=arg5P_11, arg6'=arg6P_11, [ arg4>-1 && arg1>2 && arg2>2 && arg1P_11>2 && arg2P_11>2 && k_16>=1 && 1+arg3-2*k_16>0 ], cost: 2*k_16
     22: f2226_0_createTree_LE -> f2226_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=-1+arg3-2*k_16, arg4'=1+2*k_16+arg4, arg5'=arg5P_11, arg6'=arg6P_11, [ arg3>0 && arg4>-1 && arg1>2 && arg2>1 && arg1P_11>2 && arg2P_11>2 && k_16>=1 && arg3-2*k_16>0 ], cost: 1+2*k_16
     23: f2226_0_createTree_LE -> f2226_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=-2*k_17+arg3, arg4'=2*k_17+arg4, arg5'=arg5P_12, arg6'=arg6P_12, [ arg4>-1 && arg1>2 && arg2>2 && arg1P_12>2 && arg2P_12>2 && k_17>=1 && 1-2*k_17+arg3>0 ], cost: 2*k_17
     24: f2226_0_createTree_LE -> f2226_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=-1-2*k_17+arg3, arg4'=1+2*k_17+arg4, arg5'=arg5P_12, arg6'=arg6P_12, [ arg4>-1 && arg3>0 && arg1>2 && arg2>1 && arg1P_12>2 && arg2P_12>2 && k_17>=1 && -2*k_17+arg3>0 ], cost: 1+2*k_17
     25: f2226_0_createTree_LE -> f2226_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3-2*k_18, arg4'=2*k_18+arg4, arg5'=arg5P_11, arg6'=arg6P_11, [ arg4>-1 && arg1>2 && arg2>2 && arg1P_11>2 && arg2P_11>2 && k_18>=1 && 1+arg3-2*k_18>0 ], cost: 2*k_18
     26: f2226_0_createTree_LE -> f2226_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=-1+arg3-2*k_18, arg4'=1+2*k_18+arg4, arg5'=arg5P_11, arg6'=arg6P_11, [ arg3>0 && arg4>-1 && arg1>2 && arg2>1 && arg1P_11>2 && arg2P_11>2 && k_18>=1 && arg3-2*k_18>0 ], cost: 1+2*k_18
     27: f2226_0_createTree_LE -> f2226_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=-2*k_19+arg3, arg4'=2*k_19+arg4, arg5'=arg5P_12, arg6'=arg6P_12, [ arg4>-1 && arg1>2 && arg2>2 && arg1P_12>2 && arg2P_12>2 && k_19>=1 && 1-2*k_19+arg3>0 ], cost: 2*k_19
     28: f2226_0_createTree_LE -> f2226_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=-1-2*k_19+arg3, arg4'=1+2*k_19+arg4, arg5'=arg5P_12, arg6'=arg6P_12, [ arg4>-1 && arg3>0 && arg1>2 && arg2>1 && arg1P_12>2 && arg2P_12>2 && k_19>=1 && -2*k_19+arg3>0 ], cost: 1+2*k_19
     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
     29: f1_0_main_Load -> f811_0_main_LE : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=-1+arg3P_1, arg4'=arg4P_2, arg5'=arg5P_2, arg6'=arg6P_2, [ arg2>-1 && arg1>0 && arg3P_1>0 && arg1P_2>0 && arg2P_2>1 && -1+arg1P_2<=-1+arg1 && -2+arg2P_2<=-1+arg1 ], cost: 2
     30: f1_0_main_Load -> f811_0_main_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=-1+arg3P_1, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg2>-1 && arg1>0 && arg3P_1>0 && arg1P_6>0 && arg2P_6>4 && -1+arg1P_6<=-1+arg1 ], cost: 2
     31: f1_0_main_Load -> f811_0_main_LE : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=0, arg4'=arg4P_2, arg5'=arg5P_2, arg6'=arg6P_2, [ arg2>-1 && arg1>0 && arg1P_2>0 && arg2P_2>1 && arg3P_1>=1 && -1+arg1P_2<=-1+arg1 && -2+arg2P_2<=-1+arg1 && arg1P_2<=3 ], cost: 1+arg3P_1
     32: f1_0_main_Load -> f811_0_main_LE : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=0, arg4'=arg4P_2, arg5'=arg5P_2, arg6'=arg6P_2, [ arg2>-1 && arg1>0 && arg2P_2>1 && arg3P_1>=1 && 3-arg1P_2<=-1 && -1+arg1P_2<=-1+arg1 && -2+arg2P_2<=-1+arg1 && 1<=arg1P_2+arg2P_2 && arg1P_2<=1+arg2P_2 ], cost: 1+arg3P_1
     33: f1_0_main_Load -> f811_0_main_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=0, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg2>-1 && arg1>0 && arg1P_6>0 && arg2P_6>4 && arg3P_1>=1 && -1+arg1P_6<=-1+arg1 && -1+arg1P_6<=arg2P_6 ], 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
     34: f811_0_main_LE -> f1404_0_flatten_NULL : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, arg5'=arg5P_4, arg6'=arg6P_4, [ arg1>0 && 0==arg3 && arg1P_4>-1 && 2+arg1P_4<=arg2 && 2<=arg2 ], cost: 2
     35: f811_0_main_LE -> [7] : [ arg1>0 && 0==arg3 && 3<=arg2 ], cost: NONTERM
     36: 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
     37: 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
     38: f811_0_main_LE -> f2226_0_createTree_LE : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=-1+arg3P_8, arg4'=2+arg4, arg5'=arg5P_13, arg6'=arg6P_13, [ arg3P_8>0 && arg3>0 && arg4>-1 && arg1>0 && arg2>-1 && arg1P_13>4 && arg2P_13>4 && -2+arg1P_13<=2+arg1 && -2+arg2P_13<=2+arg1 && -2+arg1P_13<=3+arg2 && -2+arg2P_13<=3+arg2 ], cost: 2
     39: f811_0_main_LE -> f2226_0_createTree_LE : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=-1+arg3P_8, arg4'=2+arg4, arg5'=arg5P_14, arg6'=arg6P_14, [ arg3P_8>0 && arg3>0 && arg4>-1 && arg1>0 && arg2>-1 && arg1P_14>4 && arg2P_14>4 && -2+arg1P_14<=2+arg1 && -2+arg2P_14<=2+arg1 && -2+arg1P_14<=3+arg2 && -2+arg2P_14<=3+arg2 ], cost: 2
     40: f811_0_main_LE -> f2226_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=0, arg4'=1+arg3P_8+arg4, 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
     41: f811_0_main_LE -> f2226_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=0, arg4'=1+arg3P_8+arg4, 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
     42: f811_0_main_LE -> f2226_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_8-2*k_16, arg4'=1+2*k_16+arg4, arg5'=arg5P_11, arg6'=arg6P_11, [ arg3P_8>0 && arg3>0 && arg4>-1 && arg1>0 && arg2>-1 && arg1P_11>2 && arg2P_11>2 && k_16>=1 && 1+arg3P_8-2*k_16>0 ], cost: 1+2*k_16
     43: f811_0_main_LE -> f2226_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=-1+arg3P_8-2*k_16, arg4'=2+2*k_16+arg4, arg5'=arg5P_11, arg6'=arg6P_11, [ arg3P_8>0 && arg3>0 && arg4>-1 && arg1>0 && arg2>-1 && arg1P_11>2 && arg2P_11>2 && k_16>=1 && arg3P_8-2*k_16>0 ], cost: 2+2*k_16
     44: f811_0_main_LE -> f2226_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=-2*k_17+arg3P_8, arg4'=1+2*k_17+arg4, arg5'=arg5P_12, arg6'=arg6P_12, [ arg3P_8>0 && arg3>0 && arg4>-1 && arg1>0 && arg2>-1 && arg1P_12>2 && arg2P_12>2 && k_17>=1 && 1-2*k_17+arg3P_8>0 ], cost: 1+2*k_17
     45: f811_0_main_LE -> f2226_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=-1-2*k_17+arg3P_8, arg4'=2+2*k_17+arg4, arg5'=arg5P_12, arg6'=arg6P_12, [ arg3P_8>0 && arg3>0 && arg4>-1 && arg1>0 && arg2>-1 && arg1P_12>2 && arg2P_12>2 && k_17>=1 && -2*k_17+arg3P_8>0 ], cost: 2+2*k_17
     46: f811_0_main_LE -> f2226_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_8-2*k_18, arg4'=1+2*k_18+arg4, arg5'=arg5P_11, arg6'=arg6P_11, [ arg3P_8>0 && arg3>0 && arg4>-1 && arg1>0 && arg2>-1 && arg1P_11>2 && arg2P_11>2 && k_18>=1 && 1+arg3P_8-2*k_18>0 ], cost: 1+2*k_18
     47: f811_0_main_LE -> f2226_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=-1+arg3P_8-2*k_18, arg4'=2+2*k_18+arg4, arg5'=arg5P_11, arg6'=arg6P_11, [ arg3P_8>0 && arg3>0 && arg4>-1 && arg1>0 && arg2>-1 && arg1P_11>2 && arg2P_11>2 && k_18>=1 && arg3P_8-2*k_18>0 ], cost: 2+2*k_18
     48: f811_0_main_LE -> f2226_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=-2*k_19+arg3P_8, arg4'=1+2*k_19+arg4, arg5'=arg5P_12, arg6'=arg6P_12, [ arg3P_8>0 && arg3>0 && arg4>-1 && arg1>0 && arg2>-1 && arg1P_12>2 && arg2P_12>2 && k_19>=1 && 1-2*k_19+arg3P_8>0 ], cost: 1+2*k_19
     49: f811_0_main_LE -> f2226_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=-1-2*k_19+arg3P_8, arg4'=2+2*k_19+arg4, arg5'=arg5P_12, arg6'=arg6P_12, [ arg3P_8>0 && arg3>0 && arg4>-1 && arg1>0 && arg2>-1 && arg1P_12>2 && arg2P_12>2 && k_19>=1 && -2*k_19+arg3P_8>0 ], cost: 2+2*k_19
     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
     29: f1_0_main_Load -> f811_0_main_LE : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=-1+arg3P_1, arg4'=arg4P_2, arg5'=arg5P_2, arg6'=arg6P_2, [ arg2>-1 && arg1>0 && arg3P_1>0 && arg1P_2>0 && arg2P_2>1 && -1+arg1P_2<=-1+arg1 && -2+arg2P_2<=-1+arg1 ], cost: 2
     30: f1_0_main_Load -> f811_0_main_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=-1+arg3P_1, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg2>-1 && arg1>0 && arg3P_1>0 && arg1P_6>0 && arg2P_6>4 && -1+arg1P_6<=-1+arg1 ], cost: 2
     31: f1_0_main_Load -> f811_0_main_LE : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=0, arg4'=arg4P_2, arg5'=arg5P_2, arg6'=arg6P_2, [ arg2>-1 && arg1>0 && arg1P_2>0 && arg2P_2>1 && arg3P_1>=1 && -1+arg1P_2<=-1+arg1 && -2+arg2P_2<=-1+arg1 && arg1P_2<=3 ], cost: 1+arg3P_1
     32: f1_0_main_Load -> f811_0_main_LE : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=0, arg4'=arg4P_2, arg5'=arg5P_2, arg6'=arg6P_2, [ arg2>-1 && arg1>0 && arg2P_2>1 && arg3P_1>=1 && 3-arg1P_2<=-1 && -1+arg1P_2<=-1+arg1 && -2+arg2P_2<=-1+arg1 && 1<=arg1P_2+arg2P_2 && arg1P_2<=1+arg2P_2 ], cost: 1+arg3P_1
     33: f1_0_main_Load -> f811_0_main_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=0, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg2>-1 && arg1>0 && arg1P_6>0 && arg2P_6>4 && arg3P_1>=1 && -1+arg1P_6<=-1+arg1 && -1+arg1P_6<=arg2P_6 ], cost: 1+arg3P_1
     35: f811_0_main_LE -> [7] : [ arg1>0 && 0==arg3 && 3<=arg2 ], cost: NONTERM
     40: f811_0_main_LE -> f2226_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=0, arg4'=1+arg3P_8+arg4, 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
     41: f811_0_main_LE -> f2226_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=0, arg4'=1+arg3P_8+arg4, 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
     42: f811_0_main_LE -> f2226_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_8-2*k_16, arg4'=1+2*k_16+arg4, arg5'=arg5P_11, arg6'=arg6P_11, [ arg3P_8>0 && arg3>0 && arg4>-1 && arg1>0 && arg2>-1 && arg1P_11>2 && arg2P_11>2 && k_16>=1 && 1+arg3P_8-2*k_16>0 ], cost: 1+2*k_16
     43: f811_0_main_LE -> f2226_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=-1+arg3P_8-2*k_16, arg4'=2+2*k_16+arg4, arg5'=arg5P_11, arg6'=arg6P_11, [ arg3P_8>0 && arg3>0 && arg4>-1 && arg1>0 && arg2>-1 && arg1P_11>2 && arg2P_11>2 && k_16>=1 && arg3P_8-2*k_16>0 ], cost: 2+2*k_16
     44: f811_0_main_LE -> f2226_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=-2*k_17+arg3P_8, arg4'=1+2*k_17+arg4, arg5'=arg5P_12, arg6'=arg6P_12, [ arg3P_8>0 && arg3>0 && arg4>-1 && arg1>0 && arg2>-1 && arg1P_12>2 && arg2P_12>2 && k_17>=1 && 1-2*k_17+arg3P_8>0 ], cost: 1+2*k_17
     45: f811_0_main_LE -> f2226_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=-1-2*k_17+arg3P_8, arg4'=2+2*k_17+arg4, arg5'=arg5P_12, arg6'=arg6P_12, [ arg3P_8>0 && arg3>0 && arg4>-1 && arg1>0 && arg2>-1 && arg1P_12>2 && arg2P_12>2 && k_17>=1 && -2*k_17+arg3P_8>0 ], cost: 2+2*k_17
     46: f811_0_main_LE -> f2226_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_8-2*k_18, arg4'=1+2*k_18+arg4, arg5'=arg5P_11, arg6'=arg6P_11, [ arg3P_8>0 && arg3>0 && arg4>-1 && arg1>0 && arg2>-1 && arg1P_11>2 && arg2P_11>2 && k_18>=1 && 1+arg3P_8-2*k_18>0 ], cost: 1+2*k_18
     47: f811_0_main_LE -> f2226_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=-1+arg3P_8-2*k_18, arg4'=2+2*k_18+arg4, arg5'=arg5P_11, arg6'=arg6P_11, [ arg3P_8>0 && arg3>0 && arg4>-1 && arg1>0 && arg2>-1 && arg1P_11>2 && arg2P_11>2 && k_18>=1 && arg3P_8-2*k_18>0 ], cost: 2+2*k_18
     48: f811_0_main_LE -> f2226_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=-2*k_19+arg3P_8, arg4'=1+2*k_19+arg4, arg5'=arg5P_12, arg6'=arg6P_12, [ arg3P_8>0 && arg3>0 && arg4>-1 && arg1>0 && arg2>-1 && arg1P_12>2 && arg2P_12>2 && k_19>=1 && 1-2*k_19+arg3P_8>0 ], cost: 1+2*k_19
     49: f811_0_main_LE -> f2226_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=-1-2*k_19+arg3P_8, arg4'=2+2*k_19+arg4, arg5'=arg5P_12, arg6'=arg6P_12, [ arg3P_8>0 && arg3>0 && arg4>-1 && arg1>0 && arg2>-1 && arg1P_12>2 && arg2P_12>2 && k_19>=1 && -2*k_19+arg3P_8>0 ], cost: 2+2*k_19
     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
     35: f811_0_main_LE -> [7] : [ arg1>0 && 0==arg3 && 3<=arg2 ], cost: NONTERM
     40: f811_0_main_LE -> f2226_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=0, arg4'=1+arg3P_8+arg4, 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
     41: f811_0_main_LE -> f2226_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=0, arg4'=1+arg3P_8+arg4, 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
     42: f811_0_main_LE -> f2226_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_8-2*k_16, arg4'=1+2*k_16+arg4, arg5'=arg5P_11, arg6'=arg6P_11, [ arg3P_8>0 && arg3>0 && arg4>-1 && arg1>0 && arg2>-1 && arg1P_11>2 && arg2P_11>2 && k_16>=1 && 1+arg3P_8-2*k_16>0 ], cost: 1+2*k_16
     43: f811_0_main_LE -> f2226_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=-1+arg3P_8-2*k_16, arg4'=2+2*k_16+arg4, arg5'=arg5P_11, arg6'=arg6P_11, [ arg3P_8>0 && arg3>0 && arg4>-1 && arg1>0 && arg2>-1 && arg1P_11>2 && arg2P_11>2 && k_16>=1 && arg3P_8-2*k_16>0 ], cost: 2+2*k_16
     44: f811_0_main_LE -> f2226_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=-2*k_17+arg3P_8, arg4'=1+2*k_17+arg4, arg5'=arg5P_12, arg6'=arg6P_12, [ arg3P_8>0 && arg3>0 && arg4>-1 && arg1>0 && arg2>-1 && arg1P_12>2 && arg2P_12>2 && k_17>=1 && 1-2*k_17+arg3P_8>0 ], cost: 1+2*k_17
     45: f811_0_main_LE -> f2226_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=-1-2*k_17+arg3P_8, arg4'=2+2*k_17+arg4, arg5'=arg5P_12, arg6'=arg6P_12, [ arg3P_8>0 && arg3>0 && arg4>-1 && arg1>0 && arg2>-1 && arg1P_12>2 && arg2P_12>2 && k_17>=1 && -2*k_17+arg3P_8>0 ], cost: 2+2*k_17
     46: f811_0_main_LE -> f2226_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_8-2*k_18, arg4'=1+2*k_18+arg4, arg5'=arg5P_11, arg6'=arg6P_11, [ arg3P_8>0 && arg3>0 && arg4>-1 && arg1>0 && arg2>-1 && arg1P_11>2 && arg2P_11>2 && k_18>=1 && 1+arg3P_8-2*k_18>0 ], cost: 1+2*k_18
     47: f811_0_main_LE -> f2226_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=-1+arg3P_8-2*k_18, arg4'=2+2*k_18+arg4, arg5'=arg5P_11, arg6'=arg6P_11, [ arg3P_8>0 && arg3>0 && arg4>-1 && arg1>0 && arg2>-1 && arg1P_11>2 && arg2P_11>2 && k_18>=1 && arg3P_8-2*k_18>0 ], cost: 2+2*k_18
     48: f811_0_main_LE -> f2226_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=-2*k_19+arg3P_8, arg4'=1+2*k_19+arg4, arg5'=arg5P_12, arg6'=arg6P_12, [ arg3P_8>0 && arg3>0 && arg4>-1 && arg1>0 && arg2>-1 && arg1P_12>2 && arg2P_12>2 && k_19>=1 && 1-2*k_19+arg3P_8>0 ], cost: 1+2*k_19
     49: f811_0_main_LE -> f2226_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=-1-2*k_19+arg3P_8, arg4'=2+2*k_19+arg4, arg5'=arg5P_12, arg6'=arg6P_12, [ arg3P_8>0 && arg3>0 && arg4>-1 && arg1>0 && arg2>-1 && arg1P_12>2 && arg2P_12>2 && k_19>=1 && -2*k_19+arg3P_8>0 ], cost: 2+2*k_19
     50: __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
     51: __init -> f811_0_main_LE : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=-1+arg3P_1, arg4'=arg4P_2, arg5'=arg5P_2, arg6'=arg6P_2, [ arg2P_15>-1 && arg1P_15>0 && arg3P_1>0 && arg1P_2>0 && arg2P_2>1 && -1+arg1P_2<=-1+arg1P_15 && -2+arg2P_2<=-1+arg1P_15 ], cost: 3
     52: __init -> f811_0_main_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=-1+arg3P_1, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg2P_15>-1 && arg1P_15>0 && arg3P_1>0 && arg1P_6>0 && arg2P_6>4 && -1+arg1P_6<=-1+arg1P_15 ], cost: 3
     53: __init -> f811_0_main_LE : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=0, arg4'=arg4P_2, arg5'=arg5P_2, arg6'=arg6P_2, [ arg2P_15>-1 && arg1P_15>0 && arg1P_2>0 && arg2P_2>1 && arg3P_1>=1 && -1+arg1P_2<=-1+arg1P_15 && -2+arg2P_2<=-1+arg1P_15 && arg1P_2<=3 ], cost: 2+arg3P_1
     54: __init -> f811_0_main_LE : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=0, arg4'=arg4P_2, arg5'=arg5P_2, arg6'=arg6P_2, [ arg2P_15>-1 && arg1P_15>0 && arg2P_2>1 && arg3P_1>=1 && 3-arg1P_2<=-1 && -1+arg1P_2<=-1+arg1P_15 && -2+arg2P_2<=-1+arg1P_15 && 1<=arg1P_2+arg2P_2 && arg1P_2<=1+arg2P_2 ], cost: 2+arg3P_1
     55: __init -> f811_0_main_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=0, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg2P_15>-1 && arg1P_15>0 && arg1P_6>0 && arg2P_6>4 && arg3P_1>=1 && -1+arg1P_6<=-1+arg1P_15 && -1+arg1P_6<=arg2P_6 ], cost: 2+arg3P_1

Applied pruning (of leafs and parallel rules):
   Start location: __init
     35: f811_0_main_LE -> [7] : [ arg1>0 && 0==arg3 && 3<=arg2 ], cost: NONTERM
     43: f811_0_main_LE -> f2226_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=-1+arg3P_8-2*k_16, arg4'=2+2*k_16+arg4, arg5'=arg5P_11, arg6'=arg6P_11, [ arg3P_8>0 && arg3>0 && arg4>-1 && arg1>0 && arg2>-1 && arg1P_11>2 && arg2P_11>2 && k_16>=1 && arg3P_8-2*k_16>0 ], cost: 2+2*k_16
     44: f811_0_main_LE -> f2226_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=-2*k_17+arg3P_8, arg4'=1+2*k_17+arg4, arg5'=arg5P_12, arg6'=arg6P_12, [ arg3P_8>0 && arg3>0 && arg4>-1 && arg1>0 && arg2>-1 && arg1P_12>2 && arg2P_12>2 && k_17>=1 && 1-2*k_17+arg3P_8>0 ], cost: 1+2*k_17
     45: f811_0_main_LE -> f2226_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=-1-2*k_17+arg3P_8, arg4'=2+2*k_17+arg4, arg5'=arg5P_12, arg6'=arg6P_12, [ arg3P_8>0 && arg3>0 && arg4>-1 && arg1>0 && arg2>-1 && arg1P_12>2 && arg2P_12>2 && k_17>=1 && -2*k_17+arg3P_8>0 ], cost: 2+2*k_17
     47: f811_0_main_LE -> f2226_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=-1+arg3P_8-2*k_18, arg4'=2+2*k_18+arg4, arg5'=arg5P_11, arg6'=arg6P_11, [ arg3P_8>0 && arg3>0 && arg4>-1 && arg1>0 && arg2>-1 && arg1P_11>2 && arg2P_11>2 && k_18>=1 && arg3P_8-2*k_18>0 ], cost: 2+2*k_18
     49: f811_0_main_LE -> f2226_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=-1-2*k_19+arg3P_8, arg4'=2+2*k_19+arg4, arg5'=arg5P_12, arg6'=arg6P_12, [ arg3P_8>0 && arg3>0 && arg4>-1 && arg1>0 && arg2>-1 && arg1P_12>2 && arg2P_12>2 && k_19>=1 && -2*k_19+arg3P_8>0 ], cost: 2+2*k_19
     51: __init -> f811_0_main_LE : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=-1+arg3P_1, arg4'=arg4P_2, arg5'=arg5P_2, arg6'=arg6P_2, [ arg2P_15>-1 && arg1P_15>0 && arg3P_1>0 && arg1P_2>0 && arg2P_2>1 && -1+arg1P_2<=-1+arg1P_15 && -2+arg2P_2<=-1+arg1P_15 ], cost: 3
     52: __init -> f811_0_main_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=-1+arg3P_1, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg2P_15>-1 && arg1P_15>0 && arg3P_1>0 && arg1P_6>0 && arg2P_6>4 && -1+arg1P_6<=-1+arg1P_15 ], cost: 3
     53: __init -> f811_0_main_LE : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=0, arg4'=arg4P_2, arg5'=arg5P_2, arg6'=arg6P_2, [ arg2P_15>-1 && arg1P_15>0 && arg1P_2>0 && arg2P_2>1 && arg3P_1>=1 && -1+arg1P_2<=-1+arg1P_15 && -2+arg2P_2<=-1+arg1P_15 && arg1P_2<=3 ], cost: 2+arg3P_1
     54: __init -> f811_0_main_LE : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=0, arg4'=arg4P_2, arg5'=arg5P_2, arg6'=arg6P_2, [ arg2P_15>-1 && arg1P_15>0 && arg2P_2>1 && arg3P_1>=1 && 3-arg1P_2<=-1 && -1+arg1P_2<=-1+arg1P_15 && -2+arg2P_2<=-1+arg1P_15 && 1<=arg1P_2+arg2P_2 && arg1P_2<=1+arg2P_2 ], cost: 2+arg3P_1
     55: __init -> f811_0_main_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=0, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg2P_15>-1 && arg1P_15>0 && arg1P_6>0 && arg2P_6>4 && arg3P_1>=1 && -1+arg1P_6<=-1+arg1P_15 && -1+arg1P_6<=arg2P_6 ], cost: 2+arg3P_1

Eliminated locations (on tree-shaped paths):
   Start location: __init
     56: __init -> [7] : [ arg2P_15>-1 && arg1P_15>0 && arg1P_2>0 && -1+arg1P_2<=-1+arg1P_15 && -2+arg2P_2<=-1+arg1P_15 && 0==-1+arg3P_1 && 3<=arg2P_2 ], cost: NONTERM
     57: __init -> f2226_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=-1+arg3P_8-2*k_16, arg4'=2+arg4P_2+2*k_16, arg5'=arg5P_11, arg6'=arg6P_11, [ arg2P_15>-1 && arg1P_15>0 && arg1P_2>0 && arg2P_2>1 && -1+arg1P_2<=-1+arg1P_15 && -2+arg2P_2<=-1+arg1P_15 && arg3P_8>0 && -1+arg3P_1>0 && arg4P_2>-1 && arg1P_11>2 && arg2P_11>2 && k_16>=1 && arg3P_8-2*k_16>0 ], cost: 5+2*k_16
     58: __init -> f2226_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=-2*k_17+arg3P_8, arg4'=1+arg4P_2+2*k_17, arg5'=arg5P_12, arg6'=arg6P_12, [ arg2P_15>-1 && arg1P_15>0 && arg1P_2>0 && arg2P_2>1 && -1+arg1P_2<=-1+arg1P_15 && -2+arg2P_2<=-1+arg1P_15 && arg3P_8>0 && -1+arg3P_1>0 && arg4P_2>-1 && arg1P_12>2 && arg2P_12>2 && k_17>=1 && 1-2*k_17+arg3P_8>0 ], cost: 4+2*k_17
     59: __init -> f2226_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=-1-2*k_17+arg3P_8, arg4'=2+arg4P_2+2*k_17, arg5'=arg5P_12, arg6'=arg6P_12, [ arg2P_15>-1 && arg1P_15>0 && arg1P_2>0 && arg2P_2>1 && -1+arg1P_2<=-1+arg1P_15 && -2+arg2P_2<=-1+arg1P_15 && arg3P_8>0 && -1+arg3P_1>0 && arg4P_2>-1 && arg1P_12>2 && arg2P_12>2 && k_17>=1 && -2*k_17+arg3P_8>0 ], cost: 5+2*k_17
     60: __init -> f2226_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=-1+arg3P_8-2*k_18, arg4'=2+arg4P_2+2*k_18, arg5'=arg5P_11, arg6'=arg6P_11, [ arg2P_15>-1 && arg1P_15>0 && arg1P_2>0 && arg2P_2>1 && -1+arg1P_2<=-1+arg1P_15 && -2+arg2P_2<=-1+arg1P_15 && arg3P_8>0 && -1+arg3P_1>0 && arg4P_2>-1 && arg1P_11>2 && arg2P_11>2 && k_18>=1 && arg3P_8-2*k_18>0 ], cost: 5+2*k_18
     61: __init -> f2226_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=-1-2*k_19+arg3P_8, arg4'=2+arg4P_2+2*k_19, arg5'=arg5P_12, arg6'=arg6P_12, [ arg2P_15>-1 && arg1P_15>0 && arg1P_2>0 && arg2P_2>1 && -1+arg1P_2<=-1+arg1P_15 && -2+arg2P_2<=-1+arg1P_15 && arg3P_8>0 && -1+arg3P_1>0 && arg4P_2>-1 && arg1P_12>2 && arg2P_12>2 && k_19>=1 && -2*k_19+arg3P_8>0 ], cost: 5+2*k_19
     62: __init -> [7] : [ arg2P_15>-1 && arg1P_15>0 && arg1P_6>0 && arg2P_6>4 && -1+arg1P_6<=-1+arg1P_15 && 0==-1+arg3P_1 ], cost: NONTERM
     63: __init -> f2226_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=-1+arg3P_8-2*k_16, arg4'=2+2*k_16+arg4P_6, arg5'=arg5P_11, arg6'=arg6P_11, [ arg2P_15>-1 && arg1P_15>0 && arg1P_6>0 && arg2P_6>4 && -1+arg1P_6<=-1+arg1P_15 && arg3P_8>0 && -1+arg3P_1>0 && arg4P_6>-1 && arg1P_11>2 && arg2P_11>2 && k_16>=1 && arg3P_8-2*k_16>0 ], cost: 5+2*k_16
     64: __init -> f2226_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=-2*k_17+arg3P_8, arg4'=1+2*k_17+arg4P_6, arg5'=arg5P_12, arg6'=arg6P_12, [ arg2P_15>-1 && arg1P_15>0 && arg1P_6>0 && arg2P_6>4 && -1+arg1P_6<=-1+arg1P_15 && arg3P_8>0 && -1+arg3P_1>0 && arg4P_6>-1 && arg1P_12>2 && arg2P_12>2 && k_17>=1 && 1-2*k_17+arg3P_8>0 ], cost: 4+2*k_17
     65: __init -> f2226_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=-1-2*k_17+arg3P_8, arg4'=2+2*k_17+arg4P_6, arg5'=arg5P_12, arg6'=arg6P_12, [ arg2P_15>-1 && arg1P_15>0 && arg1P_6>0 && arg2P_6>4 && -1+arg1P_6<=-1+arg1P_15 && arg3P_8>0 && -1+arg3P_1>0 && arg4P_6>-1 && arg1P_12>2 && arg2P_12>2 && k_17>=1 && -2*k_17+arg3P_8>0 ], cost: 5+2*k_17
     66: __init -> f2226_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=-1+arg3P_8-2*k_18, arg4'=2+2*k_18+arg4P_6, arg5'=arg5P_11, arg6'=arg6P_11, [ arg2P_15>-1 && arg1P_15>0 && arg1P_6>0 && arg2P_6>4 && -1+arg1P_6<=-1+arg1P_15 && arg3P_8>0 && -1+arg3P_1>0 && arg4P_6>-1 && arg1P_11>2 && arg2P_11>2 && k_18>=1 && arg3P_8-2*k_18>0 ], cost: 5+2*k_18
     67: __init -> f2226_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=-1-2*k_19+arg3P_8, arg4'=2+2*k_19+arg4P_6, arg5'=arg5P_12, arg6'=arg6P_12, [ arg2P_15>-1 && arg1P_15>0 && arg1P_6>0 && arg2P_6>4 && -1+arg1P_6<=-1+arg1P_15 && arg3P_8>0 && -1+arg3P_1>0 && arg4P_6>-1 && arg1P_12>2 && arg2P_12>2 && k_19>=1 && -2*k_19+arg3P_8>0 ], cost: 5+2*k_19
     68: __init -> [7] : [ arg2P_15>-1 && arg1P_15>0 && arg1P_2>0 && arg3P_1>=1 && -1+arg1P_2<=-1+arg1P_15 && -2+arg2P_2<=-1+arg1P_15 && arg1P_2<=3 && 3<=arg2P_2 ], cost: NONTERM
     69: __init -> [7] : [ arg2P_15>-1 && arg1P_15>0 && arg3P_1>=1 && 3-arg1P_2<=-1 && -1+arg1P_2<=-1+arg1P_15 && -2+arg2P_2<=-1+arg1P_15 && 1<=arg1P_2+arg2P_2 && arg1P_2<=1+arg2P_2 && 3<=arg2P_2 ], cost: NONTERM
     70: __init -> [7] : [ arg2P_15>-1 && arg1P_15>0 && arg1P_6>0 && arg2P_6>4 && arg3P_1>=1 && -1+arg1P_6<=-1+arg1P_15 && -1+arg1P_6<=arg2P_6 ], cost: NONTERM
     71: __init -> [9] : [ arg2P_15>-1 && arg1P_15>0 && arg1P_2>0 && arg2P_2>1 && arg3P_1>=1 && -1+arg1P_2<=-1+arg1P_15 && -2+arg2P_2<=-1+arg1P_15 && arg1P_2<=3 ], cost: 2+arg3P_1
     72: __init -> [9] : [ arg2P_15>-1 && arg1P_15>0 && arg2P_2>1 && arg3P_1>=1 && 3-arg1P_2<=-1 && -1+arg1P_2<=-1+arg1P_15 && -2+arg2P_2<=-1+arg1P_15 && 1<=arg1P_2+arg2P_2 && arg1P_2<=1+arg2P_2 ], cost: 2+arg3P_1
     73: __init -> [9] : [ arg2P_15>-1 && arg1P_15>0 && arg1P_6>0 && arg2P_6>4 && arg3P_1>=1 && -1+arg1P_6<=-1+arg1P_15 && -1+arg1P_6<=arg2P_6 ], cost: 2+arg3P_1

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     56: __init -> [7] : [ arg2P_15>-1 && arg1P_15>0 && arg1P_2>0 && -1+arg1P_2<=-1+arg1P_15 && -2+arg2P_2<=-1+arg1P_15 && 0==-1+arg3P_1 && 3<=arg2P_2 ], cost: NONTERM
     57: __init -> f2226_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=-1+arg3P_8-2*k_16, arg4'=2+arg4P_2+2*k_16, arg5'=arg5P_11, arg6'=arg6P_11, [ arg2P_15>-1 && arg1P_15>0 && arg1P_2>0 && arg2P_2>1 && -1+arg1P_2<=-1+arg1P_15 && -2+arg2P_2<=-1+arg1P_15 && arg3P_8>0 && -1+arg3P_1>0 && arg4P_2>-1 && arg1P_11>2 && arg2P_11>2 && k_16>=1 && arg3P_8-2*k_16>0 ], cost: 5+2*k_16
     58: __init -> f2226_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=-2*k_17+arg3P_8, arg4'=1+arg4P_2+2*k_17, arg5'=arg5P_12, arg6'=arg6P_12, [ arg2P_15>-1 && arg1P_15>0 && arg1P_2>0 && arg2P_2>1 && -1+arg1P_2<=-1+arg1P_15 && -2+arg2P_2<=-1+arg1P_15 && arg3P_8>0 && -1+arg3P_1>0 && arg4P_2>-1 && arg1P_12>2 && arg2P_12>2 && k_17>=1 && 1-2*k_17+arg3P_8>0 ], cost: 4+2*k_17
     59: __init -> f2226_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=-1-2*k_17+arg3P_8, arg4'=2+arg4P_2+2*k_17, arg5'=arg5P_12, arg6'=arg6P_12, [ arg2P_15>-1 && arg1P_15>0 && arg1P_2>0 && arg2P_2>1 && -1+arg1P_2<=-1+arg1P_15 && -2+arg2P_2<=-1+arg1P_15 && arg3P_8>0 && -1+arg3P_1>0 && arg4P_2>-1 && arg1P_12>2 && arg2P_12>2 && k_17>=1 && -2*k_17+arg3P_8>0 ], cost: 5+2*k_17
     60: __init -> f2226_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=-1+arg3P_8-2*k_18, arg4'=2+arg4P_2+2*k_18, arg5'=arg5P_11, arg6'=arg6P_11, [ arg2P_15>-1 && arg1P_15>0 && arg1P_2>0 && arg2P_2>1 && -1+arg1P_2<=-1+arg1P_15 && -2+arg2P_2<=-1+arg1P_15 && arg3P_8>0 && -1+arg3P_1>0 && arg4P_2>-1 && arg1P_11>2 && arg2P_11>2 && k_18>=1 && arg3P_8-2*k_18>0 ], cost: 5+2*k_18
     61: __init -> f2226_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=-1-2*k_19+arg3P_8, arg4'=2+arg4P_2+2*k_19, arg5'=arg5P_12, arg6'=arg6P_12, [ arg2P_15>-1 && arg1P_15>0 && arg1P_2>0 && arg2P_2>1 && -1+arg1P_2<=-1+arg1P_15 && -2+arg2P_2<=-1+arg1P_15 && arg3P_8>0 && -1+arg3P_1>0 && arg4P_2>-1 && arg1P_12>2 && arg2P_12>2 && k_19>=1 && -2*k_19+arg3P_8>0 ], cost: 5+2*k_19
     62: __init -> [7] : [ arg2P_15>-1 && arg1P_15>0 && arg1P_6>0 && arg2P_6>4 && -1+arg1P_6<=-1+arg1P_15 && 0==-1+arg3P_1 ], cost: NONTERM
     63: __init -> f2226_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=-1+arg3P_8-2*k_16, arg4'=2+2*k_16+arg4P_6, arg5'=arg5P_11, arg6'=arg6P_11, [ arg2P_15>-1 && arg1P_15>0 && arg1P_6>0 && arg2P_6>4 && -1+arg1P_6<=-1+arg1P_15 && arg3P_8>0 && -1+arg3P_1>0 && arg4P_6>-1 && arg1P_11>2 && arg2P_11>2 && k_16>=1 && arg3P_8-2*k_16>0 ], cost: 5+2*k_16
     64: __init -> f2226_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=-2*k_17+arg3P_8, arg4'=1+2*k_17+arg4P_6, arg5'=arg5P_12, arg6'=arg6P_12, [ arg2P_15>-1 && arg1P_15>0 && arg1P_6>0 && arg2P_6>4 && -1+arg1P_6<=-1+arg1P_15 && arg3P_8>0 && -1+arg3P_1>0 && arg4P_6>-1 && arg1P_12>2 && arg2P_12>2 && k_17>=1 && 1-2*k_17+arg3P_8>0 ], cost: 4+2*k_17
     65: __init -> f2226_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=-1-2*k_17+arg3P_8, arg4'=2+2*k_17+arg4P_6, arg5'=arg5P_12, arg6'=arg6P_12, [ arg2P_15>-1 && arg1P_15>0 && arg1P_6>0 && arg2P_6>4 && -1+arg1P_6<=-1+arg1P_15 && arg3P_8>0 && -1+arg3P_1>0 && arg4P_6>-1 && arg1P_12>2 && arg2P_12>2 && k_17>=1 && -2*k_17+arg3P_8>0 ], cost: 5+2*k_17
     66: __init -> f2226_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=-1+arg3P_8-2*k_18, arg4'=2+2*k_18+arg4P_6, arg5'=arg5P_11, arg6'=arg6P_11, [ arg2P_15>-1 && arg1P_15>0 && arg1P_6>0 && arg2P_6>4 && -1+arg1P_6<=-1+arg1P_15 && arg3P_8>0 && -1+arg3P_1>0 && arg4P_6>-1 && arg1P_11>2 && arg2P_11>2 && k_18>=1 && arg3P_8-2*k_18>0 ], cost: 5+2*k_18
     67: __init -> f2226_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=-1-2*k_19+arg3P_8, arg4'=2+2*k_19+arg4P_6, arg5'=arg5P_12, arg6'=arg6P_12, [ arg2P_15>-1 && arg1P_15>0 && arg1P_6>0 && arg2P_6>4 && -1+arg1P_6<=-1+arg1P_15 && arg3P_8>0 && -1+arg3P_1>0 && arg4P_6>-1 && arg1P_12>2 && arg2P_12>2 && k_19>=1 && -2*k_19+arg3P_8>0 ], cost: 5+2*k_19
     68: __init -> [7] : [ arg2P_15>-1 && arg1P_15>0 && arg1P_2>0 && arg3P_1>=1 && -1+arg1P_2<=-1+arg1P_15 && -2+arg2P_2<=-1+arg1P_15 && arg1P_2<=3 && 3<=arg2P_2 ], cost: NONTERM
     69: __init -> [7] : [ arg2P_15>-1 && arg1P_15>0 && arg3P_1>=1 && 3-arg1P_2<=-1 && -1+arg1P_2<=-1+arg1P_15 && -2+arg2P_2<=-1+arg1P_15 && 1<=arg1P_2+arg2P_2 && arg1P_2<=1+arg2P_2 && 3<=arg2P_2 ], cost: NONTERM
     70: __init -> [7] : [ arg2P_15>-1 && arg1P_15>0 && arg1P_6>0 && arg2P_6>4 && arg3P_1>=1 && -1+arg1P_6<=-1+arg1P_15 && -1+arg1P_6<=arg2P_6 ], cost: NONTERM
     71: __init -> [9] : [ arg2P_15>-1 && arg1P_15>0 && arg1P_2>0 && arg2P_2>1 && arg3P_1>=1 && -1+arg1P_2<=-1+arg1P_15 && -2+arg2P_2<=-1+arg1P_15 && arg1P_2<=3 ], cost: 2+arg3P_1
     72: __init -> [9] : [ arg2P_15>-1 && arg1P_15>0 && arg2P_2>1 && arg3P_1>=1 && 3-arg1P_2<=-1 && -1+arg1P_2<=-1+arg1P_15 && -2+arg2P_2<=-1+arg1P_15 && 1<=arg1P_2+arg2P_2 && arg1P_2<=1+arg2P_2 ], cost: 2+arg3P_1
     73: __init -> [9] : [ arg2P_15>-1 && arg1P_15>0 && arg1P_6>0 && arg2P_6>4 && arg3P_1>=1 && -1+arg1P_6<=-1+arg1P_15 && -1+arg1P_6<=arg2P_6 ], cost: 2+arg3P_1

Computing asymptotic complexity for rule 62
   Simplified the guard:
     62: __init -> [7] : [ arg2P_15>-1 && arg1P_6>0 && arg2P_6>4 && -1+arg1P_6<=-1+arg1P_15 && 0==-1+arg3P_1 ], 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_15>-1 && arg1P_6>0 && arg2P_6>4 && -1+arg1P_6<=-1+arg1P_15 && 0==-1+arg3P_1 ]

NO