Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432273284
details
property
value
status
complete
benchmark
MinusUserDefined.jar-obl-8.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n174.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
0.13661 seconds
cpu usage
0.136583
user time
0.10906
system time
0.027523
max virtual memory
113176.0
max residence set size
21700.0
stage attributes
key
value
starexec-result
YES
output
0.00/0.13 YES 0.00/0.13 0.00/0.13 Solver Timeout: 4 0.00/0.13 Global Timeout: 300 0.00/0.13 No parsing errors! 0.00/0.13 Init Location: 0 0.00/0.13 Transitions: 0.00/0.13 <l0, l3, true> 0.00/0.13 <l1, l2, (undef2 > ~(1)) /\ (arg2 > ~(1)) /\ (undef1 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef1, arg2 -> undef2, arg3 -> undef1, arg4 -> undef2, arg5 -> undef1}> 0.00/0.13 <l2, l2, (arg3 > 0) /\ (arg4 > 0) /\ (arg3 = arg5), par{arg3 -> (arg3 - 1), arg4 -> (arg4 - 1), arg5 -> (arg3 - 1)}> 0.00/0.13 <l2, l2, (arg3 > 0) /\ (0 = arg4) /\ (arg3 = arg5), par{arg2 -> (arg2 + 1), arg3 -> arg1, arg4 -> (arg2 + 1), arg5 -> arg1}> 0.00/0.13 <l3, l1, true, par{arg1 -> undef16, arg2 -> undef17, arg3 -> undef18, arg4 -> undef19, arg5 -> undef20}> 0.00/0.13 0.00/0.13 Fresh variables: 0.00/0.13 undef1, undef2, undef16, undef17, undef18, undef19, undef20, 0.00/0.13 0.00/0.13 Undef variables: 0.00/0.13 undef1, undef2, undef16, undef17, undef18, undef19, undef20, 0.00/0.13 0.00/0.13 Abstraction variables: 0.00/0.13 0.00/0.13 Exit nodes: 0.00/0.13 0.00/0.13 Accepting locations: 0.00/0.13 0.00/0.13 Asserts: 0.00/0.13 0.00/0.13 Preprocessed LLVMGraph 0.00/0.13 Init Location: 0 0.00/0.13 Transitions: 0.00/0.13 <l0, l2, (arg1 = undef1) /\ (arg2 = undef2) /\ (arg3 = undef1) /\ (arg4 = undef2) /\ (arg5 = undef1) /\ (undef2 > ~(1)) /\ (undef17 > ~(1)) /\ (undef1 > ~(1)) /\ (undef16 > 0)> 0.00/0.13 <l2, l2, (arg3 > 0) /\ (arg4 > 0) /\ (arg3 = arg5), par{arg3 -> (arg3 - 1), arg4 -> (arg4 - 1), arg5 -> (arg3 - 1)}> 0.00/0.13 <l2, l2, (arg3 > 0) /\ (0 = arg4) /\ (arg3 = arg5), par{arg2 -> (arg2 + 1), arg3 -> arg1, arg4 -> (arg2 + 1), arg5 -> arg1}> 0.00/0.13 0.00/0.13 Fresh variables: 0.00/0.13 undef1, undef2, undef16, undef17, undef18, undef19, undef20, 0.00/0.13 0.00/0.13 Undef variables: 0.00/0.13 undef1, undef2, undef16, undef17, undef18, undef19, undef20, 0.00/0.13 0.00/0.13 Abstraction variables: 0.00/0.13 0.00/0.13 Exit nodes: 0.00/0.13 0.00/0.13 Accepting locations: 0.00/0.13 0.00/0.13 Asserts: 0.00/0.13 0.00/0.13 ************************************************************* 0.00/0.13 ******************************************************************************************* 0.00/0.13 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 0.00/0.13 ******************************************************************************************* 0.00/0.13 0.00/0.13 Init Location: 0 0.00/0.13 Graph 0: 0.00/0.13 Transitions: 0.00/0.13 Variables: 0.00/0.13 0.00/0.13 Graph 1: 0.00/0.13 Transitions: 0.00/0.13 <l2, l2, 1 <= arg3 /\ 1 <= arg4 /\ arg3 = arg5, {arg3 -> -1 + arg3, arg4 -> -1 + arg4, arg5 -> -1 + arg3, rest remain the same}> 0.00/0.13 <l2, l2, 1 <= arg3 /\ arg3 = arg5 /\ arg4 = 0, {arg2 -> 1 + arg2, arg3 -> arg1, arg4 -> 1 + arg2, arg5 -> arg1, rest remain the same}> 0.00/0.13 Variables: 0.00/0.13 arg3, arg4, arg5, arg1, arg2 0.00/0.13 0.00/0.13 Precedence: 0.00/0.13 Graph 0 0.00/0.13 0.00/0.13 Graph 1 0.00/0.13 <l0, l2, 1 <= undef16 /\ 0 <= undef1 /\ 0 <= undef2 /\ 0 <= undef17 /\ arg1 = undef1 /\ arg2 = undef2 /\ arg3 = undef1 /\ arg4 = undef2 /\ arg5 = undef1, {all remain the same}> 0.00/0.13 0.00/0.13 Map Locations to Subgraph: 0.00/0.13 ( 0 , 0 ) 0.00/0.13 ( 2 , 1 ) 0.00/0.13 0.00/0.13 ******************************************************************************************* 0.00/0.13 ******************************** CHECKING ASSERTIONS ******************************** 0.00/0.13 ******************************************************************************************* 0.00/0.13 0.00/0.13 Proving termination of subgraph 0 0.00/0.13 Proving termination of subgraph 1 0.00/0.13 Checking unfeasibility... 0.00/0.13 Time used: 0.010474 0.00/0.13 0.00/0.13 Checking conditional termination of SCC {l2}... 0.00/0.13 0.00/0.13 LOG: CALL solveLinear 0.00/0.13 0.00/0.13 LOG: RETURN solveLinear - Elapsed time: 0.001464s 0.00/0.13 0.00/0.13 LOG: CALL solveLinear 0.00/0.13 0.00/0.13 LOG: RETURN solveLinear - Elapsed time: 0.005674s 0.00/0.13 Trying to remove transition: <l2, l2, 1 <= arg3 /\ arg3 = arg5 /\ arg4 = 0, {arg2 -> 1 + arg2, arg3 -> arg1, arg4 -> 1 + arg2, arg5 -> arg1, rest remain the same}> 0.00/0.13 Solving with 1 template(s). 0.00/0.13 0.00/0.13 LOG: CALL solveNonLinearGetFirstSolution 0.00/0.13 0.00/0.13 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.020369s 0.00/0.13 Time used: 0.020034
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