1 /* Copyright (c) 2011-2021. The SimGrid Team. All rights reserved. */
3 /* This program is free software; you can redistribute it and/or modify it
4 * under the terms of the license (GNU LGPL) which comes with this package. */
6 #include "src/mc/checker/LivenessChecker.hpp"
7 #include "src/mc/mc_config.hpp"
8 #include "src/mc/mc_exit.hpp"
9 #include "src/mc/mc_private.hpp"
10 #include "src/mc/mc_request.hpp"
12 #include <boost/range/algorithm.hpp>
15 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(mc_liveness, mc, "Logging specific to algorithms for liveness properties verification");
17 using api = simgrid::mc::Api;
19 /********* Static functions *********/
24 VisitedPair::VisitedPair(int pair_num, xbt_automaton_state_t automaton_state,
25 std::shared_ptr<const std::vector<int>> atomic_propositions,
26 std::shared_ptr<State> graph_state)
27 : num(pair_num), automaton_state(automaton_state)
29 this->graph_state = std::move(graph_state);
30 if (this->graph_state->system_state_ == nullptr)
31 this->graph_state->system_state_ = std::make_shared<Snapshot>(pair_num);
32 this->heap_bytes_used = api::get().get_remote_heap_bytes();
33 this->actors_count = api::get().get_actors_size();
35 this->atomic_propositions = std::move(atomic_propositions);
38 static bool evaluate_label(const xbt_automaton_exp_label* l, std::vector<int> const& values)
41 case xbt_automaton_exp_label::AUT_OR:
42 return evaluate_label(l->u.or_and.left_exp, values)
43 || evaluate_label(l->u.or_and.right_exp, values);
44 case xbt_automaton_exp_label::AUT_AND:
45 return evaluate_label(l->u.or_and.left_exp, values)
46 && evaluate_label(l->u.or_and.right_exp, values);
47 case xbt_automaton_exp_label::AUT_NOT:
48 return not evaluate_label(l->u.exp_not, values);
49 case xbt_automaton_exp_label::AUT_PREDICAT:{
50 auto cursor = api::get().compare_automaton_exp_label(l);
52 return values[cursor] != 0;
53 xbt_die("Missing predicate");
56 case xbt_automaton_exp_label::AUT_ONE:
59 xbt_die("Unexpected value for automaton");
63 Pair::Pair(unsigned long expanded_pairs) : num(expanded_pairs)
66 std::shared_ptr<const std::vector<int>> LivenessChecker::get_proposition_values() const
68 auto values = api::get().automaton_propositional_symbol_evaluate();
69 return std::make_shared<const std::vector<int>>(std::move(values));
72 std::shared_ptr<VisitedPair> LivenessChecker::insert_acceptance_pair(simgrid::mc::Pair* pair)
75 std::make_shared<VisitedPair>(pair->num, pair->automaton_state, pair->atomic_propositions, pair->graph_state);
77 auto res = boost::range::equal_range(acceptance_pairs_, new_pair.get(), api::get().compare_pair());
79 if (pair->search_cycle) for (auto i = res.first; i != res.second; ++i) {
80 std::shared_ptr<simgrid::mc::VisitedPair> const& pair_test = *i;
81 if (api::get().automaton_state_compare(pair_test->automaton_state, new_pair->automaton_state) != 0 ||
82 *(pair_test->atomic_propositions) != *(new_pair->atomic_propositions) ||
83 not api::get().snapshot_equal(pair_test->graph_state->system_state_.get(), new_pair->graph_state->system_state_.get()))
85 XBT_INFO("Pair %d already reached (equal to pair %d) !", new_pair->num, pair_test->num);
86 exploration_stack_.pop_back();
87 if (dot_output != nullptr)
88 fprintf(dot_output, "\"%d\" -> \"%d\" [%s];\n", this->previous_pair_, pair_test->num,
89 this->previous_request_.c_str());
93 acceptance_pairs_.insert(res.first, new_pair);
97 void LivenessChecker::remove_acceptance_pair(int pair_num)
99 for (auto i = acceptance_pairs_.begin(); i != acceptance_pairs_.end(); ++i)
100 if ((*i)->num == pair_num) {
101 acceptance_pairs_.erase(i);
106 void LivenessChecker::replay()
108 XBT_DEBUG("**** Begin Replay ****");
110 /* Intermediate backtracking */
111 if(_sg_mc_checkpoint > 0) {
112 const Pair* pair = exploration_stack_.back().get();
113 if (pair->graph_state->system_state_) {
114 api::get().restore_state(pair->graph_state->system_state_);
119 /* Restore the initial state */
120 api::get().restore_initial_state();
122 /* Traverse the stack from the initial state and re-execute the transitions */
124 for (std::shared_ptr<Pair> const& pair : exploration_stack_) {
125 if (pair == exploration_stack_.back())
128 std::shared_ptr<State> state = pair->graph_state;
130 if (pair->exploration_started) {
131 int req_num = state->transition_.times_considered_;
132 const s_smx_simcall* saved_req = &state->executed_req_;
134 smx_simcall_t req = nullptr;
136 /* because we got a copy of the executed request, we have to fetch the
137 real one, pointed by the request field of the issuer process */
138 const smx_actor_t issuer = api::get().simcall_get_issuer(saved_req);
139 req = &issuer->simcall_;
141 /* Debug information */
142 XBT_DEBUG("Replay (depth = %d) : %s (%p)", depth, api::get().request_to_string(req, req_num).c_str(),
145 api::get().execute(state->transition_, req);
148 /* Update statistics */
149 visited_pairs_count_++;
150 api::get().mc_inc_executed_trans();
154 XBT_DEBUG("**** End Replay ****");
158 * @brief Checks whether a given pair has already been visited by the algorithm.
160 int LivenessChecker::insert_visited_pair(std::shared_ptr<VisitedPair> visited_pair, simgrid::mc::Pair* pair)
162 if (_sg_mc_max_visited_states == 0)
165 if (visited_pair == nullptr)
167 std::make_shared<VisitedPair>(pair->num, pair->automaton_state, pair->atomic_propositions, pair->graph_state);
169 auto range = boost::range::equal_range(visited_pairs_, visited_pair.get(), api::get().compare_pair());
171 for (auto i = range.first; i != range.second; ++i) {
172 const VisitedPair* pair_test = i->get();
173 if (api::get().automaton_state_compare(pair_test->automaton_state, visited_pair->automaton_state) != 0 ||
174 *(pair_test->atomic_propositions) != *(visited_pair->atomic_propositions) ||
175 not api::get().snapshot_equal(pair_test->graph_state->system_state_.get(), visited_pair->graph_state->system_state_.get()))
177 if (pair_test->other_num == -1)
178 visited_pair->other_num = pair_test->num;
180 visited_pair->other_num = pair_test->other_num;
181 if (dot_output == nullptr)
182 XBT_DEBUG("Pair %d already visited ! (equal to pair %d)", visited_pair->num, pair_test->num);
184 XBT_DEBUG("Pair %d already visited ! (equal to pair %d (pair %d in dot_output))",
185 visited_pair->num, pair_test->num, visited_pair->other_num);
186 (*i) = std::move(visited_pair);
187 return (*i)->other_num;
190 visited_pairs_.insert(range.first, std::move(visited_pair));
191 this->purge_visited_pairs();
195 void LivenessChecker::purge_visited_pairs()
197 if (_sg_mc_max_visited_states != 0 && visited_pairs_.size() > (std::size_t)_sg_mc_max_visited_states) {
198 // Remove the oldest entry with a linear search:
199 visited_pairs_.erase(
200 boost::min_element(visited_pairs_, [](std::shared_ptr<VisitedPair> const a,
201 std::shared_ptr<VisitedPair> const& b) { return a->num < b->num; }));
205 LivenessChecker::LivenessChecker(Session* session) : Checker(session) {}
207 RecordTrace LivenessChecker::get_record_trace() // override
210 for (std::shared_ptr<Pair> const& pair : exploration_stack_)
211 res.push_back(pair->graph_state->get_transition());
215 void LivenessChecker::log_state() // override
217 XBT_INFO("Expanded pairs = %lu", expanded_pairs_count_);
218 XBT_INFO("Visited pairs = %lu", visited_pairs_count_);
219 XBT_INFO("Executed transitions = %lu", api::get().mc_get_executed_trans());
222 void LivenessChecker::show_acceptance_cycle(std::size_t depth)
224 XBT_INFO("*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*");
225 XBT_INFO("| ACCEPTANCE CYCLE |");
226 XBT_INFO("*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*");
227 XBT_INFO("Counter-example that violates formula:");
228 for (auto const& s : this->get_textual_trace())
229 XBT_INFO(" %s", s.c_str());
230 api::get().dump_record_path();
231 api::get().log_state();
232 XBT_INFO("Counter-example depth: %zu", depth);
235 std::vector<std::string> LivenessChecker::get_textual_trace() // override
237 std::vector<std::string> trace;
238 for (std::shared_ptr<Pair> const& pair : exploration_stack_) {
239 int req_num = pair->graph_state->transition_.times_considered_;
240 smx_simcall_t req = &pair->graph_state->executed_req_;
241 if (req->call_ != simix::Simcall::NONE)
242 trace.push_back(api::get().request_to_string(req, req_num));
247 std::shared_ptr<Pair> LivenessChecker::create_pair(const Pair* current_pair, xbt_automaton_state_t state,
248 std::shared_ptr<const std::vector<int>> propositions)
250 ++expanded_pairs_count_;
251 ++expanded_states_count_;
252 auto next_pair = std::make_shared<Pair>(expanded_pairs_count_);
253 next_pair->automaton_state = state;
254 next_pair->graph_state = std::make_shared<State>(expanded_states_count_);
255 next_pair->atomic_propositions = std::move(propositions);
257 next_pair->depth = current_pair->depth + 1;
259 next_pair->depth = 1;
260 /* Get enabled actors and insert them in the interleave set of the next graph_state */
261 auto actors = api::get().get_actors();
262 for (auto& actor : actors)
263 if (api::get().actor_is_enabled(actor.copy.get_buffer()->get_pid()))
264 next_pair->graph_state->mark_todo(actor.copy.get_buffer());
265 next_pair->requests = next_pair->graph_state->count_todo();
266 /* FIXME : get search_cycle value for each accepting state */
267 if (next_pair->automaton_state->type == 1 || (current_pair && current_pair->search_cycle))
268 next_pair->search_cycle = true;
270 next_pair->search_cycle = false;
274 void LivenessChecker::backtrack()
276 /* Traverse the stack backwards until a pair with a non empty interleave
277 set is found, deleting all the pairs that have it empty in the way. */
278 while (not exploration_stack_.empty()) {
279 std::shared_ptr<simgrid::mc::Pair> current_pair = exploration_stack_.back();
280 exploration_stack_.pop_back();
281 if (current_pair->requests > 0) {
282 /* We found a backtracking point */
283 XBT_DEBUG("Backtracking to depth %d", current_pair->depth);
284 exploration_stack_.push_back(std::move(current_pair));
286 XBT_DEBUG("Backtracking done");
289 XBT_DEBUG("Delete pair %d at depth %d", current_pair->num, current_pair->depth);
290 if (current_pair->automaton_state->type == 1)
291 this->remove_acceptance_pair(current_pair->num);
296 void LivenessChecker::run()
298 XBT_INFO("Check the liveness property %s", _sg_mc_property_file.get().c_str());
299 api::get().automaton_load(_sg_mc_property_file.get().c_str());
301 XBT_DEBUG("Starting the liveness algorithm");
302 api::get().session_initialize();
305 this->previous_pair_ = 0;
307 std::shared_ptr<const std::vector<int>> propos = this->get_proposition_values();
309 // For each initial state of the property automaton, push a
310 // (application_state, automaton_state) pair to the exploration stack:
311 auto automaton_stack = api::get().get_automaton_state();
312 for (auto* automaton_state : automaton_stack) {
313 if (automaton_state->type == -1)
314 exploration_stack_.push_back(this->create_pair(nullptr, automaton_state, propos));
317 /* Actually run the double DFS search for counter-examples */
318 while (not exploration_stack_.empty()) {
319 std::shared_ptr<Pair> current_pair = exploration_stack_.back();
321 /* Update current state in buchi automaton */
322 api::get().set_property_automaton(current_pair->automaton_state);
325 "********************* ( Depth = %d, search_cycle = %d, interleave size = %zu, pair_num = %d, requests = %d)",
326 current_pair->depth, current_pair->search_cycle, current_pair->graph_state->count_todo(), current_pair->num,
327 current_pair->requests);
329 if (current_pair->requests == 0) {
334 std::shared_ptr<VisitedPair> reached_pair;
335 if (current_pair->automaton_state->type == 1 && not current_pair->exploration_started) {
336 reached_pair = this->insert_acceptance_pair(current_pair.get());
337 if (reached_pair == nullptr) {
338 this->show_acceptance_cycle(current_pair->depth);
339 throw LivenessError();
343 /* Pair already visited ? stop the exploration on the current path */
344 if (not current_pair->exploration_started) {
345 int visited_num = this->insert_visited_pair(reached_pair, current_pair.get());
346 if (visited_num != -1) {
347 if (dot_output != nullptr) {
348 fprintf(dot_output, "\"%d\" -> \"%d\" [%s];\n", this->previous_pair_, visited_num,
349 this->previous_request_.c_str());
352 XBT_DEBUG("Pair already visited (equal to pair %d), exploration on the current path stopped.", visited_num);
353 current_pair->requests = 0;
359 smx_simcall_t req = api::get().mc_state_choose_request(current_pair->graph_state.get());
360 int req_num = current_pair->graph_state->transition_.times_considered_;
362 if (dot_output != nullptr) {
363 if (this->previous_pair_ != 0 && this->previous_pair_ != current_pair->num) {
364 fprintf(dot_output, "\"%d\" -> \"%d\" [%s];\n", this->previous_pair_, current_pair->num,
365 this->previous_request_.c_str());
366 this->previous_request_.clear();
368 this->previous_pair_ = current_pair->num;
369 this->previous_request_ = api::get().request_get_dot_output(req, req_num);
370 if (current_pair->search_cycle)
371 fprintf(dot_output, "%d [shape=doublecircle];\n", current_pair->num);
375 XBT_DEBUG("Execute: %s", api::get().request_to_string(req, req_num).c_str());
378 api::get().mc_inc_executed_trans();
380 if (not current_pair->exploration_started)
381 visited_pairs_count_++;
383 /* Answer the request */
384 api::get().handle_simcall(current_pair->graph_state->transition_);
386 /* Wait for requests (schedules processes) */
387 api::get().mc_wait_for_requests();
389 current_pair->requests--;
390 current_pair->exploration_started = true;
392 /* Get values of atomic propositions (variables used in the property formula) */
393 std::shared_ptr<const std::vector<int>> prop_values = this->get_proposition_values();
395 // For each enabled transition in the property automaton, push a
396 // (application_state, automaton_state) pair to the exploration stack:
397 for (int i = api::get().get_dynar_length(current_pair->automaton_state->out) - 1; i >= 0; i--) {
398 auto transition_succ_label = api::get().get_automaton_transition_label(current_pair->automaton_state->out, i);
399 auto transition_succ_dst = api::get().get_automaton_transition_dst(current_pair->automaton_state->out, i);
400 if (evaluate_label(transition_succ_label, *prop_values))
401 exploration_stack_.push_back(this->create_pair(current_pair.get(), transition_succ_dst, prop_values));
405 XBT_INFO("No property violation found.");
406 api::get().log_state();
409 Checker* createLivenessChecker(Session* session)
411 return new LivenessChecker(session);
415 } // namespace simgrid