NO

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

Initial linear ITS problem
   Start location: __init
      0: f1_0_main_Load -> f1761_0_main_InvokeMethod : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, [ arg1P_1<=arg1 && arg1>0 && arg1P_1>0 && arg2P_1>0 ], cost: 1
      2: f1_0_main_Load -> f1733_0_createTree_LE : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg3P_3>0 && arg2>-1 && -1+arg1P_3<=arg1 && -1+arg2P_3<=arg1 && arg1>0 && arg1P_3>1 && arg2P_3>1 && 1==arg4P_3 ], cost: 1
      9: f1_0_main_Load -> f1830_0_flatten_NULL : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [ 1+arg1P_10<=arg1 && arg2>0 && 1+arg2P_10<=arg1 && arg1>0 && arg1P_10>-1 && arg2P_10>-1 ], cost: 1
     10: f1761_0_main_InvokeMethod -> f1830_0_flatten_NULL : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, [ arg1P_11<=arg2 && x59_1>0 && arg2P_11<=arg2 && arg1>0 && arg2>0 && arg1P_11>0 && arg2P_11>0 && 2+arg3<=arg2 ], cost: 1
      1: f459_0_createTree_Return -> f1761_0_main_InvokeMethod : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1P_2<=arg1 && 1+arg1P_2<=arg2 && arg2>=arg2P_2 && arg1>0 && arg2>1 && arg1P_2>0 && arg2P_2>1 && 2+arg3<=arg2 && arg3==arg3P_2 ], cost: 1
      3: f1733_0_createTree_LE -> f1733_0_createTree_LE : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [ arg4>-1 && arg3>0 && arg1P_4<=arg1 && 2+arg2P_4<=arg2 && arg1>0 && arg2>2 && arg1P_4>0 && arg2P_4>0 && -1+arg3==arg3P_4 && 1+arg4==arg4P_4 ], cost: 1
      4: f1733_0_createTree_LE -> f1733_0_createTree_LE : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, [ arg3>0 && x28_1>0 && arg4>-1 && arg1P_5<=arg1 && 2+arg2P_5<=arg2 && arg1>0 && arg2>2 && arg1P_5>0 && arg2P_5>0 && -1+arg3==arg3P_5 && 1+arg4==arg4P_5 ], cost: 1
      5: f1733_0_createTree_LE -> f1733_0_createTree_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [ arg3>0 && x35_1>0 && arg4>-1 && arg1>0 && arg2>1 && arg1P_6>0 && arg2P_6>0 && -1+arg3==arg3P_6 && 1+arg4==arg4P_6 ], cost: 1
      6: f1733_0_createTree_LE -> f1733_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [ arg4>-1 && arg3>0 && arg1>0 && arg2>1 && arg1P_7>0 && arg2P_7>0 && -1+arg3==arg3P_7 && 1+arg4==arg4P_7 ], cost: 1
      7: f1733_0_createTree_LE -> f1733_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [ arg4>-1 && arg3>0 && -2+arg1P_8<=arg1 && -2+arg1P_8<=arg2 && -2+arg2P_8<=arg1 && -2+arg2P_8<=arg2 && arg1>1 && arg2>1 && arg1P_8>3 && arg2P_8>3 && -1+arg3==arg3P_8 && 1+arg4==arg4P_8 ], cost: 1
      8: f1733_0_createTree_LE -> f1733_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ arg3>0 && x54_1>0 && arg4>-1 && -2+arg1P_9<=arg1 && -2+arg1P_9<=arg2 && -2+arg2P_9<=arg1 && -2+arg2P_9<=arg2 && arg1>1 && arg2>1 && arg1P_9>3 && arg2P_9>3 && -1+arg3==arg3P_9 && 1+arg4==arg4P_9 ], cost: 1
     11: f1830_0_flatten_NULL -> f1830_0_flatten_NULL : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg3P_12, arg4'=arg4P_12, [ 2+arg1P_12<=arg1 && 2+arg1P_12<=arg2 && 2+arg2P_12<=arg1 && 2+arg2P_12<=arg2 && arg1>1 && arg2>1 && arg1P_12>-1 && arg2P_12>-1 ], cost: 1
     12: f1830_0_flatten_NULL -> f1830_0_flatten_NULL : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [ -2+arg1P_13<=arg1 && -2+arg1P_13<=arg2 && -2+arg2P_13<=arg1 && -2+arg2P_13<=arg2 && arg1>2 && arg2>2 && arg1P_13>2 && arg2P_13>2 ], 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 -> f1761_0_main_InvokeMethod : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, [ arg1P_1<=arg1 && arg1>0 && arg1P_1>0 && arg2P_1>0 ], cost: 1
      2: f1_0_main_Load -> f1733_0_createTree_LE : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg3P_3>0 && arg2>-1 && -1+arg1P_3<=arg1 && -1+arg2P_3<=arg1 && arg1>0 && arg1P_3>1 && arg2P_3>1 && 1==arg4P_3 ], cost: 1
      9: f1_0_main_Load -> f1830_0_flatten_NULL : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [ 1+arg1P_10<=arg1 && arg2>0 && 1+arg2P_10<=arg1 && arg1>0 && arg1P_10>-1 && arg2P_10>-1 ], cost: 1
     10: f1761_0_main_InvokeMethod -> f1830_0_flatten_NULL : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, [ arg1P_11<=arg2 && x59_1>0 && arg2P_11<=arg2 && arg1>0 && arg2>0 && arg1P_11>0 && arg2P_11>0 && 2+arg3<=arg2 ], cost: 1
      3: f1733_0_createTree_LE -> f1733_0_createTree_LE : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [ arg4>-1 && arg3>0 && arg1P_4<=arg1 && 2+arg2P_4<=arg2 && arg1>0 && arg2>2 && arg1P_4>0 && arg2P_4>0 && -1+arg3==arg3P_4 && 1+arg4==arg4P_4 ], cost: 1
      4: f1733_0_createTree_LE -> f1733_0_createTree_LE : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, [ arg3>0 && x28_1>0 && arg4>-1 && arg1P_5<=arg1 && 2+arg2P_5<=arg2 && arg1>0 && arg2>2 && arg1P_5>0 && arg2P_5>0 && -1+arg3==arg3P_5 && 1+arg4==arg4P_5 ], cost: 1
      5: f1733_0_createTree_LE -> f1733_0_createTree_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [ arg3>0 && x35_1>0 && arg4>-1 && arg1>0 && arg2>1 && arg1P_6>0 && arg2P_6>0 && -1+arg3==arg3P_6 && 1+arg4==arg4P_6 ], cost: 1
      6: f1733_0_createTree_LE -> f1733_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [ arg4>-1 && arg3>0 && arg1>0 && arg2>1 && arg1P_7>0 && arg2P_7>0 && -1+arg3==arg3P_7 && 1+arg4==arg4P_7 ], cost: 1
      7: f1733_0_createTree_LE -> f1733_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [ arg4>-1 && arg3>0 && -2+arg1P_8<=arg1 && -2+arg1P_8<=arg2 && -2+arg2P_8<=arg1 && -2+arg2P_8<=arg2 && arg1>1 && arg2>1 && arg1P_8>3 && arg2P_8>3 && -1+arg3==arg3P_8 && 1+arg4==arg4P_8 ], cost: 1
      8: f1733_0_createTree_LE -> f1733_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ arg3>0 && x54_1>0 && arg4>-1 && -2+arg1P_9<=arg1 && -2+arg1P_9<=arg2 && -2+arg2P_9<=arg1 && -2+arg2P_9<=arg2 && arg1>1 && arg2>1 && arg1P_9>3 && arg2P_9>3 && -1+arg3==arg3P_9 && 1+arg4==arg4P_9 ], cost: 1
     11: f1830_0_flatten_NULL -> f1830_0_flatten_NULL : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg3P_12, arg4'=arg4P_12, [ 2+arg1P_12<=arg1 && 2+arg1P_12<=arg2 && 2+arg2P_12<=arg1 && 2+arg2P_12<=arg2 && arg1>1 && arg2>1 && arg1P_12>-1 && arg2P_12>-1 ], cost: 1
     12: f1830_0_flatten_NULL -> f1830_0_flatten_NULL : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [ -2+arg1P_13<=arg1 && -2+arg1P_13<=arg2 && -2+arg2P_13<=arg1 && -2+arg2P_13<=arg2 && arg1>2 && arg2>2 && arg1P_13>2 && arg2P_13>2 ], 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 -> f1761_0_main_InvokeMethod : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, [ arg1P_1<=arg1 && arg1>0 && arg1P_1>0 && arg2P_1>0 ], cost: 1
      2: f1_0_main_Load -> f1733_0_createTree_LE : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=1, [ arg3P_3>0 && arg2>-1 && -1+arg1P_3<=arg1 && -1+arg2P_3<=arg1 && arg1>0 && arg1P_3>1 && arg2P_3>1 ], cost: 1
      9: f1_0_main_Load -> f1830_0_flatten_NULL : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [ 1+arg1P_10<=arg1 && arg2>0 && 1+arg2P_10<=arg1 && arg1>0 && arg1P_10>-1 && arg2P_10>-1 ], cost: 1
     10: f1761_0_main_InvokeMethod -> f1830_0_flatten_NULL : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, [ arg1P_11<=arg2 && arg2P_11<=arg2 && arg1>0 && arg2>0 && arg1P_11>0 && arg2P_11>0 && 2+arg3<=arg2 ], cost: 1
      3: f1733_0_createTree_LE -> f1733_0_createTree_LE : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=-1+arg3, arg4'=1+arg4, [ arg4>-1 && arg3>0 && arg1P_4<=arg1 && 2+arg2P_4<=arg2 && arg1>0 && arg2>2 && arg1P_4>0 && arg2P_4>0 ], cost: 1
      4: f1733_0_createTree_LE -> f1733_0_createTree_LE : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=-1+arg3, arg4'=1+arg4, [ arg3>0 && arg4>-1 && arg1P_5<=arg1 && 2+arg2P_5<=arg2 && arg1>0 && arg2>2 && arg1P_5>0 && arg2P_5>0 ], cost: 1
      5: f1733_0_createTree_LE -> f1733_0_createTree_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=-1+arg3, arg4'=1+arg4, [ arg3>0 && arg4>-1 && arg1>0 && arg2>1 && arg1P_6>0 && arg2P_6>0 ], cost: 1
      6: f1733_0_createTree_LE -> f1733_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=-1+arg3, arg4'=1+arg4, [ arg4>-1 && arg3>0 && arg1>0 && arg2>1 && arg1P_7>0 && arg2P_7>0 ], cost: 1
      7: f1733_0_createTree_LE -> f1733_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-1+arg3, arg4'=1+arg4, [ arg4>-1 && arg3>0 && -2+arg1P_8<=arg1 && -2+arg1P_8<=arg2 && -2+arg2P_8<=arg1 && -2+arg2P_8<=arg2 && arg1>1 && arg2>1 && arg1P_8>3 && arg2P_8>3 ], cost: 1
      8: f1733_0_createTree_LE -> f1733_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=-1+arg3, arg4'=1+arg4, [ arg3>0 && arg4>-1 && -2+arg1P_9<=arg1 && -2+arg1P_9<=arg2 && -2+arg2P_9<=arg1 && -2+arg2P_9<=arg2 && arg1>1 && arg2>1 && arg1P_9>3 && arg2P_9>3 ], cost: 1
     11: f1830_0_flatten_NULL -> f1830_0_flatten_NULL : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg3P_12, arg4'=arg4P_12, [ 2+arg1P_12<=arg1 && 2+arg1P_12<=arg2 && 2+arg2P_12<=arg1 && 2+arg2P_12<=arg2 && arg1>1 && arg2>1 && arg1P_12>-1 && arg2P_12>-1 ], cost: 1
     12: f1830_0_flatten_NULL -> f1830_0_flatten_NULL : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [ -2+arg1P_13<=arg1 && -2+arg1P_13<=arg2 && -2+arg2P_13<=arg1 && -2+arg2P_13<=arg2 && arg1>2 && arg2>2 && arg1P_13>2 && arg2P_13>2 ], 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 3.
   Accelerating the following rules:
      3: f1733_0_createTree_LE -> f1733_0_createTree_LE : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=-1+arg3, arg4'=1+arg4, [ arg4>-1 && arg3>0 && arg1P_4<=arg1 && 2+arg2P_4<=arg2 && arg1>0 && arg2>2 && arg1P_4>0 && arg2P_4>0 ], cost: 1
      4: f1733_0_createTree_LE -> f1733_0_createTree_LE : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=-1+arg3, arg4'=1+arg4, [ arg3>0 && arg4>-1 && arg1P_5<=arg1 && 2+arg2P_5<=arg2 && arg1>0 && arg2>2 && arg1P_5>0 && arg2P_5>0 ], cost: 1
      5: f1733_0_createTree_LE -> f1733_0_createTree_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=-1+arg3, arg4'=1+arg4, [ arg3>0 && arg4>-1 && arg1>0 && arg2>1 && arg1P_6>0 && arg2P_6>0 ], cost: 1
      6: f1733_0_createTree_LE -> f1733_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=-1+arg3, arg4'=1+arg4, [ arg4>-1 && arg3>0 && arg1>0 && arg2>1 && arg1P_7>0 && arg2P_7>0 ], cost: 1
      7: f1733_0_createTree_LE -> f1733_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-1+arg3, arg4'=1+arg4, [ arg4>-1 && arg3>0 && -2+arg1P_8<=arg1 && -2+arg1P_8<=arg2 && -2+arg2P_8<=arg1 && -2+arg2P_8<=arg2 && arg1>1 && arg2>1 && arg1P_8>3 && arg2P_8>3 ], cost: 1
      8: f1733_0_createTree_LE -> f1733_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=-1+arg3, arg4'=1+arg4, [ arg3>0 && arg4>-1 && -2+arg1P_9<=arg1 && -2+arg1P_9<=arg2 && -2+arg2P_9<=arg1 && -2+arg2P_9<=arg2 && arg1>1 && arg2>1 && arg1P_9>3 && arg2P_9>3 ], cost: 1

   Failed to prove monotonicity of the guard of rule 3.
   Failed to prove monotonicity of the guard of rule 4.
