WORST_CASE(Omega(0),?)

Initial ITS
Start location: __init
   0: f1_0_main_Load -> f1612_0_main_NULL : arg5'=arg5P0, arg2'=arg2P0, arg4'=arg4P0, arg1'=arg1P0, arg3'=arg3P0, (1+arg2P0 > 0 /\ arg1 > 0 /\ arg1P0 > 0), cost: 1
   3: f1_0_main_Load -> f1301_0_createTree_LE : arg5'=arg5P3, arg2'=arg2P3, arg4'=arg4P3, arg1'=arg1P3, arg3'=arg3P3, (arg2 > 0 /\ 1-arg5P3 == 0 /\ -1+arg1P3 > 0 /\ -1-arg1+arg2P3 <= 0 /\ -1+arg1P3-arg1 <= 0 /\ arg1 > 0 /\ arg3P3 > 0 /\ -1+arg2P3 > 0 /\ arg2-arg4P3 == 0), cost: 1
   2: f1612_0_main_NULL -> f1612_0_main_NULL : arg5'=arg5P2, arg2'=arg2P2, arg4'=arg4P2, arg1'=arg1P2, arg3'=arg3P2, (-2+arg1 > 0 /\ arg2 > 0 /\ -3-arg2P2+arg1 >= 0 /\ 2+arg1-arg1P2 >= 0 /\ 1+arg2P2 > 0 /\ -2+arg1P2 > 0 /\ -1-arg2P2+arg2 >= 0), cost: 1
   1: f408_0_createTree_Return -> f1612_0_main_NULL : arg5'=arg5P1, arg2'=arg2P1, arg4'=arg4P1, arg1'=arg1P1, arg3'=arg3P1, (arg1P1-arg1 <= 0 /\ 2+arg2-arg1 <= 0 /\ 1+arg2P1 > 0 /\ -1+arg1P1 > 0 /\ -1+arg1 > 0 /\ 2-arg1+arg2P1 <= 0), cost: 1
   4: f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg5P4, arg2'=arg2P4, arg4'=arg4P4, arg1'=arg1P4, arg3'=arg3P4, (1+arg5 > 0 /\ arg4-arg4P4 == 0 /\ arg2P4 > 0 /\ -arg1+arg1P4 <= 0 /\ -2+arg2 > 0 /\ 2-arg2+arg2P4 <= 0 /\ 1+arg5-arg5P4 == 0 /\ arg5-arg4 < 0 /\ arg1 > 0 /\ -1-arg3P4+arg3 == 0 /\ arg3 > 0 /\ arg1P4 > 0), cost: 1
   5: f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg5P5, arg2'=arg2P5, arg4'=arg4P5, arg1'=arg1P5, arg3'=arg3P5, (2-arg2+arg2P5 <= 0 /\ arg1P5-arg1 <= 0 /\ 1+arg5 > 0 /\ -2+arg2 > 0 /\ -arg4P5+arg4 == 0 /\ arg1P5 > 0 /\ -1-arg3P5+arg3 == 0 /\ arg5-arg4 < 0 /\ arg2P5 > 0 /\ arg1 > 0 /\ arg3 > 0 /\ x310 > 0 /\ 1+arg5-arg5P5 == 0), cost: 1
   6: f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg5P6, arg2'=arg2P6, arg4'=arg4P6, arg1'=arg1P6, arg3'=arg3P6, (arg4-arg4P6 == 0 /\ 1+arg5 > 0 /\ 1+arg5-arg5P6 == 0 /\ arg2P6 > 0 /\ arg5-arg4 < 0 /\ arg1 > 0 /\ -1+arg2 > 0 /\ x390 > 0 /\ arg3 > 0 /\ -1-arg3P6+arg3 == 0 /\ arg1P6 > 0), cost: 1
   7: f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg5P7, arg2'=arg2P7, arg4'=arg4P7, arg1'=arg1P7, arg3'=arg3P7, (-arg4P7+arg4 == 0 /\ -1-arg3P7+arg3 == 0 /\ 1+arg5 > 0 /\ arg1P7 > 0 /\ 1+arg5-arg5P7 == 0 /\ arg5-arg4 < 0 /\ arg1 > 0 /\ -1+arg2 > 0 /\ arg2P7 > 0 /\ arg3 > 0), cost: 1
   8: f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg5P8, arg2'=arg2P8, arg4'=arg4P8, arg1'=arg1P8, arg3'=arg3P8, (arg4-arg4P8 == 0 /\ -2-arg1+arg1P8 <= 0 /\ 1+arg5 > 0 /\ -1-arg3P8+arg3 == 0 /\ 1+arg5-arg5P8 == 0 /\ arg5-arg4 < 0 /\ -2-arg2+arg1P8 <= 0 /\ -1+arg2 > 0 /\ -3+arg2P8 > 0 /\ -2+arg2P8-arg1 <= 0 /\ arg3 > 0 /\ -2-arg2+arg2P8 <= 0 /\ -1+arg1 > 0 /\ -3+arg1P8 > 0), cost: 1
   9: f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg5P9, arg2'=arg2P9, arg4'=arg4P9, arg1'=arg1P9, arg3'=arg3P9, (-2+arg2P9-arg1 <= 0 /\ 1+arg5 > 0 /\ -2+arg1P9-arg1 <= 0 /\ arg5-arg4 < 0 /\ -arg4P9+arg4 == 0 /\ 1+arg5-arg5P9 == 0 /\ -2-arg2+arg2P9 <= 0 /\ -1-arg3P9+arg3 == 0 /\ -1+arg2 > 0 /\ -2-arg2+arg1P9 <= 0 /\ x610 > 0 /\ arg3 > 0 /\ -3+arg1P9 > 0 /\ -1+arg1 > 0 /\ -3+arg2P9 > 0), cost: 1
  10: __init -> f1_0_main_Load : arg5'=arg5P10, arg2'=arg2P10, arg4'=arg4P10, arg1'=arg1P10, arg3'=arg3P10, TRUE, cost: 1


Removed unreachable rules and leafs
Start location: __init
   0: f1_0_main_Load -> f1612_0_main_NULL : arg5'=arg5P0, arg2'=arg2P0, arg4'=arg4P0, arg1'=arg1P0, arg3'=arg3P0, (1+arg2P0 > 0 /\ arg1 > 0 /\ arg1P0 > 0), cost: 1
   3: f1_0_main_Load -> f1301_0_createTree_LE : arg5'=arg5P3, arg2'=arg2P3, arg4'=arg4P3, arg1'=arg1P3, arg3'=arg3P3, (arg2 > 0 /\ 1-arg5P3 == 0 /\ -1+arg1P3 > 0 /\ -1-arg1+arg2P3 <= 0 /\ -1+arg1P3-arg1 <= 0 /\ arg1 > 0 /\ arg3P3 > 0 /\ -1+arg2P3 > 0 /\ arg2-arg4P3 == 0), cost: 1
   2: f1612_0_main_NULL -> f1612_0_main_NULL : arg5'=arg5P2, arg2'=arg2P2, arg4'=arg4P2, arg1'=arg1P2, arg3'=arg3P2, (-2+arg1 > 0 /\ arg2 > 0 /\ -3-arg2P2+arg1 >= 0 /\ 2+arg1-arg1P2 >= 0 /\ 1+arg2P2 > 0 /\ -2+arg1P2 > 0 /\ -1-arg2P2+arg2 >= 0), cost: 1
   4: f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg5P4, arg2'=arg2P4, arg4'=arg4P4, arg1'=arg1P4, arg3'=arg3P4, (1+arg5 > 0 /\ arg4-arg4P4 == 0 /\ arg2P4 > 0 /\ -arg1+arg1P4 <= 0 /\ -2+arg2 > 0 /\ 2-arg2+arg2P4 <= 0 /\ 1+arg5-arg5P4 == 0 /\ arg5-arg4 < 0 /\ arg1 > 0 /\ -1-arg3P4+arg3 == 0 /\ arg3 > 0 /\ arg1P4 > 0), cost: 1
   5: f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg5P5, arg2'=arg2P5, arg4'=arg4P5, arg1'=arg1P5, arg3'=arg3P5, (2-arg2+arg2P5 <= 0 /\ arg1P5-arg1 <= 0 /\ 1+arg5 > 0 /\ -2+arg2 > 0 /\ -arg4P5+arg4 == 0 /\ arg1P5 > 0 /\ -1-arg3P5+arg3 == 0 /\ arg5-arg4 < 0 /\ arg2P5 > 0 /\ arg1 > 0 /\ arg3 > 0 /\ x310 > 0 /\ 1+arg5-arg5P5 == 0), cost: 1
   6: f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg5P6, arg2'=arg2P6, arg4'=arg4P6, arg1'=arg1P6, arg3'=arg3P6, (arg4-arg4P6 == 0 /\ 1+arg5 > 0 /\ 1+arg5-arg5P6 == 0 /\ arg2P6 > 0 /\ arg5-arg4 < 0 /\ arg1 > 0 /\ -1+arg2 > 0 /\ x390 > 0 /\ arg3 > 0 /\ -1-arg3P6+arg3 == 0 /\ arg1P6 > 0), cost: 1
   7: f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg5P7, arg2'=arg2P7, arg4'=arg4P7, arg1'=arg1P7, arg3'=arg3P7, (-arg4P7+arg4 == 0 /\ -1-arg3P7+arg3 == 0 /\ 1+arg5 > 0 /\ arg1P7 > 0 /\ 1+arg5-arg5P7 == 0 /\ arg5-arg4 < 0 /\ arg1 > 0 /\ -1+arg2 > 0 /\ arg2P7 > 0 /\ arg3 > 0), cost: 1
   8: f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg5P8, arg2'=arg2P8, arg4'=arg4P8, arg1'=arg1P8, arg3'=arg3P8, (arg4-arg4P8 == 0 /\ -2-arg1+arg1P8 <= 0 /\ 1+arg5 > 0 /\ -1-arg3P8+arg3 == 0 /\ 1+arg5-arg5P8 == 0 /\ arg5-arg4 < 0 /\ -2-arg2+arg1P8 <= 0 /\ -1+arg2 > 0 /\ -3+arg2P8 > 0 /\ -2+arg2P8-arg1 <= 0 /\ arg3 > 0 /\ -2-arg2+arg2P8 <= 0 /\ -1+arg1 > 0 /\ -3+arg1P8 > 0), cost: 1
   9: f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg5P9, arg2'=arg2P9, arg4'=arg4P9, arg1'=arg1P9, arg3'=arg3P9, (-2+arg2P9-arg1 <= 0 /\ 1+arg5 > 0 /\ -2+arg1P9-arg1 <= 0 /\ arg5-arg4 < 0 /\ -arg4P9+arg4 == 0 /\ 1+arg5-arg5P9 == 0 /\ -2-arg2+arg2P9 <= 0 /\ -1-arg3P9+arg3 == 0 /\ -1+arg2 > 0 /\ -2-arg2+arg1P9 <= 0 /\ x610 > 0 /\ arg3 > 0 /\ -3+arg1P9 > 0 /\ -1+arg1 > 0 /\ -3+arg2P9 > 0), cost: 1
  10: __init -> f1_0_main_Load : arg5'=arg5P10, arg2'=arg2P10, arg4'=arg4P10, arg1'=arg1P10, arg3'=arg3P10, TRUE, cost: 1


