WORST_CASE(Omega(1),?)

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

Initial linear ITS problem
   Start location: __init
      0: f1_0_main_Load -> f163_0_upAndDown_GT : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, [ arg1>0 && arg2>-1 && 0==arg1P_1 && 0==arg2P_1 && arg2==arg3P_1 ], cost: 1
      1: f163_0_upAndDown_GT -> f163_0_upAndDown_GT : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, [ arg3<10 && arg3<11 && arg1<2 && arg3>0 && 0==arg2 && 0==arg1P_2 && 0==arg2P_2 && -1+arg3==arg3P_2 ], cost: 1
      2: f163_0_upAndDown_GT -> f163_0_upAndDown_GT : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, [ arg1<2 && 10==arg3 && 0==arg1P_3 && 0==arg2P_3 && 9==arg3P_3 ], cost: 1
      3: f163_0_upAndDown_GT -> f163_0_upAndDown_GT : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, [ arg3<11 && arg3>0 && arg3<10 && arg1<2 && 1==arg2 && 1==arg1P_4 && 1==arg2P_4 && 1+arg3==arg3P_4 ], cost: 1
      4: f163_0_upAndDown_GT -> f163_0_upAndDown_GT : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, [ arg1<2 && 0==arg3 && 1==arg1P_5 && 1==arg2P_5 && 1==arg3P_5 ], cost: 1
      5: f163_0_upAndDown_GT -> f163_0_upAndDown_GT : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, [ arg3<10 && arg3<11 && arg1<2 && arg3>0 && 0==arg2 && arg1==arg1P_6 && 0==arg2P_6 && -1+arg3==arg3P_6 ], cost: 1
      6: f163_0_upAndDown_GT -> f163_0_upAndDown_GT : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, [ arg1<2 && 10==arg3 && arg1==arg1P_7 && 0==arg2P_7 && 9==arg3P_7 ], cost: 1
      7: f163_0_upAndDown_GT -> f163_0_upAndDown_GT : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, [ arg3<11 && arg3>0 && arg3<10 && arg1<2 && 1==arg2 && arg1==arg1P_8 && 1==arg2P_8 && 1+arg3==arg3P_8 ], cost: 1
      8: f163_0_upAndDown_GT -> f163_0_upAndDown_GT : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, [ arg1<2 && 0==arg3 && arg1==arg1P_9 && 1==arg2P_9 && 1==arg3P_9 ], cost: 1
      9: __init -> f1_0_main_Load : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, [], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
      9: __init -> f1_0_main_Load : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, [], cost: 1

Simplified all rules, resulting in:
   Start location: __init
      0: f1_0_main_Load -> f163_0_upAndDown_GT : arg1'=0, arg2'=0, arg3'=arg2, [ arg1>0 && arg2>-1 ], cost: 1
      1: f163_0_upAndDown_GT -> f163_0_upAndDown_GT : arg1'=0, arg2'=0, arg3'=-1+arg3, [ arg3<10 && arg1<2 && arg3>0 && 0==arg2 ], cost: 1
      2: f163_0_upAndDown_GT -> f163_0_upAndDown_GT : arg1'=0, arg2'=0, arg3'=9, [ arg1<2 && 10==arg3 ], cost: 1
      3: f163_0_upAndDown_GT -> f163_0_upAndDown_GT : arg1'=1, arg2'=1, arg3'=1+arg3, [ arg3>0 && arg3<10 && arg1<2 && 1==arg2 ], cost: 1
      4: f163_0_upAndDown_GT -> f163_0_upAndDown_GT : arg1'=1, arg2'=1, arg3'=1, [ arg1<2 && 0==arg3 ], cost: 1
      5: f163_0_upAndDown_GT -> f163_0_upAndDown_GT : arg2'=0, arg3'=-1+arg3, [ arg3<10 && arg1<2 && arg3>0 && 0==arg2 ], cost: 1
      6: f163_0_upAndDown_GT -> f163_0_upAndDown_GT : arg2'=0, arg3'=9, [ arg1<2 && 10==arg3 ], cost: 1
      7: f163_0_upAndDown_GT -> f163_0_upAndDown_GT : arg2'=1, arg3'=1+arg3, [ arg3>0 && arg3<10 && arg1<2 && 1==arg2 ], cost: 1
      8: f163_0_upAndDown_GT -> f163_0_upAndDown_GT : arg2'=1, arg3'=1, [ arg1<2 && 0==arg3 ], cost: 1
      9: __init -> f1_0_main_Load : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, [], cost: 1

### Simplification by acceleration and chaining ###

Accelerating simple loops of location 1.
   Accelerating the following rules:
      1: f163_0_upAndDown_GT -> f163_0_upAndDown_GT : arg1'=0, arg2'=0, arg3'=-1+arg3, [ arg3<10 && arg1<2 && arg3>0 && 0==arg2 ], cost: 1
      2: f163_0_upAndDown_GT -> f163_0_upAndDown_GT : arg1'=0, arg2'=0, arg3'=9, [ arg1<2 && 10==arg3 ], cost: 1
      3: f163_0_upAndDown_GT -> f163_0_upAndDown_GT : arg1'=1, arg2'=1, arg3'=1+arg3, [ arg3>0 && arg3<10 && arg1<2 && 1==arg2 ], cost: 1
      4: f163_0_upAndDown_GT -> f163_0_upAndDown_GT : arg1'=1, arg2'=1, arg3'=1, [ arg1<2 && 0==arg3 ], cost: 1
      5: f163_0_upAndDown_GT -> f163_0_upAndDown_GT : arg2'=0, arg3'=-1+arg3, [ arg3<10 && arg1<2 && arg3>0 && 0==arg2 ], cost: 1
      6: f163_0_upAndDown_GT -> f163_0_upAndDown_GT : arg2'=0, arg3'=9, [ arg1<2 && 10==arg3 ], cost: 1
      7: f163_0_upAndDown_GT -> f163_0_upAndDown_GT : arg2'=1, arg3'=1+arg3, [ arg3>0 && arg3<10 && arg1<2 && 1==arg2 ], cost: 1
      8: f163_0_upAndDown_GT -> f163_0_upAndDown_GT : arg2'=1, arg3'=1, [ arg1<2 && 0==arg3 ], cost: 1

   Accelerated rule 1 with backward acceleration, yielding the new rule 10.
   Failed to prove monotonicity of the guard of rule 2.
   Accelerated rule 3 with backward acceleration, yielding the new rule 11.
   Failed to prove monotonicity of the guard of rule 4.
   Accelerated rule 5 with backward acceleration, yielding the new rule 12.
   Failed to prove monotonicity of the guard of rule 6.
   Accelerated rule 7 with backward acceleration, yielding the new rule 13.
   Failed to prove monotonicity of the guard of rule 8.
