NO

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

Initial linear ITS problem
   Start location: __init
      0: f1_0_main_New -> f230_0_alternate_NONNULL : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, [ arg1P_1>3 && arg2P_1>3 && arg4P_1>3 && arg3P_1>3 ], cost: 1
      2: f1_0_main_New -> f1096_0_append_NONNULL : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg1P_3>3 && arg3P_3>-1 && arg2P_3>4 ], cost: 1
      4: f1_0_main_New -> f565_0_iter_NULL : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, [ arg2P_5>1 && arg1P_5>3 ], cost: 1
      6: f1_0_main_New -> f717_0_reverseAcc_NONNULL : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [ arg2P_7>1 && arg1P_7>3 ], cost: 1
      8: f1_0_main_New -> f845_0_reverse_NONNULL : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ arg2P_9>1 && arg1P_9>3 ], cost: 1
      1: f230_0_alternate_NONNULL -> f230_0_alternate_NONNULL : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ 1+arg1P_2<=arg2 && arg2P_2<=arg1 && arg2P_2<=arg3 && arg2P_2<=arg4 && arg2>=1+arg3P_2 && arg2>=1+arg4P_2 && arg1>0 && arg2>0 && arg3>0 && arg4>0 && arg1P_2>-1 && arg2P_2>0 && arg3P_2>-1 && arg4P_2>-1 ], cost: 1
      3: f1096_0_append_NONNULL -> f1096_0_append_NONNULL : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [ arg2P_4<=arg2 && arg1>2 && arg2>0 && arg3>0 && arg1P_4>0 && arg2P_4>0 && arg3P_4>-1 ], cost: 1
      5: f565_0_iter_NULL -> f565_0_iter_NULL : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [ 2+arg1P_6<=arg1 && arg1P_6<=arg2 && 3+arg2P_6<=arg1 && 1+arg2P_6<=arg2 && arg1>2 && arg2>0 && arg1P_6>0 && arg2P_6>-1 ], cost: 1
      7: f717_0_reverseAcc_NONNULL -> f717_0_reverseAcc_NONNULL : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [ 2+arg1P_8<=arg1 && arg1P_8<=arg2 && 3+arg2P_8<=arg1 && 1+arg2P_8<=arg2 && arg1>2 && arg2>0 && arg1P_8>0 && arg2P_8>-1 ], cost: 1
      9: f845_0_reverse_NONNULL -> f845_0_reverse_NONNULL : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [ 2+arg1P_10<=arg1 && arg1P_10<=arg2 && 3+arg2P_10<=arg1 && 1+arg2P_10<=arg2 && arg1>2 && arg2>0 && arg1P_10>0 && arg2P_10>-1 ], cost: 1
     10: f845_0_reverse_NONNULL -> f1096_0_append_NONNULL : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, [ 1+arg1P_11<=arg1 && -1+arg1P_11<=arg2 && 1+arg2P_11<=arg1 && -1+arg2P_11<=arg2 && arg1>2 && arg2>0 && arg1P_11>1 && arg2P_11>1 && arg3P_11>-1 ], cost: 1
     11: f845_0_reverse_NONNULL -> f1225_0_reverse_InvokeMethod : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg3P_12, arg4'=arg4P_12, [ arg1>2 && arg2>0 && arg1P_12>4 ], cost: 1
     12: f845_0_reverse_NONNULL -> f1225_0_reverse_InvokeMethod : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [ arg1>2 && arg2>0 && arg1P_13>2 ], cost: 1
     14: f1225_0_reverse_InvokeMethod -> f1096_0_append_NONNULL : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_15, arg4'=arg4P_15, [ arg1P_15<=arg1 && 1+arg2P_15<=arg1 && arg1>2 && arg1P_15>2 && arg2P_15>1 && arg3P_15>-1 ], cost: 1
     13: f991_0_reverse_Return -> f1225_0_reverse_InvokeMethod : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=arg3P_14, arg4'=arg4P_14, [ arg1P_14<=arg1 && arg1>2 && arg1P_14>2 && 4+arg2<=arg1 ], cost: 1
     15: __init -> f1_0_main_New : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_16, arg4'=arg4P_16, [], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
     15: __init -> f1_0_main_New : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_16, arg4'=arg4P_16, [], cost: 1

