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 && x38_1<=200*arg2 && x39_1<=arg1 && arg1>0 && x39_1>0 && arg1==arg1P_1 && arg2==arg2P_1 ], cost: 1
      1: f1_0_main_Load\' -> f1321_0_main_LE : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, arg5'=arg5P_2, [ arg2>-1 && arg3P_2<=200*arg2 && arg1P_2<=arg1 && arg1>0 && arg1P_2>0 && 200*arg2-13*arg3P_2<13 && 200*arg2-13*arg3P_2>=0 && 100*arg2==arg2P_2 && 100*arg2+arg3P_2==arg4P_2 && 0==arg5P_2 ], cost: 1
      2: f1321_0_main_LE -> f1321_0_main_LE : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, arg5'=arg5P_3, [ arg4>0 && x4_1>-1 && arg5>=x4_1 && arg1>=arg1P_3 && arg1>0 && arg1P_3>0 && arg2==arg2P_3 && -1+arg3==arg3P_3 && -1+arg2+arg3==arg4P_3 && arg5==arg5P_3 ], cost: 1
      3: f1321_0_main_LE -> f1321_0_main_LE : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, arg5'=arg5P_4, [ arg4>0 && x11_1>-1 && arg5>-1 && arg5<x11_1 && x18_1>-1 && 1+arg5>=x11_1 && arg1P_4<=arg1 && arg1>0 && arg1P_4>0 && arg2==arg2P_4 && -1+arg3==arg3P_4 && -1+arg2+arg3==arg4P_4 && 1+arg5==arg5P_4 ], cost: 1
      4: f1321_0_main_LE -> f1321_0_main_LE : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, arg5'=arg5P_5, [ x19_1>-1 && 1+arg5<x19_1 && arg4>0 && arg5>-1 && x26_1>-1 && x27_1*x26_1<=9 && x27_1>-1 && arg1P_5<=arg1 && arg1>0 && arg1P_5>0 && arg2==arg2P_5 && -1+arg3==arg3P_5 && -1+arg2+arg3==arg4P_5 && 2+arg5==arg5P_5 ], cost: 1
      5: f1321_0_main_LE -> f1321_0_main_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, arg5'=arg5P_6, [ x28_1>-1 && 1+arg5<x28_1 && arg4>0 && arg5>-1 && x35_1>-1 && x36_1*x35_1>9 && x36_1>-1 && arg1P_6<=arg1 && arg1>0 && arg1P_6>0 && -1+arg2==arg2P_6 && arg3==arg3P_6 && -1+arg2+arg3==arg4P_6 && 2+arg5==arg5P_6 ], cost: 1
      6: __init -> f1_0_main_Load : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_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, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, [], 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\' -> f1321_0_main_LE : arg1'=arg1P_2, arg2'=100*arg2, arg3'=arg3P_2, arg4'=100*arg2+arg3P_2, arg5'=0, [ arg3P_2<=200*arg2 && arg1P_2<=arg1 && arg1>0 && arg1P_2>0 && 200*arg2-13*arg3P_2<13 && 200*arg2-13*arg3P_2>=0 ], cost: 1
      2: f1321_0_main_LE -> f1321_0_main_LE : arg1'=arg1P_3, arg3'=-1+arg3, arg4'=-1+arg2+arg3, [ arg4>0 && arg1>=arg1P_3 && arg1>0 && arg1P_3>0 && 0<=arg5 ], cost: 1
      3: f1321_0_main_LE -> f1321_0_main_LE : arg1'=arg1P_4, arg3'=-1+arg3, arg4'=-1+arg2+arg3, arg5'=1+arg5, [ arg4>0 && arg5>-1 && arg1P_4<=arg1 && arg1>0 && arg1P_4>0 ], cost: 1
      4: f1321_0_main_LE -> f1321_0_main_LE : arg1'=arg1P_5, arg3'=-1+arg3, arg4'=-1+arg2+arg3, arg5'=2+arg5, [ arg4>0 && arg5>-1 && x26_1>-1 && x27_1*x26_1<=9 && x27_1>-1 && arg1P_5<=arg1 && arg1>0 && arg1P_5>0 ], cost: 1
      5: f1321_0_main_LE -> f1321_0_main_LE : arg1'=arg1P_6, arg2'=-1+arg2, arg4'=-1+arg2+arg3, arg5'=2+arg5, [ arg4>0 && arg5>-1 && x35_1>-1 && x36_1*x35_1>9 && arg1P_6<=arg1 && arg1>0 && arg1P_6>0 ], cost: 1
      6: __init -> f1_0_main_Load : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, [], cost: 1

