WORST_CASE(Omega(1),?)

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

Initial linear ITS problem
   Start location: __init
      0: f1_0_main_New -> f160_0_main_LE : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, [ arg1P_1>0 && 27==arg2P_1 && 28==arg3P_1 ], cost: 1
      1: f160_0_main_LE -> f160_0_main_LE : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, [ -3+arg1P_2<=arg1 && arg3>0 && arg1>0 && arg1P_2>3 && -1+arg2==arg2P_2 && arg2==arg3P_2 ], cost: 1
      2: f160_0_main_LE -> f167_0_length_InvokeMethod : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, [ 1+arg1P_3<=arg1 && arg3<1 && arg1>0 && arg1P_3>-1 ], cost: 1
      3: f167_0_length_InvokeMethod -> f167_0_length_InvokeMethod : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, [ arg1>=1+arg1P_4 && arg1>0 && arg1P_4>-1 ], cost: 1
      4: __init -> f1_0_main_New : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, [], cost: 1

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

Simplified all rules, resulting in:
   Start location: __init
      0: f1_0_main_New -> f160_0_main_LE : arg1'=arg1P_1, arg2'=27, arg3'=28, [ arg1P_1>0 ], cost: 1
      1: f160_0_main_LE -> f160_0_main_LE : arg1'=arg1P_2, arg2'=-1+arg2, arg3'=arg2, [ -3+arg1P_2<=arg1 && arg3>0 && arg1>0 && arg1P_2>3 ], cost: 1
      2: f160_0_main_LE -> f167_0_length_InvokeMethod : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, [ 1+arg1P_3<=arg1 && arg3<1 && arg1>0 && arg1P_3>-1 ], cost: 1
      3: f167_0_length_InvokeMethod -> f167_0_length_InvokeMethod : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, [ arg1>=1+arg1P_4 && arg1>0 && arg1P_4>-1 ], cost: 1
      4: __init -> f1_0_main_New : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, [], cost: 1

### Simplification by acceleration and chaining ###

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

[test] deduced invariant 1+arg2-arg3<=0
   Accelerated rule 1 with backward acceleration, yielding the new rule 5.
[accelerate] Nesting with 1 inner and 1 outer candidates

Accelerating simple loops of location 2.
   Accelerating the following rules:
      3: f167_0_length_InvokeMethod -> f167_0_length_InvokeMethod : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, [ arg1>=1+arg1P_4 && arg1>0 && arg1P_4>-1 ], cost: 1

   Failed to prove monotonicity of the guard of rule 3.
[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_New -> f160_0_main_LE : arg1'=arg1P_1, arg2'=27, arg3'=28, [ arg1P_1>0 ], cost: 1
      1: f160_0_main_LE -> f160_0_main_LE : arg1'=arg1P_2, arg2'=-1+arg2, arg3'=arg2, [ -3+arg1P_2<=arg1 && arg3>0 && arg1>0 && arg1P_2>3 ], cost: 1
      2: f160_0_main_LE -> f167_0_length_InvokeMethod : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, [ 1+arg1P_3<=arg1 && arg3<1 && arg1>0 && arg1P_3>-1 ], cost: 1
      5: f160_0_main_LE -> f160_0_main_LE : arg1'=arg1P_2, arg2'=-1, arg3'=0, [ -3+arg1P_2<=arg1 && arg1>0 && arg1P_2>3 && 1+arg2-arg3<=0 && 1+arg2>=1 ], cost: 1+arg2
      3: f167_0_length_InvokeMethod -> f167_0_length_InvokeMethod : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, [ arg1>=1+arg1P_4 && arg1>0 && arg1P_4>-1 ], cost: 1
      4: __init -> f1_0_main_New : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, [], cost: 1

Chained accelerated rules (with incoming rules):
   Start location: __init
      0: f1_0_main_New -> f160_0_main_LE : arg1'=arg1P_1, arg2'=27, arg3'=28, [ arg1P_1>0 ], cost: 1
      6: f1_0_main_New -> f160_0_main_LE : arg1'=arg1P_2, arg2'=26, arg3'=27, [ arg1P_2>3 ], cost: 2
      7: f1_0_main_New -> f160_0_main_LE : arg1'=arg1P_2, arg2'=-1, arg3'=0, [ arg1P_2>3 ], cost: 29
      2: f160_0_main_LE -> f167_0_length_InvokeMethod : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, [ 1+arg1P_3<=arg1 && arg3<1 && arg1>0 && arg1P_3>-1 ], cost: 1
      8: f160_0_main_LE -> f167_0_length_InvokeMethod : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, [ arg3<1 && arg1P_4>-1 && 1+arg1P_4<=-1+arg1 && 1<=-1+arg1 ], cost: 2
      4: __init -> f1_0_main_New : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, [], cost: 1

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