WORST_CASE(Omega(1),?)

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

Initial linear ITS problem
   Start location: __init
      0: f1_0_main_Load -> f180_0_ack_GT : arg1'=arg1P_1, arg2'=arg2P_1, [ arg1>0 && 0==arg2 && 0==arg1P_1 && 0==arg2P_1 ], cost: 1
      1: f1_0_main_Load -> f180_0_ack_GT : arg1'=arg1P_2, arg2'=arg2P_2, [ arg1>0 && arg2P_2>-1 && 1==arg2 && 0==arg1P_2 ], cost: 1
      2: f1_0_main_Load -> f180_0_ack_GT : arg1'=arg1P_3, arg2'=arg2P_3, [ arg1P_3>-1 && arg2>1 && arg2P_3>-1 && arg1>0 ], cost: 1
      3: f180_0_ack_GT -> f180_0_ack_GT : arg1'=arg1P_4, arg2'=arg2P_4, [ arg2>0 && -1+arg2<arg2 && 0==arg1 && 1==arg1P_4 && -1+arg2==arg2P_4 ], cost: 1
      4: f180_0_ack_GT -> f180_0_ack_GT : arg1'=arg1P_5, arg2'=arg2P_5, [ arg1>0 && -1+arg2<arg2 && arg2>0 && -1+arg1==arg1P_5 && arg2==arg2P_5 ], cost: 1
      5: f180_0_ack_GT -> f180_0_ack_GT : arg1'=arg1P_6, arg2'=arg2P_6, [ arg1>0 && arg2>0 && arg1P_6>0 && -1+arg2<arg2 && -1+arg2==arg2P_6 ], cost: 1
      6: __init -> f1_0_main_Load : arg1'=arg1P_7, arg2'=arg2P_7, [], cost: 1

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

Simplified all rules, resulting in:
   Start location: __init
      0: f1_0_main_Load -> f180_0_ack_GT : arg1'=0, arg2'=0, [ arg1>0 && 0==arg2 ], cost: 1
      1: f1_0_main_Load -> f180_0_ack_GT : arg1'=0, arg2'=arg2P_2, [ arg1>0 && arg2P_2>-1 && 1==arg2 ], cost: 1
      2: f1_0_main_Load -> f180_0_ack_GT : arg1'=arg1P_3, arg2'=arg2P_3, [ arg1P_3>-1 && arg2>1 && arg2P_3>-1 && arg1>0 ], cost: 1
      3: f180_0_ack_GT -> f180_0_ack_GT : arg1'=1, arg2'=-1+arg2, [ arg2>0 && 0==arg1 ], cost: 1
      4: f180_0_ack_GT -> f180_0_ack_GT : arg1'=-1+arg1, [ arg1>0 && arg2>0 ], cost: 1
      5: f180_0_ack_GT -> f180_0_ack_GT : arg1'=arg1P_6, arg2'=-1+arg2, [ arg1>0 && arg2>0 && arg1P_6>0 ], cost: 1
      6: __init -> f1_0_main_Load : arg1'=arg1P_7, arg2'=arg2P_7, [], cost: 1

### Simplification by acceleration and chaining ###

Accelerating simple loops of location 1.
   Accelerating the following rules:
      3: f180_0_ack_GT -> f180_0_ack_GT : arg1'=1, arg2'=-1+arg2, [ arg2>0 && 0==arg1 ], cost: 1
      4: f180_0_ack_GT -> f180_0_ack_GT : arg1'=-1+arg1, [ arg1>0 && arg2>0 ], cost: 1
      5: f180_0_ack_GT -> f180_0_ack_GT : arg1'=arg1P_6, arg2'=-1+arg2, [ arg1>0 && arg2>0 && arg1P_6>0 ], cost: 1

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

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
      0: f1_0_main_Load -> f180_0_ack_GT : arg1'=0, arg2'=0, [ arg1>0 && 0==arg2 ], cost: 1
      1: f1_0_main_Load -> f180_0_ack_GT : arg1'=0, arg2'=arg2P_2, [ arg1>0 && arg2P_2>-1 && 1==arg2 ], cost: 1
      2: f1_0_main_Load -> f180_0_ack_GT : arg1'=arg1P_3, arg2'=arg2P_3, [ arg1P_3>-1 && arg2>1 && arg2P_3>-1 && arg1>0 ], cost: 1
      3: f180_0_ack_GT -> f180_0_ack_GT : arg1'=1, arg2'=-1+arg2, [ arg2>0 && 0==arg1 ], cost: 1
      7: f180_0_ack_GT -> f180_0_ack_GT : arg1'=0, [ arg2>0 && arg1>=0 ], cost: arg1
      8: f180_0_ack_GT -> f180_0_ack_GT : arg1'=arg1P_6, arg2'=0, [ arg1>0 && arg1P_6>0 && arg2>=1 ], cost: arg2
      9: f180_0_ack_GT -> f180_0_ack_GT : arg1'=0, arg2'=1, [ 0==arg1 && -1+arg2>=1 ], cost: -2+2*arg2
     10: f180_0_ack_GT -> f180_0_ack_GT : arg1'=0, arg2'=1, [ 0==-1+arg1 && -1+arg2>=1 ], cost: -1+2*arg2
      6: __init -> f1_0_main_Load : arg1'=arg1P_7, arg2'=arg2P_7, [], cost: 1

