WORST_CASE(Omega(1),?)

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

Initial linear ITS problem
   Start location: __init
      0: f1_0_main_Load -> f368_0_main_LE : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, [ arg1P_1>-1 && arg2>-1 && arg2P_1>-1 && arg1>0 && 2==arg3P_1 ], cost: 1
      1: f368_0_main_LE -> f368_0_main_LE : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, [ arg3>-1 && x7_1>41 && arg1>0 && arg2>0 && -1+arg1==arg1P_2 && arg2==arg2P_2 && 1+arg3==arg3P_2 ], cost: 1
      2: f368_0_main_LE -> f368_0_main_LE : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, [ arg1>0 && arg3>-1 && arg2>0 && x12_1>-1 && arg1P_3>-1 && x12_1<42 && -1+arg2==arg2P_3 && 2+arg3==arg3P_3 ], cost: 1
      3: __init -> f1_0_main_Load : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_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, arg3'=arg3P_4, [], cost: 1

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

### Simplification by acceleration and chaining ###

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

   Accelerated rule 1 with backward acceleration, yielding the new rule 4.
[test] deduced pseudo-invariant arg1P_3-arg1<=0, also trying -arg1P_3+arg1<=-1
   Accelerated rule 2 with backward acceleration, yielding the new rule 5.
[accelerate] Nesting with 2 inner and 2 outer candidates
   Removing the simple loops: 1.

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

Chained accelerated rules (with incoming rules):
   Start location: __init
      0: f1_0_main_Load -> f368_0_main_LE : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=2, [ arg1P_1>-1 && arg2>-1 && arg2P_1>-1 && arg1>0 ], cost: 1
      6: f1_0_main_Load -> f368_0_main_LE : arg1'=arg1P_3, arg2'=-1+arg2P_1, arg3'=4, [ arg2>-1 && arg1>0 && arg2P_1>0 && arg1P_3>-1 ], cost: 2
      7: f1_0_main_Load -> f368_0_main_LE : arg1'=0, arg2'=arg2P_1, arg3'=2+arg1P_1, [ arg1P_1>-1 && arg2>-1 && arg1>0 && arg2P_1>0 ], cost: 1+arg1P_1
      8: f1_0_main_Load -> f368_0_main_LE : arg1'=arg1P_3, arg2'=0, arg3'=2+2*arg2P_1, [ arg2>-1 && arg1>0 && arg2P_1>=1 && arg1P_3>0 ], cost: 1+arg2P_1
      3: __init -> f1_0_main_Load : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, [], cost: 1

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

Eliminated locations (on tree-shaped paths):
   Start location: __init
      9: __init -> f368_0_main_LE : arg1'=0, arg2'=arg2P_1, arg3'=2+arg1P_1, [ arg1P_1>-1 && arg2P_4>-1 && arg1P_4>0 && arg2P_1>0 ], cost: 2+arg1P_1
     10: __init -> f368_0_main_LE : arg1'=arg1P_3, arg2'=0, arg3'=2+2*arg2P_1, [ arg2P_4>-1 && arg1P_4>0 && arg2P_1>=1 && arg1P_3>0 ], cost: 2+arg2P_1

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
      9: __init -> f368_0_main_LE : arg1'=0, arg2'=arg2P_1, arg3'=2+arg1P_1, [ arg1P_1>-1 && arg2P_4>-1 && arg1P_4>0 && arg2P_1>0 ], cost: 2+arg1P_1
     10: __init -> f368_0_main_LE : arg1'=arg1P_3, arg2'=0, arg3'=2+2*arg2P_1, [ arg2P_4>-1 && arg1P_4>0 && arg2P_1>=1 && arg1P_3>0 ], cost: 2+arg2P_1

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

Computing asymptotic complexity for rule 10
   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),?)