NO

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

Initial linear ITS problem
   Start location: __init
      0: f1_0_main_Load -> f2097_0_flatten_NULL : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, [ 1+arg1P_1<=arg1 && arg2>0 && arg1>0 && arg1P_1>-1 ], cost: 1
      1: f1_0_main_Load -> f1795_0_main_InvokeMethod : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1P_2<=arg1 && arg1>0 && arg1P_2>0 && arg2P_2>2 ], cost: 1
      4: f1_0_main_Load -> f1759_0_createTree_LE : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, [ arg3P_5>0 && arg2>-1 && -2+arg1P_5<=arg1 && -2+arg2P_5<=arg1 && arg1>0 && arg1P_5>2 && arg2P_5>2 && 1==arg4P_5 ], cost: 1
     11: f2097_0_flatten_NULL -> f2097_0_flatten_NULL : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg3P_12, arg4'=arg4P_12, [ 2+arg1P_12<=arg1 && arg1>1 && arg1P_12>-1 ], cost: 1
     12: f2097_0_flatten_NULL -> f2097_0_flatten_NULL : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [ -2+arg1P_13<=arg1 && arg1>2 && arg1P_13>2 ], cost: 1
      3: f1795_0_main_InvokeMethod -> f2097_0_flatten_NULL : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [ arg1P_4<=arg2 && x14_1>0 && arg1>0 && arg2>2 && arg1P_4>2 && 2+arg3<=arg2 ], cost: 1
      2: f456_0_createTree_Return -> f1795_0_main_InvokeMethod : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg1>=arg1P_3 && 2+arg1P_3<=arg2 && arg2P_3<=arg2 && arg1>0 && arg2>2 && arg1P_3>0 && arg2P_3>2 && 2+arg3<=arg2 && arg3==arg3P_3 ], cost: 1
      5: f1759_0_createTree_LE -> f1759_0_createTree_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [ arg4>-1 && arg3>0 && arg1P_6<=arg1 && 2+arg2P_6<=arg2 && arg1>2 && arg2>2 && arg1P_6>2 && arg2P_6>0 && -1+arg3==arg3P_6 && 1+arg4==arg4P_6 ], cost: 1
      6: f1759_0_createTree_LE -> f1759_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [ arg3>0 && x36_1>0 && arg4>-1 && arg1P_7<=arg1 && 2+arg2P_7<=arg2 && arg1>2 && arg2>2 && arg1P_7>2 && arg2P_7>0 && -1+arg3==arg3P_7 && 1+arg4==arg4P_7 ], cost: 1
      7: f1759_0_createTree_LE -> f1759_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [ arg3>0 && x43_1>0 && arg4>-1 && arg1>2 && arg2>1 && arg1P_8>2 && arg2P_8>2 && -1+arg3==arg3P_8 && 1+arg4==arg4P_8 ], cost: 1
      8: f1759_0_createTree_LE -> f1759_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ arg4>-1 && arg3>0 && arg1>2 && arg2>1 && arg1P_9>2 && arg2P_9>2 && -1+arg3==arg3P_9 && 1+arg4==arg4P_9 ], cost: 1
      9: f1759_0_createTree_LE -> f1759_0_createTree_LE : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [ arg4>-1 && arg3>0 && -2+arg1P_10<=arg1 && -2+arg1P_10<=arg2 && -2+arg2P_10<=arg1 && -2+arg2P_10<=arg2 && arg1>2 && arg2>2 && arg1P_10>4 && arg2P_10>4 && -1+arg3==arg3P_10 && 1+arg4==arg4P_10 ], cost: 1
     10: f1759_0_createTree_LE -> f1759_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, [ arg3>0 && x62_1>0 && arg4>-1 && -2+arg1P_11<=arg1 && -2+arg1P_11<=arg2 && -2+arg2P_11<=arg1 && -2+arg2P_11<=arg2 && arg1>2 && arg2>2 && arg1P_11>4 && arg2P_11>4 && -1+arg3==arg3P_11 && 1+arg4==arg4P_11 ], cost: 1
     13: __init -> f1_0_main_Load : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=arg3P_14, arg4'=arg4P_14, [], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
     13: __init -> f1_0_main_Load : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=arg3P_14, arg4'=arg4P_14, [], cost: 1

