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, arg5'=arg5P_1, [ arg2>-1 && x23_1<=200*arg2 && arg1>0 && arg1==arg1P_1 && arg2==arg2P_1 ], cost: 1
      1: f1_0_main_Load\' -> f1870_0_rec_LE : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, arg5'=arg5P_2, [ arg2>-1 && arg2P_2<=200*arg2 && arg1>0 && 200*arg2-13*arg2P_2<13 && 200*arg2-13*arg2P_2>=0 && 100*arg2==arg1P_2 && 100*arg2+arg2P_2==arg3P_2 && arg2==arg4P_2 && 0==arg5P_2 ], cost: 1
      2: f1870_0_rec_LE -> f1870_0_rec_LE : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, arg5'=arg5P_3, [ arg3>0 && arg4>-1 && -1+arg2<arg2 && arg5>=arg4 && arg1==arg1P_3 && -1+arg2==arg2P_3 && -1+arg2+arg1==arg3P_3 && arg4==arg4P_3 && arg5==arg5P_3 ], cost: 1
      3: f1870_0_rec_LE -> f1870_0_rec_LE : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, arg5'=arg5P_4, [ arg4>1 && 1+arg5<arg4 && arg3>0 && arg5>-1 && x13_1>-1 && x14_1>-1 && x13_1*x14_1<=9 && 2+arg5<=arg4 && -1+arg2<arg2 && arg1==arg1P_4 && -1+arg2==arg2P_4 && -1+arg2+arg1==arg3P_4 && arg4==arg4P_4 && 2+arg5==arg5P_4 ], cost: 1
      4: f1870_0_rec_LE -> f1870_0_rec_LE : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, arg5'=arg5P_5, [ arg4>1 && 1+arg5<arg4 && arg3>0 && arg5>-1 && x20_1>-1 && x21_1>-1 && x20_1*x21_1>9 && 2+arg5<=arg4 && -1+arg1<arg1 && -1+arg1==arg1P_5 && arg2==arg2P_5 && -1+arg2+arg1==arg3P_5 && arg4==arg4P_5 && 2+arg5==arg5P_5 ], cost: 1
      5: __init -> f1_0_main_Load : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, arg5'=arg5P_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, arg5'=arg5P_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, arg5'=arg5P_1, [ arg2>-1 && arg1>0 ], cost: 1
      1: f1_0_main_Load\' -> f1870_0_rec_LE : arg1'=100*arg2, arg2'=arg2P_2, arg3'=100*arg2+arg2P_2, arg4'=arg2, arg5'=0, [ arg2P_2<=200*arg2 && arg1>0 && 200*arg2-13*arg2P_2<13 && 200*arg2-13*arg2P_2>=0 ], cost: 1
      2: f1870_0_rec_LE -> f1870_0_rec_LE : arg2'=-1+arg2, arg3'=-1+arg2+arg1, [ arg3>0 && arg4>-1 && arg5>=arg4 ], cost: 1
      3: f1870_0_rec_LE -> f1870_0_rec_LE : arg2'=-1+arg2, arg3'=-1+arg2+arg1, arg5'=2+arg5, [ 1+arg5<arg4 && arg3>0 && arg5>-1 && x13_1>-1 && x14_1>-1 && x13_1*x14_1<=9 ], cost: 1
      4: f1870_0_rec_LE -> f1870_0_rec_LE : arg1'=-1+arg1, arg3'=-1+arg2+arg1, arg5'=2+arg5, [ 1+arg5<arg4 && arg3>0 && arg5>-1 && x21_1>-1 && x20_1*x21_1>9 ], cost: 1
      5: __init -> f1_0_main_Load : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, arg5'=arg5P_6, [], cost: 1

### Simplification by acceleration and chaining ###

