From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: by sourceware.org (Postfix, from userid 48) id 9B44F387086D; Wed, 29 Jul 2020 15:42:36 +0000 (GMT) DKIM-Filter: OpenDKIM Filter v2.11.0 sourceware.org 9B44F387086D DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gcc.gnu.org; s=default; t=1596037356; bh=xgEAbWy30llbYjYRWOmbXC2ha8th8bLZRgTMHzc56hE=; h=From:To:Subject:Date:In-Reply-To:References:From; b=Oknp5XgyG6FTQGkXgnSb/z4c8L7v0uNVOSwPgoWhv08nvtc4ndxYPge2CYmjhLj6O wQcg2KJycQz9J+AxeNr+QW2Sw05x7jN3c7sOUgBeXpdJkuuevnN56Ei3ya0n3i4Zjn /BBc1n+8a+u/nBOUSp00Arzm7ziJAkP+CCRdRB5k= From: "dmalcolm at gcc dot gnu.org" To: gcc-bugs@gcc.gnu.org Subject: [Bug analyzer/96374] Analyzer erroneously rejects certain diagnostics due to path-feasibility being used on shortest path Date: Wed, 29 Jul 2020 15:42:36 +0000 X-Bugzilla-Reason: CC X-Bugzilla-Type: changed X-Bugzilla-Watch-Reason: None X-Bugzilla-Product: gcc X-Bugzilla-Component: analyzer X-Bugzilla-Version: 11.0 X-Bugzilla-Keywords: X-Bugzilla-Severity: normal X-Bugzilla-Who: dmalcolm at gcc dot gnu.org X-Bugzilla-Status: UNCONFIRMED X-Bugzilla-Resolution: X-Bugzilla-Priority: P3 X-Bugzilla-Assigned-To: dmalcolm at gcc dot gnu.org X-Bugzilla-Target-Milestone: --- X-Bugzilla-Flags: X-Bugzilla-Changed-Fields: Message-ID: In-Reply-To: References: Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: quoted-printable X-Bugzilla-URL: http://gcc.gnu.org/bugzilla/ Auto-Submitted: auto-generated MIME-Version: 1.0 X-BeenThere: gcc-bugs@gcc.gnu.org X-Mailman-Version: 2.1.29 Precedence: list List-Id: Gcc-bugs mailing list List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Wed, 29 Jul 2020 15:42:36 -0000 https://gcc.gnu.org/bugzilla/show_bug.cgi?id=3D96374 --- Comment #1 from David Malcolm --- This is likely to be associated with "merger" exploded_nodes (where we have merged state to help the exploded graph converge). Perhaps if we fail to f= ind a feasible path on the first try we could retry, finding the shortest path = that doesn't include each merger node in turn, and if any of those are feasible, find the shortest one.=