details

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

run statistics

property	value
solver	VeryMax-termCOMP17
configuration	termcomp17
runtime (wallclock)	0.937839031219 seconds
cpu usage	0.926710051
max memory	1.52154112E8

stage attributes

key	value
output-size	21531
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, l28, true> <l1, l2, ((1 + n^0) <= (0 + i^0))> <l1, l3, ((0 + i^0) <= (0 + n^0)) /\ (undef30 = undef30), par{maxarg1^0 -> (0 + scale^0), maxarg2^0 -> (0 + undef30), tmp^0 -> undef30}> <l4, l1, true> <l5, l6, true> <l7, l5, true> <l7, l5, true> <l7, l5, true> <l8, l9, ((1 + n^0) <= (0 + i^0)), par{j^0 -> (1 + j^0)}> <l8, l10, ((0 + i^0) <= (0 + n^0)), par{i^0 -> (1 + i^0)}> <l10, l8, true> <l11, l10, ((1 + n^0) <= (0 + i^0)) /\ (undef191 = undef191), par{tau^0 -> undef191}> <l11, l12, ((0 + i^0) <= (0 + n^0)) /\ (undef208 = undef208), par{i^0 -> (1 + i^0), sum^0 -> undef208}> <l12, l11, true> <l13, l14, ((1 + n^0) <= (0 + j^0))> <l13, l12, ((0 + j^0) <= (0 + n^0))> <l9, l13, true> <l15, l7, ((0 + n^0) <= (0 + k^0))> <l15, l4, ((1 + k^0) <= (0 + n^0)), par{scale^0 -> 0}> <l16, l9, true> <l17, l16, (undef359 = undef359) /\ (undef360 = undef360), par{sigma^0 -> (0 + (~(1) * undef360)), tmp___4^0 -> undef359, tmp___5^0 -> undef360}> <l17, l16, (undef375 = undef375) /\ (undef376 = undef376), par{sigma^0 -> (0 + undef376), tmp___2^0 -> undef375, tmp___3^0 -> undef376}> <l18, l15, true> <l19, l20, (undef410 = undef410), par{tmp___1^0 -> undef410}> <l20, l21, true, par{i^0 -> (1 + i^0), sum^0 -> ((0 + sum^0) + tmp___1^0)}> <l22, l19, (1 <= (0 + sqrarg^0))> <l22, l19, ((1 + sqrarg^0) <= 0)> <l22, l20, ((0 + sqrarg^0) <= 0) /\ (0 <= (0 + sqrarg^0)), par{tmp___1^0 -> 0}> <l23, l17, ((1 + n^0) <= (0 + i^0))> <l23, l22, ((0 + i^0) <= (0 + n^0)) /\ (undef513 = undef513), par{sqrarg^0 -> undef513}> <l21, l23, true> <l24, l21, ((1 + n^0) <= (0 + i^0))> <l24, l25, ((0 + i^0) <= (0 + n^0)), par{i^0 -> (1 + i^0)}> <l25, l24, true> <l14, l18, true, par{k^0 -> (1 + k^0)}> <l26, l18, (2 <= (0 + n^0))> <l2, l25, (1 <= (0 + scale^0))> <l2, l25, ((1 + scale^0) <= 0)> <l2, l14, ((0 + scale^0) <= 0) /\ (0 <= (0 + scale^0)), par{tmp___0^0 -> 0}> <l27, l4, true, par{i^0 -> (1 + i^0)}> <l3, l27, ((0 + maxarg1^0) <= (0 + maxarg2^0)), par{scale^0 -> (0 + maxarg2^0)}> <l3, l27, ((1 + maxarg2^0) <= (0 + maxarg1^0)), par{scale^0 -> (0 + maxarg1^0)}> <l28, l26, true> Fresh variables: undef30, undef191, undef208, undef359, undef360, undef375, undef376, undef410, undef513, Undef variables: undef30, undef191, undef208, undef359, undef360, undef375, undef376, undef410, undef513, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l6, (2 <= (0 + n^0)) /\ ((0 + n^0) <= (0 + k^0))> <l0, l6, (2 <= (0 + n^0)) /\ ((0 + n^0) <= (0 + k^0))> <l0, l6, (2 <= (0 + n^0)) /\ ((0 + n^0) <= (0 + k^0))> <l0, l4, (2 <= (0 + n^0)) /\ ((1 + k^0) <= (0 + n^0)), par{scale^0 -> 0}> <l4, l25, ((1 + n^0) <= (0 + i^0)) /\ (1 <= (0 + scale^0))> <l4, l25, ((1 + n^0) <= (0 + i^0)) /\ ((1 + scale^0) <= 0)> <l4, l6, ((1 + n^0) <= (0 + i^0)) /\ ((0 + scale^0) <= 0) /\ (0 <= (0 + scale^0)) /\ ((0 + n^0) <= (0 + (1 + k^0))), par{k^0 -> (1 + k^0)}> <l4, l6, ((1 + n^0) <= (0 + i^0)) /\ ((0 + scale^0) <= 0) /\ (0 <= (0 + scale^0)) /\ ((0 + n^0) <= (0 + (1 + k^0))), par{k^0 -> (1 + k^0)}> <l4, l6, ((1 + n^0) <= (0 + i^0)) /\ ((0 + scale^0) <= 0) /\ (0 <= (0 + scale^0)) /\ ((0 + n^0) <= (0 + (1 + k^0))), par{k^0 -> (1 + k^0)}> <l4, l4, ((1 + n^0) <= (0 + i^0)) /\ ((0 + scale^0) <= 0) /\ (0 <= (0 + scale^0)) /\ ((1 + (1 + k^0)) <= (0 + n^0)), par{k^0 -> (1 + k^0), scale^0 -> 0}> <l4, l4, ((0 + i^0) <= (0 + n^0)) /\ (undef30 = undef30) /\ ((0 + (0 + scale^0)) <= (0 + (0 + undef30))), par{i^0 -> (1 + i^0), scale^0 -> (0 + (0 + undef30))}> <l4, l4, ((0 + i^0) <= (0 + n^0)) /\ (undef30 = undef30) /\ ((1 + (0 + undef30)) <= (0 + (0 + scale^0))), par{i^0 -> (1 + i^0), scale^0 -> (0 + (0 + scale^0))}> <l10, l6, ((1 + n^0) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + (1 + j^0))) /\ ((0 + n^0) <= (0 + (1 + k^0))), par{j^0 -> (1 + j^0), k^0 -> (1 + k^0)}> <l10, l6, ((1 + n^0) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + (1 + j^0))) /\ ((0 + n^0) <= (0 + (1 + k^0))), par{j^0 -> (1 + j^0), k^0 -> (1 + k^0)}> <l10, l6, ((1 + n^0) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + (1 + j^0))) /\ ((0 + n^0) <= (0 + (1 + k^0))), par{j^0 -> (1 + j^0), k^0 -> (1 + k^0)}> <l10, l4, ((1 + n^0) <= (0 + i^0)) /\ ((1 + n^0) <= (0 + (1 + j^0))) /\ ((1 + (1 + k^0)) <= (0 + n^0)), par{j^0 -> (1 + j^0), k^0 -> (1 + k^0), scale^0 -> 0}> <l10, l12, ((1 + n^0) <= (0 + i^0)) /\ ((0 + (1 + j^0)) <= (0 + n^0)), par{j^0 -> (1 + j^0)}> <l10, l10, ((0 + i^0) <= (0 + n^0)), par{i^0 -> (1 + i^0)}> <l12, l10, ((1 + n^0) <= (0 + i^0)) /\ (undef191 = undef191)> <l12, l12, ((0 + i^0) <= (0 + n^0)) /\ (undef208 = undef208), par{i^0 -> (1 + i^0), sum^0 -> undef208}> <l21, l6, ((1 + n^0) <= (0 + i^0)) /\ (undef359 = undef359) /\ (undef360 = undef360) /\ ((1 + n^0) <= (0 + j^0)) /\ ((0 + n^0) <= (0 + (1 + k^0))), par{k^0 -> (1 + k^0)}> <l21, l6, ((1 + n^0) <= (0 + i^0)) /\ (undef359 = undef359) /\ (undef360 = undef360) /\ ((1 + n^0) <= (0 + j^0)) /\ ((0 + n^0) <= (0 + (1 + k^0))), par{k^0 -> (1 + k^0)}> <l21, l6, ((1 + n^0) <= (0 + i^0)) /\ (undef359 = undef359) /\ (undef360 = undef360) /\ ((1 + n^0) <= (0 + j^0)) /\ ((0 + n^0) <= (0 + (1 + k^0))), par{k^0 -> (1 + k^0)}> <l21, l4, ((1 + n^0) <= (0 + i^0)) /\ (undef359 = undef359) /\ (undef360 = undef360) /\ ((1 + n^0) <= (0 + j^0)) /\ ((1 + (1 + k^0)) <= (0 + n^0)), par{k^0 -> (1 + k^0), scale^0 -> 0}> <l21, l12, ((1 + n^0) <= (0 + i^0)) /\ (undef359 = undef359) /\ (undef360 = undef360) /\ ((0 + j^0) <= (0 + n^0))> popout

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

job log

popout

actions

all output return to Integ Trans Syste 27634