WORST_CASE(Omega(1),?)

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

Initial linear ITS problem
   Start location: __init
      0: f1_0_main_Load -> f1_0_main_Load\' : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, [ arg1>0 && arg2>-1 && arg1==arg1P_1 && arg2==arg2P_1 ], cost: 1
      1: f1_0_main_Load\' -> f384_0_iter_LT : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1>0 && arg2>-1 && -5*x16_1+arg2>=0 && -5*x16_1+arg2<5 && -4*x17_1+arg2>=0 && -4*x17_1+arg2<4 && -5*x18_1+arg2>=0 && -5*x18_1+arg2<5 && -4*x19_1+arg2<4 && -4*x19_1+arg2>=0 && arg2==arg1P_2 && -5*x16_1+arg2==arg2P_2 && -4*x17_1+arg2==arg3P_2 && -12*x19_1-5*x18_1+5*arg2==arg4P_2 ], cost: 1
      2: f384_0_iter_LT -> f384_0_iter_LT : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg4>-1 && arg2<arg1 && -1+arg1==arg1P_3 && arg2==arg2P_3 && arg3==arg3P_3 && -1+3*arg3+arg1+arg2==arg4P_3 ], cost: 1
      3: f384_0_iter_LT -> f384_0_iter_LT : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [ arg3<arg2 && arg4>-1 && arg2>=arg1 && 1+arg1==arg1P_4 && -2+arg2==arg2P_4 && arg3==arg3P_4 && -1+3*arg3+arg1+arg2==arg4P_4 ], cost: 1
      4: f384_0_iter_LT -> f384_0_iter_LT : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, [ arg4>-1 && arg3>=arg2 && arg2>=arg1 && 1+arg1==arg1P_5 && 1+arg2==arg2P_5 && -1+arg3==arg3P_5 && -1+3*arg3+arg1+arg2==arg4P_5 ], cost: 1
      5: __init -> f1_0_main_Load : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
      5: __init -> f1_0_main_Load : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [], cost: 1

Simplified all rules, resulting in:
   Start location: __init
      0: f1_0_main_Load -> f1_0_main_Load\' : arg3'=arg3P_1, arg4'=arg4P_1, [ arg1>0 && arg2>-1 ], cost: 1
      1: f1_0_main_Load\' -> f384_0_iter_LT : arg1'=arg2, arg2'=-5*x16_1+arg2, arg3'=-4*x17_1+arg2, arg4'=-12*x19_1-5*x18_1+5*arg2, [ arg1>0 && arg2>-1 && -5*x16_1+arg2>=0 && -5*x16_1+arg2<5 && -4*x17_1+arg2>=0 && -4*x17_1+arg2<4 && -5*x18_1+arg2>=0 && -5*x18_1+arg2<5 && -4*x19_1+arg2<4 && -4*x19_1+arg2>=0 ], cost: 1
      2: f384_0_iter_LT -> f384_0_iter_LT : arg1'=-1+arg1, arg4'=-1+3*arg3+arg1+arg2, [ arg4>-1 && arg2<arg1 ], cost: 1
      3: f384_0_iter_LT -> f384_0_iter_LT : arg1'=1+arg1, arg2'=-2+arg2, arg4'=-1+3*arg3+arg1+arg2, [ arg3<arg2 && arg4>-1 && arg2>=arg1 ], cost: 1
      4: f384_0_iter_LT -> f384_0_iter_LT : arg1'=1+arg1, arg2'=1+arg2, arg3'=-1+arg3, arg4'=-1+3*arg3+arg1+arg2, [ arg4>-1 && arg3>=arg2 && arg2>=arg1 ], cost: 1
      5: __init -> f1_0_main_Load : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [], cost: 1

### Simplification by acceleration and chaining ###

