Integer Transition Systems pair #487527695

details
property	value
status	complete
benchmark	TreeLeftmostDepth.jar-obl-9.smt2
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n109.star.cs.uiowa.edu
space	From_AProVE_2014
run statistics
property	value
solver	LoAT
configuration	loat_nonterm_proofout
runtime (wallclock)	8.75562787056 seconds
cpu usage	8.86156226
max memory	2.5698304E7
stage attributes
key	value
output-size	42973
starexec-result	WORST_CASE(Omega(0),?)
output
/export/starexec/sandbox/solver/bin/starexec_run_loat_nonterm_proofout /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/output/output_files


--------------------------------------------------------------------------------


WORST_CASE(Omega(0),?)

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


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


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

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

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

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

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

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

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

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

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


Applied acceleration
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions all output return to Integer Transition Systems