[accelerate] Nesting with 8 inner and 8 outer candidates
   Removing the simple loops: 1 3 5 7.

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
      0: f1_0_main_Load -> f163_0_upAndDown_GT : arg1'=0, arg2'=0, arg3'=arg2, [ arg1>0 && arg2>-1 ], cost: 1
      2: f163_0_upAndDown_GT -> f163_0_upAndDown_GT : arg1'=0, arg2'=0, arg3'=9, [ arg1<2 && 10==arg3 ], cost: 1
      4: f163_0_upAndDown_GT -> f163_0_upAndDown_GT : arg1'=1, arg2'=1, arg3'=1, [ arg1<2 && 0==arg3 ], cost: 1
      6: f163_0_upAndDown_GT -> f163_0_upAndDown_GT : arg2'=0, arg3'=9, [ arg1<2 && 10==arg3 ], cost: 1
      8: f163_0_upAndDown_GT -> f163_0_upAndDown_GT : arg2'=1, arg3'=1, [ arg1<2 && 0==arg3 ], cost: 1
     10: f163_0_upAndDown_GT -> f163_0_upAndDown_GT : arg1'=0, arg2'=0, arg3'=0, [ arg3<10 && arg1<2 && 0==arg2 && arg3>=1 ], cost: arg3
     11: f163_0_upAndDown_GT -> f163_0_upAndDown_GT : arg1'=1, arg2'=1, arg3'=10, [ arg3>0 && arg1<2 && 1==arg2 && 10-arg3>=1 ], cost: 10-arg3
     12: f163_0_upAndDown_GT -> f163_0_upAndDown_GT : arg2'=0, arg3'=0, [ arg3<10 && arg1<2 && 0==arg2 && arg3>=1 ], cost: arg3
     13: f163_0_upAndDown_GT -> f163_0_upAndDown_GT : arg2'=1, arg3'=10, [ arg3>0 && arg1<2 && 1==arg2 && 10-arg3>=1 ], cost: 10-arg3
      9: __init -> f1_0_main_Load : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, [], cost: 1

Chained accelerated rules (with incoming rules):
   Start location: __init
      0: f1_0_main_Load -> f163_0_upAndDown_GT : arg1'=0, arg2'=0, arg3'=arg2, [ arg1>0 && arg2>-1 ], cost: 1
     14: f1_0_main_Load -> f163_0_upAndDown_GT : arg1'=0, arg2'=0, arg3'=9, [ arg1>0 && 10==arg2 ], cost: 2
     15: f1_0_main_Load -> f163_0_upAndDown_GT : arg1'=1, arg2'=1, arg3'=1, [ arg1>0 && 0==arg2 ], cost: 2
     16: f1_0_main_Load -> f163_0_upAndDown_GT : arg1'=0, arg2'=0, arg3'=9, [ arg1>0 && 10==arg2 ], cost: 2
     17: f1_0_main_Load -> f163_0_upAndDown_GT : arg1'=0, arg2'=1, arg3'=1, [ arg1>0 && 0==arg2 ], cost: 2
     18: f1_0_main_Load -> f163_0_upAndDown_GT : arg1'=0, arg2'=0, arg3'=0, [ arg1>0 && arg2<10 && arg2>=1 ], cost: 1+arg2
     19: f1_0_main_Load -> f163_0_upAndDown_GT : arg1'=0, arg2'=0, arg3'=0, [ arg1>0 && arg2<10 && arg2>=1 ], cost: 1+arg2
      9: __init -> f1_0_main_Load : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, [], cost: 1

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
     18: f1_0_main_Load -> f163_0_upAndDown_GT : arg1'=0, arg2'=0, arg3'=0, [ arg1>0 && arg2<10 && arg2>=1 ], cost: 1+arg2
     19: f1_0_main_Load -> f163_0_upAndDown_GT : arg1'=0, arg2'=0, arg3'=0, [ arg1>0 && arg2<10 && arg2>=1 ], cost: 1+arg2
      9: __init -> f1_0_main_Load : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, [], cost: 1

Eliminated locations (on tree-shaped paths):
   Start location: __init
     20: __init -> f163_0_upAndDown_GT : arg1'=0, arg2'=0, arg3'=0, [ arg1P_10>0 && arg2P_10<10 && arg2P_10>=1 ], cost: 2+arg2P_10
     21: __init -> f163_0_upAndDown_GT : arg1'=0, arg2'=0, arg3'=0, [ arg1P_10>0 && arg2P_10<10 && arg2P_10>=1 ], cost: 2+arg2P_10

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     21: __init -> f163_0_upAndDown_GT : arg1'=0, arg2'=0, arg3'=0, [ arg1P_10>0 && arg2P_10<10 && arg2P_10>=1 ], cost: 2+arg2P_10

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