### Simplification by acceleration and chaining ###

Accelerating simple loops of location 2.
   Accelerating the following rules:
      2: f1321_0_main_LE -> f1321_0_main_LE : arg1'=arg1P_3, arg3'=-1+arg3, arg4'=-1+arg2+arg3, [ arg4>0 && arg1>=arg1P_3 && arg1>0 && arg1P_3>0 && 0<=arg5 ], cost: 1
      3: f1321_0_main_LE -> f1321_0_main_LE : arg1'=arg1P_4, arg3'=-1+arg3, arg4'=-1+arg2+arg3, arg5'=1+arg5, [ arg4>0 && arg5>-1 && arg1P_4<=arg1 && arg1>0 && arg1P_4>0 ], cost: 1
      4: f1321_0_main_LE -> f1321_0_main_LE : arg1'=arg1P_5, arg3'=-1+arg3, arg4'=-1+arg2+arg3, arg5'=2+arg5, [ arg4>0 && arg5>-1 && x26_1>-1 && x27_1*x26_1<=9 && x27_1>-1 && arg1P_5<=arg1 && arg1>0 && arg1P_5>0 ], cost: 1
      5: f1321_0_main_LE -> f1321_0_main_LE : arg1'=arg1P_6, arg2'=-1+arg2, arg4'=-1+arg2+arg3, arg5'=2+arg5, [ arg4>0 && arg5>-1 && x35_1>-1 && x36_1*x35_1>9 && arg1P_6<=arg1 && arg1>0 && arg1P_6>0 ], cost: 1

[test] deduced pseudo-invariant -1+arg2+arg3-arg4<=0, also trying 1-arg2-arg3+arg4<=-1
   Accelerated rule 2 with backward acceleration, yielding the new rule 7.
[test] deduced pseudo-invariant -1+arg2+arg3-arg4<=0, also trying 1-arg2-arg3+arg4<=-1
   Accelerated rule 3 with backward acceleration, yielding the new rule 8.
[test] deduced pseudo-invariant -1+arg2+arg3-arg4<=0, also trying 1-arg2-arg3+arg4<=-1
   Accelerated rule 4 with backward acceleration, yielding the new rule 9.
[test] deduced pseudo-invariant -1+arg2+arg3-arg4<=0, also trying 1-arg2-arg3+arg4<=-1
   Accelerated rule 5 with backward acceleration, yielding the new rule 10.