Applied preprocessing
Original rule:
f1612_0_main_NULL -> f1612_0_main_NULL : arg5'=arg5P2, arg2'=arg2P2, arg4'=arg4P2, arg1'=arg1P2, arg3'=arg3P2, (-2+arg1 > 0 /\ arg2 > 0 /\ -3-arg2P2+arg1 >= 0 /\ 2+arg1-arg1P2 >= 0 /\ 1+arg2P2 > 0 /\ -2+arg1P2 > 0 /\ -1-arg2P2+arg2 >= 0), cost: 1
New rule:
f1612_0_main_NULL -> f1612_0_main_NULL : arg5'=arg5P2, arg2'=arg2P2, arg4'=arg4P2, arg1'=arg1P2, arg3'=arg3P2, (-3-arg2P2+arg1 >= 0 /\ 2+arg1-arg1P2 >= 0 /\ 1+arg2P2 > 0 /\ -2+arg1P2 > 0 /\ -1-arg2P2+arg2 >= 0), cost: 1

Applied preprocessing
Original rule:
f1_0_main_Load -> f1301_0_createTree_LE : arg5'=arg5P3, arg2'=arg2P3, arg4'=arg4P3, arg1'=arg1P3, arg3'=arg3P3, (arg2 > 0 /\ 1-arg5P3 == 0 /\ -1+arg1P3 > 0 /\ -1-arg1+arg2P3 <= 0 /\ -1+arg1P3-arg1 <= 0 /\ arg1 > 0 /\ arg3P3 > 0 /\ -1+arg2P3 > 0 /\ arg2-arg4P3 == 0), cost: 1
New rule:
f1_0_main_Load -> f1301_0_createTree_LE : arg5'=1, arg2'=arg2P3, arg4'=arg2, arg1'=arg1P3, arg3'=arg3P3, (arg2 > 0 /\ -1+arg1P3 > 0 /\ -1-arg1+arg2P3 <= 0 /\ -1+arg1P3-arg1 <= 0 /\ arg3P3 > 0 /\ -1+arg2P3 > 0), cost: 1

Applied preprocessing
Original rule:
f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg5P4, arg2'=arg2P4, arg4'=arg4P4, arg1'=arg1P4, arg3'=arg3P4, (1+arg5 > 0 /\ arg4-arg4P4 == 0 /\ arg2P4 > 0 /\ -arg1+arg1P4 <= 0 /\ -2+arg2 > 0 /\ 2-arg2+arg2P4 <= 0 /\ 1+arg5-arg5P4 == 0 /\ arg5-arg4 < 0 /\ arg1 > 0 /\ -1-arg3P4+arg3 == 0 /\ arg3 > 0 /\ arg1P4 > 0), cost: 1
New rule:
f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=1+arg5, arg2'=arg2P4, arg1'=arg1P4, arg3'=-1+arg3, (1+arg5 > 0 /\ -arg5+arg4 > 0 /\ arg2P4 > 0 /\ -arg1+arg1P4 <= 0 /\ 2-arg2+arg2P4 <= 0 /\ arg3 > 0 /\ arg1P4 > 0), cost: 1

Applied preprocessing
Original rule:
f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg5P5, arg2'=arg2P5, arg4'=arg4P5, arg1'=arg1P5, arg3'=arg3P5, (2-arg2+arg2P5 <= 0 /\ arg1P5-arg1 <= 0 /\ 1+arg5 > 0 /\ -2+arg2 > 0 /\ -arg4P5+arg4 == 0 /\ arg1P5 > 0 /\ -1-arg3P5+arg3 == 0 /\ arg5-arg4 < 0 /\ arg2P5 > 0 /\ arg1 > 0 /\ arg3 > 0 /\ x310 > 0 /\ 1+arg5-arg5P5 == 0), cost: 1
New rule:
f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=1+arg5, arg2'=arg2P5, arg1'=arg1P5, arg3'=-1+arg3, (2-arg2+arg2P5 <= 0 /\ arg1P5-arg1 <= 0 /\ 1+arg5 > 0 /\ -arg5+arg4 > 0 /\ arg1P5 > 0 /\ arg2P5 > 0 /\ arg3 > 0), cost: 1

Applied preprocessing
Original rule:
f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg5P6, arg2'=arg2P6, arg4'=arg4P6, arg1'=arg1P6, arg3'=arg3P6, (arg4-arg4P6 == 0 /\ 1+arg5 > 0 /\ 1+arg5-arg5P6 == 0 /\ arg2P6 > 0 /\ arg5-arg4 < 0 /\ arg1 > 0 /\ -1+arg2 > 0 /\ x390 > 0 /\ arg3 > 0 /\ -1-arg3P6+arg3 == 0 /\ arg1P6 > 0), cost: 1
New rule:
f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=1+arg5, arg2'=arg2P6, arg1'=arg1P6, arg3'=-1+arg3, (1+arg5 > 0 /\ -arg5+arg4 > 0 /\ arg2P6 > 0 /\ arg1 > 0 /\ -1+arg2 > 0 /\ arg3 > 0 /\ arg1P6 > 0), cost: 1

Applied preprocessing
Original rule:
f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg5P7, arg2'=arg2P7, arg4'=arg4P7, arg1'=arg1P7, arg3'=arg3P7, (-arg4P7+arg4 == 0 /\ -1-arg3P7+arg3 == 0 /\ 1+arg5 > 0 /\ arg1P7 > 0 /\ 1+arg5-arg5P7 == 0 /\ arg5-arg4 < 0 /\ arg1 > 0 /\ -1+arg2 > 0 /\ arg2P7 > 0 /\ arg3 > 0), cost: 1
New rule:
f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=1+arg5, arg2'=arg2P7, arg1'=arg1P7, arg3'=-1+arg3, (1+arg5 > 0 /\ -arg5+arg4 > 0 /\ arg1P7 > 0 /\ arg1 > 0 /\ -1+arg2 > 0 /\ arg2P7 > 0 /\ arg3 > 0), cost: 1

Applied preprocessing
Original rule:
f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg5P8, arg2'=arg2P8, arg4'=arg4P8, arg1'=arg1P8, arg3'=arg3P8, (arg4-arg4P8 == 0 /\ -2-arg1+arg1P8 <= 0 /\ 1+arg5 > 0 /\ -1-arg3P8+arg3 == 0 /\ 1+arg5-arg5P8 == 0 /\ arg5-arg4 < 0 /\ -2-arg2+arg1P8 <= 0 /\ -1+arg2 > 0 /\ -3+arg2P8 > 0 /\ -2+arg2P8-arg1 <= 0 /\ arg3 > 0 /\ -2-arg2+arg2P8 <= 0 /\ -1+arg1 > 0 /\ -3+arg1P8 > 0), cost: 1
New rule:
f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=1+arg5, arg2'=arg2P8, arg1'=arg1P8, arg3'=-1+arg3, (-2-arg1+arg1P8 <= 0 /\ 1+arg5 > 0 /\ -arg5+arg4 > 0 /\ -2-arg2+arg1P8 <= 0 /\ -3+arg2P8 > 0 /\ -2+arg2P8-arg1 <= 0 /\ arg3 > 0 /\ -2-arg2+arg2P8 <= 0 /\ -3+arg1P8 > 0), cost: 1