[test] deduced pseudo-invariant -arg2+arg2P_6<=0, also trying arg2-arg2P_6<=-1
   Accelerated rule 5 with backward acceleration, yielding the new rule 14.
[test] deduced pseudo-invariant -arg2+arg2P_7<=0, also trying arg2-arg2P_7<=-1
   Accelerated rule 6 with backward acceleration, yielding the new rule 15.
[test] deduced pseudo-invariant arg2P_8-arg1P_8<=0, also trying -arg2P_8+arg1P_8<=-1
   Failed to prove monotonicity of the guard of rule 7.
   Failed to prove monotonicity of the guard of rule 8.
[accelerate] Nesting with 6 inner and 6 outer candidates
   Nested simple loops 5 (outer loop) and 7 (inner loop) with Rule(3 | arg4>-1, arg1>0, arg2>1, arg1P_8>3, arg2P_8>3, k_9>=1, 1+arg3-2*k_9>0, | 2*k_9 || 3 | 0=arg1P_8, 1=arg2P_8, 2=arg3-2*k_9, 3=2*k_9+arg4, ), resulting in the new rules: 16, 17.
   Nested simple loops 6 (outer loop) and 7 (inner loop) with Rule(3 | arg4>-1, arg1>0, arg2>1, arg1P_8>3, arg2P_8>3, k_10>=1, 1-2*k_10+arg3>0, | 2*k_10 || 3 | 0=arg1P_8, 1=arg2P_8, 2=-2*k_10+arg3, 3=2*k_10+arg4, ), resulting in the new rules: 18, 19.
   Nested simple loops 5 (outer loop) and 8 (inner loop) with Rule(3 | arg4>-1, arg1>0, arg2>1, arg1P_9>3, arg2P_9>3, k_11>=1, 1+arg3-2*k_11>0, | 2*k_11 || 3 | 0=arg1P_9, 1=arg2P_9, 2=arg3-2*k_11, 3=arg4+2*k_11, ), resulting in the new rules: 20, 21.
   Nested simple loops 6 (outer loop) and 8 (inner loop) with Rule(3 | arg4>-1, arg1>0, arg2>1, arg1P_9>3, arg2P_9>3, k_12>=1, 1-2*k_12+arg3>0, | 2*k_12 || 3 | 0=arg1P_9, 1=arg2P_9, 2=-2*k_12+arg3, 3=2*k_12+arg4, ), resulting in the new rules: 22, 23.
   Removing the simple loops: 5 6.

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

   Failed to prove monotonicity of the guard of rule 11.
   Accelerated rule 12 with non-termination, yielding the new rule 24.
