Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integ Trans Syste 27634 pair #381738664
details
property
value
status
complete
benchmark
AProVE12-cyclic-Iterate.jar-obl-9.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n014.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp17
runtime (wallclock)
0.108217000961 seconds
cpu usage
0.227805388
max memory
6.8247552E7
stage attributes
key
value
output-size
6654
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, l4, true> <l1, l2, (arg1 > 0) /\ (arg2 > ~(1)), par{arg1 -> (arg2 - 1), arg3 -> 0, arg4 -> undef4}> <l2, l2, (arg2 > 0) /\ (undef7 > arg3) /\ (arg3 > 0), par{arg1 -> (arg1 - 1), arg2 -> arg1, arg3 -> undef7, arg4 -> undef8}> <l2, l2, (arg2 > 0), par{arg1 -> (arg1 - 1), arg2 -> arg1, arg3 -> 1, arg4 -> undef12}> <l2, l3, (arg2 < 1) /\ (arg3 > 0), par{arg1 -> 0, arg2 -> arg3, arg4 -> 0}> <l3, l3, (arg1 > 0) /\ (arg4 > 0) /\ (arg3 > 0) /\ (undef17 > arg1) /\ (arg2 > arg1) /\ (undef19 < arg3) /\ (undef20 < arg4) /\ (undef21 > arg1), par{arg1 -> undef17, arg3 -> undef19, arg4 -> undef20}> <l3, l3, (undef24 < arg2) /\ (arg2 > 0) /\ (undef26 > undef25) /\ (undef26 > ~(1)) /\ (arg2 = arg3), par{arg1 -> 1, arg2 -> undef23, arg3 -> undef24, arg4 -> undef25}> <l4, l1, true, par{arg1 -> undef27, arg2 -> undef28, arg3 -> undef29, arg4 -> undef30}> Fresh variables: undef4, undef7, undef8, undef12, undef17, undef19, undef20, undef21, undef23, undef24, undef25, undef26, undef27, undef28, undef29, undef30, Undef variables: undef4, undef7, undef8, undef12, undef17, undef19, undef20, undef21, undef23, undef24, undef25, undef26, undef27, undef28, undef29, undef30, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l2, (arg1 = (undef28 - 1)) /\ (arg2 = undef28) /\ (arg3 = 0) /\ (arg4 = undef4) /\ (undef27 > 0) /\ (undef28 > ~(1))> <l2, l2, (arg2 > 0) /\ (undef7 > arg3) /\ (arg3 > 0), par{arg1 -> (arg1 - 1), arg2 -> arg1, arg3 -> undef7, arg4 -> undef8}> <l2, l2, (arg2 > 0), par{arg1 -> (arg1 - 1), arg2 -> arg1, arg3 -> 1, arg4 -> undef12}> <l2, l3, (arg2 < 1) /\ (arg3 > 0), par{arg1 -> 0, arg2 -> arg3, arg4 -> 0}> <l3, l3, (arg1 > 0) /\ (arg4 > 0) /\ (arg3 > 0) /\ (undef17 > arg1) /\ (arg2 > arg1) /\ (undef19 < arg3) /\ (undef20 < arg4) /\ (undef21 > arg1), par{arg1 -> undef17, arg3 -> undef19, arg4 -> undef20}> <l3, l3, (undef24 < arg2) /\ (arg2 > 0) /\ (undef26 > undef25) /\ (undef26 > ~(1)) /\ (arg2 = arg3), par{arg1 -> 1, arg2 -> undef23, arg3 -> undef24, arg4 -> undef25}> Fresh variables: undef4, undef7, undef8, undef12, undef17, undef19, undef20, undef21, undef23, undef24, undef25, undef26, undef27, undef28, undef29, undef30, Undef variables: undef4, undef7, undef8, undef12, undef17, undef19, undef20, undef21, undef23, undef24, undef25, undef26, undef27, undef28, undef29, undef30, 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 <= undef7 /\ 1 <= arg3, {arg1 -> -1 + arg1, arg2 -> arg1, arg3 -> undef7, arg4 -> undef8, rest remain the same}> <l2, l2, 1 <= arg2, {arg1 -> -1 + arg1, arg2 -> arg1, arg3 -> 1, arg4 -> undef12, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Graph 2: Transitions: <l3, l3, 1 + arg1 <= arg2 /\ 1 + arg1 <= undef17 /\ 1 + arg1 <= undef21 /\ 1 <= arg1 /\ 1 <= arg3 /\ 1 + undef19 <= arg3 /\ 1 <= arg4 /\ 1 + undef20 <= arg4, {arg1 -> undef17, arg3 -> undef19, arg4 -> undef20, rest remain the same}> <l3, l3, 0 <= undef26 /\ 1 <= arg2 /\ 1 + undef24 <= arg2 /\ 1 + undef25 <= undef26 /\ arg2 = arg3, {arg1 -> 1, arg2 -> undef23, arg3 -> undef24, arg4 -> undef25, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Precedence: Graph 0 Graph 1 <l0, l2, 0 <= undef28 /\ 1 <= undef27 /\ arg2 = undef28 /\ arg3 = 0 /\ arg4 = undef4 /\ 1 + arg1 = undef28, {all remain the same}> Graph 2 <l2, l3, arg2 <= 0 /\ 1 <= arg3, {arg1 -> 0, arg2 -> arg3, arg4 -> 0, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 3 , 2 ) *******************************************************************************************
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Integ Trans Syste 27634