Removed unreachable and leaf rules:
   Start location: __init
      0: f1_0_main_New -> f230_0_alternate_NONNULL : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, [ arg1P_1>3 && arg2P_1>3 && arg4P_1>3 && arg3P_1>3 ], cost: 1
      2: f1_0_main_New -> f1096_0_append_NONNULL : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg1P_3>3 && arg3P_3>-1 && arg2P_3>4 ], cost: 1
      4: f1_0_main_New -> f565_0_iter_NULL : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, [ arg2P_5>1 && arg1P_5>3 ], cost: 1
      6: f1_0_main_New -> f717_0_reverseAcc_NONNULL : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [ arg2P_7>1 && arg1P_7>3 ], cost: 1
      8: f1_0_main_New -> f845_0_reverse_NONNULL : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ arg2P_9>1 && arg1P_9>3 ], cost: 1
      1: f230_0_alternate_NONNULL -> f230_0_alternate_NONNULL : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ 1+arg1P_2<=arg2 && arg2P_2<=arg1 && arg2P_2<=arg3 && arg2P_2<=arg4 && arg2>=1+arg3P_2 && arg2>=1+arg4P_2 && arg1>0 && arg2>0 && arg3>0 && arg4>0 && arg1P_2>-1 && arg2P_2>0 && arg3P_2>-1 && arg4P_2>-1 ], cost: 1
      3: f1096_0_append_NONNULL -> f1096_0_append_NONNULL : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [ arg2P_4<=arg2 && arg1>2 && arg2>0 && arg3>0 && arg1P_4>0 && arg2P_4>0 && arg3P_4>-1 ], cost: 1
      5: f565_0_iter_NULL -> f565_0_iter_NULL : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [ 2+arg1P_6<=arg1 && arg1P_6<=arg2 && 3+arg2P_6<=arg1 && 1+arg2P_6<=arg2 && arg1>2 && arg2>0 && arg1P_6>0 && arg2P_6>-1 ], cost: 1
      7: f717_0_reverseAcc_NONNULL -> f717_0_reverseAcc_NONNULL : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [ 2+arg1P_8<=arg1 && arg1P_8<=arg2 && 3+arg2P_8<=arg1 && 1+arg2P_8<=arg2 && arg1>2 && arg2>0 && arg1P_8>0 && arg2P_8>-1 ], cost: 1
      9: f845_0_reverse_NONNULL -> f845_0_reverse_NONNULL : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [ 2+arg1P_10<=arg1 && arg1P_10<=arg2 && 3+arg2P_10<=arg1 && 1+arg2P_10<=arg2 && arg1>2 && arg2>0 && arg1P_10>0 && arg2P_10>-1 ], cost: 1
     10: f845_0_reverse_NONNULL -> f1096_0_append_NONNULL : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, [ 1+arg1P_11<=arg1 && -1+arg1P_11<=arg2 && 1+arg2P_11<=arg1 && -1+arg2P_11<=arg2 && arg1>2 && arg2>0 && arg1P_11>1 && arg2P_11>1 && arg3P_11>-1 ], cost: 1
     11: f845_0_reverse_NONNULL -> f1225_0_reverse_InvokeMethod : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg3P_12, arg4'=arg4P_12, [ arg1>2 && arg2>0 && arg1P_12>4 ], cost: 1
     12: f845_0_reverse_NONNULL -> f1225_0_reverse_InvokeMethod : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [ arg1>2 && arg2>0 && arg1P_13>2 ], cost: 1
     14: f1225_0_reverse_InvokeMethod -> f1096_0_append_NONNULL : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_15, arg4'=arg4P_15, [ arg1P_15<=arg1 && 1+arg2P_15<=arg1 && arg1>2 && arg1P_15>2 && arg2P_15>1 && arg3P_15>-1 ], cost: 1
     15: __init -> f1_0_main_New : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_16, arg4'=arg4P_16, [], cost: 1

### Simplification by acceleration and chaining ###

