Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432272855
details
property
value
status
complete
benchmark
alternDivWidening_rec.jar-obl-8.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n001.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
90.7178 seconds
cpu usage
90.5868
user time
86.8673
system time
3.71951
max virtual memory
1084216.0
max residence set size
332432.0
stage attributes
key
value
starexec-result
NO
output
90.50/90.71 NO 90.50/90.71 90.50/90.71 Solver Timeout: 4 90.50/90.71 Global Timeout: 300 90.50/90.71 No parsing errors! 90.50/90.71 Init Location: 0 90.50/90.71 Transitions: 90.50/90.71 <l0, l3, true> 90.50/90.71 <l1, l2, (arg1 > 0) /\ (arg2 > ~(1)), par{arg1 -> 1, arg2 -> 1, arg3 -> arg2}> 90.50/90.71 <l2, l2, (arg3 < 0) /\ (arg3 >= (0 - arg2)) /\ (arg3 <= arg2) /\ (arg2 > 0) /\ (arg3 < (arg2 + 1)) /\ (arg1 > 0), par{arg1 -> (arg2 + 1), arg2 -> (arg2 + 1), arg3 -> 0}> 90.50/90.71 <l2, l2, (arg3 > 0) /\ (arg3 >= (0 - arg2)) /\ (arg3 <= arg2) /\ (arg2 > 0) /\ (arg3 < (arg2 + 1)) /\ (arg1 > 0), par{arg1 -> (arg2 + 1), arg2 -> (arg2 + 1), arg3 -> 0}> 90.50/90.71 <l2, l2, (arg3 < 0) /\ (arg3 < (0 - arg2)) /\ (arg1 > 0) /\ (arg2 > 0), par{arg1 -> (arg2 + 1), arg2 -> (arg2 + 1), arg3 -> ((~(1) * arg3) + 1)}> 90.50/90.71 <l2, l2, (arg3 > 0) /\ (arg3 < (0 - arg2)) /\ (arg1 > 0) /\ (arg2 > 0), par{arg1 -> (arg2 + 1), arg2 -> (arg2 + 1), arg3 -> ((~(1) * arg3) + 1)}> 90.50/90.71 <l2, l2, (arg3 >= (0 - arg2)) /\ (arg3 > 1) /\ (arg2 < arg3) /\ (arg1 > 0) /\ (2 > (~(1) * arg3)) /\ ((arg2 + 1) <= arg3) /\ (arg2 > 0), par{arg1 -> (arg2 + 1), arg2 -> (arg2 + 1), arg3 -> ((~(1) * arg3) - 1)}> 90.50/90.71 <l3, l1, true, par{arg1 -> undef19, arg2 -> undef20, arg3 -> undef21}> 90.50/90.71 90.50/90.71 Fresh variables: 90.50/90.71 undef19, undef20, undef21, 90.50/90.71 90.50/90.71 Undef variables: 90.50/90.71 undef19, undef20, undef21, 90.50/90.71 90.50/90.71 Abstraction variables: 90.50/90.71 90.50/90.71 Exit nodes: 90.50/90.71 90.50/90.71 Accepting locations: 90.50/90.71 90.50/90.71 Asserts: 90.50/90.71 90.50/90.71 Preprocessed LLVMGraph 90.50/90.71 Init Location: 0 90.50/90.71 Transitions: 90.50/90.71 <l0, l2, (arg1 = 1) /\ (arg2 = 1) /\ (arg3 = undef20) /\ (undef19 > 0) /\ (undef20 > ~(1))> 90.50/90.71 <l2, l2, (arg3 < 0) /\ (arg3 >= (0 - arg2)) /\ (arg3 <= arg2) /\ (arg2 > 0) /\ (arg3 < (arg2 + 1)) /\ (arg1 > 0), par{arg1 -> (arg2 + 1), arg2 -> (arg2 + 1), arg3 -> 0}> 90.50/90.71 <l2, l2, (arg3 > 0) /\ (arg3 >= (0 - arg2)) /\ (arg3 <= arg2) /\ (arg2 > 0) /\ (arg3 < (arg2 + 1)) /\ (arg1 > 0), par{arg1 -> (arg2 + 1), arg2 -> (arg2 + 1), arg3 -> 0}> 90.50/90.71 <l2, l2, (arg3 < 0) /\ (arg3 < (0 - arg2)) /\ (arg1 > 0) /\ (arg2 > 0), par{arg1 -> (arg2 + 1), arg2 -> (arg2 + 1), arg3 -> ((~(1) * arg3) + 1)}> 90.50/90.71 <l2, l2, (arg3 >= (0 - arg2)) /\ (arg3 > 1) /\ (arg2 < arg3) /\ (arg1 > 0) /\ (2 > (~(1) * arg3)) /\ ((arg2 + 1) <= arg3) /\ (arg2 > 0), par{arg1 -> (arg2 + 1), arg2 -> (arg2 + 1), arg3 -> ((~(1) * arg3) - 1)}> 90.50/90.71 90.50/90.71 Fresh variables: 90.50/90.71 undef19, undef20, undef21, 90.50/90.71 90.50/90.71 Undef variables: 90.50/90.71 undef19, undef20, undef21, 90.50/90.71 90.50/90.71 Abstraction variables: 90.50/90.71 90.50/90.71 Exit nodes: 90.50/90.71 90.50/90.71 Accepting locations: 90.50/90.71 90.50/90.71 Asserts: 90.50/90.71 90.50/90.71 ************************************************************* 90.50/90.71 ******************************************************************************************* 90.50/90.71 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 90.50/90.71 ******************************************************************************************* 90.50/90.71 90.50/90.71 Init Location: 0 90.50/90.71 Graph 0: 90.50/90.71 Transitions: 90.50/90.71 Variables: 90.50/90.71 90.50/90.71 Graph 1: 90.50/90.71 Transitions: 90.50/90.71 <l2, l2, arg3 <= arg2 /\ 0 <= arg2 + arg3 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + arg3 <= 0, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> 0, rest remain the same}> 90.50/90.71 <l2, l2, arg3 <= arg2 /\ 0 <= arg2 + arg3 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> 0, rest remain the same}> 90.50/90.71 <l2, l2, 1 <= arg1 /\ 1 + arg2 + arg3 <= 0 /\ 1 <= arg2 /\ 1 + arg3 <= 0, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> 1 - arg3, rest remain the same}> 90.50/90.71 <l2, l2, 0 <= arg2 + arg3 /\ 1 <= arg1 /\ 1 + arg2 <= arg3 /\ 1 <= arg2 /\ 2 <= arg3, {arg1 -> 1 + arg2, arg2 -> 1 + arg2, arg3 -> -1 - arg3, rest remain the same}> 90.50/90.71 Variables: 90.50/90.71 arg1, arg2, arg3 90.50/90.71 90.50/90.71 Precedence: 90.50/90.71 Graph 0 90.50/90.71 90.50/90.71 Graph 1 90.50/90.71 <l0, l2, 0 <= undef20 /\ 1 <= undef19 /\ arg3 = undef20 /\ arg1 = 1 /\ arg2 = 1, {all remain the same}> 90.50/90.71 90.50/90.71 Map Locations to Subgraph: 90.50/90.71 ( 0 , 0 ) 90.50/90.71 ( 2 , 1 ) 90.50/90.71 90.50/90.71 ******************************************************************************************* 90.50/90.71 ******************************** CHECKING ASSERTIONS ******************************** 90.50/90.71 ******************************************************************************************* 90.50/90.71 90.50/90.71 Proving termination of subgraph 0 90.50/90.71 Proving termination of subgraph 1 90.50/90.71 Checking unfeasibility... 90.50/90.71 Time used: 0.019752 90.50/90.71 90.50/90.71 Checking conditional termination of SCC {l2}... 90.50/90.71 90.50/90.71 LOG: CALL solveLinear 90.50/90.71 90.50/90.71 LOG: RETURN solveLinear - Elapsed time: 0.003320s 90.50/90.71 90.50/90.71 LOG: CALL solveLinear 90.50/90.71 90.50/90.71 LOG: RETURN solveLinear - Elapsed time: 0.376994s
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