Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integ Trans Syste 27634 pair #381739336
details
property
value
status
complete
benchmark
RunningPointers.jar-obl-9.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n023.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp17
runtime (wallclock)
0.0339560508728 seconds
cpu usage
0.031048366
max memory
6324224.0
stage attributes
key
value
output-size
4247
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) /\ (arg1 > ~(1)) /\ (undef1 > ~(1)), par{arg1 -> undef1, arg2 -> undef2}> <l3, l2, (arg1 > 0) /\ (undef3 > ~(1)), par{arg1 -> undef3, arg2 -> undef4}> <l2, l4, (undef5 <= arg1) /\ ((undef6 + 1) <= arg1) /\ (arg1 > 0) /\ (undef5 > 0) /\ (undef6 > ~(1)), par{arg1 -> undef5, arg2 -> undef6}> <l4, l4, (arg1 >= (undef7 + 1)) /\ (arg2 >= (undef8 + 3)) /\ (arg1 > 0) /\ (arg2 > 2) /\ (undef7 > ~(1)) /\ (undef8 > ~(1)), par{arg1 -> undef7, arg2 -> undef8}> <l3, l5, (arg2 > ~(1)) /\ (undef9 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef9, arg2 -> undef10}> <l5, l5, (arg1 > 0), par{arg1 -> (arg1 - 1), arg2 -> undef12}> <l6, l3, true, par{arg1 -> undef13, arg2 -> undef14}> Fresh variables: undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef12, undef13, undef14, Undef variables: undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef12, undef13, undef14, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l4, (undef13 > 0) /\ (undef3 > ~(1)) /\ (undef5 <= undef3) /\ ((undef6 + 1) <= undef3) /\ (undef3 > 0) /\ (undef5 > 0) /\ (undef6 > ~(1)), par{arg1 -> undef5, arg2 -> undef6}> <l0, l5, (undef14 > ~(1)) /\ (undef9 > ~(1)) /\ (undef13 > 0), par{arg1 -> undef9, arg2 -> undef10}> <l4, l4, (arg1 >= (undef7 + 1)) /\ (arg2 >= (undef8 + 3)) /\ (arg1 > 0) /\ (arg2 > 2) /\ (undef7 > ~(1)) /\ (undef8 > ~(1)), par{arg1 -> undef7, arg2 -> undef8}> <l5, l5, (arg1 > 0), par{arg1 -> (arg1 - 1), arg2 -> undef12}> Fresh variables: undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef12, undef13, undef14, Undef variables: undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef12, undef13, undef14, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: <l5, l5, 1 <= arg1, {arg1 -> -1 + arg1, arg2 -> undef12, rest remain the same}> Variables: arg1, arg2 Graph 2: Transitions: <l4, l4, 1 <= arg1 /\ 1 + undef7 <= arg1 /\ 0 <= undef7 /\ 0 <= undef8 /\ 3 <= arg2 /\ 3 + undef8 <= arg2, {arg1 -> undef7, arg2 -> undef8, rest remain the same}> Variables: arg1, arg2 Precedence: Graph 0 Graph 1 <l0, l5, 1 <= undef13 /\ 0 <= undef9 /\ 0 <= undef14, {arg1 -> undef9, arg2 -> undef10, rest remain the same}> Graph 2 <l0, l4, 1 <= undef3 /\ 1 + undef6 <= undef3 /\ 1 <= undef5 /\ 1 <= undef13 /\ undef5 <= undef3 /\ 0 <= undef6, {arg1 -> undef5, arg2 -> undef6, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 4 , 2 ) ( 5 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Integ Trans Syste 27634