Applied preprocessing
Original rule:
f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg5P9, arg2'=arg2P9, arg4'=arg4P9, arg1'=arg1P9, arg3'=arg3P9, (-2+arg2P9-arg1 <= 0 /\ 1+arg5 > 0 /\ -2+arg1P9-arg1 <= 0 /\ arg5-arg4 < 0 /\ -arg4P9+arg4 == 0 /\ 1+arg5-arg5P9 == 0 /\ -2-arg2+arg2P9 <= 0 /\ -1-arg3P9+arg3 == 0 /\ -1+arg2 > 0 /\ -2-arg2+arg1P9 <= 0 /\ x610 > 0 /\ arg3 > 0 /\ -3+arg1P9 > 0 /\ -1+arg1 > 0 /\ -3+arg2P9 > 0), cost: 1
New rule:
f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=1+arg5, arg2'=arg2P9, arg1'=arg1P9, arg3'=-1+arg3, (-2+arg2P9-arg1 <= 0 /\ 1+arg5 > 0 /\ -arg5+arg4 > 0 /\ -2+arg1P9-arg1 <= 0 /\ -2-arg2+arg2P9 <= 0 /\ -2-arg2+arg1P9 <= 0 /\ arg3 > 0 /\ -3+arg1P9 > 0 /\ -3+arg2P9 > 0), cost: 1

Simplified rules
Start location: __init
   0: f1_0_main_Load -> f1612_0_main_NULL : arg5'=arg5P0, arg2'=arg2P0, arg4'=arg4P0, arg1'=arg1P0, arg3'=arg3P0, (1+arg2P0 > 0 /\ arg1 > 0 /\ arg1P0 > 0), cost: 1
  12: f1_0_main_Load -> f1301_0_createTree_LE : arg5'=1, arg2'=arg2P3, arg4'=arg2, arg1'=arg1P3, arg3'=arg3P3, (arg2 > 0 /\ -1+arg1P3 > 0 /\ -1-arg1+arg2P3 <= 0 /\ -1+arg1P3-arg1 <= 0 /\ arg3P3 > 0 /\ -1+arg2P3 > 0), cost: 1
  11: f1612_0_main_NULL -> f1612_0_main_NULL : arg5'=arg5P2, arg2'=arg2P2, arg4'=arg4P2, arg1'=arg1P2, arg3'=arg3P2, (-3-arg2P2+arg1 >= 0 /\ 2+arg1-arg1P2 >= 0 /\ 1+arg2P2 > 0 /\ -2+arg1P2 > 0 /\ -1-arg2P2+arg2 >= 0), cost: 1
  13: f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=1+arg5, arg2'=arg2P4, arg1'=arg1P4, arg3'=-1+arg3, (1+arg5 > 0 /\ -arg5+arg4 > 0 /\ arg2P4 > 0 /\ -arg1+arg1P4 <= 0 /\ 2-arg2+arg2P4 <= 0 /\ arg3 > 0 /\ arg1P4 > 0), cost: 1
  14: f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=1+arg5, arg2'=arg2P5, arg1'=arg1P5, arg3'=-1+arg3, (2-arg2+arg2P5 <= 0 /\ arg1P5-arg1 <= 0 /\ 1+arg5 > 0 /\ -arg5+arg4 > 0 /\ arg1P5 > 0 /\ arg2P5 > 0 /\ arg3 > 0), cost: 1
  15: f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=1+arg5, arg2'=arg2P6, arg1'=arg1P6, arg3'=-1+arg3, (1+arg5 > 0 /\ -arg5+arg4 > 0 /\ arg2P6 > 0 /\ arg1 > 0 /\ -1+arg2 > 0 /\ arg3 > 0 /\ arg1P6 > 0), cost: 1
  16: f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=1+arg5, arg2'=arg2P7, arg1'=arg1P7, arg3'=-1+arg3, (1+arg5 > 0 /\ -arg5+arg4 > 0 /\ arg1P7 > 0 /\ arg1 > 0 /\ -1+arg2 > 0 /\ arg2P7 > 0 /\ arg3 > 0), cost: 1
  17: f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=1+arg5, arg2'=arg2P8, arg1'=arg1P8, arg3'=-1+arg3, (-2-arg1+arg1P8 <= 0 /\ 1+arg5 > 0 /\ -arg5+arg4 > 0 /\ -2-arg2+arg1P8 <= 0 /\ -3+arg2P8 > 0 /\ -2+arg2P8-arg1 <= 0 /\ arg3 > 0 /\ -2-arg2+arg2P8 <= 0 /\ -3+arg1P8 > 0), cost: 1
  18: f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=1+arg5, arg2'=arg2P9, arg1'=arg1P9, arg3'=-1+arg3, (-2+arg2P9-arg1 <= 0 /\ 1+arg5 > 0 /\ -arg5+arg4 > 0 /\ -2+arg1P9-arg1 <= 0 /\ -2-arg2+arg2P9 <= 0 /\ -2-arg2+arg1P9 <= 0 /\ arg3 > 0 /\ -3+arg1P9 > 0 /\ -3+arg2P9 > 0), cost: 1
  10: __init -> f1_0_main_Load : arg5'=arg5P10, arg2'=arg2P10, arg4'=arg4P10, arg1'=arg1P10, arg3'=arg3P10, TRUE, cost: 1


Applied acceleration
Original rule:
f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=1+arg5, arg2'=arg2P6, arg1'=arg1P6, arg3'=-1+arg3, (1+arg5 > 0 /\ -arg5+arg4 > 0 /\ arg2P6 > 0 /\ arg1 > 0 /\ -1+arg2 > 0 /\ arg3 > 0 /\ arg1P6 > 0), cost: 1
New rule:
f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg5+n2, arg2'=arg2P6, arg1'=arg1P6, arg3'=-n2+arg3, (1+arg5 > 0 /\ 1-arg5+arg4-n2 > 0 /\ 1-n2+arg3 > 0 /\ arg2P6 > 0 /\ -1+arg2P6 > 0 /\ -1+n2 >= 0 /\ arg1 > 0 /\ -1+arg2 > 0 /\ arg1P6 > 0), cost: n2
Sub-proof via acceration calculus written to file:///tmp/tmpnam_BMbHco.txt

Applied instantiation
Original rule:
f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg5+n2, arg2'=arg2P6, arg1'=arg1P6, arg3'=-n2+arg3, (1+arg5 > 0 /\ 1-arg5+arg4-n2 > 0 /\ 1-n2+arg3 > 0 /\ arg2P6 > 0 /\ -1+arg2P6 > 0 /\ -1+n2 >= 0 /\ arg1 > 0 /\ -1+arg2 > 0 /\ arg1P6 > 0), cost: n2
New rule:
f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg4, arg2'=arg2P6, arg1'=arg1P6, arg3'=arg5-arg4+arg3, (1 > 0 /\ 1+arg5 > 0 /\ arg2P6 > 0 /\ -1+arg2P6 > 0 /\ 1+arg5-arg4+arg3 > 0 /\ arg1 > 0 /\ -1+arg2 > 0 /\ -1-arg5+arg4 >= 0 /\ arg1P6 > 0), cost: -arg5+arg4

Applied instantiation
Original rule:
f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg5+n2, arg2'=arg2P6, arg1'=arg1P6, arg3'=-n2+arg3, (1+arg5 > 0 /\ 1-arg5+arg4-n2 > 0 /\ 1-n2+arg3 > 0 /\ arg2P6 > 0 /\ -1+arg2P6 > 0 /\ -1+n2 >= 0 /\ arg1 > 0 /\ -1+arg2 > 0 /\ arg1P6 > 0), cost: n2
New rule:
f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg5+arg3, arg2'=arg2P6, arg1'=arg1P6, arg3'=0, (1 > 0 /\ 1+arg5 > 0 /\ 1-arg5+arg4-arg3 > 0 /\ arg2P6 > 0 /\ -1+arg3 >= 0 /\ -1+arg2P6 > 0 /\ arg1 > 0 /\ -1+arg2 > 0 /\ arg1P6 > 0), cost: arg3

Applied acceleration
Original rule:
f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=1+arg5, arg2'=arg2P7, arg1'=arg1P7, arg3'=-1+arg3, (1+arg5 > 0 /\ -arg5+arg4 > 0 /\ arg1P7 > 0 /\ arg1 > 0 /\ -1+arg2 > 0 /\ arg2P7 > 0 /\ arg3 > 0), cost: 1
New rule:
f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg5+n3, arg2'=arg2P7, arg1'=arg1P7, arg3'=-n3+arg3, (-1+n3 >= 0 /\ 1+arg5 > 0 /\ arg1P7 > 0 /\ 1-arg5+arg4-n3 > 0 /\ arg1 > 0 /\ -1+arg2P7 > 0 /\ -1+arg2 > 0 /\ 1-n3+arg3 > 0 /\ arg2P7 > 0), cost: n3
Sub-proof via acceration calculus written to file:///tmp/tmpnam_aknoCa.txt

Applied instantiation
Original rule:
f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg5+n3, arg2'=arg2P7, arg1'=arg1P7, arg3'=-n3+arg3, (-1+n3 >= 0 /\ 1+arg5 > 0 /\ arg1P7 > 0 /\ 1-arg5+arg4-n3 > 0 /\ arg1 > 0 /\ -1+arg2P7 > 0 /\ -1+arg2 > 0 /\ 1-n3+arg3 > 0 /\ arg2P7 > 0), cost: n3
New rule:
f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg4, arg2'=arg2P7, arg1'=arg1P7, arg3'=arg5-arg4+arg3, (1 > 0 /\ 1+arg5 > 0 /\ arg1P7 > 0 /\ 1+arg5-arg4+arg3 > 0 /\ arg1 > 0 /\ -1+arg2P7 > 0 /\ -1+arg2 > 0 /\ arg2P7 > 0 /\ -1-arg5+arg4 >= 0), cost: -arg5+arg4