[accelerate] Nesting with 4 inner and 4 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\' -> f1321_0_main_LE : arg1'=arg1P_2, arg2'=100*arg2, arg3'=arg3P_2, arg4'=100*arg2+arg3P_2, arg5'=0, [ arg3P_2<=200*arg2 && arg1P_2<=arg1 && arg1>0 && arg1P_2>0 && 200*arg2-13*arg3P_2<13 && 200*arg2-13*arg3P_2>=0 ], cost: 1
      2: f1321_0_main_LE -> f1321_0_main_LE : arg1'=arg1P_3, arg3'=-1+arg3, arg4'=-1+arg2+arg3, [ arg4>0 && arg1>=arg1P_3 && arg1>0 && arg1P_3>0 && 0<=arg5 ], cost: 1
      3: f1321_0_main_LE -> f1321_0_main_LE : arg1'=arg1P_4, arg3'=-1+arg3, arg4'=-1+arg2+arg3, arg5'=1+arg5, [ arg4>0 && arg5>-1 && arg1P_4<=arg1 && arg1>0 && arg1P_4>0 ], cost: 1
      4: f1321_0_main_LE -> f1321_0_main_LE : arg1'=arg1P_5, arg3'=-1+arg3, arg4'=-1+arg2+arg3, arg5'=2+arg5, [ arg4>0 && arg5>-1 && x26_1>-1 && x27_1*x26_1<=9 && x27_1>-1 && arg1P_5<=arg1 && arg1>0 && arg1P_5>0 ], cost: 1
      5: f1321_0_main_LE -> f1321_0_main_LE : arg1'=arg1P_6, arg2'=-1+arg2, arg4'=-1+arg2+arg3, arg5'=2+arg5, [ arg4>0 && arg5>-1 && x35_1>-1 && x36_1*x35_1>9 && arg1P_6<=arg1 && arg1>0 && arg1P_6>0 ], cost: 1
      7: f1321_0_main_LE -> f1321_0_main_LE : arg1'=arg1P_3, arg3'=-arg2, arg4'=0, [ arg1>=arg1P_3 && arg1>0 && arg1P_3>0 && 0<=arg5 && -1+arg2+arg3-arg4<=0 && arg2+arg3>=1 ], cost: arg2+arg3
      8: f1321_0_main_LE -> f1321_0_main_LE : arg1'=arg1P_4, arg3'=-arg2, arg4'=0, arg5'=arg5+arg2+arg3, [ arg5>-1 && arg1P_4<=arg1 && arg1>0 && arg1P_4>0 && -1+arg2+arg3-arg4<=0 && arg2+arg3>=1 ], cost: arg2+arg3
      9: f1321_0_main_LE -> f1321_0_main_LE : arg1'=arg1P_5, arg3'=-arg2, arg4'=0, arg5'=arg5+2*arg2+2*arg3, [ arg5>-1 && x26_1>-1 && x27_1*x26_1<=9 && x27_1>-1 && arg1P_5<=arg1 && arg1>0 && arg1P_5>0 && -1+arg2+arg3-arg4<=0 && arg2+arg3>=1 ], cost: arg2+arg3
     10: f1321_0_main_LE -> f1321_0_main_LE : arg1'=arg1P_6, arg2'=-arg3, arg4'=0, arg5'=arg5+2*arg2+2*arg3, [ arg5>-1 && x35_1>-1 && x36_1*x35_1>9 && arg1P_6<=arg1 && arg1>0 && arg1P_6>0 && -1+arg2+arg3-arg4<=0 && arg2+arg3>=1 ], cost: arg2+arg3
      6: __init -> f1_0_main_Load : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, [], 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\' -> f1321_0_main_LE : arg1'=arg1P_2, arg2'=100*arg2, arg3'=arg3P_2, arg4'=100*arg2+arg3P_2, arg5'=0, [ arg3P_2<=200*arg2 && arg1P_2<=arg1 && arg1>0 && arg1P_2>0 && 200*arg2-13*arg3P_2<13 && 200*arg2-13*arg3P_2>=0 ], cost: 1
     11: f1_0_main_Load\' -> f1321_0_main_LE : arg1'=arg1P_3, arg2'=100*arg2, arg3'=-1+arg3P_2, arg4'=-1+100*arg2+arg3P_2, arg5'=0, [ arg3P_2<=200*arg2 && arg1>0 && 200*arg2-13*arg3P_2<13 && 200*arg2-13*arg3P_2>=0 && 100*arg2+arg3P_2>0 && arg1P_3>0 && arg1P_3<=arg1 ], cost: 2
     12: f1_0_main_Load\' -> f1321_0_main_LE : arg1'=arg1P_4, arg2'=100*arg2, arg3'=-1+arg3P_2, arg4'=-1+100*arg2+arg3P_2, arg5'=1, [ arg3P_2<=200*arg2 && arg1>0 && 200*arg2-13*arg3P_2<13 && 200*arg2-13*arg3P_2>=0 && 100*arg2+arg3P_2>0 && arg1P_4>0 && arg1P_4<=arg1 ], cost: 2
     13: f1_0_main_Load\' -> f1321_0_main_LE : arg1'=arg1P_5, arg2'=100*arg2, arg3'=-1+arg3P_2, arg4'=-1+100*arg2+arg3P_2, arg5'=2, [ arg3P_2<=200*arg2 && arg1>0 && 200*arg2-13*arg3P_2<13 && 200*arg2-13*arg3P_2>=0 && 100*arg2+arg3P_2>0 && x26_1>-1 && x27_1*x26_1<=9 && x27_1>-1 && arg1P_5>0 && arg1P_5<=arg1 ], cost: 2
     14: f1_0_main_Load\' -> f1321_0_main_LE : arg1'=arg1P_6, arg2'=-1+100*arg2, arg3'=arg3P_2, arg4'=-1+100*arg2+arg3P_2, arg5'=2, [ arg3P_2<=200*arg2 && arg1>0 && 200*arg2-13*arg3P_2<13 && 200*arg2-13*arg3P_2>=0 && 100*arg2+arg3P_2>0 && x35_1>-1 && x36_1*x35_1>9 && arg1P_6>0 && arg1P_6<=arg1 ], cost: 2
     15: f1_0_main_Load\' -> f1321_0_main_LE : arg1'=arg1P_3, arg2'=100*arg2, arg3'=-100*arg2, arg4'=0, arg5'=0, [ arg3P_2<=200*arg2 && arg1>0 && 200*arg2-13*arg3P_2<13 && 200*arg2-13*arg3P_2>=0 && arg1P_3>0 && 100*arg2+arg3P_2>=1 && arg1P_3<=arg1 ], cost: 1+100*arg2+arg3P_2
     16: f1_0_main_Load\' -> f1321_0_main_LE : arg1'=arg1P_4, arg2'=100*arg2, arg3'=-100*arg2, arg4'=0, arg5'=100*arg2+arg3P_2, [ arg3P_2<=200*arg2 && arg1>0 && 200*arg2-13*arg3P_2<13 && 200*arg2-13*arg3P_2>=0 && arg1P_4>0 && 100*arg2+arg3P_2>=1 && arg1P_4<=arg1 ], cost: 1+100*arg2+arg3P_2
     17: f1_0_main_Load\' -> f1321_0_main_LE : arg1'=arg1P_5, arg2'=100*arg2, arg3'=-100*arg2, arg4'=0, arg5'=200*arg2+2*arg3P_2, [ arg3P_2<=200*arg2 && arg1>0 && 200*arg2-13*arg3P_2<13 && 200*arg2-13*arg3P_2>=0 && x26_1>-1 && x27_1*x26_1<=9 && x27_1>-1 && arg1P_5>0 && 100*arg2+arg3P_2>=1 && arg1P_5<=arg1 ], cost: 1+100*arg2+arg3P_2
     18: f1_0_main_Load\' -> f1321_0_main_LE : arg1'=arg1P_6, arg2'=-arg3P_2, arg3'=arg3P_2, arg4'=0, arg5'=200*arg2+2*arg3P_2, [ arg3P_2<=200*arg2 && arg1>0 && 200*arg2-13*arg3P_2<13 && 200*arg2-13*arg3P_2>=0 && x35_1>-1 && x36_1*x35_1>9 && arg1P_6>0 && 100*arg2+arg3P_2>=1 && arg1P_6<=arg1 ], cost: 1+100*arg2+arg3P_2
      6: __init -> f1_0_main_Load : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, [], cost: 1

