WORST_CASE(INF,?)

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

Initial linear ITS problem
   Start location: __init
      0: f1_0_main_Load -> f115_0_loop_LE : arg1'=arg1P_1, arg2'=arg2P_1, [ arg1>0 && arg2>-1 && 0==arg1P_1 && arg2==arg2P_1 ], cost: 1
      1: f115_0_loop_LE -> f115_0_loop_LE : arg1'=arg1P_2, arg2'=arg2P_2, [ 1==arg2 && 1==arg1P_2 && 2==arg2P_2 ], cost: 1
      2: f115_0_loop_LE -> f115_0_loop_LE : arg1'=arg1P_3, arg2'=arg2P_3, [ arg2<10 && arg2>1 && 1==arg1 && 1==arg1P_3 && 1+arg2==arg2P_3 ], cost: 1
      3: f115_0_loop_LE -> f115_0_loop_LE : arg1'=arg1P_4, arg2'=arg2P_4, [ arg2<10 && arg2>1 && 0==arg1 && 0==arg1P_4 && -1+arg2==arg2P_4 ], cost: 1
      4: f115_0_loop_LE -> f115_0_loop_LE : arg1'=arg1P_5, arg2'=arg2P_5, [ arg2>10 && 1==arg1 && 1==arg1P_5 && 1+arg2==arg2P_5 ], cost: 1
      5: f115_0_loop_LE -> f115_0_loop_LE : arg1'=arg1P_6, arg2'=arg2P_6, [ arg2>10 && 0==arg1 && 0==arg1P_6 && -1+arg2==arg2P_6 ], cost: 1
      6: f115_0_loop_LE -> f115_0_loop_LE : arg1'=arg1P_7, arg2'=arg2P_7, [ 10==arg2 && 0==arg1P_7 && 9==arg2P_7 ], cost: 1
      7: __init -> f1_0_main_Load : arg1'=arg1P_8, arg2'=arg2P_8, [], cost: 1

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

Simplified all rules, resulting in:
   Start location: __init
      0: f1_0_main_Load -> f115_0_loop_LE : arg1'=0, [ arg1>0 && arg2>-1 ], cost: 1
      1: f115_0_loop_LE -> f115_0_loop_LE : arg1'=1, arg2'=2, [ 1==arg2 ], cost: 1
      2: f115_0_loop_LE -> f115_0_loop_LE : arg1'=1, arg2'=1+arg2, [ arg2<10 && arg2>1 && 1==arg1 ], cost: 1
      3: f115_0_loop_LE -> f115_0_loop_LE : arg1'=0, arg2'=-1+arg2, [ arg2<10 && arg2>1 && 0==arg1 ], cost: 1
      4: f115_0_loop_LE -> f115_0_loop_LE : arg1'=1, arg2'=1+arg2, [ arg2>10 && 1==arg1 ], cost: 1
      5: f115_0_loop_LE -> f115_0_loop_LE : arg1'=0, arg2'=-1+arg2, [ arg2>10 && 0==arg1 ], cost: 1
      6: f115_0_loop_LE -> f115_0_loop_LE : arg1'=0, arg2'=9, [ 10==arg2 ], cost: 1
      7: __init -> f1_0_main_Load : arg1'=arg1P_8, arg2'=arg2P_8, [], cost: 1

### Simplification by acceleration and chaining ###

Accelerating simple loops of location 1.
   Accelerating the following rules:
      1: f115_0_loop_LE -> f115_0_loop_LE : arg1'=1, arg2'=2, [ 1==arg2 ], cost: 1
      2: f115_0_loop_LE -> f115_0_loop_LE : arg1'=1, arg2'=1+arg2, [ arg2<10 && arg2>1 && 1==arg1 ], cost: 1
      3: f115_0_loop_LE -> f115_0_loop_LE : arg1'=0, arg2'=-1+arg2, [ arg2<10 && arg2>1 && 0==arg1 ], cost: 1
      4: f115_0_loop_LE -> f115_0_loop_LE : arg1'=1, arg2'=1+arg2, [ arg2>10 && 1==arg1 ], cost: 1
      5: f115_0_loop_LE -> f115_0_loop_LE : arg1'=0, arg2'=-1+arg2, [ arg2>10 && 0==arg1 ], cost: 1
      6: f115_0_loop_LE -> f115_0_loop_LE : arg1'=0, arg2'=9, [ 10==arg2 ], cost: 1

   Accelerated rule 1 with metering function 2-arg2, yielding the new rule 8.
   Accelerated rule 2 with metering function 10-arg2, yielding the new rule 9.
   Accelerated rule 3 with metering function -1+arg2, yielding the new rule 10.
   Accelerated rule 4 with NONTERM, yielding the new rule 11.
   Accelerated rule 5 with metering function -10+arg2, yielding the new rule 12.
   Accelerated rule 6 with metering function -9+arg2, yielding the new rule 13.
   Removing the simple loops: 1 2 3 4 5 6.

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
      0: f1_0_main_Load -> f115_0_loop_LE : arg1'=0, [ arg1>0 && arg2>-1 ], cost: 1
      8: f115_0_loop_LE -> f115_0_loop_LE : arg1'=1, arg2'=2, [ 1==arg2 ], cost: 2-arg2
      9: f115_0_loop_LE -> f115_0_loop_LE : arg1'=1, arg2'=10, [ arg2<10 && arg2>1 && 1==arg1 ], cost: 10-arg2
     10: f115_0_loop_LE -> f115_0_loop_LE : arg1'=0, arg2'=1, [ arg2<10 && arg2>1 && 0==arg1 ], cost: -1+arg2
     11: f115_0_loop_LE -> [3] : [ arg2>10 && 1==arg1 ], cost: NONTERM
     12: f115_0_loop_LE -> f115_0_loop_LE : arg1'=0, arg2'=10, [ arg2>10 && 0==arg1 ], cost: -10+arg2
     13: f115_0_loop_LE -> f115_0_loop_LE : arg1'=0, arg2'=9, [ 10==arg2 ], cost: -9+arg2
      7: __init -> f1_0_main_Load : arg1'=arg1P_8, arg2'=arg2P_8, [], cost: 1

