details

property	value
status	complete
benchmark	elmhes.t2.smt2
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n006.star.cs.uiowa.edu
space	From_T2

run statistics

property	value
solver	VeryMax-termCOMP17
configuration	termcomp17
runtime (wallclock)	1.28781294823 seconds
cpu usage	1.283841934
max memory	1.44482304E8

stage attributes

key	value
output-size	21889
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: <l0, l24, true> <l1, l2, ((0 + n^0) <= (0 + m^0))> <l1, l3, ((1 + m^0) <= (0 + n^0)), par{i^0 -> (0 + m^0), x^0 -> 0}> <l3, l4, true> <l5, l6, true> <l7, l8, true, par{m^0 -> (1 + m^0)}> <l9, l10, true, par{i^0 -> (1 + i^0)}> <l11, l12, true> <l13, l9, ((1 + n^0) <= (0 + j^0))> <l13, l14, ((0 + j^0) <= (0 + n^0)), par{j^0 -> (1 + j^0)}> <l15, l14, ((1 + n^0) <= (0 + j^0))> <l15, l16, ((0 + j^0) <= (0 + n^0)), par{j^0 -> (1 + j^0)}> <l17, l16, (undef96 = undef96), par{y^0 -> undef96}> <l18, l9, ((0 + y^0) <= 0) /\ (0 <= (0 + y^0))> <l18, l17, (1 <= (0 + y^0))> <l18, l17, ((1 + y^0) <= 0)> <l10, l19, true> <l19, l7, ((1 + n^0) <= (0 + i^0))> <l19, l18, ((0 + i^0) <= (0 + n^0)) /\ (undef144 = undef144), par{y^0 -> undef144}> <l20, l7, ((0 + x^0) <= 0) /\ (0 <= (0 + x^0))> <l20, l10, (1 <= (0 + x^0))> <l20, l10, ((1 + x^0) <= 0)> <l16, l15, true> <l12, l20, ((1 + n^0) <= (0 + j^0))> <l12, l11, ((0 + j^0) <= (0 + n^0)) /\ (undef192 = undef192), par{j^0 -> (1 + j^0), y^0 -> undef192}> <l6, l11, ((1 + n^0) <= (0 + j^0))> <l6, l5, ((0 + j^0) <= (0 + n^0)) /\ (undef208 = undef208), par{j^0 -> (1 + j^0), y^0 -> undef208}> <l21, l20, ((0 + i^0) <= (0 + m^0)) /\ ((0 + m^0) <= (0 + i^0))> <l21, l5, ((1 + m^0) <= (0 + i^0))> <l21, l5, ((1 + i^0) <= (0 + m^0))> <l14, l13, true> <l22, l3, true, par{j^0 -> (1 + j^0)}> <l23, l22, ((0 + tmp^0) <= (0 + tmp___0^0))> <l23, l22, ((1 + tmp___0^0) <= (0 + tmp^0)) /\ (undef263 = undef263), par{i^0 -> (0 + j^0), x^0 -> undef263}> <l4, l21, ((1 + n^0) <= (0 + j^0))> <l4, l23, ((0 + j^0) <= (0 + n^0)) /\ (undef277 = undef277) /\ (undef278 = undef278), par{tmp^0 -> undef277, tmp___0^0 -> undef278}> <l8, l1, true> <l24, l8, true> Fresh variables: undef96, undef144, undef192, undef208, undef263, undef277, undef278, Undef variables: undef96, undef144, undef192, undef208, undef263, undef277, undef278, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l2, ((0 + n^0) <= (0 + m^0))> <l0, l3, ((1 + m^0) <= (0 + n^0)), par{i^0 -> (0 + m^0), x^0 -> 0}> <l3, l2, ((1 + n^0) <= (0 + j^0)) /\ ((0 + i^0) <= (0 + m^0)) /\ ((0 + m^0) <= (0 + i^0)) /\ ((0 + x^0) <= 0) /\ (0 <= (0 + x^0)) /\ ((0 + n^0) <= (0 + (1 + m^0))), par{m^0 -> (1 + m^0)}> <l3, l3, ((1 + n^0) <= (0 + j^0)) /\ ((0 + i^0) <= (0 + m^0)) /\ ((0 + m^0) <= (0 + i^0)) /\ ((0 + x^0) <= 0) /\ (0 <= (0 + x^0)) /\ ((1 + (1 + m^0)) <= (0 + n^0)), par{i^0 -> (0 + (1 + m^0)), m^0 -> (1 + m^0), x^0 -> 0}> <l3, l10, ((1 + n^0) <= (0 + j^0)) /\ ((0 + i^0) <= (0 + m^0)) /\ ((0 + m^0) <= (0 + i^0)) /\ (1 <= (0 + x^0))> <l3, l10, ((1 + n^0) <= (0 + j^0)) /\ ((0 + i^0) <= (0 + m^0)) /\ ((0 + m^0) <= (0 + i^0)) /\ ((1 + x^0) <= 0)> <l3, l5, ((1 + n^0) <= (0 + j^0)) /\ ((1 + m^0) <= (0 + i^0))> <l3, l5, ((1 + n^0) <= (0 + j^0)) /\ ((1 + i^0) <= (0 + m^0))> <l3, l3, ((0 + j^0) <= (0 + n^0)) /\ (undef277 = undef277) /\ (undef278 = undef278) /\ ((0 + undef277) <= (0 + undef278)), par{j^0 -> (1 + j^0)}> <l3, l3, ((0 + j^0) <= (0 + n^0)) /\ (undef277 = undef277) /\ (undef278 = undef278) /\ ((1 + undef278) <= (0 + undef277)) /\ (undef263 = undef263), par{i^0 -> (0 + j^0), j^0 -> (1 + j^0), x^0 -> undef263}> <l5, l11, ((1 + n^0) <= (0 + j^0))> <l5, l5, ((0 + j^0) <= (0 + n^0)) /\ (undef208 = undef208), par{j^0 -> (1 + j^0)}> <l10, l2, ((1 + n^0) <= (0 + i^0)) /\ ((0 + n^0) <= (0 + (1 + m^0))), par{m^0 -> (1 + m^0)}> <l10, l3, ((1 + n^0) <= (0 + i^0)) /\ ((1 + (1 + m^0)) <= (0 + n^0)), par{i^0 -> (0 + (1 + m^0)), m^0 -> (1 + m^0), x^0 -> 0}> <l10, l10, ((0 + i^0) <= (0 + n^0)) /\ (undef144 = undef144) /\ ((0 + undef144) <= 0) /\ (0 <= (0 + undef144)), par{i^0 -> (1 + i^0)}> <l10, l16, ((0 + i^0) <= (0 + n^0)) /\ (undef144 = undef144) /\ (1 <= (0 + undef144)) /\ (undef96 = undef96)> <l10, l16, ((0 + i^0) <= (0 + n^0)) /\ (undef144 = undef144) /\ ((1 + undef144) <= 0) /\ (undef96 = undef96)> <l11, l2, ((1 + n^0) <= (0 + j^0)) /\ ((0 + x^0) <= 0) /\ (0 <= (0 + x^0)) /\ ((0 + n^0) <= (0 + (1 + m^0))), par{m^0 -> (1 + m^0)}> <l11, l3, ((1 + n^0) <= (0 + j^0)) /\ ((0 + x^0) <= 0) /\ (0 <= (0 + x^0)) /\ ((1 + (1 + m^0)) <= (0 + n^0)), par{i^0 -> (0 + (1 + m^0)), m^0 -> (1 + m^0), x^0 -> 0}> <l11, l10, ((1 + n^0) <= (0 + j^0)) /\ (1 <= (0 + x^0))> <l11, l10, ((1 + n^0) <= (0 + j^0)) /\ ((1 + x^0) <= 0)> <l11, l11, ((0 + j^0) <= (0 + n^0)) /\ (undef192 = undef192), par{j^0 -> (1 + j^0)}> <l14, l10, ((1 + n^0) <= (0 + j^0)), par{i^0 -> (1 + i^0)}> <l14, l14, ((0 + j^0) <= (0 + n^0)), par{j^0 -> (1 + j^0)}> <l16, l14, ((1 + n^0) <= (0 + j^0))> <l16, l16, ((0 + j^0) <= (0 + n^0)), par{j^0 -> (1 + j^0)}> Fresh variables: undef96, undef144, undef192, undef208, undef263, undef277, undef278, popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to Integ Trans Syste 27634