Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432273851
details
property
value
status
complete
benchmark
Diff.jar-obl-8.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n127.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
0.490404 seconds
cpu usage
0.490573
user time
0.406572
system time
0.084001
max virtual memory
113180.0
max residence set size
67912.0
stage attributes
key
value
starexec-result
YES
output
0.00/0.48 YES 0.00/0.48 0.47/0.48 Solver Timeout: 4 0.47/0.48 Global Timeout: 300 0.47/0.48 No parsing errors! 0.47/0.48 Init Location: 0 0.47/0.48 Transitions: 0.47/0.48 <l0, l4, true> 0.47/0.48 <l1, l2, true, par{arg1 -> 0, arg2 -> 0, arg3 -> 0, arg4 -> undef4, arg5 -> undef5}> 0.47/0.48 <l2, l3, (arg2 < 20) /\ (arg2 = arg3), par{arg3 -> 0, arg4 -> 0, arg5 -> 0}> 0.47/0.48 <l3, l2, (arg4 > 19) /\ (1 = arg3) /\ (arg4 = arg5), par{arg2 -> (arg2 + 1), arg3 -> (arg2 + 1), arg4 -> undef14, arg5 -> undef15}> 0.47/0.48 <l3, l2, (arg4 < 20) /\ (1 = arg3) /\ (arg4 = arg5), par{arg2 -> (arg2 + 1), arg3 -> (arg2 + 1), arg4 -> undef19, arg5 -> undef20}> 0.47/0.48 <l3, l3, (arg2 < 20) /\ (undef26 > undef27) /\ (arg4 < 20) /\ (0 = arg3) /\ (arg4 = arg5), par{arg3 -> 0, arg4 -> (arg4 + 1), arg5 -> (arg4 + 1)}> 0.47/0.48 <l3, l3, (arg2 < 20) /\ (undef33 < undef34) /\ (arg4 < 20) /\ (0 = arg3) /\ (arg4 = arg5), par{arg3 -> 0, arg4 -> (arg4 + 1), arg5 -> (arg4 + 1)}> 0.47/0.48 <l3, l2, (arg1 < 20) /\ (arg2 < 20) /\ (arg4 > 19) /\ (0 = arg3) /\ (arg4 = arg5), par{arg1 -> (arg1 + 1), arg2 -> (arg2 + 1), arg3 -> (arg2 + 1), arg4 -> undef38, arg5 -> undef39}> 0.47/0.48 <l3, l3, (arg4 < 20) /\ (arg2 < 20) /\ (0 = arg3) /\ (arg4 = arg5), par{arg3 -> 1, arg5 -> arg4}> 0.47/0.48 <l4, l1, true, par{arg1 -> undef45, arg2 -> undef46, arg3 -> undef47, arg4 -> undef48, arg5 -> undef49}> 0.47/0.48 0.47/0.48 Fresh variables: 0.47/0.48 undef4, undef5, undef14, undef15, undef19, undef20, undef26, undef27, undef33, undef34, undef38, undef39, undef45, undef46, undef47, undef48, undef49, 0.47/0.48 0.47/0.48 Undef variables: 0.47/0.48 undef4, undef5, undef14, undef15, undef19, undef20, undef26, undef27, undef33, undef34, undef38, undef39, undef45, undef46, undef47, undef48, undef49, 0.47/0.48 0.47/0.48 Abstraction variables: 0.47/0.48 0.47/0.48 Exit nodes: 0.47/0.48 0.47/0.48 Accepting locations: 0.47/0.48 0.47/0.48 Asserts: 0.47/0.48 0.47/0.48 Preprocessed LLVMGraph 0.47/0.48 Init Location: 0 0.47/0.48 Transitions: 0.47/0.48 <l0, l3, (arg1 = 0) /\ (arg2 = 0) /\ (arg3 = 0) /\ (arg4 = 0) /\ (arg5 = 0) /\ (0 < 20) /\ (0 = 0)> 0.47/0.48 <l3, l3, (arg4 > 19) /\ (1 = arg3) /\ (arg4 = arg5) /\ ((arg2 + 1) < 20) /\ ((arg2 + 1) = (arg2 + 1)), par{arg2 -> (arg2 + 1), arg3 -> 0, arg4 -> 0, arg5 -> 0}> 0.47/0.48 <l3, l3, (arg4 < 20) /\ (1 = arg3) /\ (arg4 = arg5) /\ ((arg2 + 1) < 20) /\ ((arg2 + 1) = (arg2 + 1)), par{arg2 -> (arg2 + 1), arg3 -> 0, arg4 -> 0, arg5 -> 0}> 0.47/0.48 <l3, l3, (arg2 < 20) /\ (undef26 > undef27) /\ (arg4 < 20) /\ (0 = arg3) /\ (arg4 = arg5), par{arg3 -> 0, arg4 -> (arg4 + 1), arg5 -> (arg4 + 1)}> 0.47/0.48 <l3, l3, (arg2 < 20) /\ (undef33 < undef34) /\ (arg4 < 20) /\ (0 = arg3) /\ (arg4 = arg5), par{arg3 -> 0, arg4 -> (arg4 + 1), arg5 -> (arg4 + 1)}> 0.47/0.48 <l3, l3, (arg1 < 20) /\ (arg2 < 20) /\ (arg4 > 19) /\ (0 = arg3) /\ (arg4 = arg5) /\ ((arg2 + 1) < 20) /\ ((arg2 + 1) = (arg2 + 1)), par{arg1 -> (arg1 + 1), arg2 -> (arg2 + 1), arg3 -> 0, arg4 -> 0, arg5 -> 0}> 0.47/0.48 <l3, l3, (arg4 < 20) /\ (arg2 < 20) /\ (0 = arg3) /\ (arg4 = arg5), par{arg3 -> 1, arg5 -> arg4}> 0.47/0.48 0.47/0.48 Fresh variables: 0.47/0.48 undef4, undef5, undef14, undef15, undef19, undef20, undef26, undef27, undef33, undef34, undef38, undef39, undef45, undef46, undef47, undef48, undef49, 0.47/0.48 0.47/0.48 Undef variables: 0.47/0.48 undef4, undef5, undef14, undef15, undef19, undef20, undef26, undef27, undef33, undef34, undef38, undef39, undef45, undef46, undef47, undef48, undef49, 0.47/0.48 0.47/0.48 Abstraction variables: 0.47/0.48 0.47/0.48 Exit nodes: 0.47/0.48 0.47/0.48 Accepting locations: 0.47/0.48 0.47/0.48 Asserts: 0.47/0.48 0.47/0.48 ************************************************************* 0.47/0.48 ******************************************************************************************* 0.47/0.48 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 0.47/0.48 ******************************************************************************************* 0.47/0.48 0.47/0.48 Init Location: 0 0.47/0.48 Graph 0: 0.47/0.48 Transitions: 0.47/0.48 Variables: 0.47/0.48 0.47/0.48 Graph 1: 0.47/0.48 Transitions: 0.47/0.48 <l3, l3, 20 <= arg4 /\ arg2 <= 18 /\ arg4 = arg5 /\ arg3 = 1, {arg2 -> 1 + arg2, arg3 -> 0, arg4 -> 0, arg5 -> 0, rest remain the same}> 0.47/0.48 <l3, l3, arg4 <= 19 /\ arg2 <= 18 /\ arg4 = arg5 /\ arg3 = 1, {arg2 -> 1 + arg2, arg3 -> 0, arg4 -> 0, arg5 -> 0, rest remain the same}> 0.47/0.48 <l3, l3, 1 + undef27 <= undef26 /\ arg2 <= 19 /\ arg4 <= 19 /\ arg3 = 0 /\ arg4 = arg5, {arg3 -> 0, arg4 -> 1 + arg4, arg5 -> 1 + arg4, rest remain the same}> 0.47/0.48 <l3, l3, 1 + undef33 <= undef34 /\ arg2 <= 19 /\ arg4 <= 19 /\ arg3 = 0 /\ arg4 = arg5, {arg3 -> 0, arg4 -> 1 + arg4, arg5 -> 1 + arg4, rest remain the same}> 0.47/0.48 <l3, l3, 20 <= arg4 /\ arg1 <= 19 /\ arg2 <= 18 /\ arg3 = 0 /\ arg4 = arg5, {arg1 -> 1 + arg1, arg2 -> 1 + arg2, arg3 -> 0, arg4 -> 0, arg5 -> 0, rest remain the same}> 0.47/0.48 <l3, l3, arg2 <= 19 /\ arg4 <= 19 /\ arg3 = 0 /\ arg4 = arg5, {arg3 -> 1, arg5 -> arg4, rest remain the same}> 0.47/0.48 Variables: 0.47/0.48 arg2, arg3, arg4, arg5, arg1 0.47/0.48 0.47/0.48 Precedence: 0.47/0.48 Graph 0 0.47/0.48 0.47/0.48 Graph 1 0.47/0.48 <l0, l3, arg1 = 0 /\ arg2 = 0 /\ arg3 = 0 /\ arg4 = 0 /\ arg5 = 0, {all remain the same}> 0.47/0.48 0.47/0.48 Map Locations to Subgraph: 0.47/0.48 ( 0 , 0 ) 0.47/0.48 ( 3 , 1 ) 0.47/0.48 0.47/0.48 ******************************************************************************************* 0.47/0.48 ******************************** CHECKING ASSERTIONS ******************************** 0.47/0.48 ******************************************************************************************* 0.47/0.48 0.47/0.48 Proving termination of subgraph 0 0.47/0.48 Proving termination of subgraph 1 0.47/0.48 Checking unfeasibility... 0.47/0.48 Time used: 0.141351 0.47/0.48 �[33mSome transition disabled by a set of invariant(s):�[0m 0.47/0.48 �[36mInvariant at l3: arg3 + arg5 <= 20�[0m 0.47/0.48 0.47/0.48 �[33mStrengthening and disabling transitions...�[0m
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