postproc.cc 16.5 KB
Newer Older
1
// -*- coding: utf-8 -*-
2 3
// Copyright (C) 2012-2017 Laboratoire de Recherche et Développement
// de l'Epita (LRDE).
4 5 6 7 8
//
// This file is part of Spot, a model checking library.
//
// Spot is free software; you can redistribute it and/or modify it
// under the terms of the GNU General Public License as published by
9
// the Free Software Foundation; either version 3 of the License, or
10 11 12 13 14 15 16 17
// (at your option) any later version.
//
// Spot is distributed in the hope that it will be useful, but WITHOUT
// ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
// or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public
// License for more details.
//
// You should have received a copy of the GNU General Public License
18
// along with this program.  If not, see <http://www.gnu.org/licenses/>.
19

20 21 22 23 24 25
#include <spot/twaalgos/postproc.hh>
#include <spot/twaalgos/minimize.hh>
#include <spot/twaalgos/simulation.hh>
#include <spot/twaalgos/sccfilter.hh>
#include <spot/twaalgos/degen.hh>
#include <spot/twaalgos/stripacc.hh>
26
#include <cstdlib>
27 28 29 30 31 32 33 34 35
#include <spot/misc/optionmap.hh>
#include <spot/twaalgos/powerset.hh>
#include <spot/twaalgos/isdet.hh>
#include <spot/twaalgos/dtbasat.hh>
#include <spot/twaalgos/dtwasat.hh>
#include <spot/twaalgos/complete.hh>
#include <spot/twaalgos/totgba.hh>
#include <spot/twaalgos/sbacc.hh>
#include <spot/twaalgos/sepsets.hh>
36
#include <spot/twaalgos/determinize.hh>
37
#include <spot/twaalgos/alternation.hh>
38 39 40

namespace spot
{
41 42
  namespace
  {
43 44
    static twa_graph_ptr
    ensure_ba(twa_graph_ptr& a)
45
    {
46
      if (a->num_sets() == 0)
47 48 49 50 51
        {
          auto m = a->set_buchi();
          for (auto& t: a->edges())
            t.acc = m;
        }
52 53 54
      return a;
    }
  }
55

56 57 58 59
  postprocessor::postprocessor(const option_map* opt)
  {
    if (opt)
      {
60 61 62 63 64
        degen_order_ = opt->get("degen-order", 0);
        degen_reset_ = opt->get("degen-reset", 1);
        degen_cache_ = opt->get("degen-lcache", 1);
        degen_lskip_ = opt->get("degen-lskip", 1);
        degen_lowinit_ = opt->get("degen-lowinit", 0);
65
        degen_remscc_ = opt->get("degen-remscc", 1);
66 67 68 69 70 71 72 73
        det_scc_ = opt->get("det-scc", 1);
        det_simul_ = opt->get("det-simul", 1);
        det_stutter_ = opt->get("det-stutter", 1);
        simul_ = opt->get("simul", -1);
        scc_filter_ = opt->get("scc-filter", -1);
        ba_simul_ = opt->get("ba-simul", -1);
        tba_determinisation_ = opt->get("tba-det", 0);
        sat_minimize_ = opt->get("sat-minimize", 0);
74 75
        sat_incr_steps_ = opt->get("sat-incr-steps", -2); // -2 or any num < -1
        sat_langmap_ = opt->get("sat-langmap", 0);
76 77 78 79 80 81
        sat_acc_ = opt->get("sat-acc", 0);
        sat_states_ = opt->get("sat-states", 0);
        state_based_ = opt->get("state-based", 0);
        wdba_minimize_ = opt->get("wdba-minimize", 1);

        if (sat_acc_ && sat_minimize_ == 0)
82
          sat_minimize_ = 1;        // Dicho.
83 84 85 86 87 88 89 90 91 92
        if (sat_states_ && sat_minimize_ == 0)
          sat_minimize_ = 1;
        if (sat_minimize_)
          {
            tba_determinisation_ = 1;
            if (sat_acc_ <= 0)
              sat_acc_ = -1;
            if (sat_states_ <= 0)
              sat_states_ = -1;
          }
93 94 95 96 97 98

        // Set default param value if not provided and used.
        if (sat_minimize_ == 2 && sat_incr_steps_ < 0) // Assume algorithm.
            sat_incr_steps_ = 6;
        else if (sat_minimize_ == 3 && sat_incr_steps_ < -1) // Incr algorithm.
            sat_incr_steps_ = 2;
99 100 101
      }
  }

102 103
  twa_graph_ptr
  postprocessor::do_simul(const twa_graph_ptr& a, int opt)
104
  {
105 106
    if (!has_separate_sets(a))
      return a;
107
    switch (opt)
108 109
      {
      case 0:
110
        return a;
111
      case 1:
112
        return simulation(a);
113
      case 2:
114
        return cosimulation(a);
115 116
      case 3:
      default:
117
        return iterated_simulations(a);
118 119 120
      }
  }

121
  twa_graph_ptr
122
  postprocessor::do_sba_simul(const twa_graph_ptr& a, int opt)
123
  {
124 125
    if (ba_simul_ <= 0)
      return a;
126 127 128
    switch (opt)
      {
      case 0:
129
        return a;
130
      case 1:
131
        return simulation_sba(a);
132
      case 2:
133
        return cosimulation_sba(a);
134 135
      case 3:
      default:
136
        return iterated_simulations_sba(a);
137 138 139
      }
  }

140 141
  twa_graph_ptr
  postprocessor::do_degen(const twa_graph_ptr& a)
142
  {
143
    auto d = degeneralize(a,
144 145
                          degen_reset_, degen_order_,
                          degen_cache_, degen_lskip_,
146
                          degen_lowinit_, degen_remscc_);
147
    return do_sba_simul(d, ba_simul_);
148 149
  }

150 151 152 153 154
  twa_graph_ptr
  postprocessor::do_scc_filter(const twa_graph_ptr& a, bool arg)
  {
    if (scc_filter_ == 0)
      return a;
155
    // If the automaton is weak, using transition-based acceptance
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
156
    // won't help, so let's preserve state-based acceptance.
157
    if ((state_based_ || a->prop_inherently_weak().is_true())
158
        && a->prop_state_acc().is_true())
159
      return scc_filter_states(a, arg);
160 161 162 163 164 165 166 167 168 169
    else
      return scc_filter(a, arg);
  }