Accelerating simple loops of location 1.
   Accelerating the following rules:
      1: f230_0_alternate_NONNULL -> f230_0_alternate_NONNULL : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ 1+arg1P_2<=arg2 && arg2P_2<=arg1 && arg2P_2<=arg3 && arg2P_2<=arg4 && arg2>=1+arg3P_2 && arg2>=1+arg4P_2 && arg1>0 && arg2>0 && arg3>0 && arg4>0 && arg1P_2>-1 && arg2P_2>0 && arg3P_2>-1 && arg4P_2>-1 ], cost: 1

   Failed to prove monotonicity of the guard of rule 1.
[accelerate] Nesting with 1 inner and 1 outer candidates

Accelerating simple loops of location 2.
   Accelerating the following rules:
      3: f1096_0_append_NONNULL -> f1096_0_append_NONNULL : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [ arg2P_4<=arg2 && arg1>2 && arg2>0 && arg3>0 && arg1P_4>0 && arg2P_4>0 && arg3P_4>-1 ], cost: 1

[test] deduced invariant 1-arg1<=0
[test] deduced pseudo-invariant -arg3P_4+arg3<=0, also trying arg3P_4-arg3<=-1
   Accelerated rule 3 with non-termination, yielding the new rule 16.
   Accelerated rule 3 with non-termination, yielding the new rule 17.
[accelerate] Nesting with 0 inner and 1 outer candidates

Accelerating simple loops of location 3.
   Accelerating the following rules:
      5: f565_0_iter_NULL -> f565_0_iter_NULL : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [ 2+arg1P_6<=arg1 && arg1P_6<=arg2 && 3+arg2P_6<=arg1 && 1+arg2P_6<=arg2 && arg1>2 && arg2>0 && arg1P_6>0 && arg2P_6>-1 ], cost: 1

   Failed to prove monotonicity of the guard of rule 5.
[accelerate] Nesting with 1 inner and 1 outer candidates

Accelerating simple loops of location 4.
   Accelerating the following rules:
      7: f717_0_reverseAcc_NONNULL -> f717_0_reverseAcc_NONNULL : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [ 2+arg1P_8<=arg1 && arg1P_8<=arg2 && 3+arg2P_8<=arg1 && 1+arg2P_8<=arg2 && arg1>2 && arg2>0 && arg1P_8>0 && arg2P_8>-1 ], cost: 1

   Failed to prove monotonicity of the guard of rule 7.
[accelerate] Nesting with 1 inner and 1 outer candidates

Accelerating simple loops of location 5.
   Accelerating the following rules:
      9: f845_0_reverse_NONNULL -> f845_0_reverse_NONNULL : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [ 2+arg1P_10<=arg1 && arg1P_10<=arg2 && 3+arg2P_10<=arg1 && 1+arg2P_10<=arg2 && arg1>2 && arg2>0 && arg1P_10>0 && arg2P_10>-1 ], cost: 1

   Failed to prove monotonicity of the guard of rule 9.
