Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432273464
details
property
value
status
complete
benchmark
complxStruc_rec.jar-obl-8.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n102.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
27.3849 seconds
cpu usage
27.3551
user time
26.4546
system time
0.900476
max virtual memory
974340.0
max residence set size
281080.0
stage attributes
key
value
starexec-result
NO
output
27.33/27.38 NO 27.33/27.38 27.33/27.38 Solver Timeout: 4 27.33/27.38 Global Timeout: 300 27.33/27.38 No parsing errors! 27.33/27.38 Init Location: 0 27.33/27.38 Transitions: 27.33/27.38 <l0, l4, true> 27.33/27.38 <l1, l2, (arg1 > 0) /\ (arg2 > ~(1)), par{arg1 -> arg2, arg3 -> arg2, arg4 -> undef4}> 27.33/27.38 <l2, l2, (arg1 >= arg2) /\ (arg1 > 1) /\ (arg2 > 4) /\ (arg1 = arg3), par{arg1 -> (arg1 - 1), arg2 -> (arg2 - 1), arg3 -> (arg1 - 1), arg4 -> undef8}> 27.33/27.38 <l2, l3, (arg1 < arg2) /\ (arg2 > 1) /\ ((arg1 + 1) >= (2 * arg2)) /\ (arg1 > 0) /\ (arg1 = arg3), par{arg3 -> (arg1 + 1), arg4 -> (arg2 + 1)}> 27.33/27.38 <l2, l3, (arg1 < arg2) /\ (arg2 > 1) /\ ((arg1 + 1) < (2 * arg2)) /\ (arg1 > 0) /\ (arg1 = arg3), par{arg3 -> (arg1 + 1), arg4 -> (arg2 - 1)}> 27.33/27.38 <l3, l2, (arg1 > 0) /\ (arg2 > 1) /\ (arg3 > 1) /\ (arg4 > 0) /\ (arg2 > arg1) /\ (arg2 >= arg3) /\ (arg1 <= arg4), par{arg1 -> arg3, arg2 -> arg4, arg4 -> undef20}> 27.33/27.38 <l2, l2, (arg1 > 0) /\ (arg1 >= arg2) /\ (arg2 < 5) /\ (((arg1 - 1) - (arg2 + 1)) <= 2) /\ (arg2 > ~(1)) /\ (arg1 = arg3), par{arg1 -> (arg1 - 1), arg2 -> (arg2 + 2), arg3 -> (arg1 - 1), arg4 -> undef24}> 27.33/27.38 <l2, l2, (arg1 > 0) /\ (arg1 >= arg2) /\ (arg2 < 5) /\ (((arg1 - 1) - (arg2 + 1)) > 2) /\ (arg2 > ~(1)) /\ (arg1 = arg3), par{arg2 -> (arg2 + 1), arg3 -> arg1, arg4 -> undef28}> 27.33/27.38 <l4, l1, true, par{arg1 -> undef29, arg2 -> undef30, arg3 -> undef31, arg4 -> undef32}> 27.33/27.38 27.33/27.38 Fresh variables: 27.33/27.38 undef4, undef8, undef20, undef24, undef28, undef29, undef30, undef31, undef32, 27.33/27.38 27.33/27.38 Undef variables: 27.33/27.38 undef4, undef8, undef20, undef24, undef28, undef29, undef30, undef31, undef32, 27.33/27.38 27.33/27.38 Abstraction variables: 27.33/27.38 27.33/27.38 Exit nodes: 27.33/27.38 27.33/27.38 Accepting locations: 27.33/27.38 27.33/27.38 Asserts: 27.33/27.38 27.33/27.38 Preprocessed LLVMGraph 27.33/27.38 Init Location: 0 27.33/27.38 Transitions: 27.33/27.38 <l0, l2, (arg1 = undef30) /\ (arg2 = undef30) /\ (arg3 = undef30) /\ (undef29 > 0) /\ (undef30 > ~(1))> 27.33/27.38 <l2, l2, (arg1 >= arg2) /\ (arg1 > 1) /\ (arg2 > 4) /\ (arg1 = arg3), par{arg1 -> (arg1 - 1), arg2 -> (arg2 - 1), arg3 -> (arg1 - 1)}> 27.33/27.38 <l2, l2, (arg1 < arg2) /\ (arg2 > 1) /\ ((arg1 + 1) < (2 * arg2)) /\ (arg1 > 0) /\ (arg1 = arg3) /\ (arg1 > 0) /\ (arg2 > 1) /\ ((arg1 + 1) > 1) /\ ((arg2 - 1) > 0) /\ (arg2 > arg1) /\ (arg2 >= (arg1 + 1)) /\ (arg1 <= (arg2 - 1)), par{arg1 -> (arg1 + 1), arg2 -> (arg2 - 1), arg3 -> (arg1 + 1)}> 27.33/27.38 <l2, l2, (arg1 > 0) /\ (arg1 >= arg2) /\ (arg2 < 5) /\ (((arg1 - 1) - (arg2 + 1)) <= 2) /\ (arg2 > ~(1)) /\ (arg1 = arg3), par{arg1 -> (arg1 - 1), arg2 -> (arg2 + 2), arg3 -> (arg1 - 1)}> 27.33/27.38 <l2, l2, (arg1 > 0) /\ (arg1 >= arg2) /\ (arg2 < 5) /\ (((arg1 - 1) - (arg2 + 1)) > 2) /\ (arg2 > ~(1)) /\ (arg1 = arg3), par{arg2 -> (arg2 + 1), arg3 -> arg1}> 27.33/27.38 27.33/27.38 Fresh variables: 27.33/27.38 undef4, undef8, undef20, undef24, undef28, undef29, undef30, undef31, undef32, 27.33/27.38 27.33/27.38 Undef variables: 27.33/27.38 undef4, undef8, undef20, undef24, undef28, undef29, undef30, undef31, undef32, 27.33/27.38 27.33/27.38 Abstraction variables: 27.33/27.38 27.33/27.38 Exit nodes: 27.33/27.38 27.33/27.38 Accepting locations: 27.33/27.38 27.33/27.38 Asserts: 27.33/27.38 27.33/27.38 ************************************************************* 27.33/27.38 ******************************************************************************************* 27.33/27.38 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 27.33/27.38 ******************************************************************************************* 27.33/27.38 27.33/27.38 Init Location: 0 27.33/27.38 Graph 0: 27.33/27.38 Transitions: 27.33/27.38 Variables: 27.33/27.38 27.33/27.38 Graph 1: 27.33/27.38 Transitions: 27.33/27.38 <l2, l2, arg2 <= arg1 /\ 2 <= arg1 /\ 5 <= arg2 /\ arg1 = arg3, {arg1 -> -1 + arg1, arg2 -> -1 + arg2, arg3 -> -1 + arg1, rest remain the same}> 27.33/27.38 <l2, l2, 1 + arg1 <= arg2 /\ 1 <= arg1 /\ 2 + arg1 <= 2*arg2 /\ 2 <= arg2 /\ arg1 = arg3, {arg1 -> 1 + arg1, arg2 -> -1 + arg2, arg3 -> 1 + arg1, rest remain the same}> 27.33/27.38 <l2, l2, arg2 <= arg1 /\ 0 <= arg2 /\ 1 <= arg1 /\ arg1 <= 4 + arg2 /\ arg2 <= 4 /\ arg1 = arg3, {arg1 -> -1 + arg1, arg2 -> 2 + arg2, arg3 -> -1 + arg1, rest remain the same}> 27.33/27.38 <l2, l2, 0 <= arg2 /\ 1 <= arg1 /\ 5 + arg2 <= arg1 /\ arg2 <= 4 /\ arg1 = arg3, {arg2 -> 1 + arg2, arg3 -> arg1, rest remain the same}> 27.33/27.38 Variables: 27.33/27.38 arg1, arg2, arg3 27.33/27.38 27.33/27.38 Precedence: 27.33/27.38 Graph 0 27.33/27.38 27.33/27.38 Graph 1 27.33/27.38 <l0, l2, 0 <= undef30 /\ 1 <= undef29 /\ arg1 = undef30 /\ arg2 = undef30 /\ arg3 = undef30, {all remain the same}> 27.33/27.38 27.33/27.38 Map Locations to Subgraph: 27.33/27.38 ( 0 , 0 ) 27.33/27.38 ( 2 , 1 ) 27.33/27.38 27.33/27.38 ******************************************************************************************* 27.33/27.38 ******************************** CHECKING ASSERTIONS ******************************** 27.33/27.38 ******************************************************************************************* 27.33/27.38 27.33/27.38 Proving termination of subgraph 0 27.33/27.38 Proving termination of subgraph 1 27.33/27.38 Checking unfeasibility... 27.33/27.38 Time used: 0.023984 27.33/27.38 �[33mSome transition disabled by a set of invariant(s):�[0m 27.33/27.38 �[36mInvariant at l2: arg3 <= 1 + arg2�[0m 27.33/27.38 27.33/27.38 �[33mStrengthening and disabling transitions...�[0m 27.33/27.38 > It's unfeasible. Removing transition: 27.33/27.38 <l2, l2, 0 <= arg2 /\ 1 <= arg1 /\ 5 + arg2 <= arg1 /\ arg2 <= 4 /\ arg1 = arg3, {arg2 -> 1 + arg2, arg3 -> arg1, rest remain the same}> 27.33/27.38 27.33/27.38 LOG: CALL solverLinear in Graph for feasibility 27.33/27.38
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