Accelerating simple loops of location 2.
   Accelerating the following rules:
      2: f384_0_iter_LT -> f384_0_iter_LT : arg1'=-1+arg1, arg4'=-1+3*arg3+arg1+arg2, [ arg4>-1 && arg2<arg1 ], cost: 1
      3: f384_0_iter_LT -> f384_0_iter_LT : arg1'=1+arg1, arg2'=-2+arg2, arg4'=-1+3*arg3+arg1+arg2, [ arg3<arg2 && arg4>-1 && arg2>=arg1 ], cost: 1
      4: f384_0_iter_LT -> f384_0_iter_LT : arg1'=1+arg1, arg2'=1+arg2, arg3'=-1+arg3, arg4'=-1+3*arg3+arg1+arg2, [ arg4>-1 && arg3>=arg2 && arg2>=arg1 ], cost: 1

   Found no metering function for rule 2.
   Accelerated rule 3 with metering function meter (where 3*meter==-arg1+arg2) (after adding arg1>=arg2), yielding the new rule 6.
   Found no metering function for rule 4.
   Removing the simple loops:.

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
      0: f1_0_main_Load -> f1_0_main_Load\' : arg3'=arg3P_1, arg4'=arg4P_1, [ arg1>0 && arg2>-1 ], cost: 1
      1: f1_0_main_Load\' -> f384_0_iter_LT : arg1'=arg2, arg2'=-5*x16_1+arg2, arg3'=-4*x17_1+arg2, arg4'=-12*x19_1-5*x18_1+5*arg2, [ arg1>0 && arg2>-1 && -5*x16_1+arg2>=0 && -5*x16_1+arg2<5 && -4*x17_1+arg2>=0 && -4*x17_1+arg2<4 && -5*x18_1+arg2>=0 && -5*x18_1+arg2<5 && -4*x19_1+arg2<4 && -4*x19_1+arg2>=0 ], cost: 1
      2: f384_0_iter_LT -> f384_0_iter_LT : arg1'=-1+arg1, arg4'=-1+3*arg3+arg1+arg2, [ arg4>-1 && arg2<arg1 ], cost: 1
      3: f384_0_iter_LT -> f384_0_iter_LT : arg1'=1+arg1, arg2'=-2+arg2, arg4'=-1+3*arg3+arg1+arg2, [ arg3<arg2 && arg4>-1 && arg2>=arg1 ], cost: 1
      4: f384_0_iter_LT -> f384_0_iter_LT : arg1'=1+arg1, arg2'=1+arg2, arg3'=-1+arg3, arg4'=-1+3*arg3+arg1+arg2, [ arg4>-1 && arg3>=arg2 && arg2>=arg1 ], cost: 1
      6: f384_0_iter_LT -> f384_0_iter_LT : arg1'=meter+arg1, arg2'=-2*meter+arg2, arg4'=3*arg3-meter+arg1+arg2, [ arg3<arg2 && arg4>-1 && arg2>=arg1 && arg1>=arg2 && 3*meter==-arg1+arg2 && meter>=1 ], cost: meter
      5: __init -> f1_0_main_Load : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [], cost: 1

Chained accelerated rules (with incoming rules):
   Start location: __init
      0: f1_0_main_Load -> f1_0_main_Load\' : arg3'=arg3P_1, arg4'=arg4P_1, [ arg1>0 && arg2>-1 ], cost: 1
      1: f1_0_main_Load\' -> f384_0_iter_LT : arg1'=arg2, arg2'=-5*x16_1+arg2, arg3'=-4*x17_1+arg2, arg4'=-12*x19_1-5*x18_1+5*arg2, [ arg1>0 && arg2>-1 && -5*x16_1+arg2>=0 && -5*x16_1+arg2<5 && -4*x17_1+arg2>=0 && -4*x17_1+arg2<4 && -5*x18_1+arg2>=0 && -5*x18_1+arg2<5 && -4*x19_1+arg2<4 && -4*x19_1+arg2>=0 ], cost: 1
      7: f1_0_main_Load\' -> f384_0_iter_LT : arg1'=-1+arg2, arg2'=-5*x16_1+arg2, arg3'=-4*x17_1+arg2, arg4'=-1-12*x17_1-5*x16_1+5*arg2, [ arg1>0 && arg2>-1 && -5*x16_1+arg2>=0 && -5*x16_1+arg2<5 && -4*x17_1+arg2>=0 && -4*x17_1+arg2<4 && -5*x18_1+arg2>=0 && -5*x18_1+arg2<5 && -4*x19_1+arg2<4 && -4*x19_1+arg2>=0 && -12*x19_1-5*x18_1+5*arg2>-1 && -5*x16_1+arg2<arg2 ], cost: 2
      8: f1_0_main_Load\' -> f384_0_iter_LT : arg1'=1+arg2, arg2'=-2-5*x16_1+arg2, arg3'=-4*x17_1+arg2, arg4'=-1-12*x17_1-5*x16_1+5*arg2, [ arg1>0 && arg2>-1 && -5*x16_1+arg2>=0 && -5*x16_1+arg2<5 && -4*x17_1+arg2>=0 && -4*x17_1+arg2<4 && -5*x18_1+arg2>=0 && -5*x18_1+arg2<5 && -4*x19_1+arg2<4 && -4*x19_1+arg2>=0 && -4*x17_1+arg2<-5*x16_1+arg2 && -12*x19_1-5*x18_1+5*arg2>-1 && -5*x16_1+arg2>=arg2 ], cost: 2
      9: f1_0_main_Load\' -> f384_0_iter_LT : arg1'=1+arg2, arg2'=1-5*x16_1+arg2, arg3'=-1-4*x17_1+arg2, arg4'=-1-12*x17_1-5*x16_1+5*arg2, [ arg1>0 && arg2>-1 && -5*x16_1+arg2>=0 && -5*x16_1+arg2<5 && -4*x17_1+arg2>=0 && -4*x17_1+arg2<4 && -5*x18_1+arg2>=0 && -5*x18_1+arg2<5 && -4*x19_1+arg2<4 && -4*x19_1+arg2>=0 && -12*x19_1-5*x18_1+5*arg2>-1 && -4*x17_1+arg2>=-5*x16_1+arg2 && -5*x16_1+arg2>=arg2 ], cost: 2
      5: __init -> f1_0_main_Load : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [], 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),?)