details

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

run statistics

property	value
solver	VeryMax-termCOMP17
configuration	termcomp17
runtime (wallclock)	0.14315700531 seconds
cpu usage	0.127872628
max memory	2.1000192E7

stage attributes

key	value
output-size	10284
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, l5, true> <l1, l2, (arg1 > 0) /\ (undef1 > 2) /\ (undef2 > ~(1)), par{arg1 -> undef1, arg2 -> undef2, arg3 -> undef3, arg4 -> undef4, arg5 -> undef5}> <l3, l2, (undef6 <= arg1) /\ ((undef7 + 3) <= arg1) /\ (arg1 > 2) /\ (undef6 > 2) /\ (undef7 > ~(1)) /\ ((arg2 + 2) <= arg1), par{arg1 -> undef6, arg2 -> undef7, arg3 -> undef8, arg4 -> undef9, arg5 -> undef10}> <l2, l2, (arg1 >= (undef11 - 2)) /\ (arg1 >= (undef12 + 3)) /\ (arg2 >= (undef12 + 1)) /\ (arg1 > 2) /\ (arg2 > 0) /\ (undef11 > 2) /\ (undef12 > ~(1)), par{arg1 -> undef11, arg2 -> undef12, arg3 -> undef13, arg4 -> undef14, arg5 -> undef15}> <l1, l4, (arg2 > 0) /\ (undef18 > 0) /\ ((undef16 - 2) <= arg1) /\ ((undef17 - 2) <= arg1) /\ (arg1 > 0) /\ (undef16 > 2) /\ (undef17 > 2), par{arg1 -> undef16, arg2 -> undef17, arg3 -> undef18, arg4 -> arg2, arg5 -> 1}> <l4, l4, (arg3 > 0) /\ (arg5 > ~(1)) /\ (arg5 < arg4) /\ (undef21 <= arg1) /\ ((undef22 + 2) <= arg2) /\ (arg1 > 2) /\ (arg2 > 2) /\ (undef21 > 2) /\ (undef22 > 0), par{arg1 -> undef21, arg2 -> undef22, arg3 -> (arg3 - 1), arg5 -> (arg5 + 1)}> <l4, l4, (arg5 > ~(1)) /\ (undef31 > 0) /\ (arg3 > 0) /\ (arg5 < arg4) /\ (undef26 <= arg1) /\ ((undef27 + 2) <= arg2) /\ (arg1 > 2) /\ (arg2 > 2) /\ (undef26 > 2) /\ (undef27 > 0), par{arg1 -> undef26, arg2 -> undef27, arg3 -> (arg3 - 1), arg5 -> (arg5 + 1)}> <l4, l4, (arg5 > ~(1)) /\ (undef37 > 0) /\ (arg3 > 0) /\ (arg5 < arg4) /\ (arg1 > 2) /\ (arg2 > 1) /\ (undef32 > 2) /\ (undef33 > 2), par{arg1 -> undef32, arg2 -> undef33, arg3 -> (arg3 - 1), arg5 -> (arg5 + 1)}> <l4, l4, (arg3 > 0) /\ (arg5 > ~(1)) /\ (arg5 < arg4) /\ (arg1 > 2) /\ (arg2 > 1) /\ (undef38 > 2) /\ (undef39 > 2), par{arg1 -> undef38, arg2 -> undef39, arg3 -> (arg3 - 1), arg5 -> (arg5 + 1)}> <l4, l4, (arg3 > 0) /\ (arg5 > ~(1)) /\ (arg5 < arg4) /\ ((undef43 - 2) <= arg1) /\ ((undef43 - 2) <= arg2) /\ ((undef44 - 2) <= arg1) /\ ((undef44 - 2) <= arg2) /\ (arg1 > 2) /\ (arg2 > 2) /\ (undef43 > 4) /\ (undef44 > 4), par{arg1 -> undef43, arg2 -> undef44, arg3 -> (arg3 - 1), arg5 -> (arg5 + 1)}> <l4, l4, (arg5 > ~(1)) /\ (undef53 > 0) /\ (arg3 > 0) /\ (arg5 < arg4) /\ ((undef48 - 2) <= arg1) /\ ((undef48 - 2) <= arg2) /\ ((undef49 - 2) <= arg1) /\ ((undef49 - 2) <= arg2) /\ (arg1 > 2) /\ (arg2 > 2) /\ (undef48 > 4) /\ (undef49 > 4), par{arg1 -> undef48, arg2 -> undef49, arg3 -> (arg3 - 1), arg5 -> (arg5 + 1)}> <l5, l1, true, par{arg1 -> undef54, arg2 -> undef55, arg3 -> undef56, arg4 -> undef57, arg5 -> undef58}> Fresh variables: undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, undef21, undef22, undef26, undef27, undef31, undef32, undef33, undef37, undef38, undef39, undef43, undef44, undef48, undef49, undef53, undef54, undef55, undef56, undef57, undef58, Undef variables: undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, undef21, undef22, undef26, undef27, undef31, undef32, undef33, undef37, undef38, undef39, undef43, undef44, undef48, undef49, undef53, undef54, undef55, undef56, undef57, undef58, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l2, (undef54 > 0) /\ (undef1 > 2) /\ (undef2 > ~(1)), par{arg1 -> undef1, arg2 -> undef2, arg3 -> undef3, arg4 -> undef4, arg5 -> undef5}> <l0, l4, (undef55 > 0) /\ (undef18 > 0) /\ ((undef16 - 2) <= undef54) /\ ((undef17 - 2) <= undef54) /\ (undef54 > 0) /\ (undef16 > 2) /\ (undef17 > 2), par{arg1 -> undef16, arg2 -> undef17, arg3 -> undef18, arg4 -> undef55, arg5 -> 1}> <l2, l2, (arg1 >= (undef11 - 2)) /\ (arg1 >= (undef12 + 3)) /\ (arg2 >= (undef12 + 1)) /\ (arg1 > 2) /\ (arg2 > 0) /\ (undef11 > 2) /\ (undef12 > ~(1)), par{arg1 -> undef11, arg2 -> undef12, arg3 -> undef13, arg4 -> undef14, arg5 -> undef15}> <l4, l4, (arg3 > 0) /\ (arg5 > ~(1)) /\ (arg5 < arg4) /\ (undef21 <= arg1) /\ ((undef22 + 2) <= arg2) /\ (arg1 > 2) /\ (arg2 > 2) /\ (undef21 > 2) /\ (undef22 > 0), par{arg1 -> undef21, arg2 -> undef22, arg3 -> (arg3 - 1), arg5 -> (arg5 + 1)}> <l4, l4, (arg5 > ~(1)) /\ (undef31 > 0) /\ (arg3 > 0) /\ (arg5 < arg4) /\ (undef26 <= arg1) /\ ((undef27 + 2) <= arg2) /\ (arg1 > 2) /\ (arg2 > 2) /\ (undef26 > 2) /\ (undef27 > 0), par{arg1 -> undef26, arg2 -> undef27, arg3 -> (arg3 - 1), arg5 -> (arg5 + 1)}> <l4, l4, (arg5 > ~(1)) /\ (undef37 > 0) /\ (arg3 > 0) /\ (arg5 < arg4) /\ (arg1 > 2) /\ (arg2 > 1) /\ (undef32 > 2) /\ (undef33 > 2), par{arg1 -> undef32, arg2 -> undef33, arg3 -> (arg3 - 1), arg5 -> (arg5 + 1)}> <l4, l4, (arg3 > 0) /\ (arg5 > ~(1)) /\ (arg5 < arg4) /\ (arg1 > 2) /\ (arg2 > 1) /\ (undef38 > 2) /\ (undef39 > 2), par{arg1 -> undef38, arg2 -> undef39, arg3 -> (arg3 - 1), arg5 -> (arg5 + 1)}> <l4, l4, (arg3 > 0) /\ (arg5 > ~(1)) /\ (arg5 < arg4) /\ ((undef43 - 2) <= arg1) /\ ((undef43 - 2) <= arg2) /\ ((undef44 - 2) <= arg1) /\ ((undef44 - 2) <= arg2) /\ (arg1 > 2) /\ (arg2 > 2) /\ (undef43 > 4) /\ (undef44 > 4), par{arg1 -> undef43, arg2 -> undef44, arg3 -> (arg3 - 1), arg5 -> (arg5 + 1)}> <l4, l4, (arg5 > ~(1)) /\ (undef53 > 0) /\ (arg3 > 0) /\ (arg5 < arg4) /\ ((undef48 - 2) <= arg1) /\ ((undef48 - 2) <= arg2) /\ ((undef49 - 2) <= arg1) /\ ((undef49 - 2) <= arg2) /\ (arg1 > 2) /\ (arg2 > 2) /\ (undef48 > 4) /\ (undef49 > 4), par{arg1 -> undef48, arg2 -> undef49, arg3 -> (arg3 - 1), arg5 -> (arg5 + 1)}> Fresh variables: undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, undef21, undef22, undef26, undef27, undef31, undef32, undef33, undef37, undef38, undef39, undef43, undef44, undef48, undef49, undef53, undef54, undef55, undef56, undef57, undef58, Undef variables: undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, undef21, undef22, undef26, undef27, undef31, undef32, undef33, undef37, undef38, undef39, undef43, undef44, undef48, undef49, undef53, undef54, undef55, undef56, undef57, undef58, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: <l4, l4, undef21 <= arg1 /\ 0 <= arg5 /\ 2 + undef22 <= arg2 /\ 1 <= arg3 /\ 1 + arg5 <= arg4 /\ 1 <= undef22 /\ 3 <= arg1 /\ 3 <= arg2 /\ 3 <= undef21, {arg1 -> undef21, arg2 -> undef22, arg3 -> -1 + arg3, arg5 -> 1 + arg5, rest remain the same}> <l4, l4, undef26 <= arg1 /\ 0 <= arg5 /\ 2 + undef27 <= arg2 /\ 1 <= arg3 /\ 1 + arg5 <= arg4 /\ 1 <= undef27 /\ 1 <= undef31 /\ 3 <= arg1 /\ 3 <= arg2 /\ 3 <= undef26, {arg1 -> undef26, arg2 -> undef27, arg3 -> -1 + arg3, arg5 -> 1 + arg5, rest remain the same}> <l4, l4, 0 <= arg5 /\ 2 <= arg2 /\ 1 <= arg3 /\ 1 + arg5 <= arg4 /\ 1 <= undef37 /\ 3 <= arg1 /\ 3 <= undef32 /\ 3 <= undef33, {arg1 -> undef32, arg2 -> undef33, arg3 -> -1 + arg3, arg5 -> 1 + arg5, rest remain the same}> <l4, l4, 0 <= arg5 /\ 2 <= arg2 /\ 1 <= arg3 /\ 1 + arg5 <= arg4 /\ 3 <= arg1 /\ 3 <= undef38 /\ 3 <= undef39, {arg1 -> undef38, arg2 -> undef39, arg3 -> -1 + arg3, arg5 -> 1 + arg5, rest remain the same}> <l4, l4, 0 <= arg5 /\ 1 <= arg3 /\ 1 + arg5 <= arg4 /\ 3 <= arg1 /\ 3 <= arg2 /\ undef43 <= 2 + arg1 /\ undef44 <= 2 + arg1 /\ undef43 <= 2 + arg2 /\ undef44 <= 2 + arg2 /\ 5 <= undef43 /\ 5 <= undef44, {arg1 -> undef43, arg2 -> undef44, arg3 -> -1 + arg3, arg5 -> 1 + arg5, rest remain the same}> <l4, l4, 0 <= arg5 /\ 1 <= arg3 /\ 1 + arg5 <= arg4 /\ 1 <= undef53 /\ 3 <= arg1 /\ 3 <= arg2 /\ undef48 <= 2 + arg1 /\ undef49 <= 2 + arg1 /\ undef48 <= 2 + arg2 /\ undef49 <= 2 + arg2 /\ 5 <= undef48 /\ 5 <= undef49, {arg1 -> undef48, arg2 -> undef49, arg3 -> -1 + arg3, arg5 -> 1 + arg5, rest remain the same}> Variables: arg1, arg2, arg3, arg4, arg5 Graph 2: Transitions: <l2, l2, 0 <= undef12 /\ 1 <= arg2 /\ 1 + undef12 <= arg2 /\ 3 <= arg1 /\ 3 + undef12 <= arg1 /\ 3 <= undef11 /\ undef11 <= 2 + arg1, {arg1 -> undef11, arg2 -> undef12, arg3 -> undef13, arg4 -> undef14, arg5 -> undef15, rest remain the same}> Variables: arg1, arg2, arg3, arg4, arg5 Precedence: Graph 0 Graph 1 <l0, l4, 1 <= undef18 /\ 1 <= undef54 /\ 1 <= undef55 /\ 3 <= undef16 /\ 3 <= undef17 /\ undef16 <= 2 + undef54 /\ undef17 <= 2 + undef54, {arg1 -> undef16, arg2 -> undef17, arg3 -> undef18, arg4 -> undef55, arg5 -> 1, 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