[accelerate] Nesting with 1 inner and 2 outer candidates
   Nested simple loops 12 (outer loop) and 11 (inner loop) with Rule(4 | arg1P_13>2, arg2P_13>2, -2+arg1P_13<=-2+arg1, -2+arg2P_13<=-2+arg2, k_15>=1, -2+arg2P_13<=-2+arg1P_13, 3<=-2+arg1P_13, -2+arg1P_13<=-2+arg2P_13, 3<=-2+arg2P_13, | 2*k_15 || 4 | 0=arg1P_13, 1=arg2P_13, 2=arg3P_13, 3=arg4P_13, ), resulting in the new rules: 25, 26.
   Removing the simple loops: 12.

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
      0: f1_0_main_Load -> f1761_0_main_InvokeMethod : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, [ arg1P_1<=arg1 && arg1>0 && arg1P_1>0 && arg2P_1>0 ], cost: 1
      2: f1_0_main_Load -> f1733_0_createTree_LE : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=1, [ arg3P_3>0 && arg2>-1 && -1+arg1P_3<=arg1 && -1+arg2P_3<=arg1 && arg1>0 && arg1P_3>1 && arg2P_3>1 ], cost: 1
      9: f1_0_main_Load -> f1830_0_flatten_NULL : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [ 1+arg1P_10<=arg1 && arg2>0 && 1+arg2P_10<=arg1 && arg1>0 && arg1P_10>-1 && arg2P_10>-1 ], cost: 1
     10: f1761_0_main_InvokeMethod -> f1830_0_flatten_NULL : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, [ arg1P_11<=arg2 && arg2P_11<=arg2 && arg1>0 && arg2>0 && arg1P_11>0 && arg2P_11>0 && 2+arg3<=arg2 ], cost: 1
      3: f1733_0_createTree_LE -> f1733_0_createTree_LE : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=-1+arg3, arg4'=1+arg4, [ arg4>-1 && arg3>0 && arg1P_4<=arg1 && 2+arg2P_4<=arg2 && arg1>0 && arg2>2 && arg1P_4>0 && arg2P_4>0 ], cost: 1
      4: f1733_0_createTree_LE -> f1733_0_createTree_LE : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=-1+arg3, arg4'=1+arg4, [ arg3>0 && arg4>-1 && arg1P_5<=arg1 && 2+arg2P_5<=arg2 && arg1>0 && arg2>2 && arg1P_5>0 && arg2P_5>0 ], cost: 1
      7: f1733_0_createTree_LE -> f1733_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-1+arg3, arg4'=1+arg4, [ arg4>-1 && arg3>0 && -2+arg1P_8<=arg1 && -2+arg1P_8<=arg2 && -2+arg2P_8<=arg1 && -2+arg2P_8<=arg2 && arg1>1 && arg2>1 && arg1P_8>3 && arg2P_8>3 ], cost: 1
      8: f1733_0_createTree_LE -> f1733_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=-1+arg3, arg4'=1+arg4, [ arg3>0 && arg4>-1 && -2+arg1P_9<=arg1 && -2+arg1P_9<=arg2 && -2+arg2P_9<=arg1 && -2+arg2P_9<=arg2 && arg1>1 && arg2>1 && arg1P_9>3 && arg2P_9>3 ], cost: 1
     14: f1733_0_createTree_LE -> f1733_0_createTree_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=0, arg4'=arg3+arg4, [ arg4>-1 && arg1>0 && arg1P_6>0 && -arg2+arg2P_6<=0 && arg3>=1 && arg2P_6>1 ], cost: arg3
     15: f1733_0_createTree_LE -> f1733_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=0, arg4'=arg3+arg4, [ arg4>-1 && arg1>0 && arg1P_7>0 && -arg2+arg2P_7<=0 && arg3>=1 && arg2P_7>1 ], cost: arg3
     16: f1733_0_createTree_LE -> f1733_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3-2*k_9, arg4'=2*k_9+arg4, [ arg4>-1 && arg1>0 && arg2>1 && arg1P_8>3 && arg2P_8>3 && k_9>=1 && 1+arg3-2*k_9>0 ], cost: 2*k_9
     17: f1733_0_createTree_LE -> f1733_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-1+arg3-2*k_9, arg4'=1+2*k_9+arg4, [ arg4>-1 && arg3>0 && -2+arg1P_8<=arg1 && -2+arg1P_8<=arg2 && -2+arg2P_8<=arg1 && -2+arg2P_8<=arg2 && arg1>1 && arg2>1 && arg1P_8>3 && arg2P_8>3 && k_9>=1 && arg3-2*k_9>0 ], cost: 1+2*k_9
     18: f1733_0_createTree_LE -> f1733_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-2*k_10+arg3, arg4'=2*k_10+arg4, [ arg4>-1 && arg1>0 && arg2>1 && arg1P_8>3 && arg2P_8>3 && k_10>=1 && 1-2*k_10+arg3>0 ], cost: 2*k_10
     19: f1733_0_createTree_LE -> f1733_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-1-2*k_10+arg3, arg4'=1+2*k_10+arg4, [ arg4>-1 && arg3>0 && -2+arg1P_8<=arg1 && -2+arg1P_8<=arg2 && -2+arg2P_8<=arg1 && -2+arg2P_8<=arg2 && arg1>1 && arg2>1 && arg1P_8>3 && arg2P_8>3 && k_10>=1 && -2*k_10+arg3>0 ], cost: 1+2*k_10
     20: f1733_0_createTree_LE -> f1733_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3-2*k_11, arg4'=arg4+2*k_11, [ arg4>-1 && arg1>0 && arg2>1 && arg1P_9>3 && arg2P_9>3 && k_11>=1 && 1+arg3-2*k_11>0 ], cost: 2*k_11
     21: f1733_0_createTree_LE -> f1733_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=-1+arg3-2*k_11, arg4'=1+arg4+2*k_11, [ arg3>0 && arg4>-1 && -2+arg1P_9<=arg1 && -2+arg1P_9<=arg2 && -2+arg2P_9<=arg1 && -2+arg2P_9<=arg2 && arg1>1 && arg2>1 && arg1P_9>3 && arg2P_9>3 && k_11>=1 && arg3-2*k_11>0 ], cost: 1+2*k_11
     22: f1733_0_createTree_LE -> f1733_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=-2*k_12+arg3, arg4'=2*k_12+arg4, [ arg4>-1 && arg1>0 && arg2>1 && arg1P_9>3 && arg2P_9>3 && k_12>=1 && 1-2*k_12+arg3>0 ], cost: 2*k_12
     23: f1733_0_createTree_LE -> f1733_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=-1-2*k_12+arg3, arg4'=1+2*k_12+arg4, [ arg3>0 && arg4>-1 && -2+arg1P_9<=arg1 && -2+arg1P_9<=arg2 && -2+arg2P_9<=arg1 && -2+arg2P_9<=arg2 && arg1>1 && arg2>1 && arg1P_9>3 && arg2P_9>3 && k_12>=1 && -2*k_12+arg3>0 ], cost: 1+2*k_12
     11: f1830_0_flatten_NULL -> f1830_0_flatten_NULL : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg3P_12, arg4'=arg4P_12, [ 2+arg1P_12<=arg1 && 2+arg1P_12<=arg2 && 2+arg2P_12<=arg1 && 2+arg2P_12<=arg2 && arg1>1 && arg2>1 && arg1P_12>-1 && arg2P_12>-1 ], cost: 1
     24: f1830_0_flatten_NULL -> [7] : [ -2+arg1P_13<=arg1 && -2+arg1P_13<=arg2 && -2+arg2P_13<=arg1 && -2+arg2P_13<=arg2 && arg1>2 && arg2>2 && arg1P_13>2 && arg2P_13>2 && -2+arg1P_13<=arg2P_13 && -2+arg2P_13<=arg1P_13 ], cost: NONTERM
     25: f1830_0_flatten_NULL -> f1830_0_flatten_NULL : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [ -2+arg1P_13<=-2+arg1 && -2+arg2P_13<=-2+arg2 && k_15>=1 && -2+arg2P_13<=-2+arg1P_13 && 3<=-2+arg1P_13 && -2+arg1P_13<=-2+arg2P_13 && 3<=-2+arg2P_13 ], cost: 2*k_15
     26: f1830_0_flatten_NULL -> f1830_0_flatten_NULL : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [ -2+arg1P_13<=arg1 && -2+arg1P_13<=arg2 && -2+arg2P_13<=arg1 && -2+arg2P_13<=arg2 && arg1>2 && arg2>2 && k_15>=1 && -2+arg2P_13<=-2+arg1P_13 && 3<=-2+arg1P_13 && -2+arg1P_13<=-2+arg2P_13 && 3<=-2+arg2P_13 ], cost: 1+2*k_15
     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 -> f1761_0_main_InvokeMethod : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, [ arg1P_1<=arg1 && arg1>0 && arg1P_1>0 && arg2P_1>0 ], cost: 1
      2: f1_0_main_Load -> f1733_0_createTree_LE : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=1, [ arg3P_3>0 && arg2>-1 && -1+arg1P_3<=arg1 && -1+arg2P_3<=arg1 && arg1>0 && arg1P_3>1 && arg2P_3>1 ], cost: 1
      9: f1_0_main_Load -> f1830_0_flatten_NULL : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [ 1+arg1P_10<=arg1 && arg2>0 && 1+arg2P_10<=arg1 && arg1>0 && arg1P_10>-1 && arg2P_10>-1 ], cost: 1
     27: f1_0_main_Load -> f1733_0_createTree_LE : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=-1+arg3P_3, arg4'=2, [ arg3P_3>0 && arg2>-1 && arg1P_4>0 && arg2P_4>0 && arg1P_4<=1+arg1 && 2+arg2P_4<=1+arg1 && 3<=1+arg1 ], cost: 2
     28: f1_0_main_Load -> f1733_0_createTree_LE : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=-1+arg3P_3, arg4'=2, [ arg3P_3>0 && arg2>-1 && arg1P_5>0 && arg2P_5>0 && arg1P_5<=1+arg1 && 2+arg2P_5<=1+arg1 && 3<=1+arg1 ], cost: 2
     29: f1_0_main_Load -> f1733_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-1+arg3P_3, arg4'=2, [ arg3P_3>0 && arg2>-1 && arg1>0 && arg1P_8>3 && arg2P_8>3 && -2+arg1P_8<=1+arg1 && -2+arg2P_8<=1+arg1 ], cost: 2
     30: f1_0_main_Load -> f1733_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=-1+arg3P_3, arg4'=2, [ arg3P_3>0 && arg2>-1 && arg1>0 && arg1P_9>3 && arg2P_9>3 && -2+arg1P_9<=1+arg1 && -2+arg2P_9<=1+arg1 ], cost: 2
     31: f1_0_main_Load -> f1733_0_createTree_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=0, arg4'=1+arg3P_3, [ arg3P_3>0 && arg2>-1 && arg1>0 && arg1P_6>0 && arg2P_6>1 && arg2P_6<=1+arg1 ], cost: 1+arg3P_3
     32: f1_0_main_Load -> f1733_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=0, arg4'=1+arg3P_3, [ arg3P_3>0 && arg2>-1 && arg1>0 && arg1P_7>0 && arg2P_7>1 && arg2P_7<=1+arg1 ], cost: 1+arg3P_3
     33: f1_0_main_Load -> f1733_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-2*k_9+arg3P_3, arg4'=1+2*k_9, [ arg3P_3>0 && arg2>-1 && arg1>0 && arg1P_8>3 && arg2P_8>3 && k_9>=1 && 1-2*k_9+arg3P_3>0 ], cost: 1+2*k_9
     34: f1_0_main_Load -> f1733_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-1-2*k_9+arg3P_3, arg4'=2+2*k_9, [ arg3P_3>0 && arg2>-1 && arg1>0 && arg1P_8>3 && arg2P_8>3 && k_9>=1 && -2*k_9+arg3P_3>0 && -2+arg1P_8<=1+arg1 && -2+arg2P_8<=1+arg1 ], cost: 2+2*k_9
     35: f1_0_main_Load -> f1733_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-2*k_10+arg3P_3, arg4'=1+2*k_10, [ arg3P_3>0 && arg2>-1 && arg1>0 && arg1P_8>3 && arg2P_8>3 && k_10>=1 && 1-2*k_10+arg3P_3>0 ], cost: 1+2*k_10
     36: f1_0_main_Load -> f1733_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-1-2*k_10+arg3P_3, arg4'=2+2*k_10, [ arg3P_3>0 && arg2>-1 && arg1>0 && arg1P_8>3 && arg2P_8>3 && k_10>=1 && -2*k_10+arg3P_3>0 && -2+arg1P_8<=1+arg1 && -2+arg2P_8<=1+arg1 ], cost: 2+2*k_10
     37: f1_0_main_Load -> f1733_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_3-2*k_11, arg4'=1+2*k_11, [ arg3P_3>0 && arg2>-1 && arg1>0 && arg1P_9>3 && arg2P_9>3 && k_11>=1 && 1+arg3P_3-2*k_11>0 ], cost: 1+2*k_11
     38: f1_0_main_Load -> f1733_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=-1+arg3P_3-2*k_11, arg4'=2+2*k_11, [ arg3P_3>0 && arg2>-1 && arg1>0 && arg1P_9>3 && arg2P_9>3 && k_11>=1 && arg3P_3-2*k_11>0 && -2+arg1P_9<=1+arg1 && -2+arg2P_9<=1+arg1 ], cost: 2+2*k_11
     39: f1_0_main_Load -> f1733_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=-2*k_12+arg3P_3, arg4'=1+2*k_12, [ arg3P_3>0 && arg2>-1 && arg1>0 && arg1P_9>3 && arg2P_9>3 && k_12>=1 && 1-2*k_12+arg3P_3>0 ], cost: 1+2*k_12
     40: f1_0_main_Load -> f1733_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=-1-2*k_12+arg3P_3, arg4'=2+2*k_12, [ arg3P_3>0 && arg2>-1 && arg1>0 && arg1P_9>3 && arg2P_9>3 && k_12>=1 && -2*k_12+arg3P_3>0 && -2+arg1P_9<=1+arg1 && -2+arg2P_9<=1+arg1 ], cost: 2+2*k_12
     41: f1_0_main_Load -> f1830_0_flatten_NULL : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg3P_12, arg4'=arg4P_12, [ arg2>0 && arg1P_12>-1 && arg2P_12>-1 && 2+arg1P_12<=-1+arg1 && 2+arg2P_12<=-1+arg1 && 2<=-1+arg1 ], cost: 2
     43: f1_0_main_Load -> [7] : [ arg2>0 && 3<=-1+arg1 ], cost: NONTERM
     45: f1_0_main_Load -> f1830_0_flatten_NULL : arg1'=arg2P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [ arg2>0 && arg1>0 && k_15>=1 && 3<=-2+arg2P_13 && arg2P_13<=-1+arg1 ], cost: 1+2*k_15
     47: f1_0_main_Load -> f1830_0_flatten_NULL : arg1'=arg2P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [ arg2>0 && k_15>=1 && 3<=-2+arg2P_13 && -2+arg2P_13<=-1+arg1 && 3<=-1+arg1 ], cost: 2+2*k_15
     10: f1761_0_main_InvokeMethod -> f1830_0_flatten_NULL : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, [ arg1P_11<=arg2 && arg2P_11<=arg2 && arg1>0 && arg2>0 && arg1P_11>0 && arg2P_11>0 && 2+arg3<=arg2 ], cost: 1
     42: f1761_0_main_InvokeMethod -> f1830_0_flatten_NULL : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg3P_12, arg4'=arg4P_12, [ arg1>0 && 2+arg3<=arg2 && arg1P_12>-1 && arg2P_12>-1 && 2+arg1P_12<=arg2 && 2+arg2P_12<=arg2 && 2<=arg2 ], cost: 2
     44: f1761_0_main_InvokeMethod -> [7] : [ arg1>0 && 2+arg3<=arg2 && 3<=arg2 ], cost: NONTERM
     46: f1761_0_main_InvokeMethod -> f1830_0_flatten_NULL : arg1'=arg2P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [ arg1>0 && arg2>0 && 2+arg3<=arg2 && k_15>=1 && 3<=-2+arg2P_13 && arg2P_13<=arg2 ], cost: 1+2*k_15
     48: f1761_0_main_InvokeMethod -> f1830_0_flatten_NULL : arg1'=arg2P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [ arg1>0 && 2+arg3<=arg2 && k_15>=1 && 3<=-2+arg2P_13 && -2+arg2P_13<=arg2 && 3<=arg2 ], cost: 2+2*k_15
     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
      0: f1_0_main_Load -> f1761_0_main_InvokeMethod : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, [ arg1P_1<=arg1 && arg1>0 && arg1P_1>0 && arg2P_1>0 ], cost: 1
     31: f1_0_main_Load -> f1733_0_createTree_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=0, arg4'=1+arg3P_3, [ arg3P_3>0 && arg2>-1 && arg1>0 && arg1P_6>0 && arg2P_6>1 && arg2P_6<=1+arg1 ], cost: 1+arg3P_3
     32: f1_0_main_Load -> f1733_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=0, arg4'=1+arg3P_3, [ arg3P_3>0 && arg2>-1 && arg1>0 && arg1P_7>0 && arg2P_7>1 && arg2P_7<=1+arg1 ], cost: 1+arg3P_3
     33: f1_0_main_Load -> f1733_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-2*k_9+arg3P_3, arg4'=1+2*k_9, [ arg3P_3>0 && arg2>-1 && arg1>0 && arg1P_8>3 && arg2P_8>3 && k_9>=1 && 1-2*k_9+arg3P_3>0 ], cost: 1+2*k_9
     34: f1_0_main_Load -> f1733_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-1-2*k_9+arg3P_3, arg4'=2+2*k_9, [ arg3P_3>0 && arg2>-1 && arg1>0 && arg1P_8>3 && arg2P_8>3 && k_9>=1 && -2*k_9+arg3P_3>0 && -2+arg1P_8<=1+arg1 && -2+arg2P_8<=1+arg1 ], cost: 2+2*k_9
     35: f1_0_main_Load -> f1733_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-2*k_10+arg3P_3, arg4'=1+2*k_10, [ arg3P_3>0 && arg2>-1 && arg1>0 && arg1P_8>3 && arg2P_8>3 && k_10>=1 && 1-2*k_10+arg3P_3>0 ], cost: 1+2*k_10
     36: f1_0_main_Load -> f1733_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-1-2*k_10+arg3P_3, arg4'=2+2*k_10, [ arg3P_3>0 && arg2>-1 && arg1>0 && arg1P_8>3 && arg2P_8>3 && k_10>=1 && -2*k_10+arg3P_3>0 && -2+arg1P_8<=1+arg1 && -2+arg2P_8<=1+arg1 ], cost: 2+2*k_10
     37: f1_0_main_Load -> f1733_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_3-2*k_11, arg4'=1+2*k_11, [ arg3P_3>0 && arg2>-1 && arg1>0 && arg1P_9>3 && arg2P_9>3 && k_11>=1 && 1+arg3P_3-2*k_11>0 ], cost: 1+2*k_11
     38: f1_0_main_Load -> f1733_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=-1+arg3P_3-2*k_11, arg4'=2+2*k_11, [ arg3P_3>0 && arg2>-1 && arg1>0 && arg1P_9>3 && arg2P_9>3 && k_11>=1 && arg3P_3-2*k_11>0 && -2+arg1P_9<=1+arg1 && -2+arg2P_9<=1+arg1 ], cost: 2+2*k_11
     39: f1_0_main_Load -> f1733_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=-2*k_12+arg3P_3, arg4'=1+2*k_12, [ arg3P_3>0 && arg2>-1 && arg1>0 && arg1P_9>3 && arg2P_9>3 && k_12>=1 && 1-2*k_12+arg3P_3>0 ], cost: 1+2*k_12
     40: f1_0_main_Load -> f1733_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=-1-2*k_12+arg3P_3, arg4'=2+2*k_12, [ arg3P_3>0 && arg2>-1 && arg1>0 && arg1P_9>3 && arg2P_9>3 && k_12>=1 && -2*k_12+arg3P_3>0 && -2+arg1P_9<=1+arg1 && -2+arg2P_9<=1+arg1 ], cost: 2+2*k_12
     43: f1_0_main_Load -> [7] : [ arg2>0 && 3<=-1+arg1 ], cost: NONTERM
     45: f1_0_main_Load -> f1830_0_flatten_NULL : arg1'=arg2P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [ arg2>0 && arg1>0 && k_15>=1 && 3<=-2+arg2P_13 && arg2P_13<=-1+arg1 ], cost: 1+2*k_15
     47: f1_0_main_Load -> f1830_0_flatten_NULL : arg1'=arg2P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [ arg2>0 && k_15>=1 && 3<=-2+arg2P_13 && -2+arg2P_13<=-1+arg1 && 3<=-1+arg1 ], cost: 2+2*k_15
     44: f1761_0_main_InvokeMethod -> [7] : [ arg1>0 && 2+arg3<=arg2 && 3<=arg2 ], cost: NONTERM
     46: f1761_0_main_InvokeMethod -> f1830_0_flatten_NULL : arg1'=arg2P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [ arg1>0 && arg2>0 && 2+arg3<=arg2 && k_15>=1 && 3<=-2+arg2P_13 && arg2P_13<=arg2 ], cost: 1+2*k_15
     48: f1761_0_main_InvokeMethod -> f1830_0_flatten_NULL : arg1'=arg2P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [ arg1>0 && 2+arg3<=arg2 && k_15>=1 && 3<=-2+arg2P_13 && -2+arg2P_13<=arg2 && 3<=arg2 ], cost: 2+2*k_15
     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: f1761_0_main_InvokeMethod -> [7] : [ arg1>0 && 2+arg3<=arg2 && 3<=arg2 ], cost: NONTERM
     46: f1761_0_main_InvokeMethod -> f1830_0_flatten_NULL : arg1'=arg2P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [ arg1>0 && arg2>0 && 2+arg3<=arg2 && k_15>=1 && 3<=-2+arg2P_13 && arg2P_13<=arg2 ], cost: 1+2*k_15
     48: f1761_0_main_InvokeMethod -> f1830_0_flatten_NULL : arg1'=arg2P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [ arg1>0 && 2+arg3<=arg2 && k_15>=1 && 3<=-2+arg2P_13 && -2+arg2P_13<=arg2 && 3<=arg2 ], cost: 2+2*k_15
     49: __init -> f1761_0_main_InvokeMethod : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, [ arg1P_1<=arg1P_14 && arg1P_14>0 && arg1P_1>0 && arg2P_1>0 ], cost: 2
     50: __init -> f1733_0_createTree_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=0, arg4'=1+arg3P_3, [ arg3P_3>0 && arg2P_14>-1 && arg1P_14>0 && arg1P_6>0 && arg2P_6>1 && arg2P_6<=1+arg1P_14 ], cost: 2+arg3P_3
     51: __init -> f1733_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=0, arg4'=1+arg3P_3, [ arg3P_3>0 && arg2P_14>-1 && arg1P_14>0 && arg1P_7>0 && arg2P_7>1 && arg2P_7<=1+arg1P_14 ], cost: 2+arg3P_3
     52: __init -> f1733_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-2*k_9+arg3P_3, arg4'=1+2*k_9, [ arg3P_3>0 && arg2P_14>-1 && arg1P_14>0 && arg1P_8>3 && arg2P_8>3 && k_9>=1 && 1-2*k_9+arg3P_3>0 ], cost: 2+2*k_9
     53: __init -> f1733_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-1-2*k_9+arg3P_3, arg4'=2+2*k_9, [ arg3P_3>0 && arg2P_14>-1 && arg1P_14>0 && arg1P_8>3 && arg2P_8>3 && k_9>=1 && -2*k_9+arg3P_3>0 && -2+arg1P_8<=1+arg1P_14 && -2+arg2P_8<=1+arg1P_14 ], cost: 3+2*k_9
     54: __init -> f1733_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-2*k_10+arg3P_3, arg4'=1+2*k_10, [ arg3P_3>0 && arg2P_14>-1 && arg1P_14>0 && arg1P_8>3 && arg2P_8>3 && k_10>=1 && 1-2*k_10+arg3P_3>0 ], cost: 2+2*k_10
     55: __init -> f1733_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-1-2*k_10+arg3P_3, arg4'=2+2*k_10, [ arg3P_3>0 && arg2P_14>-1 && arg1P_14>0 && arg1P_8>3 && arg2P_8>3 && k_10>=1 && -2*k_10+arg3P_3>0 && -2+arg1P_8<=1+arg1P_14 && -2+arg2P_8<=1+arg1P_14 ], cost: 3+2*k_10
     56: __init -> f1733_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_3-2*k_11, arg4'=1+2*k_11, [ arg3P_3>0 && arg2P_14>-1 && arg1P_14>0 && arg1P_9>3 && arg2P_9>3 && k_11>=1 && 1+arg3P_3-2*k_11>0 ], cost: 2+2*k_11
     57: __init -> f1733_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=-1+arg3P_3-2*k_11, arg4'=2+2*k_11, [ arg3P_3>0 && arg2P_14>-1 && arg1P_14>0 && arg1P_9>3 && arg2P_9>3 && k_11>=1 && arg3P_3-2*k_11>0 && -2+arg1P_9<=1+arg1P_14 && -2+arg2P_9<=1+arg1P_14 ], cost: 3+2*k_11
     58: __init -> f1733_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=-2*k_12+arg3P_3, arg4'=1+2*k_12, [ arg3P_3>0 && arg2P_14>-1 && arg1P_14>0 && arg1P_9>3 && arg2P_9>3 && k_12>=1 && 1-2*k_12+arg3P_3>0 ], cost: 2+2*k_12
     59: __init -> f1733_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=-1-2*k_12+arg3P_3, arg4'=2+2*k_12, [ arg3P_3>0 && arg2P_14>-1 && arg1P_14>0 && arg1P_9>3 && arg2P_9>3 && k_12>=1 && -2*k_12+arg3P_3>0 && -2+arg1P_9<=1+arg1P_14 && -2+arg2P_9<=1+arg1P_14 ], cost: 3+2*k_12
     60: __init -> [7] : [ arg2P_14>0 && 3<=-1+arg1P_14 ], cost: NONTERM
     61: __init -> f1830_0_flatten_NULL : arg1'=arg2P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [ arg2P_14>0 && arg1P_14>0 && k_15>=1 && 3<=-2+arg2P_13 && arg2P_13<=-1+arg1P_14 ], cost: 2+2*k_15
     62: __init -> f1830_0_flatten_NULL : arg1'=arg2P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [ arg2P_14>0 && k_15>=1 && 3<=-2+arg2P_13 && -2+arg2P_13<=-1+arg1P_14 && 3<=-1+arg1P_14 ], cost: 3+2*k_15

