1 /* Copyright (c) 2007-2017. The SimGrid Team.
2 * All rights reserved. */
4 /* This program is free software; you can redistribute it and/or modify it
5 * under the terms of the license (GNU LGPL) which comes with this package. */
7 #ifndef SIMGRID_MC_LIVENESS_CHECKER_HPP
8 #define SIMGRID_MC_LIVENESS_CHECKER_HPP
17 #include "src/mc/checker/Checker.hpp"
18 #include "src/mc/mc_state.hpp"
19 #include <simgrid_config.h>
20 #include <xbt/automaton.h>
26 class XBT_PRIVATE Pair {
29 bool search_cycle = false;
30 std::shared_ptr<simgrid::mc::State> graph_state = nullptr; /* System state included */
31 xbt_automaton_state_t automaton_state = nullptr;
32 std::shared_ptr<const std::vector<int>> atomic_propositions;
35 bool exploration_started = false;
37 explicit Pair(unsigned long expanded_pairs);
40 Pair(Pair const&) = delete;
41 Pair& operator=(Pair const&) = delete;
44 class XBT_PRIVATE VisitedPair {
47 int other_num = 0; /* Dot output for */
48 std::shared_ptr<simgrid::mc::State> graph_state = nullptr; /* System state included */
49 xbt_automaton_state_t automaton_state;
50 std::shared_ptr<const std::vector<int>> atomic_propositions;
51 std::size_t heap_bytes_used = 0;
55 int pair_num, xbt_automaton_state_t automaton_state,
56 std::shared_ptr<const std::vector<int>> atomic_propositions,
57 std::shared_ptr<simgrid::mc::State> graph_state);
58 ~VisitedPair() = default;
61 class XBT_PRIVATE LivenessChecker : public Checker {
63 explicit LivenessChecker(Session& session);
64 ~LivenessChecker() = default;
66 RecordTrace getRecordTrace() override;
67 std::vector<std::string> getTextualTrace() override;
68 void logState() override;
70 int compare(simgrid::mc::VisitedPair* state1, simgrid::mc::VisitedPair* state2);
71 std::shared_ptr<const std::vector<int>> getPropositionValues();
72 std::shared_ptr<VisitedPair> insertAcceptancePair(simgrid::mc::Pair* pair);
73 int insertVisitedPair(std::shared_ptr<VisitedPair> visited_pair, simgrid::mc::Pair* pair);
74 void showAcceptanceCycle(std::size_t depth);
76 void removeAcceptancePair(int pair_num);
77 void purgeVisitedPairs();
79 std::shared_ptr<Pair> newPair(Pair* pair, xbt_automaton_state_t state, std::shared_ptr<const std::vector<int>> propositions);
81 // A stack of (application_state, automaton_state) pairs for DFS exploration:
82 std::list<std::shared_ptr<Pair>> explorationStack_;
83 std::list<std::shared_ptr<VisitedPair>> acceptancePairs_;
84 std::list<std::shared_ptr<VisitedPair>> visitedPairs_;
85 unsigned long visitedPairsCount_ = 0;
86 unsigned long expandedPairsCount_ = 0;
87 unsigned long expandedStatesCount_ = 0;
88 int previousPair_ = 0;
89 std::string previousRequest_;