Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432274631
details
property
value
status
complete
benchmark
cfg.t2.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_T2
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
5.23462 seconds
cpu usage
5.23329
user time
5.04017
system time
0.193114
max virtual memory
705156.0
max residence set size
64288.0
stage attributes
key
value
starexec-result
NO
output
5.17/5.23 NO 5.17/5.23 5.17/5.23 Solver Timeout: 4 5.17/5.23 Global Timeout: 300 5.17/5.23 No parsing errors! 5.17/5.23 Init Location: 0 5.17/5.23 Transitions: 5.17/5.23 <l0, l4, true> 5.17/5.23 <l1, l2, (undef5 = ((0 + __const_300^0) + x^0)) /\ ((1 + __const_100^0) <= (0 + undef5)), par{x^0 -> undef5}> 5.17/5.23 <l2, l1, (undef10 = ((0 + __const_400^0) + x^0)) /\ ((1 + __const_100^0) <= (0 + undef10)), par{x^0 -> undef10}> 5.17/5.23 <l3, l1, (undef15 = ((0 + __const_200^0) + x^0)) /\ ((1 + __const_100^0) <= (0 + undef15)), par{x^0 -> undef15}> 5.17/5.23 <l3, l2, (undef20 = ((0 + __const_100^0) + x^0)) /\ ((1 + __const_100^0) <= (0 + undef20)), par{x^0 -> undef20}> 5.17/5.23 <l4, l3, true> 5.17/5.23 5.17/5.23 Fresh variables: 5.17/5.23 undef5, undef10, undef15, undef20, 5.17/5.23 5.17/5.23 Undef variables: 5.17/5.23 undef5, undef10, undef15, undef20, 5.17/5.23 5.17/5.23 Abstraction variables: 5.17/5.23 5.17/5.23 Exit nodes: 5.17/5.23 5.17/5.23 Accepting locations: 5.17/5.23 5.17/5.23 Asserts: 5.17/5.23 5.17/5.23 Preprocessed LLVMGraph 5.17/5.23 Init Location: 0 5.17/5.23 Transitions: 5.17/5.23 <l0, l1, (undef15 = ((0 + __const_200^0) + x^0)) /\ ((1 + __const_100^0) <= (0 + undef15)), par{x^0 -> undef15}> 5.17/5.23 <l0, l1, (undef20 = ((0 + __const_100^0) + x^0)) /\ ((1 + __const_100^0) <= (0 + undef20)) /\ (undef10 = ((0 + __const_400^0) + undef20)) /\ ((1 + __const_100^0) <= (0 + undef10)), par{x^0 -> undef10}> 5.17/5.23 <l1, l1, (undef5 = ((0 + __const_300^0) + x^0)) /\ ((1 + __const_100^0) <= (0 + undef5)) /\ (undef10 = ((0 + __const_400^0) + undef5)) /\ ((1 + __const_100^0) <= (0 + undef10)), par{x^0 -> undef10}> 5.17/5.23 5.17/5.23 Fresh variables: 5.17/5.23 undef5, undef10, undef15, undef20, 5.17/5.23 5.17/5.23 Undef variables: 5.17/5.23 undef5, undef10, undef15, undef20, 5.17/5.23 5.17/5.23 Abstraction variables: 5.17/5.23 5.17/5.23 Exit nodes: 5.17/5.23 5.17/5.23 Accepting locations: 5.17/5.23 5.17/5.23 Asserts: 5.17/5.23 5.17/5.23 ************************************************************* 5.17/5.23 ******************************************************************************************* 5.17/5.23 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 5.17/5.23 ******************************************************************************************* 5.17/5.23 5.17/5.23 Init Location: 0 5.17/5.23 Graph 0: 5.17/5.23 Transitions: 5.17/5.23 Variables: 5.17/5.23 5.17/5.23 Graph 1: 5.17/5.23 Transitions: 5.17/5.23 <l1, l1, 1 + __const_100^0 <= undef5 /\ 1 + __const_100^0 <= undef10 /\ __const_300^0 + x^0 = undef5 /\ __const_400^0 + undef5 = undef10, {x^0 -> undef10, rest remain the same}> 5.17/5.23 Variables: 5.17/5.23 __const_100^0, __const_300^0, __const_400^0, x^0 5.17/5.23 5.17/5.23 Precedence: 5.17/5.23 Graph 0 5.17/5.23 5.17/5.23 Graph 1 5.17/5.23 <l0, l1, 1 + __const_100^0 <= undef15 /\ __const_200^0 + x^0 = undef15, {x^0 -> undef15, rest remain the same}> 5.17/5.23 <l0, l1, 1 + __const_100^0 <= undef10 /\ 1 + __const_100^0 <= undef20 /\ __const_100^0 + x^0 = undef20 /\ __const_400^0 + undef20 = undef10, {x^0 -> undef10, rest remain the same}> 5.17/5.23 5.17/5.23 Map Locations to Subgraph: 5.17/5.23 ( 0 , 0 ) 5.17/5.23 ( 1 , 1 ) 5.17/5.23 5.17/5.23 ******************************************************************************************* 5.17/5.23 ******************************** CHECKING ASSERTIONS ******************************** 5.17/5.23 ******************************************************************************************* 5.17/5.23 5.17/5.23 Proving termination of subgraph 0 5.17/5.23 Proving termination of subgraph 1 5.17/5.23 Checking unfeasibility... 5.17/5.23 Time used: 0.00355 5.17/5.23 5.17/5.23 Checking conditional termination of SCC {l1}... 5.17/5.23 5.17/5.23 LOG: CALL solveLinear 5.17/5.23 5.17/5.23 LOG: RETURN solveLinear - Elapsed time: 0.000853s 5.17/5.23 5.17/5.23 LOG: CALL solveLinear 5.17/5.23 5.17/5.23 LOG: RETURN solveLinear - Elapsed time: 0.003435s 5.17/5.23 Trying to remove transition: <l1, l1, 1 + __const_100^0 <= undef5 /\ 1 + __const_100^0 <= undef10 /\ __const_300^0 + x^0 = undef5 /\ __const_400^0 + undef5 = undef10, {x^0 -> undef10, rest remain the same}> 5.17/5.23 Solving with 1 template(s). 5.17/5.23 5.17/5.23 LOG: CALL solveNonLinearGetFirstSolution 5.17/5.23 5.17/5.23 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008543s
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