details

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

run statistics

property	value
solver	VeryMax-termCOMP17
configuration	termcomp17
runtime (wallclock)	41.4144408703 seconds
cpu usage	84.646388587
max memory	6.5091584E8

stage attributes

key	value
output-size	40170
starexec-result	NO

output

/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: <l0, l10, true> <l1, l2, true> <l3, l4, (1 <= (0 + choice^0)), par{walker^0 -> (1 + walker^0)}> <l3, l4, ((0 + choice^0) <= 0), par{walker^0 -> (~(1) + walker^0)}> <l5, l4, (undef26 = 1) /\ (undef28 = undef28) /\ (0 <= (0 + undef28)) /\ (undef22 = undef22) /\ ((0 + undef22) <= 2) /\ (2 <= (0 + undef22)), par{N^0 -> undef22, i^0 -> (0 + undef26), pos^0 -> 0, seq^0 -> undef26, walker^0 -> 1, z^0 -> undef28}> <l6, l3, ((0 + i^0) <= 0) /\ (undef33 = (1 + seq^0)) /\ (undef35 = undef35) /\ (0 <= (0 + undef35)), par{i^0 -> (0 + undef33), seq^0 -> undef33, z^0 -> undef35}> <l6, l3, (1 <= (0 + i^0)) /\ ((0 + choice^0) <= 0), par{i^0 -> (~(1) + i^0)}> <l7, l3, (1 <= (0 + z^0)), par{z^0 -> (~(1) + z^0)}> <l7, l6, ((0 + z^0) <= 0)> <l8, l1, ((1 + walker^0) <= 1)> <l8, l7, (1 <= (0 + walker^0)) /\ (undef65 = undef65) /\ (0 <= (0 + undef65)) /\ ((0 + undef65) <= 1), par{choice^0 -> undef65}> <l9, l1, ((1 + N^0) <= (0 + walker^0))> <l9, l8, ((0 + walker^0) <= (0 + N^0))> <l4, l9, true> <l10, l5, true> Fresh variables: undef22, undef26, undef28, undef33, undef35, undef65, Undef variables: undef22, undef26, undef28, undef33, undef35, undef65, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l4, (N^0 = undef22) /\ (i^0 = (0 + undef26)) /\ (seq^0 = undef26) /\ (walker^0 = 1) /\ (z^0 = undef28) /\ (undef26 = 1) /\ (undef28 = undef28) /\ (0 <= (0 + undef28)) /\ (undef22 = undef22) /\ ((0 + undef22) <= 2) /\ (2 <= (0 + undef22))> <l4, l2, ((1 + N^0) <= (0 + walker^0))> <l4, l2, ((0 + walker^0) <= (0 + N^0)) /\ ((1 + walker^0) <= 1)> <l4, l4, ((0 + walker^0) <= (0 + N^0)) /\ (1 <= (0 + walker^0)) /\ (undef65 = undef65) /\ (0 <= (0 + undef65)) /\ ((0 + undef65) <= 1) /\ (1 <= (0 + z^0)) /\ (1 <= (0 + undef65)), par{walker^0 -> (1 + walker^0), z^0 -> (~(1) + z^0)}> <l4, l4, ((0 + walker^0) <= (0 + N^0)) /\ (1 <= (0 + walker^0)) /\ (undef65 = undef65) /\ (0 <= (0 + undef65)) /\ ((0 + undef65) <= 1) /\ (1 <= (0 + z^0)) /\ ((0 + undef65) <= 0), par{walker^0 -> (~(1) + walker^0), z^0 -> (~(1) + z^0)}> <l4, l4, ((0 + walker^0) <= (0 + N^0)) /\ (1 <= (0 + walker^0)) /\ (undef65 = undef65) /\ (0 <= (0 + undef65)) /\ ((0 + undef65) <= 1) /\ ((0 + z^0) <= 0) /\ ((0 + i^0) <= 0) /\ (undef33 = (1 + seq^0)) /\ (undef35 = undef35) /\ (0 <= (0 + undef35)) /\ (1 <= (0 + undef65)), par{i^0 -> (0 + undef33), seq^0 -> undef33, walker^0 -> (1 + walker^0), z^0 -> undef35}> <l4, l4, ((0 + walker^0) <= (0 + N^0)) /\ (1 <= (0 + walker^0)) /\ (undef65 = undef65) /\ (0 <= (0 + undef65)) /\ ((0 + undef65) <= 1) /\ ((0 + z^0) <= 0) /\ ((0 + i^0) <= 0) /\ (undef33 = (1 + seq^0)) /\ (undef35 = undef35) /\ (0 <= (0 + undef35)) /\ ((0 + undef65) <= 0), par{i^0 -> (0 + undef33), seq^0 -> undef33, walker^0 -> (~(1) + walker^0), z^0 -> undef35}> <l4, l4, ((0 + walker^0) <= (0 + N^0)) /\ (1 <= (0 + walker^0)) /\ (undef65 = undef65) /\ (0 <= (0 + undef65)) /\ ((0 + undef65) <= 1) /\ ((0 + z^0) <= 0) /\ (1 <= (0 + i^0)) /\ ((0 + undef65) <= 0) /\ ((0 + undef65) <= 0), par{i^0 -> (~(1) + i^0), walker^0 -> (~(1) + walker^0)}> Fresh variables: undef22, undef26, undef28, undef33, undef35, undef65, Undef variables: undef22, undef26, undef28, undef33, undef35, undef65, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: <l4, l4, 1 <= walker^0 /\ 1 <= z^0 /\ walker^0 <= N^0 /\ undef65 = 1, {walker^0 -> 1 + walker^0, z^0 -> -1 + z^0, rest remain the same}> <l4, l4, 1 <= walker^0 /\ 1 <= z^0 /\ walker^0 <= N^0 /\ undef65 = 0, {walker^0 -> -1 + walker^0, z^0 -> -1 + z^0, rest remain the same}> <l4, l4, 1 <= walker^0 /\ walker^0 <= N^0 /\ i^0 <= 0 /\ z^0 <= 0 /\ 0 <= undef35 /\ 1 + seq^0 = undef33 /\ undef65 = 1, {i^0 -> undef33, seq^0 -> undef33, walker^0 -> 1 + walker^0, z^0 -> undef35, rest remain the same}> <l4, l4, 1 <= walker^0 /\ walker^0 <= N^0 /\ i^0 <= 0 /\ z^0 <= 0 /\ 0 <= undef35 /\ 1 + seq^0 = undef33 /\ undef65 = 0, {i^0 -> undef33, seq^0 -> undef33, walker^0 -> -1 + walker^0, z^0 -> undef35, rest remain the same}> <l4, l4, 1 <= i^0 /\ 1 <= walker^0 /\ walker^0 <= N^0 /\ z^0 <= 0 /\ undef65 = 0, {i^0 -> -1 + i^0, walker^0 -> -1 + walker^0, rest remain the same}> Variables: N^0, walker^0, z^0, i^0, seq^0 Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 <l0, l4, 0 <= undef28 /\ N^0 = undef22 /\ i^0 = undef26 /\ seq^0 = undef26 /\ z^0 = undef28 /\ walker^0 = 1 /\ undef26 = 1 /\ undef22 = 2, {all 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