Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integ Trans Syste 27634 pair #381738334
details
property
value
status
complete
benchmark
AProVE12-cyclic-Visit.jar-obl-9.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n103.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp17
runtime (wallclock)
5.37748908997 seconds
cpu usage
7.639797579
max memory
6.7887104E7
stage attributes
key
value
output-size
7674
starexec-result
NO
output
/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- NO Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: <l0, l4, true> <l1, l2, ((undef2 - 1) <= arg1) /\ (arg2 > ~(1)) /\ (arg1 > 0) /\ (undef2 > 1), par{arg1 -> (arg2 - 1), arg2 -> undef2, arg3 -> arg2}> <l2, l2, ((undef5 - 2) <= arg2) /\ (arg3 > 0) /\ (arg2 > 0) /\ (undef5 > 2), par{arg1 -> (arg1 - 1), arg2 -> undef5, arg3 -> arg1}> <l2, l3, (arg2 > 0) /\ (arg3 < 1) /\ (undef7 > 0), par{arg1 -> undef7, arg2 -> undef8, arg3 -> undef9}> <l2, l3, ((undef10 - 1) <= arg2) /\ (arg3 < 1) /\ (arg2 > 1) /\ (undef10 > 2), par{arg1 -> undef10, arg2 -> undef11, arg3 -> undef12}> <l3, l3, (arg1 > 0) /\ (undef13 > ~(1)), par{arg1 -> undef13, arg2 -> undef14, arg3 -> undef15}> <l4, l1, true, par{arg1 -> undef16, arg2 -> undef17, arg3 -> undef18}> Fresh variables: undef2, undef5, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, Undef variables: undef2, undef5, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l2, (arg1 = (undef17 - 1)) /\ (arg2 = undef2) /\ (arg3 = undef17) /\ ((undef2 - 1) <= undef16) /\ (undef17 > ~(1)) /\ (undef16 > 0) /\ (undef2 > 1)> <l2, l2, ((undef5 - 2) <= arg2) /\ (arg3 > 0) /\ (arg2 > 0) /\ (undef5 > 2), par{arg1 -> (arg1 - 1), arg2 -> undef5, arg3 -> arg1}> <l2, l3, (arg2 > 0) /\ (arg3 < 1) /\ (undef7 > 0), par{arg1 -> undef7, arg2 -> undef8, arg3 -> undef9}> <l2, l3, ((undef10 - 1) <= arg2) /\ (arg3 < 1) /\ (arg2 > 1) /\ (undef10 > 2), par{arg1 -> undef10, arg2 -> undef11, arg3 -> undef12}> <l3, l3, (arg1 > 0) /\ (undef13 > ~(1)), par{arg1 -> undef13, arg2 -> undef14, arg3 -> undef15}> Fresh variables: undef2, undef5, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, Undef variables: undef2, undef5, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: <l2, l2, 1 <= arg2 /\ 1 <= arg3 /\ undef5 <= 2 + arg2 /\ 3 <= undef5, {arg1 -> -1 + arg1, arg2 -> undef5, arg3 -> arg1, rest remain the same}> Variables: arg1, arg2, arg3 Graph 2: Transitions: <l3, l3, 1 <= arg1 /\ 0 <= undef13, {arg1 -> undef13, arg2 -> undef14, arg3 -> undef15, rest remain the same}> Variables: arg1, arg2, arg3 Precedence: Graph 0 Graph 1 <l0, l2, 1 <= undef16 /\ undef2 <= 1 + undef16 /\ 0 <= undef17 /\ 2 <= undef2 /\ 1 + arg1 = undef17 /\ arg2 = undef2 /\ arg3 = undef17, {all remain the same}> Graph 2 <l2, l3, 1 <= arg2 /\ 1 <= undef7 /\ arg3 <= 0, {arg1 -> undef7, arg2 -> undef8, arg3 -> undef9, rest remain the same}> <l2, l3, undef10 <= 1 + arg2 /\ arg3 <= 0 /\ 2 <= arg2 /\ 3 <= undef10, {arg1 -> undef10, arg2 -> undef11, arg3 -> undef12, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 3 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** *******************************************************************************************
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Integ Trans Syste 27634