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