Applied pruning (of leafs and parallel rules):
   Start location: __init
     44: f1761_0_main_InvokeMethod -> [7] : [ arg1>0 && 2+arg3<=arg2 && 3<=arg2 ], cost: NONTERM
     46: f1761_0_main_InvokeMethod -> f1830_0_flatten_NULL : arg1'=arg2P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [ arg1>0 && arg2>0 && 2+arg3<=arg2 && k_15>=1 && 3<=-2+arg2P_13 && arg2P_13<=arg2 ], cost: 1+2*k_15
     48: f1761_0_main_InvokeMethod -> f1830_0_flatten_NULL : arg1'=arg2P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [ arg1>0 && 2+arg3<=arg2 && k_15>=1 && 3<=-2+arg2P_13 && -2+arg2P_13<=arg2 && 3<=arg2 ], cost: 2+2*k_15
     49: __init -> f1761_0_main_InvokeMethod : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, [ arg1P_1<=arg1P_14 && arg1P_14>0 && arg1P_1>0 && arg2P_1>0 ], cost: 2
     51: __init -> f1733_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=0, arg4'=1+arg3P_3, [ arg3P_3>0 && arg2P_14>-1 && arg1P_14>0 && arg1P_7>0 && arg2P_7>1 && arg2P_7<=1+arg1P_14 ], cost: 2+arg3P_3
     52: __init -> f1733_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-2*k_9+arg3P_3, arg4'=1+2*k_9, [ arg3P_3>0 && arg2P_14>-1 && arg1P_14>0 && arg1P_8>3 && arg2P_8>3 && k_9>=1 && 1-2*k_9+arg3P_3>0 ], cost: 2+2*k_9
     54: __init -> f1733_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-2*k_10+arg3P_3, arg4'=1+2*k_10, [ arg3P_3>0 && arg2P_14>-1 && arg1P_14>0 && arg1P_8>3 && arg2P_8>3 && k_10>=1 && 1-2*k_10+arg3P_3>0 ], cost: 2+2*k_10
     56: __init -> f1733_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_3-2*k_11, arg4'=1+2*k_11, [ arg3P_3>0 && arg2P_14>-1 && arg1P_14>0 && arg1P_9>3 && arg2P_9>3 && k_11>=1 && 1+arg3P_3-2*k_11>0 ], cost: 2+2*k_11
     58: __init -> f1733_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=-2*k_12+arg3P_3, arg4'=1+2*k_12, [ arg3P_3>0 && arg2P_14>-1 && arg1P_14>0 && arg1P_9>3 && arg2P_9>3 && k_12>=1 && 1-2*k_12+arg3P_3>0 ], cost: 2+2*k_12
     60: __init -> [7] : [ arg2P_14>0 && 3<=-1+arg1P_14 ], cost: NONTERM
     61: __init -> f1830_0_flatten_NULL : arg1'=arg2P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [ arg2P_14>0 && arg1P_14>0 && k_15>=1 && 3<=-2+arg2P_13 && arg2P_13<=-1+arg1P_14 ], cost: 2+2*k_15
     62: __init -> f1830_0_flatten_NULL : arg1'=arg2P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [ arg2P_14>0 && k_15>=1 && 3<=-2+arg2P_13 && -2+arg2P_13<=-1+arg1P_14 && 3<=-1+arg1P_14 ], cost: 3+2*k_15