[accelerate] Nesting with 1 inner and 1 outer candidates

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
      0: f1_0_main_New -> f230_0_alternate_NONNULL : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, [ arg1P_1>3 && arg2P_1>3 && arg4P_1>3 && arg3P_1>3 ], cost: 1
      2: f1_0_main_New -> f1096_0_append_NONNULL : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg1P_3>3 && arg3P_3>-1 && arg2P_3>4 ], cost: 1
      4: f1_0_main_New -> f565_0_iter_NULL : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, [ arg2P_5>1 && arg1P_5>3 ], cost: 1
      6: f1_0_main_New -> f717_0_reverseAcc_NONNULL : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [ arg2P_7>1 && arg1P_7>3 ], cost: 1
      8: f1_0_main_New -> f845_0_reverse_NONNULL : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ arg2P_9>1 && arg1P_9>3 ], cost: 1
      1: f230_0_alternate_NONNULL -> f230_0_alternate_NONNULL : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ 1+arg1P_2<=arg2 && arg2P_2<=arg1 && arg2P_2<=arg3 && arg2P_2<=arg4 && arg2>=1+arg3P_2 && arg2>=1+arg4P_2 && arg1>0 && arg2>0 && arg3>0 && arg4>0 && arg1P_2>-1 && arg2P_2>0 && arg3P_2>-1 && arg4P_2>-1 ], cost: 1
      3: f1096_0_append_NONNULL -> f1096_0_append_NONNULL : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [ arg2P_4<=arg2 && arg1>2 && arg2>0 && arg3>0 && arg1P_4>0 && arg2P_4>0 && arg3P_4>-1 ], cost: 1
     16: f1096_0_append_NONNULL -> [10] : [ arg2P_4<=arg2 && arg1>2 && arg2>0 && arg3>0 && arg2P_4>0 && arg1P_4>2 && arg3P_4>0 ], cost: NONTERM
     17: f1096_0_append_NONNULL -> [10] : [ arg2P_4<=arg2 && arg1>2 && arg2>0 && arg3>0 && arg2P_4>0 && -arg3P_4+arg3<=0 && arg1P_4>2 && arg3P_4>0 ], cost: NONTERM
      5: f565_0_iter_NULL -> f565_0_iter_NULL : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [ 2+arg1P_6<=arg1 && arg1P_6<=arg2 && 3+arg2P_6<=arg1 && 1+arg2P_6<=arg2 && arg1>2 && arg2>0 && arg1P_6>0 && arg2P_6>-1 ], cost: 1
      7: f717_0_reverseAcc_NONNULL -> f717_0_reverseAcc_NONNULL : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [ 2+arg1P_8<=arg1 && arg1P_8<=arg2 && 3+arg2P_8<=arg1 && 1+arg2P_8<=arg2 && arg1>2 && arg2>0 && arg1P_8>0 && arg2P_8>-1 ], cost: 1
      9: f845_0_reverse_NONNULL -> f845_0_reverse_NONNULL : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [ 2+arg1P_10<=arg1 && arg1P_10<=arg2 && 3+arg2P_10<=arg1 && 1+arg2P_10<=arg2 && arg1>2 && arg2>0 && arg1P_10>0 && arg2P_10>-1 ], cost: 1
     10: f845_0_reverse_NONNULL -> f1096_0_append_NONNULL : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, [ 1+arg1P_11<=arg1 && -1+arg1P_11<=arg2 && 1+arg2P_11<=arg1 && -1+arg2P_11<=arg2 && arg1>2 && arg2>0 && arg1P_11>1 && arg2P_11>1 && arg3P_11>-1 ], cost: 1
     11: f845_0_reverse_NONNULL -> f1225_0_reverse_InvokeMethod : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg3P_12, arg4'=arg4P_12, [ arg1>2 && arg2>0 && arg1P_12>4 ], cost: 1
     12: f845_0_reverse_NONNULL -> f1225_0_reverse_InvokeMethod : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [ arg1>2 && arg2>0 && arg1P_13>2 ], cost: 1
     14: f1225_0_reverse_InvokeMethod -> f1096_0_append_NONNULL : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_15, arg4'=arg4P_15, [ arg1P_15<=arg1 && 1+arg2P_15<=arg1 && arg1>2 && arg1P_15>2 && arg2P_15>1 && arg3P_15>-1 ], cost: 1
     15: __init -> f1_0_main_New : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_16, arg4'=arg4P_16, [], cost: 1

