details

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

run statistics

property	value
solver	VeryMax-termCOMP17
configuration	termcomp17
runtime (wallclock)	0.0500319004059 seconds
cpu usage	0.045693524
max memory	6225920.0

stage attributes

key	value
output-size	4652
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, l3, true> <l1, l2, (undef1 > ~(1)) /\ (arg2 > ~(1)) /\ (undef2 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef1, arg2 -> undef2, arg3 -> (undef1 + undef2)}> <l2, l2, (arg1 > 0) /\ (arg3 > 0) /\ (arg2 > ~(1)), par{arg1 -> (arg1 - 1), arg3 -> ((arg1 - 1) + arg2)}> <l2, l2, (arg3 > 0) /\ (0 = arg1) /\ (0 = arg2), par{arg1 -> 0, arg2 -> 0, arg3 -> 0}> <l2, l2, (arg3 > 0) /\ (arg2 > 0) /\ (0 = arg1), par{arg1 -> 0, arg2 -> (arg2 - 1), arg3 -> (arg2 - 1)}> <l3, l1, true, par{arg1 -> undef13, arg2 -> undef14, arg3 -> undef15}> Fresh variables: undef1, undef2, undef13, undef14, undef15, Undef variables: undef1, undef2, undef13, undef14, undef15, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l2, (arg1 = undef1) /\ (arg2 = undef2) /\ (arg3 = (undef1 + undef2)) /\ (undef1 > ~(1)) /\ (undef14 > ~(1)) /\ (undef2 > ~(1)) /\ (undef13 > 0)> <l2, l2, (arg1 > 0) /\ (arg3 > 0) /\ (arg2 > ~(1)), par{arg1 -> (arg1 - 1), arg3 -> ((arg1 - 1) + arg2)}> <l2, l2, (arg3 > 0) /\ (0 = arg1) /\ (0 = arg2), par{arg1 -> 0, arg2 -> 0, arg3 -> 0}> <l2, l2, (arg3 > 0) /\ (arg2 > 0) /\ (0 = arg1), par{arg1 -> 0, arg2 -> (arg2 - 1), arg3 -> (arg2 - 1)}> Fresh variables: undef1, undef2, undef13, undef14, undef15, Undef variables: undef1, undef2, 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 /\ 0 <= arg2, {arg1 -> -1 + arg1, arg3 -> -1 + arg1 + arg2, rest remain the same}> <l2, l2, 1 <= arg3 /\ arg1 = 0 /\ arg2 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> 0, rest remain the same}> <l2, l2, 1 <= arg2 /\ 1 <= arg3 /\ arg1 = 0, {arg1 -> 0, arg2 -> -1 + arg2, arg3 -> -1 + arg2, rest remain the same}> Variables: arg1, arg2, arg3 Precedence: Graph 0 Graph 1 <l0, l2, 1 <= undef13 /\ 0 <= undef1 /\ 0 <= undef2 /\ 0 <= undef14 /\ arg1 = undef1 /\ arg2 = undef2 /\ arg3 = undef1 + undef2, {all remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.010103 �[33mSome transition disabled by a set of invariant(s):�[0m �[36mInvariant at l2: arg3 <= arg1 + arg2�[0m �[33mStrengthening and disabling transitions...�[0m > It's unfeasible. Removing transition: <l2, l2, 1 <= arg3 /\ arg1 = 0 /\ arg2 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> 0, 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