Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432273344
details
property
value
status
complete
benchmark
CAppE.jar-obl-9.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n037.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
0.038737 seconds
cpu usage
0.028002
user time
0.022075
system time
0.005927
max virtual memory
113176.0
max residence set size
5516.0
stage attributes
key
value
starexec-result
YES
output
0.00/0.03 YES 0.00/0.03 0.00/0.03 Solver Timeout: 4 0.00/0.03 Global Timeout: 300 0.00/0.03 No parsing errors! 0.00/0.03 Init Location: 0 0.00/0.03 Transitions: 0.00/0.03 <l0, l6, true> 0.00/0.03 <l1, l2, (arg1 > 0), par{arg1 -> undef1, arg2 -> undef2}> 0.00/0.03 <l3, l2, (arg1 > 0), par{arg1 -> arg2, arg2 -> undef4}> 0.00/0.03 <l3, l4, (arg2 > ~(1)) /\ (undef5 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef5, arg2 -> undef6}> 0.00/0.03 <l4, l4, (arg1 > 0), par{arg1 -> (arg1 - 1), arg2 -> undef8}> 0.00/0.03 <l2, l5, (undef9 > 0) /\ (arg1 > 1), par{arg1 -> undef9, arg2 -> undef10}> 0.00/0.03 <l5, l5, (arg1 > 0), par{arg1 -> (arg1 - 1), arg2 -> undef12}> 0.00/0.03 <l6, l3, true, par{arg1 -> undef13, arg2 -> undef14}> 0.00/0.03 0.00/0.03 Fresh variables: 0.00/0.03 undef1, undef2, undef4, undef5, undef6, undef8, undef9, undef10, undef12, undef13, undef14, 0.00/0.03 0.00/0.03 Undef variables: 0.00/0.03 undef1, undef2, undef4, undef5, undef6, undef8, undef9, undef10, undef12, undef13, undef14, 0.00/0.03 0.00/0.03 Abstraction variables: 0.00/0.03 0.00/0.03 Exit nodes: 0.00/0.03 0.00/0.03 Accepting locations: 0.00/0.03 0.00/0.03 Asserts: 0.00/0.03 0.00/0.03 Preprocessed LLVMGraph 0.00/0.03 Init Location: 0 0.00/0.03 Transitions: 0.00/0.03 <l0, l5, (undef13 > 0) /\ (undef9 > 0) /\ (undef14 > 1), par{arg1 -> undef9}> 0.00/0.03 <l0, l4, (undef14 > ~(1)) /\ (undef5 > ~(1)) /\ (undef13 > 0), par{arg1 -> undef5}> 0.00/0.03 <l4, l4, (arg1 > 0), par{arg1 -> (arg1 - 1)}> 0.00/0.03 <l5, l5, (arg1 > 0), par{arg1 -> (arg1 - 1)}> 0.00/0.03 0.00/0.03 Fresh variables: 0.00/0.03 undef1, undef2, undef4, undef5, undef6, undef8, undef9, undef10, undef12, undef13, undef14, 0.00/0.03 0.00/0.03 Undef variables: 0.00/0.03 undef1, undef2, undef4, undef5, undef6, undef8, undef9, undef10, undef12, undef13, undef14, 0.00/0.03 0.00/0.03 Abstraction variables: 0.00/0.03 0.00/0.03 Exit nodes: 0.00/0.03 0.00/0.03 Accepting locations: 0.00/0.03 0.00/0.03 Asserts: 0.00/0.03 0.00/0.03 ************************************************************* 0.00/0.03 ******************************************************************************************* 0.00/0.03 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 0.00/0.03 ******************************************************************************************* 0.00/0.03 0.00/0.03 Init Location: 0 0.00/0.03 Graph 0: 0.00/0.03 Transitions: 0.00/0.03 Variables: 0.00/0.03 0.00/0.03 Graph 1: 0.00/0.03 Transitions: 0.00/0.03 <l4, l4, 1 <= arg1, {arg1 -> -1 + arg1, rest remain the same}> 0.00/0.03 Variables: 0.00/0.03 arg1 0.00/0.03 0.00/0.03 Graph 2: 0.00/0.03 Transitions: 0.00/0.03 <l5, l5, 1 <= arg1, {arg1 -> -1 + arg1, rest remain the same}> 0.00/0.03 Variables: 0.00/0.03 arg1 0.00/0.03 0.00/0.03 Precedence: 0.00/0.03 Graph 0 0.00/0.03 0.00/0.03 Graph 1 0.00/0.03 <l0, l4, 0 <= undef5 /\ 0 <= undef14 /\ 1 <= undef13, {arg1 -> undef5, rest remain the same}> 0.00/0.03 0.00/0.03 Graph 2 0.00/0.03 <l0, l5, 1 <= undef9 /\ 1 <= undef13 /\ 2 <= undef14, {arg1 -> undef9, rest remain the same}> 0.00/0.03 0.00/0.03 Map Locations to Subgraph: 0.00/0.03 ( 0 , 0 ) 0.00/0.03 ( 4 , 1 ) 0.00/0.03 ( 5 , 2 ) 0.00/0.03 0.00/0.03 ******************************************************************************************* 0.00/0.03 ******************************** CHECKING ASSERTIONS ******************************** 0.00/0.03 ******************************************************************************************* 0.00/0.03 0.00/0.03 Proving termination of subgraph 0 0.00/0.03 Proving termination of subgraph 1 0.00/0.03 Checking unfeasibility... 0.00/0.03 Time used: 0.00161 0.00/0.03 0.00/0.03 Checking conditional termination of SCC {l4}... 0.00/0.03 0.00/0.03 LOG: CALL solveLinear
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Integer_Transition_Systems 2019-03-29 01.54