Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432272771
details
property
value
status
complete
benchmark
Velroyen08-moduloLower.jar-obl-8.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n117.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
5.11516 seconds
cpu usage
5.1147
user time
4.75947
system time
0.355224
max virtual memory
718428.0
max residence set size
109104.0
stage attributes
key
value
starexec-result
NO
output
5.05/5.11 NO 5.05/5.11 5.05/5.11 Solver Timeout: 4 5.05/5.11 Global Timeout: 300 5.05/5.11 No parsing errors! 5.05/5.11 Init Location: 0 5.05/5.11 Transitions: 5.05/5.11 <l0, l4, true> 5.05/5.11 <l1, l2, (arg1 > 0) /\ (arg2 > ~(1)), par{arg1 -> arg2, arg2 -> undef2}> 5.05/5.11 <l2, l3, ((arg1 - (5 * undef5)) = 0) /\ (arg1 > 2), par{arg2 -> undef4}> 5.05/5.11 <l3, l2, (arg1 > 2) /\ ((arg1 - (5 * undef8)) = 0) /\ ((arg1 - (5 * undef8)) < 5) /\ ((arg1 - (5 * undef8)) >= 0), par{arg2 -> undef7}> 5.05/5.11 <l2, l3, ((arg1 - (5 * undef11)) > 0) /\ (arg1 > 2), par{arg2 -> undef10}> 5.05/5.11 <l3, l2, ((arg1 - (5 * undef14)) > 0) /\ ((arg1 - (5 * undef14)) < 5) /\ (arg1 > 2), par{arg1 -> (arg1 - 1), arg2 -> undef13}> 5.05/5.11 <l4, l1, true, par{arg1 -> undef15, arg2 -> undef16}> 5.05/5.11 5.05/5.11 Fresh variables: 5.05/5.11 undef2, undef4, undef5, undef7, undef8, undef10, undef11, undef13, undef14, undef15, undef16, 5.05/5.11 5.05/5.11 Undef variables: 5.05/5.11 undef2, undef4, undef5, undef7, undef8, undef10, undef11, undef13, undef14, undef15, undef16, 5.05/5.11 5.05/5.11 Abstraction variables: 5.05/5.11 5.05/5.11 Exit nodes: 5.05/5.11 5.05/5.11 Accepting locations: 5.05/5.11 5.05/5.11 Asserts: 5.05/5.11 5.05/5.11 Preprocessed LLVMGraph 5.05/5.11 Init Location: 0 5.05/5.11 Transitions: 5.05/5.11 <l0, l2, (arg1 = undef16) /\ (undef15 > 0) /\ (undef16 > ~(1))> 5.05/5.11 <l2, l2, ((arg1 - (5 * undef5)) = 0) /\ (arg1 > 2) /\ (arg1 > 2) /\ ((arg1 - (5 * undef8)) = 0) /\ ((arg1 - (5 * undef8)) < 5) /\ ((arg1 - (5 * undef8)) >= 0)> 5.05/5.11 <l2, l2, ((arg1 - (5 * undef11)) > 0) /\ (arg1 > 2) /\ (arg1 > 2) /\ ((arg1 - (5 * undef8)) = 0) /\ ((arg1 - (5 * undef8)) < 5) /\ ((arg1 - (5 * undef8)) >= 0)> 5.05/5.11 <l2, l2, ((arg1 - (5 * undef11)) > 0) /\ (arg1 > 2) /\ ((arg1 - (5 * undef14)) > 0) /\ ((arg1 - (5 * undef14)) < 5) /\ (arg1 > 2), par{arg1 -> (arg1 - 1)}> 5.05/5.11 5.05/5.11 Fresh variables: 5.05/5.11 undef2, undef4, undef5, undef7, undef8, undef10, undef11, undef13, undef14, undef15, undef16, 5.05/5.11 5.05/5.11 Undef variables: 5.05/5.11 undef2, undef4, undef5, undef7, undef8, undef10, undef11, undef13, undef14, undef15, undef16, 5.05/5.11 5.05/5.11 Abstraction variables: 5.05/5.11 5.05/5.11 Exit nodes: 5.05/5.11 5.05/5.11 Accepting locations: 5.05/5.11 5.05/5.11 Asserts: 5.05/5.11 5.05/5.11 ************************************************************* 5.05/5.11 ******************************************************************************************* 5.05/5.11 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 5.05/5.11 ******************************************************************************************* 5.05/5.11 5.05/5.11 Init Location: 0 5.05/5.11 Graph 0: 5.05/5.11 Transitions: 5.05/5.11 Variables: 5.05/5.11 5.05/5.11 Graph 1: 5.05/5.11 Transitions: 5.05/5.11 <l2, l2, 3 <= arg1 /\ arg1 = 5*undef5 /\ arg1 = 5*undef8, {all remain the same}> 5.05/5.11 <l2, l2, 1 + 5*undef11 <= arg1 /\ 3 <= arg1 /\ arg1 = 5*undef8, {all remain the same}> 5.05/5.11 <l2, l2, 1 + 5*undef11 <= arg1 /\ 1 + 5*undef14 <= arg1 /\ 3 <= arg1 /\ arg1 <= 4 + 5*undef14, {arg1 -> -1 + arg1, rest remain the same}> 5.05/5.11 Variables: 5.05/5.11 arg1 5.05/5.11 5.05/5.11 Precedence: 5.05/5.11 Graph 0 5.05/5.11 5.05/5.11 Graph 1 5.05/5.11 <l0, l2, 0 <= undef16 /\ 1 <= undef15 /\ arg1 = undef16, {all remain the same}> 5.05/5.11 5.05/5.11 Map Locations to Subgraph: 5.05/5.11 ( 0 , 0 ) 5.05/5.11 ( 2 , 1 ) 5.05/5.11 5.05/5.11 ******************************************************************************************* 5.05/5.11 ******************************** CHECKING ASSERTIONS ******************************** 5.05/5.11 ******************************************************************************************* 5.05/5.11 5.05/5.11 Proving termination of subgraph 0 5.05/5.11 Proving termination of subgraph 1 5.05/5.11 Checking unfeasibility... 5.05/5.11 Time used: 0.004405 5.05/5.11 5.05/5.11 Checking conditional termination of SCC {l2}... 5.05/5.11 5.05/5.11 LOG: CALL solveLinear 5.05/5.11 5.05/5.11 LOG: RETURN solveLinear - Elapsed time: 0.000981s 5.05/5.11 �[33mRanking function: �[36m-3 + arg1�[0m 5.05/5.11 New Graphs: 5.05/5.11 Transitions: 5.05/5.11 <l2, l2, 3 <= arg1 /\ arg1 = 5*undef5 /\ arg1 = 5*undef8, {all remain the same}> 5.05/5.11 <l2, l2, 1 + 5*undef11 <= arg1 /\ 3 <= arg1 /\ arg1 = 5*undef8, {all remain the same}> 5.05/5.11 Variables: 5.05/5.11 arg1
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