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