details

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

run statistics

property	value
solver	VeryMax-termCOMP17
configuration	termcomp17
runtime (wallclock)	45.4756069183 seconds
cpu usage	135.207670439
max memory	1.095016448E9

stage attributes

key	value
output-size	19387
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, l5, true> <l1, l2, (undef1 <= arg1) /\ (arg2 > ~(1)) /\ ((undef2 - 1) <= arg1) /\ (arg1 > 0) /\ (undef1 > 0) /\ (undef2 > 1), par{arg1 -> undef1, arg2 -> undef2, arg3 -> 0, arg4 -> (arg2 + 1), arg5 -> 0, arg6 -> arg2}> <l2, l2, (arg4 > arg3) /\ (arg5 > 0) /\ (arg6 > ~(1)) /\ (arg5 < undef11) /\ (arg1 >= undef7) /\ (arg2 >= undef7) /\ (arg1 > 0) /\ (arg2 > 0) /\ (undef7 > 0) /\ (undef8 > 0), par{arg1 -> undef7, arg2 -> undef8, arg3 -> (arg3 + 1), arg4 -> (arg6 + 1), arg5 -> undef11}> <l2, l2, (arg6 > ~(1)) /\ (arg4 > arg3) /\ (undef13 <= arg1) /\ ((undef13 + 1) <= arg2) /\ ((undef14 - 3) <= arg1) /\ ((undef14 - 2) <= arg2) /\ (arg1 > 0) /\ (arg2 > 1) /\ (undef13 > 0) /\ (undef14 > 3), par{arg1 -> undef13, arg2 -> undef14, arg3 -> (arg3 + 1), arg4 -> (arg6 + 1), arg5 -> 1}> <l3, l3, (undef19 <= arg1) /\ (arg1 > 0) /\ (undef19 > 0), par{arg1 -> undef19, arg2 -> (arg2 + 1), arg4 -> undef22, arg5 -> undef23, arg6 -> undef24}> <l2, l3, (undef25 <= arg1) /\ (arg4 <= arg3) /\ ((undef25 + 1) <= arg2) /\ (arg1 > 0) /\ (arg2 > 1) /\ (undef25 > 0), par{arg1 -> undef25, arg2 -> 1, arg3 -> arg6, arg4 -> undef28, arg5 -> undef29, arg6 -> undef30}> <l2, l4, (arg5 > 0) /\ (arg4 <= arg3) /\ (arg1 > 0) /\ (arg2 > 0) /\ (undef31 > 0), par{arg1 -> undef31, arg2 -> arg5, arg3 -> 0, arg4 -> 0, arg5 -> 0, arg6 -> arg5}> <l4, l4, (arg5 > 0) /\ (arg4 > 0) /\ (undef41 > arg5) /\ (arg5 < arg3) /\ (arg3 > 0) /\ (undef40 < arg4) /\ (arg5 < arg2) /\ (arg1 > 2) /\ (undef37 > 0), par{arg1 -> undef37, arg4 -> undef40, arg5 -> undef41, arg6 -> undef42}> <l4, l4, (undef48 < arg2) /\ (arg2 > ~(1)) /\ (arg3 > ~(1)) /\ (undef46 < arg3) /\ (arg1 > 2) /\ (undef43 > 0) /\ (arg1 >= (undef49 + 3)) /\ (arg2 = arg6), par{arg1 -> undef43, arg2 -> undef44, arg3 -> 0, arg4 -> undef46, arg5 -> 1, arg6 -> undef48}> <l5, l1, true, par{arg1 -> undef50, arg2 -> undef51, arg3 -> undef52, arg4 -> undef53, arg5 -> undef54, arg6 -> undef55}> Fresh variables: undef1, undef2, undef7, undef8, undef11, undef13, undef14, undef19, undef22, undef23, undef24, undef25, undef28, undef29, undef30, undef31, undef37, undef40, undef41, undef42, undef43, undef44, undef46, undef48, undef49, undef50, undef51, undef52, undef53, undef54, undef55, Undef variables: undef1, undef2, undef7, undef8, undef11, undef13, undef14, undef19, undef22, undef23, undef24, undef25, undef28, undef29, undef30, undef31, undef37, undef40, undef41, undef42, undef43, undef44, undef46, undef48, undef49, undef50, undef51, undef52, undef53, undef54, undef55, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l2, (arg1 = undef1) /\ (arg2 = undef2) /\ (arg3 = 0) /\ (arg4 = (undef51 + 1)) /\ (arg5 = 0) /\ (arg6 = undef51) /\ (undef1 <= undef50) /\ (undef51 > ~(1)) /\ ((undef2 - 1) <= undef50) /\ (undef50 > 0) /\ (undef1 > 0) /\ (undef2 > 1)> <l2, l2, (arg4 > arg3) /\ (arg5 > 0) /\ (arg6 > ~(1)) /\ (arg5 < undef11) /\ (arg1 >= undef7) /\ (arg2 >= undef7) /\ (arg1 > 0) /\ (arg2 > 0) /\ (undef7 > 0) /\ (undef8 > 0), par{arg1 -> undef7, arg2 -> undef8, arg3 -> (arg3 + 1), arg4 -> (arg6 + 1), arg5 -> undef11}> <l2, l2, (arg6 > ~(1)) /\ (arg4 > arg3) /\ (undef13 <= arg1) /\ ((undef13 + 1) <= arg2) /\ ((undef14 - 3) <= arg1) /\ ((undef14 - 2) <= arg2) /\ (arg1 > 0) /\ (arg2 > 1) /\ (undef13 > 0) /\ (undef14 > 3), par{arg1 -> undef13, arg2 -> undef14, arg3 -> (arg3 + 1), arg4 -> (arg6 + 1), arg5 -> 1}> <l2, l3, (undef25 <= arg1) /\ (arg4 <= arg3) /\ ((undef25 + 1) <= arg2) /\ (arg1 > 0) /\ (arg2 > 1) /\ (undef25 > 0), par{arg1 -> undef25, arg2 -> 1, arg3 -> arg6, arg4 -> undef28, arg5 -> undef29, arg6 -> undef30}> <l2, l4, (arg5 > 0) /\ (arg4 <= arg3) /\ (arg1 > 0) /\ (arg2 > 0) /\ (undef31 > 0), par{arg1 -> undef31, arg2 -> arg5, arg3 -> 0, arg4 -> 0, arg5 -> 0, arg6 -> arg5}> <l3, l3, (undef19 <= arg1) /\ (arg1 > 0) /\ (undef19 > 0), par{arg1 -> undef19, arg2 -> (arg2 + 1), arg4 -> undef22, arg5 -> undef23, arg6 -> undef24}> <l4, l4, (arg5 > 0) /\ (arg4 > 0) /\ (undef41 > arg5) /\ (arg5 < arg3) /\ (arg3 > 0) /\ (undef40 < arg4) /\ (arg5 < arg2) /\ (arg1 > 2) /\ (undef37 > 0), par{arg1 -> undef37, arg4 -> undef40, arg5 -> undef41, arg6 -> undef42}> <l4, l4, (undef48 < arg2) /\ (arg2 > ~(1)) /\ (arg3 > ~(1)) /\ (undef46 < arg3) /\ (arg1 > 2) /\ (undef43 > 0) /\ (arg1 >= (undef49 + 3)) /\ (arg2 = arg6), par{arg1 -> undef43, arg2 -> undef44, arg3 -> 0, arg4 -> undef46, arg5 -> 1, arg6 -> undef48}> Fresh variables: undef1, undef2, undef7, undef8, undef11, undef13, undef14, undef19, undef22, undef23, undef24, undef25, undef28, undef29, undef30, undef31, undef37, undef40, undef41, undef42, undef43, undef44, undef46, undef48, undef49, undef50, undef51, undef52, undef53, undef54, undef55, Undef variables: undef1, undef2, undef7, undef8, undef11, undef13, undef14, undef19, undef22, undef23, undef24, undef25, undef28, undef29, undef30, undef31, undef37, undef40, undef41, undef42, undef43, undef44, undef46, undef48, undef49, undef50, undef51, undef52, undef53, undef54, undef55, 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 <= arg2 /\ 1 + arg3 <= arg4 /\ 1 + arg5 <= undef11 /\ 1 <= arg5 /\ 1 <= undef7 /\ 1 <= undef8 /\ undef7 <= arg1 /\ undef7 <= arg2 /\ 0 <= arg6, {arg1 -> undef7, arg2 -> undef8, arg3 -> 1 + arg3, arg4 -> 1 + arg6, arg5 -> undef11, rest remain the same}> <l2, l2, 1 <= arg1 /\ 1 + undef13 <= arg2 /\ 1 + arg3 <= arg4 /\ 1 <= undef13 /\ undef13 <= arg1 /\ 0 <= arg6 /\ 2 <= arg2 /\ undef14 <= 3 + arg1 /\ undef14 <= 2 + arg2 /\ 4 <= undef14, {arg1 -> undef13, arg2 -> undef14, arg3 -> 1 + arg3, arg4 -> 1 + arg6, arg5 -> 1, rest remain the same}> Variables: arg1, arg2, arg3, arg4, arg5, arg6 Graph 2: Transitions: <l4, l4, 1 + arg5 <= arg2 /\ 1 <= arg3 /\ 1 + arg5 <= arg3 /\ 1 <= arg4 /\ 1 + undef40 <= arg4 /\ 1 + arg5 <= undef41 /\ 1 <= arg5 /\ 1 <= undef37 /\ 3 <= arg1, {arg1 -> undef37, arg4 -> undef40, arg5 -> undef41, arg6 -> undef42, rest remain the same}> <l4, l4, 1 + undef48 <= arg2 /\ 1 + undef46 <= arg3 /\ 1 <= undef43 /\ 0 <= arg2 /\ 0 <= arg3 /\ 3 <= arg1 /\ 3 + undef49 <= arg1 /\ arg2 = arg6, {arg1 -> undef43, arg2 -> undef44, arg3 -> 0, arg4 -> undef46, arg5 -> 1, arg6 -> undef48, rest remain the same}> Variables: arg1, arg2, arg3, arg4, arg5, arg6 Graph 3: Transitions: <l3, l3, 1 <= arg1 /\ 1 <= undef19 /\ undef19 <= arg1, {arg1 -> undef19, arg2 -> 1 + arg2, arg4 -> undef22, arg5 -> undef23, arg6 -> undef24, rest remain the same}> Variables: arg1, arg2, arg4, arg5, arg6 Precedence: Graph 0 Graph 1 <l0, l2, 1 <= undef1 /\ 1 <= undef50 /\ undef2 <= 1 + undef50 /\ undef1 <= undef50 /\ 0 <= undef51 /\ 2 <= undef2 /\ arg4 = 1 + undef51 /\ arg1 = undef1 /\ arg2 = undef2 /\ arg3 = 0 /\ arg5 = 0 /\ arg6 = undef51, {all 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