Removed unreachable and leaf rules:
   Start location: __init
      0: f1_0_main_Load -> f2097_0_flatten_NULL : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, [ 1+arg1P_1<=arg1 && arg2>0 && arg1>0 && arg1P_1>-1 ], cost: 1
      1: f1_0_main_Load -> f1795_0_main_InvokeMethod : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1P_2<=arg1 && arg1>0 && arg1P_2>0 && arg2P_2>2 ], cost: 1
      4: f1_0_main_Load -> f1759_0_createTree_LE : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, [ arg3P_5>0 && arg2>-1 && -2+arg1P_5<=arg1 && -2+arg2P_5<=arg1 && arg1>0 && arg1P_5>2 && arg2P_5>2 && 1==arg4P_5 ], cost: 1
     11: f2097_0_flatten_NULL -> f2097_0_flatten_NULL : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg3P_12, arg4'=arg4P_12, [ 2+arg1P_12<=arg1 && arg1>1 && arg1P_12>-1 ], cost: 1
     12: f2097_0_flatten_NULL -> f2097_0_flatten_NULL : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [ -2+arg1P_13<=arg1 && arg1>2 && arg1P_13>2 ], cost: 1
      3: f1795_0_main_InvokeMethod -> f2097_0_flatten_NULL : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [ arg1P_4<=arg2 && x14_1>0 && arg1>0 && arg2>2 && arg1P_4>2 && 2+arg3<=arg2 ], cost: 1
      5: f1759_0_createTree_LE -> f1759_0_createTree_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [ arg4>-1 && arg3>0 && arg1P_6<=arg1 && 2+arg2P_6<=arg2 && arg1>2 && arg2>2 && arg1P_6>2 && arg2P_6>0 && -1+arg3==arg3P_6 && 1+arg4==arg4P_6 ], cost: 1
      6: f1759_0_createTree_LE -> f1759_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [ arg3>0 && x36_1>0 && arg4>-1 && arg1P_7<=arg1 && 2+arg2P_7<=arg2 && arg1>2 && arg2>2 && arg1P_7>2 && arg2P_7>0 && -1+arg3==arg3P_7 && 1+arg4==arg4P_7 ], cost: 1
      7: f1759_0_createTree_LE -> f1759_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [ arg3>0 && x43_1>0 && arg4>-1 && arg1>2 && arg2>1 && arg1P_8>2 && arg2P_8>2 && -1+arg3==arg3P_8 && 1+arg4==arg4P_8 ], cost: 1
      8: f1759_0_createTree_LE -> f1759_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ arg4>-1 && arg3>0 && arg1>2 && arg2>1 && arg1P_9>2 && arg2P_9>2 && -1+arg3==arg3P_9 && 1+arg4==arg4P_9 ], cost: 1
      9: f1759_0_createTree_LE -> f1759_0_createTree_LE : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [ arg4>-1 && arg3>0 && -2+arg1P_10<=arg1 && -2+arg1P_10<=arg2 && -2+arg2P_10<=arg1 && -2+arg2P_10<=arg2 && arg1>2 && arg2>2 && arg1P_10>4 && arg2P_10>4 && -1+arg3==arg3P_10 && 1+arg4==arg4P_10 ], cost: 1
     10: f1759_0_createTree_LE -> f1759_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, [ arg3>0 && x62_1>0 && arg4>-1 && -2+arg1P_11<=arg1 && -2+arg1P_11<=arg2 && -2+arg2P_11<=arg1 && -2+arg2P_11<=arg2 && arg1>2 && arg2>2 && arg1P_11>4 && arg2P_11>4 && -1+arg3==arg3P_11 && 1+arg4==arg4P_11 ], cost: 1
     13: __init -> f1_0_main_Load : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=arg3P_14, arg4'=arg4P_14, [], cost: 1

Simplified all rules, resulting in:
   Start location: __init
      0: f1_0_main_Load -> f2097_0_flatten_NULL : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, [ 1+arg1P_1<=arg1 && arg2>0 && arg1>0 && arg1P_1>-1 ], cost: 1
      1: f1_0_main_Load -> f1795_0_main_InvokeMethod : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1P_2<=arg1 && arg1>0 && arg1P_2>0 && arg2P_2>2 ], cost: 1
      4: f1_0_main_Load -> f1759_0_createTree_LE : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=1, [ arg3P_5>0 && arg2>-1 && -2+arg1P_5<=arg1 && -2+arg2P_5<=arg1 && arg1>0 && arg1P_5>2 && arg2P_5>2 ], cost: 1
     11: f2097_0_flatten_NULL -> f2097_0_flatten_NULL : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg3P_12, arg4'=arg4P_12, [ 2+arg1P_12<=arg1 && arg1>1 && arg1P_12>-1 ], cost: 1
     12: f2097_0_flatten_NULL -> f2097_0_flatten_NULL : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [ -2+arg1P_13<=arg1 && arg1>2 && arg1P_13>2 ], cost: 1
      3: f1795_0_main_InvokeMethod -> f2097_0_flatten_NULL : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [ arg1P_4<=arg2 && arg1>0 && arg2>2 && arg1P_4>2 && 2+arg3<=arg2 ], cost: 1
      5: f1759_0_createTree_LE -> f1759_0_createTree_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=-1+arg3, arg4'=1+arg4, [ arg4>-1 && arg3>0 && arg1P_6<=arg1 && 2+arg2P_6<=arg2 && arg1>2 && arg2>2 && arg1P_6>2 && arg2P_6>0 ], cost: 1
      6: f1759_0_createTree_LE -> f1759_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=-1+arg3, arg4'=1+arg4, [ arg3>0 && arg4>-1 && arg1P_7<=arg1 && 2+arg2P_7<=arg2 && arg1>2 && arg2>2 && arg1P_7>2 && arg2P_7>0 ], cost: 1
      7: f1759_0_createTree_LE -> f1759_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-1+arg3, arg4'=1+arg4, [ arg3>0 && arg4>-1 && arg1>2 && arg2>1 && arg1P_8>2 && arg2P_8>2 ], cost: 1
      8: f1759_0_createTree_LE -> f1759_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=-1+arg3, arg4'=1+arg4, [ arg4>-1 && arg3>0 && arg1>2 && arg2>1 && arg1P_9>2 && arg2P_9>2 ], cost: 1
      9: f1759_0_createTree_LE -> f1759_0_createTree_LE : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=-1+arg3, arg4'=1+arg4, [ arg4>-1 && arg3>0 && -2+arg1P_10<=arg1 && -2+arg1P_10<=arg2 && -2+arg2P_10<=arg1 && -2+arg2P_10<=arg2 && arg1>2 && arg2>2 && arg1P_10>4 && arg2P_10>4 ], cost: 1
     10: f1759_0_createTree_LE -> f1759_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=-1+arg3, arg4'=1+arg4, [ arg3>0 && arg4>-1 && -2+arg1P_11<=arg1 && -2+arg1P_11<=arg2 && -2+arg2P_11<=arg1 && -2+arg2P_11<=arg2 && arg1>2 && arg2>2 && arg1P_11>4 && arg2P_11>4 ], cost: 1
     13: __init -> f1_0_main_Load : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=arg3P_14, arg4'=arg4P_14, [], cost: 1

