details

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

run statistics

property	value
solver	VeryMax-termCOMP17
configuration	termcomp17
runtime (wallclock)	4.94942498207 seconds
cpu usage	7.553742713
max memory	6.88218112E8

stage attributes

key	value
output-size	8395
starexec-result	NO

output

/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- NO Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: <l0, l7, true> <l1, l2, true> <l1, l3, (undef12 = undef12), par{fvalue3^0 -> undef12, up5^0 -> (~(1) + low6^0)}> <l1, l2, true> <l4, l5, ((1 + up5^0) <= (0 + low6^0)) /\ (undef33 = (0 + fvalue3^0)), par{ret_binary_search7^0 -> undef33, tmp^0 -> (0 + undef33)}> <l4, l1, ((0 + low6^0) <= (0 + up5^0)) /\ (undef41 = undef41), par{mid4^0 -> undef41}> <l3, l4, true> <l2, l3, true, par{low6^0 -> (1 + mid4^0)}> <l2, l3, true, par{up5^0 -> (~(1) + mid4^0)}> <l6, l3, true, par{fvalue3^0 -> ~(1), low6^0 -> 0, up5^0 -> (0 + __const_14^0), x2^0 -> (0 + __const_8^0)}> <l7, l6, true> Fresh variables: undef12, undef33, undef41, Undef variables: undef12, undef33, undef41, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l3, (fvalue3^0 = ~(1)) /\ (low6^0 = 0) /\ (up5^0 = (0 + __const_14^0))> <l3, l5, ((1 + up5^0) <= (0 + low6^0)) /\ (undef33 = (0 + fvalue3^0))> <l3, l3, ((0 + low6^0) <= (0 + up5^0)) /\ (undef41 = undef41), par{low6^0 -> (1 + undef41)}> <l3, l3, ((0 + low6^0) <= (0 + up5^0)) /\ (undef41 = undef41), par{up5^0 -> (~(1) + undef41)}> <l3, l3, ((0 + low6^0) <= (0 + up5^0)) /\ (undef41 = undef41) /\ (undef12 = undef12), par{fvalue3^0 -> undef12, up5^0 -> (~(1) + low6^0)}> <l3, l3, ((0 + low6^0) <= (0 + up5^0)) /\ (undef41 = undef41), par{low6^0 -> (1 + undef41)}> <l3, l3, ((0 + low6^0) <= (0 + up5^0)) /\ (undef41 = undef41), par{up5^0 -> (~(1) + undef41)}> Fresh variables: undef12, undef33, undef41, Undef variables: undef12, undef33, undef41, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: <l3, l3, low6^0 <= up5^0, {low6^0 -> 1 + undef41, rest remain the same}> <l3, l3, low6^0 <= up5^0, {up5^0 -> -1 + undef41, rest remain the same}> <l3, l3, low6^0 <= up5^0, {fvalue3^0 -> undef12, up5^0 -> -1 + low6^0, rest remain the same}> <l3, l3, low6^0 <= up5^0, {low6^0 -> 1 + undef41, rest remain the same}> <l3, l3, low6^0 <= up5^0, {up5^0 -> -1 + undef41, rest remain the same}> Variables: low6^0, up5^0, fvalue3^0 Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 <l0, l3, 1 + fvalue3^0 = 0 /\ __const_14^0 = up5^0 /\ low6^0 = 0, {all remain the same}> Graph 2 <l3, l5, 1 + up5^0 <= low6^0 /\ fvalue3^0 = undef33, {all remain the same}> Map Locations to Subgraph: ( 0 , 0 ) popout

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

job log

popout

actions

all output return to Integ Trans Syste 27634