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