WORST_CASE(Omega(0),?)

Initial ITS
Start location: __init
   0: f1_0_main_Load -> f200_0_gcd_LE : arg2'=arg2P0, arg1'=arg1P0, (1+arg2P0 > 0 /\ 1+arg2 > 0 /\ arg1 > 0 /\ 1+arg1P0 > 0), cost: 1
   1: f200_0_gcd_LE -> f200_0_gcd_LE\' : arg2'=arg2P1, arg1'=arg1P1, (arg2 > 0 /\ arg1-arg1P1 == 0 /\ arg2-arg2P1 == 0 /\ arg1 > 0), cost: 1
   2: f200_0_gcd_LE\' -> f200_0_gcd_LE : arg2'=arg2P2, arg1'=arg1P2, (arg2-arg1P2 == 0 /\ -arg2P2-arg2*x80+arg1 == 0 /\ arg2 > 0 /\ arg2+arg2*x80-arg1 > 0 /\ arg1 > 0 /\ -arg2*x80+arg1 >= 0), cost: 1
   3: __init -> f1_0_main_Load : arg2'=arg2P3, arg1'=arg1P3, TRUE, cost: 1


Applied preprocessing
Original rule:
f200_0_gcd_LE -> f200_0_gcd_LE\' : arg2'=arg2P1, arg1'=arg1P1, (arg2 > 0 /\ arg1-arg1P1 == 0 /\ arg2-arg2P1 == 0 /\ arg1 > 0), cost: 1
New rule:
f200_0_gcd_LE -> f200_0_gcd_LE\' : (arg2 > 0 /\ arg1 > 0), cost: 1

Applied preprocessing
Original rule:
f200_0_gcd_LE\' -> f200_0_gcd_LE : arg2'=arg2P2, arg1'=arg1P2, (arg2-arg1P2 == 0 /\ -arg2P2-arg2*x80+arg1 == 0 /\ arg2 > 0 /\ arg2+arg2*x80-arg1 > 0 /\ arg1 > 0 /\ -arg2*x80+arg1 >= 0), cost: 1
New rule:
f200_0_gcd_LE\' -> f200_0_gcd_LE : arg2'=-arg2*x80+arg1, arg1'=arg2, (arg2+arg2*x80-arg1 > 0 /\ arg1 > 0 /\ -arg2*x80+arg1 >= 0), cost: 1

Simplified rules
Start location: __init
   0: f1_0_main_Load -> f200_0_gcd_LE : arg2'=arg2P0, arg1'=arg1P0, (1+arg2P0 > 0 /\ 1+arg2 > 0 /\ arg1 > 0 /\ 1+arg1P0 > 0), cost: 1
   4: f200_0_gcd_LE -> f200_0_gcd_LE\' : (arg2 > 0 /\ arg1 > 0), cost: 1
   5: f200_0_gcd_LE\' -> f200_0_gcd_LE : arg2'=-arg2*x80+arg1, arg1'=arg2, (arg2+arg2*x80-arg1 > 0 /\ arg1 > 0 /\ -arg2*x80+arg1 >= 0), cost: 1
   3: __init -> f1_0_main_Load : arg2'=arg2P3, arg1'=arg1P3, TRUE, cost: 1


Eliminating location f1_0_main_Load by chaining:

Applied chaining
First rule:
__init -> f1_0_main_Load : arg2'=arg2P3, arg1'=arg1P3, TRUE, cost: 1
Second rule:
f1_0_main_Load -> f200_0_gcd_LE : arg2'=arg2P0, arg1'=arg1P0, (1+arg2P0 > 0 /\ 1+arg2 > 0 /\ arg1 > 0 /\ 1+arg1P0 > 0), cost: 1
New rule:
__init -> f200_0_gcd_LE : arg2'=arg2P0, arg1'=arg1P0, (1+arg2P0 > 0 /\ arg1P3 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2P3 > 0), cost: 2

Applied deletion
Removed the following rules: 0 3

Eliminating location f200_0_gcd_LE\' by chaining:

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

Applied simplification
Original rule:
f200_0_gcd_LE -> f200_0_gcd_LE : arg2'=-arg2*x80+arg1, arg1'=arg2, (arg2 > 0 /\ arg2+arg2*x80-arg1 > 0 /\ arg1 > 0 /\ -arg2*x80+arg1 >= 0), cost: 2
New rule:
f200_0_gcd_LE -> f200_0_gcd_LE : arg2'=-arg2*x80+arg1, arg1'=arg2, (arg2+arg2*x80-arg1 > 0 /\ arg1 > 0 /\ -arg2*x80+arg1 >= 0), cost: 2

Applied deletion
Removed the following rules: 4 5

Eliminated locations on linear paths
Start location: __init
   7: f200_0_gcd_LE -> f200_0_gcd_LE : arg2'=-arg2*x80+arg1, arg1'=arg2, (arg2+arg2*x80-arg1 > 0 /\ arg1 > 0 /\ -arg2*x80+arg1 >= 0), cost: 2
   6: __init -> f200_0_gcd_LE : arg2'=arg2P0, arg1'=arg1P0, (1+arg2P0 > 0 /\ arg1P3 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2P3 > 0), cost: 2


Accelerated simple loops
Start location: __init
   7: f200_0_gcd_LE -> f200_0_gcd_LE : arg2'=-arg2*x80+arg1, arg1'=arg2, (arg2+arg2*x80-arg1 > 0 /\ arg1 > 0 /\ -arg2*x80+arg1 >= 0), cost: 2
   6: __init -> f200_0_gcd_LE : arg2'=arg2P0, arg1'=arg1P0, (1+arg2P0 > 0 /\ arg1P3 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2P3 > 0), cost: 2


Applied chaining
First rule:
__init -> f200_0_gcd_LE : arg2'=arg2P0, arg1'=arg1P0, (1+arg2P0 > 0 /\ arg1P3 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2P3 > 0), cost: 2
Second rule:
f200_0_gcd_LE -> f200_0_gcd_LE : arg2'=-arg2*x80+arg1, arg1'=arg2, (arg2+arg2*x80-arg1 > 0 /\ arg1 > 0 /\ -arg2*x80+arg1 >= 0), cost: 2
New rule:
__init -> f200_0_gcd_LE : arg2'=arg1P0-arg2P0*x80, arg1'=arg2P0, (arg1P0-arg2P0*x80 >= 0 /\ arg1P0 > 0 /\ arg2P0-arg1P0+arg2P0*x80 > 0), cost: 4

Applied deletion
Removed the following rules: 7

Chained accelerated rules with incoming rules
Start location: __init
   6: __init -> f200_0_gcd_LE : arg2'=arg2P0, arg1'=arg1P0, (1+arg2P0 > 0 /\ arg1P3 > 0 /\ 1+arg1P0 > 0 /\ 1+arg2P3 > 0), cost: 2
   8: __init -> f200_0_gcd_LE : arg2'=arg1P0-arg2P0*x80, arg1'=arg2P0, (arg1P0-arg2P0*x80 >= 0 /\ arg1P0 > 0 /\ arg2P0-arg1P0+arg2P0*x80 > 0), cost: 4


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