Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432273377
details
property
value
status
complete
benchmark
AppE.jar-obl-9.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n111.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
0.049126 seconds
cpu usage
0.049277
user time
0.044019
system time
0.005258
max virtual memory
113180.0
max residence set size
7284.0
stage attributes
key
value
starexec-result
YES
output
0.00/0.04 YES 0.00/0.04 0.00/0.04 Solver Timeout: 4 0.00/0.04 Global Timeout: 300 0.00/0.04 No parsing errors! 0.00/0.04 Init Location: 0 0.00/0.04 Transitions: 0.00/0.04 <l0, l6, true> 0.00/0.04 <l1, l2, (undef1 <= arg2) /\ (arg1 > 0) /\ (arg2 > ~(1)) /\ (undef1 > ~(1)), par{arg1 -> undef1, arg2 -> undef2, arg3 -> undef3}> 0.00/0.04 <l3, l2, (arg1 > 0) /\ (undef4 > ~(1)), par{arg1 -> undef4, arg3 -> undef6}> 0.00/0.04 <l3, l4, (arg2 > ~(1)) /\ (undef7 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef7, arg2 -> undef8, arg3 -> undef9}> 0.00/0.04 <l4, l4, (arg1 > 0), par{arg1 -> (arg1 - 1), arg2 -> undef11, arg3 -> undef12}> 0.00/0.04 <l2, l5, (undef14 > ~(1)) /\ (arg2 > 1) /\ (undef13 <= arg1) /\ ((undef15 + 1) <= arg1) /\ (arg1 > 0) /\ (undef13 > 0) /\ (undef15 > ~(1)), par{arg1 -> undef13, arg2 -> undef14, arg3 -> undef15}> 0.00/0.04 <l5, l5, ((undef16 + 2) <= arg1) /\ (undef16 <= arg3) /\ ((undef18 + 3) <= arg1) /\ ((undef18 + 1) <= arg3) /\ (arg1 > 2) /\ (arg3 > 0) /\ (undef16 > 0) /\ (undef18 > ~(1)), par{arg1 -> undef16, arg3 -> undef18}> 0.00/0.04 <l5, l5, (undef19 <= arg1) /\ (arg2 > 0) /\ ((undef19 - 2) <= arg3) /\ ((undef21 + 2) <= arg1) /\ (undef21 <= arg3) /\ (arg1 > 1) /\ (arg3 > ~(1)) /\ (undef19 > 1) /\ (undef21 > ~(1)), par{arg1 -> undef19, arg2 -> (arg2 - 1), arg3 -> undef21}> 0.00/0.04 <l6, l3, true, par{arg1 -> undef22, arg2 -> undef23, arg3 -> undef24}> 0.00/0.04 0.00/0.04 Fresh variables: 0.00/0.04 undef1, undef2, undef3, undef4, undef6, undef7, undef8, undef9, undef11, undef12, undef13, undef14, undef15, undef16, undef18, undef19, undef21, undef22, undef23, undef24, 0.00/0.04 0.00/0.04 Undef variables: 0.00/0.04 undef1, undef2, undef3, undef4, undef6, undef7, undef8, undef9, undef11, undef12, undef13, undef14, undef15, undef16, undef18, undef19, undef21, undef22, undef23, undef24, 0.00/0.04 0.00/0.04 Abstraction variables: 0.00/0.04 0.00/0.04 Exit nodes: 0.00/0.04 0.00/0.04 Accepting locations: 0.00/0.04 0.00/0.04 Asserts: 0.00/0.04 0.00/0.04 Preprocessed LLVMGraph 0.00/0.04 Init Location: 0 0.00/0.04 Transitions: 0.00/0.04 <l0, l5, (undef22 > 0) /\ (undef4 > ~(1)) /\ (undef14 > ~(1)) /\ (undef23 > 1) /\ (undef13 <= undef4) /\ ((undef15 + 1) <= undef4) /\ (undef4 > 0) /\ (undef13 > 0) /\ (undef15 > ~(1)), par{arg1 -> undef13, arg2 -> undef14, arg3 -> undef15}> 0.00/0.04 <l0, l4, (undef23 > ~(1)) /\ (undef7 > ~(1)) /\ (undef22 > 0), par{arg1 -> undef7, arg2 -> undef8, arg3 -> undef9}> 0.00/0.04 <l4, l4, (arg1 > 0), par{arg1 -> (arg1 - 1), arg2 -> undef11, arg3 -> undef12}> 0.00/0.04 <l5, l5, ((undef16 + 2) <= arg1) /\ (undef16 <= arg3) /\ ((undef18 + 3) <= arg1) /\ ((undef18 + 1) <= arg3) /\ (arg1 > 2) /\ (arg3 > 0) /\ (undef16 > 0) /\ (undef18 > ~(1)), par{arg1 -> undef16, arg3 -> undef18}> 0.00/0.04 <l5, l5, (undef19 <= arg1) /\ (arg2 > 0) /\ ((undef19 - 2) <= arg3) /\ ((undef21 + 2) <= arg1) /\ (undef21 <= arg3) /\ (arg1 > 1) /\ (arg3 > ~(1)) /\ (undef19 > 1) /\ (undef21 > ~(1)), par{arg1 -> undef19, arg2 -> (arg2 - 1), arg3 -> undef21}> 0.00/0.04 0.00/0.04 Fresh variables: 0.00/0.04 undef1, undef2, undef3, undef4, undef6, undef7, undef8, undef9, undef11, undef12, undef13, undef14, undef15, undef16, undef18, undef19, undef21, undef22, undef23, undef24, 0.00/0.04 0.00/0.04 Undef variables: 0.00/0.04 undef1, undef2, undef3, undef4, undef6, undef7, undef8, undef9, undef11, undef12, undef13, undef14, undef15, undef16, undef18, undef19, undef21, undef22, undef23, undef24, 0.00/0.04 0.00/0.04 Abstraction variables: 0.00/0.04 0.00/0.04 Exit nodes: 0.00/0.04 0.00/0.04 Accepting locations: 0.00/0.04 0.00/0.04 Asserts: 0.00/0.04 0.00/0.04 ************************************************************* 0.00/0.04 ******************************************************************************************* 0.00/0.04 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 0.00/0.04 ******************************************************************************************* 0.00/0.04 0.00/0.04 Init Location: 0 0.00/0.04 Graph 0: 0.00/0.04 Transitions: 0.00/0.04 Variables: 0.00/0.04 0.00/0.04 Graph 1: 0.00/0.04 Transitions: 0.00/0.04 <l4, l4, 1 <= arg1, {arg1 -> -1 + arg1, arg2 -> undef11, arg3 -> undef12, rest remain the same}> 0.00/0.04 Variables: 0.00/0.04 arg1, arg2, arg3 0.00/0.04 0.00/0.04 Graph 2: 0.00/0.04 Transitions: 0.00/0.04 <l5, l5, undef16 <= arg3 /\ 0 <= undef18 /\ 1 <= arg3 /\ 1 + undef18 <= arg3 /\ 1 <= undef16 /\ 2 + undef16 <= arg1 /\ 3 <= arg1 /\ 3 + undef18 <= arg1, {arg1 -> undef16, arg3 -> undef18, rest remain the same}> 0.00/0.04 <l5, l5, undef19 <= arg1 /\ 0 <= arg3 /\ undef21 <= arg3 /\ 0 <= undef21 /\ 1 <= arg2 /\ 2 <= arg1 /\ 2 + undef21 <= arg1 /\ 2 <= undef19 /\ undef19 <= 2 + arg3, {arg1 -> undef19, arg2 -> -1 + arg2, arg3 -> undef21, rest remain the same}> 0.00/0.04 Variables: 0.00/0.04 arg1, arg3, arg2 0.00/0.04 0.00/0.04 Precedence: 0.00/0.04 Graph 0 0.00/0.04 0.00/0.04 Graph 1 0.00/0.04 <l0, l4, 0 <= undef7 /\ 0 <= undef23 /\ 1 <= undef22, {arg1 -> undef7, arg2 -> undef8, arg3 -> undef9, rest remain the same}> 0.00/0.04 0.00/0.04 Graph 2 0.00/0.04 <l0, l5, undef13 <= undef4 /\ 0 <= undef14 /\ 0 <= undef15 /\ 1 <= undef4 /\ 1 + undef15 <= undef4 /\ 1 <= undef13 /\ 1 <= undef22 /\ 2 <= undef23, {arg1 -> undef13, arg2 -> undef14, arg3 -> undef15, rest remain the same}> 0.00/0.04 0.00/0.04 Map Locations to Subgraph: 0.00/0.04 ( 0 , 0 ) 0.00/0.04 ( 4 , 1 ) 0.00/0.04 ( 5 , 2 ) 0.00/0.04 0.00/0.04 ******************************************************************************************* 0.00/0.04 ******************************** CHECKING ASSERTIONS ******************************** 0.00/0.04 ******************************************************************************************* 0.00/0.04 0.00/0.04 Proving termination of subgraph 0 0.00/0.04 Proving termination of subgraph 1 0.00/0.04 Checking unfeasibility... 0.00/0.04 Time used: 0.00252 0.00/0.04
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