1 /* Copyright (c) 2011-2014. 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. */
10 #include <xbt/dynar.h>
11 #include <xbt/automaton.h>
13 #include "mc_request.h"
14 #include "mc_liveness.h"
15 #include "mc_private.h"
16 #include "mc_record.h"
18 #include "mc_client.h"
20 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(mc_liveness, mc,
21 "Logging specific to algorithms for liveness properties verification");
23 /********* Global variables *********/
25 xbt_dynar_t acceptance_pairs;
28 /********* Static functions *********/
30 static xbt_dynar_t get_atomic_propositions_values()
32 unsigned int cursor = 0;
33 xbt_automaton_propositional_symbol_t ps = NULL;
34 xbt_dynar_t values = xbt_dynar_new(sizeof(int), NULL);
35 xbt_dynar_foreach(_mc_property_automaton->propositional_symbols, cursor, ps) {
36 int res = xbt_automaton_propositional_symbol_evaluate(ps);
37 xbt_dynar_push_as(values, int, res);
43 static mc_visited_pair_t is_reached_acceptance_pair(mc_pair_t pair) {
44 xbt_mheap_t heap = mmalloc_set_current_heap(mc_heap);
46 mc_visited_pair_t new_pair = NULL;
47 new_pair = MC_visited_pair_new(pair->num, pair->automaton_state, pair->atomic_propositions, pair->graph_state);
48 new_pair->acceptance_pair = 1;
50 if (xbt_dynar_is_empty(acceptance_pairs)) {
52 xbt_dynar_push(acceptance_pairs, &new_pair);
56 int min = -1, max = -1, index;
58 mc_visited_pair_t pair_test;
61 index = get_search_interval(acceptance_pairs, new_pair, &min, &max);
63 if (min != -1 && max != -1) { // Acceptance pair with same number of processes and same heap bytes used exists
65 // Parallell implementation
66 /*res = xbt_parmap_mc_apply(parmap, snapshot_compare, xbt_dynar_get_ptr(acceptance_pairs, min), (max-min)+1, pair);
70 return ((mc_pair_t)xbt_dynar_get_as(acceptance_pairs, (min+res)-1, mc_pair_t))->num;
74 if(pair->search_cycle == 1){
75 while (cursor <= max) {
76 pair_test = (mc_visited_pair_t) xbt_dynar_get_as(acceptance_pairs, cursor, mc_visited_pair_t);
77 if (xbt_automaton_state_compare(pair_test->automaton_state, new_pair->automaton_state) == 0) {
78 if (xbt_automaton_propositional_symbols_compare_value(pair_test->atomic_propositions, new_pair->atomic_propositions) == 0) {
79 if (snapshot_compare(pair_test, new_pair) == 0) {
80 XBT_INFO("Pair %d already reached (equal to pair %d) !", new_pair->num, pair_test->num);
81 xbt_fifo_shift(mc_stack);
82 if (dot_output != NULL)
83 fprintf(dot_output, "\"%d\" -> \"%d\" [%s];\n", initial_global_state->prev_pair, pair_test->num, initial_global_state->prev_req);
84 mmalloc_set_current_heap(heap);
92 xbt_dynar_insert_at(acceptance_pairs, min, &new_pair);
94 pair_test = (mc_visited_pair_t) xbt_dynar_get_as(acceptance_pairs, index, mc_visited_pair_t);
95 if (pair_test->nb_processes < new_pair->nb_processes) {
96 xbt_dynar_insert_at(acceptance_pairs, index + 1, &new_pair);
98 if (pair_test->heap_bytes_used < new_pair->heap_bytes_used)
99 xbt_dynar_insert_at(acceptance_pairs, index + 1, &new_pair);
101 xbt_dynar_insert_at(acceptance_pairs, index, &new_pair);
106 mmalloc_set_current_heap(heap);
110 static void remove_acceptance_pair(int pair_num)
112 xbt_mheap_t heap = mmalloc_set_current_heap(mc_heap);
114 unsigned int cursor = 0;
115 mc_visited_pair_t pair_test = NULL;
118 xbt_dynar_foreach(acceptance_pairs, cursor, pair_test) {
119 if (pair_test->num == pair_num) {
125 if(pair_found == 1) {
126 xbt_dynar_remove_at(acceptance_pairs, cursor, &pair_test);
128 pair_test->acceptance_removed = 1;
130 if (_sg_mc_visited == 0 || pair_test->visited_removed == 1)
131 MC_visited_pair_delete(pair_test);
135 mmalloc_set_current_heap(heap);
139 static int MC_automaton_evaluate_label(xbt_automaton_exp_label_t l,
140 xbt_dynar_t atomic_propositions_values)
145 int left_res = MC_automaton_evaluate_label(l->u.or_and.left_exp, atomic_propositions_values);
146 int right_res = MC_automaton_evaluate_label(l->u.or_and.right_exp, atomic_propositions_values);
147 return (left_res || right_res);
150 int left_res = MC_automaton_evaluate_label(l->u.or_and.left_exp, atomic_propositions_values);
151 int right_res = MC_automaton_evaluate_label(l->u.or_and.right_exp, atomic_propositions_values);
152 return (left_res && right_res);
155 int res = MC_automaton_evaluate_label(l->u.exp_not, atomic_propositions_values);
159 unsigned int cursor = 0;
160 xbt_automaton_propositional_symbol_t p = NULL;
161 xbt_dynar_foreach(_mc_property_automaton->propositional_symbols, cursor, p) {
162 if (strcmp(xbt_automaton_propositional_symbol_get_name(p), l->u.predicat) == 0)
163 return (int) xbt_dynar_get_as(atomic_propositions_values, cursor, int);
175 static void MC_modelcheck_liveness_main(void);
177 static void MC_pre_modelcheck_liveness(void)
179 initial_global_state->raw_mem_set = (mmalloc_get_current_heap() == mc_heap);
181 mc_pair_t initial_pair = NULL;
182 smx_process_t process;
185 MC_wait_for_requests();
186 MC_wait_for_requests();
190 acceptance_pairs = xbt_dynar_new(sizeof(mc_visited_pair_t), NULL);
191 if(_sg_mc_visited > 0)
192 visited_pairs = xbt_dynar_new(sizeof(mc_visited_pair_t), NULL);
194 initial_global_state->snapshot = MC_take_snapshot(0);
195 initial_global_state->prev_pair = 0;
197 unsigned int cursor = 0;
198 xbt_automaton_state_t automaton_state;
200 xbt_dynar_foreach(_mc_property_automaton->states, cursor, automaton_state) {
201 if (automaton_state->type == -1) { /* Initial automaton state */
203 initial_pair = MC_pair_new();
204 initial_pair->automaton_state = automaton_state;
205 initial_pair->graph_state = MC_state_new();
206 initial_pair->atomic_propositions = get_atomic_propositions_values();
207 initial_pair->depth = 1;
209 /* Get enabled processes and insert them in the interleave set of the graph_state */
210 MC_EACH_SIMIX_PROCESS(process,
211 if (MC_process_is_enabled(process)) {
212 MC_state_interleave_process(initial_pair->graph_state, process);
216 initial_pair->requests = MC_state_interleave_size(initial_pair->graph_state);
217 initial_pair->search_cycle = 0;
219 xbt_fifo_unshift(mc_stack, initial_pair);
225 MC_modelcheck_liveness_main();
227 if (initial_global_state->raw_mem_set)
231 static void MC_modelcheck_liveness_main(void)
233 smx_process_t process = NULL;
234 mc_pair_t current_pair = NULL;
235 int value, res, visited_num = -1;
236 smx_simcall_t req = NULL;
237 xbt_automaton_transition_t transition_succ = NULL;
239 mc_pair_t next_pair = NULL;
240 xbt_dynar_t prop_values = NULL;
241 mc_visited_pair_t reached_pair = NULL;
243 while(xbt_fifo_size(mc_stack) > 0){
245 /* Get current pair */
246 current_pair = (mc_pair_t) xbt_fifo_get_item_content(xbt_fifo_get_first_item(mc_stack));
248 /* Update current state in buchi automaton */
249 _mc_property_automaton->current_state = current_pair->automaton_state;
251 XBT_DEBUG("********************* ( Depth = %d, search_cycle = %d, interleave size = %d, pair_num = %d, requests = %d)",
252 current_pair->depth, current_pair->search_cycle,
253 MC_state_interleave_size(current_pair->graph_state), current_pair->num,
254 current_pair->requests);
256 if (current_pair->requests > 0) {
258 if (current_pair->automaton_state->type == 1 && current_pair->exploration_started == 0) {
259 /* If new acceptance pair, return new pair */
260 if ((reached_pair = is_reached_acceptance_pair(current_pair)) == NULL) {
261 int counter_example_depth = current_pair->depth;
262 XBT_INFO("*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*");
263 XBT_INFO("| ACCEPTANCE CYCLE |");
264 XBT_INFO("*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*");
265 XBT_INFO("Counter-example that violates formula :");
266 MC_show_stack_liveness(mc_stack);
267 MC_dump_stack_liveness(mc_stack);
268 MC_print_statistics(mc_stats);
269 XBT_INFO("Counter-example depth : %d", counter_example_depth);
274 /* Pair already visited ? stop the exploration on the current path */
275 if ((current_pair->exploration_started == 0) && (visited_num = is_visited_pair(reached_pair, current_pair)) != -1) {
277 if (dot_output != NULL){
279 fprintf(dot_output, "\"%d\" -> \"%d\" [%s];\n", initial_global_state->prev_pair, visited_num, initial_global_state->prev_req);
284 XBT_DEBUG("Pair already visited (equal to pair %d), exploration on the current path stopped.", visited_num);
286 current_pair->requests = 0;
292 req = MC_state_get_request(current_pair->graph_state, &value);
294 if (dot_output != NULL) {
296 if (initial_global_state->prev_pair != 0 && initial_global_state->prev_pair != current_pair->num) {
297 fprintf(dot_output, "\"%d\" -> \"%d\" [%s];\n", initial_global_state->prev_pair, current_pair->num, initial_global_state->prev_req);
298 xbt_free(initial_global_state->prev_req);
300 initial_global_state->prev_pair = current_pair->num;
301 initial_global_state->prev_req = MC_request_get_dot_output(req, value);
302 if (current_pair->search_cycle)
303 fprintf(dot_output, "%d [shape=doublecircle];\n", current_pair->num);
308 char* req_str = MC_request_to_string(req, value, MC_REQUEST_SIMIX);
309 XBT_DEBUG("Execute: %s", req_str);
312 /* Set request as executed */
313 MC_state_set_executed_request(current_pair->graph_state, req, value);
315 /* Update mc_stats */
316 mc_stats->executed_transitions++;
317 if(current_pair->exploration_started == 0)
318 mc_stats->visited_pairs++;
320 /* Answer the request */
321 MC_simcall_handle(req, value);
323 /* Wait for requests (schedules processes) */
324 MC_wait_for_requests();
328 current_pair->requests--;
329 current_pair->exploration_started = 1;
331 /* Get values of atomic propositions (variables used in the property formula) */
332 prop_values = get_atomic_propositions_values();
334 /* Evaluate enabled/true transitions in automaton according to atomic propositions values and create new pairs */
335 cursor = xbt_dynar_length(current_pair->automaton_state->out) - 1;
336 while (cursor >= 0) {
337 transition_succ = (xbt_automaton_transition_t)xbt_dynar_get_as(current_pair->automaton_state->out, cursor, xbt_automaton_transition_t);
338 res = MC_automaton_evaluate_label(transition_succ->label, prop_values);
339 if (res == 1 || res == 2) { /* 1 = True transition (always enabled), 2 = enabled transition according to atomic prop values */
340 next_pair = MC_pair_new();
341 next_pair->graph_state = MC_state_new();
342 next_pair->automaton_state = transition_succ->dst;
343 next_pair->atomic_propositions = get_atomic_propositions_values();
344 next_pair->depth = current_pair->depth + 1;
345 /* Get enabled processes and insert them in the interleave set of the next graph_state */
346 MC_EACH_SIMIX_PROCESS(process,
347 if (MC_process_is_enabled(process)) {
348 MC_state_interleave_process(next_pair->graph_state, process);
352 next_pair->requests = MC_state_interleave_size(next_pair->graph_state);
354 /* FIXME : get search_cycle value for each acceptant state */
355 if (next_pair->automaton_state->type == 1 || current_pair->search_cycle)
356 next_pair->search_cycle = 1;
358 /* Add new pair to the exploration stack */
359 xbt_fifo_unshift(mc_stack, next_pair);
367 } /* End of visited_pair test */
372 if(visited_num == -1)
373 XBT_DEBUG("No more request to execute. Looking for backtracking point.");
377 xbt_dynar_free(&prop_values);
379 /* Traverse the stack backwards until a pair with a non empty interleave
380 set is found, deleting all the pairs that have it empty in the way. */
381 while ((current_pair = xbt_fifo_shift(mc_stack)) != NULL) {
382 if (current_pair->requests > 0) {
383 /* We found a backtracking point */
384 XBT_DEBUG("Backtracking to depth %d", current_pair->depth);
385 xbt_fifo_unshift(mc_stack, current_pair);
387 MC_replay_liveness(mc_stack);
388 XBT_DEBUG("Backtracking done");
392 XBT_DEBUG("Delete pair %d at depth %d", current_pair->num, current_pair->depth);
393 if (current_pair->automaton_state->type == 1)
394 remove_acceptance_pair(current_pair->num);
395 MC_pair_delete(current_pair);
400 } /* End of if (current_pair->requests > 0) else ... */
402 } /* End of while(xbt_fifo_size(mc_stack) > 0) */
406 void MC_modelcheck_liveness(void)
408 XBT_DEBUG("Starting the liveness algorithm");
409 xbt_assert(mc_mode == MC_MODE_SERVER);
412 xbt_mheap_t heap = mmalloc_set_current_heap(mc_heap);
414 /* Create exploration stack */
415 mc_stack = xbt_fifo_new();
417 /* Create the initial state */
418 initial_global_state = xbt_new0(s_mc_global_t, 1);
422 MC_pre_modelcheck_liveness();
425 MC_print_statistics(mc_stats);
428 mmalloc_set_current_heap(heap);