Removed unreachable locations (and leaf rules with constant cost):
   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
     15: f1_0_main_Load\' -> f1321_0_main_LE : arg1'=arg1P_3, arg2'=100*arg2, arg3'=-100*arg2, arg4'=0, arg5'=0, [ arg3P_2<=200*arg2 && arg1>0 && 200*arg2-13*arg3P_2<13 && 200*arg2-13*arg3P_2>=0 && arg1P_3>0 && 100*arg2+arg3P_2>=1 && arg1P_3<=arg1 ], cost: 1+100*arg2+arg3P_2
     16: f1_0_main_Load\' -> f1321_0_main_LE : arg1'=arg1P_4, arg2'=100*arg2, arg3'=-100*arg2, arg4'=0, arg5'=100*arg2+arg3P_2, [ arg3P_2<=200*arg2 && arg1>0 && 200*arg2-13*arg3P_2<13 && 200*arg2-13*arg3P_2>=0 && arg1P_4>0 && 100*arg2+arg3P_2>=1 && arg1P_4<=arg1 ], cost: 1+100*arg2+arg3P_2
     17: f1_0_main_Load\' -> f1321_0_main_LE : arg1'=arg1P_5, arg2'=100*arg2, arg3'=-100*arg2, arg4'=0, arg5'=200*arg2+2*arg3P_2, [ arg3P_2<=200*arg2 && arg1>0 && 200*arg2-13*arg3P_2<13 && 200*arg2-13*arg3P_2>=0 && x26_1>-1 && x27_1*x26_1<=9 && x27_1>-1 && arg1P_5>0 && 100*arg2+arg3P_2>=1 && arg1P_5<=arg1 ], cost: 1+100*arg2+arg3P_2
     18: f1_0_main_Load\' -> f1321_0_main_LE : arg1'=arg1P_6, arg2'=-arg3P_2, arg3'=arg3P_2, arg4'=0, arg5'=200*arg2+2*arg3P_2, [ arg3P_2<=200*arg2 && arg1>0 && 200*arg2-13*arg3P_2<13 && 200*arg2-13*arg3P_2>=0 && x35_1>-1 && x36_1*x35_1>9 && arg1P_6>0 && 100*arg2+arg3P_2>=1 && arg1P_6<=arg1 ], cost: 1+100*arg2+arg3P_2
      6: __init -> f1_0_main_Load : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, [], cost: 1