Eliminated locations (on tree-shaped paths):
   Start location: __init
     51: __init -> f1733_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=0, arg4'=1+arg3P_3, [ arg3P_3>0 && arg2P_14>-1 && arg1P_14>0 && arg1P_7>0 && arg2P_7>1 && arg2P_7<=1+arg1P_14 ], cost: 2+arg3P_3
     52: __init -> f1733_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-2*k_9+arg3P_3, arg4'=1+2*k_9, [ arg3P_3>0 && arg2P_14>-1 && arg1P_14>0 && arg1P_8>3 && arg2P_8>3 && k_9>=1 && 1-2*k_9+arg3P_3>0 ], cost: 2+2*k_9
     54: __init -> f1733_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-2*k_10+arg3P_3, arg4'=1+2*k_10, [ arg3P_3>0 && arg2P_14>-1 && arg1P_14>0 && arg1P_8>3 && arg2P_8>3 && k_10>=1 && 1-2*k_10+arg3P_3>0 ], cost: 2+2*k_10
     56: __init -> f1733_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_3-2*k_11, arg4'=1+2*k_11, [ arg3P_3>0 && arg2P_14>-1 && arg1P_14>0 && arg1P_9>3 && arg2P_9>3 && k_11>=1 && 1+arg3P_3-2*k_11>0 ], cost: 2+2*k_11
     58: __init -> f1733_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=-2*k_12+arg3P_3, arg4'=1+2*k_12, [ arg3P_3>0 && arg2P_14>-1 && arg1P_14>0 && arg1P_9>3 && arg2P_9>3 && k_12>=1 && 1-2*k_12+arg3P_3>0 ], cost: 2+2*k_12
     60: __init -> [7] : [ arg2P_14>0 && 3<=-1+arg1P_14 ], cost: NONTERM
     61: __init -> f1830_0_flatten_NULL : arg1'=arg2P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [ arg2P_14>0 && arg1P_14>0 && k_15>=1 && 3<=-2+arg2P_13 && arg2P_13<=-1+arg1P_14 ], cost: 2+2*k_15
     62: __init -> f1830_0_flatten_NULL : arg1'=arg2P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [ arg2P_14>0 && k_15>=1 && 3<=-2+arg2P_13 && -2+arg2P_13<=-1+arg1P_14 && 3<=-1+arg1P_14 ], cost: 3+2*k_15
     63: __init -> [7] : [ arg1P_1<=arg1P_14 && arg1P_14>0 && arg1P_1>0 && 2+arg3P_1<=arg2P_1 && 3<=arg2P_1 ], cost: NONTERM
     64: __init -> f1830_0_flatten_NULL : arg1'=arg2P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [ arg1P_1<=arg1P_14 && arg1P_14>0 && arg1P_1>0 && arg2P_1>0 && 2+arg3P_1<=arg2P_1 && k_15>=1 && 3<=-2+arg2P_13 && arg2P_13<=arg2P_1 ], cost: 3+2*k_15
     65: __init -> f1830_0_flatten_NULL : arg1'=arg2P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [ arg1P_1<=arg1P_14 && arg1P_14>0 && arg1P_1>0 && 2+arg3P_1<=arg2P_1 && k_15>=1 && 3<=-2+arg2P_13 && -2+arg2P_13<=arg2P_1 && 3<=arg2P_1 ], cost: 4+2*k_15

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     51: __init -> f1733_0_createTree_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=0, arg4'=1+arg3P_3, [ arg3P_3>0 && arg2P_14>-1 && arg1P_14>0 && arg1P_7>0 && arg2P_7>1 && arg2P_7<=1+arg1P_14 ], cost: 2+arg3P_3
     52: __init -> f1733_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-2*k_9+arg3P_3, arg4'=1+2*k_9, [ arg3P_3>0 && arg2P_14>-1 && arg1P_14>0 && arg1P_8>3 && arg2P_8>3 && k_9>=1 && 1-2*k_9+arg3P_3>0 ], cost: 2+2*k_9
     54: __init -> f1733_0_createTree_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-2*k_10+arg3P_3, arg4'=1+2*k_10, [ arg3P_3>0 && arg2P_14>-1 && arg1P_14>0 && arg1P_8>3 && arg2P_8>3 && k_10>=1 && 1-2*k_10+arg3P_3>0 ], cost: 2+2*k_10
     56: __init -> f1733_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_3-2*k_11, arg4'=1+2*k_11, [ arg3P_3>0 && arg2P_14>-1 && arg1P_14>0 && arg1P_9>3 && arg2P_9>3 && k_11>=1 && 1+arg3P_3-2*k_11>0 ], cost: 2+2*k_11
     58: __init -> f1733_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=-2*k_12+arg3P_3, arg4'=1+2*k_12, [ arg3P_3>0 && arg2P_14>-1 && arg1P_14>0 && arg1P_9>3 && arg2P_9>3 && k_12>=1 && 1-2*k_12+arg3P_3>0 ], cost: 2+2*k_12
     60: __init -> [7] : [ arg2P_14>0 && 3<=-1+arg1P_14 ], cost: NONTERM
     61: __init -> f1830_0_flatten_NULL : arg1'=arg2P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [ arg2P_14>0 && arg1P_14>0 && k_15>=1 && 3<=-2+arg2P_13 && arg2P_13<=-1+arg1P_14 ], cost: 2+2*k_15
     62: __init -> f1830_0_flatten_NULL : arg1'=arg2P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [ arg2P_14>0 && k_15>=1 && 3<=-2+arg2P_13 && -2+arg2P_13<=-1+arg1P_14 && 3<=-1+arg1P_14 ], cost: 3+2*k_15
     63: __init -> [7] : [ arg1P_1<=arg1P_14 && arg1P_14>0 && arg1P_1>0 && 2+arg3P_1<=arg2P_1 && 3<=arg2P_1 ], cost: NONTERM
     64: __init -> f1830_0_flatten_NULL : arg1'=arg2P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [ arg1P_1<=arg1P_14 && arg1P_14>0 && arg1P_1>0 && arg2P_1>0 && 2+arg3P_1<=arg2P_1 && k_15>=1 && 3<=-2+arg2P_13 && arg2P_13<=arg2P_1 ], cost: 3+2*k_15
     65: __init -> f1830_0_flatten_NULL : arg1'=arg2P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [ arg1P_1<=arg1P_14 && arg1P_14>0 && arg1P_1>0 && 2+arg3P_1<=arg2P_1 && k_15>=1 && 3<=-2+arg2P_13 && -2+arg2P_13<=arg2P_1 && 3<=arg2P_1 ], cost: 4+2*k_15

Computing asymptotic complexity for rule 60
   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