  twa_graph_ptr
  postprocessor::do_scc_filter(const twa_graph_ptr& a)
  {
    return do_scc_filter(a, scc_filter_ > 1);
  }

170 171
#define PREF_ (pref_ & (Small | Deterministic))
#define COMP_ (pref_ & Complete)
172
#define SBACC_ (pref_ & SBAcc)
173

174
  twa_graph_ptr
Alexandre Duret-Lutz's avatar
Alexandre Duret-Lutz committed
175
  postprocessor::run(twa_graph_ptr a, formula f)
176
  {
177 178 179 180 181 182 183 184 185
    if (simul_ < 0)
      simul_ = (level_ == Low) ? 1 : 3;
    if (ba_simul_ < 0)
      ba_simul_ = (level_ == High) ? 3 : 0;
    if (scc_filter_ < 0)
      scc_filter_ = 1;
    if (type_ == BA || SBACC_)
      state_based_ = true;

186
    if (!a->is_existential() &&
187 188 189 190 191 192 193
        // We will probably have to revisit this condition later.
        // Currently, the intent is that postprocessor should never
        // return an alternating automaton, unless it is called with
        // its laxest settings.
        !(type_ == Generic && PREF_ == Any && level_ == Low))
      a = remove_alternation(a);

194
    if (type_ != Generic && !a->acc().is_generalized_buchi())
195
      {
196 197 198
        a = to_generalized_buchi(a);
        if (PREF_ == Any && level_ == Low)
          a = do_scc_filter(a, true);
199
      }
200

201
    if (PREF_ == Any && level_ == Low
202 203 204 205
        && (type_ == Generic
            || type_ == TGBA
            || (type_ == BA && a->is_sba())
            || (type_ == Monitor && a->num_sets() == 0)))
206
      {
207 208 209 210 211
        if (COMP_)
          a = complete(a);
        if (SBACC_)
          a = sbacc(a);
        return a;
212
      }
213

214
    int original_acc = a->num_sets();
215

216
    // Remove useless SCCs.
217
    if (type_ == Monitor)
218 219 220
      // Do not bother about acceptance conditions, they will be
      // ignored.
      a = scc_filter_states(a);
221
    else
222
      a = do_scc_filter(a, (PREF_ == Any));
223

224 225
    if (type_ == Monitor)
      {
226 227 228 229 230
        if (PREF_ == Deterministic)
          a = minimize_monitor(a);
        else
          strip_acceptance_here(a);

231
        if (PREF_ != Any)
232
          {
233 234 235 236 237
            if (PREF_ != Deterministic)
              a = do_simul(a, simul_);

            // For Small,High we return the smallest between the output of
            // the simulation, and that of the deterministic minimization.
238
            // Prefer the deterministic automaton in case of equality.
239 240 241
            if (PREF_ == Small && level_ == High && simul_)
              {
                auto m = minimize_monitor(a);
242
                if (m->num_states() <= a->num_states())
243 244 245
                  a = m;
              }
            a->remove_unused_ap();
246 247 248 249
          }
        if (COMP_)
          a = complete(a);
        return a;
250 251
      }

252
    if (PREF_ == Any)
253
      {
254 255 256 257 258 259 260
        if (type_ == BA)
          a = do_degen(a);
        if (COMP_)
          a = complete(a);
        if (SBACC_)
          a = sbacc(a);
        return a;
261 262
      }

263
    bool dba_is_wdba = false;
264
    bool dba_is_minimal = false;
265 266
    twa_graph_ptr dba = nullptr;
    twa_graph_ptr sim = nullptr;
267 268 269

    // (Small,Low) is the only configuration where we do not run
    // WDBA-minimization.
270
    if ((PREF_ != Small || level_ != Low) && wdba_minimize_)
271
      {
272 273 274 275
        bool reject_bigger = (PREF_ == Small) && (level_ == Medium);
        dba = minimize_obligation(a, f, nullptr, reject_bigger);
        if (dba
            && dba->prop_inherently_weak().is_true()
276
            && dba->prop_universal().is_true())
277 278 279 280 281 282 283 284 285 286 287 288
          {
            // The WDBA is a BA, so no degeneralization is required.
            // We just need to add an acceptance set if there is none.
            dba_is_minimal = dba_is_wdba = true;
            if (type_ == BA)
              ensure_ba(dba);
          }
        else
          {
            // Minimization failed.
            dba = nullptr;
          }
289 290 291 292
      }

    // Run a simulation when wdba failed (or was not run), or
    // at hard levels if we want a small output.
293
    if (!dba || (level_ == High && PREF_ == Small))
294
      {
295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310
        if (((SBACC_ && a->prop_state_acc().is_true())
             || (type_ == BA && a->is_sba()))
            && !tba_determinisation_)
          {
            sim = do_sba_simul(a, ba_simul_);
          }
        else
          {
            sim = do_simul(a, simul_);
            // Degeneralize the result of the simulation if needed.
            // No need to do that if tba_determinisation_ will be used.
            if (type_ == BA && !tba_determinisation_)
              sim = do_degen(sim);
            else if (SBACC_ && !tba_determinisation_)
              sim = sbacc(sim);
          }
311 312
      }

313 314 315 316
    // If WDBA failed, but the simulation returned a deterministic
    // automaton, use it as dba.
    assert(dba || sim);
    if (!dba && is_deterministic(sim))
317
      {
318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334
        std::swap(sim, dba);
        // We postponed degeneralization above i case we would need
        // to perform TBA-determinisation, but now it is clear
        // that we won't perform it.  So do degeneralize.
        if (tba_determinisation_)
          {
            if (type_ == BA)
              {
                dba = do_degen(dba);
                assert(is_deterministic(dba));
              }
            else if (SBACC_)
              {
                dba = sbacc(dba);
                assert(is_deterministic(dba));
              }
          }
335
      }
336 337 338

    // If we don't have a DBA, attempt tba-determinization if requested.
    if (tba_determinisation_ && !dba)
339
      {
340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382
        twa_graph_ptr tmpd = nullptr;
        if (PREF_ == Deterministic
            && f
            && f.is_syntactic_recurrence()
            && sim->num_sets() > 1)
          tmpd = degeneralize_tba(sim);

        auto in = tmpd ? tmpd : sim;

        // These thresholds are arbitrary.
        //
        // For producing Small automata, we assume that a
        // deterministic automaton that is twice the size of the
        // original will never get reduced to a smaller one.  We also
        // do not want more than 2^13 cycles in an SCC.
        //
        // For Deterministic automata, we accept automata that
        // are 8 times bigger, with no more that 2^15 cycle per SCC.
        // The cycle threshold is the most important limit here.  You
        // may up it if you want to try producing larger automata.
        auto tmp =
          tba_determinize_check(in,
                                (PREF_ == Small) ? 2 : 8,
                                1 << ((PREF_ == Small) ? 13 : 15),
                                f);
        if (tmp && tmp != in)
          {
            // There is no point in running the reverse simulation on
            // a deterministic automaton, since all prefixes are
            // unique.
            dba = simulation(tmp);
          }
        if (dba && PREF_ == Deterministic)
          {
            // disregard the result of the simulation.
            sim = nullptr;
          }
        else
          {
            // degeneralize sim, because we did not do it earlier
            if (type_ == BA)
              sim = do_degen(sim);
          }
383 384
      }

385 386
    if (PREF_ == Deterministic && type_ == Generic && !dba)
      {
387 388 389 390 391
        dba = tgba_determinize(to_generalized_buchi(sim),
                               false, det_scc_, det_simul_, det_stutter_);
        if (level_ != Low)
          dba = simulation(dba);
        sim = nullptr;
392 393
      }

394 395 396
    // Now dba contains either the result of WDBA-minimization (in
    // that case dba_is_wdba=true), or some deterministic automaton
    // that is either the result of the simulation or of the
397 398 399 400
    // TBA-determinization (dba_is_wdba=false in both cases), or a
    // parity automaton coming from tgba_determinize().  If the dba is
    // a WDBA, we do not have to run SAT-minimization.  A negative
    // value in sat_minimize_ can force its use for debugging.
401
    if (sat_minimize_ && dba && (!dba_is_wdba || sat_minimize_ < 0))
402
      {
403 404
        if (type_ == Generic)
          throw std::runtime_error
405
            ("postproc() not yet updated to mix sat-minimize and Generic");
406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438
        unsigned target_acc;
        if (type_ == BA)
          target_acc = 1;
        else if (sat_acc_ != -1)
          target_acc = sat_acc_;
        else
          // Take the number of acceptance conditions from the input
          // automaton, not from dba, because dba often has been
          // degeneralized by tba_determinize_check().  Make sure it
          // is at least 1.
          target_acc = original_acc > 0 ? original_acc : 1;

        const_twa_graph_ptr in = nullptr;
        if (target_acc == 1)
          {
            // If we are seeking a minimal DBA with unknown number of
            // states, then we should start from the degeneralized,
            // because the input TBA might be smaller.
            if (state_based_)
              in = degeneralize(dba);
            else
              in = degeneralize_tba(dba);
          }
        else
          {
            in = dba;
          }

        twa_graph_ptr res = complete(in);
        if (target_acc == 1)
          {
            if (sat_states_ != -1)
              res = dtba_sat_synthetize(res, sat_states_, state_based_);
439
            else if (sat_minimize_ == 1)
440
              res = dtba_sat_minimize_dichotomy
441 442 443 444
                (res, state_based_, sat_langmap_);
            else if (sat_minimize_ == 2)
              res = dtba_sat_minimize_assume(res, state_based_, -1,
                                             sat_incr_steps_);
445
            else if (sat_minimize_ == 3)
446 447 448 449
              res = dtba_sat_minimize_incr(res, state_based_, -1,
                                           sat_incr_steps_);
            else // if (sat_minimize == 4 || sat_minimize == -1)
              res = dtba_sat_minimize(res, state_based_);
450 451 452 453 454 455 456 457
          }
        else
          {
            if (sat_states_ != -1)
              res = dtwa_sat_synthetize
                (res, target_acc,
                 acc_cond::acc_code::generalized_buchi(target_acc),
                 sat_states_, state_based_);
458 459
            else if (sat_minimize_ == 1)
              res = dtwa_sat_minimize_dichotomy
460 461
                (res, target_acc,
                 acc_cond::acc_code::generalized_buchi(target_acc),
462
                 state_based_, sat_langmap_);
463
            else if (sat_minimize_ == 2)
464
              res = dtwa_sat_minimize_assume
465 466
                (res, target_acc,
                 acc_cond::acc_code::generalized_buchi(target_acc),
467
                 state_based_, -1, false, sat_incr_steps_);
468
            else if (sat_minimize_ == 3)
469 470 471
              res = dtwa_sat_minimize_incr
                (res, target_acc,
                 acc_cond::acc_code::generalized_buchi(target_acc),
472 473 474
                 state_based_, -1, false, sat_incr_steps_);
            else // if (sat_minimize_ == 4 || sat_minimize_ == -1)
              res = dtwa_sat_minimize
475 476
                (res, target_acc,
                 acc_cond::acc_code::generalized_buchi(target_acc),
477
                 state_based_);
478
          }
479 480 481 482 483 484

        if (res)
          {
            dba = do_scc_filter(res, true);
            dba_is_minimal = true;
          }
485 486
      }

487 488 489
    // Degeneralize the dba resulting from tba-determinization or
    // sat-minimization (which is a TBA) if requested and needed.
    if (dba && !dba_is_wdba && type_ == BA
490
        && !(dba_is_minimal && state_based_ && dba->num_sets() == 1))
491
      dba = degeneralize(dba);
492 493 494

    if (dba && sim)
      {
495 496 497 498
        if (dba->num_states() > sim->num_states())
          dba = nullptr;
        else
          sim = nullptr;
499 500
      }

501
    if (level_ == High && scc_filter_ != 0)
502
      {
503 504 505 506 507 508 509 510 511 512 513 514
        if (dba)
          {
            // Do that even for WDBA, to remove marks from transitions
            // leaving trivial SCCs.
            dba = do_scc_filter(dba, true);
            assert(!sim);
          }
        else if (sim)
          {
            sim = do_scc_filter(sim, true);
            assert(!dba);
          }
515
      }
516 517 518

    sim = dba ? dba : sim;

519 520
    sim->remove_unused_ap();

521
    if (COMP_)
522
      sim = complete(sim);
523 524
    if (SBACC_)
      sim = sbacc(sim);
525

526
    return sim;
527 528
  }
}