WORST_CASE(Omega(1),?)

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

Initial linear ITS problem
   Start location: __init
      0: f1_0_main_Load -> f306_0_main_LE : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, [ arg2P_1>-1 && arg2>-1 && arg1P_1>-1 && arg1>0 && arg1P_1+arg2P_1==arg3P_1 ], cost: 1
      1: f306_0_main_LE -> f306_0_main_LE : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, [ arg3>0 && arg2<arg1 && -1+arg1==arg1P_2 && arg2==arg2P_2 && -1+arg2+arg1==arg3P_2 ], cost: 1
      2: f306_0_main_LE -> f306_0_main_LE : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, [ arg3>0 && arg2>arg1 && arg1==arg1P_3 && -1+arg2==arg2P_3 && -1+arg2+arg1==arg3P_3 ], cost: 1
      3: f306_0_main_LE -> f306_0_main_LE : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, [ arg3>0 && arg1==arg2 && -1+arg1==arg1P_4 && arg1==arg2P_4 && -1+2*arg1==arg3P_4 ], cost: 1
      4: __init -> f1_0_main_Load : 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_Load : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, [], cost: 1

Simplified all rules, resulting in:
   Start location: __init
      0: f1_0_main_Load -> f306_0_main_LE : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg1P_1+arg2P_1, [ arg2P_1>-1 && arg2>-1 && arg1P_1>-1 && arg1>0 ], cost: 1
      1: f306_0_main_LE -> f306_0_main_LE : arg1'=-1+arg1, arg3'=-1+arg2+arg1, [ arg3>0 && arg2<arg1 ], cost: 1
      2: f306_0_main_LE -> f306_0_main_LE : arg2'=-1+arg2, arg3'=-1+arg2+arg1, [ arg3>0 && arg2>arg1 ], cost: 1
      3: f306_0_main_LE -> f306_0_main_LE : arg1'=-1+arg1, arg2'=arg1, arg3'=-1+2*arg1, [ arg3>0 && arg1==arg2 ], cost: 1
      4: __init -> f1_0_main_Load : 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: f306_0_main_LE -> f306_0_main_LE : arg1'=-1+arg1, arg3'=-1+arg2+arg1, [ arg3>0 && arg2<arg1 ], cost: 1
      2: f306_0_main_LE -> f306_0_main_LE : arg2'=-1+arg2, arg3'=-1+arg2+arg1, [ arg3>0 && arg2>arg1 ], cost: 1
      3: f306_0_main_LE -> f306_0_main_LE : arg1'=-1+arg1, arg2'=arg1, arg3'=-1+2*arg1, [ arg3>0 && arg1==arg2 ], cost: 1

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

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
      0: f1_0_main_Load -> f306_0_main_LE : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg1P_1+arg2P_1, [ arg2P_1>-1 && arg2>-1 && arg1P_1>-1 && arg1>0 ], cost: 1
      1: f306_0_main_LE -> f306_0_main_LE : arg1'=-1+arg1, arg3'=-1+arg2+arg1, [ arg3>0 && arg2<arg1 ], cost: 1
      3: f306_0_main_LE -> f306_0_main_LE : arg1'=-1+arg1, arg2'=arg1, arg3'=-1+2*arg1, [ arg3>0 && arg1==arg2 ], cost: 1
      5: f306_0_main_LE -> f306_0_main_LE : arg1'=-arg2, arg3'=0, [ arg2-arg3+arg1<=0 && arg2+arg1>=1 && arg2<1-arg2 ], cost: arg2+arg1
      6: f306_0_main_LE -> f306_0_main_LE : arg1'=arg2, arg3'=2*arg2, [ arg2-arg3+arg1<=0 && -arg2+arg1>=1 && 1+2*arg2>0 ], cost: -arg2+arg1
      7: f306_0_main_LE -> f306_0_main_LE : arg2'=arg1, arg3'=2*arg1, [ arg3>0 && 4+2*arg2-4*arg1<=0 && arg2-arg1>=1 ], cost: arg2-arg1
      8: f306_0_main_LE -> f306_0_main_LE : arg2'=arg2-k_3, arg3'=arg2-k_3+arg1, [ -1+arg2-arg3+arg1<=0 && k_3>=1 && 1+arg2-k_3+arg1>0 && 1+arg2-k_3>arg1 && -6-2*arg2+2*k_3+4*arg1<=-1 ], cost: k_3
      9: f306_0_main_LE -> f306_0_main_LE : arg1'=-k_7+arg1, arg2'=1-k_7+arg1, arg3'=1-2*k_7+2*arg1, [ arg3>0 && arg1==-1+arg2 && k_7>=1 && 2-2*k_7+2*arg1>0 ], cost: 2*k_7
     10: f306_0_main_LE -> f306_0_main_LE : arg1'=-1-k_7+arg1, arg2'=-k_7+arg1, arg3'=-1-2*k_7+2*arg1, [ arg3>0 && arg1==arg2 && -1+2*arg1>0 && k_7>=1 && -2*k_7+2*arg1>0 ], cost: 1+2*k_7
      4: __init -> f1_0_main_Load : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, [], cost: 1

