WORST_CASE(Omega(1),?)

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

Initial linear ITS problem
   Start location: __init
      0: f1_0_main_ConstantStackPush -> f46_0_main_GE : arg1'=arg1P_1, [ 0==arg1P_1 ], cost: 1
      1: f46_0_main_GE -> f46_0_main_GE : arg1'=arg1P_2, [ arg1<100 && 1+arg1==arg1P_2 ], cost: 1
      2: f46_0_main_GE -> f74_0_main_GE : arg1'=arg1P_3, [ arg1>99 && 5==arg1P_3 ], cost: 1
      3: f74_0_main_GE -> f74_0_main_GE : arg1'=arg1P_4, [ arg1<21 && 3+arg1==arg1P_4 ], cost: 1
      4: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P_5, [], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
      4: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P_5, [], cost: 1

Simplified all rules, resulting in:
   Start location: __init
      0: f1_0_main_ConstantStackPush -> f46_0_main_GE : arg1'=0, [], cost: 1
      1: f46_0_main_GE -> f46_0_main_GE : arg1'=1+arg1, [ arg1<100 ], cost: 1
      2: f46_0_main_GE -> f74_0_main_GE : arg1'=5, [ arg1>99 ], cost: 1
      3: f74_0_main_GE -> f74_0_main_GE : arg1'=3+arg1, [ arg1<21 ], cost: 1
      4: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P_5, [], cost: 1

### Simplification by acceleration and chaining ###

Accelerating simple loops of location 1.
   Accelerating the following rules:
      1: f46_0_main_GE -> f46_0_main_GE : arg1'=1+arg1, [ arg1<100 ], cost: 1

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

Accelerating simple loops of location 2.
   Accelerating the following rules:
      3: f74_0_main_GE -> f74_0_main_GE : arg1'=3+arg1, [ arg1<21 ], cost: 1

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

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
      0: f1_0_main_ConstantStackPush -> f46_0_main_GE : arg1'=0, [], cost: 1
      2: f46_0_main_GE -> f74_0_main_GE : arg1'=5, [ arg1>99 ], cost: 1
      5: f46_0_main_GE -> f46_0_main_GE : arg1'=100, [ 100-arg1>=0 ], cost: 100-arg1
      6: f74_0_main_GE -> f74_0_main_GE : arg1'=3*k_1+arg1, [ k_1>=0 && -3+3*k_1+arg1<21 ], cost: k_1
      4: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P_5, [], cost: 1

Chained accelerated rules (with incoming rules):
   Start location: __init
      0: f1_0_main_ConstantStackPush -> f46_0_main_GE : arg1'=0, [], cost: 1
      7: f1_0_main_ConstantStackPush -> f46_0_main_GE : arg1'=100, [], cost: 101
      2: f46_0_main_GE -> f74_0_main_GE : arg1'=5, [ arg1>99 ], cost: 1
      8: f46_0_main_GE -> f74_0_main_GE : arg1'=5+3*k_1, [ arg1>99 && k_1>=0 && 2+3*k_1<21 ], cost: 1+k_1
      4: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P_5, [], cost: 1

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
      0: f1_0_main_ConstantStackPush -> f46_0_main_GE : arg1'=0, [], cost: 1
      7: f1_0_main_ConstantStackPush -> f46_0_main_GE : arg1'=100, [], cost: 101
      8: f46_0_main_GE -> f74_0_main_GE : arg1'=5+3*k_1, [ arg1>99 && k_1>=0 && 2+3*k_1<21 ], cost: 1+k_1
      4: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P_5, [], cost: 1

Eliminated locations (on tree-shaped paths):
   Start location: __init
      8: f46_0_main_GE -> f74_0_main_GE : arg1'=5+3*k_1, [ arg1>99 && k_1>=0 && 2+3*k_1<21 ], cost: 1+k_1
      9: __init -> f46_0_main_GE : arg1'=0, [], cost: 2
     10: __init -> f46_0_main_GE : arg1'=100, [], cost: 102

Eliminated locations (on tree-shaped paths):
   Start location: __init
     11: __init -> f74_0_main_GE : arg1'=5+3*k_1, [ k_1>=0 && 2+3*k_1<21 ], cost: 103+k_1

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     11: __init -> f74_0_main_GE : arg1'=5+3*k_1, [ k_1>=0 && 2+3*k_1<21 ], cost: 103+k_1

Computing asymptotic complexity for rule 11
   Resulting cost 0 has complexity: Unknown

Obtained the following overall complexity (w.r.t. the length of the input n):
   Complexity:  Constant
   Cpx degree:  0
   Solved cost: 1
   Rule cost:   1
   Rule guard:  []

WORST_CASE(Omega(1),?)