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