Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integ Trans Syste 27634 pair #381738940
details
property
value
status
complete
benchmark
NestedLoop.jar-obl-10.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n192.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp17
runtime (wallclock)
0.260094881058 seconds
cpu usage
0.3104037
max memory
3.5176448E7
stage attributes
key
value
output-size
9636
starexec-result
YES
output
/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: <l0, l6, true> <l1, l2, (undef1 <= arg1) /\ (arg2 > ~(1)) /\ (arg1 > 0) /\ (undef1 > 0), par{arg1 -> undef1, arg2 -> 0, arg3 -> (arg2 - 1), arg4 -> arg2}> <l2, l2, (arg3 > arg2) /\ (arg2 < arg4) /\ (arg4 > ~(1)) /\ (undef5 <= arg1) /\ (arg1 > 0) /\ (undef5 > 0), par{arg1 -> undef5, arg2 -> (arg2 + 1), arg3 -> (arg4 - 1)}> <l2, l3, (arg3 <= arg2) /\ (arg4 > ~(1)) /\ (arg1 >= undef9) /\ (arg1 > 0) /\ (undef9 > 0), par{arg1 -> undef9, arg2 -> 0, arg3 -> (arg4 - 1)}> <l3, l4, (arg2 > ~(1)) /\ (arg3 > arg2) /\ (undef14 <= arg1) /\ (arg1 > 0) /\ (undef14 > 0), par{arg1 -> arg2, arg2 -> undef14, arg3 -> (arg2 + 1)}> <l4, l3, (arg4 > ~(1)) /\ (arg4 <= arg3) /\ (undef17 <= arg2) /\ (arg2 > 0) /\ (undef17 > 0), par{arg1 -> undef17, arg2 -> (arg1 + 1), arg3 -> (arg4 - 1)}> <l3, l5, (arg3 <= arg2) /\ (arg4 > ~(1)) /\ (undef21 <= arg1) /\ (arg1 > 0) /\ (undef21 > 0), par{arg1 -> undef21, arg2 -> 0, arg3 -> (arg4 - 1)}> <l5, l5, (arg4 > ~(1)) /\ (arg3 > arg2) /\ (undef25 <= arg1) /\ (arg1 > 0) /\ (undef25 > 0), par{arg1 -> undef25, arg2 -> (arg2 + 1), arg3 -> (arg4 - 1)}> <l4, l4, (arg4 > arg3) /\ (arg4 > arg1) /\ (undef33 >= undef34) /\ (undef30 <= arg2) /\ (arg2 > 0) /\ (undef30 > 0), par{arg2 -> undef30, arg3 -> (arg3 + 1)}> <l4, l4, (arg4 > arg3) /\ (arg4 > arg1) /\ (undef39 < undef40) /\ (undef36 <= arg2) /\ (arg2 > 0) /\ (undef36 > 0), par{arg2 -> undef36, arg3 -> (arg3 + 1)}> <l6, l1, true, par{arg1 -> undef41, arg2 -> undef42, arg3 -> undef43, arg4 -> undef44}> Fresh variables: undef1, undef5, undef9, undef14, undef17, undef21, undef25, undef30, undef33, undef34, undef36, undef39, undef40, undef41, undef42, undef43, undef44, Undef variables: undef1, undef5, undef9, undef14, undef17, undef21, undef25, undef30, undef33, undef34, undef36, undef39, undef40, undef41, undef42, undef43, undef44, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l2, (arg1 = undef1) /\ (arg2 = 0) /\ (arg3 = (undef42 - 1)) /\ (arg4 = undef42) /\ (undef1 <= undef41) /\ (undef42 > ~(1)) /\ (undef41 > 0) /\ (undef1 > 0)> <l2, l2, (arg3 > arg2) /\ (arg2 < arg4) /\ (arg4 > ~(1)) /\ (undef5 <= arg1) /\ (arg1 > 0) /\ (undef5 > 0), par{arg1 -> undef5, arg2 -> (arg2 + 1), arg3 -> (arg4 - 1)}> <l2, l4, (arg3 <= arg2) /\ (arg4 > ~(1)) /\ (arg1 >= undef9) /\ (arg1 > 0) /\ (undef9 > 0) /\ (0 > ~(1)) /\ ((arg4 - 1) > 0) /\ (undef14 <= undef9) /\ (undef9 > 0) /\ (undef14 > 0), par{arg1 -> 0, arg2 -> undef14, arg3 -> (0 + 1)}> <l2, l5, (arg3 <= arg2) /\ (arg4 > ~(1)) /\ (arg1 >= undef9) /\ (arg1 > 0) /\ (undef9 > 0) /\ ((arg4 - 1) <= 0) /\ (arg4 > ~(1)) /\ (undef21 <= undef9) /\ (undef9 > 0) /\ (undef21 > 0), par{arg1 -> undef21, arg2 -> 0, arg3 -> (arg4 - 1)}> <l4, l4, (arg4 > ~(1)) /\ (arg4 <= arg3) /\ (undef17 <= arg2) /\ (arg2 > 0) /\ (undef17 > 0) /\ ((arg1 + 1) > ~(1)) /\ ((arg4 - 1) > (arg1 + 1)) /\ (undef14 <= undef17) /\ (undef17 > 0) /\ (undef14 > 0), par{arg1 -> (arg1 + 1), arg2 -> undef14, arg3 -> ((arg1 + 1) + 1)}> <l4, l5, (arg4 > ~(1)) /\ (arg4 <= arg3) /\ (undef17 <= arg2) /\ (arg2 > 0) /\ (undef17 > 0) /\ ((arg4 - 1) <= (arg1 + 1)) /\ (arg4 > ~(1)) /\ (undef21 <= undef17) /\ (undef17 > 0) /\ (undef21 > 0), par{arg1 -> undef21, arg2 -> 0, arg3 -> (arg4 - 1)}> <l4, l4, (arg4 > arg3) /\ (arg4 > arg1) /\ (undef33 >= undef34) /\ (undef30 <= arg2) /\ (arg2 > 0) /\ (undef30 > 0), par{arg2 -> undef30, arg3 -> (arg3 + 1)}> <l4, l4, (arg4 > arg3) /\ (arg4 > arg1) /\ (undef39 < undef40) /\ (undef36 <= arg2) /\ (arg2 > 0) /\ (undef36 > 0), par{arg2 -> undef36, arg3 -> (arg3 + 1)}> <l5, l5, (arg4 > ~(1)) /\ (arg3 > arg2) /\ (undef25 <= arg1) /\ (arg1 > 0) /\ (undef25 > 0), par{arg1 -> undef25, arg2 -> (arg2 + 1), arg3 -> (arg4 - 1)}> Fresh variables: undef1, undef5, undef9, undef14, undef17, undef21, undef25, undef30, undef33, undef34, undef36, undef39, undef40, undef41, undef42, undef43, undef44, Undef variables: undef1, undef5, undef9, undef14, undef17, undef21, undef25, undef30, undef33, undef34, undef36, undef39, undef40, undef41, undef42, undef43, undef44, 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 <= arg3 /\ 1 + arg2 <= arg4 /\ 1 <= undef5 /\ undef5 <= arg1 /\ 0 <= arg4, {arg1 -> undef5, arg2 -> 1 + arg2, arg3 -> -1 + arg4, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Graph 2: Transitions: <l4, l4, 1 <= arg2 /\ 1 <= undef14 /\ 1 <= undef17 /\ 0 <= 1 + arg1 /\ undef17 <= arg2 /\ arg4 <= arg3 /\ 0 <= arg4 /\ undef14 <= undef17 /\ 3 + arg1 <= arg4, {arg1 -> 1 + arg1, arg2 -> undef14, arg3 -> 2 + arg1, rest remain the same}> <l4, l4, 1 + arg1 <= arg4 /\ 1 <= arg2 /\ 1 + arg3 <= arg4 /\ 1 <= undef30 /\ undef30 <= arg2 /\ undef34 <= undef33, {arg2 -> undef30, arg3 -> 1 + arg3, rest remain the same}> <l4, l4, 1 + arg1 <= arg4 /\ 1 <= arg2 /\ 1 + arg3 <= arg4 /\ 1 <= undef36 /\ 1 + undef39 <= undef40 /\ undef36 <= arg2, {arg2 -> undef36, arg3 -> 1 + arg3, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Graph 3: Transitions: <l5, l5, 1 <= arg1 /\ 1 + arg2 <= arg3 /\ 1 <= undef25 /\ undef25 <= arg1 /\ 0 <= arg4, {arg1 -> undef25, arg2 -> 1 + arg2, arg3 -> -1 + arg4, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Precedence: Graph 0
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Integ Trans Syste 27634