Applied instantiation
Original rule:
f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg5+n3, arg2'=arg2P7, arg1'=arg1P7, arg3'=-n3+arg3, (-1+n3 >= 0 /\ 1+arg5 > 0 /\ arg1P7 > 0 /\ 1-arg5+arg4-n3 > 0 /\ arg1 > 0 /\ -1+arg2P7 > 0 /\ -1+arg2 > 0 /\ 1-n3+arg3 > 0 /\ arg2P7 > 0), cost: n3
New rule:
f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg5+arg3, arg2'=arg2P7, arg1'=arg1P7, arg3'=0, (1 > 0 /\ 1+arg5 > 0 /\ 1-arg5+arg4-arg3 > 0 /\ arg1P7 > 0 /\ -1+arg3 >= 0 /\ arg1 > 0 /\ -1+arg2P7 > 0 /\ -1+arg2 > 0 /\ arg2P7 > 0), cost: arg3

Applied acceleration
Original rule:
f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=1+arg5, arg2'=arg2P8, arg1'=arg1P8, arg3'=-1+arg3, (-2-arg1+arg1P8 <= 0 /\ 1+arg5 > 0 /\ -arg5+arg4 > 0 /\ -2-arg2+arg1P8 <= 0 /\ -3+arg2P8 > 0 /\ -2+arg2P8-arg1 <= 0 /\ arg3 > 0 /\ -2-arg2+arg2P8 <= 0 /\ -3+arg1P8 > 0), cost: 1
New rule:
f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg5+n4, arg2'=arg2P8, arg1'=arg1P8, arg3'=-n4+arg3, (2+arg1-arg1P8 >= 0 /\ 1+arg5 > 0 /\ 2+arg2P8-arg1P8 >= 0 /\ 1-n4+arg3 > 0 /\ 2-arg2P8+arg1P8 >= 0 /\ 2+arg2-arg1P8 >= 0 /\ -3+arg2P8 > 0 /\ 2-arg2P8+arg1 >= 0 /\ 1-arg5+arg4-n4 > 0 /\ 2+arg2-arg2P8 >= 0 /\ -3+arg1P8 > 0 /\ -1+n4 >= 0), cost: n4
Sub-proof via acceration calculus written to file:///tmp/tmpnam_aFEgLD.txt

Applied instantiation
Original rule:
f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg5+n4, arg2'=arg2P8, arg1'=arg1P8, arg3'=-n4+arg3, (2+arg1-arg1P8 >= 0 /\ 1+arg5 > 0 /\ 2+arg2P8-arg1P8 >= 0 /\ 1-n4+arg3 > 0 /\ 2-arg2P8+arg1P8 >= 0 /\ 2+arg2-arg1P8 >= 0 /\ -3+arg2P8 > 0 /\ 2-arg2P8+arg1 >= 0 /\ 1-arg5+arg4-n4 > 0 /\ 2+arg2-arg2P8 >= 0 /\ -3+arg1P8 > 0 /\ -1+n4 >= 0), cost: n4
New rule:
f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg4, arg2'=arg2P8, arg1'=arg1P8, arg3'=arg5-arg4+arg3, (1 > 0 /\ 2+arg1-arg1P8 >= 0 /\ 1+arg5 > 0 /\ 2+arg2P8-arg1P8 >= 0 /\ 2-arg2P8+arg1P8 >= 0 /\ 1+arg5-arg4+arg3 > 0 /\ 2+arg2-arg1P8 >= 0 /\ -3+arg2P8 > 0 /\ 2-arg2P8+arg1 >= 0 /\ 2+arg2-arg2P8 >= 0 /\ -1-arg5+arg4 >= 0 /\ -3+arg1P8 > 0), cost: -arg5+arg4

Applied instantiation
Original rule:
f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg5+n4, arg2'=arg2P8, arg1'=arg1P8, arg3'=-n4+arg3, (2+arg1-arg1P8 >= 0 /\ 1+arg5 > 0 /\ 2+arg2P8-arg1P8 >= 0 /\ 1-n4+arg3 > 0 /\ 2-arg2P8+arg1P8 >= 0 /\ 2+arg2-arg1P8 >= 0 /\ -3+arg2P8 > 0 /\ 2-arg2P8+arg1 >= 0 /\ 1-arg5+arg4-n4 > 0 /\ 2+arg2-arg2P8 >= 0 /\ -3+arg1P8 > 0 /\ -1+n4 >= 0), cost: n4
New rule:
f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg5+arg3, arg2'=arg2P8, arg1'=arg1P8, arg3'=0, (1 > 0 /\ 2+arg1-arg1P8 >= 0 /\ 1+arg5 > 0 /\ 2+arg2P8-arg1P8 >= 0 /\ 1-arg5+arg4-arg3 > 0 /\ -1+arg3 >= 0 /\ 2-arg2P8+arg1P8 >= 0 /\ 2+arg2-arg1P8 >= 0 /\ -3+arg2P8 > 0 /\ 2-arg2P8+arg1 >= 0 /\ 2+arg2-arg2P8 >= 0 /\ -3+arg1P8 > 0), cost: arg3

Applied acceleration
Original rule:
f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=1+arg5, arg2'=arg2P9, arg1'=arg1P9, arg3'=-1+arg3, (-2+arg2P9-arg1 <= 0 /\ 1+arg5 > 0 /\ -arg5+arg4 > 0 /\ -2+arg1P9-arg1 <= 0 /\ -2-arg2+arg2P9 <= 0 /\ -2-arg2+arg1P9 <= 0 /\ arg3 > 0 /\ -3+arg1P9 > 0 /\ -3+arg2P9 > 0), cost: 1
New rule:
f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg5+n5, arg2'=arg2P9, arg1'=arg1P9, arg3'=-n5+arg3, (2-arg2P9+arg1 >= 0 /\ 1+arg5 > 0 /\ 1-n5+arg3 > 0 /\ -1+n5 >= 0 /\ 2-arg1P9+arg1 >= 0 /\ 2+arg2-arg2P9 >= 0 /\ 2+arg2-arg1P9 >= 0 /\ 2+arg2P9-arg1P9 >= 0 /\ -3+arg1P9 > 0 /\ 1-arg5-n5+arg4 > 0 /\ 2-arg2P9+arg1P9 >= 0 /\ -3+arg2P9 > 0), cost: n5
Sub-proof via acceration calculus written to file:///tmp/tmpnam_npFfJA.txt

Applied instantiation
Original rule:
f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg5+n5, arg2'=arg2P9, arg1'=arg1P9, arg3'=-n5+arg3, (2-arg2P9+arg1 >= 0 /\ 1+arg5 > 0 /\ 1-n5+arg3 > 0 /\ -1+n5 >= 0 /\ 2-arg1P9+arg1 >= 0 /\ 2+arg2-arg2P9 >= 0 /\ 2+arg2-arg1P9 >= 0 /\ 2+arg2P9-arg1P9 >= 0 /\ -3+arg1P9 > 0 /\ 1-arg5-n5+arg4 > 0 /\ 2-arg2P9+arg1P9 >= 0 /\ -3+arg2P9 > 0), cost: n5
New rule:
f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg4, arg2'=arg2P9, arg1'=arg1P9, arg3'=arg5-arg4+arg3, (2-arg2P9+arg1 >= 0 /\ 1 > 0 /\ 1+arg5 > 0 /\ 2-arg1P9+arg1 >= 0 /\ 1+arg5-arg4+arg3 > 0 /\ 2+arg2-arg2P9 >= 0 /\ 2+arg2-arg1P9 >= 0 /\ 2+arg2P9-arg1P9 >= 0 /\ -3+arg1P9 > 0 /\ -1-arg5+arg4 >= 0 /\ 2-arg2P9+arg1P9 >= 0 /\ -3+arg2P9 > 0), cost: -arg5+arg4

Applied instantiation
Original rule:
f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg5+n5, arg2'=arg2P9, arg1'=arg1P9, arg3'=-n5+arg3, (2-arg2P9+arg1 >= 0 /\ 1+arg5 > 0 /\ 1-n5+arg3 > 0 /\ -1+n5 >= 0 /\ 2-arg1P9+arg1 >= 0 /\ 2+arg2-arg2P9 >= 0 /\ 2+arg2-arg1P9 >= 0 /\ 2+arg2P9-arg1P9 >= 0 /\ -3+arg1P9 > 0 /\ 1-arg5-n5+arg4 > 0 /\ 2-arg2P9+arg1P9 >= 0 /\ -3+arg2P9 > 0), cost: n5
New rule:
f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg5+arg3, arg2'=arg2P9, arg1'=arg1P9, arg3'=0, (2-arg2P9+arg1 >= 0 /\ 1 > 0 /\ 1+arg5 > 0 /\ 1-arg5+arg4-arg3 > 0 /\ 2-arg1P9+arg1 >= 0 /\ -1+arg3 >= 0 /\ 2+arg2-arg2P9 >= 0 /\ 2+arg2-arg1P9 >= 0 /\ 2+arg2P9-arg1P9 >= 0 /\ -3+arg1P9 > 0 /\ 2-arg2P9+arg1P9 >= 0 /\ -3+arg2P9 > 0), cost: arg3

