Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432273287
details
property
value
status
complete
benchmark
Et4.jar-obl-8.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n103.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
65.1615 seconds
cpu usage
65.0647
user time
62.513
system time
2.55175
max virtual memory
959560.0
max residence set size
287096.0
stage attributes
key
value
starexec-result
YES
output
64.99/65.15 YES 64.99/65.15 64.99/65.15 Solver Timeout: 4 64.99/65.15 Global Timeout: 300 64.99/65.15 No parsing errors! 64.99/65.15 Init Location: 0 64.99/65.15 Transitions: 64.99/65.15 <l0, l3, true> 64.99/65.15 <l1, l2, (undef1 <= arg1) /\ (arg1 > 0) /\ (undef1 > 0) /\ (0 = arg2), par{arg1 -> undef1, arg2 -> 0, arg3 -> 0, arg4 -> 0, arg5 -> 0, arg6 -> 0, arg7 -> 0}> 64.99/65.15 <l1, l2, (undef8 <= arg1) /\ (undef9 > ~(1)) /\ (arg1 > 0) /\ (undef8 > 0) /\ (1 = arg2), par{arg1 -> undef8, arg2 -> undef9, arg3 -> 0, arg4 -> 0, arg5 -> 1, arg6 -> 1, arg7 -> 1}> 64.99/65.15 <l1, l2, (undef16 > ~(1)) /\ (undef18 > ~(1)) /\ (undef15 <= arg1) /\ (arg1 > 0) /\ (undef15 > 0) /\ (2 = arg2), par{arg1 -> undef15, arg2 -> undef16, arg3 -> 0, arg4 -> undef18, arg5 -> 2, arg6 -> 2, arg7 -> 2}> 64.99/65.15 <l1, l2, (undef23 > ~(1)) /\ (arg2 > 2) /\ (undef29 > ~(1)) /\ (undef24 > ~(1)) /\ (arg1 >= undef22) /\ (arg1 > 0) /\ (undef22 > 0), par{arg1 -> undef22, arg2 -> undef23, arg3 -> undef24, arg4 -> (undef29 - undef24), arg5 -> arg2, arg6 -> 3, arg7 -> arg2}> 64.99/65.15 <l2, l2, (arg4 > 0) /\ (arg2 > ~(1)) /\ (arg6 >= arg5) /\ (arg5 > ~(1)) /\ (undef30 <= arg1) /\ (arg1 > 0) /\ (undef30 > 0) /\ (arg2 = arg3) /\ (arg5 = arg7), par{arg1 -> undef30, arg2 -> (arg2 + 1), arg3 -> (arg2 + 1), arg4 -> (10 - (arg2 + 1)), arg7 -> arg5}> 64.99/65.15 <l2, l2, (arg5 > ~(1)) /\ (arg4 > 0) /\ (arg6 > ~(1)) /\ (arg6 < arg5) /\ (undef44 > ~(1)) /\ (arg2 > ~(1)) /\ (((arg2 + 1) + undef44) >= 0) /\ (undef37 <= arg1) /\ (arg1 > 0) /\ (undef37 > 0) /\ (arg2 = arg3) /\ (arg5 = arg7), par{arg1 -> undef37, arg2 -> ((arg2 + 1) + undef44), arg3 -> ((arg2 + 1) + undef44), arg4 -> (10 - ((arg2 + 1) + undef44)), arg6 -> (arg6 + 1), arg7 -> arg5}> 64.99/65.15 <l3, l1, true, par{arg1 -> undef45, arg2 -> undef46, arg3 -> undef47, arg4 -> undef48, arg5 -> undef49, arg6 -> undef50, arg7 -> undef51}> 64.99/65.15 64.99/65.15 Fresh variables: 64.99/65.15 undef1, undef8, undef9, undef15, undef16, undef18, undef22, undef23, undef24, undef29, undef30, undef37, undef44, undef45, undef46, undef47, undef48, undef49, undef50, undef51, 64.99/65.15 64.99/65.15 Undef variables: 64.99/65.15 undef1, undef8, undef9, undef15, undef16, undef18, undef22, undef23, undef24, undef29, undef30, undef37, undef44, undef45, undef46, undef47, undef48, undef49, undef50, undef51, 64.99/65.15 64.99/65.15 Abstraction variables: 64.99/65.15 64.99/65.15 Exit nodes: 64.99/65.15 64.99/65.15 Accepting locations: 64.99/65.15 64.99/65.15 Asserts: 64.99/65.15 64.99/65.15 Preprocessed LLVMGraph 64.99/65.15 Init Location: 0 64.99/65.15 Transitions: 64.99/65.15 <l0, l2, (undef1 <= undef45) /\ (undef45 > 0) /\ (undef1 > 0) /\ (0 = undef46), par{arg1 -> undef1, arg2 -> 0, arg3 -> 0, arg4 -> 0, arg5 -> 0, arg6 -> 0, arg7 -> 0}> 64.99/65.15 <l0, l2, (undef8 <= undef45) /\ (undef9 > ~(1)) /\ (undef45 > 0) /\ (undef8 > 0) /\ (1 = undef46), par{arg1 -> undef8, arg2 -> undef9, arg3 -> 0, arg4 -> 0, arg5 -> 1, arg6 -> 1, arg7 -> 1}> 64.99/65.15 <l0, l2, (undef16 > ~(1)) /\ (undef18 > ~(1)) /\ (undef15 <= undef45) /\ (undef45 > 0) /\ (undef15 > 0) /\ (2 = undef46), par{arg1 -> undef15, arg2 -> undef16, arg3 -> 0, arg4 -> undef18, arg5 -> 2, arg6 -> 2, arg7 -> 2}> 64.99/65.15 <l0, l2, (undef23 > ~(1)) /\ (undef46 > 2) /\ (undef29 > ~(1)) /\ (undef24 > ~(1)) /\ (undef45 >= undef22) /\ (undef45 > 0) /\ (undef22 > 0), par{arg1 -> undef22, arg2 -> undef23, arg3 -> undef24, arg4 -> (undef29 - undef24), arg5 -> undef46, arg6 -> 3, arg7 -> undef46}> 64.99/65.15 <l2, l2, (arg4 > 0) /\ (arg2 > ~(1)) /\ (arg6 >= arg5) /\ (arg5 > ~(1)) /\ (undef30 <= arg1) /\ (arg1 > 0) /\ (undef30 > 0) /\ (arg2 = arg3) /\ (arg5 = arg7), par{arg1 -> undef30, arg2 -> (arg2 + 1), arg3 -> (arg2 + 1), arg4 -> (10 - (arg2 + 1)), arg7 -> arg5}> 64.99/65.15 <l2, l2, (arg5 > ~(1)) /\ (arg4 > 0) /\ (arg6 > ~(1)) /\ (arg6 < arg5) /\ (undef44 > ~(1)) /\ (arg2 > ~(1)) /\ (((arg2 + 1) + undef44) >= 0) /\ (undef37 <= arg1) /\ (arg1 > 0) /\ (undef37 > 0) /\ (arg2 = arg3) /\ (arg5 = arg7), par{arg1 -> undef37, arg2 -> ((arg2 + 1) + undef44), arg3 -> ((arg2 + 1) + undef44), arg4 -> (10 - ((arg2 + 1) + undef44)), arg6 -> (arg6 + 1), arg7 -> arg5}> 64.99/65.15 64.99/65.15 Fresh variables: 64.99/65.15 undef1, undef8, undef9, undef15, undef16, undef18, undef22, undef23, undef24, undef29, undef30, undef37, undef44, undef45, undef46, undef47, undef48, undef49, undef50, undef51, 64.99/65.15 64.99/65.15 Undef variables: 64.99/65.15 undef1, undef8, undef9, undef15, undef16, undef18, undef22, undef23, undef24, undef29, undef30, undef37, undef44, undef45, undef46, undef47, undef48, undef49, undef50, undef51, 64.99/65.15 64.99/65.15 Abstraction variables: 64.99/65.15 64.99/65.15 Exit nodes: 64.99/65.15 64.99/65.15 Accepting locations: 64.99/65.15 64.99/65.15 Asserts: 64.99/65.15 64.99/65.15 ************************************************************* 64.99/65.15 ******************************************************************************************* 64.99/65.15 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 64.99/65.15 ******************************************************************************************* 64.99/65.15 64.99/65.15 Init Location: 0 64.99/65.15 Graph 0: 64.99/65.15 Transitions: 64.99/65.15 Variables: 64.99/65.15 64.99/65.15 Graph 1: 64.99/65.15 Transitions: 64.99/65.15 <l2, l2, undef30 <= arg1 /\ 0 <= arg2 /\ arg5 <= arg6 /\ 0 <= arg5 /\ 1 <= arg1 /\ 1 <= arg4 /\ 1 <= undef30 /\ arg2 = arg3 /\ arg5 = arg7, {arg1 -> undef30, arg2 -> 1 + arg2, arg3 -> 1 + arg2, arg4 -> 9 - arg2, arg7 -> arg5, rest remain the same}> 64.99/65.15 <l2, l2, undef37 <= arg1 /\ 0 <= arg2 /\ 0 <= arg5 /\ 0 <= arg6 /\ 0 <= undef44 /\ 1 <= arg1 /\ 1 <= arg4 /\ 1 + arg6 <= arg5 /\ 1 <= undef37 /\ 0 <= 1 + arg2 + undef44 /\ arg2 = arg3 /\ arg5 = arg7, {arg1 -> undef37, arg2 -> 1 + arg2 + undef44, arg3 -> 1 + arg2 + undef44, arg4 -> 9 - arg2 - undef44, arg6 -> 1 + arg6, arg7 -> arg5, rest remain the same}> 64.99/65.15 Variables: 64.99/65.15 arg1, arg2, arg3, arg4, arg5, arg6, arg7 64.99/65.15 64.99/65.15 Precedence: 64.99/65.15 Graph 0 64.99/65.15 64.99/65.15 Graph 1 64.99/65.15 <l0, l2, undef1 <= undef45 /\ 1 <= undef1 /\ 1 <= undef45 /\ undef46 = 0, {arg1 -> undef1, arg2 -> 0, arg3 -> 0, arg4 -> 0, arg5 -> 0, arg6 -> 0, arg7 -> 0, rest remain the same}> 64.99/65.15 <l0, l2, undef8 <= undef45 /\ 0 <= undef9 /\ 1 <= undef8 /\ 1 <= undef45 /\ undef46 = 1, {arg1 -> undef8, arg2 -> undef9, arg3 -> 0, arg4 -> 0, arg5 -> 1, arg6 -> 1, arg7 -> 1, rest remain the same}> 64.99/65.15 <l0, l2, undef15 <= undef45 /\ 0 <= undef16 /\ 0 <= undef18 /\ 1 <= undef15 /\ 1 <= undef45 /\ undef46 = 2, {arg1 -> undef15, arg2 -> undef16, arg3 -> 0, arg4 -> undef18, arg5 -> 2, arg6 -> 2, arg7 -> 2, rest remain the same}> 64.99/65.15 <l0, l2, undef22 <= undef45 /\ 0 <= undef23 /\ 0 <= undef24 /\ 0 <= undef29 /\ 1 <= undef22 /\ 1 <= undef45 /\ 3 <= undef46, {arg1 -> undef22, arg2 -> undef23, arg3 -> undef24, arg4 -> -undef24 + undef29, arg5 -> undef46, arg6 -> 3, arg7 -> undef46, rest remain the same}> 64.99/65.15 64.99/65.15 Map Locations to Subgraph: 64.99/65.15 ( 0 , 0 ) 64.99/65.15 ( 2 , 1 ) 64.99/65.15 64.99/65.15 ******************************************************************************************* 64.99/65.15 ******************************** CHECKING ASSERTIONS ******************************** 64.99/65.15 ******************************************************************************************* 64.99/65.15 64.99/65.15 Proving termination of subgraph 0 64.99/65.15 Proving termination of subgraph 1 64.99/65.15 Checking unfeasibility... 64.99/65.15 Time used: 0.635529 64.99/65.15 64.99/65.15 Checking conditional termination of SCC {l2}... 64.99/65.15 64.99/65.15 LOG: CALL solveLinear 64.99/65.15 64.99/65.15 LOG: RETURN solveLinear - Elapsed time: 0.005873s 64.99/65.15 �[33mRanking function: �[36m-4 + 4*arg5 - 4*arg6�[0m 64.99/65.15 New Graphs:
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