details

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

run statistics

property	value
solver	VeryMax-termCOMP17
configuration	termcomp17
runtime (wallclock)	0.0802569389343 seconds
cpu usage	0.076460737
max memory	1.6580608E7

stage attributes

key	value
output-size	5209
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, l9, true> <l1, l2, ((1 + y^0) <= 0)> <l1, l2, ((0 + oy^0) <= (0 + y^0))> <l3, l1, ((1 + x^0) <= 0)> <l3, l1, ((0 + ox^0) <= (0 + x^0))> <l3, l4, true, par{x^0 -> (0 + x^0)}> <l5, l4, ((0 + c^0) <= 0)> <l5, l4, true, par{c^0 -> 1, ox^0 -> (0 + x^0), oy^0 -> (0 + y^0)}> <l6, l5, ((0 + c^0) <= 0)> <l6, l3, (1 <= (0 + c^0))> <l7, l6, true, par{y^0 -> (~(1) + y^0)}> <l7, l6, true, par{x^0 -> (~(1) + x^0)}> <l4, l7, (1 <= (0 + x^0)) /\ (1 <= (0 + y^0))> <l8, l4, ((0 + c^0) <= 0)> <l9, l8, true> Fresh variables: Undef variables: Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l4, ((0 + c^0) <= 0)> <l4, l4, (1 <= (0 + x^0)) /\ (1 <= (0 + y^0)) /\ ((0 + c^0) <= 0) /\ ((0 + c^0) <= 0), par{y^0 -> (~(1) + y^0)}> <l4, l4, (1 <= (0 + x^0)) /\ (1 <= (0 + y^0)) /\ ((0 + c^0) <= 0), par{c^0 -> 1, ox^0 -> (0 + x^0), oy^0 -> (0 + (~(1) + y^0)), y^0 -> (~(1) + y^0)}> <l4, l2, (1 <= (0 + x^0)) /\ (1 <= (0 + y^0)) /\ (1 <= (0 + c^0)) /\ ((0 + ox^0) <= (0 + x^0)) /\ ((0 + oy^0) <= (0 + (~(1) + y^0))), par{y^0 -> (~(1) + y^0)}> <l4, l4, (1 <= (0 + x^0)) /\ (1 <= (0 + y^0)) /\ (1 <= (0 + c^0)), par{x^0 -> (0 + x^0), y^0 -> (~(1) + y^0)}> <l4, l4, (1 <= (0 + x^0)) /\ (1 <= (0 + y^0)) /\ ((0 + c^0) <= 0) /\ ((0 + c^0) <= 0), par{x^0 -> (~(1) + x^0)}> <l4, l4, (1 <= (0 + x^0)) /\ (1 <= (0 + y^0)) /\ ((0 + c^0) <= 0), par{c^0 -> 1, ox^0 -> (0 + (~(1) + x^0)), oy^0 -> (0 + y^0), x^0 -> (~(1) + x^0)}> <l4, l2, (1 <= (0 + x^0)) /\ (1 <= (0 + y^0)) /\ (1 <= (0 + c^0)) /\ ((0 + ox^0) <= (0 + (~(1) + x^0))) /\ ((0 + oy^0) <= (0 + y^0)), par{x^0 -> (~(1) + x^0)}> <l4, l4, (1 <= (0 + x^0)) /\ (1 <= (0 + y^0)) /\ (1 <= (0 + c^0)), par{x^0 -> (0 + (~(1) + x^0))}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: <l4, l4, 1 <= x^0 /\ 1 <= y^0 /\ c^0 <= 0, {y^0 -> -1 + y^0, rest remain the same}> <l4, l4, 1 <= x^0 /\ 1 <= y^0 /\ c^0 <= 0, {c^0 -> 1, ox^0 -> x^0, oy^0 -> -1 + y^0, y^0 -> -1 + y^0, rest remain the same}> <l4, l4, 1 <= c^0 /\ 1 <= x^0 /\ 1 <= y^0, {y^0 -> -1 + y^0, rest remain the same}> <l4, l4, 1 <= x^0 /\ 1 <= y^0 /\ c^0 <= 0, {x^0 -> -1 + x^0, rest remain the same}> <l4, l4, 1 <= x^0 /\ 1 <= y^0 /\ c^0 <= 0, {c^0 -> 1, ox^0 -> -1 + x^0, oy^0 -> y^0, x^0 -> -1 + x^0, rest remain the same}> <l4, l4, 1 <= c^0 /\ 1 <= x^0 /\ 1 <= y^0, {x^0 -> -1 + x^0, rest remain the same}> Variables: c^0, x^0, y^0, ox^0, oy^0 Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 <l0, l4, c^0 <= 0, {all remain the same}> Graph 2 <l4, l2, 1 <= c^0 /\ 1 + oy^0 <= y^0 /\ 1 <= x^0 /\ 1 <= y^0 /\ ox^0 <= x^0, {y^0 -> -1 + y^0, rest remain the same}> popout

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

job log

popout

actions

all output return to Integ Trans Syste 27634