1 /* Copyright (c) 2011-2013. 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 #include "mc_private.h"
11 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(mc_liveness, mc,
12 "Logging specific to algorithms for liveness properties verification");
14 /********* Global variables *********/
16 xbt_dynar_t acceptance_pairs;
17 xbt_dynar_t visited_pairs;
18 xbt_dynar_t successors;
21 /********* Static functions *********/
23 static xbt_dynar_t get_atomic_propositions_values(){
26 unsigned int cursor = 0;
27 xbt_automaton_propositional_symbol_t ps = NULL;
28 xbt_dynar_t values = xbt_dynar_new(sizeof(int), NULL);
30 xbt_dynar_foreach(_mc_property_automaton->propositional_symbols, cursor, ps){
31 f = (int_f_void_t)ps->function;
33 xbt_dynar_push_as(values, int, res);
39 static int get_search_interval(xbt_dynar_t all_pairs, mc_visited_pair_t pair, int *min, int *max){
41 int raw_mem_set = (mmalloc_get_current_heap() == raw_heap);
45 int cursor = 0, previous_cursor, next_cursor;
46 mc_visited_pair_t pair_test;
48 int end = xbt_dynar_length(all_pairs) - 1;
51 cursor = (start + end) / 2;
52 pair_test = (mc_visited_pair_t)xbt_dynar_get_as(all_pairs, cursor, mc_visited_pair_t);
53 if(pair_test->nb_processes < pair->nb_processes){
55 }else if(pair_test->nb_processes > pair->nb_processes){
58 if(pair_test->heap_bytes_used < pair->heap_bytes_used){
60 }else if(pair_test->heap_bytes_used > pair->heap_bytes_used){
64 previous_cursor = cursor - 1;
65 while(previous_cursor >= 0){
66 pair_test = (mc_visited_pair_t)xbt_dynar_get_as(all_pairs, previous_cursor, mc_visited_pair_t);
67 if(pair_test->nb_processes != pair->nb_processes || pair_test->heap_bytes_used != pair->heap_bytes_used)
69 *min = previous_cursor;
72 next_cursor = cursor + 1;
73 while(next_cursor < xbt_dynar_length(all_pairs)){
74 pair_test = (mc_visited_pair_t)xbt_dynar_get_as(all_pairs, next_cursor, mc_visited_pair_t);
75 if(pair_test->nb_processes != pair->nb_processes || pair_test->heap_bytes_used != pair->heap_bytes_used)
93 static mc_visited_pair_t is_reached_acceptance_pair(int pair_num, xbt_automaton_state_t automaton_state, xbt_dynar_t atomic_propositions){
95 int raw_mem_set = (mmalloc_get_current_heap() == raw_heap);
99 mc_visited_pair_t pair = NULL;
100 pair = MC_visited_pair_new(pair_num, automaton_state, atomic_propositions);
101 pair->acceptance_pair = 1;
103 if(xbt_dynar_is_empty(acceptance_pairs)){
105 xbt_dynar_push(acceptance_pairs, &pair);
109 int min = -1, max = -1, index;
111 mc_visited_pair_t pair_test;
114 index = get_search_interval(acceptance_pairs, pair, &min, &max);
116 if(min != -1 && max != -1){ // Acceptance pair with same number of processes and same heap bytes used exists
117 /*res = xbt_parmap_mc_apply(parmap, snapshot_compare, xbt_dynar_get_ptr(acceptance_pairs, min), (max-min)+1, pair);
121 return ((mc_pair_t)xbt_dynar_get_as(acceptance_pairs, (min+res)-1, mc_pair_t))->num;
124 while(cursor <= max){
125 pair_test = (mc_visited_pair_t)xbt_dynar_get_as(acceptance_pairs, cursor, mc_visited_pair_t);
126 if(xbt_automaton_state_compare(pair_test->automaton_state, pair->automaton_state) == 0){
127 if(xbt_automaton_propositional_symbols_compare_value(pair_test->atomic_propositions, pair->atomic_propositions) == 0){
128 if(snapshot_compare(pair_test, pair) == 0){
129 XBT_INFO("Pair %d already reached (equal to pair %d) !", pair->num, pair_test->num);
131 xbt_fifo_shift(mc_stack_liveness);
132 if(dot_output != NULL)
133 fprintf(dot_output, "\"%d\" -> \"%d\" [%s];\n", initial_state_liveness->prev_pair, pair_test->num, initial_state_liveness->prev_req);
144 xbt_dynar_insert_at(acceptance_pairs, min, &pair);
146 pair_test = (mc_visited_pair_t)xbt_dynar_get_as(acceptance_pairs, index, mc_visited_pair_t);
147 if(pair_test->nb_processes < pair->nb_processes){
148 xbt_dynar_insert_at(acceptance_pairs, index+1, &pair);
150 if(pair_test->heap_bytes_used < pair->heap_bytes_used)
151 xbt_dynar_insert_at(acceptance_pairs, index + 1, &pair);
153 xbt_dynar_insert_at(acceptance_pairs, index, &pair);
166 static void remove_acceptance_pair(int pair_num){
168 int raw_mem_set = (mmalloc_get_current_heap() == raw_heap);
170 fprintf(stderr, "Search acceptance pair %d\n", pair_num);
174 unsigned int cursor = 0;
175 mc_visited_pair_t pair_test = NULL;
177 xbt_dynar_foreach(acceptance_pairs, cursor, pair_test){
178 if(pair_test->num == pair_num){
183 xbt_dynar_remove_at(acceptance_pairs, cursor, &pair_test);
185 pair_test->acceptance_removed = 1;
187 if(_sg_mc_visited == 0){
188 MC_visited_pair_delete(pair_test);
189 }else if(pair_test->visited_removed == 1){
190 MC_visited_pair_delete(pair_test);
197 static int is_visited_pair(mc_visited_pair_t pair, int pair_num, xbt_automaton_state_t automaton_state, xbt_dynar_t atomic_propositions){
199 if(_sg_mc_visited == 0)
202 int raw_mem_set = (mmalloc_get_current_heap() == raw_heap);
206 mc_visited_pair_t new_pair = NULL;
209 new_pair = MC_visited_pair_new(pair_num, automaton_state, atomic_propositions);
214 if(xbt_dynar_is_empty(visited_pairs)){
216 xbt_dynar_push(visited_pairs, &new_pair);
220 int min = -1, max = -1, index;
222 mc_visited_pair_t pair_test;
225 index = get_search_interval(visited_pairs, new_pair, &min, &max);
227 if(min != -1 && max != -1){ // Visited pair with same number of processes and same heap bytes used exists
228 /*res = xbt_parmap_mc_apply(parmap, snapshot_compare, xbt_dynar_get_ptr(visited_pairs, min), (max-min)+1, pair);
230 pair_test = (mc_pair_t)xbt_dynar_get_as(visited_pairs, (min+res)-1, mc_pair_t);
231 if(pair_test->other_num == -1)
232 pair->other_num = pair_test->num;
234 pair->other_num = pair_test->other_num;
235 if(dot_output == NULL)
236 XBT_DEBUG("Pair %d already visited ! (equal to pair %d)", pair->num, pair_test->num);
238 XBT_DEBUG("Pair %d already visited ! (equal to pair %d (pair %d in dot_output))", pair->num, pair_test->num, pair->other_num);
239 xbt_dynar_remove_at(visited_pairs, (min + res) - 1, NULL);
240 xbt_dynar_insert_at(visited_pairs, (min+res) - 1, &pair);
241 pair_test->visited_removed = 1;
242 if(pair_test->stack_removed && pair_test->visited_removed){
243 if((pair_test->automaton_state->type == 1) || (pair_test->automaton_state->type == 2)){
244 if(pair_test->acceptance_removed){
245 MC_pair_delete(pair_test);
248 MC_pair_delete(pair_test);
253 return pair->other_num;
256 while(cursor <= max){
257 pair_test = (mc_visited_pair_t)xbt_dynar_get_as(visited_pairs, cursor, mc_visited_pair_t);
258 //if(pair_test->acceptance_pair == 0){ /* Acceptance pair have been already checked before */
259 if(xbt_automaton_state_compare(pair_test->automaton_state, new_pair->automaton_state) == 0){
260 if(xbt_automaton_propositional_symbols_compare_value(pair_test->atomic_propositions, new_pair->atomic_propositions) == 0){
261 if(snapshot_compare(pair_test, new_pair) == 0){
262 if(pair_test->other_num == -1)
263 new_pair->other_num = pair_test->num;
265 new_pair->other_num = pair_test->other_num;
266 if(dot_output == NULL)
267 XBT_DEBUG("Pair %d already visited ! (equal to pair %d)", new_pair->num, pair_test->num);
269 XBT_DEBUG("Pair %d already visited ! (equal to pair %d (pair %d in dot_output))", new_pair->num, pair_test->num, pair->other_num);
270 xbt_dynar_remove_at(visited_pairs, cursor, NULL);
271 xbt_dynar_insert_at(visited_pairs, cursor, &new_pair);
272 pair_test->visited_removed = 1;
273 if(pair_test->acceptance_pair){
274 if(pair_test->acceptance_removed == 1)
275 MC_visited_pair_delete(pair_test);
277 MC_visited_pair_delete(pair_test);
281 return new_pair->other_num;
288 xbt_dynar_insert_at(visited_pairs, min, &new_pair);
290 pair_test = (mc_visited_pair_t)xbt_dynar_get_as(visited_pairs, index, mc_visited_pair_t);
291 if(pair_test->nb_processes < new_pair->nb_processes){
292 xbt_dynar_insert_at(visited_pairs, index+1, &new_pair);
294 if(pair_test->heap_bytes_used < new_pair->heap_bytes_used)
295 xbt_dynar_insert_at(visited_pairs, index + 1, &new_pair);
297 xbt_dynar_insert_at(visited_pairs, index, &new_pair);
301 if(xbt_dynar_length(visited_pairs) > _sg_mc_visited){
302 int min2 = mc_stats->expanded_pairs;
303 unsigned int cursor2 = 0;
304 unsigned int index2 = 0;
305 xbt_dynar_foreach(visited_pairs, cursor2, pair_test){
306 if(pair_test->num < min2){
308 min2 = pair_test->num;
311 xbt_dynar_remove_at(visited_pairs, index2, &pair_test);
312 pair_test->visited_removed = 1;
313 if(pair_test->acceptance_pair){
314 if(pair_test->acceptance_removed)
315 MC_visited_pair_delete(pair_test);
317 MC_visited_pair_delete(pair_test);
329 static int MC_automaton_evaluate_label(xbt_automaton_exp_label_t l, xbt_dynar_t atomic_propositions_values){
333 int left_res = MC_automaton_evaluate_label(l->u.or_and.left_exp, atomic_propositions_values);
334 int right_res = MC_automaton_evaluate_label(l->u.or_and.right_exp, atomic_propositions_values);
335 return (left_res || right_res);
338 int left_res = MC_automaton_evaluate_label(l->u.or_and.left_exp, atomic_propositions_values);
339 int right_res = MC_automaton_evaluate_label(l->u.or_and.right_exp, atomic_propositions_values);
340 return (left_res && right_res);
343 int res = MC_automaton_evaluate_label(l->u.exp_not, atomic_propositions_values);
347 unsigned int cursor = 0;
348 xbt_automaton_propositional_symbol_t p = NULL;
349 xbt_dynar_foreach(_mc_property_automaton->propositional_symbols, cursor, p){
350 if(strcmp(p->pred, l->u.predicat) == 0)
351 return (int)xbt_dynar_get_as(atomic_propositions_values, cursor, int);
364 /********* DDFS Algorithm *********/
367 void MC_ddfs_init(void){
369 initial_state_liveness->raw_mem_set = (mmalloc_get_current_heap() == raw_heap);
371 XBT_DEBUG("**************************************************");
372 XBT_DEBUG("Double-DFS init");
373 XBT_DEBUG("**************************************************");
375 mc_pair_t initial_pair = NULL;
376 smx_process_t process;
378 MC_wait_for_requests();
380 MC_ignore_heap(simix_global->process_to_run->data, 0);
381 MC_ignore_heap(simix_global->process_that_ran->data, 0);
385 acceptance_pairs = xbt_dynar_new(sizeof(mc_visited_pair_t), NULL);
386 visited_pairs = xbt_dynar_new(sizeof(mc_visited_pair_t), NULL);
387 successors = xbt_dynar_new(sizeof(mc_pair_t), NULL);
389 initial_state_liveness->snapshot = MC_take_snapshot(0);
390 initial_state_liveness->prev_pair = 0;
394 unsigned int cursor = 0;
395 xbt_automaton_state_t automaton_state;
397 xbt_dynar_foreach(_mc_property_automaton->states, cursor, automaton_state){
398 if(automaton_state->type == -1){ /* Initial automaton state */
402 initial_pair = MC_pair_new();
403 initial_pair->automaton_state = automaton_state;
404 initial_pair->graph_state = MC_state_new();
405 initial_pair->atomic_propositions = get_atomic_propositions_values();
407 /* Get enabled process and insert it in the interleave set of the graph_state */
408 xbt_swag_foreach(process, simix_global->process_list){
409 if(MC_process_is_enabled(process)){
410 MC_state_interleave_process(initial_pair->graph_state, process);
414 initial_pair->requests = MC_state_interleave_size(initial_pair->graph_state);
415 initial_pair->search_cycle = 0;
417 xbt_fifo_unshift(mc_stack_liveness, initial_pair);
424 MC_restore_snapshot(initial_state_liveness->snapshot);
430 if(initial_state_liveness->raw_mem_set)
441 smx_process_t process;
442 mc_pair_t current_pair = NULL;
444 if(xbt_fifo_size(mc_stack_liveness) == 0)
447 /* Get current pair */
448 current_pair = (mc_pair_t)xbt_fifo_get_item_content(xbt_fifo_get_first_item(mc_stack_liveness));
450 /* Update current state in buchi automaton */
451 _mc_property_automaton->current_state = current_pair->automaton_state;
453 XBT_DEBUG("********************* ( Depth = %d, search_cycle = %d, interleave size %d, pair_num %d)", xbt_fifo_size(mc_stack_liveness), current_pair->search_cycle, MC_state_interleave_size(current_pair->graph_state), current_pair->num);
455 mc_stats->visited_pairs++;
458 smx_simcall_t req = NULL;
461 xbt_automaton_transition_t transition_succ;
462 unsigned int cursor = 0;
466 mc_pair_t next_pair = NULL;
467 xbt_dynar_t prop_values = NULL;
468 mc_visited_pair_t reached_pair = NULL;
470 if(xbt_fifo_size(mc_stack_liveness) < _sg_mc_max_depth){
472 if(current_pair->requests > 0){
474 if(current_pair->search_cycle){
476 if((current_pair->automaton_state->type == 1) || (current_pair->automaton_state->type == 2)){
477 if((reached_pair = is_reached_acceptance_pair(current_pair->num, current_pair->automaton_state, current_pair->atomic_propositions)) == NULL){
479 XBT_INFO("*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*");
480 XBT_INFO("| ACCEPTANCE CYCLE |");
481 XBT_INFO("*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*");
482 XBT_INFO("Counter-example that violates formula :");
483 MC_show_stack_liveness(mc_stack_liveness);
484 MC_dump_stack_liveness(mc_stack_liveness);
485 MC_print_statistics(mc_stats);
492 if((visited_num = is_visited_pair(reached_pair, current_pair->num, current_pair->automaton_state, current_pair->atomic_propositions)) != -1){
495 if(dot_output != NULL)
496 fprintf(dot_output, "\"%d\" -> \"%d\" [%s];\n", initial_state_liveness->prev_pair, visited_num, initial_state_liveness->prev_req);
501 while((req = MC_state_get_request(current_pair->graph_state, &value)) != NULL){
504 if(dot_output != NULL){
505 if(initial_state_liveness->prev_pair != 0 && initial_state_liveness->prev_pair != current_pair->num){
506 fprintf(dot_output, "\"%d\" -> \"%d\" [%s];\n", initial_state_liveness->prev_pair, current_pair->num, initial_state_liveness->prev_req);
507 xbt_free(initial_state_liveness->prev_req);
509 initial_state_liveness->prev_pair = current_pair->num;
513 /* Debug information */
514 if(XBT_LOG_ISENABLED(mc_liveness, xbt_log_priority_debug)){
515 req_str = MC_request_to_string(req, value);
516 XBT_DEBUG("Execute: %s", req_str);
521 if(dot_output != NULL){
522 initial_state_liveness->prev_req = MC_request_get_dot_output(req, value);
523 if(current_pair->search_cycle)
524 fprintf(dot_output, "%d [shape=doublecircle];\n", current_pair->num);
528 MC_state_set_executed_request(current_pair->graph_state, req, value);
529 mc_stats->executed_transitions++;
531 /* Answer the request */
532 SIMIX_simcall_pre(req, value);
534 /* Wait for requests (schedules processes) */
535 MC_wait_for_requests();
538 prop_values = get_atomic_propositions_values();
543 /* Evaluate enabled transition according to atomic propositions values */
545 xbt_dynar_foreach(current_pair->automaton_state->out, cursor, transition_succ){
547 res = MC_automaton_evaluate_label(transition_succ->label, prop_values);
549 if(res == 1){ // enabled transition in automaton
552 MC_replay_liveness(mc_stack_liveness, 1);
556 next_pair = MC_pair_new();
557 next_pair->graph_state = MC_state_new();
558 next_pair->automaton_state = transition_succ->dst;
559 next_pair->atomic_propositions = get_atomic_propositions_values();
561 /* Get enabled process and insert it in the interleave set of the next graph_state */
562 xbt_swag_foreach(process, simix_global->process_list){
563 if(MC_process_is_enabled(process)){
564 MC_state_interleave_process(next_pair->graph_state, process);
568 next_pair->requests = MC_state_interleave_size(next_pair->graph_state);
570 if(next_pair->automaton_state->type == 1 || next_pair->automaton_state->type == 2 || current_pair->search_cycle)
571 next_pair->search_cycle = 1;
573 xbt_fifo_unshift(mc_stack_liveness, next_pair);
575 if(mc_stats->expanded_pairs%1000000 == 0)
576 XBT_INFO("Expanded pairs : %lu", mc_stats->expanded_pairs);
588 /* Then, evaluate true transitions (always true, whatever atomic propositions values) */
590 xbt_dynar_foreach(current_pair->automaton_state->out, cursor, transition_succ){
592 res = MC_automaton_evaluate_label(transition_succ->label, prop_values);
594 if(res == 2){ // true transition in automaton
597 MC_replay_liveness(mc_stack_liveness, 1);
601 next_pair = MC_pair_new();
602 next_pair->graph_state = MC_state_new();
603 next_pair->automaton_state = transition_succ->dst;
604 next_pair->atomic_propositions = get_atomic_propositions_values();
606 /* Get enabled process and insert it in the interleave set of the next graph_state */
607 xbt_swag_foreach(process, simix_global->process_list){
608 if(MC_process_is_enabled(process)){
609 MC_state_interleave_process(next_pair->graph_state, process);
613 next_pair->requests = MC_state_interleave_size(next_pair->graph_state);
615 if(next_pair->automaton_state->type == 1 || next_pair->automaton_state->type == 2 || current_pair->search_cycle)
616 next_pair->search_cycle = 1;
618 xbt_fifo_unshift(mc_stack_liveness, next_pair);
620 if(mc_stats->expanded_pairs%1000000 == 0)
621 XBT_INFO("Expanded pairs : %lu", mc_stats->expanded_pairs);
633 if(MC_state_interleave_size(current_pair->graph_state) > 0){
634 XBT_DEBUG("Backtracking to depth %d", xbt_fifo_size(mc_stack_liveness));
635 MC_replay_liveness(mc_stack_liveness, 0);
646 XBT_WARN("/!\\ Max depth reached ! /!\\ ");
647 if(MC_state_interleave_size(current_pair->graph_state) > 0){
648 XBT_WARN("/!\\ But, there are still processes to interleave. Model-checker will not be able to ensure the soundness of the verification from now. /!\\ ");
649 if(_sg_mc_max_depth == 1000)
650 XBT_WARN("Notice : the default value of max depth is 1000 but you can change it with cfg=model-check/max_depth:value.");
655 if(xbt_fifo_size(mc_stack_liveness) == _sg_mc_max_depth ){
656 XBT_DEBUG("Pair %d (depth = %d) shifted in stack, maximum depth reached", current_pair->num, xbt_fifo_size(mc_stack_liveness) );
658 XBT_DEBUG("Pair %d (depth = %d) shifted in stack", current_pair->num, xbt_fifo_size(mc_stack_liveness) );
663 xbt_dynar_free(&prop_values);
664 current_pair = xbt_fifo_shift(mc_stack_liveness);
665 if(xbt_fifo_size(mc_stack_liveness) != _sg_mc_max_depth -1 && current_pair->requests > 0 && current_pair->search_cycle){
666 remove_acceptance_pair(current_pair->num);
668 MC_pair_delete(current_pair);