Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integ Trans Syste 27634 pair #381737422
details
property
value
status
complete
benchmark
Et2-rec.jar-obl-8.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n075.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp17
runtime (wallclock)
0.231855154037 seconds
cpu usage
0.557468765
max memory
1.10317568E8
stage attributes
key
value
output-size
10454
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, l3, true> <l1, l2, (arg1 > 0) /\ (0 = arg2), par{arg1 -> 0, arg2 -> 0, arg3 -> 0, arg4 -> 0}> <l1, l2, (arg1 > 0) /\ (undef5 > ~(1)) /\ (1 = arg2), par{arg1 -> undef5, arg2 -> 0, arg3 -> 1, arg4 -> 1}> <l1, l2, (undef10 > ~(1)) /\ (arg2 > 1) /\ (undef9 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef9, arg2 -> undef10, arg3 -> arg2, arg4 -> 2}> <l2, l2, (arg3 > ~(1)) /\ ((arg1 - 1) < arg1) /\ (arg4 >= arg3) /\ (arg2 > 0), par{arg1 -> (arg1 - 1), arg2 -> (arg1 - 1)}> <l2, l2, (arg2 > 0) /\ (arg3 > 0) /\ (arg4 > ~(1)) /\ (arg4 < arg3) /\ ((arg4 + 1) <= arg3) /\ (undef21 > ~(1)), par{arg1 -> ((arg1 - 1) - undef21), arg2 -> ((arg1 - 1) - undef21), arg4 -> (arg4 + 1)}> <l3, l1, true, par{arg1 -> undef22, arg2 -> undef23, arg3 -> undef24, arg4 -> undef25}> Fresh variables: undef5, undef9, undef10, undef21, undef22, undef23, undef24, undef25, Undef variables: undef5, undef9, undef10, undef21, undef22, undef23, undef24, undef25, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: <l0, l2, (undef22 > 0) /\ (0 = undef23), par{arg1 -> 0, arg2 -> 0, arg3 -> 0, arg4 -> 0}> <l0, l2, (undef22 > 0) /\ (undef5 > ~(1)) /\ (1 = undef23), par{arg1 -> undef5, arg2 -> 0, arg3 -> 1, arg4 -> 1}> <l0, l2, (undef10 > ~(1)) /\ (undef23 > 1) /\ (undef9 > ~(1)) /\ (undef22 > 0), par{arg1 -> undef9, arg2 -> undef10, arg3 -> undef23, arg4 -> 2}> <l2, l2, (arg3 > ~(1)) /\ ((arg1 - 1) < arg1) /\ (arg4 >= arg3) /\ (arg2 > 0), par{arg1 -> (arg1 - 1), arg2 -> (arg1 - 1)}> <l2, l2, (arg2 > 0) /\ (arg3 > 0) /\ (arg4 > ~(1)) /\ (arg4 < arg3) /\ ((arg4 + 1) <= arg3) /\ (undef21 > ~(1)), par{arg1 -> ((arg1 - 1) - undef21), arg2 -> ((arg1 - 1) - undef21), arg4 -> (arg4 + 1)}> Fresh variables: undef5, undef9, undef10, undef21, undef22, undef23, undef24, undef25, Undef variables: undef5, undef9, undef10, undef21, undef22, undef23, undef24, undef25, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: <l2, l2, arg3 <= arg4 /\ 0 <= arg3 /\ 1 <= arg2, {arg1 -> -1 + arg1, arg2 -> -1 + arg1, rest remain the same}> <l2, l2, 0 <= arg4 /\ 0 <= undef21 /\ 1 <= arg2 /\ 1 <= arg3 /\ 1 + arg4 <= arg3, {arg1 -> -1 + arg1 - undef21, arg2 -> -1 + arg1 - undef21, arg4 -> 1 + arg4, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Precedence: Graph 0 Graph 1 <l0, l2, 1 <= undef22 /\ undef23 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> 0, arg4 -> 0, rest remain the same}> <l0, l2, 0 <= undef5 /\ 1 <= undef22 /\ undef23 = 1, {arg1 -> undef5, arg2 -> 0, arg3 -> 1, arg4 -> 1, rest remain the same}> <l0, l2, 0 <= undef9 /\ 0 <= undef10 /\ 1 <= undef22 /\ 2 <= undef23, {arg1 -> undef9, arg2 -> undef10, arg3 -> undef23, arg4 -> 2, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.006637 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Integ Trans Syste 27634