XBT_LOG_NEW_DEFAULT_SUBCATEGORY(mc_liveness, mc,
"Logging specific to algorithms for liveness properties verification");
-/********* Global variables *********/
-
/********* Static functions *********/
namespace simgrid {
namespace mc {
-std::list<std::shared_ptr<VisitedPair>> LivenessChecker::acceptance_pairs;
-std::list<Pair*> LivenessChecker::liveness_stack;
-std::list<std::shared_ptr<VisitedPair>> LivenessChecker::visited_pairs;
-
-VisitedPair::VisitedPair(int pair_num, xbt_automaton_state_t automaton_state, xbt_dynar_t atomic_propositions, std::shared_ptr<simgrid::mc::State> graph_state)
+VisitedPair::VisitedPair(
+ int pair_num, xbt_automaton_state_t automaton_state,
+ std::vector<int> const& atomic_propositions, std::shared_ptr<simgrid::mc::State> graph_state)
{
simgrid::mc::Process* process = &(mc_model_checker->process());
this->num = pair_num;
this->other_num = -1;
this->acceptance_pair = 0;
- this->atomic_propositions = simgrid::xbt::unique_ptr<s_xbt_dynar_t>(
- xbt_dynar_new(sizeof(int), nullptr));
-
- unsigned int cursor = 0;
- int value;
- xbt_dynar_foreach(atomic_propositions, cursor, value)
- xbt_dynar_push_as(this->atomic_propositions.get(), int, value);
+ this->atomic_propositions = atomic_propositions;
}
VisitedPair::~VisitedPair()
{
}
-static int MC_automaton_evaluate_label(xbt_automaton_exp_label_t l,
- xbt_dynar_t atomic_propositions_values)
+static int MC_automaton_evaluate_label(
+ xbt_automaton_exp_label_t l,
+ std::vector<int> const& atomic_propositions_values)
{
switch (l->type) {
- case 0:{
- int left_res = MC_automaton_evaluate_label(l->u.or_and.left_exp, atomic_propositions_values);
- int right_res = MC_automaton_evaluate_label(l->u.or_and.right_exp, atomic_propositions_values);
+ case xbt_automaton_exp_label::AUT_OR:{
+ int left_res = MC_automaton_evaluate_label(
+ l->u.or_and.left_exp, atomic_propositions_values);
+ int right_res = MC_automaton_evaluate_label(
+ l->u.or_and.right_exp, atomic_propositions_values);
return (left_res || right_res);
}
- case 1:{
- int left_res = MC_automaton_evaluate_label(l->u.or_and.left_exp, atomic_propositions_values);
- int right_res = MC_automaton_evaluate_label(l->u.or_and.right_exp, atomic_propositions_values);
+ case xbt_automaton_exp_label::AUT_AND:{
+ int left_res = MC_automaton_evaluate_label(
+ l->u.or_and.left_exp, atomic_propositions_values);
+ int right_res = MC_automaton_evaluate_label(
+ l->u.or_and.right_exp, atomic_propositions_values);
return (left_res && right_res);
}
- case 2:{
- int res = MC_automaton_evaluate_label(l->u.exp_not, atomic_propositions_values);
+ case xbt_automaton_exp_label::AUT_NOT:{
+ int res = MC_automaton_evaluate_label(
+ l->u.exp_not, atomic_propositions_values);
return (!res);
}
- case 3:{
+ case xbt_automaton_exp_label::AUT_PREDICAT:{
unsigned int cursor = 0;
xbt_automaton_propositional_symbol_t p = nullptr;
xbt_dynar_foreach(simgrid::mc::property_automaton->propositional_symbols, cursor, p) {
if (std::strcmp(xbt_automaton_propositional_symbol_get_name(p), l->u.predicat) == 0)
- return (int) xbt_dynar_get_as(atomic_propositions_values, cursor, int);
+ return atomic_propositions_values[cursor];
}
return -1;
}
- case 4:
+ case xbt_automaton_exp_label::AUT_ONE:
return 2;
default:
return -1;
Pair::~Pair() {}
-simgrid::xbt::unique_ptr<s_xbt_dynar_t> LivenessChecker::getPropositionValues()
+std::vector<int> LivenessChecker::getPropositionValues()
{
+ std::vector<int> values;
unsigned int cursor = 0;
xbt_automaton_propositional_symbol_t ps = nullptr;
- simgrid::xbt::unique_ptr<s_xbt_dynar_t> values = simgrid::xbt::unique_ptr<s_xbt_dynar_t>(xbt_dynar_new(sizeof(int), nullptr));
- xbt_dynar_foreach(simgrid::mc::property_automaton->propositional_symbols, cursor, ps) {
- int res = xbt_automaton_propositional_symbol_evaluate(ps);
- xbt_dynar_push_as(values.get(), int, res);
- }
+ xbt_dynar_foreach(simgrid::mc::property_automaton->propositional_symbols, cursor, ps)
+ values.push_back(xbt_automaton_propositional_symbol_evaluate(ps));
return values;
}
std::shared_ptr<VisitedPair> LivenessChecker::insertAcceptancePair(simgrid::mc::Pair* pair)
{
std::shared_ptr<VisitedPair> new_pair = std::make_shared<VisitedPair>(
- pair->num, pair->automaton_state, pair->atomic_propositions.get(),
+ pair->num, pair->automaton_state, pair->atomic_propositions,
pair->graph_state);
new_pair->acceptance_pair = 1;
- auto res = std::equal_range(acceptance_pairs.begin(), acceptance_pairs.end(),
+ auto res = std::equal_range(acceptancePairs_.begin(), acceptancePairs_.end(),
new_pair.get(), simgrid::mc::DerefAndCompareByNbProcessesAndUsedHeap());
if (pair->search_cycle == 1)
for (auto i = res.first; i != res.second; ++i) {
std::shared_ptr<simgrid::mc::VisitedPair> const& pair_test = *i;
if (xbt_automaton_state_compare(pair_test->automaton_state, new_pair->automaton_state) == 0) {
- if (xbt_automaton_propositional_symbols_compare_value(
- pair_test->atomic_propositions.get(),
- new_pair->atomic_propositions.get()) == 0) {
+ if (pair_test->atomic_propositions == new_pair->atomic_propositions) {
if (this->compare(pair_test.get(), new_pair.get()) == 0) {
XBT_INFO("Pair %d already reached (equal to pair %d) !", new_pair->num, pair_test->num);
- liveness_stack.pop_back();
+ livenessStack_.pop_back();
if (dot_output != nullptr)
fprintf(dot_output, "\"%d\" -> \"%d\" [%s];\n", initial_global_state->prev_pair, pair_test->num, initial_global_state->prev_req);
return nullptr;
}
}
- acceptance_pairs.insert(res.first, new_pair);
+ acceptancePairs_.insert(res.first, new_pair);
return new_pair;
}
void LivenessChecker::removeAcceptancePair(int pair_num)
{
- for (auto i = acceptance_pairs.begin(); i != acceptance_pairs.end(); ++i)
+ for (auto i = acceptancePairs_.begin(); i != acceptancePairs_.end(); ++i)
if ((*i)->num == pair_num) {
- acceptance_pairs.erase(i);
+ acceptancePairs_.erase(i);
break;
}
}
simgrid::mc::Pair* initial_pair = nullptr;
mc_model_checker->wait_for_requests();
- acceptance_pairs.clear();
- visited_pairs.clear();
-
initial_global_state->snapshot = simgrid::mc::take_snapshot(0);
initial_global_state->prev_pair = 0;
initial_pair->requests = MC_state_interleave_size(initial_pair->graph_state.get());
initial_pair->search_cycle = 0;
- liveness_stack.push_back(initial_pair);
+ livenessStack_.push_back(initial_pair);
}
}
}
/* Intermediate backtracking */
if(_sg_mc_checkpoint > 0) {
- simgrid::mc::Pair* pair = liveness_stack.back();
+ simgrid::mc::Pair* pair = livenessStack_.back();
if(pair->graph_state->system_state){
simgrid::mc::restore_snapshot(pair->graph_state->system_state);
return;
simgrid::mc::restore_snapshot(initial_global_state->snapshot);
/* Traverse the stack from the initial state and re-execute the transitions */
- for (simgrid::mc::Pair* pair : liveness_stack) {
- if (pair == liveness_stack.back())
+ for (simgrid::mc::Pair* pair : livenessStack_) {
+ if (pair == livenessStack_.back())
break;
std::shared_ptr<State> state = pair->graph_state;
if (visited_pair == nullptr)
visited_pair = std::make_shared<VisitedPair>(
- pair->num, pair->automaton_state, pair->atomic_propositions.get(),
+ pair->num, pair->automaton_state, pair->atomic_propositions,
pair->graph_state);
- auto range = std::equal_range(visited_pairs.begin(), visited_pairs.end(),
+ auto range = std::equal_range(visitedPairs_.begin(), visitedPairs_.end(),
visited_pair.get(), simgrid::mc::DerefAndCompareByNbProcessesAndUsedHeap());
for (auto i = range.first; i != range.second; ++i) {
VisitedPair* pair_test = i->get();
if (xbt_automaton_state_compare(pair_test->automaton_state, visited_pair->automaton_state) == 0) {
- if (xbt_automaton_propositional_symbols_compare_value(
- pair_test->atomic_propositions.get(),
- visited_pair->atomic_propositions.get()) == 0) {
+ if (pair_test->atomic_propositions == visited_pair->atomic_propositions) {
if (this->compare(pair_test, visited_pair.get()) == 0) {
if (pair_test->other_num == -1)
visited_pair->other_num = pair_test->num;
}
}
- visited_pairs.insert(range.first, std::move(visited_pair));
+ visitedPairs_.insert(range.first, std::move(visited_pair));
- if (visited_pairs.size() > (std::size_t) _sg_mc_visited) {
+ if (visitedPairs_.size() > (std::size_t) _sg_mc_visited) {
int min2 = mc_stats->expanded_pairs;
std::list<std::shared_ptr<VisitedPair>>::iterator index2;
- for (auto i = visited_pairs.begin(); i != visited_pairs.end(); ++i) {
+ for (auto i = visitedPairs_.begin(); i != visitedPairs_.end(); ++i) {
if ((*i)->num < min2) {
index2 = i;
min2 = (*i)->num;
}
}
- visited_pairs.erase(index2);
+ visitedPairs_.erase(index2);
}
return -1;
RecordTrace LivenessChecker::getRecordTrace() // override
{
RecordTrace res;
- for (simgrid::mc::Pair* pair : liveness_stack) {
+ for (simgrid::mc::Pair* pair : livenessStack_) {
int value;
smx_simcall_t req = MC_state_get_executed_request(pair->graph_state.get(), &value);
if (req && req->call != SIMCALL_NONE) {
std::vector<std::string> LivenessChecker::getTextualTrace() // override
{
std::vector<std::string> trace;
- for (simgrid::mc::Pair* pair : liveness_stack) {
+ for (simgrid::mc::Pair* pair : livenessStack_) {
int value;
smx_simcall_t req = MC_state_get_executed_request(pair->graph_state.get(), &value);
if (req && req->call != SIMCALL_NONE) {
smx_simcall_t req = nullptr;
xbt_automaton_transition_t transition_succ = nullptr;
int cursor = 0;
- simgrid::xbt::unique_ptr<s_xbt_dynar_t> prop_values;
std::shared_ptr<VisitedPair> reached_pair = nullptr;
- while (!liveness_stack.empty()){
+ while (!livenessStack_.empty()){
/* Get current pair */
- current_pair = liveness_stack.back();
+ current_pair = livenessStack_.back();
/* Update current state in buchi automaton */
simgrid::mc::property_automaton->current_state = current_pair->automaton_state;
current_pair->exploration_started = 1;
/* Get values of atomic propositions (variables used in the property formula) */
- prop_values = this->getPropositionValues();
+ std::vector<int> prop_values = this->getPropositionValues();
/* Evaluate enabled/true transitions in automaton according to atomic propositions values and create new pairs */
cursor = xbt_dynar_length(current_pair->automaton_state->out) - 1;
while (cursor >= 0) {
transition_succ = (xbt_automaton_transition_t)xbt_dynar_get_as(current_pair->automaton_state->out, cursor, xbt_automaton_transition_t);
- res = MC_automaton_evaluate_label(transition_succ->label, prop_values.get());
+ res = MC_automaton_evaluate_label(transition_succ->label, prop_values);
if (res == 1 || res == 2) { /* 1 = True transition (always enabled), 2 = enabled transition according to atomic prop values */
Pair* next_pair = new Pair();
next_pair->graph_state = std::shared_ptr<simgrid::mc::State>(MC_state_new());
next_pair->search_cycle = 1;
/* Add new pair to the exploration stack */
- liveness_stack.push_back(next_pair);
+ livenessStack_.push_back(next_pair);
}
cursor--;
if(visited_num == -1)
XBT_DEBUG("No more request to execute. Looking for backtracking point.");
- prop_values.reset();
-
/* Traverse the stack backwards until a pair with a non empty interleave
set is found, deleting all the pairs that have it empty in the way. */
- while (!liveness_stack.empty()) {
- current_pair = liveness_stack.back();
- liveness_stack.pop_back();
+ while (!livenessStack_.empty()) {
+ current_pair = livenessStack_.back();
+ livenessStack_.pop_back();
if (current_pair->requests > 0) {
/* We found a backtracking point */
XBT_DEBUG("Backtracking to depth %d", current_pair->depth);
- liveness_stack.push_back(current_pair);
+ livenessStack_.push_back(current_pair);
this->replay();
XBT_DEBUG("Backtracking done");
break;
mc_model_checker->wait_for_requests();
XBT_DEBUG("Starting the liveness algorithm");
- _sg_mc_liveness = 1;
- /* Create exploration stack */
- liveness_stack.clear();
/* Create the initial state */
simgrid::mc::initial_global_state = std::unique_ptr<s_mc_global_t>(new s_mc_global_t());
int res = this->main();
simgrid::mc::initial_global_state = nullptr;
- acceptance_pairs.clear();
- visited_pairs.clear();
-
return res;
}
+Checker* createLivenessChecker(Session& session)
+{
+ return new LivenessChecker(session);
+}
+
}
}
