details

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

run statistics

property	value
solver	VeryMax-termCOMP17
configuration	termcomp17
runtime (wallclock)	4.51069879532 seconds
cpu usage	6.482342128
max memory	4.82996224E8

stage attributes

key	value
output-size	7863
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, l8, true> <l1, l2, (undef13 = (0 + cnt_20^0)) /\ (undef14 = (0 + cnt_25^0)) /\ (((0 + (~(1) * undef13)) + undef14) <= 0) /\ (undef6 = undef6) /\ (undef7 = undef7) /\ (undef1 = undef1), par{Result_4^0 -> undef1, lt_11^0 -> undef6, lt_12^0 -> undef7}> <l1, l3, (undef27 = (0 + cnt_20^0)) /\ (undef28 = (0 + cnt_25^0)) /\ (0 <= ((~(1) + (~(1) * undef27)) + undef28)) /\ (undef20 = undef20) /\ (undef21 = undef21) /\ (undef24 = undef24) /\ ((0 + undef24) <= 0) /\ (0 <= (0 + undef24)), par{lt_11^0 -> undef20, lt_12^0 -> undef21, tmp_9^0 -> undef24}> <l3, l1, true> <l1, l4, (undef53 = (0 + cnt_20^0)) /\ (undef54 = (0 + cnt_25^0)) /\ (0 <= ((~(1) + (~(1) * undef53)) + undef54)) /\ (undef46 = undef46) /\ (undef47 = undef47) /\ (undef50 = undef50), par{lt_11^0 -> undef46, lt_12^0 -> undef47, tmp_9^0 -> undef50}> <l4, l5, (undef56 = __disjvr_0^0) /\ (__disjvr_0^0 = undef56), par{__disjvr_0^0 -> undef56}> <l5, l6, (undef79 = (0 + cnt_20^0)) /\ (undef71 = undef71), par{lt_10^0 -> undef71}> <l6, l1, true> <l7, l1, (undef103 = undef103) /\ (undef102 = undef102), par{p2_8^0 -> (0 + undef103), p_7^0 -> (0 + undef102), x_5^0 -> undef102, y_6^0 -> undef103}> <l8, l7, true> Fresh variables: undef1, undef6, undef7, undef13, undef14, undef20, undef21, undef24, undef27, undef28, undef46, undef47, undef50, undef53, undef54, undef56, undef71, undef79, undef102, undef103, Undef variables: undef1, undef6, undef7, undef13, undef14, undef20, undef21, undef24, undef27, undef28, undef46, undef47, undef50, undef53, undef54, undef56, undef71, undef79, undef102, undef103, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l1, (undef103 = undef103) /\ (undef102 = undef102)> <l1, l2, (undef13 = (0 + cnt_20^0)) /\ (undef14 = (0 + cnt_25^0)) /\ (((0 + (~(1) * undef13)) + undef14) <= 0) /\ (undef6 = undef6) /\ (undef7 = undef7) /\ (undef1 = undef1)> <l1, l1, (undef27 = (0 + cnt_20^0)) /\ (undef28 = (0 + cnt_25^0)) /\ (0 <= ((~(1) + (~(1) * undef27)) + undef28)) /\ (undef20 = undef20) /\ (undef21 = undef21) /\ (undef24 = undef24) /\ ((0 + undef24) <= 0) /\ (0 <= (0 + undef24))> <l1, l1, (undef53 = (0 + cnt_20^0)) /\ (undef54 = (0 + cnt_25^0)) /\ (0 <= ((~(1) + (~(1) * undef53)) + undef54)) /\ (undef46 = undef46) /\ (undef47 = undef47) /\ (undef50 = undef50) /\ (undef56 = __disjvr_0^0) /\ (__disjvr_0^0 = undef56) /\ (undef79 = (0 + cnt_20^0)) /\ (undef71 = undef71), par{__disjvr_0^0 -> undef56}> Fresh variables: undef1, undef6, undef7, undef13, undef14, undef20, undef21, undef24, undef27, undef28, undef46, undef47, undef50, undef53, undef54, undef56, undef71, undef79, undef102, undef103, Undef variables: undef1, undef6, undef7, undef13, undef14, undef20, undef21, undef24, undef27, undef28, undef46, undef47, undef50, undef53, undef54, undef56, undef71, undef79, undef102, undef103, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: <l1, l1, 1 + undef27 <= undef28 /\ cnt_20^0 = undef27 /\ cnt_25^0 = undef28 /\ undef24 = 0, {all remain the same}> <l1, l1, 1 + undef53 <= undef54 /\ __disjvr_0^0 = undef56 /\ cnt_20^0 = undef53 /\ cnt_20^0 = undef79 /\ cnt_25^0 = undef54, {__disjvr_0^0 -> undef56, rest remain the same}> Variables: cnt_20^0, cnt_25^0, __disjvr_0^0 Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 <l0, l1, true, {all remain the same}> Graph 2 <l1, l2, undef14 <= undef13 /\ cnt_20^0 = undef13 /\ cnt_25^0 = undef14, {all remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 1 , 1 ) ( 2 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* popout

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

job log

popout

actions

all output return to Integ Trans Syste 27634