Chained accelerated rules (with incoming rules):
   Start location: __init
      0: f1_0_main_New -> f230_0_alternate_NONNULL : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, [ arg1P_1>3 && arg2P_1>3 && arg4P_1>3 && arg3P_1>3 ], cost: 1
      2: f1_0_main_New -> f1096_0_append_NONNULL : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg1P_3>3 && arg3P_3>-1 && arg2P_3>4 ], cost: 1
      4: f1_0_main_New -> f565_0_iter_NULL : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, [ arg2P_5>1 && arg1P_5>3 ], cost: 1
      6: f1_0_main_New -> f717_0_reverseAcc_NONNULL : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [ arg2P_7>1 && arg1P_7>3 ], cost: 1
      8: f1_0_main_New -> f845_0_reverse_NONNULL : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ arg2P_9>1 && arg1P_9>3 ], cost: 1
     18: f1_0_main_New -> f230_0_alternate_NONNULL : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1P_2>-1 && arg2P_2>0 && arg3P_2>-1 && arg4P_2>-1 ], cost: 2
     19: f1_0_main_New -> f1096_0_append_NONNULL : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [ arg1P_4>0 && arg2P_4>0 && arg3P_4>-1 ], cost: 2
     22: f1_0_main_New -> [10] : [], cost: NONTERM
     25: f1_0_main_New -> [10] : [], cost: NONTERM
     28: f1_0_main_New -> f565_0_iter_NULL : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [ arg1P_6>0 && arg2P_6>-1 ], cost: 2
     29: f1_0_main_New -> f717_0_reverseAcc_NONNULL : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [ arg1P_8>0 && arg2P_8>-1 ], cost: 2
     30: f1_0_main_New -> f845_0_reverse_NONNULL : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [ arg1P_10>0 && arg2P_10>-1 ], cost: 2
     10: f845_0_reverse_NONNULL -> f1096_0_append_NONNULL : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, [ 1+arg1P_11<=arg1 && -1+arg1P_11<=arg2 && 1+arg2P_11<=arg1 && -1+arg2P_11<=arg2 && arg1>2 && arg2>0 && arg1P_11>1 && arg2P_11>1 && arg3P_11>-1 ], cost: 1
     11: f845_0_reverse_NONNULL -> f1225_0_reverse_InvokeMethod : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg3P_12, arg4'=arg4P_12, [ arg1>2 && arg2>0 && arg1P_12>4 ], cost: 1
     12: f845_0_reverse_NONNULL -> f1225_0_reverse_InvokeMethod : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [ arg1>2 && arg2>0 && arg1P_13>2 ], cost: 1
     20: f845_0_reverse_NONNULL -> f1096_0_append_NONNULL : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [ arg1P_4>0 && arg2P_4>0 && arg3P_4>-1 && 3<=-1+arg1 && 3<=1+arg2 && arg2P_4<=-1+arg1 && arg2P_4<=1+arg2 ], cost: 2
     23: f845_0_reverse_NONNULL -> [10] : [ 3<=-1+arg1 && 3<=1+arg2 ], cost: NONTERM
     26: f845_0_reverse_NONNULL -> [10] : [ 3<=-1+arg1 && 3<=1+arg2 ], cost: NONTERM
     14: f1225_0_reverse_InvokeMethod -> f1096_0_append_NONNULL : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_15, arg4'=arg4P_15, [ arg1P_15<=arg1 && 1+arg2P_15<=arg1 && arg1>2 && arg1P_15>2 && arg2P_15>1 && arg3P_15>-1 ], cost: 1
     21: f1225_0_reverse_InvokeMethod -> f1096_0_append_NONNULL : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [ arg1>2 && arg1P_4>0 && arg2P_4>0 && arg3P_4>-1 && arg2P_4<=-1+arg1 ], cost: 2
     24: f1225_0_reverse_InvokeMethod -> [10] : [ arg1>2 ], cost: NONTERM
     27: f1225_0_reverse_InvokeMethod -> [10] : [ arg1>2 ], cost: NONTERM
     15: __init -> f1_0_main_New : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_16, arg4'=arg4P_16, [], cost: 1

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
      8: f1_0_main_New -> f845_0_reverse_NONNULL : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ arg2P_9>1 && arg1P_9>3 ], cost: 1
     22: f1_0_main_New -> [10] : [], cost: NONTERM
     25: f1_0_main_New -> [10] : [], cost: NONTERM
     30: f1_0_main_New -> f845_0_reverse_NONNULL : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [ arg1P_10>0 && arg2P_10>-1 ], cost: 2
     11: f845_0_reverse_NONNULL -> f1225_0_reverse_InvokeMethod : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg3P_12, arg4'=arg4P_12, [ arg1>2 && arg2>0 && arg1P_12>4 ], cost: 1
     12: f845_0_reverse_NONNULL -> f1225_0_reverse_InvokeMethod : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [ arg1>2 && arg2>0 && arg1P_13>2 ], cost: 1
     23: f845_0_reverse_NONNULL -> [10] : [ 3<=-1+arg1 && 3<=1+arg2 ], cost: NONTERM
     26: f845_0_reverse_NONNULL -> [10] : [ 3<=-1+arg1 && 3<=1+arg2 ], cost: NONTERM
     24: f1225_0_reverse_InvokeMethod -> [10] : [ arg1>2 ], cost: NONTERM
     27: f1225_0_reverse_InvokeMethod -> [10] : [ arg1>2 ], cost: NONTERM
     15: __init -> f1_0_main_New : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_16, arg4'=arg4P_16, [], cost: 1

