Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432273242
details
property
value
status
complete
benchmark
ListContent.jar-obl-9.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n039.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
5.23257 seconds
cpu usage
5.23233
user time
4.98138
system time
0.250953
max virtual memory
746704.0
max residence set size
78628.0
stage attributes
key
value
starexec-result
NO
output
5.20/5.23 NO 5.20/5.23 5.20/5.23 Solver Timeout: 4 5.20/5.23 Global Timeout: 300 5.20/5.23 No parsing errors! 5.20/5.23 Init Location: 0 5.20/5.23 Transitions: 5.20/5.23 <l0, l5, true> 5.20/5.23 <l1, l2, (undef1 <= arg1) /\ (arg1 > ~(1)) /\ (undef1 > ~(1)), par{arg1 -> undef1, arg2 -> undef2}> 5.20/5.23 <l3, l2, (arg1 > 0) /\ (undef3 > ~(1)), par{arg1 -> undef3, arg2 -> undef4}> 5.20/5.23 <l2, l2, (undef5 <= arg1) /\ (undef7 > 0) /\ (arg1 > 0) /\ (undef5 > 0), par{arg1 -> undef5, arg2 -> undef6}> 5.20/5.23 <l3, l4, (arg2 > ~(1)) /\ (undef8 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef8, arg2 -> 1}> 5.20/5.23 <l4, l4, (arg1 > 0) /\ (arg2 > 0), par{arg1 -> (arg1 - 1), arg2 -> (arg2 + 1)}> 5.20/5.23 <l5, l3, true, par{arg1 -> undef12, arg2 -> undef13}> 5.20/5.23 5.20/5.23 Fresh variables: 5.20/5.23 undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef12, undef13, 5.20/5.23 5.20/5.23 Undef variables: 5.20/5.23 undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef12, undef13, 5.20/5.23 5.20/5.23 Abstraction variables: 5.20/5.23 5.20/5.23 Exit nodes: 5.20/5.23 5.20/5.23 Accepting locations: 5.20/5.23 5.20/5.23 Asserts: 5.20/5.23 5.20/5.23 Preprocessed LLVMGraph 5.20/5.23 Init Location: 0 5.20/5.23 Transitions: 5.20/5.23 <l0, l2, (undef12 > 0) /\ (undef3 > ~(1)), par{arg1 -> undef3, arg2 -> undef4}> 5.20/5.23 <l0, l4, (undef13 > ~(1)) /\ (undef8 > ~(1)) /\ (undef12 > 0), par{arg1 -> undef8, arg2 -> 1}> 5.20/5.23 <l2, l2, (undef5 <= arg1) /\ (undef7 > 0) /\ (arg1 > 0) /\ (undef5 > 0), par{arg1 -> undef5, arg2 -> undef6}> 5.20/5.23 <l4, l4, (arg1 > 0) /\ (arg2 > 0), par{arg1 -> (arg1 - 1), arg2 -> (arg2 + 1)}> 5.20/5.23 5.20/5.23 Fresh variables: 5.20/5.23 undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef12, undef13, 5.20/5.23 5.20/5.23 Undef variables: 5.20/5.23 undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef12, undef13, 5.20/5.23 5.20/5.23 Abstraction variables: 5.20/5.23 5.20/5.23 Exit nodes: 5.20/5.23 5.20/5.23 Accepting locations: 5.20/5.23 5.20/5.23 Asserts: 5.20/5.23 5.20/5.23 ************************************************************* 5.20/5.23 ******************************************************************************************* 5.20/5.23 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 5.20/5.23 ******************************************************************************************* 5.20/5.23 5.20/5.23 Init Location: 0 5.20/5.23 Graph 0: 5.20/5.23 Transitions: 5.20/5.23 Variables: 5.20/5.23 5.20/5.23 Graph 1: 5.20/5.23 Transitions: 5.20/5.23 <l4, l4, 1 <= arg1 /\ 1 <= arg2, {arg1 -> -1 + arg1, arg2 -> 1 + arg2, rest remain the same}> 5.20/5.23 Variables: 5.20/5.23 arg1, arg2 5.20/5.23 5.20/5.23 Graph 2: 5.20/5.23 Transitions: 5.20/5.23 <l2, l2, 1 <= arg1 /\ 1 <= undef5 /\ 1 <= undef7 /\ undef5 <= arg1, {arg1 -> undef5, arg2 -> undef6, rest remain the same}> 5.20/5.23 Variables: 5.20/5.23 arg1, arg2 5.20/5.23 5.20/5.23 Precedence: 5.20/5.23 Graph 0 5.20/5.23 5.20/5.23 Graph 1 5.20/5.23 <l0, l4, 1 <= undef12 /\ 0 <= undef8 /\ 0 <= undef13, {arg1 -> undef8, arg2 -> 1, rest remain the same}> 5.20/5.23 5.20/5.23 Graph 2 5.20/5.23 <l0, l2, 1 <= undef12 /\ 0 <= undef3, {arg1 -> undef3, arg2 -> undef4, rest remain the same}> 5.20/5.23 5.20/5.23 Map Locations to Subgraph: 5.20/5.23 ( 0 , 0 ) 5.20/5.23 ( 2 , 2 ) 5.20/5.23 ( 4 , 1 ) 5.20/5.23 5.20/5.23 ******************************************************************************************* 5.20/5.23 ******************************** CHECKING ASSERTIONS ******************************** 5.20/5.23 ******************************************************************************************* 5.20/5.23 5.20/5.23 Proving termination of subgraph 0 5.20/5.23 Proving termination of subgraph 1 5.20/5.23 Checking unfeasibility... 5.20/5.23 Time used: 0.002451 5.20/5.23 5.20/5.23 Checking conditional termination of SCC {l4}... 5.20/5.23 5.20/5.23 LOG: CALL solveLinear 5.20/5.23
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