Chained accelerated rules (with incoming rules):
   Start location: __init
      0: f1_0_main_Load -> f306_0_main_LE : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg1P_1+arg2P_1, [ arg2P_1>-1 && arg2>-1 && arg1P_1>-1 && arg1>0 ], cost: 1
     11: f1_0_main_Load -> f306_0_main_LE : arg1'=-1+arg1P_1, arg2'=arg2P_1, arg3'=-1+arg1P_1+arg2P_1, [ arg2P_1>-1 && arg2>-1 && arg1P_1>-1 && arg1>0 && arg1P_1+arg2P_1>0 && arg2P_1<arg1P_1 ], cost: 2
     12: f1_0_main_Load -> f306_0_main_LE : arg1'=-1+arg2P_1, arg2'=arg2P_1, arg3'=-1+2*arg2P_1, [ arg2P_1>-1 && arg2>-1 && arg1>0 && 2*arg2P_1>0 ], cost: 2
     13: f1_0_main_Load -> f306_0_main_LE : arg1'=-arg2P_1, arg2'=arg2P_1, arg3'=0, [ arg2P_1>-1 && arg2>-1 && arg1P_1>-1 && arg1>0 && arg1P_1+arg2P_1>=1 && arg2P_1<1-arg2P_1 ], cost: 1+arg1P_1+arg2P_1
     14: f1_0_main_Load -> f306_0_main_LE : arg1'=arg2P_1, arg2'=arg2P_1, arg3'=2*arg2P_1, [ arg2P_1>-1 && arg2>-1 && arg1P_1>-1 && arg1>0 && arg1P_1-arg2P_1>=1 && 1+2*arg2P_1>0 ], cost: 1+arg1P_1-arg2P_1
     15: f1_0_main_Load -> f306_0_main_LE : arg1'=arg1P_1, arg2'=arg1P_1, arg3'=2*arg1P_1, [ arg2P_1>-1 && arg2>-1 && arg1P_1>-1 && arg1>0 && arg1P_1+arg2P_1>0 && 4-4*arg1P_1+2*arg2P_1<=0 && -arg1P_1+arg2P_1>=1 ], cost: 1-arg1P_1+arg2P_1
     16: f1_0_main_Load -> f306_0_main_LE : arg1'=arg1P_1, arg2'=-k_3+arg2P_1, arg3'=-k_3+arg1P_1+arg2P_1, [ arg2P_1>-1 && arg2>-1 && arg1P_1>-1 && arg1>0 && k_3>=1 && 1-k_3+arg1P_1+arg2P_1>0 && 1-k_3+arg2P_1>arg1P_1 && -6+2*k_3+4*arg1P_1-2*arg2P_1<=-1 ], cost: 1+k_3
     17: f1_0_main_Load -> f306_0_main_LE : arg1'=-1-k_7+arg2P_1, arg2'=-k_7+arg2P_1, arg3'=-1-2*k_7+2*arg2P_1, [ arg2>-1 && -1+arg2P_1>-1 && arg1>0 && -1+2*arg2P_1>0 && k_7>=1 && -2*k_7+2*arg2P_1>0 ], cost: 1+2*k_7
     18: f1_0_main_Load -> f306_0_main_LE : arg1'=-1-k_7+arg2P_1, arg2'=-k_7+arg2P_1, arg3'=-1-2*k_7+2*arg2P_1, [ arg2P_1>-1 && arg2>-1 && arg1>0 && -1+2*arg2P_1>0 && k_7>=1 && -2*k_7+2*arg2P_1>0 ], cost: 2+2*k_7
      4: __init -> f1_0_main_Load : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, [], cost: 1

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
     13: f1_0_main_Load -> f306_0_main_LE : arg1'=-arg2P_1, arg2'=arg2P_1, arg3'=0, [ arg2P_1>-1 && arg2>-1 && arg1P_1>-1 && arg1>0 && arg1P_1+arg2P_1>=1 && arg2P_1<1-arg2P_1 ], cost: 1+arg1P_1+arg2P_1
     14: f1_0_main_Load -> f306_0_main_LE : arg1'=arg2P_1, arg2'=arg2P_1, arg3'=2*arg2P_1, [ arg2P_1>-1 && arg2>-1 && arg1P_1>-1 && arg1>0 && arg1P_1-arg2P_1>=1 && 1+2*arg2P_1>0 ], cost: 1+arg1P_1-arg2P_1
     15: f1_0_main_Load -> f306_0_main_LE : arg1'=arg1P_1, arg2'=arg1P_1, arg3'=2*arg1P_1, [ arg2P_1>-1 && arg2>-1 && arg1P_1>-1 && arg1>0 && arg1P_1+arg2P_1>0 && 4-4*arg1P_1+2*arg2P_1<=0 && -arg1P_1+arg2P_1>=1 ], cost: 1-arg1P_1+arg2P_1
     16: f1_0_main_Load -> f306_0_main_LE : arg1'=arg1P_1, arg2'=-k_3+arg2P_1, arg3'=-k_3+arg1P_1+arg2P_1, [ arg2P_1>-1 && arg2>-1 && arg1P_1>-1 && arg1>0 && k_3>=1 && 1-k_3+arg1P_1+arg2P_1>0 && 1-k_3+arg2P_1>arg1P_1 && -6+2*k_3+4*arg1P_1-2*arg2P_1<=-1 ], cost: 1+k_3
     17: f1_0_main_Load -> f306_0_main_LE : arg1'=-1-k_7+arg2P_1, arg2'=-k_7+arg2P_1, arg3'=-1-2*k_7+2*arg2P_1, [ arg2>-1 && -1+arg2P_1>-1 && arg1>0 && -1+2*arg2P_1>0 && k_7>=1 && -2*k_7+2*arg2P_1>0 ], cost: 1+2*k_7
     18: f1_0_main_Load -> f306_0_main_LE : arg1'=-1-k_7+arg2P_1, arg2'=-k_7+arg2P_1, arg3'=-1-2*k_7+2*arg2P_1, [ arg2P_1>-1 && arg2>-1 && arg1>0 && -1+2*arg2P_1>0 && k_7>=1 && -2*k_7+2*arg2P_1>0 ], cost: 2+2*k_7
      4: __init -> f1_0_main_Load : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, [], cost: 1

