WORST_CASE(Omega(1),?)

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

Initial linear ITS problem
   Start location: __init
      0: f1_0_main_Load -> f127_0_average_LE : arg1'=arg1P_1, arg2'=arg2P_1, [ arg1P_1>-1 && arg2>1 && arg2P_1>-1 && arg1>0 ], cost: 1
      1: f127_0_average_LE -> f127_0_average_LE : arg1'=arg1P_2, arg2'=arg2P_2, [ arg2>0 && arg1>-1 && 1+arg1>arg1 && -1+arg2<arg2 && 1+arg1==arg1P_2 && -1+arg2==arg2P_2 ], cost: 1
      2: f127_0_average_LE -> f127_0_average_LE : arg1'=arg1P_3, arg2'=arg2P_3, [ arg1>2 && -2+arg1<arg1 && 0==arg2 && -2+arg1==arg1P_3 && 1==arg2P_3 ], cost: 1
      3: __init -> f1_0_main_Load : arg1'=arg1P_4, arg2'=arg2P_4, [], cost: 1

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

Simplified all rules, resulting in:
   Start location: __init
      0: f1_0_main_Load -> f127_0_average_LE : arg1'=arg1P_1, arg2'=arg2P_1, [ arg1P_1>-1 && arg2>1 && arg2P_1>-1 && arg1>0 ], cost: 1
      1: f127_0_average_LE -> f127_0_average_LE : arg1'=1+arg1, arg2'=-1+arg2, [ arg2>0 && arg1>-1 ], cost: 1
      2: f127_0_average_LE -> f127_0_average_LE : arg1'=-2+arg1, arg2'=1, [ arg1>2 && 0==arg2 ], cost: 1
      3: __init -> f1_0_main_Load : arg1'=arg1P_4, arg2'=arg2P_4, [], cost: 1

### Simplification by acceleration and chaining ###

Accelerating simple loops of location 1.
   Accelerating the following rules:
      1: f127_0_average_LE -> f127_0_average_LE : arg1'=1+arg1, arg2'=-1+arg2, [ arg2>0 && arg1>-1 ], cost: 1
      2: f127_0_average_LE -> f127_0_average_LE : arg1'=-2+arg1, arg2'=1, [ arg1>2 && 0==arg2 ], cost: 1

   Accelerated rule 1 with backward acceleration, yielding the new rule 4.
   Failed to prove monotonicity of the guard of rule 2.
[accelerate] Nesting with 2 inner and 2 outer candidates
   Nested simple loops 1 (outer loop) and 2 (inner loop) with Rule(1 | 0==arg2, -2+arg1>=1, 3>2, | -4+2*arg1 || 1 | 0=2, 1=0, ), resulting in the new rules: 5, 6.
   Removing the simple loops: 1.

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
      0: f1_0_main_Load -> f127_0_average_LE : arg1'=arg1P_1, arg2'=arg2P_1, [ arg1P_1>-1 && arg2>1 && arg2P_1>-1 && arg1>0 ], cost: 1
      2: f127_0_average_LE -> f127_0_average_LE : arg1'=-2+arg1, arg2'=1, [ arg1>2 && 0==arg2 ], cost: 1
      4: f127_0_average_LE -> f127_0_average_LE : arg1'=arg2+arg1, arg2'=0, [ arg1>-1 && arg2>=0 ], cost: arg2
      5: f127_0_average_LE -> f127_0_average_LE : arg1'=2, arg2'=0, [ 0==arg2 && -2+arg1>=1 ], cost: -4+2*arg1
      6: f127_0_average_LE -> f127_0_average_LE : arg1'=2, arg2'=0, [ 0==-1+arg2 && -1+arg1>=1 ], cost: -1+2*arg1
      3: __init -> f1_0_main_Load : arg1'=arg1P_4, arg2'=arg2P_4, [], cost: 1

Chained accelerated rules (with incoming rules):
   Start location: __init
      0: f1_0_main_Load -> f127_0_average_LE : arg1'=arg1P_1, arg2'=arg2P_1, [ arg1P_1>-1 && arg2>1 && arg2P_1>-1 && arg1>0 ], cost: 1
      7: f1_0_main_Load -> f127_0_average_LE : arg1'=-2+arg1P_1, arg2'=1, [ arg2>1 && arg1>0 && arg1P_1>2 ], cost: 2
      8: f1_0_main_Load -> f127_0_average_LE : arg1'=arg1P_1+arg2P_1, arg2'=0, [ arg1P_1>-1 && arg2>1 && arg2P_1>-1 && arg1>0 ], cost: 1+arg2P_1
      9: f1_0_main_Load -> f127_0_average_LE : arg1'=2, arg2'=0, [ arg2>1 && arg1>0 && -2+arg1P_1>=1 ], cost: -3+2*arg1P_1
     10: f1_0_main_Load -> f127_0_average_LE : arg1'=2, arg2'=0, [ arg2>1 && arg1>0 && -1+arg1P_1>=1 ], cost: 2*arg1P_1
      3: __init -> f1_0_main_Load : arg1'=arg1P_4, arg2'=arg2P_4, [], cost: 1

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
      8: f1_0_main_Load -> f127_0_average_LE : arg1'=arg1P_1+arg2P_1, arg2'=0, [ arg1P_1>-1 && arg2>1 && arg2P_1>-1 && arg1>0 ], cost: 1+arg2P_1
      9: f1_0_main_Load -> f127_0_average_LE : arg1'=2, arg2'=0, [ arg2>1 && arg1>0 && -2+arg1P_1>=1 ], cost: -3+2*arg1P_1
     10: f1_0_main_Load -> f127_0_average_LE : arg1'=2, arg2'=0, [ arg2>1 && arg1>0 && -1+arg1P_1>=1 ], cost: 2*arg1P_1
      3: __init -> f1_0_main_Load : arg1'=arg1P_4, arg2'=arg2P_4, [], cost: 1

Eliminated locations (on tree-shaped paths):
   Start location: __init
     11: __init -> f127_0_average_LE : arg1'=arg1P_1+arg2P_1, arg2'=0, [ arg1P_1>-1 && arg2P_4>1 && arg2P_1>-1 && arg1P_4>0 ], cost: 2+arg2P_1
     12: __init -> f127_0_average_LE : arg1'=2, arg2'=0, [ arg2P_4>1 && arg1P_4>0 && -2+arg1P_1>=1 ], cost: -2+2*arg1P_1
     13: __init -> f127_0_average_LE : arg1'=2, arg2'=0, [ arg2P_4>1 && arg1P_4>0 && -1+arg1P_1>=1 ], cost: 1+2*arg1P_1

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     11: __init -> f127_0_average_LE : arg1'=arg1P_1+arg2P_1, arg2'=0, [ arg1P_1>-1 && arg2P_4>1 && arg2P_1>-1 && arg1P_4>0 ], cost: 2+arg2P_1
     12: __init -> f127_0_average_LE : arg1'=2, arg2'=0, [ arg2P_4>1 && arg1P_4>0 && -2+arg1P_1>=1 ], cost: -2+2*arg1P_1
     13: __init -> f127_0_average_LE : arg1'=2, arg2'=0, [ arg2P_4>1 && arg1P_4>0 && -1+arg1P_1>=1 ], cost: 1+2*arg1P_1

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

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

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