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