details

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

run statistics

property	value
solver	VeryMax-termCOMP17
configuration	termcomp2019_ITS
runtime (wallclock)	225.847 seconds
cpu usage	225.579
user time	221.33
system time	4.24868
max virtual memory	796664.0
max residence set size	135984.0

stage attributes

key	value
starexec-result	NO

output

225.53/225.83 NO 225.53/225.83 225.53/225.83 Solver Timeout: 4 225.53/225.83 Global Timeout: 300 225.53/225.83 No parsing errors! 225.53/225.83 Init Location: 0 225.53/225.83 Transitions: 225.53/225.83 <l0, l4, true> 225.53/225.83 <l1, l2, true, par{arg1 -> 2, arg2 -> 2, arg3 -> 2, arg4 -> 0}> 225.53/225.83 <l2, l3, (arg4 > arg2) /\ (arg2 > 0) /\ (arg2 = arg3), par{arg2 -> (arg2 + 4), arg3 -> arg4, arg4 -> undef8}> 225.53/225.83 <l2, l3, (arg4 <= arg2) /\ (arg2 > 0) /\ (arg4 > ~(1)) /\ (arg2 = arg3), par{arg2 -> (arg2 + 2), arg3 -> (arg4 + 1), arg4 -> undef12}> 225.53/225.83 <l3, l2, (arg3 > 0) /\ (arg1 > 1) /\ (arg2 > 1), par{arg1 -> arg2, arg3 -> arg2, arg4 -> arg3}> 225.53/225.83 <l4, l1, true, par{arg1 -> undef17, arg2 -> undef18, arg3 -> undef19, arg4 -> undef20}> 225.53/225.83 225.53/225.83 Fresh variables: 225.53/225.83 undef8, undef12, undef17, undef18, undef19, undef20, 225.53/225.83 225.53/225.83 Undef variables: 225.53/225.83 undef8, undef12, undef17, undef18, undef19, undef20, 225.53/225.83 225.53/225.83 Abstraction variables: 225.53/225.83 225.53/225.83 Exit nodes: 225.53/225.83 225.53/225.83 Accepting locations: 225.53/225.83 225.53/225.83 Asserts: 225.53/225.83 225.53/225.83 Preprocessed LLVMGraph 225.53/225.83 Init Location: 0 225.53/225.83 Transitions: 225.53/225.83 <l0, l2, (arg1 = 2) /\ (arg2 = 2) /\ (arg3 = 2) /\ (arg4 = 0)> 225.53/225.83 <l2, l2, (arg4 > arg2) /\ (arg2 > 0) /\ (arg2 = arg3) /\ (arg4 > 0) /\ (arg1 > 1) /\ ((arg2 + 4) > 1), par{arg1 -> (arg2 + 4), arg2 -> (arg2 + 4), arg3 -> (arg2 + 4), arg4 -> arg4}> 225.53/225.83 <l2, l2, (arg4 <= arg2) /\ (arg2 > 0) /\ (arg4 > ~(1)) /\ (arg2 = arg3) /\ ((arg4 + 1) > 0) /\ (arg1 > 1) /\ ((arg2 + 2) > 1), par{arg1 -> (arg2 + 2), arg2 -> (arg2 + 2), arg3 -> (arg2 + 2), arg4 -> (arg4 + 1)}> 225.53/225.83 225.53/225.83 Fresh variables: 225.53/225.83 undef8, undef12, undef17, undef18, undef19, undef20, 225.53/225.83 225.53/225.83 Undef variables: 225.53/225.83 undef8, undef12, undef17, undef18, undef19, undef20, 225.53/225.83 225.53/225.83 Abstraction variables: 225.53/225.83 225.53/225.83 Exit nodes: 225.53/225.83 225.53/225.83 Accepting locations: 225.53/225.83 225.53/225.83 Asserts: 225.53/225.83 225.53/225.83 ************************************************************* 225.53/225.83 ******************************************************************************************* 225.53/225.83 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 225.53/225.83 ******************************************************************************************* 225.53/225.83 225.53/225.83 Init Location: 0 225.53/225.83 Graph 0: 225.53/225.83 Transitions: 225.53/225.83 Variables: 225.53/225.83 225.53/225.83 Graph 1: 225.53/225.83 Transitions: 225.53/225.83 <l2, l2, 2 <= arg1 /\ 1 + arg2 <= arg4 /\ 1 <= arg2 /\ 1 <= arg4 /\ arg2 = arg3, {arg1 -> 4 + arg2, arg2 -> 4 + arg2, arg3 -> 4 + arg2, rest remain the same}> 225.53/225.83 <l2, l2, 2 <= arg1 /\ arg4 <= arg2 /\ 0 <= arg4 /\ 1 <= arg2 /\ arg2 = arg3, {arg1 -> 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, rest remain the same}> 225.53/225.83 Variables: 225.53/225.83 arg1, arg2, arg3, arg4 225.53/225.83 225.53/225.83 Precedence: 225.53/225.83 Graph 0 225.53/225.83 225.53/225.83 Graph 1 225.53/225.83 <l0, l2, arg4 = 0 /\ arg1 = 2 /\ arg2 = 2 /\ arg3 = 2, {all remain the same}> 225.53/225.83 225.53/225.83 Map Locations to Subgraph: 225.53/225.83 ( 0 , 0 ) 225.53/225.83 ( 2 , 1 ) 225.53/225.83 225.53/225.83 ******************************************************************************************* 225.53/225.83 ******************************** CHECKING ASSERTIONS ******************************** 225.53/225.83 ******************************************************************************************* 225.53/225.83 225.53/225.83 Proving termination of subgraph 0 225.53/225.83 Proving termination of subgraph 1 225.53/225.83 Checking unfeasibility... 225.53/225.83 Time used: 0.014932 225.53/225.83 �[33mSome transition disabled by a set of invariant(s):�[0m 225.53/225.83 �[36mInvariant at l2: arg4 <= arg2�[0m 225.53/225.83 225.53/225.83 �[33mStrengthening and disabling transitions...�[0m 225.53/225.83 > It's unfeasible. Removing transition: 225.53/225.83 <l2, l2, 2 <= arg1 /\ 1 + arg2 <= arg4 /\ 1 <= arg2 /\ 1 <= arg4 /\ arg2 = arg3, {arg1 -> 4 + arg2, arg2 -> 4 + arg2, arg3 -> 4 + arg2, rest remain the same}> 225.53/225.83 225.53/225.83 LOG: CALL solverLinear in Graph for feasibility 225.53/225.83 225.53/225.83 LOG: RETURN solveLinear in Graph for feasibility 225.53/225.83 Strengthening transition (result): 225.53/225.83 <l2, l2, 2 <= arg1 /\ arg4 <= arg2 /\ 0 <= arg4 /\ 1 <= arg2 /\ arg2 = arg3, {arg1 -> 2 + arg2, arg2 -> 2 + arg2, arg3 -> 2 + arg2, arg4 -> 1 + arg4, rest remain the same}> 225.53/225.83 Checking unfeasibility... 225.53/225.83 Time used: 0.05575 225.53/225.83 225.53/225.83 Checking conditional termination of SCC {l2}... 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