### Simplification by acceleration and chaining ###

Accelerating simple loops of location 1.
   Accelerating the following rules:
     11: f2097_0_flatten_NULL -> f2097_0_flatten_NULL : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg3P_12, arg4'=arg4P_12, [ 2+arg1P_12<=arg1 && arg1>1 && arg1P_12>-1 ], cost: 1
     12: f2097_0_flatten_NULL -> f2097_0_flatten_NULL : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [ -2+arg1P_13<=arg1 && arg1>2 && arg1P_13>2 ], cost: 1

   Failed to prove monotonicity of the guard of rule 11.
   Accelerated rule 12 with non-termination, yielding the new rule 14.
[accelerate] Nesting with 1 inner and 1 outer candidates
   Removing the simple loops: 12.

Accelerating simple loops of location 4.
   Accelerating the following rules:
      5: f1759_0_createTree_LE -> f1759_0_createTree_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=-1+arg3, arg4'=1+arg4, [ arg4>-1 && arg3>0 && arg1P_6<=arg1 && 2+arg2P_6<=arg2 && arg1>2 && arg2>2 && arg1P_6>2 && arg2P_6>0 ], cost: 1
      6: f1759_0_createTree_LE -> f1759_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=-1+arg3, arg4'=1+arg4, [ arg3>0 && arg4>-1 && arg1P_7<=arg1 && 2+arg2P_7<=arg2 && arg1>2 && arg2>2 && arg1P_7>2 && arg2P_7>0 ], cost: 1
      7: f1759_0_createTree_LE -> f1759_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-1+arg3, arg4'=1+arg4, [ arg3>0 && arg4>-1 && arg1>2 && arg2>1 && arg1P_8>2 && arg2P_8>2 ], cost: 1
      8: f1759_0_createTree_LE -> f1759_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=-1+arg3, arg4'=1+arg4, [ arg4>-1 && arg3>0 && arg1>2 && arg2>1 && arg1P_9>2 && arg2P_9>2 ], cost: 1
      9: f1759_0_createTree_LE -> f1759_0_createTree_LE : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=-1+arg3, arg4'=1+arg4, [ arg4>-1 && arg3>0 && -2+arg1P_10<=arg1 && -2+arg1P_10<=arg2 && -2+arg2P_10<=arg1 && -2+arg2P_10<=arg2 && arg1>2 && arg2>2 && arg1P_10>4 && arg2P_10>4 ], cost: 1
     10: f1759_0_createTree_LE -> f1759_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=-1+arg3, arg4'=1+arg4, [ arg3>0 && arg4>-1 && -2+arg1P_11<=arg1 && -2+arg1P_11<=arg2 && -2+arg2P_11<=arg1 && -2+arg2P_11<=arg2 && arg1>2 && arg2>2 && arg1P_11>4 && arg2P_11>4 ], cost: 1

   Failed to prove monotonicity of the guard of rule 5.
   Failed to prove monotonicity of the guard of rule 6.
   Accelerated rule 7 with backward acceleration, yielding the new rule 15.
   Accelerated rule 8 with backward acceleration, yielding the new rule 16.
   Failed to prove monotonicity of the guard of rule 9.
   Failed to prove monotonicity of the guard of rule 10.
