details

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

run statistics

property	value
solver	VeryMax-termCOMP17
configuration	termcomp17
runtime (wallclock)	1.31821608543 seconds
cpu usage	2.59100867
max memory	1.39833344E8

stage attributes

key	value
output-size	9138
starexec-result	NO

output

/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: <l0, l6, true> <l1, l2, (undef3 > ~(1)) /\ (arg2 > 1) /\ ((undef4 - (2 * undef5)) = 0) /\ (undef4 > ~(1)) /\ (arg1 > 0)> <l2, l3, (undef8 > ~(1)) /\ (arg2 > 1) /\ ((undef9 - (2 * undef10)) = 0) /\ (undef9 > ~(1)) /\ (arg1 > 0) /\ ((undef9 - (2 * undef10)) < 2) /\ ((undef9 - (2 * undef10)) >= 0), par{arg1 -> (0 - undef8), arg2 -> undef7}> <l1, l2, (undef13 > ~(1)) /\ (arg2 > 1) /\ ((undef14 - (2 * undef15)) = 1) /\ (undef14 > ~(1)) /\ (arg1 > 0)> <l2, l4, (undef16 > ~(1)) /\ (arg2 > 1) /\ ((undef18 - (2 * undef19)) = 1) /\ (undef18 > ~(1)) /\ (arg1 > 0) /\ ((undef18 - (2 * undef19)) < 2) /\ ((undef18 - (2 * undef19)) >= 0), par{arg1 -> undef16, arg2 -> undef17}> <l4, l5, (0 = arg1), par{arg1 -> 0, arg2 -> undef21}> <l4, l5, (arg1 > 0) /\ (arg1 < 6), par{arg1 -> (arg1 - 1), arg2 -> undef23}> <l3, l5, (arg1 < 1) /\ (arg1 < 6) /\ (arg1 > ~(6)), par{arg2 -> undef25}> <l5, l4, (arg1 > ~(1)), par{arg2 -> undef27}> <l5, l3, (arg1 < 0), par{arg1 -> (arg1 + 1), arg2 -> undef29}> <l6, l1, true, par{arg1 -> undef30, arg2 -> undef31}> Fresh variables: undef3, undef4, undef5, undef7, undef8, undef9, undef10, undef13, undef14, undef15, undef16, undef17, undef18, undef19, undef21, undef23, undef25, undef27, undef29, undef30, undef31, Undef variables: undef3, undef4, undef5, undef7, undef8, undef9, undef10, undef13, undef14, undef15, undef16, undef17, undef18, undef19, undef21, undef23, undef25, undef27, undef29, undef30, undef31, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l5, (undef3 > ~(1)) /\ (undef31 > 1) /\ ((undef4 - (2 * undef5)) = 0) /\ (undef4 > ~(1)) /\ (undef30 > 0) /\ (undef8 > ~(1)) /\ (undef31 > 1) /\ ((undef9 - (2 * undef10)) = 0) /\ (undef9 > ~(1)) /\ (undef30 > 0) /\ ((undef9 - (2 * undef10)) < 2) /\ ((undef9 - (2 * undef10)) >= 0) /\ ((0 - undef8) < 1) /\ ((0 - undef8) < 6) /\ ((0 - undef8) > ~(6)), par{arg1 -> (0 - undef8)}> <l0, l5, (undef3 > ~(1)) /\ (undef31 > 1) /\ ((undef4 - (2 * undef5)) = 0) /\ (undef4 > ~(1)) /\ (undef30 > 0) /\ (undef16 > ~(1)) /\ (undef31 > 1) /\ ((undef18 - (2 * undef19)) = 1) /\ (undef18 > ~(1)) /\ (undef30 > 0) /\ ((undef18 - (2 * undef19)) < 2) /\ ((undef18 - (2 * undef19)) >= 0) /\ (0 = undef16), par{arg1 -> 0}> <l0, l5, (undef3 > ~(1)) /\ (undef31 > 1) /\ ((undef4 - (2 * undef5)) = 0) /\ (undef4 > ~(1)) /\ (undef30 > 0) /\ (undef16 > ~(1)) /\ (undef31 > 1) /\ ((undef18 - (2 * undef19)) = 1) /\ (undef18 > ~(1)) /\ (undef30 > 0) /\ ((undef18 - (2 * undef19)) < 2) /\ ((undef18 - (2 * undef19)) >= 0) /\ (undef16 > 0) /\ (undef16 < 6), par{arg1 -> (undef16 - 1)}> <l0, l5, (undef13 > ~(1)) /\ (undef31 > 1) /\ ((undef14 - (2 * undef15)) = 1) /\ (undef14 > ~(1)) /\ (undef30 > 0) /\ (undef8 > ~(1)) /\ (undef31 > 1) /\ ((undef9 - (2 * undef10)) = 0) /\ (undef9 > ~(1)) /\ (undef30 > 0) /\ ((undef9 - (2 * undef10)) < 2) /\ ((undef9 - (2 * undef10)) >= 0) /\ ((0 - undef8) < 1) /\ ((0 - undef8) < 6) /\ ((0 - undef8) > ~(6)), par{arg1 -> (0 - undef8)}> <l0, l5, (undef13 > ~(1)) /\ (undef31 > 1) /\ ((undef14 - (2 * undef15)) = 1) /\ (undef14 > ~(1)) /\ (undef30 > 0) /\ (undef16 > ~(1)) /\ (undef31 > 1) /\ ((undef18 - (2 * undef19)) = 1) /\ (undef18 > ~(1)) /\ (undef30 > 0) /\ ((undef18 - (2 * undef19)) < 2) /\ ((undef18 - (2 * undef19)) >= 0) /\ (0 = undef16), par{arg1 -> 0}> <l0, l5, (undef13 > ~(1)) /\ (undef31 > 1) /\ ((undef14 - (2 * undef15)) = 1) /\ (undef14 > ~(1)) /\ (undef30 > 0) /\ (undef16 > ~(1)) /\ (undef31 > 1) /\ ((undef18 - (2 * undef19)) = 1) /\ (undef18 > ~(1)) /\ (undef30 > 0) /\ ((undef18 - (2 * undef19)) < 2) /\ ((undef18 - (2 * undef19)) >= 0) /\ (undef16 > 0) /\ (undef16 < 6), par{arg1 -> (undef16 - 1)}> <l5, l5, (arg1 > ~(1)) /\ (0 = arg1), par{arg1 -> 0}> <l5, l5, (arg1 > ~(1)) /\ (arg1 > 0) /\ (arg1 < 6), par{arg1 -> (arg1 - 1)}> <l5, l5, (arg1 < 0) /\ ((arg1 + 1) < 1) /\ ((arg1 + 1) < 6) /\ ((arg1 + 1) > ~(6)), par{arg1 -> (arg1 + 1)}> Fresh variables: undef3, undef4, undef5, undef7, undef8, undef9, undef10, undef13, undef14, undef15, undef16, undef17, undef18, undef19, undef21, undef23, undef25, undef27, undef29, undef30, undef31, Undef variables: undef3, undef4, undef5, undef7, undef8, undef9, undef10, undef13, undef14, undef15, undef16, undef17, undef18, undef19, undef21, undef23, undef25, undef27, undef29, undef30, undef31, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: <l5, l5, arg1 = 0, {arg1 -> 0, rest remain the same}> <l5, l5, 1 <= arg1 /\ arg1 <= 5, {arg1 -> -1 + arg1, rest remain the same}> <l5, l5, 1 + arg1 <= 0 /\ 0 <= 6 + arg1, {arg1 -> 1 + arg1, rest remain the same}> Variables: arg1 Precedence: Graph 0 Graph 1 <l0, l5, 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef8 /\ 0 <= undef9 /\ undef8 <= 5 /\ undef4 = 2*undef5 /\ undef9 = 2*undef10, {arg1 -> -undef8, rest remain the same}> <l0, l5, 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef18 /\ undef18 = 1 + 2*undef19 /\ undef4 = 2*undef5 /\ undef16 = 0, {arg1 -> 0, rest remain the same}> <l0, l5, 1 <= undef16 /\ 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef18 /\ undef16 <= 5 /\ undef18 = 1 + 2*undef19 /\ undef4 = 2*undef5, {arg1 -> -1 + undef16, rest remain the same}> <l0, l5, 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef8 /\ 0 <= undef9 /\ 0 <= undef13 /\ 0 <= undef14 /\ undef8 <= 5 /\ undef14 = 1 + 2*undef15 /\ undef9 = 2*undef10, {arg1 -> -undef8, rest remain the same}> <l0, l5, 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef13 /\ 0 <= undef14 /\ 0 <= undef18 /\ undef14 = 1 + 2*undef15 /\ undef18 = 1 + 2*undef19 /\ undef16 = 0, {arg1 -> 0, rest remain the same}> <l0, l5, 1 <= undef16 /\ 1 <= undef30 /\ 2 <= undef31 /\ 0 <= undef13 /\ 0 <= undef14 /\ 0 <= undef18 /\ undef16 <= 5 /\ undef14 = 1 + 2*undef15 /\ undef18 = 1 + 2*undef19, {arg1 -> -1 + undef16, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 5 , 1 ) popout

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

job log

popout

actions

all output return to Integ Trans Syste 27634