WORST_CASE(Omega(0),?)

Initial ITS
Start location: __init
   0: f1_0_main_Load -> f113_0_upAndDown_GT : arg1'=arg1P0, arg2'=arg2P0, (arg2-arg2P0 == 0 /\ arg1 > 0 /\ -arg1P0 == 0 /\ 1+arg2 > 0), cost: 1
   1: f113_0_upAndDown_GT -> f113_0_upAndDown_GT : arg1'=arg1P1, arg2'=arg2P1, (-10+arg2 < 0 /\ 1-arg2P1+arg2 == 0 /\ 1-arg1 == 0 /\ 1-arg1P1 == 0 /\ -11+arg2 < 0 /\ arg2 > 0), cost: 1
   2: f113_0_upAndDown_GT -> f113_0_upAndDown_GT : arg1'=arg1P2, arg2'=arg2P2, (-10+arg2 < 0 /\ -arg1P2 == 0 /\ -1-arg2P2+arg2 == 0 /\ -arg1 == 0 /\ -11+arg2 < 0 /\ arg2 > 0), cost: 1
   3: f113_0_upAndDown_GT -> f113_0_upAndDown_GT : arg1'=arg1P3, arg2'=arg2P3, (9-arg2P3 == 0 /\ 10-arg2 == 0 /\ -arg1P3 == 0), cost: 1
   4: f113_0_upAndDown_GT -> f113_0_upAndDown_GT : arg1'=arg1P4, arg2'=arg2P4, (-arg2 == 0 /\ 1-arg1P4 == 0 /\ 1-arg2P4 == 0), cost: 1
   5: __init -> f1_0_main_Load : arg1'=arg1P5, arg2'=arg2P5, TRUE, cost: 1


Applied preprocessing
Original rule:
f1_0_main_Load -> f113_0_upAndDown_GT : arg1'=arg1P0, arg2'=arg2P0, (arg2-arg2P0 == 0 /\ arg1 > 0 /\ -arg1P0 == 0 /\ 1+arg2 > 0), cost: 1
New rule:
f1_0_main_Load -> f113_0_upAndDown_GT : arg1'=0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1

Applied preprocessing
Original rule:
f113_0_upAndDown_GT -> f113_0_upAndDown_GT : arg1'=arg1P1, arg2'=arg2P1, (-10+arg2 < 0 /\ 1-arg2P1+arg2 == 0 /\ 1-arg1 == 0 /\ 1-arg1P1 == 0 /\ -11+arg2 < 0 /\ arg2 > 0), cost: 1
New rule:
f113_0_upAndDown_GT -> f113_0_upAndDown_GT : arg1'=1, arg2'=1+arg2, (-1+arg1 == 0 /\ 10-arg2 > 0 /\ arg2 > 0), cost: 1

Applied preprocessing
Original rule:
f113_0_upAndDown_GT -> f113_0_upAndDown_GT : arg1'=arg1P2, arg2'=arg2P2, (-10+arg2 < 0 /\ -arg1P2 == 0 /\ -1-arg2P2+arg2 == 0 /\ -arg1 == 0 /\ -11+arg2 < 0 /\ arg2 > 0), cost: 1
New rule:
f113_0_upAndDown_GT -> f113_0_upAndDown_GT : arg1'=0, arg2'=-1+arg2, (arg1 == 0 /\ 10-arg2 > 0 /\ arg2 > 0), cost: 1

Applied preprocessing
Original rule:
f113_0_upAndDown_GT -> f113_0_upAndDown_GT : arg1'=arg1P3, arg2'=arg2P3, (9-arg2P3 == 0 /\ 10-arg2 == 0 /\ -arg1P3 == 0), cost: 1
New rule:
f113_0_upAndDown_GT -> f113_0_upAndDown_GT : arg1'=0, arg2'=9, -10+arg2 == 0, cost: 1

Applied preprocessing
Original rule:
f113_0_upAndDown_GT -> f113_0_upAndDown_GT : arg1'=arg1P4, arg2'=arg2P4, (-arg2 == 0 /\ 1-arg1P4 == 0 /\ 1-arg2P4 == 0), cost: 1
New rule:
f113_0_upAndDown_GT -> f113_0_upAndDown_GT : arg1'=1, arg2'=1, arg2 == 0, cost: 1

