details

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

run statistics

property	value
solver	VeryMax-termCOMP17
configuration	termcomp17
runtime (wallclock)	0.0425238609314 seconds
cpu usage	0.036187044
max memory	7897088.0

stage attributes

key	value
output-size	3355
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, l7, true> <l1, l2, ((1 + x^0) <= (0 + ox^0))> <l1, l3, ((0 + ox^0) <= (0 + x^0))> <l4, l2, ((0 + c^0) <= 0)> <l4, l2, true, par{c^0 -> 1, ox^0 -> (0 + x^0)}> <l5, l4, ((0 + c^0) <= 0)> <l5, l1, (1 <= (0 + c^0))> <l2, l5, (1 <= (0 + x^0)), par{x^0 -> (~(1) + x^0)}> <l6, l2, ((0 + c^0) <= 0)> <l7, l6, true> Fresh variables: Undef variables: Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l2, ((0 + c^0) <= 0)> <l2, l2, (1 <= (0 + x^0)) /\ ((0 + c^0) <= 0) /\ ((0 + c^0) <= 0), par{x^0 -> (~(1) + x^0)}> <l2, l2, (1 <= (0 + x^0)) /\ ((0 + c^0) <= 0), par{c^0 -> 1, ox^0 -> (0 + (~(1) + x^0)), x^0 -> (~(1) + x^0)}> <l2, l2, (1 <= (0 + x^0)) /\ (1 <= (0 + c^0)) /\ ((1 + (~(1) + x^0)) <= (0 + ox^0)), par{x^0 -> (~(1) + x^0)}> <l2, l3, (1 <= (0 + x^0)) /\ (1 <= (0 + c^0)) /\ ((0 + ox^0) <= (0 + (~(1) + x^0))), par{x^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: <l2, l2, 1 <= x^0 /\ c^0 <= 0, {x^0 -> -1 + x^0, rest remain the same}> <l2, l2, 1 <= x^0 /\ c^0 <= 0, {c^0 -> 1, ox^0 -> -1 + x^0, x^0 -> -1 + x^0, rest remain the same}> <l2, l2, 1 <= c^0 /\ 1 <= x^0 /\ x^0 <= ox^0, {x^0 -> -1 + x^0, rest remain the same}> Variables: c^0, x^0, ox^0 Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 <l0, l2, c^0 <= 0, {all remain the same}> Graph 2 <l2, l3, 1 <= c^0 /\ 1 + ox^0 <= x^0 /\ 1 <= x^0, {x^0 -> -1 + x^0, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 3 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 popout

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

job log

popout

actions

all output return to Integ Trans Syste 27634