NO

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

Initial linear ITS problem
   Start location: __init
      0: f238_0_createIntList_Return -> f376_0_main_FieldAccess : arg1'=arg1P_1, arg2'=arg2P_1, [ arg1P_1<=arg1 && arg1>-1 && arg1P_1>-1 ], cost: 1
      2: f376_0_main_FieldAccess -> f376_0_main_FieldAccess : arg1'=arg1P_3, arg2'=arg2P_3, [ arg1P_3<=arg1 && x7_1>0 && arg1>0 && arg1P_3>0 ], cost: 1
      1: f1_0_main_Load -> f376_0_main_FieldAccess : arg1'=arg1P_2, arg2'=arg2P_2, [ arg1>0 && arg1P_2>-1 ], cost: 1
      3: f1_0_main_Load -> f491_0_createIntList_LE : arg1'=arg1P_4, arg2'=arg2P_4, [ arg2>-1 && arg1P_4>-1 && arg1>0 && 1==arg2P_4 ], cost: 1
      4: f491_0_createIntList_LE -> f491_0_createIntList_LE : arg1'=arg1P_5, arg2'=arg2P_5, [ arg1>0 && arg2>0 && -1+arg1==arg1P_5 && 1+arg2==arg2P_5 ], cost: 1
      5: __init -> f1_0_main_Load : arg1'=arg1P_6, arg2'=arg2P_6, [], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
      5: __init -> f1_0_main_Load : arg1'=arg1P_6, arg2'=arg2P_6, [], cost: 1

Removed unreachable and leaf rules:
   Start location: __init
      2: f376_0_main_FieldAccess -> f376_0_main_FieldAccess : arg1'=arg1P_3, arg2'=arg2P_3, [ arg1P_3<=arg1 && x7_1>0 && arg1>0 && arg1P_3>0 ], cost: 1
      1: f1_0_main_Load -> f376_0_main_FieldAccess : arg1'=arg1P_2, arg2'=arg2P_2, [ arg1>0 && arg1P_2>-1 ], cost: 1
      3: f1_0_main_Load -> f491_0_createIntList_LE : arg1'=arg1P_4, arg2'=arg2P_4, [ arg2>-1 && arg1P_4>-1 && arg1>0 && 1==arg2P_4 ], cost: 1
      4: f491_0_createIntList_LE -> f491_0_createIntList_LE : arg1'=arg1P_5, arg2'=arg2P_5, [ arg1>0 && arg2>0 && -1+arg1==arg1P_5 && 1+arg2==arg2P_5 ], cost: 1
      5: __init -> f1_0_main_Load : arg1'=arg1P_6, arg2'=arg2P_6, [], cost: 1

Simplified all rules, resulting in:
   Start location: __init
      2: f376_0_main_FieldAccess -> f376_0_main_FieldAccess : arg1'=arg1P_3, arg2'=arg2P_3, [ arg1P_3<=arg1 && arg1>0 && arg1P_3>0 ], cost: 1
      1: f1_0_main_Load -> f376_0_main_FieldAccess : arg1'=arg1P_2, arg2'=arg2P_2, [ arg1>0 && arg1P_2>-1 ], cost: 1
      3: f1_0_main_Load -> f491_0_createIntList_LE : arg1'=arg1P_4, arg2'=1, [ arg2>-1 && arg1P_4>-1 && arg1>0 ], cost: 1
      4: f491_0_createIntList_LE -> f491_0_createIntList_LE : arg1'=-1+arg1, arg2'=1+arg2, [ arg1>0 && arg2>0 ], cost: 1
      5: __init -> f1_0_main_Load : arg1'=arg1P_6, arg2'=arg2P_6, [], cost: 1

### Simplification by acceleration and chaining ###

Accelerating simple loops of location 1.
   Accelerating the following rules:
      2: f376_0_main_FieldAccess -> f376_0_main_FieldAccess : arg1'=arg1P_3, arg2'=arg2P_3, [ arg1P_3<=arg1 && arg1>0 && arg1P_3>0 ], cost: 1

   Accelerated rule 2 with non-termination, yielding the new rule 6.
[accelerate] Nesting with 0 inner and 0 outer candidates
   Removing the simple loops: 2.

Accelerating simple loops of location 3.
   Accelerating the following rules:
      4: f491_0_createIntList_LE -> f491_0_createIntList_LE : arg1'=-1+arg1, arg2'=1+arg2, [ arg1>0 && arg2>0 ], cost: 1

   Accelerated rule 4 with backward acceleration, yielding the new rule 7.
[accelerate] Nesting with 1 inner and 1 outer candidates
   Removing the simple loops: 4.

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
      6: f376_0_main_FieldAccess -> [5] : [ arg1P_3<=arg1 && arg1>0 && arg1P_3>0 ], cost: NONTERM
      1: f1_0_main_Load -> f376_0_main_FieldAccess : arg1'=arg1P_2, arg2'=arg2P_2, [ arg1>0 && arg1P_2>-1 ], cost: 1
      3: f1_0_main_Load -> f491_0_createIntList_LE : arg1'=arg1P_4, arg2'=1, [ arg2>-1 && arg1P_4>-1 && arg1>0 ], cost: 1
      7: f491_0_createIntList_LE -> f491_0_createIntList_LE : arg1'=0, arg2'=arg2+arg1, [ arg2>0 && arg1>=0 ], cost: arg1
      5: __init -> f1_0_main_Load : arg1'=arg1P_6, arg2'=arg2P_6, [], cost: 1

Chained accelerated rules (with incoming rules):
   Start location: __init
      1: f1_0_main_Load -> f376_0_main_FieldAccess : arg1'=arg1P_2, arg2'=arg2P_2, [ arg1>0 && arg1P_2>-1 ], cost: 1
      3: f1_0_main_Load -> f491_0_createIntList_LE : arg1'=arg1P_4, arg2'=1, [ arg2>-1 && arg1P_4>-1 && arg1>0 ], cost: 1
      8: f1_0_main_Load -> [5] : [ arg1>0 ], cost: NONTERM
      9: f1_0_main_Load -> f491_0_createIntList_LE : arg1'=0, arg2'=1+arg1P_4, [ arg2>-1 && arg1P_4>-1 && arg1>0 ], cost: 1+arg1P_4
      5: __init -> f1_0_main_Load : arg1'=arg1P_6, arg2'=arg2P_6, [], cost: 1

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
      8: f1_0_main_Load -> [5] : [ arg1>0 ], cost: NONTERM
      9: f1_0_main_Load -> f491_0_createIntList_LE : arg1'=0, arg2'=1+arg1P_4, [ arg2>-1 && arg1P_4>-1 && arg1>0 ], cost: 1+arg1P_4
      5: __init -> f1_0_main_Load : arg1'=arg1P_6, arg2'=arg2P_6, [], cost: 1

Eliminated locations (on tree-shaped paths):
   Start location: __init
     10: __init -> [5] : [ arg1P_6>0 ], cost: NONTERM
     11: __init -> f491_0_createIntList_LE : arg1'=0, arg2'=1+arg1P_4, [ arg2P_6>-1 && arg1P_4>-1 && arg1P_6>0 ], cost: 2+arg1P_4

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     10: __init -> [5] : [ arg1P_6>0 ], cost: NONTERM
     11: __init -> f491_0_createIntList_LE : arg1'=0, arg2'=1+arg1P_4, [ arg2P_6>-1 && arg1P_4>-1 && arg1P_6>0 ], cost: 2+arg1P_4

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

NO