Accelerating simple loops of location 2.
   Accelerating the following rules:
      2: f1870_0_rec_LE -> f1870_0_rec_LE : arg2'=-1+arg2, arg3'=-1+arg2+arg1, [ arg3>0 && arg4>-1 && arg5>=arg4 ], cost: 1
      3: f1870_0_rec_LE -> f1870_0_rec_LE : arg2'=-1+arg2, arg3'=-1+arg2+arg1, arg5'=2+arg5, [ 1+arg5<arg4 && arg3>0 && arg5>-1 && x13_1>-1 && x14_1>-1 && x13_1*x14_1<=9 ], cost: 1
      4: f1870_0_rec_LE -> f1870_0_rec_LE : arg1'=-1+arg1, arg3'=-1+arg2+arg1, arg5'=2+arg5, [ 1+arg5<arg4 && arg3>0 && arg5>-1 && x21_1>-1 && x20_1*x21_1>9 ], cost: 1

   Failed to prove monotonicity of the guard of rule 2.
   Failed to prove monotonicity of the guard of rule 3.
   Failed to prove monotonicity of the guard of rule 4.
[accelerate] Nesting with 3 inner and 3 outer candidates

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, arg5'=arg5P_1, [ arg2>-1 && arg1>0 ], cost: 1
      1: f1_0_main_Load\' -> f1870_0_rec_LE : arg1'=100*arg2, arg2'=arg2P_2, arg3'=100*arg2+arg2P_2, arg4'=arg2, arg5'=0, [ arg2P_2<=200*arg2 && arg1>0 && 200*arg2-13*arg2P_2<13 && 200*arg2-13*arg2P_2>=0 ], cost: 1
      2: f1870_0_rec_LE -> f1870_0_rec_LE : arg2'=-1+arg2, arg3'=-1+arg2+arg1, [ arg3>0 && arg4>-1 && arg5>=arg4 ], cost: 1
      3: f1870_0_rec_LE -> f1870_0_rec_LE : arg2'=-1+arg2, arg3'=-1+arg2+arg1, arg5'=2+arg5, [ 1+arg5<arg4 && arg3>0 && arg5>-1 && x13_1>-1 && x14_1>-1 && x13_1*x14_1<=9 ], cost: 1
      4: f1870_0_rec_LE -> f1870_0_rec_LE : arg1'=-1+arg1, arg3'=-1+arg2+arg1, arg5'=2+arg5, [ 1+arg5<arg4 && arg3>0 && arg5>-1 && x21_1>-1 && x20_1*x21_1>9 ], cost: 1
      5: __init -> f1_0_main_Load : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, arg5'=arg5P_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, arg5'=arg5P_1, [ arg2>-1 && arg1>0 ], cost: 1
      1: f1_0_main_Load\' -> f1870_0_rec_LE : arg1'=100*arg2, arg2'=arg2P_2, arg3'=100*arg2+arg2P_2, arg4'=arg2, arg5'=0, [ arg2P_2<=200*arg2 && arg1>0 && 200*arg2-13*arg2P_2<13 && 200*arg2-13*arg2P_2>=0 ], cost: 1
      6: f1_0_main_Load\' -> f1870_0_rec_LE : arg1'=100*arg2, arg2'=-1+arg2P_2, arg3'=-1+100*arg2+arg2P_2, arg4'=arg2, arg5'=2, [ arg2P_2<=200*arg2 && arg1>0 && 200*arg2-13*arg2P_2<13 && 200*arg2-13*arg2P_2>=0 && 1<arg2 && 100*arg2+arg2P_2>0 && x13_1>-1 && x14_1>-1 && x13_1*x14_1<=9 ], cost: 2
      7: f1_0_main_Load\' -> f1870_0_rec_LE : arg1'=-1+100*arg2, arg2'=arg2P_2, arg3'=-1+100*arg2+arg2P_2, arg4'=arg2, arg5'=2, [ arg2P_2<=200*arg2 && arg1>0 && 200*arg2-13*arg2P_2<13 && 200*arg2-13*arg2P_2>=0 && 1<arg2 && 100*arg2+arg2P_2>0 && x21_1>-1 && x20_1*x21_1>9 ], cost: 2
      5: __init -> f1_0_main_Load : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, arg5'=arg5P_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),?)