Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432272981
details
property
value
status
complete
benchmark
AProVEMath.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)
0.035656 seconds
cpu usage
0.035799
user time
0.028596
system time
0.007203
max virtual memory
113176.0
max residence set size
6176.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, l4, true> 0.00/0.03 <l1, l2, (arg2 > ~(1)) /\ (undef1 > 1) /\ (undef3 < 2) /\ (undef3 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef1, arg2 -> undef2}> 0.00/0.03 <l1, l2, (arg2 > ~(1)) /\ (undef4 > 1) /\ (undef6 > 2) /\ (arg1 > 0), par{arg1 -> undef4, arg2 -> undef5}> 0.00/0.03 <l2, l3, ((arg1 - (2 * undef9)) = 0) /\ (arg1 > undef10) /\ (arg1 > 0), par{arg2 -> undef8}> 0.00/0.03 <l3, l2, ((arg1 - (2 * undef13)) = 0) /\ (arg1 > 0) /\ (arg1 > undef11) /\ ((arg1 - (2 * undef13)) >= 0) /\ ((arg1 - (2 * undef13)) < 2) /\ ((arg1 - (2 * undef11)) < 2) /\ ((arg1 - (2 * undef11)) >= 0), par{arg1 -> undef11, arg2 -> undef12}> 0.00/0.03 <l2, l3, ((arg1 - (2 * undef16)) = 1) /\ (arg1 > undef17) /\ (arg1 > 0), par{arg2 -> undef15}> 0.00/0.03 <l3, l2, ((arg1 - (2 * undef20)) = 1) /\ (arg1 > 0) /\ (arg1 > undef18) /\ ((arg1 - (2 * undef20)) >= 0) /\ ((arg1 - (2 * undef20)) < 2) /\ ((arg1 - (2 * undef18)) < 2) /\ ((arg1 - (2 * undef18)) >= 0), par{arg1 -> undef18, arg2 -> undef19}> 0.00/0.03 <l4, l1, true, par{arg1 -> undef21, arg2 -> undef22}> 0.00/0.03 0.00/0.03 Fresh variables: 0.00/0.03 undef1, undef2, undef3, undef4, undef5, undef6, undef8, undef9, undef10, undef11, undef12, undef13, undef15, undef16, undef17, undef18, undef19, undef20, undef21, undef22, 0.00/0.03 0.00/0.03 Undef variables: 0.00/0.03 undef1, undef2, undef3, undef4, undef5, undef6, undef8, undef9, undef10, undef11, undef12, undef13, undef15, undef16, undef17, undef18, undef19, undef20, undef21, undef22, 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, (undef22 > ~(1)) /\ (undef1 > 1) /\ (undef3 < 2) /\ (undef3 > ~(1)) /\ (undef21 > 0), par{arg1 -> undef1}> 0.00/0.03 <l0, l2, (undef22 > ~(1)) /\ (undef4 > 1) /\ (undef6 > 2) /\ (undef21 > 0), par{arg1 -> undef4}> 0.00/0.03 <l2, l2, ((arg1 - (2 * undef9)) = 0) /\ (arg1 > undef10) /\ (arg1 > 0) /\ ((arg1 - (2 * undef13)) = 0) /\ (arg1 > 0) /\ (arg1 > undef11) /\ ((arg1 - (2 * undef13)) >= 0) /\ ((arg1 - (2 * undef13)) < 2) /\ ((arg1 - (2 * undef11)) < 2) /\ ((arg1 - (2 * undef11)) >= 0), par{arg1 -> undef11}> 0.00/0.03 <l2, l2, ((arg1 - (2 * undef16)) = 1) /\ (arg1 > undef17) /\ (arg1 > 0) /\ ((arg1 - (2 * undef20)) = 1) /\ (arg1 > 0) /\ (arg1 > undef18) /\ ((arg1 - (2 * undef20)) >= 0) /\ ((arg1 - (2 * undef20)) < 2) /\ ((arg1 - (2 * undef18)) < 2) /\ ((arg1 - (2 * undef18)) >= 0), par{arg1 -> undef18}> 0.00/0.03 0.00/0.03 Fresh variables: 0.00/0.03 undef1, undef2, undef3, undef4, undef5, undef6, undef8, undef9, undef10, undef11, undef12, undef13, undef15, undef16, undef17, undef18, undef19, undef20, undef21, undef22, 0.00/0.03 0.00/0.03 Undef variables: 0.00/0.03 undef1, undef2, undef3, undef4, undef5, undef6, undef8, undef9, undef10, undef11, undef12, undef13, undef15, undef16, undef17, undef18, undef19, undef20, undef21, undef22, 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 + undef10 <= arg1 /\ 1 + undef11 <= arg1 /\ arg1 <= 1 + 2*undef11 /\ 2*undef11 <= arg1 /\ arg1 = 2*undef9 /\ arg1 = 2*undef13, {arg1 -> undef11, rest remain the same}> 0.00/0.03 <l2, l2, 1 <= arg1 /\ 1 + undef17 <= arg1 /\ 1 + undef18 <= arg1 /\ arg1 <= 1 + 2*undef18 /\ 2*undef18 <= arg1 /\ arg1 = 1 + 2*undef16 /\ arg1 = 1 + 2*undef20, {arg1 -> undef18, rest remain the same}> 0.00/0.03 Variables: 0.00/0.03 arg1 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 <= undef21 /\ undef3 <= 1 /\ 2 <= undef1 /\ 0 <= undef3 /\ 0 <= undef22, {arg1 -> undef1, rest remain the same}> 0.00/0.03 <l0, l2, 1 <= undef21 /\ 2 <= undef4 /\ 0 <= undef22 /\ 3 <= undef6, {arg1 -> undef4, rest 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.004401 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.002089s 0.00/0.03 �[33mRanking function: �[36m-1 + arg1�[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