Eliminated locations (on linear paths):
   Start location: __init
     15: f1_0_main_Load\' -> f1321_0_main_LE : arg1'=arg1P_3, arg2'=100*arg2, arg3'=-100*arg2, arg4'=0, arg5'=0, [ arg3P_2<=200*arg2 && arg1>0 && 200*arg2-13*arg3P_2<13 && 200*arg2-13*arg3P_2>=0 && arg1P_3>0 && 100*arg2+arg3P_2>=1 && arg1P_3<=arg1 ], cost: 1+100*arg2+arg3P_2
     16: f1_0_main_Load\' -> f1321_0_main_LE : arg1'=arg1P_4, arg2'=100*arg2, arg3'=-100*arg2, arg4'=0, arg5'=100*arg2+arg3P_2, [ arg3P_2<=200*arg2 && arg1>0 && 200*arg2-13*arg3P_2<13 && 200*arg2-13*arg3P_2>=0 && arg1P_4>0 && 100*arg2+arg3P_2>=1 && arg1P_4<=arg1 ], cost: 1+100*arg2+arg3P_2
     17: f1_0_main_Load\' -> f1321_0_main_LE : arg1'=arg1P_5, arg2'=100*arg2, arg3'=-100*arg2, arg4'=0, arg5'=200*arg2+2*arg3P_2, [ arg3P_2<=200*arg2 && arg1>0 && 200*arg2-13*arg3P_2<13 && 200*arg2-13*arg3P_2>=0 && x26_1>-1 && x27_1*x26_1<=9 && x27_1>-1 && arg1P_5>0 && 100*arg2+arg3P_2>=1 && arg1P_5<=arg1 ], cost: 1+100*arg2+arg3P_2
     18: f1_0_main_Load\' -> f1321_0_main_LE : arg1'=arg1P_6, arg2'=-arg3P_2, arg3'=arg3P_2, arg4'=0, arg5'=200*arg2+2*arg3P_2, [ arg3P_2<=200*arg2 && arg1>0 && 200*arg2-13*arg3P_2<13 && 200*arg2-13*arg3P_2>=0 && x35_1>-1 && x36_1*x35_1>9 && arg1P_6>0 && 100*arg2+arg3P_2>=1 && arg1P_6<=arg1 ], cost: 1+100*arg2+arg3P_2
     19: __init -> f1_0_main_Load\' : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_1, arg4'=arg4P_1, arg5'=arg5P_1, [ arg2P_7>-1 && arg1P_7>0 ], cost: 2

