WORST_CASE(Omega(0),?)

Initial ITS
Start location: __init
   0: f1_0_main_New -> f169_0_exampleMethods_LE : arg1'=arg1P0, arg3'=arg3P0, arg2'=arg2P0, (-13+arg1P0 > 0 /\ -arg2P0 == 0 /\ 10-arg3P0 == 0), cost: 1
   1: f169_0_exampleMethods_LE -> f169_0_exampleMethods_LE : arg1'=arg1P1, arg3'=arg3P1, arg2'=arg2P1, (-arg1+arg1P1 <= 0 /\ -2+arg1P1 > 0 /\ arg3 > 0 /\ 4-arg1+arg3 <= 0 /\ 10+arg2-arg2P1 == 0 /\ -1+arg3-arg3P1 == 0 /\ 1+arg2 > 0 /\ -2+arg1 > 0), cost: 1
   2: __init -> f1_0_main_New : arg1'=arg1P2, arg3'=arg3P2, arg2'=arg2P2, TRUE, cost: 1


Applied preprocessing
Original rule:
f1_0_main_New -> f169_0_exampleMethods_LE : arg1'=arg1P0, arg3'=arg3P0, arg2'=arg2P0, (-13+arg1P0 > 0 /\ -arg2P0 == 0 /\ 10-arg3P0 == 0), cost: 1
New rule:
f1_0_main_New -> f169_0_exampleMethods_LE : arg1'=arg1P0, arg3'=10, arg2'=0, -13+arg1P0 > 0, cost: 1

Applied preprocessing
Original rule:
f169_0_exampleMethods_LE -> f169_0_exampleMethods_LE : arg1'=arg1P1, arg3'=arg3P1, arg2'=arg2P1, (-arg1+arg1P1 <= 0 /\ -2+arg1P1 > 0 /\ arg3 > 0 /\ 4-arg1+arg3 <= 0 /\ 10+arg2-arg2P1 == 0 /\ -1+arg3-arg3P1 == 0 /\ 1+arg2 > 0 /\ -2+arg1 > 0), cost: 1
New rule:
f169_0_exampleMethods_LE -> f169_0_exampleMethods_LE : arg1'=arg1P1, arg3'=-1+arg3, arg2'=10+arg2, (-arg1+arg1P1 <= 0 /\ -2+arg1P1 > 0 /\ arg3 > 0 /\ 4-arg1+arg3 <= 0 /\ 1+arg2 > 0), cost: 1

Simplified rules
Start location: __init
   3: f1_0_main_New -> f169_0_exampleMethods_LE : arg1'=arg1P0, arg3'=10, arg2'=0, -13+arg1P0 > 0, cost: 1
   4: f169_0_exampleMethods_LE -> f169_0_exampleMethods_LE : arg1'=arg1P1, arg3'=-1+arg3, arg2'=10+arg2, (-arg1+arg1P1 <= 0 /\ -2+arg1P1 > 0 /\ arg3 > 0 /\ 4-arg1+arg3 <= 0 /\ 1+arg2 > 0), cost: 1
   2: __init -> f1_0_main_New : arg1'=arg1P2, arg3'=arg3P2, arg2'=arg2P2, TRUE, cost: 1


Accelerated simple loops
Start location: __init
   3: f1_0_main_New -> f169_0_exampleMethods_LE : arg1'=arg1P0, arg3'=10, arg2'=0, -13+arg1P0 > 0, cost: 1
   4: f169_0_exampleMethods_LE -> f169_0_exampleMethods_LE : arg1'=arg1P1, arg3'=-1+arg3, arg2'=10+arg2, (-arg1+arg1P1 <= 0 /\ -2+arg1P1 > 0 /\ arg3 > 0 /\ 4-arg1+arg3 <= 0 /\ 1+arg2 > 0), cost: 1
   2: __init -> f1_0_main_New : arg1'=arg1P2, arg3'=arg3P2, arg2'=arg2P2, TRUE, cost: 1


Applied chaining
First rule:
f1_0_main_New -> f169_0_exampleMethods_LE : arg1'=arg1P0, arg3'=10, arg2'=0, -13+arg1P0 > 0, cost: 1
Second rule:
f169_0_exampleMethods_LE -> f169_0_exampleMethods_LE : arg1'=arg1P1, arg3'=-1+arg3, arg2'=10+arg2, (-arg1+arg1P1 <= 0 /\ -2+arg1P1 > 0 /\ arg3 > 0 /\ 4-arg1+arg3 <= 0 /\ 1+arg2 > 0), cost: 1
New rule:
f1_0_main_New -> f169_0_exampleMethods_LE : arg1'=arg1P1, arg3'=9, arg2'=10, -2+arg1P1 > 0, cost: 2

Applied deletion
Removed the following rules: 4

Chained accelerated rules with incoming rules
Start location: __init
   3: f1_0_main_New -> f169_0_exampleMethods_LE : arg1'=arg1P0, arg3'=10, arg2'=0, -13+arg1P0 > 0, cost: 1
   5: f1_0_main_New -> f169_0_exampleMethods_LE : arg1'=arg1P1, arg3'=9, arg2'=10, -2+arg1P1 > 0, cost: 2
   2: __init -> f1_0_main_New : arg1'=arg1P2, arg3'=arg3P2, arg2'=arg2P2, 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