details

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

run statistics

property	value
solver	VeryMax-termCOMP17
configuration	termcomp17
runtime (wallclock)	0.0581140518188 seconds
cpu usage	0.094422224
max memory	1.8833408E7

stage attributes

key	value
output-size	4925
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, l4, true> <l1, l2, (undef1 > 0), par{arg1 -> undef1, arg2 -> 27, arg3 -> 28}> <l2, l2, ((undef4 - 3) <= arg1) /\ (arg3 > 0) /\ (arg1 > 0) /\ (undef4 > 3), par{arg1 -> undef4, arg2 -> (arg2 - 1), arg3 -> arg2}> <l2, l3, ((undef7 + 1) <= arg1) /\ (arg3 < 1) /\ (arg1 > 0) /\ (undef7 > ~(1)), par{arg1 -> undef7, arg2 -> undef8, arg3 -> undef9}> <l3, l3, (arg1 >= (undef10 + 1)) /\ (arg1 > 0) /\ (undef10 > ~(1)), par{arg1 -> undef10, arg2 -> undef11, arg3 -> undef12}> <l4, l1, true, par{arg1 -> undef13, arg2 -> undef14, arg3 -> undef15}> Fresh variables: undef1, undef4, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, Undef variables: undef1, undef4, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l2, (arg1 = undef1) /\ (arg2 = 27) /\ (arg3 = 28) /\ (undef1 > 0)> <l2, l2, ((undef4 - 3) <= arg1) /\ (arg3 > 0) /\ (arg1 > 0) /\ (undef4 > 3), par{arg1 -> undef4, arg2 -> (arg2 - 1), arg3 -> arg2}> <l2, l3, ((undef7 + 1) <= arg1) /\ (arg3 < 1) /\ (arg1 > 0) /\ (undef7 > ~(1)), par{arg1 -> undef7, arg2 -> undef8, arg3 -> undef9}> <l3, l3, (arg1 >= (undef10 + 1)) /\ (arg1 > 0) /\ (undef10 > ~(1)), par{arg1 -> undef10, arg2 -> undef11, arg3 -> undef12}> Fresh variables: undef1, undef4, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, Undef variables: undef1, undef4, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, 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 /\ undef4 <= 3 + arg1 /\ 4 <= undef4, {arg1 -> undef4, arg2 -> -1 + arg2, arg3 -> arg2, rest remain the same}> Variables: arg1, arg2, arg3 Graph 2: Transitions: <l3, l3, 0 <= undef10 /\ 1 <= arg1 /\ 1 + undef10 <= arg1, {arg1 -> undef10, arg2 -> undef11, arg3 -> undef12, rest remain the same}> Variables: arg1, arg2, arg3 Precedence: Graph 0 Graph 1 <l0, l2, 1 <= undef1 /\ arg1 = undef1 /\ arg2 = 27 /\ arg3 = 28, {all remain the same}> Graph 2 <l2, l3, arg3 <= 0 /\ 0 <= undef7 /\ 1 <= arg1 /\ 1 + undef7 <= arg1, {arg1 -> undef7, arg2 -> undef8, arg3 -> undef9, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 3 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... popout

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

job log

popout

actions

all output return to Integ Trans Syste 27634