details

property	value
status	complete
benchmark	MultiLasso.jar-obl-8.smt2
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n153.star.cs.uiowa.edu
space	From_AProVE_2014

run statistics

property	value
solver	VeryMax-termCOMP17
configuration	termcomp2019_ITS
runtime (wallclock)	19.5932 seconds
cpu usage	19.5789
user time	19.0246
system time	0.554331
max virtual memory	786072.0
max residence set size	130308.0

stage attributes

key	value
starexec-result	NO

output

19.56/19.59 NO 19.56/19.59 19.56/19.59 Solver Timeout: 4 19.56/19.59 Global Timeout: 300 19.56/19.59 No parsing errors! 19.56/19.59 Init Location: 0 19.56/19.59 Transitions: 19.56/19.59 <l0, l4, true> 19.56/19.59 <l1, l2, (undef4 > ~(1)) /\ (arg2 > 1) /\ (undef5 > ~(1)) /\ (arg1 > 0), par{arg1 -> (undef4 - undef5), arg2 -> undef2, arg3 -> undef3}> 19.56/19.59 <l2, l3, (arg1 > 0), par{arg1 -> (arg1 + 1), arg2 -> (arg1 + 1), arg3 -> (arg1 + 1)}> 19.56/19.59 <l3, l2, (0 = arg2) /\ (0 = arg3), par{arg2 -> undef10, arg3 -> undef11}> 19.56/19.59 <l3, l3, (arg2 > 0) /\ (arg2 = arg3), par{arg2 -> (arg2 - 1), arg3 -> (arg2 - 1)}> 19.56/19.59 <l4, l1, true, par{arg1 -> undef15, arg2 -> undef16, arg3 -> undef17}> 19.56/19.59 19.56/19.59 Fresh variables: 19.56/19.59 undef2, undef3, undef4, undef5, undef10, undef11, undef15, undef16, undef17, 19.56/19.59 19.56/19.59 Undef variables: 19.56/19.59 undef2, undef3, undef4, undef5, undef10, undef11, undef15, undef16, undef17, 19.56/19.59 19.56/19.59 Abstraction variables: 19.56/19.59 19.56/19.59 Exit nodes: 19.56/19.59 19.56/19.59 Accepting locations: 19.56/19.59 19.56/19.59 Asserts: 19.56/19.59 19.56/19.59 Preprocessed LLVMGraph 19.56/19.59 Init Location: 0 19.56/19.59 Transitions: 19.56/19.59 <l0, l3, (arg1 = ((undef4 - undef5) + 1)) /\ (arg2 = ((undef4 - undef5) + 1)) /\ (arg3 = ((undef4 - undef5) + 1)) /\ (undef4 > ~(1)) /\ (undef16 > 1) /\ (undef5 > ~(1)) /\ (undef15 > 0) /\ ((undef4 - undef5) > 0)> 19.56/19.59 <l3, l3, (0 = arg2) /\ (0 = arg3) /\ (arg1 > 0), par{arg1 -> (arg1 + 1), arg2 -> (arg1 + 1), arg3 -> (arg1 + 1)}> 19.56/19.59 <l3, l3, (arg2 > 0) /\ (arg2 = arg3), par{arg2 -> (arg2 - 1), arg3 -> (arg2 - 1)}> 19.56/19.59 19.56/19.59 Fresh variables: 19.56/19.59 undef2, undef3, undef4, undef5, undef10, undef11, undef15, undef16, undef17, 19.56/19.59 19.56/19.59 Undef variables: 19.56/19.59 undef2, undef3, undef4, undef5, undef10, undef11, undef15, undef16, undef17, 19.56/19.59 19.56/19.59 Abstraction variables: 19.56/19.59 19.56/19.59 Exit nodes: 19.56/19.59 19.56/19.59 Accepting locations: 19.56/19.59 19.56/19.59 Asserts: 19.56/19.59 19.56/19.59 ************************************************************* 19.56/19.59 ******************************************************************************************* 19.56/19.59 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 19.56/19.59 ******************************************************************************************* 19.56/19.59 19.56/19.59 Init Location: 0 19.56/19.59 Graph 0: 19.56/19.59 Transitions: 19.56/19.59 Variables: 19.56/19.59 19.56/19.59 Graph 1: 19.56/19.59 Transitions: 19.56/19.59 <l3, l3, 1 <= arg1 /\ arg2 = 0 /\ arg3 = 0, {arg1 -> 1 + arg1, arg2 -> 1 + arg1, arg3 -> 1 + arg1, rest remain the same}> 19.56/19.59 <l3, l3, 1 <= arg2 /\ arg2 = arg3, {arg2 -> -1 + arg2, arg3 -> -1 + arg2, rest remain the same}> 19.56/19.59 Variables: 19.56/19.59 arg1, arg2, arg3 19.56/19.59 19.56/19.59 Precedence: 19.56/19.59 Graph 0 19.56/19.59 19.56/19.59 Graph 1 19.56/19.59 <l0, l3, 1 + undef5 <= undef4 /\ 1 <= undef15 /\ 0 <= undef4 /\ 0 <= undef5 /\ 2 <= undef16 /\ arg1 + undef5 = 1 + undef4 /\ arg2 + undef5 = 1 + undef4 /\ arg3 + undef5 = 1 + undef4, {all remain the same}> 19.56/19.59 19.56/19.59 Map Locations to Subgraph: 19.56/19.59 ( 0 , 0 ) 19.56/19.59 ( 3 , 1 ) 19.56/19.59 19.56/19.59 ******************************************************************************************* 19.56/19.59 ******************************** CHECKING ASSERTIONS ******************************** 19.56/19.59 ******************************************************************************************* 19.56/19.59 19.56/19.59 Proving termination of subgraph 0 19.56/19.59 Proving termination of subgraph 1 19.56/19.59 Checking unfeasibility... 19.56/19.59 Time used: 0.032013 19.56/19.59 19.56/19.59 Checking conditional termination of SCC {l3}... 19.56/19.59 19.56/19.59 LOG: CALL solveLinear 19.56/19.59 19.56/19.59 LOG: RETURN solveLinear - Elapsed time: 0.001205s 19.56/19.59 19.56/19.59 LOG: CALL solveLinear 19.56/19.59 19.56/19.59 LOG: RETURN solveLinear - Elapsed time: 0.009315s 19.56/19.59 Trying to remove transition: <l3, l3, 1 <= arg2 /\ arg2 = arg3, {arg2 -> -1 + arg2, arg3 -> -1 + arg2, rest remain the same}> 19.56/19.59 Solving with 1 template(s). 19.56/19.59 19.56/19.59 LOG: CALL solveNonLinearGetFirstSolution 19.56/19.59 19.56/19.59 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.020823s 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