details

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

run statistics

property	value
solver	VeryMax-termCOMP17
configuration	termcomp17
runtime (wallclock)	25.3926241398 seconds
cpu usage	49.631584608
max memory	8.840192E8

stage attributes

key	value
output-size	12439
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, l6, true> <l1, l2, (undef3 = 0) /\ (0 <= (0 + undef3)) /\ ((0 + undef3) <= 0), par{i_13^0 -> undef3}> <l3, l2, ((1 + i_13^0) <= (0 + __const_10^0)) /\ (undef13 = (~(1) + i_13^0)) /\ (undef9 = undef9) /\ (~(1) <= (0 + undef9)) /\ ((0 + undef9) <= ~(1)) /\ (undef8 = undef8) /\ ((0 + undef8) <= (0 + undef9)) /\ ((0 + undef9) <= (0 + undef8)), par{a_19^0 -> undef8, i_13^0 -> undef9}> <l2, l4, ((0 + __const_10^0) <= (0 + i_13^0)), par{rt_11^0 -> (0 + st_14^0)}> <l2, l5, (undef23 = undef23) /\ ((1 + i_13^0) <= (0 + __const_10^0)) /\ (undef22 = (~(1) + i_13^0)) /\ ((0 + undef22) <= (~(1) + undef23)) /\ ((~(1) + undef23) <= (0 + undef22)) /\ ((1 + undef23) <= (0 + __const_10^0)), par{i_13^0 -> undef22, i_20^0 -> undef23}> <l5, l2, true> <l6, l1, true> Fresh variables: undef3, undef8, undef9, undef13, undef22, undef23, Undef variables: undef3, undef8, undef9, undef13, undef22, undef23, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l2, (i_13^0 = undef3) /\ (undef3 = 0) /\ (0 <= (0 + undef3)) /\ ((0 + undef3) <= 0)> <l2, l4, ((0 + __const_10^0) <= (0 + i_13^0))> <l2, l2, (undef23 = undef23) /\ ((1 + i_13^0) <= (0 + __const_10^0)) /\ (undef22 = (~(1) + i_13^0)) /\ ((0 + undef22) <= (~(1) + undef23)) /\ ((~(1) + undef23) <= (0 + undef22)) /\ ((1 + undef23) <= (0 + __const_10^0)), par{i_13^0 -> undef22}> Fresh variables: undef3, undef8, undef9, undef13, undef22, undef23, Undef variables: undef3, undef8, undef9, undef13, undef22, undef23, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: <l2, l2, 1 + i_13^0 <= __const_10^0 /\ 1 + undef23 <= __const_10^0 /\ 1 + undef22 = undef23 /\ i_13^0 = 1 + undef22, {i_13^0 -> undef22, rest remain the same}> Variables: __const_10^0, i_13^0 Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 <l0, l2, i_13^0 = undef3 /\ undef3 = 0, {all remain the same}> Graph 2 <l2, l4, __const_10^0 <= i_13^0, {all remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 4 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.002167 popout

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

job log

popout

actions

all output return to Integ Trans Syste 27634