Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432273500
details
property
value
status
complete
benchmark
FactSLR.jar-obl-8.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n009.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
0.0704779 seconds
cpu usage
0.070604
user time
0.057862
system time
0.012742
max virtual memory
113176.0
max residence set size
11744.0
stage attributes
key
value
starexec-result
YES
output
0.00/0.06 YES 0.00/0.06 0.00/0.06 Solver Timeout: 4 0.00/0.06 Global Timeout: 300 0.00/0.06 No parsing errors! 0.00/0.06 Init Location: 0 0.00/0.06 Transitions: 0.00/0.06 <l0, l3, true> 0.00/0.06 <l1, l2, (arg1 > 0) /\ (0 = arg2), par{arg1 -> ~(1), arg2 -> 0, arg3 -> 0, arg4 -> 0}> 0.00/0.06 <l1, l2, (undef9 > ~(1)) /\ (arg2 > 0) /\ (arg1 > 0), par{arg1 -> ((3 * undef9) - 1), arg2 -> (3 * undef9), arg3 -> arg2, arg4 -> 1}> 0.00/0.06 <l2, l2, (arg2 > 0) /\ (arg4 >= arg3) /\ (arg3 > ~(1)), par{arg1 -> (arg1 - 1), arg2 -> arg1}> 0.00/0.06 <l2, l2, (arg2 > 0) /\ (arg3 > ~(1)) /\ (arg4 > ~(1)) /\ (arg4 < arg3), par{arg1 -> (arg1 - 1), arg2 -> arg1, arg4 -> (arg4 + 1)}> 0.00/0.06 <l3, l1, true, par{arg1 -> undef18, arg2 -> undef19, arg3 -> undef20, arg4 -> undef21}> 0.00/0.06 0.00/0.06 Fresh variables: 0.00/0.06 undef9, undef18, undef19, undef20, undef21, 0.00/0.06 0.00/0.06 Undef variables: 0.00/0.06 undef9, undef18, undef19, undef20, undef21, 0.00/0.06 0.00/0.06 Abstraction variables: 0.00/0.06 0.00/0.06 Exit nodes: 0.00/0.06 0.00/0.06 Accepting locations: 0.00/0.06 0.00/0.06 Asserts: 0.00/0.06 0.00/0.06 Preprocessed LLVMGraph 0.00/0.06 Init Location: 0 0.00/0.06 Transitions: 0.00/0.06 <l0, l2, (undef18 > 0) /\ (0 = undef19), par{arg1 -> ~(1), arg2 -> 0, arg3 -> 0, arg4 -> 0}> 0.00/0.06 <l0, l2, (undef9 > ~(1)) /\ (undef19 > 0) /\ (undef18 > 0), par{arg1 -> ((3 * undef9) - 1), arg2 -> (3 * undef9), arg3 -> undef19, arg4 -> 1}> 0.00/0.06 <l2, l2, (arg2 > 0) /\ (arg4 >= arg3) /\ (arg3 > ~(1)), par{arg1 -> (arg1 - 1), arg2 -> arg1}> 0.00/0.06 <l2, l2, (arg2 > 0) /\ (arg3 > ~(1)) /\ (arg4 > ~(1)) /\ (arg4 < arg3), par{arg1 -> (arg1 - 1), arg2 -> arg1, arg4 -> (arg4 + 1)}> 0.00/0.06 0.00/0.06 Fresh variables: 0.00/0.06 undef9, undef18, undef19, undef20, undef21, 0.00/0.06 0.00/0.06 Undef variables: 0.00/0.06 undef9, undef18, undef19, undef20, undef21, 0.00/0.06 0.00/0.06 Abstraction variables: 0.00/0.06 0.00/0.06 Exit nodes: 0.00/0.06 0.00/0.06 Accepting locations: 0.00/0.06 0.00/0.06 Asserts: 0.00/0.06 0.00/0.06 ************************************************************* 0.00/0.06 ******************************************************************************************* 0.00/0.06 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 0.00/0.06 ******************************************************************************************* 0.00/0.06 0.00/0.06 Init Location: 0 0.00/0.06 Graph 0: 0.00/0.06 Transitions: 0.00/0.06 Variables: 0.00/0.06 0.00/0.06 Graph 1: 0.00/0.06 Transitions: 0.00/0.06 <l2, l2, arg3 <= arg4 /\ 0 <= arg3 /\ 1 <= arg2, {arg1 -> -1 + arg1, arg2 -> arg1, rest remain the same}> 0.00/0.06 <l2, l2, 0 <= arg3 /\ 0 <= arg4 /\ 1 <= arg2 /\ 1 + arg4 <= arg3, {arg1 -> -1 + arg1, arg2 -> arg1, arg4 -> 1 + arg4, rest remain the same}> 0.00/0.06 Variables: 0.00/0.06 arg1, arg2, arg3, arg4 0.00/0.06 0.00/0.06 Precedence: 0.00/0.06 Graph 0 0.00/0.06 0.00/0.06 Graph 1 0.00/0.06 <l0, l2, 1 <= undef18 /\ undef19 = 0, {arg1 -> -1, arg2 -> 0, arg3 -> 0, arg4 -> 0, rest remain the same}> 0.00/0.06 <l0, l2, 0 <= undef9 /\ 1 <= undef18 /\ 1 <= undef19, {arg1 -> -1 + 3*undef9, arg2 -> 3*undef9, arg3 -> undef19, arg4 -> 1, rest remain the same}> 0.00/0.06 0.00/0.06 Map Locations to Subgraph: 0.00/0.06 ( 0 , 0 ) 0.00/0.06 ( 2 , 1 ) 0.00/0.06 0.00/0.06 ******************************************************************************************* 0.00/0.06 ******************************** CHECKING ASSERTIONS ******************************** 0.00/0.06 ******************************************************************************************* 0.00/0.06 0.00/0.06 Proving termination of subgraph 0 0.00/0.06 Proving termination of subgraph 1 0.00/0.06 Checking unfeasibility... 0.00/0.06 Time used: 0.007671 0.00/0.06 0.00/0.06 Checking conditional termination of SCC {l2}... 0.00/0.06 0.00/0.06 LOG: CALL solveLinear 0.00/0.06 0.00/0.06 LOG: RETURN solveLinear - Elapsed time: 0.001654s 0.00/0.06 �[33mRanking function: �[36marg3 - arg4�[0m 0.00/0.06 New Graphs: 0.00/0.06 Transitions: 0.00/0.06 <l2, l2, arg3 <= arg4 /\ 0 <= arg3 /\ 1 <= arg2, {arg1 -> -1 + arg1, arg2 -> arg1, rest remain the same}> 0.00/0.06 Variables: 0.00/0.06 arg1, arg2, arg3, arg4 0.00/0.06 Checking conditional termination of SCC {l2}... 0.00/0.06
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