details

property	value
status	complete
benchmark	ludcmp.c.i.ludcmp.pl.t2.fixed.t2.smt2
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n038.star.cs.uiowa.edu
space	From_T2

run statistics

property	value
solver	VeryMax-termCOMP17
configuration	termcomp17
runtime (wallclock)	0.450788021088 seconds
cpu usage	0.446375025
max memory	5.6311808E7

stage attributes

key	value
output-size	20047
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: <l0, l33, true> <l1, l2, ((1 + n^0) <= (0 + j^0))> <l1, l3, ((0 + j^0) <= (0 + n^0)) /\ (undef21 = undef21), par{temp^0 -> (0 + undef21), tmp^0 -> undef21}> <l4, l1, true> <l5, l6, true, par{j^0 -> (1 + j^0)}> <l7, l5, ((1 + n^0) <= (0 + i^0))> <l7, l8, ((0 + i^0) <= (0 + n^0)), par{i^0 -> (1 + i^0)}> <l8, l7, true> <l9, l8, (undef79 = undef79), par{dum^0 -> undef79}> <l10, l5, ((0 + j^0) <= (0 + n^0)) /\ ((0 + n^0) <= (0 + j^0))> <l10, l9, ((1 + n^0) <= (0 + j^0))> <l10, l9, ((1 + j^0) <= (0 + n^0))> <l11, l10, true> <l11, l10, true> <l11, l10, true> <l12, l11, true> <l13, l12, ((1 + n^0) <= (0 + k^0))> <l13, l14, ((0 + k^0) <= (0 + n^0)) /\ (undef178 = undef178), par{dum^0 -> undef178, k^0 -> (1 + k^0)}> <l14, l13, true> <l15, l12, ((0 + j^0) <= (0 + imax^0)) /\ ((0 + imax^0) <= (0 + j^0))> <l15, l14, ((1 + imax^0) <= (0 + j^0))> <l15, l14, ((1 + j^0) <= (0 + imax^0))> <l16, l17, true, par{i^0 -> (1 + i^0)}> <l18, l16, ((1 + dum^0) <= (0 + big^0))> <l18, l16, ((0 + big^0) <= (0 + dum^0)), par{big^0 -> (0 + dum^0), imax^0 -> (0 + i^0)}> <l19, l6, ((1 + n^0) <= (0 + i^0))> <l19, l4, ((0 + i^0) <= (0 + n^0)), par{big^0 -> 0}> <l20, l18, ((0 + j^0) <= (0 + k^0)) /\ (undef297 = undef297) /\ (undef288 = undef288), par{dum^0 -> undef288, tmp___0^0 -> undef297}> <l20, l21, ((1 + k^0) <= (0 + j^0)) /\ (undef305 = undef305), par{k^0 -> (1 + k^0), sum^0 -> undef305}> <l21, l20, true> <l22, l15, ((1 + n^0) <= (0 + i^0))> <l22, l21, ((0 + i^0) <= (0 + n^0)) /\ (undef338 = undef338), par{sum^0 -> undef338}> <l23, l19, true> <l17, l22, true> <l24, l25, ((0 + i^0) <= (0 + k^0)), par{i^0 -> (1 + i^0)}> <l24, l26, ((1 + k^0) <= (0 + i^0)) /\ (undef382 = undef382), par{k^0 -> (1 + k^0), sum^0 -> undef382}> <l26, l24, true> <l27, l17, ((0 + j^0) <= (0 + i^0)), par{big^0 -> 0}> <l27, l26, ((1 + i^0) <= (0 + j^0)) /\ (undef415 = undef415), par{sum^0 -> undef415}> <l25, l27, true> <l28, l29, ((1 + n^0) <= (0 + j^0))> <l28, l25, ((0 + j^0) <= (0 + n^0))> <l6, l28, true> <l30, l23, true> <l31, l23, true, par{i^0 -> (1 + i^0)}> <l2, l31, (1 <= (0 + big^0))> <l2, l31, ((1 + big^0) <= 0)> <l2, l31, ((0 + big^0) <= 0) /\ (0 <= (0 + big^0))> <l32, l4, true, par{j^0 -> (1 + j^0)}> <l3, l32, ((0 + temp^0) <= (0 + big^0))> <l3, l32, ((1 + big^0) <= (0 + temp^0)), par{big^0 -> (0 + temp^0)}> <l33, l30, true> Fresh variables: undef21, undef79, undef178, undef288, undef297, undef305, undef338, undef382, undef415, Undef variables: undef21, undef79, undef178, undef288, undef297, undef305, undef338, undef382, undef415, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l29, ((1 + n^0) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + j^0))> <l0, l10, ((1 + n^0) <= (0 + i^0)) /\ ((0 + j^0) <= (0 + n^0)) /\ ((0 + j^0) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + i^0)) /\ ((0 + j^0) <= (0 + imax^0)) /\ ((0 + imax^0) <= (0 + j^0)), par{big^0 -> 0}> <l0, l10, ((1 + n^0) <= (0 + i^0)) /\ ((0 + j^0) <= (0 + n^0)) /\ ((0 + j^0) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + i^0)) /\ ((0 + j^0) <= (0 + imax^0)) /\ ((0 + imax^0) <= (0 + j^0)), par{big^0 -> 0}> <l0, l10, ((1 + n^0) <= (0 + i^0)) /\ ((0 + j^0) <= (0 + n^0)) /\ ((0 + j^0) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + i^0)) /\ ((0 + j^0) <= (0 + imax^0)) /\ ((0 + imax^0) <= (0 + j^0)), par{big^0 -> 0}> <l0, l14, ((1 + n^0) <= (0 + i^0)) /\ ((0 + j^0) <= (0 + n^0)) /\ ((0 + j^0) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + i^0)) /\ ((1 + imax^0) <= (0 + j^0)), par{big^0 -> 0}> <l0, l14, ((1 + n^0) <= (0 + i^0)) /\ ((0 + j^0) <= (0 + n^0)) /\ ((0 + j^0) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + i^0)) /\ ((1 + j^0) <= (0 + imax^0)), par{big^0 -> 0}> <l0, l4, ((0 + i^0) <= (0 + n^0)), par{big^0 -> 0}> <l4, l29, ((1 + n^0) <= (0 + j^0)) /\ (1 <= (0 + big^0)) /\ ((1 + n^0) <= (0 + (1 + i^0))) /\ ((1 + n^0) <= (0 + j^0)), par{i^0 -> (1 + i^0)}> <l4, l4, ((1 + n^0) <= (0 + j^0)) /\ (1 <= (0 + big^0)) /\ ((0 + (1 + i^0)) <= (0 + n^0)), par{big^0 -> 0, i^0 -> (1 + i^0)}> <l4, l29, ((1 + n^0) <= (0 + j^0)) /\ ((1 + big^0) <= 0) /\ ((1 + n^0) <= (0 + (1 + i^0))) /\ ((1 + n^0) <= (0 + j^0)), par{i^0 -> (1 + i^0)}> <l4, l4, ((1 + n^0) <= (0 + j^0)) /\ ((1 + big^0) <= 0) /\ ((0 + (1 + i^0)) <= (0 + n^0)), par{big^0 -> 0, i^0 -> (1 + i^0)}> <l4, l29, ((1 + n^0) <= (0 + j^0)) /\ ((0 + big^0) <= 0) /\ (0 <= (0 + big^0)) /\ ((1 + n^0) <= (0 + (1 + i^0))) /\ ((1 + n^0) <= (0 + j^0)), par{i^0 -> (1 + i^0)}> <l4, l4, ((1 + n^0) <= (0 + j^0)) /\ ((0 + big^0) <= 0) /\ (0 <= (0 + big^0)) /\ ((0 + (1 + i^0)) <= (0 + n^0)), par{big^0 -> 0, i^0 -> (1 + i^0)}> <l4, l4, ((0 + j^0) <= (0 + n^0)) /\ (undef21 = undef21) /\ ((0 + (0 + undef21)) <= (0 + big^0)), par{j^0 -> (1 + j^0)}> <l4, l4, ((0 + j^0) <= (0 + n^0)) /\ (undef21 = undef21) /\ ((1 + big^0) <= (0 + (0 + undef21))), par{big^0 -> (0 + (0 + undef21)), j^0 -> (1 + j^0)}> <l8, l29, ((1 + n^0) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + (1 + j^0))), par{j^0 -> (1 + j^0)}> popout

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

job log

popout

actions

all output return to Integ Trans Syste 27634