Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432272774
details
property
value
status
complete
benchmark
IntRTA.jar-obl-8.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n052.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
0.0328511 seconds
cpu usage
0.032977
user time
0.023208
system time
0.009769
max virtual memory
113176.0
max residence set size
6316.0
stage attributes
key
value
starexec-result
YES
output
0.00/0.03 YES 0.00/0.03 0.00/0.03 Solver Timeout: 4 0.00/0.03 Global Timeout: 300 0.00/0.03 No parsing errors! 0.00/0.03 Init Location: 0 0.00/0.03 Transitions: 0.00/0.03 <l0, l3, true> 0.00/0.03 <l1, l2, (undef3 > ~(1)) /\ (arg2 > ~(1)) /\ (undef4 > ~(1)) /\ (arg1 > 0) /\ (undef1 > 0) /\ (undef2 > 0), par{arg1 -> undef1, arg2 -> undef2, arg3 -> undef3, arg4 -> undef4}> 0.00/0.03 <l2, l2, (arg4 > ~(1)) /\ (arg3 > arg4) /\ (arg1 >= undef5) /\ (arg2 >= (undef6 - 1)) /\ (arg1 > 0) /\ (arg2 > 0) /\ (undef5 > 0) /\ (undef6 > 0) /\ ((arg3 + 2) <= arg1) /\ ((arg4 + 2) <= arg2), par{arg1 -> undef5, arg2 -> undef6, arg4 -> (arg4 + 1)}> 0.00/0.03 <l3, l1, true, par{arg1 -> undef9, arg2 -> undef10, arg3 -> undef11, arg4 -> undef12}> 0.00/0.03 0.00/0.03 Fresh variables: 0.00/0.03 undef1, undef2, undef3, undef4, undef5, undef6, undef9, undef10, undef11, undef12, 0.00/0.03 0.00/0.03 Undef variables: 0.00/0.03 undef1, undef2, undef3, undef4, undef5, undef6, undef9, undef10, undef11, undef12, 0.00/0.03 0.00/0.03 Abstraction variables: 0.00/0.03 0.00/0.03 Exit nodes: 0.00/0.03 0.00/0.03 Accepting locations: 0.00/0.03 0.00/0.03 Asserts: 0.00/0.03 0.00/0.03 Preprocessed LLVMGraph 0.00/0.03 Init Location: 0 0.00/0.03 Transitions: 0.00/0.03 <l0, l2, (arg1 = undef1) /\ (arg2 = undef2) /\ (arg3 = undef3) /\ (arg4 = undef4) /\ (undef3 > ~(1)) /\ (undef10 > ~(1)) /\ (undef4 > ~(1)) /\ (undef9 > 0) /\ (undef1 > 0) /\ (undef2 > 0)> 0.00/0.03 <l2, l2, (arg4 > ~(1)) /\ (arg3 > arg4) /\ (arg1 >= undef5) /\ (arg2 >= (undef6 - 1)) /\ (arg1 > 0) /\ (arg2 > 0) /\ (undef5 > 0) /\ (undef6 > 0) /\ ((arg3 + 2) <= arg1) /\ ((arg4 + 2) <= arg2), par{arg1 -> undef5, arg2 -> undef6, arg4 -> (arg4 + 1)}> 0.00/0.03 0.00/0.03 Fresh variables: 0.00/0.03 undef1, undef2, undef3, undef4, undef5, undef6, undef9, undef10, undef11, undef12, 0.00/0.03 0.00/0.03 Undef variables: 0.00/0.03 undef1, undef2, undef3, undef4, undef5, undef6, undef9, undef10, undef11, undef12, 0.00/0.03 0.00/0.03 Abstraction variables: 0.00/0.03 0.00/0.03 Exit nodes: 0.00/0.03 0.00/0.03 Accepting locations: 0.00/0.03 0.00/0.03 Asserts: 0.00/0.03 0.00/0.03 ************************************************************* 0.00/0.03 ******************************************************************************************* 0.00/0.03 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 0.00/0.03 ******************************************************************************************* 0.00/0.03 0.00/0.03 Init Location: 0 0.00/0.03 Graph 0: 0.00/0.03 Transitions: 0.00/0.03 Variables: 0.00/0.03 0.00/0.03 Graph 1: 0.00/0.03 Transitions: 0.00/0.03 <l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 + arg4 <= arg3 /\ 1 <= undef5 /\ 1 <= undef6 /\ undef6 <= 1 + arg2 /\ undef5 <= arg1 /\ 0 <= arg4 /\ 2 + arg3 <= arg1 /\ 2 + arg4 <= arg2, {arg1 -> undef5, arg2 -> undef6, arg4 -> 1 + arg4, rest remain the same}> 0.00/0.03 Variables: 0.00/0.03 arg1, arg2, arg3, arg4 0.00/0.03 0.00/0.03 Precedence: 0.00/0.03 Graph 0 0.00/0.03 0.00/0.03 Graph 1 0.00/0.03 <l0, l2, 1 <= undef1 /\ 1 <= undef2 /\ 1 <= undef9 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef10 /\ arg1 = undef1 /\ arg2 = undef2 /\ arg3 = undef3 /\ arg4 = undef4, {all remain the same}> 0.00/0.03 0.00/0.03 Map Locations to Subgraph: 0.00/0.03 ( 0 , 0 ) 0.00/0.03 ( 2 , 1 ) 0.00/0.03 0.00/0.03 ******************************************************************************************* 0.00/0.03 ******************************** CHECKING ASSERTIONS ******************************** 0.00/0.03 ******************************************************************************************* 0.00/0.03 0.00/0.03 Proving termination of subgraph 0 0.00/0.03 Proving termination of subgraph 1 0.00/0.03 Checking unfeasibility... 0.00/0.03 Time used: 0.004717 0.00/0.03 0.00/0.03 Checking conditional termination of SCC {l2}... 0.00/0.03 0.00/0.03 LOG: CALL solveLinear 0.00/0.03 0.00/0.03 LOG: RETURN solveLinear - Elapsed time: 0.001631s 0.00/0.03 �[33mRanking function: �[36m-1 + arg3 - arg4�[0m 0.00/0.03 New Graphs: 0.00/0.03 �[32mProgram Terminates�[0m 0.00/0.03 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 0.00/0.03 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 0.00/0.03 EOF
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