Chained accelerated rules (with incoming rules):
   Start location: __init
      0: f1_0_main_Load -> f115_0_loop_LE : arg1'=0, [ arg1>0 && arg2>-1 ], cost: 1
     14: f1_0_main_Load -> f115_0_loop_LE : arg1'=1, arg2'=2, [ arg1>0 && 1==arg2 ], cost: 3-arg2
     15: f1_0_main_Load -> f115_0_loop_LE : arg1'=0, arg2'=1, [ arg1>0 && arg2<10 && arg2>1 ], cost: arg2
     16: f1_0_main_Load -> f115_0_loop_LE : arg1'=0, arg2'=10, [ arg1>0 && arg2>10 ], cost: -9+arg2
     17: f1_0_main_Load -> f115_0_loop_LE : arg1'=0, arg2'=9, [ arg1>0 && 10==arg2 ], cost: -8+arg2
      7: __init -> f1_0_main_Load : arg1'=arg1P_8, arg2'=arg2P_8, [], cost: 1

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
     14: f1_0_main_Load -> f115_0_loop_LE : arg1'=1, arg2'=2, [ arg1>0 && 1==arg2 ], cost: 3-arg2
     15: f1_0_main_Load -> f115_0_loop_LE : arg1'=0, arg2'=1, [ arg1>0 && arg2<10 && arg2>1 ], cost: arg2
     16: f1_0_main_Load -> f115_0_loop_LE : arg1'=0, arg2'=10, [ arg1>0 && arg2>10 ], cost: -9+arg2
     17: f1_0_main_Load -> f115_0_loop_LE : arg1'=0, arg2'=9, [ arg1>0 && 10==arg2 ], cost: -8+arg2
      7: __init -> f1_0_main_Load : arg1'=arg1P_8, arg2'=arg2P_8, [], cost: 1

Eliminated locations (on tree-shaped paths):
   Start location: __init
     18: __init -> f115_0_loop_LE : arg1'=1, arg2'=2, [ arg1P_8>0 && 1==arg2P_8 ], cost: 4-arg2P_8
     19: __init -> f115_0_loop_LE : arg1'=0, arg2'=1, [ arg1P_8>0 && arg2P_8<10 && arg2P_8>1 ], cost: 1+arg2P_8
     20: __init -> f115_0_loop_LE : arg1'=0, arg2'=10, [ arg1P_8>0 && arg2P_8>10 ], cost: -8+arg2P_8
     21: __init -> f115_0_loop_LE : arg1'=0, arg2'=9, [ arg1P_8>0 && 10==arg2P_8 ], cost: -7+arg2P_8

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     18: __init -> f115_0_loop_LE : arg1'=1, arg2'=2, [ arg1P_8>0 && 1==arg2P_8 ], cost: 4-arg2P_8
     19: __init -> f115_0_loop_LE : arg1'=0, arg2'=1, [ arg1P_8>0 && arg2P_8<10 && arg2P_8>1 ], cost: 1+arg2P_8
     20: __init -> f115_0_loop_LE : arg1'=0, arg2'=10, [ arg1P_8>0 && arg2P_8>10 ], cost: -8+arg2P_8
     21: __init -> f115_0_loop_LE : arg1'=0, arg2'=9, [ arg1P_8>0 && 10==arg2P_8 ], cost: -7+arg2P_8

Computing asymptotic complexity for rule 18
   Could not solve the limit problem.
   Resulting cost 0 has complexity: Unknown

Computing asymptotic complexity for rule 19
   Could not solve the limit problem.
   Resulting cost 0 has complexity: Unknown

Computing asymptotic complexity for rule 20
   Solved the limit problem by the following transformations:
      Created initial limit problem:
      arg1P_8 (+/+!), -10+arg2P_8 (+/+!), -8+arg2P_8 (+) [not solved]

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

      applying transformation rule (C) using substitution {arg1P_8==1,arg2P_8==n}
      resulting limit problem:
      [solved]

   Solution:
      arg1P_8 / 1
      arg2P_8 / n
   Resulting cost -8+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: -8+n
   Rule cost:   -8+arg2P_8
   Rule guard:  [ arg1P_8>0 && arg2P_8>10 ]

WORST_CASE(INF,?)