[accelerate] Nesting with 6 inner and 6 outer candidates
   Nested simple loops 7 (outer loop) and 9 (inner loop) with Rule(4 | arg4>-1, arg1>2, arg2>2, arg1P_8>2, arg2P_8>2, k_4>=1, 1-2*k_4+arg3>0, | 2*k_4 || 4 | 0=arg1P_8, 1=arg2P_8, 2=-2*k_4+arg3, 3=2*k_4+arg4, ), resulting in the new rules: 17, 18.
   Nested simple loops 8 (outer loop) and 9 (inner loop) with Rule(4 | arg4>-1, arg1>2, arg2>2, arg1P_9>2, arg2P_9>2, k_5>=1, 1+arg3-2*k_5>0, | 2*k_5 || 4 | 0=arg1P_9, 1=arg2P_9, 2=arg3-2*k_5, 3=2*k_5+arg4, ), resulting in the new rules: 19, 20.
   Nested simple loops 7 (outer loop) and 10 (inner loop) with Rule(4 | arg4>-1, arg1>2, arg2>2, arg1P_8>2, arg2P_8>2, k_6>=1, 1+arg3-2*k_6>0, | 2*k_6 || 4 | 0=arg1P_8, 1=arg2P_8, 2=arg3-2*k_6, 3=2*k_6+arg4, ), resulting in the new rules: 21, 22.
   Nested simple loops 8 (outer loop) and 10 (inner loop) with Rule(4 | arg4>-1, arg1>2, arg2>2, arg1P_9>2, arg2P_9>2, k_7>=1, 1+arg3-2*k_7>0, | 2*k_7 || 4 | 0=arg1P_9, 1=arg2P_9, 2=arg3-2*k_7, 3=arg4+2*k_7, ), resulting in the new rules: 23, 24.
   Removing the simple loops: 7 8.

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
      0: f1_0_main_Load -> f2097_0_flatten_NULL : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, [ 1+arg1P_1<=arg1 && arg2>0 && arg1>0 && arg1P_1>-1 ], cost: 1
      1: f1_0_main_Load -> f1795_0_main_InvokeMethod : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1P_2<=arg1 && arg1>0 && arg1P_2>0 && arg2P_2>2 ], cost: 1
      4: f1_0_main_Load -> f1759_0_createTree_LE : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=1, [ arg3P_5>0 && arg2>-1 && -2+arg1P_5<=arg1 && -2+arg2P_5<=arg1 && arg1>0 && arg1P_5>2 && arg2P_5>2 ], cost: 1
     11: f2097_0_flatten_NULL -> f2097_0_flatten_NULL : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg3P_12, arg4'=arg4P_12, [ 2+arg1P_12<=arg1 && arg1>1 && arg1P_12>-1 ], cost: 1
     14: f2097_0_flatten_NULL -> [6] : [ -2+arg1P_13<=arg1 && arg1>2 && arg1P_13>2 ], cost: NONTERM
      3: f1795_0_main_InvokeMethod -> f2097_0_flatten_NULL : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [ arg1P_4<=arg2 && arg1>0 && arg2>2 && arg1P_4>2 && 2+arg3<=arg2 ], cost: 1
      5: f1759_0_createTree_LE -> f1759_0_createTree_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=-1+arg3, arg4'=1+arg4, [ arg4>-1 && arg3>0 && arg1P_6<=arg1 && 2+arg2P_6<=arg2 && arg1>2 && arg2>2 && arg1P_6>2 && arg2P_6>0 ], cost: 1
      6: f1759_0_createTree_LE -> f1759_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=-1+arg3, arg4'=1+arg4, [ arg3>0 && arg4>-1 && arg1P_7<=arg1 && 2+arg2P_7<=arg2 && arg1>2 && arg2>2 && arg1P_7>2 && arg2P_7>0 ], cost: 1
      9: f1759_0_createTree_LE -> f1759_0_createTree_LE : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=-1+arg3, arg4'=1+arg4, [ arg4>-1 && arg3>0 && -2+arg1P_10<=arg1 && -2+arg1P_10<=arg2 && -2+arg2P_10<=arg1 && -2+arg2P_10<=arg2 && arg1>2 && arg2>2 && arg1P_10>4 && arg2P_10>4 ], cost: 1
     10: f1759_0_createTree_LE -> f1759_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=-1+arg3, arg4'=1+arg4, [ arg3>0 && arg4>-1 && -2+arg1P_11<=arg1 && -2+arg1P_11<=arg2 && -2+arg2P_11<=arg1 && -2+arg2P_11<=arg2 && arg1>2 && arg2>2 && arg1P_11>4 && arg2P_11>4 ], cost: 1
     15: f1759_0_createTree_LE -> f1759_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=0, arg4'=arg3+arg4, [ arg4>-1 && arg1>2 && arg2>1 && arg1P_8>2 && arg2P_8>2 && arg3>=1 ], cost: arg3
     16: f1759_0_createTree_LE -> f1759_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=0, arg4'=arg3+arg4, [ arg4>-1 && arg1>2 && arg2>1 && arg1P_9>2 && arg2P_9>2 && arg3>=1 ], cost: arg3
     17: f1759_0_createTree_LE -> f1759_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-2*k_4+arg3, arg4'=2*k_4+arg4, [ arg4>-1 && arg1>2 && arg2>2 && arg1P_8>2 && arg2P_8>2 && k_4>=1 && 1-2*k_4+arg3>0 ], cost: 2*k_4
     18: f1759_0_createTree_LE -> f1759_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-1-2*k_4+arg3, arg4'=1+2*k_4+arg4, [ arg3>0 && arg4>-1 && arg1>2 && arg2>1 && arg1P_8>2 && arg2P_8>2 && k_4>=1 && -2*k_4+arg3>0 ], cost: 1+2*k_4
     19: f1759_0_createTree_LE -> f1759_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3-2*k_5, arg4'=2*k_5+arg4, [ arg4>-1 && arg1>2 && arg2>2 && arg1P_9>2 && arg2P_9>2 && k_5>=1 && 1+arg3-2*k_5>0 ], cost: 2*k_5
     20: f1759_0_createTree_LE -> f1759_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=-1+arg3-2*k_5, arg4'=1+2*k_5+arg4, [ arg4>-1 && arg3>0 && arg1>2 && arg2>1 && arg1P_9>2 && arg2P_9>2 && k_5>=1 && arg3-2*k_5>0 ], cost: 1+2*k_5
     21: f1759_0_createTree_LE -> f1759_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3-2*k_6, arg4'=2*k_6+arg4, [ arg4>-1 && arg1>2 && arg2>2 && arg1P_8>2 && arg2P_8>2 && k_6>=1 && 1+arg3-2*k_6>0 ], cost: 2*k_6
     22: f1759_0_createTree_LE -> f1759_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-1+arg3-2*k_6, arg4'=1+2*k_6+arg4, [ arg3>0 && arg4>-1 && arg1>2 && arg2>1 && arg1P_8>2 && arg2P_8>2 && k_6>=1 && arg3-2*k_6>0 ], cost: 1+2*k_6
     23: f1759_0_createTree_LE -> f1759_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3-2*k_7, arg4'=arg4+2*k_7, [ arg4>-1 && arg1>2 && arg2>2 && arg1P_9>2 && arg2P_9>2 && k_7>=1 && 1+arg3-2*k_7>0 ], cost: 2*k_7
     24: f1759_0_createTree_LE -> f1759_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=-1+arg3-2*k_7, arg4'=1+arg4+2*k_7, [ arg4>-1 && arg3>0 && arg1>2 && arg2>1 && arg1P_9>2 && arg2P_9>2 && k_7>=1 && arg3-2*k_7>0 ], cost: 1+2*k_7
     13: __init -> f1_0_main_Load : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=arg3P_14, arg4'=arg4P_14, [], cost: 1

