details

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

run statistics

property	value
solver	VeryMax-termCOMP17
configuration	termcomp17
runtime (wallclock)	0.31530213356 seconds
cpu usage	0.311951318
max memory	4.2893312E7

stage attributes

key	value
output-size	17150
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, l27, true> <l1, l2, true> <l3, l1, true, par{tmp___4^0 -> 0}> <l4, l1, ((0 + bSorted^0) <= 0) /\ (0 <= (0 + bSorted^0)), par{tmp___4^0 -> 1}> <l4, l3, (1 <= (0 + bSorted^0))> <l4, l3, ((1 + bSorted^0) <= 0)> <l5, l1, ((0 + bDomain^0) <= 0) /\ (0 <= (0 + bDomain^0)), par{tmp___4^0 -> 1}> <l5, l4, (1 <= (0 + bDomain^0))> <l5, l4, ((1 + bDomain^0) <= 0)> <l6, l7, true, par{bSorted^0 -> (0 + tmp___3^0), ni^0 -> (1 + ni^0)}> <l8, l6, true, par{tmp___3^0 -> 1}> <l8, l6, true, par{tmp___3^0 -> 0}> <l9, l6, ((0 + bSorted^0) <= 0) /\ (0 <= (0 + bSorted^0)), par{tmp___3^0 -> 0}> <l9, l8, (1 <= (0 + bSorted^0))> <l9, l8, ((1 + bSorted^0) <= 0)> <l10, l5, ((~(1) + nDim^0) <= (0 + ni^0))> <l10, l9, ((1 + ni^0) <= (~(1) + nDim^0))> <l11, l12, true> <l13, l14, true, par{bDomain^0 -> (0 + tmp___2^0), ni^0 -> (1 + ni^0)}> <l15, l13, true, par{tmp___2^0 -> 1}> <l16, l13, ((0 + bExists^0) <= 0) /\ (0 <= (0 + bExists^0)), par{tmp___2^0 -> 0}> <l16, l15, (1 <= (0 + bExists^0))> <l16, l15, ((1 + bExists^0) <= 0)> <l17, l13, ((0 + bDomain^0) <= 0) /\ (0 <= (0 + bDomain^0)), par{tmp___2^0 -> 0}> <l17, l16, (1 <= (0 + bDomain^0))> <l17, l16, ((1 + bDomain^0) <= 0)> <l18, l19, true, par{tmp___1^0 -> 0}> <l14, l20, true> <l21, l18, true> <l21, l19, true, par{tmp___1^0 -> 1}> <l21, l18, true> <l19, l22, true, par{bExists^0 -> (0 + tmp___1^0), nj^0 -> (1 + nj^0)}> <l23, l19, true, par{tmp___1^0 -> 1}> <l24, l21, ((0 + bExists^0) <= 0) /\ (0 <= (0 + bExists^0))> <l24, l23, (1 <= (0 + bExists^0))> <l24, l23, ((1 + bExists^0) <= 0)> <l25, l17, ((0 + nDim^0) <= (0 + nj^0))> <l25, l24, ((1 + nj^0) <= (0 + nDim^0))> <l22, l25, true> <l20, l7, ((0 + nDim^0) <= (0 + ni^0)), par{ni^0 -> 0}> <l20, l22, ((1 + ni^0) <= (0 + nDim^0)), par{bExists^0 -> 0, nj^0 -> 0}> <l12, l14, ((0 + nDim^0) <= (0 + ni^0)), par{ni^0 -> 0}> <l12, l11, ((1 + ni^0) <= (0 + nDim^0)), par{ni^0 -> (1 + ni^0)}> <l7, l10, true> <l26, l11, (undef523 = undef523) /\ (undef524 = undef524), par{bDomain^0 -> 1, bSorted^0 -> 1, nDim^0 -> 10, ni^0 -> 0, tmp^0 -> undef523, tmp___0^0 -> undef524}> <l27, l26, true> Fresh variables: undef523, undef524, Undef variables: undef523, undef524, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l11, (bDomain^0 = 1) /\ (bSorted^0 = 1) /\ (10 = 10) /\ (ni^0 = 0) /\ (undef523 = undef523) /\ (undef524 = undef524)> <l7, l2, ((~(1) + 10) <= (0 + ni^0)) /\ ((0 + bDomain^0) <= 0) /\ (0 <= (0 + bDomain^0))> <l7, l2, ((~(1) + 10) <= (0 + ni^0)) /\ (1 <= (0 + bDomain^0)) /\ ((0 + bSorted^0) <= 0) /\ (0 <= (0 + bSorted^0))> <l7, l2, ((~(1) + 10) <= (0 + ni^0)) /\ (1 <= (0 + bDomain^0)) /\ (1 <= (0 + bSorted^0))> <l7, l2, ((~(1) + 10) <= (0 + ni^0)) /\ (1 <= (0 + bDomain^0)) /\ ((1 + bSorted^0) <= 0)> <l7, l2, ((~(1) + 10) <= (0 + ni^0)) /\ ((1 + bDomain^0) <= 0) /\ ((0 + bSorted^0) <= 0) /\ (0 <= (0 + bSorted^0))> <l7, l2, ((~(1) + 10) <= (0 + ni^0)) /\ ((1 + bDomain^0) <= 0) /\ (1 <= (0 + bSorted^0))> <l7, l2, ((~(1) + 10) <= (0 + ni^0)) /\ ((1 + bDomain^0) <= 0) /\ ((1 + bSorted^0) <= 0)> <l7, l7, ((1 + ni^0) <= (~(1) + 10)) /\ ((0 + bSorted^0) <= 0) /\ (0 <= (0 + bSorted^0)), par{bSorted^0 -> (0 + 0), ni^0 -> (1 + ni^0)}> <l7, l7, ((1 + ni^0) <= (~(1) + 10)) /\ (1 <= (0 + bSorted^0)), par{bSorted^0 -> (0 + 1), ni^0 -> (1 + ni^0)}> <l7, l7, ((1 + ni^0) <= (~(1) + 10)) /\ (1 <= (0 + bSorted^0)), par{bSorted^0 -> (0 + 0), ni^0 -> (1 + ni^0)}> <l7, l7, ((1 + ni^0) <= (~(1) + 10)) /\ ((1 + bSorted^0) <= 0), par{bSorted^0 -> (0 + 1), ni^0 -> (1 + ni^0)}> <l7, l7, ((1 + ni^0) <= (~(1) + 10)) /\ ((1 + bSorted^0) <= 0), par{bSorted^0 -> (0 + 0), ni^0 -> (1 + ni^0)}> <l11, l22, ((0 + 10) <= (0 + ni^0)) /\ ((1 + 0) <= (0 + 10)), par{bExists^0 -> 0, ni^0 -> 0, nj^0 -> 0}> <l11, l11, ((1 + ni^0) <= (0 + 10)), par{ni^0 -> (1 + ni^0)}> <l22, l7, ((0 + 10) <= (0 + nj^0)) /\ ((0 + bDomain^0) <= 0) /\ (0 <= (0 + bDomain^0)) /\ ((0 + 10) <= (0 + (1 + ni^0))), par{bDomain^0 -> (0 + 0), ni^0 -> 0}> <l22, l22, ((0 + 10) <= (0 + nj^0)) /\ ((0 + bDomain^0) <= 0) /\ (0 <= (0 + bDomain^0)) /\ ((1 + (1 + ni^0)) <= (0 + 10)), par{bDomain^0 -> (0 + 0), bExists^0 -> 0, ni^0 -> (1 + ni^0), nj^0 -> 0}> <l22, l7, ((0 + 10) <= (0 + nj^0)) /\ (1 <= (0 + bDomain^0)) /\ ((0 + bExists^0) <= 0) /\ (0 <= (0 + bExists^0)) /\ ((0 + 10) <= (0 + (1 + ni^0))), par{bDomain^0 -> (0 + 0), ni^0 -> 0}> <l22, l22, ((0 + 10) <= (0 + nj^0)) /\ (1 <= (0 + bDomain^0)) /\ ((0 + bExists^0) <= 0) /\ (0 <= (0 + bExists^0)) /\ ((1 + (1 + ni^0)) <= (0 + 10)), par{bDomain^0 -> (0 + 0), bExists^0 -> 0, ni^0 -> (1 + ni^0), nj^0 -> 0}> <l22, l7, ((0 + 10) <= (0 + nj^0)) /\ (1 <= (0 + bDomain^0)) /\ (1 <= (0 + bExists^0)) /\ ((0 + 10) <= (0 + (1 + ni^0))), par{bDomain^0 -> (0 + 1), ni^0 -> 0}> <l22, l22, ((0 + 10) <= (0 + nj^0)) /\ (1 <= (0 + bDomain^0)) /\ (1 <= (0 + bExists^0)) /\ ((1 + (1 + ni^0)) <= (0 + 10)), par{bDomain^0 -> (0 + 1), bExists^0 -> 0, ni^0 -> (1 + ni^0), nj^0 -> 0}> <l22, l7, ((0 + 10) <= (0 + nj^0)) /\ (1 <= (0 + bDomain^0)) /\ ((1 + bExists^0) <= 0) /\ ((0 + 10) <= (0 + (1 + ni^0))), par{bDomain^0 -> (0 + 1), ni^0 -> 0}> popout

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

job log

popout

actions

all output return to Integ Trans Syste 27634