summaryrefslogtreecommitdiff
path: root/src/theory/quantifiers/sygus/cegis.cpp
blob: ab448a2b877329519ae0061e0e0c8f79daaf6e20 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
/*********************                                                        */
/*! \file cegis.cpp
 ** \verbatim
 ** Top contributors (to current version):
 **   Andrew Reynolds
 ** This file is part of the CVC4 project.
 ** Copyright (c) 2009-2017 by the authors listed in the file AUTHORS
 ** in the top-level source directory) and their institutional affiliations.
 ** All rights reserved.  See the file COPYING in the top-level source
 ** directory for licensing information.\endverbatim
 **
 ** \brief Implementation of cegis
 **/

#include "theory/quantifiers/sygus/cegis.h"
#include "options/quantifiers_options.h"
#include "theory/quantifiers/sygus/ce_guided_conjecture.h"
#include "theory/quantifiers/sygus/term_database_sygus.h"
#include "theory/theory_engine.h"

using namespace std;
using namespace CVC4::kind;
using namespace CVC4::context;

namespace CVC4 {
namespace theory {
namespace quantifiers {

Cegis::Cegis(QuantifiersEngine* qe, CegConjecture* p) : SygusModule(qe, p) {}
bool Cegis::initialize(Node n,
                       const std::vector<Node>& candidates,
                       std::vector<Node>& lemmas)
{
  d_base_body = n;
  if (d_base_body.getKind() == NOT && d_base_body[0].getKind() == FORALL)
  {
    for (const Node& v : d_base_body[0][0])
    {
      d_base_vars.push_back(v);
    }
    d_base_body = d_base_body[0][1];
  }

  // assign the cegis sampler if applicable
  if (options::cegisSample() != CEGIS_SAMPLE_NONE)
  {
    Trace("cegis-sample") << "Initialize sampler for " << d_base_body << "..."
                          << std::endl;
    TypeNode bt = d_base_body.getType();
    d_cegis_sampler.initialize(bt, d_base_vars, options::sygusSamples());
  }

  // initialize an enumerator for each candidate
  TermDbSygus* tds = d_qe->getTermDatabaseSygus();
  for (unsigned i = 0; i < candidates.size(); i++)
  {
    tds->registerEnumerator(candidates[i], candidates[i], d_parent);
  }
  return true;
}

void Cegis::getTermList(const std::vector<Node>& candidates,
                        std::vector<Node>& enums)
{
  enums.insert(enums.end(), candidates.begin(), candidates.end());
}

/** construct candidate */
bool Cegis::constructCandidates(const std::vector<Node>& enums,
                                const std::vector<Node>& enum_values,
                                const std::vector<Node>& candidates,
                                std::vector<Node>& candidate_values,
                                std::vector<Node>& lems)
{
  candidate_values.insert(
      candidate_values.end(), enum_values.begin(), enum_values.end());

  if (options::sygusDirectEval())
  {
    NodeManager* nm = NodeManager::currentNM();
    bool addedEvalLemmas = false;
    if (options::sygusCRefEval())
    {
      Trace("cegqi-engine") << "  *** Do conjecture refinement evaluation..."
                            << std::endl;
      // see if any refinement lemma is refuted by evaluation
      std::vector<Node> cre_lems;
      getRefinementEvalLemmas(candidates, candidate_values, cre_lems);
      if (!cre_lems.empty())
      {
        for (unsigned j = 0; j < cre_lems.size(); j++)
        {
          Node lem = cre_lems[j];
          if (d_qe->addLemma(lem))
          {
            Trace("cegqi-lemma") << "Cegqi::Lemma : cref evaluation : " << lem
                                 << std::endl;
            addedEvalLemmas = true;
          }
        }
        // we could, but do not return here.
        // experimentally, it is better to add the lemmas below as well,
        // in parallel.
      }
    }
    Trace("cegqi-engine") << "  *** Do direct evaluation..." << std::endl;
    std::vector<Node> eager_terms;
    std::vector<Node> eager_vals;
    std::vector<Node> eager_exps;
    TermDbSygus* tds = d_qe->getTermDatabaseSygus();
    for (unsigned j = 0, size = candidates.size(); j < size; j++)
    {
      Trace("cegqi-debug") << "  register " << candidates[j] << " -> "
                           << candidate_values[j] << std::endl;
      tds->registerModelValue(candidates[j],
                              candidate_values[j],
                              eager_terms,
                              eager_vals,
                              eager_exps);
    }
    Trace("cegqi-debug") << "...produced " << eager_terms.size()
                         << " eager evaluation lemmas." << std::endl;

    for (unsigned j = 0, size = eager_terms.size(); j < size; j++)
    {
      Node lem = nm->mkNode(kind::OR,
                            eager_exps[j].negate(),
                            eager_terms[j].eqNode(eager_vals[j]));
      if (d_qe->addLemma(lem))
      {
        Trace("cegqi-lemma") << "Cegqi::Lemma : evaluation : " << lem
                             << std::endl;
        addedEvalLemmas = true;
      }
    }
    if (addedEvalLemmas)
    {
      return false;
    }
  }

  return true;
}

void Cegis::registerRefinementLemma(const std::vector<Node>& vars,
                                    Node lem,
                                    std::vector<Node>& lems)
{
  d_refinement_lemmas.push_back(lem);
  // Make the refinement lemma and add it to lems.
  // This lemma is guarded by the parent's guard, which has the semantics
  // "this conjecture has a solution", hence this lemma states:
  // if the parent conjecture has a solution, it satisfies the specification
  // for the given concrete point.
  Node rlem =
      NodeManager::currentNM()->mkNode(OR, d_parent->getGuard().negate(), lem);
  lems.push_back(rlem);
}

void Cegis::getRefinementEvalLemmas(const std::vector<Node>& vs,
                                    const std::vector<Node>& ms,
                                    std::vector<Node>& lems)
{
  Trace("sygus-cref-eval") << "Cref eval : conjecture has "
                           << getNumRefinementLemmas() << " refinement lemmas."
                           << std::endl;
  unsigned nlemmas = getNumRefinementLemmas();
  if (nlemmas > 0 || options::cegisSample() != CEGIS_SAMPLE_NONE)
  {
    Assert(vs.size() == ms.size());

    TermDbSygus* tds = d_qe->getTermDatabaseSygus();
    NodeManager* nm = NodeManager::currentNM();

    Node nfalse = nm->mkConst(false);
    Node neg_guard = d_parent->getGuard().negate();
    for (unsigned i = 0; i <= nlemmas; i++)
    {
      if (i == nlemmas)
      {
        bool addedSample = false;
        // find a new one by sampling, if applicable
        if (options::cegisSample() != CEGIS_SAMPLE_NONE)
        {
          addedSample = sampleAddRefinementLemma(vs, ms, lems);
        }
        if (!addedSample)
        {
          return;
        }
      }
      Node lem;
      std::map<Node, Node> visited;
      std::map<Node, std::vector<Node> > exp;
      lem = getRefinementLemma(i);
      if (!lem.isNull())
      {
        std::vector<Node> lem_conj;
        // break into conjunctions
        if (lem.getKind() == kind::AND)
        {
          for (unsigned i = 0; i < lem.getNumChildren(); i++)
          {
            lem_conj.push_back(lem[i]);
          }
        }
        else
        {
          lem_conj.push_back(lem);
        }
        EvalSygusInvarianceTest vsit;
        for (unsigned j = 0; j < lem_conj.size(); j++)
        {
          Node lemc = lem_conj[j];
          Trace("sygus-cref-eval") << "Check refinement lemma conjunct " << lemc
                                   << " against current model." << std::endl;
          Trace("sygus-cref-eval2") << "Check refinement lemma conjunct "
                                    << lemc << " against current model."
                                    << std::endl;
          Node cre_lem;
          Node lemcs =
              lemc.substitute(vs.begin(), vs.end(), ms.begin(), ms.end());
          Trace("sygus-cref-eval2") << "...under substitution it is : " << lemcs
                                    << std::endl;
          Node lemcsu = vsit.doEvaluateWithUnfolding(tds, lemcs);
          Trace("sygus-cref-eval2") << "...after unfolding is : " << lemcsu
                                    << std::endl;
          if (lemcsu.isConst() && !lemcsu.getConst<bool>())
          {
            std::vector<Node> msu;
            std::vector<Node> mexp;
            msu.insert(msu.end(), ms.begin(), ms.end());
            for (unsigned k = 0; k < vs.size(); k++)
            {
              vsit.setUpdatedTerm(msu[k]);
              msu[k] = vs[k];
              // substitute for everything except this
              Node sconj =
                  lemc.substitute(vs.begin(), vs.end(), msu.begin(), msu.end());
              vsit.init(sconj, vs[k], nfalse);
              // get minimal explanation for this
              Node ut = vsit.getUpdatedTerm();
              Trace("sygus-cref-eval2-debug")
                  << "  compute min explain of : " << vs[k] << " = " << ut
                  << std::endl;
              tds->getExplain()->getExplanationFor(vs[k], ut, mexp, vsit);
              msu[k] = ut;
            }
            if (!mexp.empty())
            {
              Node en =
                  mexp.size() == 1 ? mexp[0] : nm->mkNode(kind::AND, mexp);
              cre_lem = nm->mkNode(kind::OR, en.negate(), neg_guard);
            }
            else
            {
              cre_lem = neg_guard;
            }
          }
          if (!cre_lem.isNull())
          {
            if (std::find(lems.begin(), lems.end(), cre_lem) == lems.end())
            {
              Trace("sygus-cref-eval") << "...produced lemma : " << cre_lem
                                       << std::endl;
              lems.push_back(cre_lem);
            }
          }
        }
      }
    }
  }
}

bool Cegis::sampleAddRefinementLemma(const std::vector<Node>& candidates,
                                     const std::vector<Node>& vals,
                                     std::vector<Node>& lems)
{
  if (Trace.isOn("cegis-sample"))
  {
    Trace("cegis-sample") << "Check sampling for candidate solution"
                          << std::endl;
    for (unsigned i = 0, size = vals.size(); i < size; i++)
    {
      Trace("cegis-sample") << "  " << candidates[i] << " -> " << vals[i]
                            << std::endl;
    }
  }
  Assert(vals.size() == candidates.size());
  Node sbody = d_base_body.substitute(
      candidates.begin(), candidates.end(), vals.begin(), vals.end());
  Trace("cegis-sample-debug") << "Sample " << sbody << std::endl;
  // do eager unfolding
  std::map<Node, Node> visited_n;
  sbody = d_qe->getTermDatabaseSygus()->getEagerUnfold(sbody, visited_n);
  Trace("cegis-sample") << "Sample (after unfolding): " << sbody << std::endl;

  NodeManager* nm = NodeManager::currentNM();
  for (unsigned i = 0, size = d_cegis_sampler.getNumSamplePoints(); i < size;
       i++)
  {
    if (d_cegis_sample_refine.find(i) == d_cegis_sample_refine.end())
    {
      Node ev = d_cegis_sampler.evaluate(sbody, i);
      Trace("cegis-sample-debug") << "...evaluate point #" << i << " to " << ev
                                  << std::endl;
      Assert(ev.isConst());
      Assert(ev.getType().isBoolean());
      if (!ev.getConst<bool>())
      {
        Trace("cegis-sample-debug") << "...false for point #" << i << std::endl;
        // mark this as a CEGIS point (no longer sampled)
        d_cegis_sample_refine.insert(i);
        std::vector<Node> vars;
        std::vector<Node> pt;
        d_cegis_sampler.getSamplePoint(i, vars, pt);
        Assert(d_base_vars.size() == pt.size());
        Node rlem = d_base_body.substitute(
            d_base_vars.begin(), d_base_vars.end(), pt.begin(), pt.end());
        rlem = Rewriter::rewrite(rlem);
        if (std::find(
                d_refinement_lemmas.begin(), d_refinement_lemmas.end(), rlem)
            == d_refinement_lemmas.end())
        {
          if (Trace.isOn("cegis-sample"))
          {
            Trace("cegis-sample") << "   false for point #" << i << " : ";
            for (const Node& cn : pt)
            {
              Trace("cegis-sample") << cn << " ";
            }
            Trace("cegis-sample") << std::endl;
          }
          Trace("cegqi-engine") << "  *** Refine by sampling" << std::endl;
          d_refinement_lemmas.push_back(rlem);
          // if trust, we are not interested in sending out refinement lemmas
          if (options::cegisSample() != CEGIS_SAMPLE_TRUST)
          {
            Node lem = nm->mkNode(OR, d_parent->getGuard().negate(), rlem);
            lems.push_back(lem);
          }
          return true;
        }
        else
        {
          Trace("cegis-sample-debug") << "...duplicate." << std::endl;
        }
      }
    }
  }
  return false;
}

} /* CVC4::theory::quantifiers namespace */
} /* CVC4::theory namespace */
} /* CVC4 namespace */
generated by cgit on debian on lair
contact matthew@masot.net with questions or feedback