Applied simplification
Original rule:
f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg4, arg2'=arg2P6, arg1'=arg1P6, arg3'=arg5-arg4+arg3, (1 > 0 /\ 1+arg5 > 0 /\ arg2P6 > 0 /\ -1+arg2P6 > 0 /\ 1+arg5-arg4+arg3 > 0 /\ arg1 > 0 /\ -1+arg2 > 0 /\ -1-arg5+arg4 >= 0 /\ arg1P6 > 0), cost: -arg5+arg4
New rule:
f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg4, arg2'=arg2P6, arg1'=arg1P6, arg3'=arg5-arg4+arg3, (1+arg5 > 0 /\ -1+arg2P6 > 0 /\ 1+arg5-arg4+arg3 > 0 /\ arg1 > 0 /\ -1+arg2 > 0 /\ -1-arg5+arg4 >= 0 /\ arg1P6 > 0), cost: -arg5+arg4

Applied simplification
Original rule:
f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg5+arg3, arg2'=arg2P6, arg1'=arg1P6, arg3'=0, (1 > 0 /\ 1+arg5 > 0 /\ 1-arg5+arg4-arg3 > 0 /\ arg2P6 > 0 /\ -1+arg3 >= 0 /\ -1+arg2P6 > 0 /\ arg1 > 0 /\ -1+arg2 > 0 /\ arg1P6 > 0), cost: arg3
New rule:
f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg5+arg3, arg2'=arg2P6, arg1'=arg1P6, arg3'=0, (1+arg5 > 0 /\ 1-arg5+arg4-arg3 > 0 /\ -1+arg3 >= 0 /\ -1+arg2P6 > 0 /\ arg1 > 0 /\ -1+arg2 > 0 /\ arg1P6 > 0), cost: arg3

Applied simplification
Original rule:
f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg4, arg2'=arg2P7, arg1'=arg1P7, arg3'=arg5-arg4+arg3, (1 > 0 /\ 1+arg5 > 0 /\ arg1P7 > 0 /\ 1+arg5-arg4+arg3 > 0 /\ arg1 > 0 /\ -1+arg2P7 > 0 /\ -1+arg2 > 0 /\ arg2P7 > 0 /\ -1-arg5+arg4 >= 0), cost: -arg5+arg4
New rule:
f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg4, arg2'=arg2P7, arg1'=arg1P7, arg3'=arg5-arg4+arg3, (1+arg5 > 0 /\ arg1P7 > 0 /\ 1+arg5-arg4+arg3 > 0 /\ arg1 > 0 /\ -1+arg2P7 > 0 /\ -1+arg2 > 0 /\ -1-arg5+arg4 >= 0), cost: -arg5+arg4

Applied simplification
Original rule:
f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg5+arg3, arg2'=arg2P7, arg1'=arg1P7, arg3'=0, (1 > 0 /\ 1+arg5 > 0 /\ 1-arg5+arg4-arg3 > 0 /\ arg1P7 > 0 /\ -1+arg3 >= 0 /\ arg1 > 0 /\ -1+arg2P7 > 0 /\ -1+arg2 > 0 /\ arg2P7 > 0), cost: arg3
New rule:
f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg5+arg3, arg2'=arg2P7, arg1'=arg1P7, arg3'=0, (1+arg5 > 0 /\ 1-arg5+arg4-arg3 > 0 /\ arg1P7 > 0 /\ -1+arg3 >= 0 /\ arg1 > 0 /\ -1+arg2P7 > 0 /\ -1+arg2 > 0), cost: arg3

Applied simplification
Original rule:
f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg4, arg2'=arg2P8, arg1'=arg1P8, arg3'=arg5-arg4+arg3, (1 > 0 /\ 2+arg1-arg1P8 >= 0 /\ 1+arg5 > 0 /\ 2+arg2P8-arg1P8 >= 0 /\ 2-arg2P8+arg1P8 >= 0 /\ 1+arg5-arg4+arg3 > 0 /\ 2+arg2-arg1P8 >= 0 /\ -3+arg2P8 > 0 /\ 2-arg2P8+arg1 >= 0 /\ 2+arg2-arg2P8 >= 0 /\ -1-arg5+arg4 >= 0 /\ -3+arg1P8 > 0), cost: -arg5+arg4
New rule:
f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg4, arg2'=arg2P8, arg1'=arg1P8, arg3'=arg5-arg4+arg3, (2+arg1-arg1P8 >= 0 /\ 1+arg5 > 0 /\ 2+arg2P8-arg1P8 >= 0 /\ 2-arg2P8+arg1P8 >= 0 /\ 1+arg5-arg4+arg3 > 0 /\ 2+arg2-arg1P8 >= 0 /\ -3+arg2P8 > 0 /\ 2-arg2P8+arg1 >= 0 /\ 2+arg2-arg2P8 >= 0 /\ -1-arg5+arg4 >= 0 /\ -3+arg1P8 > 0), cost: -arg5+arg4

Applied simplification
Original rule:
f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg5+arg3, arg2'=arg2P8, arg1'=arg1P8, arg3'=0, (1 > 0 /\ 2+arg1-arg1P8 >= 0 /\ 1+arg5 > 0 /\ 2+arg2P8-arg1P8 >= 0 /\ 1-arg5+arg4-arg3 > 0 /\ -1+arg3 >= 0 /\ 2-arg2P8+arg1P8 >= 0 /\ 2+arg2-arg1P8 >= 0 /\ -3+arg2P8 > 0 /\ 2-arg2P8+arg1 >= 0 /\ 2+arg2-arg2P8 >= 0 /\ -3+arg1P8 > 0), cost: arg3
New rule:
f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg5+arg3, arg2'=arg2P8, arg1'=arg1P8, arg3'=0, (2+arg1-arg1P8 >= 0 /\ 1+arg5 > 0 /\ 2+arg2P8-arg1P8 >= 0 /\ 1-arg5+arg4-arg3 > 0 /\ -1+arg3 >= 0 /\ 2-arg2P8+arg1P8 >= 0 /\ 2+arg2-arg1P8 >= 0 /\ -3+arg2P8 > 0 /\ 2-arg2P8+arg1 >= 0 /\ 2+arg2-arg2P8 >= 0 /\ -3+arg1P8 > 0), cost: arg3

Applied simplification
Original rule:
f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg4, arg2'=arg2P9, arg1'=arg1P9, arg3'=arg5-arg4+arg3, (2-arg2P9+arg1 >= 0 /\ 1 > 0 /\ 1+arg5 > 0 /\ 2-arg1P9+arg1 >= 0 /\ 1+arg5-arg4+arg3 > 0 /\ 2+arg2-arg2P9 >= 0 /\ 2+arg2-arg1P9 >= 0 /\ 2+arg2P9-arg1P9 >= 0 /\ -3+arg1P9 > 0 /\ -1-arg5+arg4 >= 0 /\ 2-arg2P9+arg1P9 >= 0 /\ -3+arg2P9 > 0), cost: -arg5+arg4
New rule:
f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg4, arg2'=arg2P9, arg1'=arg1P9, arg3'=arg5-arg4+arg3, (2-arg2P9+arg1 >= 0 /\ 1+arg5 > 0 /\ 2-arg1P9+arg1 >= 0 /\ 1+arg5-arg4+arg3 > 0 /\ 2+arg2-arg2P9 >= 0 /\ 2+arg2-arg1P9 >= 0 /\ 2+arg2P9-arg1P9 >= 0 /\ -3+arg1P9 > 0 /\ -1-arg5+arg4 >= 0 /\ 2-arg2P9+arg1P9 >= 0 /\ -3+arg2P9 > 0), cost: -arg5+arg4

Applied simplification
Original rule:
f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg5+arg3, arg2'=arg2P9, arg1'=arg1P9, arg3'=0, (2-arg2P9+arg1 >= 0 /\ 1 > 0 /\ 1+arg5 > 0 /\ 1-arg5+arg4-arg3 > 0 /\ 2-arg1P9+arg1 >= 0 /\ -1+arg3 >= 0 /\ 2+arg2-arg2P9 >= 0 /\ 2+arg2-arg1P9 >= 0 /\ 2+arg2P9-arg1P9 >= 0 /\ -3+arg1P9 > 0 /\ 2-arg2P9+arg1P9 >= 0 /\ -3+arg2P9 > 0), cost: arg3
New rule:
f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg5+arg3, arg2'=arg2P9, arg1'=arg1P9, arg3'=0, (2-arg2P9+arg1 >= 0 /\ 1+arg5 > 0 /\ 1-arg5+arg4-arg3 > 0 /\ 2-arg1P9+arg1 >= 0 /\ -1+arg3 >= 0 /\ 2+arg2-arg2P9 >= 0 /\ 2+arg2-arg1P9 >= 0 /\ 2+arg2P9-arg1P9 >= 0 /\ -3+arg1P9 > 0 /\ 2-arg2P9+arg1P9 >= 0 /\ -3+arg2P9 > 0), cost: arg3

Applied deletion
Removed the following rules: 15 16 17 18

