WORST_CASE(INF,?)

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

Initial linear ITS problem
   Start location: __init
      0: f171_0_createList_Return -> f231_0_random_ArrayAccess : arg1'=arg1P_1, arg2'=arg2P_1, [ arg1>0 ], cost: 1
      4: f231_0_random_ArrayAccess -> f352_0_appE_GT : arg1'=arg1P_5, arg2'=arg2P_5, [ arg1P_5>0 && arg1>1 ], cost: 1
      1: f1_0_main_Load -> f231_0_random_ArrayAccess : arg1'=arg1P_2, arg2'=arg2P_2, [ arg1>0 && arg2==arg1P_2 ], cost: 1
      2: f1_0_main_Load -> f197_0_createList_LE : arg1'=arg1P_3, arg2'=arg2P_3, [ arg2>-1 && arg1P_3>-1 && arg1>0 ], cost: 1
      3: f197_0_createList_LE -> f197_0_createList_LE : arg1'=arg1P_4, arg2'=arg2P_4, [ arg1>0 && -1+arg1==arg1P_4 ], cost: 1
      5: f352_0_appE_GT -> f352_0_appE_GT : arg1'=arg1P_6, arg2'=arg2P_6, [ arg1>0 && -1+arg1==arg1P_6 ], cost: 1
      6: __init -> f1_0_main_Load : arg1'=arg1P_7, arg2'=arg2P_7, [], cost: 1

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

Removed unreachable and leaf rules:
   Start location: __init
      4: f231_0_random_ArrayAccess -> f352_0_appE_GT : arg1'=arg1P_5, arg2'=arg2P_5, [ arg1P_5>0 && arg1>1 ], cost: 1
      1: f1_0_main_Load -> f231_0_random_ArrayAccess : arg1'=arg1P_2, arg2'=arg2P_2, [ arg1>0 && arg2==arg1P_2 ], cost: 1
      2: f1_0_main_Load -> f197_0_createList_LE : arg1'=arg1P_3, arg2'=arg2P_3, [ arg2>-1 && arg1P_3>-1 && arg1>0 ], cost: 1
      3: f197_0_createList_LE -> f197_0_createList_LE : arg1'=arg1P_4, arg2'=arg2P_4, [ arg1>0 && -1+arg1==arg1P_4 ], cost: 1
      5: f352_0_appE_GT -> f352_0_appE_GT : arg1'=arg1P_6, arg2'=arg2P_6, [ arg1>0 && -1+arg1==arg1P_6 ], cost: 1
      6: __init -> f1_0_main_Load : arg1'=arg1P_7, arg2'=arg2P_7, [], cost: 1

Simplified all rules, resulting in:
   Start location: __init
      4: f231_0_random_ArrayAccess -> f352_0_appE_GT : arg1'=arg1P_5, arg2'=arg2P_5, [ arg1P_5>0 && arg1>1 ], cost: 1
      1: f1_0_main_Load -> f231_0_random_ArrayAccess : arg1'=arg2, arg2'=arg2P_2, [ arg1>0 ], cost: 1
      2: f1_0_main_Load -> f197_0_createList_LE : arg1'=arg1P_3, arg2'=arg2P_3, [ arg2>-1 && arg1P_3>-1 && arg1>0 ], cost: 1
      3: f197_0_createList_LE -> f197_0_createList_LE : arg1'=-1+arg1, arg2'=arg2P_4, [ arg1>0 ], cost: 1
      5: f352_0_appE_GT -> f352_0_appE_GT : arg1'=-1+arg1, arg2'=arg2P_6, [ arg1>0 ], cost: 1
      6: __init -> f1_0_main_Load : arg1'=arg1P_7, arg2'=arg2P_7, [], cost: 1

### Simplification by acceleration and chaining ###

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

   Accelerated rule 3 with metering function arg1, yielding the new rule 7.
   Removing the simple loops: 3.

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

   Accelerated rule 5 with metering function arg1, yielding the new rule 8.
   Removing the simple loops: 5.

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
      4: f231_0_random_ArrayAccess -> f352_0_appE_GT : arg1'=arg1P_5, arg2'=arg2P_5, [ arg1P_5>0 && arg1>1 ], cost: 1
      1: f1_0_main_Load -> f231_0_random_ArrayAccess : arg1'=arg2, arg2'=arg2P_2, [ arg1>0 ], cost: 1
      2: f1_0_main_Load -> f197_0_createList_LE : arg1'=arg1P_3, arg2'=arg2P_3, [ arg2>-1 && arg1P_3>-1 && arg1>0 ], cost: 1
      7: f197_0_createList_LE -> f197_0_createList_LE : arg1'=0, arg2'=arg2P_4, [ arg1>0 ], cost: arg1
      8: f352_0_appE_GT -> f352_0_appE_GT : arg1'=0, arg2'=arg2P_6, [ arg1>0 ], cost: arg1
      6: __init -> f1_0_main_Load : arg1'=arg1P_7, arg2'=arg2P_7, [], cost: 1

