Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432273680
details
property
value
status
complete
benchmark
Velroyen08-whileBreak.jar-obl-8.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n092.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
19.1683 seconds
cpu usage
19.1593
user time
17.6621
system time
1.49718
max virtual memory
1158488.0
max residence set size
418272.0
stage attributes
key
value
starexec-result
NO
output
19.10/19.16 NO 19.10/19.16 19.10/19.16 Solver Timeout: 4 19.10/19.16 Global Timeout: 300 19.10/19.16 No parsing errors! 19.10/19.16 Init Location: 0 19.10/19.16 Transitions: 19.10/19.16 <l0, l4, true> 19.10/19.16 <l1, l2, (arg1 > 0) /\ (arg2 > ~(1)), par{arg1 -> arg2, arg2 -> undef2}> 19.10/19.16 <l2, l3, (arg1 < 21) /\ (arg1 > 10), par{arg1 -> (arg1 - 1), arg2 -> undef4}> 19.10/19.16 <l2, l3, (arg1 > 20), par{arg1 -> (arg1 + 1), arg2 -> undef6}> 19.10/19.16 <l3, l2, (arg1 < 30), par{arg2 -> undef8}> 19.10/19.16 <l3, l2, (arg1 > 30), par{arg2 -> undef10}> 19.10/19.16 <l4, l1, true, par{arg1 -> undef11, arg2 -> undef12}> 19.10/19.16 19.10/19.16 Fresh variables: 19.10/19.16 undef2, undef4, undef6, undef8, undef10, undef11, undef12, 19.10/19.16 19.10/19.16 Undef variables: 19.10/19.16 undef2, undef4, undef6, undef8, undef10, undef11, undef12, 19.10/19.16 19.10/19.16 Abstraction variables: 19.10/19.16 19.10/19.16 Exit nodes: 19.10/19.16 19.10/19.16 Accepting locations: 19.10/19.16 19.10/19.16 Asserts: 19.10/19.16 19.10/19.16 Preprocessed LLVMGraph 19.10/19.16 Init Location: 0 19.10/19.16 Transitions: 19.10/19.16 <l0, l2, (arg1 = undef12) /\ (undef11 > 0) /\ (undef12 > ~(1))> 19.10/19.16 <l2, l2, (arg1 < 21) /\ (arg1 > 10) /\ ((arg1 - 1) < 30), par{arg1 -> (arg1 - 1)}> 19.10/19.16 <l2, l2, (arg1 > 20) /\ ((arg1 + 1) < 30), par{arg1 -> (arg1 + 1)}> 19.10/19.16 <l2, l2, (arg1 > 20) /\ ((arg1 + 1) > 30), par{arg1 -> (arg1 + 1)}> 19.10/19.16 19.10/19.16 Fresh variables: 19.10/19.16 undef2, undef4, undef6, undef8, undef10, undef11, undef12, 19.10/19.16 19.10/19.16 Undef variables: 19.10/19.16 undef2, undef4, undef6, undef8, undef10, undef11, undef12, 19.10/19.16 19.10/19.16 Abstraction variables: 19.10/19.16 19.10/19.16 Exit nodes: 19.10/19.16 19.10/19.16 Accepting locations: 19.10/19.16 19.10/19.16 Asserts: 19.10/19.16 19.10/19.16 ************************************************************* 19.10/19.16 ******************************************************************************************* 19.10/19.16 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 19.10/19.16 ******************************************************************************************* 19.10/19.16 19.10/19.16 Init Location: 0 19.10/19.16 Graph 0: 19.10/19.16 Transitions: 19.10/19.16 Variables: 19.10/19.16 19.10/19.16 Graph 1: 19.10/19.16 Transitions: 19.10/19.16 <l2, l2, arg1 <= 20 /\ 11 <= arg1, {arg1 -> -1 + arg1, rest remain the same}> 19.10/19.16 <l2, l2, 21 <= arg1 /\ arg1 <= 28, {arg1 -> 1 + arg1, rest remain the same}> 19.10/19.16 <l2, l2, 30 <= arg1, {arg1 -> 1 + arg1, rest remain the same}> 19.10/19.16 Variables: 19.10/19.16 arg1 19.10/19.16 19.10/19.16 Precedence: 19.10/19.16 Graph 0 19.10/19.16 19.10/19.16 Graph 1 19.10/19.16 <l0, l2, 0 <= undef12 /\ 1 <= undef11 /\ arg1 = undef12, {all remain the same}> 19.10/19.16 19.10/19.16 Map Locations to Subgraph: 19.10/19.16 ( 0 , 0 ) 19.10/19.16 ( 2 , 1 ) 19.10/19.16 19.10/19.16 ******************************************************************************************* 19.10/19.16 ******************************** CHECKING ASSERTIONS ******************************** 19.10/19.16 ******************************************************************************************* 19.10/19.16 19.10/19.16 Proving termination of subgraph 0 19.10/19.16 Proving termination of subgraph 1 19.10/19.16 Checking unfeasibility... 19.10/19.16 Time used: 0.004067 19.10/19.16 19.10/19.16 Checking conditional termination of SCC {l2}... 19.10/19.16 19.10/19.16 LOG: CALL solveLinear 19.10/19.16 19.10/19.16 LOG: RETURN solveLinear - Elapsed time: 0.001036s 19.10/19.16 19.10/19.16 LOG: CALL solveLinear 19.10/19.16 19.10/19.16 LOG: RETURN solveLinear - Elapsed time: 0.009758s 19.10/19.16 �[33mPiecewise ranking function: �[36mmin(900 - 30*arg1,270)�[0m 19.10/19.16 New Graphs: 19.10/19.16 Transitions:
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