Accelerated simple loops
Start location: __init
   0: f1_0_main_Load -> f1612_0_main_NULL : arg5'=arg5P0, arg2'=arg2P0, arg4'=arg4P0, arg1'=arg1P0, arg3'=arg3P0, (1+arg2P0 > 0 /\ arg1 > 0 /\ arg1P0 > 0), cost: 1
  12: f1_0_main_Load -> f1301_0_createTree_LE : arg5'=1, arg2'=arg2P3, arg4'=arg2, arg1'=arg1P3, arg3'=arg3P3, (arg2 > 0 /\ -1+arg1P3 > 0 /\ -1-arg1+arg2P3 <= 0 /\ -1+arg1P3-arg1 <= 0 /\ arg3P3 > 0 /\ -1+arg2P3 > 0), cost: 1
  11: f1612_0_main_NULL -> f1612_0_main_NULL : arg5'=arg5P2, arg2'=arg2P2, arg4'=arg4P2, arg1'=arg1P2, arg3'=arg3P2, (-3-arg2P2+arg1 >= 0 /\ 2+arg1-arg1P2 >= 0 /\ 1+arg2P2 > 0 /\ -2+arg1P2 > 0 /\ -1-arg2P2+arg2 >= 0), cost: 1
  13: f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=1+arg5, arg2'=arg2P4, arg1'=arg1P4, arg3'=-1+arg3, (1+arg5 > 0 /\ -arg5+arg4 > 0 /\ arg2P4 > 0 /\ -arg1+arg1P4 <= 0 /\ 2-arg2+arg2P4 <= 0 /\ arg3 > 0 /\ arg1P4 > 0), cost: 1
  14: f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=1+arg5, arg2'=arg2P5, arg1'=arg1P5, arg3'=-1+arg3, (2-arg2+arg2P5 <= 0 /\ arg1P5-arg1 <= 0 /\ 1+arg5 > 0 /\ -arg5+arg4 > 0 /\ arg1P5 > 0 /\ arg2P5 > 0 /\ arg3 > 0), cost: 1
  27: f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg4, arg2'=arg2P6, arg1'=arg1P6, arg3'=arg5-arg4+arg3, (1+arg5 > 0 /\ -1+arg2P6 > 0 /\ 1+arg5-arg4+arg3 > 0 /\ arg1 > 0 /\ -1+arg2 > 0 /\ -1-arg5+arg4 >= 0 /\ arg1P6 > 0), cost: -arg5+arg4
  28: f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg5+arg3, arg2'=arg2P6, arg1'=arg1P6, arg3'=0, (1+arg5 > 0 /\ 1-arg5+arg4-arg3 > 0 /\ -1+arg3 >= 0 /\ -1+arg2P6 > 0 /\ arg1 > 0 /\ -1+arg2 > 0 /\ arg1P6 > 0), cost: arg3
  29: f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg4, arg2'=arg2P7, arg1'=arg1P7, arg3'=arg5-arg4+arg3, (1+arg5 > 0 /\ arg1P7 > 0 /\ 1+arg5-arg4+arg3 > 0 /\ arg1 > 0 /\ -1+arg2P7 > 0 /\ -1+arg2 > 0 /\ -1-arg5+arg4 >= 0), cost: -arg5+arg4
  30: f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg5+arg3, arg2'=arg2P7, arg1'=arg1P7, arg3'=0, (1+arg5 > 0 /\ 1-arg5+arg4-arg3 > 0 /\ arg1P7 > 0 /\ -1+arg3 >= 0 /\ arg1 > 0 /\ -1+arg2P7 > 0 /\ -1+arg2 > 0), cost: arg3
  31: f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg4, arg2'=arg2P8, arg1'=arg1P8, arg3'=arg5-arg4+arg3, (2+arg1-arg1P8 >= 0 /\ 1+arg5 > 0 /\ 2+arg2P8-arg1P8 >= 0 /\ 2-arg2P8+arg1P8 >= 0 /\ 1+arg5-arg4+arg3 > 0 /\ 2+arg2-arg1P8 >= 0 /\ -3+arg2P8 > 0 /\ 2-arg2P8+arg1 >= 0 /\ 2+arg2-arg2P8 >= 0 /\ -1-arg5+arg4 >= 0 /\ -3+arg1P8 > 0), cost: -arg5+arg4
  32: f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg5+arg3, arg2'=arg2P8, arg1'=arg1P8, arg3'=0, (2+arg1-arg1P8 >= 0 /\ 1+arg5 > 0 /\ 2+arg2P8-arg1P8 >= 0 /\ 1-arg5+arg4-arg3 > 0 /\ -1+arg3 >= 0 /\ 2-arg2P8+arg1P8 >= 0 /\ 2+arg2-arg1P8 >= 0 /\ -3+arg2P8 > 0 /\ 2-arg2P8+arg1 >= 0 /\ 2+arg2-arg2P8 >= 0 /\ -3+arg1P8 > 0), cost: arg3
  33: f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg4, arg2'=arg2P9, arg1'=arg1P9, arg3'=arg5-arg4+arg3, (2-arg2P9+arg1 >= 0 /\ 1+arg5 > 0 /\ 2-arg1P9+arg1 >= 0 /\ 1+arg5-arg4+arg3 > 0 /\ 2+arg2-arg2P9 >= 0 /\ 2+arg2-arg1P9 >= 0 /\ 2+arg2P9-arg1P9 >= 0 /\ -3+arg1P9 > 0 /\ -1-arg5+arg4 >= 0 /\ 2-arg2P9+arg1P9 >= 0 /\ -3+arg2P9 > 0), cost: -arg5+arg4
  34: f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg5+arg3, arg2'=arg2P9, arg1'=arg1P9, arg3'=0, (2-arg2P9+arg1 >= 0 /\ 1+arg5 > 0 /\ 1-arg5+arg4-arg3 > 0 /\ 2-arg1P9+arg1 >= 0 /\ -1+arg3 >= 0 /\ 2+arg2-arg2P9 >= 0 /\ 2+arg2-arg1P9 >= 0 /\ 2+arg2P9-arg1P9 >= 0 /\ -3+arg1P9 > 0 /\ 2-arg2P9+arg1P9 >= 0 /\ -3+arg2P9 > 0), cost: arg3
  10: __init -> f1_0_main_Load : arg5'=arg5P10, arg2'=arg2P10, arg4'=arg4P10, arg1'=arg1P10, arg3'=arg3P10, TRUE, cost: 1


Applied chaining
First rule:
f1_0_main_Load -> f1612_0_main_NULL : arg5'=arg5P0, arg2'=arg2P0, arg4'=arg4P0, arg1'=arg1P0, arg3'=arg3P0, (1+arg2P0 > 0 /\ arg1 > 0 /\ arg1P0 > 0), cost: 1
Second rule:
f1612_0_main_NULL -> f1612_0_main_NULL : arg5'=arg5P2, arg2'=arg2P2, arg4'=arg4P2, arg1'=arg1P2, arg3'=arg3P2, (-3-arg2P2+arg1 >= 0 /\ 2+arg1-arg1P2 >= 0 /\ 1+arg2P2 > 0 /\ -2+arg1P2 > 0 /\ -1-arg2P2+arg2 >= 0), cost: 1
New rule:
f1_0_main_Load -> f1612_0_main_NULL : arg5'=arg5P2, arg2'=arg2P2, arg4'=arg4P2, arg1'=arg1P2, arg3'=arg3P2, (1+arg2P2 > 0 /\ -2+arg1P2 > 0 /\ arg1 > 0), cost: 2

Applied deletion
Removed the following rules: 11

Applied chaining
First rule:
f1_0_main_Load -> f1301_0_createTree_LE : arg5'=1, arg2'=arg2P3, arg4'=arg2, arg1'=arg1P3, arg3'=arg3P3, (arg2 > 0 /\ -1+arg1P3 > 0 /\ -1-arg1+arg2P3 <= 0 /\ -1+arg1P3-arg1 <= 0 /\ arg3P3 > 0 /\ -1+arg2P3 > 0), cost: 1
Second rule:
f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=1+arg5, arg2'=arg2P4, arg1'=arg1P4, arg3'=-1+arg3, (1+arg5 > 0 /\ -arg5+arg4 > 0 /\ arg2P4 > 0 /\ -arg1+arg1P4 <= 0 /\ 2-arg2+arg2P4 <= 0 /\ arg3 > 0 /\ arg1P4 > 0), cost: 1
New rule:
f1_0_main_Load -> f1301_0_createTree_LE : arg5'=2, arg2'=arg2P4, arg4'=arg2, arg1'=arg1P4, arg3'=-1+arg3P3, (arg2P4 > 0 /\ 1+arg2P4-arg1 <= 0 /\ arg3P3 > 0 /\ -1-arg1+arg1P4 <= 0 /\ -1+arg2 > 0 /\ arg1P4 > 0), cost: 2

Applied chaining
First rule:
f1_0_main_Load -> f1301_0_createTree_LE : arg5'=1, arg2'=arg2P3, arg4'=arg2, arg1'=arg1P3, arg3'=arg3P3, (arg2 > 0 /\ -1+arg1P3 > 0 /\ -1-arg1+arg2P3 <= 0 /\ -1+arg1P3-arg1 <= 0 /\ arg3P3 > 0 /\ -1+arg2P3 > 0), cost: 1
Second rule:
f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=1+arg5, arg2'=arg2P5, arg1'=arg1P5, arg3'=-1+arg3, (2-arg2+arg2P5 <= 0 /\ arg1P5-arg1 <= 0 /\ 1+arg5 > 0 /\ -arg5+arg4 > 0 /\ arg1P5 > 0 /\ arg2P5 > 0 /\ arg3 > 0), cost: 1
New rule:
f1_0_main_Load -> f1301_0_createTree_LE : arg5'=2, arg2'=arg2P5, arg4'=arg2, arg1'=arg1P5, arg3'=-1+arg3P3, (arg1P5 > 0 /\ arg2P5 > 0 /\ 1+arg2P5-arg1 <= 0 /\ arg3P3 > 0 /\ -1+arg2 > 0 /\ -1+arg1P5-arg1 <= 0), cost: 2