Simplified rules
Start location: __init
   6: f1_0_main_Load -> f113_0_upAndDown_GT : arg1'=0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1
   7: f113_0_upAndDown_GT -> f113_0_upAndDown_GT : arg1'=1, arg2'=1+arg2, (-1+arg1 == 0 /\ 10-arg2 > 0 /\ arg2 > 0), cost: 1
   8: f113_0_upAndDown_GT -> f113_0_upAndDown_GT : arg1'=0, arg2'=-1+arg2, (arg1 == 0 /\ 10-arg2 > 0 /\ arg2 > 0), cost: 1
   9: f113_0_upAndDown_GT -> f113_0_upAndDown_GT : arg1'=0, arg2'=9, -10+arg2 == 0, cost: 1
  10: f113_0_upAndDown_GT -> f113_0_upAndDown_GT : arg1'=1, arg2'=1, arg2 == 0, cost: 1
   5: __init -> f1_0_main_Load : arg1'=arg1P5, arg2'=arg2P5, TRUE, cost: 1


Applied acceleration
Original rule:
f113_0_upAndDown_GT -> f113_0_upAndDown_GT : arg1'=1, arg2'=1+arg2, (-1+arg1 == 0 /\ 10-arg2 > 0 /\ arg2 > 0), cost: 1
New rule:
f113_0_upAndDown_GT -> f113_0_upAndDown_GT : arg1'=1, arg2'=n3+arg2, (1-arg1 >= 0 /\ -1+arg1 >= 0 /\ 11-n3-arg2 > 0 /\ arg2 > 0 /\ -1+n3 >= 0), cost: n3

Applied instantiation
Original rule:
f113_0_upAndDown_GT -> f113_0_upAndDown_GT : arg1'=1, arg2'=n3+arg2, (1-arg1 >= 0 /\ -1+arg1 >= 0 /\ 11-n3-arg2 > 0 /\ arg2 > 0 /\ -1+n3 >= 0), cost: n3
New rule:
f113_0_upAndDown_GT -> f113_0_upAndDown_GT : arg1'=1, arg2'=10, (1 > 0 /\ 9-arg2 >= 0 /\ 1-arg1 >= 0 /\ -1+arg1 >= 0 /\ arg2 > 0), cost: 10-arg2

Applied acceleration
Original rule:
f113_0_upAndDown_GT -> f113_0_upAndDown_GT : arg1'=0, arg2'=-1+arg2, (arg1 == 0 /\ 10-arg2 > 0 /\ arg2 > 0), cost: 1
New rule:
f113_0_upAndDown_GT -> f113_0_upAndDown_GT : arg1'=0, arg2'=-n5+arg2, (arg1 >= 0 /\ -arg1 >= 0 /\ 1-n5+arg2 > 0 /\ 10-arg2 > 0 /\ -1+n5 >= 0), cost: n5

Applied instantiation
Original rule:
f113_0_upAndDown_GT -> f113_0_upAndDown_GT : arg1'=0, arg2'=-n5+arg2, (arg1 >= 0 /\ -arg1 >= 0 /\ 1-n5+arg2 > 0 /\ 10-arg2 > 0 /\ -1+n5 >= 0), cost: n5
New rule:
f113_0_upAndDown_GT -> f113_0_upAndDown_GT : arg1'=0, arg2'=0, (arg1 >= 0 /\ 1 > 0 /\ -arg1 >= 0 /\ -1+arg2 >= 0 /\ 10-arg2 > 0), cost: arg2

Applied simplification
Original rule:
f113_0_upAndDown_GT -> f113_0_upAndDown_GT : arg1'=1, arg2'=10, (1 > 0 /\ 9-arg2 >= 0 /\ 1-arg1 >= 0 /\ -1+arg1 >= 0 /\ arg2 > 0), cost: 10-arg2
New rule:
f113_0_upAndDown_GT -> f113_0_upAndDown_GT : arg1'=1, arg2'=10, (-1+arg1 <= 0 /\ -1+arg1 >= 0 /\ -9+arg2 <= 0 /\ arg2 > 0), cost: 10-arg2

