Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_Transition_Systems 2019-03-29 01.54 pair #432273494
details
property
value
status
complete
benchmark
Velroyen08-ex01.jar-obl-8.smt2
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n006.star.cs.uiowa.edu
space
From_AProVE_2014
run statistics
property
value
solver
VeryMax-termCOMP17
configuration
termcomp2019_ITS
runtime (wallclock)
18.194 seconds
cpu usage
18.1794
user time
17.082
system time
1.0974
max virtual memory
921396.0
max residence set size
230320.0
stage attributes
key
value
starexec-result
NO
output
18.15/18.19 NO 18.15/18.19 18.15/18.19 Solver Timeout: 4 18.15/18.19 Global Timeout: 300 18.15/18.19 No parsing errors! 18.15/18.19 Init Location: 0 18.15/18.19 Transitions: 18.15/18.19 <l0, l4, true> 18.15/18.19 <l1, l2, (undef3 > ~(1)) /\ (arg2 > 1) /\ ((undef4 - (2 * undef5)) = 0) /\ (undef4 > ~(1)) /\ (arg1 > 0)> 18.15/18.19 <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}> 18.15/18.19 <l3, l3, (arg1 < 0), par{arg1 -> (arg1 - 1), arg2 -> undef12}> 18.15/18.19 <l4, l1, true, par{arg1 -> undef13, arg2 -> undef14}> 18.15/18.19 18.15/18.19 Fresh variables: 18.15/18.19 undef3, undef4, undef5, undef7, undef8, undef9, undef10, undef12, undef13, undef14, 18.15/18.19 18.15/18.19 Undef variables: 18.15/18.19 undef3, undef4, undef5, undef7, undef8, undef9, undef10, undef12, undef13, undef14, 18.15/18.19 18.15/18.19 Abstraction variables: 18.15/18.19 18.15/18.19 Exit nodes: 18.15/18.19 18.15/18.19 Accepting locations: 18.15/18.19 18.15/18.19 Asserts: 18.15/18.19 18.15/18.19 Preprocessed LLVMGraph 18.15/18.19 Init Location: 0 18.15/18.19 Transitions: 18.15/18.19 <l0, l3, (arg1 = (0 - undef8)) /\ (undef3 > ~(1)) /\ (undef14 > 1) /\ ((undef4 - (2 * undef5)) = 0) /\ (undef4 > ~(1)) /\ (undef13 > 0) /\ (undef8 > ~(1)) /\ (undef14 > 1) /\ ((undef9 - (2 * undef10)) = 0) /\ (undef9 > ~(1)) /\ (undef13 > 0) /\ ((undef9 - (2 * undef10)) < 2) /\ ((undef9 - (2 * undef10)) >= 0)> 18.15/18.19 <l3, l3, (arg1 < 0), par{arg1 -> (arg1 - 1)}> 18.15/18.19 18.15/18.19 Fresh variables: 18.15/18.19 undef3, undef4, undef5, undef7, undef8, undef9, undef10, undef12, undef13, undef14, 18.15/18.19 18.15/18.19 Undef variables: 18.15/18.19 undef3, undef4, undef5, undef7, undef8, undef9, undef10, undef12, undef13, undef14, 18.15/18.19 18.15/18.19 Abstraction variables: 18.15/18.19 18.15/18.19 Exit nodes: 18.15/18.19 18.15/18.19 Accepting locations: 18.15/18.19 18.15/18.19 Asserts: 18.15/18.19 18.15/18.19 ************************************************************* 18.15/18.19 ******************************************************************************************* 18.15/18.19 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 18.15/18.19 ******************************************************************************************* 18.15/18.19 18.15/18.19 Init Location: 0 18.15/18.19 Graph 0: 18.15/18.19 Transitions: 18.15/18.19 Variables: 18.15/18.19 18.15/18.19 Graph 1: 18.15/18.19 Transitions: 18.15/18.19 <l3, l3, 1 + arg1 <= 0, {arg1 -> -1 + arg1, rest remain the same}> 18.15/18.19 Variables: 18.15/18.19 arg1 18.15/18.19 18.15/18.19 Precedence: 18.15/18.19 Graph 0 18.15/18.19 18.15/18.19 Graph 1 18.15/18.19 <l0, l3, 1 <= undef13 /\ 2 <= undef14 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef8 /\ 0 <= undef9 /\ arg1 + undef8 = 0 /\ undef4 = 2*undef5 /\ undef9 = 2*undef10, {all remain the same}> 18.15/18.19 18.15/18.19 Map Locations to Subgraph: 18.15/18.19 ( 0 , 0 ) 18.15/18.19 ( 3 , 1 ) 18.15/18.19 18.15/18.19 ******************************************************************************************* 18.15/18.19 ******************************** CHECKING ASSERTIONS ******************************** 18.15/18.19 ******************************************************************************************* 18.15/18.19 18.15/18.19 Proving termination of subgraph 0 18.15/18.19 Proving termination of subgraph 1 18.15/18.19 Checking unfeasibility... 18.15/18.19 Time used: 0.001998 18.15/18.19 18.15/18.19 Checking conditional termination of SCC {l3}... 18.15/18.19 18.15/18.19 LOG: CALL solveLinear 18.15/18.19 18.15/18.19 LOG: RETURN solveLinear - Elapsed time: 0.000433s 18.15/18.19 18.15/18.19 LOG: CALL solveLinear 18.15/18.19 18.15/18.19 LOG: RETURN solveLinear - Elapsed time: 0.001115s 18.15/18.19 Trying to remove transition: <l3, l3, 1 + arg1 <= 0, {arg1 -> -1 + arg1, rest remain the same}> 18.15/18.19 Solving with 1 template(s). 18.15/18.19 18.15/18.19 LOG: CALL solveNonLinearGetFirstSolution 18.15/18.19 18.15/18.19 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003809s 18.15/18.19 Time used: 0.003676 18.15/18.19 Solving with 1 template(s). 18.15/18.19
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