Applied chaining
First rule:
f1_0_main_Load -> f1301_0_createTree_LE : arg5'=1, arg2'=arg2P3, arg4'=arg2, arg1'=arg1P3, arg3'=arg3P3, (arg2 > 0 /\ -1+arg1P3 > 0 /\ -1-arg1+arg2P3 <= 0 /\ -1+arg1P3-arg1 <= 0 /\ arg3P3 > 0 /\ -1+arg2P3 > 0), cost: 1
Second rule:
f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg4, arg2'=arg2P6, arg1'=arg1P6, arg3'=arg5-arg4+arg3, (1+arg5 > 0 /\ -1+arg2P6 > 0 /\ 1+arg5-arg4+arg3 > 0 /\ arg1 > 0 /\ -1+arg2 > 0 /\ -1-arg5+arg4 >= 0 /\ arg1P6 > 0), cost: -arg5+arg4
New rule:
f1_0_main_Load -> f1301_0_createTree_LE : arg5'=arg2, arg2'=arg2P6, arg4'=arg2, arg1'=arg1P6, arg3'=1-arg2+arg3P3, (2-arg2+arg3P3 > 0 /\ -2+arg2 >= 0 /\ -1+arg2P6 > 0 /\ -1+arg1 >= 0 /\ arg1P6 > 0), cost: arg2

Applied chaining
First rule:
f1_0_main_Load -> f1301_0_createTree_LE : arg5'=1, arg2'=arg2P3, arg4'=arg2, arg1'=arg1P3, arg3'=arg3P3, (arg2 > 0 /\ -1+arg1P3 > 0 /\ -1-arg1+arg2P3 <= 0 /\ -1+arg1P3-arg1 <= 0 /\ arg3P3 > 0 /\ -1+arg2P3 > 0), cost: 1
Second rule:
f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg5+arg3, arg2'=arg2P6, arg1'=arg1P6, arg3'=0, (1+arg5 > 0 /\ 1-arg5+arg4-arg3 > 0 /\ -1+arg3 >= 0 /\ -1+arg2P6 > 0 /\ arg1 > 0 /\ -1+arg2 > 0 /\ arg1P6 > 0), cost: arg3
New rule:
f1_0_main_Load -> f1301_0_createTree_LE : arg5'=1+arg3P3, arg2'=arg2P6, arg4'=arg2, arg1'=arg1P6, arg3'=0, (arg2-arg3P3 > 0 /\ -1+arg2P6 > 0 /\ -1+arg3P3 >= 0 /\ -1+arg1 >= 0 /\ arg1P6 > 0), cost: 1+arg3P3

Applied chaining
First rule:
f1_0_main_Load -> f1301_0_createTree_LE : arg5'=1, arg2'=arg2P3, arg4'=arg2, arg1'=arg1P3, arg3'=arg3P3, (arg2 > 0 /\ -1+arg1P3 > 0 /\ -1-arg1+arg2P3 <= 0 /\ -1+arg1P3-arg1 <= 0 /\ arg3P3 > 0 /\ -1+arg2P3 > 0), cost: 1
Second rule:
f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg4, arg2'=arg2P7, arg1'=arg1P7, arg3'=arg5-arg4+arg3, (1+arg5 > 0 /\ arg1P7 > 0 /\ 1+arg5-arg4+arg3 > 0 /\ arg1 > 0 /\ -1+arg2P7 > 0 /\ -1+arg2 > 0 /\ -1-arg5+arg4 >= 0), cost: -arg5+arg4
New rule:
f1_0_main_Load -> f1301_0_createTree_LE : arg5'=arg2, arg2'=arg2P7, arg4'=arg2, arg1'=arg1P7, arg3'=1-arg2+arg3P3, (2-arg2+arg3P3 > 0 /\ arg1P7 > 0 /\ -2+arg2 >= 0 /\ -1+arg2P7 > 0 /\ -1+arg1 >= 0), cost: arg2

Applied chaining
First rule:
f1_0_main_Load -> f1301_0_createTree_LE : arg5'=1, arg2'=arg2P3, arg4'=arg2, arg1'=arg1P3, arg3'=arg3P3, (arg2 > 0 /\ -1+arg1P3 > 0 /\ -1-arg1+arg2P3 <= 0 /\ -1+arg1P3-arg1 <= 0 /\ arg3P3 > 0 /\ -1+arg2P3 > 0), cost: 1
Second rule:
f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg5+arg3, arg2'=arg2P7, arg1'=arg1P7, arg3'=0, (1+arg5 > 0 /\ 1-arg5+arg4-arg3 > 0 /\ arg1P7 > 0 /\ -1+arg3 >= 0 /\ arg1 > 0 /\ -1+arg2P7 > 0 /\ -1+arg2 > 0), cost: arg3
New rule:
f1_0_main_Load -> f1301_0_createTree_LE : arg5'=1+arg3P3, arg2'=arg2P7, arg4'=arg2, arg1'=arg1P7, arg3'=0, (arg2-arg3P3 > 0 /\ arg1P7 > 0 /\ -1+arg2P7 > 0 /\ -1+arg3P3 >= 0 /\ -1+arg1 >= 0), cost: 1+arg3P3

Applied chaining
First rule:
f1_0_main_Load -> f1301_0_createTree_LE : arg5'=1, arg2'=arg2P3, arg4'=arg2, arg1'=arg1P3, arg3'=arg3P3, (arg2 > 0 /\ -1+arg1P3 > 0 /\ -1-arg1+arg2P3 <= 0 /\ -1+arg1P3-arg1 <= 0 /\ arg3P3 > 0 /\ -1+arg2P3 > 0), cost: 1
Second rule:
f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg4, arg2'=arg2P8, arg1'=arg1P8, arg3'=arg5-arg4+arg3, (2+arg1-arg1P8 >= 0 /\ 1+arg5 > 0 /\ 2+arg2P8-arg1P8 >= 0 /\ 2-arg2P8+arg1P8 >= 0 /\ 1+arg5-arg4+arg3 > 0 /\ 2+arg2-arg1P8 >= 0 /\ -3+arg2P8 > 0 /\ 2-arg2P8+arg1 >= 0 /\ 2+arg2-arg2P8 >= 0 /\ -1-arg5+arg4 >= 0 /\ -3+arg1P8 > 0), cost: -arg5+arg4
New rule:
f1_0_main_Load -> f1301_0_createTree_LE : arg5'=arg2, arg2'=arg2P8, arg4'=arg2, arg1'=arg1P8, arg3'=1-arg2+arg3P3, (2-arg2+arg3P3 > 0 /\ 2+arg2P8-arg1P8 >= 0 /\ -3-arg1+arg1P8 <= 0 /\ -2+arg2 >= 0 /\ 2-arg2P8+arg1P8 >= 0 /\ -3+arg2P8-arg1 <= 0 /\ -3+arg2P8 > 0 /\ -3+arg1P8 > 0), cost: arg2

Applied chaining
First rule:
f1_0_main_Load -> f1301_0_createTree_LE : arg5'=1, arg2'=arg2P3, arg4'=arg2, arg1'=arg1P3, arg3'=arg3P3, (arg2 > 0 /\ -1+arg1P3 > 0 /\ -1-arg1+arg2P3 <= 0 /\ -1+arg1P3-arg1 <= 0 /\ arg3P3 > 0 /\ -1+arg2P3 > 0), cost: 1
Second rule:
f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg5+arg3, arg2'=arg2P8, arg1'=arg1P8, arg3'=0, (2+arg1-arg1P8 >= 0 /\ 1+arg5 > 0 /\ 2+arg2P8-arg1P8 >= 0 /\ 1-arg5+arg4-arg3 > 0 /\ -1+arg3 >= 0 /\ 2-arg2P8+arg1P8 >= 0 /\ 2+arg2-arg1P8 >= 0 /\ -3+arg2P8 > 0 /\ 2-arg2P8+arg1 >= 0 /\ 2+arg2-arg2P8 >= 0 /\ -3+arg1P8 > 0), cost: arg3
New rule:
f1_0_main_Load -> f1301_0_createTree_LE : arg5'=1+arg3P3, arg2'=arg2P8, arg4'=arg2, arg1'=arg1P8, arg3'=0, (arg2-arg3P3 > 0 /\ 2+arg2P8-arg1P8 >= 0 /\ -3-arg1+arg1P8 <= 0 /\ 2-arg2P8+arg1P8 >= 0 /\ -3+arg2P8-arg1 <= 0 /\ -3+arg2P8 > 0 /\ -1+arg3P3 >= 0 /\ -3+arg1P8 > 0), cost: 1+arg3P3

