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_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;
48 int end = xbt_dynar_length(all_pairs) - 1;
51 cursor = (start + end) / 2;
52 pair_test = (mc_pair_t)xbt_dynar_get_as(all_pairs, cursor, mc_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_pair_t)xbt_dynar_get_as(all_pairs, previous_cursor, mc_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_pair_t)xbt_dynar_get_as(all_pairs, next_cursor, mc_pair_t);
75 if(pair_test->nb_processes != pair->nb_processes || pair_test->heap_bytes_used != pair->heap_bytes_used)
93 static int is_reached_acceptance_pair(mc_pair_t pair){
95 int raw_mem_set = (mmalloc_get_current_heap() == raw_heap);
99 if(xbt_dynar_is_empty(acceptance_pairs)){
101 if(pair->graph_state->system_state == NULL){
102 pair->graph_state->system_state = MC_take_snapshot();
103 pair->heap_bytes_used = mmalloc_get_bytes_used(std_heap);
105 xbt_dynar_push(acceptance_pairs, &pair);
114 if(pair->graph_state->system_state == NULL){
115 pair->graph_state->system_state = MC_take_snapshot();
116 pair->heap_bytes_used = mmalloc_get_bytes_used(std_heap);
119 int min = -1, max = -1, index;
123 index = get_search_interval(acceptance_pairs, pair, &min, &max);
125 if(min != -1 && max != -1){ /* Acceptance pair with same number of processes and same heap bytes used exists */
126 res = xbt_parmap_mc_apply(parmap, snapshot_compare, xbt_dynar_get_ptr(acceptance_pairs, min), (max-min)+1, pair);
130 return ((mc_pair_t)xbt_dynar_get_as(acceptance_pairs, (min+res)-1, mc_pair_t))->num;
132 xbt_dynar_insert_at(acceptance_pairs, min, &pair);
134 pair_test = (mc_pair_t)xbt_dynar_get_as(acceptance_pairs, index, mc_pair_t);
135 if(pair_test->nb_processes < pair->nb_processes){
136 xbt_dynar_insert_at(acceptance_pairs, index+1, &pair);
138 if(pair_test->heap_bytes_used < pair->heap_bytes_used)
139 xbt_dynar_insert_at(acceptance_pairs, index + 1, &pair);
141 xbt_dynar_insert_at(acceptance_pairs, index, &pair);
155 static void set_acceptance_pair_reached(mc_pair_t pair){
157 int raw_mem_set = (mmalloc_get_current_heap() == raw_heap);
161 if(xbt_dynar_is_empty(acceptance_pairs)){
163 if(pair->graph_state->system_state == NULL){
164 pair->graph_state->system_state = MC_take_snapshot();
165 pair->heap_bytes_used = mmalloc_get_bytes_used(std_heap);
167 xbt_dynar_push(acceptance_pairs, &pair);
171 if(pair->graph_state->system_state == NULL){
172 pair->graph_state->system_state = MC_take_snapshot();
173 pair->heap_bytes_used = mmalloc_get_bytes_used(std_heap);
176 size_t current_bytes_used = pair->heap_bytes_used;
177 int current_nb_processes = pair->nb_processes;
181 int end = xbt_dynar_length(acceptance_pairs) - 1;
183 mc_pair_t pair_test = NULL;
184 size_t bytes_used_test = 0;
185 int nb_processes_test;
188 cursor = (start + end) / 2;
189 pair_test = (mc_pair_t)xbt_dynar_get_as(acceptance_pairs, cursor, mc_pair_t);
190 bytes_used_test = pair_test->heap_bytes_used;
191 nb_processes_test = pair_test->nb_processes;
192 if(nb_processes_test < current_nb_processes)
194 if(nb_processes_test > current_nb_processes)
196 if(nb_processes_test == current_nb_processes){
197 if(bytes_used_test < current_bytes_used)
199 if(bytes_used_test > current_bytes_used)
201 if(bytes_used_test == current_bytes_used)
206 if(bytes_used_test < current_bytes_used)
207 xbt_dynar_insert_at(acceptance_pairs, cursor + 1, &pair);
209 xbt_dynar_insert_at(acceptance_pairs, cursor, &pair);
217 static void remove_acceptance_pair(mc_pair_t pair){
219 int raw_mem_set = (mmalloc_get_current_heap() == raw_heap);
223 unsigned int cursor = 0;
227 xbt_dynar_foreach(acceptance_pairs, cursor, pair_test){
228 if(pair_test->num == pair->num){
235 xbt_dynar_remove_at(acceptance_pairs, cursor, NULL);
237 pair->acceptance_removed = 1;
239 if(pair->stack_removed && pair->acceptance_removed){
240 if(_sg_mc_visited == 0){
241 MC_pair_delete(pair);
242 }else if(pair->visited_removed){
243 MC_pair_delete(pair);
251 static int is_visited_pair(mc_pair_t pair){
253 if(_sg_mc_visited == 0)
256 int raw_mem_set = (mmalloc_get_current_heap() == raw_heap);
260 if(xbt_dynar_is_empty(visited_pairs)){
262 if(pair->graph_state->system_state == NULL)
263 pair->graph_state->system_state = MC_take_snapshot();
264 xbt_dynar_push(visited_pairs, &pair);
273 if(pair->graph_state->system_state == NULL)
274 pair->graph_state->system_state = MC_take_snapshot();
276 int min = -1, max = -1, index;
280 index = get_search_interval(visited_pairs, pair, &min, &max);
282 if(min != -1 && max != -1){ /* Visited pair with same number of processes and same heap bytes used exists */
283 res = xbt_parmap_mc_apply(parmap, snapshot_compare, xbt_dynar_get_ptr(visited_pairs, min), (max-min)+1, pair);
285 pair_test = (mc_pair_t)xbt_dynar_get_as(visited_pairs, (min+res)-1, mc_pair_t);
286 if(pair_test->other_num == -1)
287 pair->other_num = pair_test->num;
289 pair->other_num = pair_test->other_num;
290 if(dot_output == NULL)
291 XBT_DEBUG("Pair %d already visited ! (equal to pair %d)", pair->num, pair_test->num);
293 XBT_DEBUG("Pair %d already visited ! (equal to pair %d (pair %d in dot_output))", pair->num, pair_test->num, pair->other_num);
294 xbt_dynar_remove_at(visited_pairs, (min + res) - 1, NULL);
295 xbt_dynar_insert_at(visited_pairs, (min+res) - 1, &pair);
296 pair_test->visited_removed = 1;
297 if(pair_test->stack_removed && pair_test->visited_removed){
298 if((pair_test->automaton_state->type == 1) || (pair_test->automaton_state->type == 2)){
299 if(pair_test->acceptance_removed){
300 MC_pair_delete(pair_test);
303 MC_pair_delete(pair_test);
308 return pair->other_num;
310 xbt_dynar_insert_at(visited_pairs, min, &pair);
312 pair_test = (mc_pair_t)xbt_dynar_get_as(visited_pairs, index, mc_pair_t);
313 if(pair_test->nb_processes < pair->nb_processes){
314 xbt_dynar_insert_at(visited_pairs, index+1, &pair);
316 if(pair_test->heap_bytes_used < pair->heap_bytes_used)
317 xbt_dynar_insert_at(visited_pairs, index + 1, &pair);
319 xbt_dynar_insert_at(visited_pairs, index, &pair);
323 if(xbt_dynar_length(visited_pairs) > _sg_mc_visited){
324 int min = mc_stats->expanded_states;
325 unsigned int cursor2 = 0;
326 unsigned int index2 = 0;
327 xbt_dynar_foreach(visited_pairs, cursor2, pair_test){
328 if(pair_test->num < min){
330 min = pair_test->num;
333 xbt_dynar_remove_at(visited_pairs, index2, &pair_test);
334 pair_test->visited_removed = 1;
335 if(pair_test->stack_removed && pair_test->acceptance_removed && pair_test->visited_removed)
336 MC_pair_delete(pair_test);
348 static int MC_automaton_evaluate_label(xbt_automaton_exp_label_t l, xbt_dynar_t atomic_propositions_values){
352 int left_res = MC_automaton_evaluate_label(l->u.or_and.left_exp, atomic_propositions_values);
353 int right_res = MC_automaton_evaluate_label(l->u.or_and.right_exp, atomic_propositions_values);
354 return (left_res || right_res);
357 int left_res = MC_automaton_evaluate_label(l->u.or_and.left_exp, atomic_propositions_values);
358 int right_res = MC_automaton_evaluate_label(l->u.or_and.right_exp, atomic_propositions_values);
359 return (left_res && right_res);
362 int res = MC_automaton_evaluate_label(l->u.exp_not, atomic_propositions_values);
366 unsigned int cursor = 0;
367 xbt_automaton_propositional_symbol_t p = NULL;
368 xbt_dynar_foreach(_mc_property_automaton->propositional_symbols, cursor, p){
369 if(strcmp(p->pred, l->u.predicat) == 0)
370 return (int)xbt_dynar_get_as(atomic_propositions_values, cursor, int);
383 /********* DDFS Algorithm *********/
386 void MC_ddfs_init(void){
388 initial_state_liveness->raw_mem_set = (mmalloc_get_current_heap() == raw_heap);
390 XBT_DEBUG("**************************************************");
391 XBT_DEBUG("Double-DFS init");
392 XBT_DEBUG("**************************************************");
394 mc_pair_t initial_pair = NULL;
395 smx_process_t process;
397 MC_wait_for_requests();
401 acceptance_pairs = xbt_dynar_new(sizeof(mc_pair_t), NULL);
402 visited_pairs = xbt_dynar_new(sizeof(mc_pair_t), NULL);
403 successors = xbt_dynar_new(sizeof(mc_pair_t), NULL);
405 initial_state_liveness->snapshot = MC_take_snapshot();
406 initial_state_liveness->prev_pair = 0;
410 unsigned int cursor = 0;
411 xbt_automaton_state_t automaton_state;
413 xbt_dynar_foreach(_mc_property_automaton->states, cursor, automaton_state){
414 if(automaton_state->type == -1){ /* Initial automaton state */
418 initial_pair = MC_pair_new();
419 initial_pair->automaton_state = automaton_state;
420 initial_pair->graph_state = MC_state_new();
421 initial_pair->atomic_propositions = get_atomic_propositions_values();
423 /* Get enabled process and insert it in the interleave set of the graph_state */
424 xbt_swag_foreach(process, simix_global->process_list){
425 if(MC_process_is_enabled(process)){
426 MC_state_interleave_process(initial_pair->graph_state, process);
430 initial_pair->requests = MC_state_interleave_size(initial_pair->graph_state);
431 initial_pair->search_cycle = 0;
433 xbt_fifo_unshift(mc_stack_liveness, initial_pair);
440 MC_restore_snapshot(initial_state_liveness->snapshot);
445 }else if(automaton_state->type == 2){ /* Acceptance automaton state */
449 initial_pair = MC_pair_new();
450 initial_pair->automaton_state = automaton_state;
451 initial_pair->graph_state = MC_state_new();
452 initial_pair->atomic_propositions = get_atomic_propositions_values();
454 /* Get enabled process and insert it in the interleave set of the graph_state */
455 xbt_swag_foreach(process, simix_global->process_list){
456 if(MC_process_is_enabled(process)){
457 MC_state_interleave_process(initial_pair->graph_state, process);
461 initial_pair->requests = MC_state_interleave_size(initial_pair->graph_state);
462 initial_pair->search_cycle = 1;
464 xbt_fifo_unshift(mc_stack_liveness, initial_pair);
468 set_acceptance_pair_reached(initial_pair);
473 MC_restore_snapshot(initial_state_liveness->snapshot);
479 if(initial_state_liveness->raw_mem_set)
490 smx_process_t process;
491 mc_pair_t current_pair = NULL;
493 if(xbt_fifo_size(mc_stack_liveness) == 0)
496 /* Get current pair */
497 current_pair = (mc_pair_t)xbt_fifo_get_item_content(xbt_fifo_get_first_item(mc_stack_liveness));
499 /* Update current state in buchi automaton */
500 _mc_property_automaton->current_state = current_pair->automaton_state;
502 XBT_DEBUG("********************* ( Depth = %d, search_cycle = %d, interleave size %d)", xbt_fifo_size(mc_stack_liveness), current_pair->search_cycle, MC_state_interleave_size(current_pair->graph_state));
504 mc_stats->visited_pairs++;
507 smx_simcall_t req = NULL;
510 xbt_automaton_transition_t transition_succ;
511 unsigned int cursor = 0;
513 int reached_num, visited_num;
515 mc_pair_t next_pair = NULL;
516 xbt_dynar_t prop_values = NULL;
518 if(xbt_fifo_size(mc_stack_liveness) < _sg_mc_max_depth){
520 if(current_pair->requests > 0){
522 if(current_pair->search_cycle){
524 if((current_pair->automaton_state->type == 1) || (current_pair->automaton_state->type == 2)){
526 if((reached_num = is_reached_acceptance_pair(current_pair)) != -1){
528 XBT_INFO("Pair %d already reached (equal to pair %d) !", current_pair->num, reached_num);
531 xbt_fifo_shift(mc_stack_liveness);
532 if(dot_output != NULL)
533 fprintf(dot_output, "\"%d\" -> \"%d\" [%s];\n", initial_state_liveness->prev_pair, reached_num, initial_state_liveness->prev_req);
536 XBT_INFO("*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*");
537 XBT_INFO("| ACCEPTANCE CYCLE |");
538 XBT_INFO("*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*");
539 XBT_INFO("Counter-example that violates formula :");
540 MC_show_stack_liveness(mc_stack_liveness);
541 MC_dump_stack_liveness(mc_stack_liveness);
542 MC_print_statistics(mc_stats);
549 if((visited_num = is_visited_pair(current_pair)) != -1){
552 if(dot_output != NULL)
553 fprintf(dot_output, "\"%d\" -> \"%d\" [%s];\n", initial_state_liveness->prev_pair, visited_num, initial_state_liveness->prev_req);
559 while((req = MC_state_get_request(current_pair->graph_state, &value)) != NULL){
562 if(dot_output != NULL){
563 if(initial_state_liveness->prev_pair != 0 && initial_state_liveness->prev_pair != current_pair->num){
564 fprintf(dot_output, "\"%d\" -> \"%d\" [%s];\n", initial_state_liveness->prev_pair, current_pair->num, initial_state_liveness->prev_req);
565 xbt_free(initial_state_liveness->prev_req);
567 initial_state_liveness->prev_pair = current_pair->num;
571 /* Debug information */
572 if(XBT_LOG_ISENABLED(mc_liveness, xbt_log_priority_debug)){
573 req_str = MC_request_to_string(req, value);
574 XBT_DEBUG("Execute: %s", req_str);
579 if(dot_output != NULL){
580 initial_state_liveness->prev_req = MC_request_get_dot_output(req, value);
581 if(current_pair->search_cycle)
582 fprintf(dot_output, "%d [shape=doublecircle];\n", current_pair->num);
586 MC_state_set_executed_request(current_pair->graph_state, req, value);
587 mc_stats->executed_transitions++;
589 /* Answer the request */
590 SIMIX_simcall_pre(req, value);
592 /* Wait for requests (schedules processes) */
593 MC_wait_for_requests();
596 prop_values = get_atomic_propositions_values();
599 /* Evaluate enabled transition according to atomic propositions values */
601 xbt_dynar_foreach(current_pair->automaton_state->out, cursor, transition_succ){
603 res = MC_automaton_evaluate_label(transition_succ->label, prop_values);
605 if(res == 1){ // enabled transition in automaton
609 next_pair = MC_pair_new();
610 next_pair->graph_state = MC_state_new();
611 next_pair->automaton_state = transition_succ->dst;
612 next_pair->atomic_propositions = get_atomic_propositions_values();
614 /* Get enabled process and insert it in the interleave set of the next graph_state */
615 xbt_swag_foreach(process, simix_global->process_list){
616 if(MC_process_is_enabled(process)){
617 MC_state_interleave_process(next_pair->graph_state, process);
621 next_pair->requests = MC_state_interleave_size(next_pair->graph_state);
623 if(next_pair->automaton_state->type == 1 || next_pair->automaton_state->type == 2 || current_pair->search_cycle)
624 next_pair->search_cycle = 1;
626 xbt_fifo_unshift(mc_stack_liveness, next_pair);
628 if(mc_stats->expanded_pairs%1000000 == 0)
629 XBT_INFO("Expanded pairs : %lu", mc_stats->expanded_pairs);
639 /* Then, evaluate true transitions (always true, whatever atomic propositions values) */
641 xbt_dynar_foreach(current_pair->automaton_state->out, cursor, transition_succ){
643 res = MC_automaton_evaluate_label(transition_succ->label, prop_values);
645 if(res == 2){ // true transition in automaton
649 next_pair = MC_pair_new();
650 next_pair->graph_state = MC_state_new();
651 next_pair->automaton_state = transition_succ->dst;
652 next_pair->atomic_propositions = get_atomic_propositions_values();
654 /* Get enabled process and insert it in the interleave set of the next graph_state */
655 xbt_swag_foreach(process, simix_global->process_list){
656 if(MC_process_is_enabled(process)){
657 MC_state_interleave_process(next_pair->graph_state, process);
661 next_pair->requests = MC_state_interleave_size(next_pair->graph_state);
663 if(next_pair->automaton_state->type == 1 || next_pair->automaton_state->type == 2 || current_pair->search_cycle)
664 next_pair->search_cycle = 1;
666 xbt_fifo_unshift(mc_stack_liveness, next_pair);
668 if(mc_stats->expanded_pairs%1000000 == 0)
669 XBT_INFO("Expanded pairs : %lu", mc_stats->expanded_pairs);
679 if(MC_state_interleave_size(current_pair->graph_state) > 0){
680 XBT_DEBUG("Backtracking to depth %d", xbt_fifo_size(mc_stack_liveness));
681 MC_replay_liveness(mc_stack_liveness, 0);
690 mc_stats->executed_transitions++;
692 XBT_DEBUG("No request to execute in this state, search evolution in Büchi Automaton.");
694 if(current_pair->search_cycle){
696 if((current_pair->automaton_state->type == 1) || (current_pair->automaton_state->type == 2)){
698 if((reached_num = is_reached_acceptance_pair(current_pair)) != -1){
700 XBT_INFO("Pair %d already reached (equal to pair %d) !", current_pair->num, reached_num);
703 xbt_fifo_shift(mc_stack_liveness);
706 XBT_INFO("*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*");
707 XBT_INFO("| ACCEPTANCE CYCLE |");
708 XBT_INFO("*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*");
709 XBT_INFO("Counter-example that violates formula :");
710 MC_show_stack_liveness(mc_stack_liveness);
711 MC_dump_stack_liveness(mc_stack_liveness);
712 MC_print_statistics(mc_stats);
719 if((visited_num = is_visited_pair(current_pair)) != -1){
721 XBT_DEBUG("Pair %d already visited ! (equal to pair %d)", current_pair->num, visited_num);
726 prop_values = get_atomic_propositions_values();
729 /* Evaluate enabled transition according to atomic propositions values */
731 xbt_dynar_foreach(current_pair->automaton_state->out, cursor, transition_succ){
733 res = MC_automaton_evaluate_label(transition_succ->label, prop_values);
735 if(res == 1){ // enabled transition in automaton
739 next_pair = MC_pair_new();
740 next_pair->graph_state = MC_state_new();
741 next_pair->automaton_state = transition_succ->dst;
742 next_pair->atomic_propositions = get_atomic_propositions_values();
743 next_pair->requests = MC_state_interleave_size(next_pair->graph_state);
745 if(next_pair->automaton_state->type == 1 || next_pair->automaton_state->type == 2 || current_pair->search_cycle)
746 next_pair->search_cycle = 1;
748 xbt_fifo_unshift(mc_stack_liveness, next_pair);
750 if(mc_stats->expanded_pairs%1000 == 0)
751 XBT_INFO("Expanded pairs : %lu", mc_stats->expanded_pairs);
753 if(dot_output != NULL)
754 fprintf(dot_output, "\"%d\" -> \"%d\" [%s];\n", current_pair->num, next_pair->num, "");
764 /* Then, evaluate true transitions (always true, whatever atomic propositions values) */
766 xbt_dynar_foreach(current_pair->automaton_state->out, cursor, transition_succ){
768 res = MC_automaton_evaluate_label(transition_succ->label, prop_values);
770 if(res == 2){ // true transition in automaton
774 next_pair = MC_pair_new();
775 next_pair->graph_state = MC_state_new();
776 next_pair->automaton_state = transition_succ->dst;
777 next_pair->atomic_propositions = get_atomic_propositions_values();
778 next_pair->requests = MC_state_interleave_size(next_pair->graph_state);
780 if(next_pair->automaton_state->type == 1 || next_pair->automaton_state->type == 2 || current_pair->search_cycle)
781 next_pair->search_cycle = 1;
783 xbt_fifo_unshift(mc_stack_liveness, next_pair);
785 if(mc_stats->expanded_pairs%1000 == 0)
786 XBT_INFO("Expanded pairs : %lu", mc_stats->expanded_pairs);
788 if(dot_output != NULL)
789 fprintf(dot_output, "\"%d\" -> \"%d\" [%s];\n", current_pair->num, next_pair->num, "");
803 XBT_WARN("/!\\ Max depth reached ! /!\\ ");
804 if(MC_state_interleave_size(current_pair->graph_state) > 0){
805 XBT_WARN("/!\\ But, there are still processes to interleave. Model-checker will not be able to ensure the soundness of the verification from now. /!\\ ");
806 if(_sg_mc_max_depth == 1000)
807 XBT_WARN("Notice : the default value of max depth is 1000 but you can change it with cfg=model-check/max_depth:value.");
812 if(xbt_fifo_size(mc_stack_liveness) == _sg_mc_max_depth ){
813 XBT_DEBUG("Pair %d (depth = %d) shifted in stack, maximum depth reached", current_pair->num, xbt_fifo_size(mc_stack_liveness) );
815 XBT_DEBUG("Pair %d (depth = %d) shifted in stack", current_pair->num, xbt_fifo_size(mc_stack_liveness) );
820 xbt_dynar_free(&prop_values);
821 current_pair = xbt_fifo_shift(mc_stack_liveness);
822 current_pair->stack_removed = 1;
823 if(current_pair->search_cycle){
824 remove_acceptance_pair(current_pair);
826 if(_sg_mc_visited == 0)
827 MC_pair_delete(current_pair);
828 else if(current_pair->visited_removed)
829 MC_pair_delete(current_pair);