Chained accelerated rules (with incoming rules):
   Start location: __init
      0: f1_0_main_Load -> f180_0_ack_GT : arg1'=0, arg2'=0, [ arg1>0 && 0==arg2 ], cost: 1
      1: f1_0_main_Load -> f180_0_ack_GT : arg1'=0, arg2'=arg2P_2, [ arg1>0 && arg2P_2>-1 && 1==arg2 ], cost: 1
      2: f1_0_main_Load -> f180_0_ack_GT : arg1'=arg1P_3, arg2'=arg2P_3, [ arg1P_3>-1 && arg2>1 && arg2P_3>-1 && arg1>0 ], cost: 1
     11: f1_0_main_Load -> f180_0_ack_GT : arg1'=1, arg2'=-1+arg2P_2, [ arg1>0 && 1==arg2 && arg2P_2>0 ], cost: 2
     12: f1_0_main_Load -> f180_0_ack_GT : arg1'=1, arg2'=-1+arg2P_3, [ arg2>1 && arg1>0 && arg2P_3>0 ], cost: 2
     13: f1_0_main_Load -> f180_0_ack_GT : arg1'=0, arg2'=arg2P_2, [ arg1>0 && 1==arg2 && arg2P_2>0 ], cost: 1
     14: f1_0_main_Load -> f180_0_ack_GT : arg1'=0, arg2'=arg2P_3, [ arg1P_3>-1 && arg2>1 && arg1>0 && arg2P_3>0 ], cost: 1+arg1P_3
     15: f1_0_main_Load -> f180_0_ack_GT : arg1'=arg1P_6, arg2'=0, [ arg2>1 && arg1>0 && arg1P_6>0 && arg2P_3>=1 ], cost: 1+arg2P_3
     16: f1_0_main_Load -> f180_0_ack_GT : arg1'=0, arg2'=1, [ arg1>0 && 1==arg2 && -1+arg2P_2>=1 ], cost: -1+2*arg2P_2
     17: f1_0_main_Load -> f180_0_ack_GT : arg1'=0, arg2'=1, [ arg2>1 && arg1>0 && -1+arg2P_3>=1 ], cost: -1+2*arg2P_3
     18: f1_0_main_Load -> f180_0_ack_GT : arg1'=0, arg2'=1, [ arg2>1 && arg1>0 && -1+arg2P_3>=1 ], cost: 2*arg2P_3
      6: __init -> f1_0_main_Load : arg1'=arg1P_7, arg2'=arg2P_7, [], cost: 1

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
     14: f1_0_main_Load -> f180_0_ack_GT : arg1'=0, arg2'=arg2P_3, [ arg1P_3>-1 && arg2>1 && arg1>0 && arg2P_3>0 ], cost: 1+arg1P_3
     15: f1_0_main_Load -> f180_0_ack_GT : arg1'=arg1P_6, arg2'=0, [ arg2>1 && arg1>0 && arg1P_6>0 && arg2P_3>=1 ], cost: 1+arg2P_3
     16: f1_0_main_Load -> f180_0_ack_GT : arg1'=0, arg2'=1, [ arg1>0 && 1==arg2 && -1+arg2P_2>=1 ], cost: -1+2*arg2P_2
     17: f1_0_main_Load -> f180_0_ack_GT : arg1'=0, arg2'=1, [ arg2>1 && arg1>0 && -1+arg2P_3>=1 ], cost: -1+2*arg2P_3
     18: f1_0_main_Load -> f180_0_ack_GT : arg1'=0, arg2'=1, [ arg2>1 && arg1>0 && -1+arg2P_3>=1 ], cost: 2*arg2P_3
      6: __init -> f1_0_main_Load : arg1'=arg1P_7, arg2'=arg2P_7, [], cost: 1

Eliminated locations (on tree-shaped paths):
   Start location: __init
     19: __init -> f180_0_ack_GT : arg1'=0, arg2'=arg2P_3, [ arg1P_3>-1 && arg2P_7>1 && arg1P_7>0 && arg2P_3>0 ], cost: 2+arg1P_3
     20: __init -> f180_0_ack_GT : arg1'=arg1P_6, arg2'=0, [ arg2P_7>1 && arg1P_7>0 && arg1P_6>0 && arg2P_3>=1 ], cost: 2+arg2P_3
     21: __init -> f180_0_ack_GT : arg1'=0, arg2'=1, [ arg1P_7>0 && 1==arg2P_7 && -1+arg2P_2>=1 ], cost: 2*arg2P_2
     22: __init -> f180_0_ack_GT : arg1'=0, arg2'=1, [ arg2P_7>1 && arg1P_7>0 && -1+arg2P_3>=1 ], cost: 2*arg2P_3
     23: __init -> f180_0_ack_GT : arg1'=0, arg2'=1, [ arg2P_7>1 && arg1P_7>0 && -1+arg2P_3>=1 ], cost: 1+2*arg2P_3

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     19: __init -> f180_0_ack_GT : arg1'=0, arg2'=arg2P_3, [ arg1P_3>-1 && arg2P_7>1 && arg1P_7>0 && arg2P_3>0 ], cost: 2+arg1P_3
     20: __init -> f180_0_ack_GT : arg1'=arg1P_6, arg2'=0, [ arg2P_7>1 && arg1P_7>0 && arg1P_6>0 && arg2P_3>=1 ], cost: 2+arg2P_3
     21: __init -> f180_0_ack_GT : arg1'=0, arg2'=1, [ arg1P_7>0 && 1==arg2P_7 && -1+arg2P_2>=1 ], cost: 2*arg2P_2
     23: __init -> f180_0_ack_GT : arg1'=0, arg2'=1, [ arg2P_7>1 && arg1P_7>0 && -1+arg2P_3>=1 ], cost: 1+2*arg2P_3

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

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

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

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