details

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

run statistics

property	value
solver	VeryMax-termCOMP17
configuration	termcomp17
runtime (wallclock)	0.105635881424 seconds
cpu usage	0.074580279
max memory	9891840.0

stage attributes

key	value
output-size	5570
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, l19, true> <l1, l2, ((0 + __const_1000^0) <= (0 + i^0)), par{i^0 -> 0}> <l1, l3, ((1 + i^0) <= (0 + __const_1000^0)), par{i2^0 -> (0 + i^0)}> <l4, l2, true, par{i^0 -> (1 + i^0)}> <l5, l6, true> <l6, l4, true> <l7, l1, true> <l8, l5, true> <l8, l5, true> <l8, l6, true> <l9, l8, (undef40 = undef40), par{r^0 -> undef40}> <l10, l9, true> <l10, l4, true> <l10, l9, true> <l11, l12, ((0 + __const_1000^0) <= (0 + i^0))> <l11, l10, ((1 + i^0) <= (0 + __const_1000^0))> <l13, l7, true, par{i^0 -> (1 + i^0)}> <l2, l11, true> <l14, l15, true> <l15, l13, true> <l16, l14, true> <l16, l14, true> <l16, l15, true> <l17, l16, true> <l3, l17, true> <l3, l13, true> <l3, l17, true> <l18, l7, (undef109 = 0), par{i^0 -> 0}> <l19, l18, true> Fresh variables: undef40, undef109, Undef variables: undef40, undef109, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l7, (i^0 = 0) /\ (undef109 = 0)> <l2, l12, ((0 + __const_1000^0) <= (0 + i^0))> <l2, l2, ((1 + i^0) <= (0 + __const_1000^0)) /\ (undef40 = undef40), par{i^0 -> (1 + i^0)}> <l2, l2, ((1 + i^0) <= (0 + __const_1000^0)) /\ (undef40 = undef40), par{i^0 -> (1 + i^0)}> <l2, l2, ((1 + i^0) <= (0 + __const_1000^0)) /\ (undef40 = undef40), par{i^0 -> (1 + i^0)}> <l2, l2, ((1 + i^0) <= (0 + __const_1000^0)), par{i^0 -> (1 + i^0)}> <l2, l2, ((1 + i^0) <= (0 + __const_1000^0)) /\ (undef40 = undef40), par{i^0 -> (1 + i^0)}> <l2, l2, ((1 + i^0) <= (0 + __const_1000^0)) /\ (undef40 = undef40), par{i^0 -> (1 + i^0)}> <l2, l2, ((1 + i^0) <= (0 + __const_1000^0)) /\ (undef40 = undef40), par{i^0 -> (1 + i^0)}> <l7, l2, ((0 + __const_1000^0) <= (0 + i^0)), par{i^0 -> 0}> <l7, l7, ((1 + i^0) <= (0 + __const_1000^0)), par{i^0 -> (1 + i^0)}> <l7, l7, ((1 + i^0) <= (0 + __const_1000^0)), par{i^0 -> (1 + i^0)}> <l7, l7, ((1 + i^0) <= (0 + __const_1000^0)), par{i^0 -> (1 + i^0)}> <l7, l7, ((1 + i^0) <= (0 + __const_1000^0)), par{i^0 -> (1 + i^0)}> <l7, l7, ((1 + i^0) <= (0 + __const_1000^0)), par{i^0 -> (1 + i^0)}> <l7, l7, ((1 + i^0) <= (0 + __const_1000^0)), par{i^0 -> (1 + i^0)}> <l7, l7, ((1 + i^0) <= (0 + __const_1000^0)), par{i^0 -> (1 + i^0)}> Fresh variables: undef40, undef109, Undef variables: undef40, undef109, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: popout

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

job log

popout

actions

all output return to Integ Trans Syste 27634