Applied chaining
First rule:
f1_0_main_Load -> f1301_0_createTree_LE : arg5'=1, arg2'=arg2P3, arg4'=arg2, arg1'=arg1P3, arg3'=arg3P3, (arg2 > 0 /\ -1+arg1P3 > 0 /\ -1-arg1+arg2P3 <= 0 /\ -1+arg1P3-arg1 <= 0 /\ arg3P3 > 0 /\ -1+arg2P3 > 0), cost: 1
Second rule:
f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg4, arg2'=arg2P9, arg1'=arg1P9, arg3'=arg5-arg4+arg3, (2-arg2P9+arg1 >= 0 /\ 1+arg5 > 0 /\ 2-arg1P9+arg1 >= 0 /\ 1+arg5-arg4+arg3 > 0 /\ 2+arg2-arg2P9 >= 0 /\ 2+arg2-arg1P9 >= 0 /\ 2+arg2P9-arg1P9 >= 0 /\ -3+arg1P9 > 0 /\ -1-arg5+arg4 >= 0 /\ 2-arg2P9+arg1P9 >= 0 /\ -3+arg2P9 > 0), cost: -arg5+arg4
New rule:
f1_0_main_Load -> f1301_0_createTree_LE : arg5'=arg2, arg2'=arg2P9, arg4'=arg2, arg1'=arg1P9, arg3'=1-arg2+arg3P3, (-3+arg2P9-arg1 <= 0 /\ 2-arg2+arg3P3 > 0 /\ -3+arg1P9-arg1 <= 0 /\ -2+arg2 >= 0 /\ 2+arg2P9-arg1P9 >= 0 /\ -3+arg1P9 > 0 /\ 2-arg2P9+arg1P9 >= 0 /\ -3+arg2P9 > 0), cost: arg2

Applied chaining
First rule:
f1_0_main_Load -> f1301_0_createTree_LE : arg5'=1, arg2'=arg2P3, arg4'=arg2, arg1'=arg1P3, arg3'=arg3P3, (arg2 > 0 /\ -1+arg1P3 > 0 /\ -1-arg1+arg2P3 <= 0 /\ -1+arg1P3-arg1 <= 0 /\ arg3P3 > 0 /\ -1+arg2P3 > 0), cost: 1
Second rule:
f1301_0_createTree_LE -> f1301_0_createTree_LE : arg5'=arg5+arg3, arg2'=arg2P9, arg1'=arg1P9, arg3'=0, (2-arg2P9+arg1 >= 0 /\ 1+arg5 > 0 /\ 1-arg5+arg4-arg3 > 0 /\ 2-arg1P9+arg1 >= 0 /\ -1+arg3 >= 0 /\ 2+arg2-arg2P9 >= 0 /\ 2+arg2-arg1P9 >= 0 /\ 2+arg2P9-arg1P9 >= 0 /\ -3+arg1P9 > 0 /\ 2-arg2P9+arg1P9 >= 0 /\ -3+arg2P9 > 0), cost: arg3
New rule:
f1_0_main_Load -> f1301_0_createTree_LE : arg5'=1+arg3P3, arg2'=arg2P9, arg4'=arg2, arg1'=arg1P9, arg3'=0, (arg2-arg3P3 > 0 /\ -3+arg2P9-arg1 <= 0 /\ -3+arg1P9-arg1 <= 0 /\ 2+arg2P9-arg1P9 >= 0 /\ -1+arg3P3 >= 0 /\ -3+arg1P9 > 0 /\ 2-arg2P9+arg1P9 >= 0 /\ -3+arg2P9 > 0), cost: 1+arg3P3

Applied deletion
Removed the following rules: 13 14 27 28 29 30 31 32 33 34

Chained accelerated rules with incoming rules
Start location: __init
   0: f1_0_main_Load -> f1612_0_main_NULL : arg5'=arg5P0, arg2'=arg2P0, arg4'=arg4P0, arg1'=arg1P0, arg3'=arg3P0, (1+arg2P0 > 0 /\ arg1 > 0 /\ arg1P0 > 0), cost: 1
  12: f1_0_main_Load -> f1301_0_createTree_LE : arg5'=1, arg2'=arg2P3, arg4'=arg2, arg1'=arg1P3, arg3'=arg3P3, (arg2 > 0 /\ -1+arg1P3 > 0 /\ -1-arg1+arg2P3 <= 0 /\ -1+arg1P3-arg1 <= 0 /\ arg3P3 > 0 /\ -1+arg2P3 > 0), cost: 1
  35: f1_0_main_Load -> f1612_0_main_NULL : arg5'=arg5P2, arg2'=arg2P2, arg4'=arg4P2, arg1'=arg1P2, arg3'=arg3P2, (1+arg2P2 > 0 /\ -2+arg1P2 > 0 /\ arg1 > 0), cost: 2
  36: f1_0_main_Load -> f1301_0_createTree_LE : arg5'=2, arg2'=arg2P4, arg4'=arg2, arg1'=arg1P4, arg3'=-1+arg3P3, (arg2P4 > 0 /\ 1+arg2P4-arg1 <= 0 /\ arg3P3 > 0 /\ -1-arg1+arg1P4 <= 0 /\ -1+arg2 > 0 /\ arg1P4 > 0), cost: 2
  37: f1_0_main_Load -> f1301_0_createTree_LE : arg5'=2, arg2'=arg2P5, arg4'=arg2, arg1'=arg1P5, arg3'=-1+arg3P3, (arg1P5 > 0 /\ arg2P5 > 0 /\ 1+arg2P5-arg1 <= 0 /\ arg3P3 > 0 /\ -1+arg2 > 0 /\ -1+arg1P5-arg1 <= 0), cost: 2
  38: f1_0_main_Load -> f1301_0_createTree_LE : arg5'=arg2, arg2'=arg2P6, arg4'=arg2, arg1'=arg1P6, arg3'=1-arg2+arg3P3, (2-arg2+arg3P3 > 0 /\ -2+arg2 >= 0 /\ -1+arg2P6 > 0 /\ -1+arg1 >= 0 /\ arg1P6 > 0), cost: arg2
  39: f1_0_main_Load -> f1301_0_createTree_LE : arg5'=1+arg3P3, arg2'=arg2P6, arg4'=arg2, arg1'=arg1P6, arg3'=0, (arg2-arg3P3 > 0 /\ -1+arg2P6 > 0 /\ -1+arg3P3 >= 0 /\ -1+arg1 >= 0 /\ arg1P6 > 0), cost: 1+arg3P3
  40: f1_0_main_Load -> f1301_0_createTree_LE : arg5'=arg2, arg2'=arg2P7, arg4'=arg2, arg1'=arg1P7, arg3'=1-arg2+arg3P3, (2-arg2+arg3P3 > 0 /\ arg1P7 > 0 /\ -2+arg2 >= 0 /\ -1+arg2P7 > 0 /\ -1+arg1 >= 0), cost: arg2
  41: f1_0_main_Load -> f1301_0_createTree_LE : arg5'=1+arg3P3, arg2'=arg2P7, arg4'=arg2, arg1'=arg1P7, arg3'=0, (arg2-arg3P3 > 0 /\ arg1P7 > 0 /\ -1+arg2P7 > 0 /\ -1+arg3P3 >= 0 /\ -1+arg1 >= 0), cost: 1+arg3P3
  42: f1_0_main_Load -> f1301_0_createTree_LE : arg5'=arg2, arg2'=arg2P8, arg4'=arg2, arg1'=arg1P8, arg3'=1-arg2+arg3P3, (2-arg2+arg3P3 > 0 /\ 2+arg2P8-arg1P8 >= 0 /\ -3-arg1+arg1P8 <= 0 /\ -2+arg2 >= 0 /\ 2-arg2P8+arg1P8 >= 0 /\ -3+arg2P8-arg1 <= 0 /\ -3+arg2P8 > 0 /\ -3+arg1P8 > 0), cost: arg2
  43: f1_0_main_Load -> f1301_0_createTree_LE : arg5'=1+arg3P3, arg2'=arg2P8, arg4'=arg2, arg1'=arg1P8, arg3'=0, (arg2-arg3P3 > 0 /\ 2+arg2P8-arg1P8 >= 0 /\ -3-arg1+arg1P8 <= 0 /\ 2-arg2P8+arg1P8 >= 0 /\ -3+arg2P8-arg1 <= 0 /\ -3+arg2P8 > 0 /\ -1+arg3P3 >= 0 /\ -3+arg1P8 > 0), cost: 1+arg3P3
  44: f1_0_main_Load -> f1301_0_createTree_LE : arg5'=arg2, arg2'=arg2P9, arg4'=arg2, arg1'=arg1P9, arg3'=1-arg2+arg3P3, (-3+arg2P9-arg1 <= 0 /\ 2-arg2+arg3P3 > 0 /\ -3+arg1P9-arg1 <= 0 /\ -2+arg2 >= 0 /\ 2+arg2P9-arg1P9 >= 0 /\ -3+arg1P9 > 0 /\ 2-arg2P9+arg1P9 >= 0 /\ -3+arg2P9 > 0), cost: arg2
  45: f1_0_main_Load -> f1301_0_createTree_LE : arg5'=1+arg3P3, arg2'=arg2P9, arg4'=arg2, arg1'=arg1P9, arg3'=0, (arg2-arg3P3 > 0 /\ -3+arg2P9-arg1 <= 0 /\ -3+arg1P9-arg1 <= 0 /\ 2+arg2P9-arg1P9 >= 0 /\ -1+arg3P3 >= 0 /\ -3+arg1P9 > 0 /\ 2-arg2P9+arg1P9 >= 0 /\ -3+arg2P9 > 0), cost: 1+arg3P3
  10: __init -> f1_0_main_Load : arg5'=arg5P10, arg2'=arg2P10, arg4'=arg4P10, arg1'=arg1P10, arg3'=arg3P10, 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