Eliminated locations (on tree-shaped paths):
   Start location: __init
     19: __init -> f306_0_main_LE : arg1'=-arg2P_1, arg2'=arg2P_1, arg3'=0, [ arg2P_1>-1 && arg2P_5>-1 && arg1P_1>-1 && arg1P_5>0 && arg1P_1+arg2P_1>=1 && arg2P_1<1-arg2P_1 ], cost: 2+arg1P_1+arg2P_1
     20: __init -> f306_0_main_LE : arg1'=arg2P_1, arg2'=arg2P_1, arg3'=2*arg2P_1, [ arg2P_1>-1 && arg2P_5>-1 && arg1P_1>-1 && arg1P_5>0 && arg1P_1-arg2P_1>=1 && 1+2*arg2P_1>0 ], cost: 2+arg1P_1-arg2P_1
     21: __init -> f306_0_main_LE : arg1'=arg1P_1, arg2'=arg1P_1, arg3'=2*arg1P_1, [ arg2P_1>-1 && arg2P_5>-1 && arg1P_1>-1 && arg1P_5>0 && arg1P_1+arg2P_1>0 && 4-4*arg1P_1+2*arg2P_1<=0 && -arg1P_1+arg2P_1>=1 ], cost: 2-arg1P_1+arg2P_1
     22: __init -> f306_0_main_LE : arg1'=arg1P_1, arg2'=-k_3+arg2P_1, arg3'=-k_3+arg1P_1+arg2P_1, [ arg2P_1>-1 && arg2P_5>-1 && arg1P_1>-1 && arg1P_5>0 && k_3>=1 && 1-k_3+arg1P_1+arg2P_1>0 && 1-k_3+arg2P_1>arg1P_1 && -6+2*k_3+4*arg1P_1-2*arg2P_1<=-1 ], cost: 2+k_3
     23: __init -> f306_0_main_LE : arg1'=-1-k_7+arg2P_1, arg2'=-k_7+arg2P_1, arg3'=-1-2*k_7+2*arg2P_1, [ arg2P_5>-1 && -1+arg2P_1>-1 && arg1P_5>0 && -1+2*arg2P_1>0 && k_7>=1 && -2*k_7+2*arg2P_1>0 ], cost: 2+2*k_7
     24: __init -> f306_0_main_LE : arg1'=-1-k_7+arg2P_1, arg2'=-k_7+arg2P_1, arg3'=-1-2*k_7+2*arg2P_1, [ arg2P_1>-1 && arg2P_5>-1 && arg1P_5>0 && -1+2*arg2P_1>0 && k_7>=1 && -2*k_7+2*arg2P_1>0 ], cost: 3+2*k_7

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     19: __init -> f306_0_main_LE : arg1'=-arg2P_1, arg2'=arg2P_1, arg3'=0, [ arg2P_1>-1 && arg2P_5>-1 && arg1P_1>-1 && arg1P_5>0 && arg1P_1+arg2P_1>=1 && arg2P_1<1-arg2P_1 ], cost: 2+arg1P_1+arg2P_1
     20: __init -> f306_0_main_LE : arg1'=arg2P_1, arg2'=arg2P_1, arg3'=2*arg2P_1, [ arg2P_1>-1 && arg2P_5>-1 && arg1P_1>-1 && arg1P_5>0 && arg1P_1-arg2P_1>=1 && 1+2*arg2P_1>0 ], cost: 2+arg1P_1-arg2P_1
     21: __init -> f306_0_main_LE : arg1'=arg1P_1, arg2'=arg1P_1, arg3'=2*arg1P_1, [ arg2P_1>-1 && arg2P_5>-1 && arg1P_1>-1 && arg1P_5>0 && arg1P_1+arg2P_1>0 && 4-4*arg1P_1+2*arg2P_1<=0 && -arg1P_1+arg2P_1>=1 ], cost: 2-arg1P_1+arg2P_1
     22: __init -> f306_0_main_LE : arg1'=arg1P_1, arg2'=-k_3+arg2P_1, arg3'=-k_3+arg1P_1+arg2P_1, [ arg2P_1>-1 && arg2P_5>-1 && arg1P_1>-1 && arg1P_5>0 && k_3>=1 && 1-k_3+arg1P_1+arg2P_1>0 && 1-k_3+arg2P_1>arg1P_1 && -6+2*k_3+4*arg1P_1-2*arg2P_1<=-1 ], cost: 2+k_3
     23: __init -> f306_0_main_LE : arg1'=-1-k_7+arg2P_1, arg2'=-k_7+arg2P_1, arg3'=-1-2*k_7+2*arg2P_1, [ arg2P_5>-1 && -1+arg2P_1>-1 && arg1P_5>0 && -1+2*arg2P_1>0 && k_7>=1 && -2*k_7+2*arg2P_1>0 ], cost: 2+2*k_7
     24: __init -> f306_0_main_LE : arg1'=-1-k_7+arg2P_1, arg2'=-k_7+arg2P_1, arg3'=-1-2*k_7+2*arg2P_1, [ arg2P_1>-1 && arg2P_5>-1 && arg1P_5>0 && -1+2*arg2P_1>0 && k_7>=1 && -2*k_7+2*arg2P_1>0 ], cost: 3+2*k_7