Eliminated locations (on tree-shaped paths):
   Start location: __init
     20: __init -> f1321_0_main_LE : arg1'=arg1P_3, arg2'=100*arg2P_7, arg3'=-100*arg2P_7, arg4'=0, arg5'=0, [ arg2P_7>-1 && arg1P_7>0 && arg3P_2<=200*arg2P_7 && 200*arg2P_7-13*arg3P_2<13 && 200*arg2P_7-13*arg3P_2>=0 && arg1P_3>0 && 100*arg2P_7+arg3P_2>=1 && arg1P_3<=arg1P_7 ], cost: 3+100*arg2P_7+arg3P_2
     21: __init -> f1321_0_main_LE : arg1'=arg1P_4, arg2'=100*arg2P_7, arg3'=-100*arg2P_7, arg4'=0, arg5'=100*arg2P_7+arg3P_2, [ arg2P_7>-1 && arg1P_7>0 && arg3P_2<=200*arg2P_7 && 200*arg2P_7-13*arg3P_2<13 && 200*arg2P_7-13*arg3P_2>=0 && arg1P_4>0 && 100*arg2P_7+arg3P_2>=1 && arg1P_4<=arg1P_7 ], cost: 3+100*arg2P_7+arg3P_2
     22: __init -> f1321_0_main_LE : arg1'=arg1P_5, arg2'=100*arg2P_7, arg3'=-100*arg2P_7, arg4'=0, arg5'=200*arg2P_7+2*arg3P_2, [ arg2P_7>-1 && arg1P_7>0 && arg3P_2<=200*arg2P_7 && 200*arg2P_7-13*arg3P_2<13 && 200*arg2P_7-13*arg3P_2>=0 && x26_1>-1 && x27_1*x26_1<=9 && x27_1>-1 && arg1P_5>0 && 100*arg2P_7+arg3P_2>=1 && arg1P_5<=arg1P_7 ], cost: 3+100*arg2P_7+arg3P_2
     23: __init -> f1321_0_main_LE : arg1'=arg1P_6, arg2'=-arg3P_2, arg3'=arg3P_2, arg4'=0, arg5'=200*arg2P_7+2*arg3P_2, [ arg2P_7>-1 && arg1P_7>0 && arg3P_2<=200*arg2P_7 && 200*arg2P_7-13*arg3P_2<13 && 200*arg2P_7-13*arg3P_2>=0 && x35_1>-1 && x36_1*x35_1>9 && arg1P_6>0 && 100*arg2P_7+arg3P_2>=1 && arg1P_6<=arg1P_7 ], cost: 3+100*arg2P_7+arg3P_2

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     20: __init -> f1321_0_main_LE : arg1'=arg1P_3, arg2'=100*arg2P_7, arg3'=-100*arg2P_7, arg4'=0, arg5'=0, [ arg2P_7>-1 && arg1P_7>0 && arg3P_2<=200*arg2P_7 && 200*arg2P_7-13*arg3P_2<13 && 200*arg2P_7-13*arg3P_2>=0 && arg1P_3>0 && 100*arg2P_7+arg3P_2>=1 && arg1P_3<=arg1P_7 ], cost: 3+100*arg2P_7+arg3P_2
     21: __init -> f1321_0_main_LE : arg1'=arg1P_4, arg2'=100*arg2P_7, arg3'=-100*arg2P_7, arg4'=0, arg5'=100*arg2P_7+arg3P_2, [ arg2P_7>-1 && arg1P_7>0 && arg3P_2<=200*arg2P_7 && 200*arg2P_7-13*arg3P_2<13 && 200*arg2P_7-13*arg3P_2>=0 && arg1P_4>0 && 100*arg2P_7+arg3P_2>=1 && arg1P_4<=arg1P_7 ], cost: 3+100*arg2P_7+arg3P_2
     22: __init -> f1321_0_main_LE : arg1'=arg1P_5, arg2'=100*arg2P_7, arg3'=-100*arg2P_7, arg4'=0, arg5'=200*arg2P_7+2*arg3P_2, [ arg2P_7>-1 && arg1P_7>0 && arg3P_2<=200*arg2P_7 && 200*arg2P_7-13*arg3P_2<13 && 200*arg2P_7-13*arg3P_2>=0 && x26_1>-1 && x27_1*x26_1<=9 && x27_1>-1 && arg1P_5>0 && 100*arg2P_7+arg3P_2>=1 && arg1P_5<=arg1P_7 ], cost: 3+100*arg2P_7+arg3P_2
     23: __init -> f1321_0_main_LE : arg1'=arg1P_6, arg2'=-arg3P_2, arg3'=arg3P_2, arg4'=0, arg5'=200*arg2P_7+2*arg3P_2, [ arg2P_7>-1 && arg1P_7>0 && arg3P_2<=200*arg2P_7 && 200*arg2P_7-13*arg3P_2<13 && 200*arg2P_7-13*arg3P_2>=0 && x35_1>-1 && x36_1*x35_1>9 && arg1P_6>0 && 100*arg2P_7+arg3P_2>=1 && arg1P_6<=arg1P_7 ], cost: 3+100*arg2P_7+arg3P_2

