xref: /llvm-project/clang/unittests/StaticAnalyzer/FalsePositiveRefutationBRVisitorTest.cpp (revision 58bad2862cf136f9483eb005bbfa6915d459b46d)
1fe0a555aSBalazs Benics //===- unittests/StaticAnalyzer/FalsePositiveRefutationBRVisitorTest.cpp --===//
2fe0a555aSBalazs Benics //
3fe0a555aSBalazs Benics // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4fe0a555aSBalazs Benics // See https://llvm.org/LICENSE.txt for license information.
5fe0a555aSBalazs Benics // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6fe0a555aSBalazs Benics //
7fe0a555aSBalazs Benics //===----------------------------------------------------------------------===//
8fe0a555aSBalazs Benics 
9fe0a555aSBalazs Benics #include "CheckerRegistration.h"
10fe0a555aSBalazs Benics #include "Reusables.h"
11fe0a555aSBalazs Benics #include "clang/Frontend/CompilerInstance.h"
12fe0a555aSBalazs Benics #include "clang/StaticAnalyzer/Core/BugReporter/BugReporter.h"
13fe0a555aSBalazs Benics #include "clang/StaticAnalyzer/Core/BugReporter/BugType.h"
14fe0a555aSBalazs Benics #include "clang/StaticAnalyzer/Core/Checker.h"
150b9d3a6eSBalazs Benics #include "clang/StaticAnalyzer/Core/PathSensitive/CallDescription.h"
16fe0a555aSBalazs Benics #include "clang/StaticAnalyzer/Core/PathSensitive/CallEvent.h"
17fe0a555aSBalazs Benics #include "clang/StaticAnalyzer/Core/PathSensitive/CheckerContext.h"
18fe0a555aSBalazs Benics #include "clang/StaticAnalyzer/Frontend/AnalysisConsumer.h"
19fe0a555aSBalazs Benics #include "clang/StaticAnalyzer/Frontend/CheckerRegistry.h"
2063d3aeb5SBalazs Benics #include "llvm/Config/llvm-config.h"
21fe0a555aSBalazs Benics #include "gtest/gtest.h"
22fe0a555aSBalazs Benics 
23fe0a555aSBalazs Benics namespace clang {
24fe0a555aSBalazs Benics namespace ento {
25fe0a555aSBalazs Benics namespace {
26fe0a555aSBalazs Benics 
27fe0a555aSBalazs Benics class FalsePositiveGenerator : public Checker<eval::Call> {
28fe0a555aSBalazs Benics   using Self = FalsePositiveGenerator;
298a5cfdf7SDonát Nagy   const BugType FalsePositiveGeneratorBug{this, "FalsePositiveGenerator"};
30fe0a555aSBalazs Benics   using HandlerFn = bool (Self::*)(const CallEvent &Call,
31fe0a555aSBalazs Benics                                    CheckerContext &) const;
32fe0a555aSBalazs Benics   CallDescriptionMap<HandlerFn> Callbacks = {
33*58bad286SDonát Nagy       {{CDM::SimpleFunc, {"reachedWithContradiction"}, 0},
34*58bad286SDonát Nagy        &Self::reachedWithContradiction},
35*58bad286SDonát Nagy       {{CDM::SimpleFunc, {"reachedWithNoContradiction"}, 0},
36*58bad286SDonát Nagy        &Self::reachedWithNoContradiction},
37*58bad286SDonát Nagy       {{CDM::SimpleFunc, {"reportIfCanBeTrue"}, 1}, &Self::reportIfCanBeTrue},
38fe0a555aSBalazs Benics   };
39fe0a555aSBalazs Benics 
report(CheckerContext & C,ProgramStateRef State,StringRef Description) const40fe0a555aSBalazs Benics   bool report(CheckerContext &C, ProgramStateRef State,
41fe0a555aSBalazs Benics               StringRef Description) const {
42fe0a555aSBalazs Benics     ExplodedNode *Node = C.generateNonFatalErrorNode(State);
43fe0a555aSBalazs Benics     if (!Node)
44fe0a555aSBalazs Benics       return false;
45fe0a555aSBalazs Benics 
46fe0a555aSBalazs Benics     auto Report = std::make_unique<PathSensitiveBugReport>(
47fe0a555aSBalazs Benics         FalsePositiveGeneratorBug, Description, Node);
48fe0a555aSBalazs Benics     C.emitReport(std::move(Report));
49fe0a555aSBalazs Benics     return true;
50fe0a555aSBalazs Benics   }
51fe0a555aSBalazs Benics 
reachedWithNoContradiction(const CallEvent &,CheckerContext & C) const52fe0a555aSBalazs Benics   bool reachedWithNoContradiction(const CallEvent &, CheckerContext &C) const {
53fe0a555aSBalazs Benics     return report(C, C.getState(), "REACHED_WITH_NO_CONTRADICTION");
54fe0a555aSBalazs Benics   }
55fe0a555aSBalazs Benics 
reachedWithContradiction(const CallEvent &,CheckerContext & C) const56fe0a555aSBalazs Benics   bool reachedWithContradiction(const CallEvent &, CheckerContext &C) const {
57fe0a555aSBalazs Benics     return report(C, C.getState(), "REACHED_WITH_CONTRADICTION");
58fe0a555aSBalazs Benics   }
59fe0a555aSBalazs Benics 
60fe0a555aSBalazs Benics   // Similar to ExprInspectionChecker::analyzerEval except it emits warning only
61fe0a555aSBalazs Benics   // if the argument can be true. The report emits the report in the state where
62fe0a555aSBalazs Benics   // the assertion true.
reportIfCanBeTrue(const CallEvent & Call,CheckerContext & C) const63fe0a555aSBalazs Benics   bool reportIfCanBeTrue(const CallEvent &Call, CheckerContext &C) const {
64fe0a555aSBalazs Benics     // A specific instantiation of an inlined function may have more constrained
65fe0a555aSBalazs Benics     // values than can generally be assumed. Skip the check.
66fe0a555aSBalazs Benics     if (C.getPredecessor()->getLocationContext()->getStackFrame()->getParent())
67fe0a555aSBalazs Benics       return false;
68fe0a555aSBalazs Benics 
69fe0a555aSBalazs Benics     SVal AssertionVal = Call.getArgSVal(0);
70fe0a555aSBalazs Benics     if (AssertionVal.isUndef())
71fe0a555aSBalazs Benics       return false;
72fe0a555aSBalazs Benics 
73fe0a555aSBalazs Benics     ProgramStateRef State = C.getPredecessor()->getState();
74fe0a555aSBalazs Benics     ProgramStateRef StTrue;
75fe0a555aSBalazs Benics     std::tie(StTrue, std::ignore) =
76fe0a555aSBalazs Benics         State->assume(AssertionVal.castAs<DefinedOrUnknownSVal>());
77fe0a555aSBalazs Benics     if (StTrue)
78fe0a555aSBalazs Benics       return report(C, StTrue, "CAN_BE_TRUE");
79fe0a555aSBalazs Benics     return false;
80fe0a555aSBalazs Benics   }
81fe0a555aSBalazs Benics 
82fe0a555aSBalazs Benics public:
evalCall(const CallEvent & Call,CheckerContext & C) const83fe0a555aSBalazs Benics   bool evalCall(const CallEvent &Call, CheckerContext &C) const {
84fe0a555aSBalazs Benics     if (const HandlerFn *Callback = Callbacks.lookup(Call))
85fe0a555aSBalazs Benics       return (this->*(*Callback))(Call, C);
86fe0a555aSBalazs Benics     return false;
87fe0a555aSBalazs Benics   }
88fe0a555aSBalazs Benics };
89fe0a555aSBalazs Benics 
addFalsePositiveGenerator(AnalysisASTConsumer & AnalysisConsumer,AnalyzerOptions & AnOpts)90fe0a555aSBalazs Benics void addFalsePositiveGenerator(AnalysisASTConsumer &AnalysisConsumer,
91fe0a555aSBalazs Benics                                AnalyzerOptions &AnOpts) {
92fe0a555aSBalazs Benics   AnOpts.CheckersAndPackages = {{"test.FalsePositiveGenerator", true},
93fe0a555aSBalazs Benics                                 {"debug.ViewExplodedGraph", false}};
94fe0a555aSBalazs Benics   AnalysisConsumer.AddCheckerRegistrationFn([](CheckerRegistry &Registry) {
95fe0a555aSBalazs Benics     Registry.addChecker<FalsePositiveGenerator>(
96fe0a555aSBalazs Benics         "test.FalsePositiveGenerator", "EmptyDescription", "EmptyDocsUri");
97fe0a555aSBalazs Benics   });
98fe0a555aSBalazs Benics }
99fe0a555aSBalazs Benics 
1003febf0b5SBalazs Benics class FalsePositiveRefutationBRVisitorTestBase : public testing::Test {
1013febf0b5SBalazs Benics public:
SetUp()1023febf0b5SBalazs Benics   void SetUp() override {
1033febf0b5SBalazs Benics #ifndef LLVM_WITH_Z3
1043febf0b5SBalazs Benics     GTEST_SKIP() << "Requires the LLVM_ENABLE_Z3_SOLVER cmake option.";
1053febf0b5SBalazs Benics #endif
1063febf0b5SBalazs Benics   }
1073febf0b5SBalazs Benics };
1083febf0b5SBalazs Benics 
109fe0a555aSBalazs Benics // C++20 use constexpr below.
110fe0a555aSBalazs Benics const std::vector<std::string> LazyAssumeArgs{
111fe0a555aSBalazs Benics     "-Xclang", "-analyzer-config", "-Xclang", "eagerly-assume=false"};
112fe0a555aSBalazs Benics const std::vector<std::string> LazyAssumeAndCrossCheckArgs{
113fe0a555aSBalazs Benics     "-Xclang", "-analyzer-config", "-Xclang", "eagerly-assume=false",
114fe0a555aSBalazs Benics     "-Xclang", "-analyzer-config", "-Xclang", "crosscheck-with-z3=true"};
115fe0a555aSBalazs Benics 
TEST_F(FalsePositiveRefutationBRVisitorTestBase,UnSatInTheMiddleNoReport)1163febf0b5SBalazs Benics TEST_F(FalsePositiveRefutationBRVisitorTestBase, UnSatInTheMiddleNoReport) {
117fe0a555aSBalazs Benics   constexpr auto Code = R"(
118fe0a555aSBalazs Benics      void reachedWithContradiction();
119fe0a555aSBalazs Benics      void reachedWithNoContradiction();
120fe0a555aSBalazs Benics      void test(int x, int y) {
121fe0a555aSBalazs Benics        if (x * y == 0)
122fe0a555aSBalazs Benics          return;
123fe0a555aSBalazs Benics        reachedWithNoContradiction();
124fe0a555aSBalazs Benics        if (x == 0) {
125fe0a555aSBalazs Benics          reachedWithContradiction();
126fe0a555aSBalazs Benics          // x * y != 0  =>  x != 0 && y != 0  => contradict with x == 0
127fe0a555aSBalazs Benics        }
128fe0a555aSBalazs Benics      })";
129fe0a555aSBalazs Benics 
130fe0a555aSBalazs Benics   std::string Diags;
131fe0a555aSBalazs Benics   EXPECT_TRUE(runCheckerOnCodeWithArgs<addFalsePositiveGenerator>(
132fb4d590aSKristóf Umann       Code, LazyAssumeAndCrossCheckArgs, Diags, /*OnlyEmitWarnings=*/ true));
133fe0a555aSBalazs Benics   EXPECT_EQ(Diags,
134fe0a555aSBalazs Benics             "test.FalsePositiveGenerator: REACHED_WITH_NO_CONTRADICTION\n");
135fe0a555aSBalazs Benics   // Single warning. The second report was invalidated by the visitor.
136fe0a555aSBalazs Benics 
137fe0a555aSBalazs Benics   // Without enabling the crosscheck-with-z3 both reports are displayed.
138fe0a555aSBalazs Benics   std::string Diags2;
139fe0a555aSBalazs Benics   EXPECT_TRUE(runCheckerOnCodeWithArgs<addFalsePositiveGenerator>(
140fb4d590aSKristóf Umann       Code, LazyAssumeArgs, Diags2, /*OnlyEmitWarnings=*/ true));
141fe0a555aSBalazs Benics   EXPECT_EQ(Diags2,
142fe0a555aSBalazs Benics             "test.FalsePositiveGenerator: REACHED_WITH_NO_CONTRADICTION\n"
143fe0a555aSBalazs Benics             "test.FalsePositiveGenerator: REACHED_WITH_CONTRADICTION\n");
144fe0a555aSBalazs Benics }
145fe0a555aSBalazs Benics 
TEST_F(FalsePositiveRefutationBRVisitorTestBase,UnSatAtErrorNodeWithNewSymbolNoReport)1463febf0b5SBalazs Benics TEST_F(FalsePositiveRefutationBRVisitorTestBase,
1473febf0b5SBalazs Benics        UnSatAtErrorNodeWithNewSymbolNoReport) {
148fe0a555aSBalazs Benics   constexpr auto Code = R"(
149fe0a555aSBalazs Benics     void reportIfCanBeTrue(bool);
150fe0a555aSBalazs Benics     void reachedWithNoContradiction();
151fe0a555aSBalazs Benics     void test(int x, int y) {
152fe0a555aSBalazs Benics       if (x * y == 0)
153fe0a555aSBalazs Benics        return;
154fe0a555aSBalazs Benics       // We know that 'x * y': {[MIN,-1], [1,MAX]}
155fe0a555aSBalazs Benics       reachedWithNoContradiction();
156fe0a555aSBalazs Benics       reportIfCanBeTrue(x == 0); // contradiction
157fe0a555aSBalazs Benics       // The function introduces the 'x == 0' constraint in the ErrorNode which
158fe0a555aSBalazs Benics       // leads to contradiction with the constraint of 'x * y'.
159fe0a555aSBalazs Benics       // Note that the new constraint was bound to a new symbol 'x'.
160fe0a555aSBalazs Benics     })";
161fe0a555aSBalazs Benics   std::string Diags;
162fe0a555aSBalazs Benics   EXPECT_TRUE(runCheckerOnCodeWithArgs<addFalsePositiveGenerator>(
163fb4d590aSKristóf Umann       Code, LazyAssumeAndCrossCheckArgs, Diags, /*OnlyEmitWarnings=*/ true));
164fe0a555aSBalazs Benics   EXPECT_EQ(Diags,
165fe0a555aSBalazs Benics             "test.FalsePositiveGenerator: REACHED_WITH_NO_CONTRADICTION\n");
166fe0a555aSBalazs Benics   // Single warning. The second report was invalidated by the visitor.
167fe0a555aSBalazs Benics 
168fe0a555aSBalazs Benics   // Without enabling the crosscheck-with-z3 both reports are displayed.
169fe0a555aSBalazs Benics   std::string Diags2;
170fe0a555aSBalazs Benics   EXPECT_TRUE(runCheckerOnCodeWithArgs<addFalsePositiveGenerator>(
171fb4d590aSKristóf Umann       Code, LazyAssumeArgs, Diags2, /*OnlyEmitWarnings=*/ true));
172fe0a555aSBalazs Benics   EXPECT_EQ(Diags2,
173fe0a555aSBalazs Benics             "test.FalsePositiveGenerator: REACHED_WITH_NO_CONTRADICTION\n"
174fe0a555aSBalazs Benics             "test.FalsePositiveGenerator: CAN_BE_TRUE\n");
175fe0a555aSBalazs Benics }
176fe0a555aSBalazs Benics 
TEST_F(FalsePositiveRefutationBRVisitorTestBase,UnSatAtErrorNodeDueToRefinedConstraintNoReport)1773febf0b5SBalazs Benics TEST_F(FalsePositiveRefutationBRVisitorTestBase,
178de361df3SBalazs Benics        UnSatAtErrorNodeDueToRefinedConstraintNoReport) {
179de361df3SBalazs Benics   constexpr auto Code = R"(
180de361df3SBalazs Benics     void reportIfCanBeTrue(bool);
181de361df3SBalazs Benics     void reachedWithNoContradiction();
182de361df3SBalazs Benics     void test(unsigned x, unsigned n) {
183de361df3SBalazs Benics       if (n >= 1 && n <= 2) {
184de361df3SBalazs Benics         if (x >= 3)
185de361df3SBalazs Benics           return;
186de361df3SBalazs Benics         // x: [0,2] and n: [1,2]
187de361df3SBalazs Benics         int y = x + n; // y: '(x+n)' Which is in approximately between 1 and 4.
188de361df3SBalazs Benics 
189de361df3SBalazs Benics         // Registers the symbol 'y' with the constraint [1, MAX] in the true
190de361df3SBalazs Benics         // branch.
191de361df3SBalazs Benics         if (y > 0) {
192de361df3SBalazs Benics           // Since the x: [0,2] and n: [1,2], the 'y' is indeed greater than
193de361df3SBalazs Benics           // zero. If we emit a warning here, the constraints on the BugPath is
194de361df3SBalazs Benics           // SAT. Therefore that report is NOT invalidated.
195de361df3SBalazs Benics           reachedWithNoContradiction(); // 'y' can be greater than zero. OK
196de361df3SBalazs Benics 
197de361df3SBalazs Benics           // If we ask the analyzer whether the 'y' can be 5. It won't know,
198de361df3SBalazs Benics           // therefore, the state will be created where the 'y' expression is 5.
199de361df3SBalazs Benics           // Although, this assumption is false!
200de361df3SBalazs Benics           // 'y' can not be 5 if the maximal value of both x and n is 2.
201de361df3SBalazs Benics           // The BugPath which become UnSAT in the ErrorNode with a refined
202de361df3SBalazs Benics           // constraint, should be invalidated.
203de361df3SBalazs Benics           reportIfCanBeTrue(y == 5);
204de361df3SBalazs Benics         }
205de361df3SBalazs Benics       }
206de361df3SBalazs Benics     })";
207de361df3SBalazs Benics 
208de361df3SBalazs Benics   std::string Diags;
209de361df3SBalazs Benics   EXPECT_TRUE(runCheckerOnCodeWithArgs<addFalsePositiveGenerator>(
210fb4d590aSKristóf Umann       Code, LazyAssumeAndCrossCheckArgs, Diags, /*OnlyEmitWarnings=*/ true));
211de361df3SBalazs Benics   EXPECT_EQ(Diags,
212de361df3SBalazs Benics             "test.FalsePositiveGenerator: REACHED_WITH_NO_CONTRADICTION\n");
213de361df3SBalazs Benics   // Single warning. The second report was invalidated by the visitor.
214de361df3SBalazs Benics 
215de361df3SBalazs Benics   // Without enabling the crosscheck-with-z3 both reports are displayed.
216de361df3SBalazs Benics   std::string Diags2;
217de361df3SBalazs Benics   EXPECT_TRUE(runCheckerOnCodeWithArgs<addFalsePositiveGenerator>(
218fb4d590aSKristóf Umann       Code, LazyAssumeArgs, Diags2, /*OnlyEmitWarnings=*/ true));
219de361df3SBalazs Benics   EXPECT_EQ(Diags2,
220de361df3SBalazs Benics             "test.FalsePositiveGenerator: REACHED_WITH_NO_CONTRADICTION\n"
221de361df3SBalazs Benics             "test.FalsePositiveGenerator: CAN_BE_TRUE\n");
222de361df3SBalazs Benics }
223de361df3SBalazs Benics 
224fe0a555aSBalazs Benics } // namespace
225fe0a555aSBalazs Benics } // namespace ento
226fe0a555aSBalazs Benics } // namespace clang
227