Chained accelerated rules (with incoming rules):
   Start location: __init
      0: f1_0_main_Load -> f2097_0_flatten_NULL : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, [ 1+arg1P_1<=arg1 && arg2>0 && arg1>0 && arg1P_1>-1 ], cost: 1
      1: f1_0_main_Load -> f1795_0_main_InvokeMethod : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1P_2<=arg1 && arg1>0 && arg1P_2>0 && arg2P_2>2 ], cost: 1
      4: f1_0_main_Load -> f1759_0_createTree_LE : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=1, [ arg3P_5>0 && arg2>-1 && -2+arg1P_5<=arg1 && -2+arg2P_5<=arg1 && arg1>0 && arg1P_5>2 && arg2P_5>2 ], cost: 1
     25: f1_0_main_Load -> f2097_0_flatten_NULL : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg3P_12, arg4'=arg4P_12, [ arg2>0 && arg1P_12>-1 && 2+arg1P_12<=-1+arg1 && 2<=-1+arg1 ], cost: 2
     27: f1_0_main_Load -> [6] : [ arg2>0 && 3<=-1+arg1 ], cost: NONTERM
     29: f1_0_main_Load -> f1759_0_createTree_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=-1+arg3P_5, arg4'=2, [ arg3P_5>0 && arg2>-1 && arg1>0 && arg1P_6>2 && arg2P_6>0 && arg1P_6<=2+arg1 && 2+arg2P_6<=2+arg1 ], cost: 2
     30: f1_0_main_Load -> f1759_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=-1+arg3P_5, arg4'=2, [ arg3P_5>0 && arg2>-1 && arg1>0 && arg1P_7>2 && arg2P_7>0 && arg1P_7<=2+arg1 && 2+arg2P_7<=2+arg1 ], cost: 2
     31: f1_0_main_Load -> f1759_0_createTree_LE : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=-1+arg3P_5, arg4'=2, [ arg3P_5>0 && arg2>-1 && arg1>0 && arg1P_10>4 && arg2P_10>4 && -2+arg1P_10<=2+arg1 && -2+arg2P_10<=2+arg1 ], cost: 2
     32: f1_0_main_Load -> f1759_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=-1+arg3P_5, arg4'=2, [ arg3P_5>0 && arg2>-1 && arg1>0 && arg1P_11>4 && arg2P_11>4 && -2+arg1P_11<=2+arg1 && -2+arg2P_11<=2+arg1 ], cost: 2
     33: f1_0_main_Load -> f1759_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=0, arg4'=1+arg3P_5, [ arg3P_5>0 && arg2>-1 && arg1>0 && arg1P_8>2 && arg2P_8>2 ], cost: 1+arg3P_5
     34: f1_0_main_Load -> f1759_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=0, arg4'=1+arg3P_5, [ arg3P_5>0 && arg2>-1 && arg1>0 && arg1P_9>2 && arg2P_9>2 ], cost: 1+arg3P_5
     35: f1_0_main_Load -> f1759_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_5-2*k_4, arg4'=1+2*k_4, [ arg3P_5>0 && arg2>-1 && arg1>0 && arg1P_8>2 && arg2P_8>2 && k_4>=1 && 1+arg3P_5-2*k_4>0 ], cost: 1+2*k_4
     36: f1_0_main_Load -> f1759_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-1+arg3P_5-2*k_4, arg4'=2+2*k_4, [ arg3P_5>0 && arg2>-1 && arg1>0 && arg1P_8>2 && arg2P_8>2 && k_4>=1 && arg3P_5-2*k_4>0 ], cost: 2+2*k_4
     37: f1_0_main_Load -> f1759_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_5-2*k_5, arg4'=1+2*k_5, [ arg3P_5>0 && arg2>-1 && arg1>0 && arg1P_9>2 && arg2P_9>2 && k_5>=1 && 1+arg3P_5-2*k_5>0 ], cost: 1+2*k_5
     38: f1_0_main_Load -> f1759_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=-1+arg3P_5-2*k_5, arg4'=2+2*k_5, [ arg3P_5>0 && arg2>-1 && arg1>0 && arg1P_9>2 && arg2P_9>2 && k_5>=1 && arg3P_5-2*k_5>0 ], cost: 2+2*k_5
     39: f1_0_main_Load -> f1759_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_5-2*k_6, arg4'=1+2*k_6, [ arg3P_5>0 && arg2>-1 && arg1>0 && arg1P_8>2 && arg2P_8>2 && k_6>=1 && 1+arg3P_5-2*k_6>0 ], cost: 1+2*k_6
     40: f1_0_main_Load -> f1759_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-1+arg3P_5-2*k_6, arg4'=2+2*k_6, [ arg3P_5>0 && arg2>-1 && arg1>0 && arg1P_8>2 && arg2P_8>2 && k_6>=1 && arg3P_5-2*k_6>0 ], cost: 2+2*k_6
     41: f1_0_main_Load -> f1759_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_5-2*k_7, arg4'=1+2*k_7, [ arg3P_5>0 && arg2>-1 && arg1>0 && arg1P_9>2 && arg2P_9>2 && k_7>=1 && 1+arg3P_5-2*k_7>0 ], cost: 1+2*k_7
     42: f1_0_main_Load -> f1759_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=-1+arg3P_5-2*k_7, arg4'=2+2*k_7, [ arg3P_5>0 && arg2>-1 && arg1>0 && arg1P_9>2 && arg2P_9>2 && k_7>=1 && arg3P_5-2*k_7>0 ], cost: 2+2*k_7
      3: f1795_0_main_InvokeMethod -> f2097_0_flatten_NULL : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [ arg1P_4<=arg2 && arg1>0 && arg2>2 && arg1P_4>2 && 2+arg3<=arg2 ], cost: 1
     26: f1795_0_main_InvokeMethod -> f2097_0_flatten_NULL : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg3P_12, arg4'=arg4P_12, [ arg1>0 && arg2>2 && 2+arg3<=arg2 && arg1P_12>-1 && 2+arg1P_12<=arg2 ], cost: 2
     28: f1795_0_main_InvokeMethod -> [6] : [ arg1>0 && arg2>2 && 2+arg3<=arg2 ], cost: NONTERM
     13: __init -> f1_0_main_Load : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=arg3P_14, arg4'=arg4P_14, [], cost: 1

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
      1: f1_0_main_Load -> f1795_0_main_InvokeMethod : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1P_2<=arg1 && arg1>0 && arg1P_2>0 && arg2P_2>2 ], cost: 1
     27: f1_0_main_Load -> [6] : [ arg2>0 && 3<=-1+arg1 ], cost: NONTERM
     33: f1_0_main_Load -> f1759_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=0, arg4'=1+arg3P_5, [ arg3P_5>0 && arg2>-1 && arg1>0 && arg1P_8>2 && arg2P_8>2 ], cost: 1+arg3P_5
     34: f1_0_main_Load -> f1759_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=0, arg4'=1+arg3P_5, [ arg3P_5>0 && arg2>-1 && arg1>0 && arg1P_9>2 && arg2P_9>2 ], cost: 1+arg3P_5
     35: f1_0_main_Load -> f1759_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_5-2*k_4, arg4'=1+2*k_4, [ arg3P_5>0 && arg2>-1 && arg1>0 && arg1P_8>2 && arg2P_8>2 && k_4>=1 && 1+arg3P_5-2*k_4>0 ], cost: 1+2*k_4
     36: f1_0_main_Load -> f1759_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-1+arg3P_5-2*k_4, arg4'=2+2*k_4, [ arg3P_5>0 && arg2>-1 && arg1>0 && arg1P_8>2 && arg2P_8>2 && k_4>=1 && arg3P_5-2*k_4>0 ], cost: 2+2*k_4
     37: f1_0_main_Load -> f1759_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_5-2*k_5, arg4'=1+2*k_5, [ arg3P_5>0 && arg2>-1 && arg1>0 && arg1P_9>2 && arg2P_9>2 && k_5>=1 && 1+arg3P_5-2*k_5>0 ], cost: 1+2*k_5
     38: f1_0_main_Load -> f1759_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=-1+arg3P_5-2*k_5, arg4'=2+2*k_5, [ arg3P_5>0 && arg2>-1 && arg1>0 && arg1P_9>2 && arg2P_9>2 && k_5>=1 && arg3P_5-2*k_5>0 ], cost: 2+2*k_5
     39: f1_0_main_Load -> f1759_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_5-2*k_6, arg4'=1+2*k_6, [ arg3P_5>0 && arg2>-1 && arg1>0 && arg1P_8>2 && arg2P_8>2 && k_6>=1 && 1+arg3P_5-2*k_6>0 ], cost: 1+2*k_6
     40: f1_0_main_Load -> f1759_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-1+arg3P_5-2*k_6, arg4'=2+2*k_6, [ arg3P_5>0 && arg2>-1 && arg1>0 && arg1P_8>2 && arg2P_8>2 && k_6>=1 && arg3P_5-2*k_6>0 ], cost: 2+2*k_6
     41: f1_0_main_Load -> f1759_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_5-2*k_7, arg4'=1+2*k_7, [ arg3P_5>0 && arg2>-1 && arg1>0 && arg1P_9>2 && arg2P_9>2 && k_7>=1 && 1+arg3P_5-2*k_7>0 ], cost: 1+2*k_7
     42: f1_0_main_Load -> f1759_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=-1+arg3P_5-2*k_7, arg4'=2+2*k_7, [ arg3P_5>0 && arg2>-1 && arg1>0 && arg1P_9>2 && arg2P_9>2 && k_7>=1 && arg3P_5-2*k_7>0 ], cost: 2+2*k_7
     28: f1795_0_main_InvokeMethod -> [6] : [ arg1>0 && arg2>2 && 2+arg3<=arg2 ], cost: NONTERM
     13: __init -> f1_0_main_Load : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=arg3P_14, arg4'=arg4P_14, [], cost: 1