Applied simplification
Original rule:
f113_0_upAndDown_GT -> f113_0_upAndDown_GT : arg1'=0, arg2'=0, (arg1 >= 0 /\ 1 > 0 /\ -arg1 >= 0 /\ -1+arg2 >= 0 /\ 10-arg2 > 0), cost: arg2
New rule:
f113_0_upAndDown_GT -> f113_0_upAndDown_GT : arg1'=0, arg2'=0, (arg1 <= 0 /\ arg1 >= 0 /\ -1+arg2 >= 0 /\ 10-arg2 > 0), cost: arg2

Applied deletion
Removed the following rules: 7 8

Accelerated simple loops
Start location: __init
   6: f1_0_main_Load -> f113_0_upAndDown_GT : arg1'=0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1
   9: f113_0_upAndDown_GT -> f113_0_upAndDown_GT : arg1'=0, arg2'=9, -10+arg2 == 0, cost: 1
  10: f113_0_upAndDown_GT -> f113_0_upAndDown_GT : arg1'=1, arg2'=1, arg2 == 0, cost: 1
  13: f113_0_upAndDown_GT -> f113_0_upAndDown_GT : arg1'=1, arg2'=10, (-1+arg1 <= 0 /\ -1+arg1 >= 0 /\ -9+arg2 <= 0 /\ arg2 > 0), cost: 10-arg2
  14: f113_0_upAndDown_GT -> f113_0_upAndDown_GT : arg1'=0, arg2'=0, (arg1 <= 0 /\ arg1 >= 0 /\ -1+arg2 >= 0 /\ 10-arg2 > 0), cost: arg2
   5: __init -> f1_0_main_Load : arg1'=arg1P5, arg2'=arg2P5, TRUE, cost: 1


Applied chaining
First rule:
f1_0_main_Load -> f113_0_upAndDown_GT : arg1'=0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1
Second rule:
f113_0_upAndDown_GT -> f113_0_upAndDown_GT : arg1'=0, arg2'=9, -10+arg2 == 0, cost: 1
New rule:
f1_0_main_Load -> f113_0_upAndDown_GT : arg1'=0, arg2'=9, (arg1 > 0 /\ -10+arg2 == 0), cost: 2

Applied chaining
First rule:
f1_0_main_Load -> f113_0_upAndDown_GT : arg1'=0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1
Second rule:
f113_0_upAndDown_GT -> f113_0_upAndDown_GT : arg1'=1, arg2'=1, arg2 == 0, cost: 1
New rule:
f1_0_main_Load -> f113_0_upAndDown_GT : arg1'=1, arg2'=1, (arg1 > 0 /\ arg2 == 0), cost: 2

Applied chaining
First rule:
f1_0_main_Load -> f113_0_upAndDown_GT : arg1'=0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1
Second rule:
f113_0_upAndDown_GT -> f113_0_upAndDown_GT : arg1'=0, arg2'=0, (arg1 <= 0 /\ arg1 >= 0 /\ -1+arg2 >= 0 /\ 10-arg2 > 0), cost: arg2
New rule:
f1_0_main_Load -> f113_0_upAndDown_GT : arg1'=0, arg2'=0, (arg1 > 0 /\ -1+arg2 >= 0 /\ 10-arg2 > 0), cost: 1+arg2

Applied deletion
Removed the following rules: 9 10 13 14

Chained accelerated rules with incoming rules
Start location: __init
   6: f1_0_main_Load -> f113_0_upAndDown_GT : arg1'=0, (arg1 > 0 /\ 1+arg2 > 0), cost: 1
  15: f1_0_main_Load -> f113_0_upAndDown_GT : arg1'=0, arg2'=9, (arg1 > 0 /\ -10+arg2 == 0), cost: 2
  16: f1_0_main_Load -> f113_0_upAndDown_GT : arg1'=1, arg2'=1, (arg1 > 0 /\ arg2 == 0), cost: 2
  17: f1_0_main_Load -> f113_0_upAndDown_GT : arg1'=0, arg2'=0, (arg1 > 0 /\ -1+arg2 >= 0 /\ 10-arg2 > 0), cost: 1+arg2
   5: __init -> f1_0_main_Load : arg1'=arg1P5, arg2'=arg2P5, TRUE, cost: 1


Removed unreachable locations and irrelevant leafs
Start location: __init
  <empty>


Computing asymptotic complexity

Proved the following lower bound
Complexity:  Unknown
Cpx degree: ?

Solved cost: 0
Rule cost:   0