WORST_CASE(Omega(1),?)

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

Initial linear ITS problem
   Start location: __init
      0: f1_0_main_ConstantStackPush -> f458_0_sort_GE : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, [ 1==arg1P_1 ], cost: 1
      1: f458_0_sort_GE -> f543_0_sort_GE : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, [ arg1>0 && arg1<100 && arg1==arg1P_2 && 0==arg2P_2 && 100-arg1==arg3P_2 ], cost: 1
      2: f543_0_sort_GE -> f458_0_sort_GE : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, [ arg3<=arg2 && 1+arg1==arg1P_3 ], cost: 1
      3: f543_0_sort_GE -> f543_0_sort_GE : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, [ arg2<100 && arg3>arg2 && arg2>-1 && arg2<99 && x8_1<=x7_1 && arg1>0 && arg1==arg1P_4 && 1+arg2==arg2P_4 && 100-arg1==arg3P_4 ], cost: 1
      4: f543_0_sort_GE -> f543_0_sort_GE : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, [ arg2<100 && arg3>arg2 && arg2>-1 && arg2<99 && arg1>0 && x13_1>x12_1 && arg1==arg1P_5 && 1+arg2==arg2P_5 && 100-arg1==arg3P_5 ], cost: 1
      5: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, [], cost: 1

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

Simplified all rules, resulting in:
   Start location: __init
      0: f1_0_main_ConstantStackPush -> f458_0_sort_GE : arg1'=1, arg2'=arg2P_1, arg3'=arg3P_1, [], cost: 1
      1: f458_0_sort_GE -> f543_0_sort_GE : arg2'=0, arg3'=100-arg1, [ arg1>0 && arg1<100 ], cost: 1
      2: f543_0_sort_GE -> f458_0_sort_GE : arg1'=1+arg1, arg2'=arg2P_3, arg3'=arg3P_3, [ arg3<=arg2 ], cost: 1
      4: f543_0_sort_GE -> f543_0_sort_GE : arg2'=1+arg2, arg3'=100-arg1, [ arg3>arg2 && arg2>-1 && arg2<99 && arg1>0 ], cost: 1
      5: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, [], cost: 1

### Simplification by acceleration and chaining ###

Accelerating simple loops of location 2.
   Accelerating the following rules:
      4: f543_0_sort_GE -> f543_0_sort_GE : arg2'=1+arg2, arg3'=100-arg1, [ arg3>arg2 && arg2>-1 && arg2<99 && arg1>0 ], cost: 1

   Failed to prove monotonicity of the guard of rule 4.
[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_ConstantStackPush -> f458_0_sort_GE : arg1'=1, arg2'=arg2P_1, arg3'=arg3P_1, [], cost: 1
      1: f458_0_sort_GE -> f543_0_sort_GE : arg2'=0, arg3'=100-arg1, [ arg1>0 && arg1<100 ], cost: 1
      2: f543_0_sort_GE -> f458_0_sort_GE : arg1'=1+arg1, arg2'=arg2P_3, arg3'=arg3P_3, [ arg3<=arg2 ], cost: 1
      4: f543_0_sort_GE -> f543_0_sort_GE : arg2'=1+arg2, arg3'=100-arg1, [ arg3>arg2 && arg2>-1 && arg2<99 && arg1>0 ], cost: 1
      5: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, [], cost: 1

Chained accelerated rules (with incoming rules):
   Start location: __init
      0: f1_0_main_ConstantStackPush -> f458_0_sort_GE : arg1'=1, arg2'=arg2P_1, arg3'=arg3P_1, [], cost: 1
      1: f458_0_sort_GE -> f543_0_sort_GE : arg2'=0, arg3'=100-arg1, [ arg1>0 && arg1<100 ], cost: 1
      6: f458_0_sort_GE -> f543_0_sort_GE : arg2'=1, arg3'=100-arg1, [ arg1>0 && arg1<100 ], cost: 2
      2: f543_0_sort_GE -> f458_0_sort_GE : arg1'=1+arg1, arg2'=arg2P_3, arg3'=arg3P_3, [ arg3<=arg2 ], cost: 1
      5: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, [], cost: 1

Eliminated locations (on linear paths):
   Start location: __init
      1: f458_0_sort_GE -> f543_0_sort_GE : arg2'=0, arg3'=100-arg1, [ arg1>0 && arg1<100 ], cost: 1
      6: f458_0_sort_GE -> f543_0_sort_GE : arg2'=1, arg3'=100-arg1, [ arg1>0 && arg1<100 ], cost: 2
      2: f543_0_sort_GE -> f458_0_sort_GE : arg1'=1+arg1, arg2'=arg2P_3, arg3'=arg3P_3, [ arg3<=arg2 ], cost: 1
      7: __init -> f458_0_sort_GE : arg1'=1, arg2'=arg2P_1, arg3'=arg3P_1, [], cost: 2

Eliminated locations (on tree-shaped paths):
   Start location: __init
      8: f458_0_sort_GE -> f458_0_sort_GE : arg1'=1+arg1, arg2'=arg2P_3, arg3'=arg3P_3, [ arg1<100 && 100-arg1<=1 ], cost: 3
      7: __init -> f458_0_sort_GE : arg1'=1, arg2'=arg2P_1, arg3'=arg3P_1, [], cost: 2

Accelerating simple loops of location 1.
   Simplified some of the simple loops (and removed duplicate rules).
   Accelerating the following rules:
      8: f458_0_sort_GE -> f458_0_sort_GE : arg1'=1+arg1, arg2'=arg2P_3, arg3'=arg3P_3, [ -99+arg1==0 ], cost: 3

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

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
      8: f458_0_sort_GE -> f458_0_sort_GE : arg1'=1+arg1, arg2'=arg2P_3, arg3'=arg3P_3, [ -99+arg1==0 ], cost: 3
      7: __init -> f458_0_sort_GE : arg1'=1, arg2'=arg2P_1, arg3'=arg3P_1, [], cost: 2

Chained accelerated rules (with incoming rules):
   Start location: __init
      7: __init -> f458_0_sort_GE : arg1'=1, arg2'=arg2P_1, arg3'=arg3P_1, [], cost: 2

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
     <empty>

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     <empty>

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),?)