Eliminated locations (on linear paths):
   Start location: __init
     27: f1_0_main_Load -> [6] : [ arg2>0 && 3<=-1+arg1 ], cost: NONTERM
     33: f1_0_main_Load -> f1759_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=0, arg4'=1+arg3P_5, [ arg3P_5>0 && arg2>-1 && arg1>0 && arg1P_8>2 && arg2P_8>2 ], cost: 1+arg3P_5
     34: f1_0_main_Load -> f1759_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=0, arg4'=1+arg3P_5, [ arg3P_5>0 && arg2>-1 && arg1>0 && arg1P_9>2 && arg2P_9>2 ], cost: 1+arg3P_5
     35: f1_0_main_Load -> f1759_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_5-2*k_4, arg4'=1+2*k_4, [ arg3P_5>0 && arg2>-1 && arg1>0 && arg1P_8>2 && arg2P_8>2 && k_4>=1 && 1+arg3P_5-2*k_4>0 ], cost: 1+2*k_4
     36: f1_0_main_Load -> f1759_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-1+arg3P_5-2*k_4, arg4'=2+2*k_4, [ arg3P_5>0 && arg2>-1 && arg1>0 && arg1P_8>2 && arg2P_8>2 && k_4>=1 && arg3P_5-2*k_4>0 ], cost: 2+2*k_4
     37: f1_0_main_Load -> f1759_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_5-2*k_5, arg4'=1+2*k_5, [ arg3P_5>0 && arg2>-1 && arg1>0 && arg1P_9>2 && arg2P_9>2 && k_5>=1 && 1+arg3P_5-2*k_5>0 ], cost: 1+2*k_5
     38: f1_0_main_Load -> f1759_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=-1+arg3P_5-2*k_5, arg4'=2+2*k_5, [ arg3P_5>0 && arg2>-1 && arg1>0 && arg1P_9>2 && arg2P_9>2 && k_5>=1 && arg3P_5-2*k_5>0 ], cost: 2+2*k_5
     39: f1_0_main_Load -> f1759_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_5-2*k_6, arg4'=1+2*k_6, [ arg3P_5>0 && arg2>-1 && arg1>0 && arg1P_8>2 && arg2P_8>2 && k_6>=1 && 1+arg3P_5-2*k_6>0 ], cost: 1+2*k_6
     40: f1_0_main_Load -> f1759_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-1+arg3P_5-2*k_6, arg4'=2+2*k_6, [ arg3P_5>0 && arg2>-1 && arg1>0 && arg1P_8>2 && arg2P_8>2 && k_6>=1 && arg3P_5-2*k_6>0 ], cost: 2+2*k_6
     41: f1_0_main_Load -> f1759_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_5-2*k_7, arg4'=1+2*k_7, [ arg3P_5>0 && arg2>-1 && arg1>0 && arg1P_9>2 && arg2P_9>2 && k_7>=1 && 1+arg3P_5-2*k_7>0 ], cost: 1+2*k_7
     42: f1_0_main_Load -> f1759_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=-1+arg3P_5-2*k_7, arg4'=2+2*k_7, [ arg3P_5>0 && arg2>-1 && arg1>0 && arg1P_9>2 && arg2P_9>2 && k_7>=1 && arg3P_5-2*k_7>0 ], cost: 2+2*k_7
     43: f1_0_main_Load -> [6] : [ arg1P_2<=arg1 && arg1>0 && arg1P_2>0 && arg2P_2>2 && 2+arg3P_2<=arg2P_2 ], cost: NONTERM
     13: __init -> f1_0_main_Load : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=arg3P_14, arg4'=arg4P_14, [], cost: 1