Computing asymptotic complexity for rule 20
   Simplified the guard:
     20: __init -> f1321_0_main_LE : arg1'=arg1P_3, arg2'=100*arg2P_7, arg3'=-100*arg2P_7, arg4'=0, arg5'=0, [ 200*arg2P_7-13*arg3P_2<13 && 200*arg2P_7-13*arg3P_2>=0 && arg1P_3>0 && 100*arg2P_7+arg3P_2>=1 && arg1P_3<=arg1P_7 ], cost: 3+100*arg2P_7+arg3P_2
   Resulting cost 0 has complexity: Unknown

Computing asymptotic complexity for rule 21
   Simplified the guard:
     21: __init -> f1321_0_main_LE : arg1'=arg1P_4, arg2'=100*arg2P_7, arg3'=-100*arg2P_7, arg4'=0, arg5'=100*arg2P_7+arg3P_2, [ 200*arg2P_7-13*arg3P_2<13 && 200*arg2P_7-13*arg3P_2>=0 && arg1P_4>0 && 100*arg2P_7+arg3P_2>=1 && arg1P_4<=arg1P_7 ], cost: 3+100*arg2P_7+arg3P_2
   Resulting cost 0 has complexity: Unknown

Computing asymptotic complexity for rule 23
   Simplified the guard:
     23: __init -> f1321_0_main_LE : arg1'=arg1P_6, arg2'=-arg3P_2, arg3'=arg3P_2, arg4'=0, arg5'=200*arg2P_7+2*arg3P_2, [ 200*arg2P_7-13*arg3P_2<13 && 200*arg2P_7-13*arg3P_2>=0 && x35_1>-1 && x36_1*x35_1>9 && arg1P_6>0 && 100*arg2P_7+arg3P_2>=1 && arg1P_6<=arg1P_7 ], cost: 3+100*arg2P_7+arg3P_2
   Resulting cost 0 has complexity: Unknown

Computing asymptotic complexity for rule 22
   Simplified the guard:
     22: __init -> f1321_0_main_LE : arg1'=arg1P_5, arg2'=100*arg2P_7, arg3'=-100*arg2P_7, arg4'=0, arg5'=200*arg2P_7+2*arg3P_2, [ 200*arg2P_7-13*arg3P_2<13 && 200*arg2P_7-13*arg3P_2>=0 && x26_1>-1 && x27_1*x26_1<=9 && x27_1>-1 && arg1P_5>0 && 100*arg2P_7+arg3P_2>=1 && arg1P_5<=arg1P_7 ], cost: 3+100*arg2P_7+arg3P_2
   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),?)