Chained accelerated rules (with incoming rules):
   Start location: __init
      4: f231_0_random_ArrayAccess -> f352_0_appE_GT : arg1'=arg1P_5, arg2'=arg2P_5, [ arg1P_5>0 && arg1>1 ], cost: 1
     10: f231_0_random_ArrayAccess -> f352_0_appE_GT : arg1'=0, arg2'=arg2P_6, [ arg1P_5>0 && arg1>1 ], cost: 1+arg1P_5
      1: f1_0_main_Load -> f231_0_random_ArrayAccess : arg1'=arg2, arg2'=arg2P_2, [ arg1>0 ], cost: 1
      2: f1_0_main_Load -> f197_0_createList_LE : arg1'=arg1P_3, arg2'=arg2P_3, [ arg2>-1 && arg1P_3>-1 && arg1>0 ], cost: 1
      9: f1_0_main_Load -> f197_0_createList_LE : arg1'=0, arg2'=arg2P_4, [ arg2>-1 && arg1>0 && arg1P_3>0 ], cost: 1+arg1P_3
      6: __init -> f1_0_main_Load : arg1'=arg1P_7, arg2'=arg2P_7, [], cost: 1

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
     10: f231_0_random_ArrayAccess -> f352_0_appE_GT : arg1'=0, arg2'=arg2P_6, [ arg1P_5>0 && arg1>1 ], cost: 1+arg1P_5
      1: f1_0_main_Load -> f231_0_random_ArrayAccess : arg1'=arg2, arg2'=arg2P_2, [ arg1>0 ], cost: 1
      9: f1_0_main_Load -> f197_0_createList_LE : arg1'=0, arg2'=arg2P_4, [ arg2>-1 && arg1>0 && arg1P_3>0 ], cost: 1+arg1P_3
      6: __init -> f1_0_main_Load : arg1'=arg1P_7, arg2'=arg2P_7, [], cost: 1

Eliminated locations (on linear paths):
   Start location: __init
      9: f1_0_main_Load -> f197_0_createList_LE : arg1'=0, arg2'=arg2P_4, [ arg2>-1 && arg1>0 && arg1P_3>0 ], cost: 1+arg1P_3
     11: f1_0_main_Load -> f352_0_appE_GT : arg1'=0, arg2'=arg2P_6, [ arg1>0 && arg1P_5>0 && arg2>1 ], cost: 2+arg1P_5
      6: __init -> f1_0_main_Load : arg1'=arg1P_7, arg2'=arg2P_7, [], cost: 1

Eliminated locations (on tree-shaped paths):
   Start location: __init
     12: __init -> f197_0_createList_LE : arg1'=0, arg2'=arg2P_4, [ arg2P_7>-1 && arg1P_7>0 && arg1P_3>0 ], cost: 2+arg1P_3
     13: __init -> f352_0_appE_GT : arg1'=0, arg2'=arg2P_6, [ arg1P_7>0 && arg1P_5>0 && arg2P_7>1 ], cost: 3+arg1P_5

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     12: __init -> f197_0_createList_LE : arg1'=0, arg2'=arg2P_4, [ arg2P_7>-1 && arg1P_7>0 && arg1P_3>0 ], cost: 2+arg1P_3
     13: __init -> f352_0_appE_GT : arg1'=0, arg2'=arg2P_6, [ arg1P_7>0 && arg1P_5>0 && arg2P_7>1 ], cost: 3+arg1P_5

Computing asymptotic complexity for rule 12
   Solved the limit problem by the following transformations:
      Created initial limit problem:
      arg1P_7 (+/+!), 1+arg2P_7 (+/+!), 2+arg1P_3 (+), arg1P_3 (+/+!) [not solved]

      removing all constraints (solved by SMT)
      resulting limit problem: [solved]

      applying transformation rule (C) using substitution {arg1P_7==n,arg2P_7==n,arg1P_3==n}
      resulting limit problem:
      [solved]

   Solution:
      arg1P_7 / n
      arg2P_7 / n
      arg1P_3 / n
   Resulting cost 2+n has complexity: Unbounded

Found new complexity Unbounded.

Obtained the following overall complexity (w.r.t. the length of the input n):
   Complexity:  Unbounded
   Cpx degree:  Unbounded
   Solved cost: 2+n
   Rule cost:   2+arg1P_3
   Rule guard:  [ arg2P_7>-1 && arg1P_7>0 && arg1P_3>0 ]

WORST_CASE(INF,?)