Eliminated locations (on tree-shaped paths):
   Start location: __init
     23: f845_0_reverse_NONNULL -> [10] : [ 3<=-1+arg1 && 3<=1+arg2 ], cost: NONTERM
     26: f845_0_reverse_NONNULL -> [10] : [ 3<=-1+arg1 && 3<=1+arg2 ], cost: NONTERM
     35: f845_0_reverse_NONNULL -> [10] : [ arg1>2 && arg2>0 && arg1P_12>4 ], cost: NONTERM
     36: f845_0_reverse_NONNULL -> [10] : [ arg1>2 && arg2>0 && arg1P_12>4 ], cost: NONTERM
     37: f845_0_reverse_NONNULL -> [10] : [ arg1>2 && arg2>0 && arg1P_13>2 ], cost: NONTERM
     38: f845_0_reverse_NONNULL -> [10] : [ arg1>2 && arg2>0 && arg1P_13>2 ], cost: NONTERM
     31: __init -> f845_0_reverse_NONNULL : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ arg2P_9>1 && arg1P_9>3 ], cost: 2
     32: __init -> [10] : [], cost: NONTERM
     33: __init -> [10] : [], cost: NONTERM
     34: __init -> f845_0_reverse_NONNULL : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [ arg1P_10>0 && arg2P_10>-1 ], cost: 3

Merged rules:
   Start location: __init
     39: f845_0_reverse_NONNULL -> [10] : [ 3<=-1+arg1 && 3<=1+arg2 ], cost: NONTERM
     40: f845_0_reverse_NONNULL -> [10] : [ arg1>2 && arg2>0 && arg1P_12>4 ], cost: NONTERM
     41: f845_0_reverse_NONNULL -> [10] : [ arg1>2 && arg2>0 && arg1P_13>2 ], cost: NONTERM
     31: __init -> f845_0_reverse_NONNULL : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ arg2P_9>1 && arg1P_9>3 ], cost: 2
     34: __init -> f845_0_reverse_NONNULL : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [ arg1P_10>0 && arg2P_10>-1 ], cost: 3
     42: __init -> [10] : [], cost: NONTERM

Eliminated locations (on tree-shaped paths):
   Start location: __init
     42: __init -> [10] : [], cost: NONTERM
     43: __init -> [10] : [ arg2P_9>1 && arg1P_9>3 ], cost: NONTERM
     44: __init -> [10] : [ arg2P_9>1 && arg1P_9>3 && arg1P_12>4 ], cost: NONTERM
     45: __init -> [10] : [ arg2P_9>1 && arg1P_9>3 && arg1P_13>2 ], cost: NONTERM
     46: __init -> [10] : [ 3<=-1+arg1P_10 && 3<=1+arg2P_10 ], cost: NONTERM
     47: __init -> [10] : [ arg1P_10>2 && arg2P_10>0 && arg1P_12>4 ], cost: NONTERM
     48: __init -> [10] : [ arg1P_10>2 && arg2P_10>0 && arg1P_13>2 ], cost: NONTERM

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     42: __init -> [10] : [], cost: NONTERM
     43: __init -> [10] : [ arg2P_9>1 && arg1P_9>3 ], cost: NONTERM
     44: __init -> [10] : [ arg2P_9>1 && arg1P_9>3 && arg1P_12>4 ], cost: NONTERM
     45: __init -> [10] : [ arg2P_9>1 && arg1P_9>3 && arg1P_13>2 ], cost: NONTERM
     46: __init -> [10] : [ 3<=-1+arg1P_10 && 3<=1+arg2P_10 ], cost: NONTERM
     47: __init -> [10] : [ arg1P_10>2 && arg2P_10>0 && arg1P_12>4 ], cost: NONTERM
     48: __init -> [10] : [ arg1P_10>2 && arg2P_10>0 && arg1P_13>2 ], cost: NONTERM

Computing asymptotic complexity for rule 42
   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:  []

NO