details

property	value
status	complete
benchmark	Test8.jar-obl-12.smt2
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n034.star.cs.uiowa.edu
space	From_AProVE_2014

run statistics

property	value
solver	VeryMax-termCOMP17
configuration	termcomp17
runtime (wallclock)	0.124199151993 seconds
cpu usage	0.241856865
max memory	2.2069248E7

stage attributes

key	value
output-size	10800
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, (undef1 <= arg1) /\ (arg2 > ~(1)) /\ (arg1 > 0) /\ (undef1 > 0), par{arg1 -> undef1, arg2 -> (arg2 - 1), arg3 -> arg2, arg4 -> arg2}> <l2, l2, (undef5 <= arg1) /\ (arg3 > 0) /\ (arg1 > 0) /\ (undef5 > 0), par{arg1 -> undef5, arg2 -> (arg2 - 1), arg3 -> arg2}> <l2, l3, (arg3 < 1) /\ (arg4 > ~(1)) /\ (arg1 >= undef9) /\ (arg1 > 0) /\ (undef9 > 0), par{arg1 -> undef9, arg2 -> (arg4 - 1), arg3 -> arg4}> <l3, l3, (undef13 <= arg1) /\ (arg3 > 0) /\ (arg1 > 0) /\ (undef13 > 0), par{arg1 -> undef13, arg2 -> (arg2 - 1), arg3 -> arg2}> <l3, l4, (arg3 < 1) /\ (arg4 > ~(1)) /\ (arg1 > 0), par{arg1 -> (arg4 - 1), arg2 -> arg4, arg3 -> undef19, arg4 -> undef20}> <l4, l5, (arg2 < 1), par{arg1 -> 2, arg2 -> undef22, arg3 -> undef23, arg4 -> undef24}> <l4, l4, (arg2 > 0), par{arg1 -> (arg1 - 1), arg2 -> arg1, arg3 -> undef27, arg4 -> undef28}> <l5, l6, (arg1 > ~(1)) /\ (undef29 > ~(1)) /\ (arg1 < 3), par{arg1 -> undef29, arg2 -> undef30, arg3 -> undef31, arg4 -> undef32}> <l5, l5, (arg1 > ~(1)) /\ (arg1 < 3), par{arg1 -> (arg1 - 1), arg2 -> undef34, arg3 -> undef35, arg4 -> undef36}> <l6, l6, ((undef37 + 1) <= arg1) /\ (arg1 > 0) /\ (undef37 > ~(1)), par{arg1 -> undef37, arg2 -> undef38, arg3 -> undef39, arg4 -> undef40}> <l7, l1, true, par{arg1 -> undef41, arg2 -> undef42, arg3 -> undef43, arg4 -> undef44}> Fresh variables: undef1, undef5, undef9, undef13, undef19, undef20, undef22, undef23, undef24, undef27, undef28, undef29, undef30, undef31, undef32, undef34, undef35, undef36, undef37, undef38, undef39, undef40, undef41, undef42, undef43, undef44, Undef variables: undef1, undef5, undef9, undef13, undef19, undef20, undef22, undef23, undef24, undef27, undef28, undef29, undef30, undef31, undef32, undef34, undef35, undef36, undef37, undef38, undef39, undef40, undef41, undef42, undef43, undef44, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l2, (arg1 = undef1) /\ (arg2 = (undef42 - 1)) /\ (arg3 = undef42) /\ (arg4 = undef42) /\ (undef1 <= undef41) /\ (undef42 > ~(1)) /\ (undef41 > 0) /\ (undef1 > 0)> <l2, l2, (undef5 <= arg1) /\ (arg3 > 0) /\ (arg1 > 0) /\ (undef5 > 0), par{arg1 -> undef5, arg2 -> (arg2 - 1), arg3 -> arg2}> <l2, l3, (arg3 < 1) /\ (arg4 > ~(1)) /\ (arg1 >= undef9) /\ (arg1 > 0) /\ (undef9 > 0), par{arg1 -> undef9, arg2 -> (arg4 - 1), arg3 -> arg4}> <l3, l3, (undef13 <= arg1) /\ (arg3 > 0) /\ (arg1 > 0) /\ (undef13 > 0), par{arg1 -> undef13, arg2 -> (arg2 - 1), arg3 -> arg2}> <l3, l4, (arg3 < 1) /\ (arg4 > ~(1)) /\ (arg1 > 0), par{arg1 -> (arg4 - 1), arg2 -> arg4, arg3 -> undef19, arg4 -> undef20}> <l4, l5, (arg2 < 1), par{arg1 -> 2, arg2 -> undef22, arg3 -> undef23, arg4 -> undef24}> <l4, l4, (arg2 > 0), par{arg1 -> (arg1 - 1), arg2 -> arg1, arg3 -> undef27, arg4 -> undef28}> <l5, l6, (arg1 > ~(1)) /\ (undef29 > ~(1)) /\ (arg1 < 3), par{arg1 -> undef29, arg2 -> undef30, arg3 -> undef31, arg4 -> undef32}> <l5, l5, (arg1 > ~(1)) /\ (arg1 < 3), par{arg1 -> (arg1 - 1), arg2 -> undef34, arg3 -> undef35, arg4 -> undef36}> <l6, l6, ((undef37 + 1) <= arg1) /\ (arg1 > 0) /\ (undef37 > ~(1)), par{arg1 -> undef37, arg2 -> undef38, arg3 -> undef39, arg4 -> undef40}> Fresh variables: undef1, undef5, undef9, undef13, undef19, undef20, undef22, undef23, undef24, undef27, undef28, undef29, undef30, undef31, undef32, undef34, undef35, undef36, undef37, undef38, undef39, undef40, undef41, undef42, undef43, undef44, Undef variables: undef1, undef5, undef9, undef13, undef19, undef20, undef22, undef23, undef24, undef27, undef28, undef29, undef30, undef31, undef32, undef34, undef35, undef36, undef37, undef38, undef39, undef40, undef41, undef42, undef43, undef44, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: <l2, l2, 1 <= arg1 /\ 1 <= arg3 /\ 1 <= undef5 /\ undef5 <= arg1, {arg1 -> undef5, arg2 -> -1 + arg2, arg3 -> arg2, rest remain the same}> Variables: arg1, arg2, arg3 Graph 2: Transitions: <l3, l3, 1 <= arg1 /\ 1 <= arg3 /\ 1 <= undef13 /\ undef13 <= arg1, {arg1 -> undef13, arg2 -> -1 + arg2, arg3 -> arg2, rest remain the same}> Variables: arg1, arg2, arg3 Graph 3: Transitions: <l4, l4, 1 <= arg2, {arg1 -> -1 + arg1, arg2 -> arg1, arg3 -> undef27, arg4 -> undef28, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Graph 4: Transitions: <l5, l5, 0 <= arg1 /\ arg1 <= 2, {arg1 -> -1 + arg1, arg2 -> undef34, arg3 -> undef35, arg4 -> undef36, rest 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