Computing asymptotic complexity for rule 19
   Simplified the guard:
     19: __init -> f306_0_main_LE : arg1'=-arg2P_1, arg2'=arg2P_1, arg3'=0, [ arg2P_1>-1 && arg2P_5>-1 && arg1P_5>0 && arg1P_1+arg2P_1>=1 && arg2P_1<1-arg2P_1 ], cost: 2+arg1P_1+arg2P_1
   Resulting cost 0 has complexity: Unknown

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

Computing asymptotic complexity for rule 23
   Simplified the guard:
     23: __init -> f306_0_main_LE : arg1'=-1-k_7+arg2P_1, arg2'=-k_7+arg2P_1, arg3'=-1-2*k_7+2*arg2P_1, [ arg2P_5>-1 && arg1P_5>0 && k_7>=1 && -2*k_7+2*arg2P_1>0 ], cost: 2+2*k_7
   Resulting cost 0 has complexity: Unknown

Computing asymptotic complexity for rule 24
   Simplified the guard:
     24: __init -> f306_0_main_LE : arg1'=-1-k_7+arg2P_1, arg2'=-k_7+arg2P_1, arg3'=-1-2*k_7+2*arg2P_1, [ arg2P_5>-1 && arg1P_5>0 && k_7>=1 && -2*k_7+2*arg2P_1>0 ], cost: 3+2*k_7
   Resulting cost 0 has complexity: Unknown

Computing asymptotic complexity for rule 21
   Simplified the guard:
     21: __init -> f306_0_main_LE : arg1'=arg1P_1, arg2'=arg1P_1, arg3'=2*arg1P_1, [ arg2P_5>-1 && arg1P_5>0 && 4-4*arg1P_1+2*arg2P_1<=0 && -arg1P_1+arg2P_1>=1 ], cost: 2-arg1P_1+arg2P_1
   Resulting cost 0 has complexity: Unknown

Computing asymptotic complexity for rule 22
   Simplified the guard:
     22: __init -> f306_0_main_LE : arg1'=arg1P_1, arg2'=-k_3+arg2P_1, arg3'=-k_3+arg1P_1+arg2P_1, [ arg2P_5>-1 && arg1P_1>-1 && arg1P_5>0 && k_3>=1 && 1-k_3+arg1P_1+arg2P_1>0 && 1-k_3+arg2P_1>arg1P_1 && -6+2*k_3+4*arg1P_1-2*arg2P_1<=-1 ], cost: 2+k_3
   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),?)