Eliminated locations (on tree-shaped paths):
   Start location: __init
     44: __init -> [6] : [ arg2P_14>0 && 3<=-1+arg1P_14 ], cost: NONTERM
     45: __init -> f1759_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=0, arg4'=1+arg3P_5, [ arg3P_5>0 && arg2P_14>-1 && arg1P_14>0 && arg1P_8>2 && arg2P_8>2 ], cost: 2+arg3P_5
     46: __init -> f1759_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=0, arg4'=1+arg3P_5, [ arg3P_5>0 && arg2P_14>-1 && arg1P_14>0 && arg1P_9>2 && arg2P_9>2 ], cost: 2+arg3P_5
     47: __init -> f1759_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_5-2*k_4, arg4'=1+2*k_4, [ arg3P_5>0 && arg2P_14>-1 && arg1P_14>0 && arg1P_8>2 && arg2P_8>2 && k_4>=1 && 1+arg3P_5-2*k_4>0 ], cost: 2+2*k_4
     48: __init -> f1759_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-1+arg3P_5-2*k_4, arg4'=2+2*k_4, [ arg3P_5>0 && arg2P_14>-1 && arg1P_14>0 && arg1P_8>2 && arg2P_8>2 && k_4>=1 && arg3P_5-2*k_4>0 ], cost: 3+2*k_4
     49: __init -> f1759_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_5-2*k_5, arg4'=1+2*k_5, [ arg3P_5>0 && arg2P_14>-1 && arg1P_14>0 && arg1P_9>2 && arg2P_9>2 && k_5>=1 && 1+arg3P_5-2*k_5>0 ], cost: 2+2*k_5
     50: __init -> f1759_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=-1+arg3P_5-2*k_5, arg4'=2+2*k_5, [ arg3P_5>0 && arg2P_14>-1 && arg1P_14>0 && arg1P_9>2 && arg2P_9>2 && k_5>=1 && arg3P_5-2*k_5>0 ], cost: 3+2*k_5
     51: __init -> f1759_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_5-2*k_6, arg4'=1+2*k_6, [ arg3P_5>0 && arg2P_14>-1 && arg1P_14>0 && arg1P_8>2 && arg2P_8>2 && k_6>=1 && 1+arg3P_5-2*k_6>0 ], cost: 2+2*k_6
     52: __init -> f1759_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-1+arg3P_5-2*k_6, arg4'=2+2*k_6, [ arg3P_5>0 && arg2P_14>-1 && arg1P_14>0 && arg1P_8>2 && arg2P_8>2 && k_6>=1 && arg3P_5-2*k_6>0 ], cost: 3+2*k_6
     53: __init -> f1759_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_5-2*k_7, arg4'=1+2*k_7, [ arg3P_5>0 && arg2P_14>-1 && arg1P_14>0 && arg1P_9>2 && arg2P_9>2 && k_7>=1 && 1+arg3P_5-2*k_7>0 ], cost: 2+2*k_7
     54: __init -> f1759_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=-1+arg3P_5-2*k_7, arg4'=2+2*k_7, [ arg3P_5>0 && arg2P_14>-1 && arg1P_14>0 && arg1P_9>2 && arg2P_9>2 && k_7>=1 && arg3P_5-2*k_7>0 ], cost: 3+2*k_7
     55: __init -> [6] : [ arg1P_2<=arg1P_14 && arg1P_14>0 && arg1P_2>0 && arg2P_2>2 && 2+arg3P_2<=arg2P_2 ], cost: NONTERM

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     44: __init -> [6] : [ arg2P_14>0 && 3<=-1+arg1P_14 ], cost: NONTERM
     45: __init -> f1759_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=0, arg4'=1+arg3P_5, [ arg3P_5>0 && arg2P_14>-1 && arg1P_14>0 && arg1P_8>2 && arg2P_8>2 ], cost: 2+arg3P_5
     46: __init -> f1759_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=0, arg4'=1+arg3P_5, [ arg3P_5>0 && arg2P_14>-1 && arg1P_14>0 && arg1P_9>2 && arg2P_9>2 ], cost: 2+arg3P_5
     47: __init -> f1759_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_5-2*k_4, arg4'=1+2*k_4, [ arg3P_5>0 && arg2P_14>-1 && arg1P_14>0 && arg1P_8>2 && arg2P_8>2 && k_4>=1 && 1+arg3P_5-2*k_4>0 ], cost: 2+2*k_4
     48: __init -> f1759_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-1+arg3P_5-2*k_4, arg4'=2+2*k_4, [ arg3P_5>0 && arg2P_14>-1 && arg1P_14>0 && arg1P_8>2 && arg2P_8>2 && k_4>=1 && arg3P_5-2*k_4>0 ], cost: 3+2*k_4
     49: __init -> f1759_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_5-2*k_5, arg4'=1+2*k_5, [ arg3P_5>0 && arg2P_14>-1 && arg1P_14>0 && arg1P_9>2 && arg2P_9>2 && k_5>=1 && 1+arg3P_5-2*k_5>0 ], cost: 2+2*k_5
     50: __init -> f1759_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=-1+arg3P_5-2*k_5, arg4'=2+2*k_5, [ arg3P_5>0 && arg2P_14>-1 && arg1P_14>0 && arg1P_9>2 && arg2P_9>2 && k_5>=1 && arg3P_5-2*k_5>0 ], cost: 3+2*k_5
     51: __init -> f1759_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_5-2*k_6, arg4'=1+2*k_6, [ arg3P_5>0 && arg2P_14>-1 && arg1P_14>0 && arg1P_8>2 && arg2P_8>2 && k_6>=1 && 1+arg3P_5-2*k_6>0 ], cost: 2+2*k_6
     52: __init -> f1759_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-1+arg3P_5-2*k_6, arg4'=2+2*k_6, [ arg3P_5>0 && arg2P_14>-1 && arg1P_14>0 && arg1P_8>2 && arg2P_8>2 && k_6>=1 && arg3P_5-2*k_6>0 ], cost: 3+2*k_6
     53: __init -> f1759_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_5-2*k_7, arg4'=1+2*k_7, [ arg3P_5>0 && arg2P_14>-1 && arg1P_14>0 && arg1P_9>2 && arg2P_9>2 && k_7>=1 && 1+arg3P_5-2*k_7>0 ], cost: 2+2*k_7
     54: __init -> f1759_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=-1+arg3P_5-2*k_7, arg4'=2+2*k_7, [ arg3P_5>0 && arg2P_14>-1 && arg1P_14>0 && arg1P_9>2 && arg2P_9>2 && k_7>=1 && arg3P_5-2*k_7>0 ], cost: 3+2*k_7
     55: __init -> [6] : [ arg1P_2<=arg1P_14 && arg1P_14>0 && arg1P_2>0 && arg2P_2>2 && 2+arg3P_2<=arg2P_2 ], cost: NONTERM

Computing asymptotic complexity for rule 44
   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_14>0 && 3<=-1+arg1P_14 ]

NO