4 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(mc_liveness, mc,
5 "Logging specific to algorithms for liveness properties verification");
7 xbt_fifo_t reached_pairs;
8 xbt_fifo_t visited_pairs;
9 xbt_fifo_t visited_pairs_hash;
10 xbt_dynar_t successors;
12 int snapshot_compare(mc_snapshot_t s1, mc_snapshot_t s2){
15 if(s1->num_reg != s2->num_reg){
16 //XBT_DEBUG("Different num_reg (s1 = %d, s2 = %d)", s1->num_reg, s2->num_reg);
22 for(i=0 ; i< s1->num_reg ; i++){
24 if(s1->regions[i]->type != s2->regions[i]->type){
25 //XBT_DEBUG("Different type of region");
29 switch(s1->regions[i]->type){
31 if(s1->regions[i]->size != s2->regions[i]->size){
32 //XBT_DEBUG("Different size of heap (s1 = %Zu, s2 = %Zu)", s1->regions[i]->size, s2->regions[i]->size);
35 if(s1->regions[i]->start_addr != s2->regions[i]->start_addr){
36 //XBT_DEBUG("Different start addr of heap (s1 = %p, s2 = %p)", s1->regions[i]->start_addr, s2->regions[i]->start_addr);
39 if(mmalloc_compare_heap(s1->regions[i]->data, s2->regions[i]->data)){
40 //XBT_DEBUG("Different heap (mmalloc_compare)");
45 if(s1->regions[i]->size != s2->regions[i]->size){
46 //XBT_DEBUG("Different size of libsimgrid (s1 = %Zu, s2 = %Zu)", s1->regions[i]->size, s2->regions[i]->size);
49 if(s1->regions[i]->start_addr != s2->regions[i]->start_addr){
50 //XBT_DEBUG("Different start addr of libsimgrid (s1 = %p, s2 = %p)", s1->regions[i]->start_addr, s2->regions[i]->start_addr);
53 if(memcmp(s1->regions[i]->data, s2->regions[i]->data, s1->regions[i]->size) != 0){
54 //XBT_DEBUG("Different memcmp for data in libsimgrid");
59 if(s1->regions[i]->size != s2->regions[i]->size){
60 //XBT_DEBUG("Different size of program (s1 = %Zu, s2 = %Zu)", s1->regions[i]->size, s2->regions[i]->size);
63 if(s1->regions[i]->start_addr != s2->regions[i]->start_addr){
64 //XBT_DEBUG("Different start addr of program (s1 = %p, s2 = %p)", s1->regions[i]->start_addr, s2->regions[i]->start_addr);
67 if(memcmp(s1->regions[i]->data, s2->regions[i]->data, s1->regions[i]->size) != 0){
68 //XBT_DEBUG("Different memcmp for data in program");
73 if(s1->regions[i]->size != s2->regions[i]->size){
74 //XBT_DEBUG("Different size of stack (s1 = %Zu, s2 = %Zu)", s1->regions[i]->size, s2->regions[i]->size);
77 if(s1->regions[i]->start_addr != s2->regions[i]->start_addr){
78 //XBT_DEBUG("Different start addr of stack (s1 = %p, s2 = %p)", s1->regions[i]->start_addr, s2->regions[i]->start_addr);
81 if(memcmp(s1->regions[i]->data, s2->regions[i]->data, s1->regions[i]->size) != 0){
82 //XBT_DEBUG("Different memcmp for data in stack");
91 int reached(xbt_state_t st){
94 if(xbt_fifo_size(reached_pairs) == 0){
102 mc_snapshot_t sn = xbt_new0(s_mc_snapshot_t, 1);
103 MC_take_snapshot_liveness(sn);
105 xbt_dynar_t prop_ato = xbt_dynar_new(sizeof(int), NULL);
109 /* Get values of propositional symbols */
110 unsigned int cursor = 0;
111 xbt_propositional_symbol_t ps = NULL;
112 xbt_dynar_foreach(automaton->propositional_symbols, cursor, ps){
115 xbt_dynar_push_as(prop_ato, int, res);
119 xbt_fifo_item_t item = xbt_fifo_get_first_item(reached_pairs);
120 mc_pair_reached_t pair_test = NULL;
123 while(i < xbt_fifo_size(reached_pairs) && item != NULL){
125 pair_test = (mc_pair_reached_t) xbt_fifo_get_item_content(item);
127 if(pair_test != NULL){
128 if(automaton_state_compare(pair_test->automaton_state, st) == 0){
129 if(propositional_symbols_compare_value(pair_test->prop_ato, prop_ato) == 0){
130 if(snapshot_compare(sn, pair_test->system_state) == 0){
132 MC_free_snapshot(sn);
133 xbt_dynar_reset(prop_ato);
142 item = xbt_fifo_get_next_item(item);
148 MC_free_snapshot(sn);
149 xbt_dynar_reset(prop_ato);
157 void set_pair_reached(xbt_state_t st){
162 mc_pair_reached_t pair = NULL;
163 pair = xbt_new0(s_mc_pair_reached_t, 1);
164 pair->automaton_state = st;
165 pair->prop_ato = xbt_dynar_new(sizeof(int), NULL);
166 pair->system_state = xbt_new0(s_mc_snapshot_t, 1);
167 MC_take_snapshot_liveness(pair->system_state);
169 /* Get values of propositional symbols */
170 unsigned int cursor = 0;
171 xbt_propositional_symbol_t ps = NULL;
175 xbt_dynar_foreach(automaton->propositional_symbols, cursor, ps){
178 xbt_dynar_push_as(pair->prop_ato, int, res);
181 xbt_fifo_unshift(reached_pairs, pair);
187 int visited(xbt_state_t st, int sc){
190 if(xbt_fifo_size(visited_pairs) == 0){
198 mc_snapshot_t sn = xbt_new0(s_mc_snapshot_t, 1);
199 MC_take_snapshot_liveness(sn);
201 xbt_dynar_t prop_ato = xbt_dynar_new(sizeof(int), NULL);
203 /* Get values of propositional symbols */
204 unsigned int cursor = 0;
205 xbt_propositional_symbol_t ps = NULL;
209 xbt_dynar_foreach(automaton->propositional_symbols, cursor, ps){
212 xbt_dynar_push_as(prop_ato, int, res);
216 xbt_fifo_item_t item = xbt_fifo_get_first_item(visited_pairs);
217 mc_pair_visited_t pair_test = NULL;
219 while(i < xbt_fifo_size(visited_pairs) && item != NULL){
221 pair_test = (mc_pair_visited_t) xbt_fifo_get_item_content(item);
223 if(pair_test != NULL){
224 if(pair_test->search_cycle == sc) {
225 if(automaton_state_compare(pair_test->automaton_state, st) == 0){
226 if(propositional_symbols_compare_value(pair_test->prop_ato, prop_ato) == 0){
227 if(snapshot_compare(pair_test->system_state, sn) == 0){
229 MC_free_snapshot(sn);
230 xbt_dynar_reset(prop_ato);
243 item = xbt_fifo_get_next_item(item);
250 MC_free_snapshot(sn);
251 xbt_dynar_reset(prop_ato);
260 int visited_hash(xbt_state_t st, int sc){
263 if(xbt_fifo_size(visited_pairs_hash) == 0){
271 mc_snapshot_t sn = xbt_new0(s_mc_snapshot_t, 1);
272 MC_take_snapshot_liveness(sn);
276 xbt_dynar_t prop_ato = xbt_dynar_new(sizeof(int), NULL);
278 /* Get values of propositional symbols */
279 unsigned int cursor = 0;
280 xbt_propositional_symbol_t ps = NULL;
284 xbt_dynar_foreach(automaton->propositional_symbols, cursor, ps){
287 xbt_dynar_push_as(prop_ato, int, res);
290 xbt_fifo_item_t item = xbt_fifo_get_first_item(visited_pairs_hash);
291 mc_pair_visited_hash_t pair_test = NULL;
293 while(i < xbt_fifo_size(visited_pairs_hash) && item != NULL){
295 pair_test = (mc_pair_visited_hash_t) xbt_fifo_get_item_content(item);
297 if(pair_test != NULL){
298 if(pair_test->search_cycle == sc) {
299 if(automaton_state_compare(pair_test->automaton_state, st) == 0){
300 if(propositional_symbols_compare_value(pair_test->prop_ato, prop_ato) == 0){
301 for(j=0 ; j< sn->num_reg ; j++){
302 if(xbt_dict_get_or_null_ext(pair_test->hash_regions, sn->regions[j]->data, sn->regions[j]->size) == NULL){
306 MC_free_snapshot(sn);
307 xbt_dynar_reset(prop_ato);
316 item = xbt_fifo_get_next_item(item);
323 MC_free_snapshot(sn);
324 xbt_dynar_reset(prop_ato);
332 void set_pair_visited_hash(xbt_state_t st, int sc){
337 mc_snapshot_t sn = xbt_new0(s_mc_snapshot_t, 1);
338 MC_take_snapshot_liveness(sn);
340 mc_pair_visited_hash_t pair = NULL;
341 pair = xbt_new0(s_mc_pair_visited_hash_t, 1);
342 pair->automaton_state = st;
343 pair->prop_ato = xbt_dynar_new(sizeof(int), NULL);
344 pair->search_cycle = sc;
345 pair->hash_regions = xbt_dict_new();
349 for(i=0 ; i< sn->num_reg ; i++){
350 switch(sn->regions[i]->type){
352 xbt_dict_set_ext(pair->hash_regions, sn->regions[i]->data, sn->regions[i]->size, "heap", NULL);
355 xbt_dict_set_ext(pair->hash_regions, sn->regions[i]->data, sn->regions[i]->size, "libsimgrid", NULL);
358 xbt_dict_set_ext(pair->hash_regions, sn->regions[i]->data, sn->regions[i]->size, "prog", NULL);
363 /* Get values of propositional symbols */
364 unsigned int cursor = 0;
365 xbt_propositional_symbol_t ps = NULL;
369 xbt_dynar_foreach(automaton->propositional_symbols, cursor, ps){
372 xbt_dynar_push_as(pair->prop_ato, int, res);
375 xbt_fifo_unshift(visited_pairs_hash, pair);
377 MC_free_snapshot(sn);
384 void set_pair_visited(xbt_state_t st, int sc){
389 mc_pair_visited_t pair = NULL;
390 pair = xbt_new0(s_mc_pair_visited_t, 1);
391 pair->automaton_state = st;
392 pair->prop_ato = xbt_dynar_new(sizeof(int), NULL);
393 pair->search_cycle = sc;
394 pair->system_state = xbt_new0(s_mc_snapshot_t, 1);
395 MC_take_snapshot_liveness(pair->system_state);
398 /* Get values of propositional symbols */
399 unsigned int cursor = 0;
400 xbt_propositional_symbol_t ps = NULL;
404 xbt_dynar_foreach(automaton->propositional_symbols, cursor, ps){
407 xbt_dynar_push_as(pair->prop_ato, int, res);
410 xbt_fifo_unshift(visited_pairs, pair);
417 void MC_pair_delete(mc_pair_t pair){
418 xbt_free(pair->graph_state->proc_status);
419 xbt_free(pair->graph_state);
425 int MC_automaton_evaluate_label(xbt_exp_label_t l){
429 int left_res = MC_automaton_evaluate_label(l->u.or_and.left_exp);
430 int right_res = MC_automaton_evaluate_label(l->u.or_and.right_exp);
431 return (left_res || right_res);
435 int left_res = MC_automaton_evaluate_label(l->u.or_and.left_exp);
436 int right_res = MC_automaton_evaluate_label(l->u.or_and.right_exp);
437 return (left_res && right_res);
441 int res = MC_automaton_evaluate_label(l->u.exp_not);
446 unsigned int cursor = 0;
447 xbt_propositional_symbol_t p = NULL;
448 xbt_dynar_foreach(automaton->propositional_symbols, cursor, p){
449 if(strcmp(p->pred, l->u.predicat) == 0){
450 int (*f)() = p->function;
470 /********************* Double-DFS stateless *******************/
472 void MC_pair_stateless_delete(mc_pair_stateless_t pair){
473 xbt_free(pair->graph_state->proc_status);
474 xbt_free(pair->graph_state);
478 mc_pair_stateless_t new_pair_stateless(mc_state_t sg, xbt_state_t st, int r){
479 mc_pair_stateless_t p = NULL;
480 p = xbt_new0(s_mc_pair_stateless_t, 1);
481 p->automaton_state = st;
484 mc_stats_pair->expanded_pairs++;
488 void MC_ddfs_stateless_init(){
490 XBT_DEBUG("**************************************************");
491 XBT_DEBUG("Double-DFS stateless init");
492 XBT_DEBUG("**************************************************");
494 mc_pair_stateless_t mc_initial_pair = NULL;
495 mc_state_t initial_graph_state = NULL;
496 smx_process_t process;
498 MC_wait_for_requests();
502 initial_graph_state = MC_state_pair_new();
503 xbt_swag_foreach(process, simix_global->process_list){
504 if(MC_process_is_enabled(process)){
505 MC_state_interleave_process(initial_graph_state, process);
509 reached_pairs = xbt_fifo_new();
510 //visited_pairs = xbt_fifo_new();
511 visited_pairs_hash = xbt_fifo_new();
512 successors = xbt_dynar_new(sizeof(mc_pair_stateless_t), NULL);
514 /* Save the initial state */
515 initial_snapshot_liveness = xbt_new0(s_mc_snapshot_t, 1);
516 MC_take_snapshot_to_restore_liveness(initial_snapshot_liveness);
520 unsigned int cursor = 0;
523 xbt_dynar_foreach(automaton->states, cursor, state){
524 if(state->type == -1){
527 mc_initial_pair = new_pair_stateless(initial_graph_state, state, MC_state_interleave_size(initial_graph_state));
528 xbt_fifo_unshift(mc_stack_liveness_stateless, mc_initial_pair);
532 MC_restore_snapshot(initial_snapshot_liveness);
536 MC_ddfs_stateless(0);
539 if(state->type == 2){
542 mc_initial_pair = new_pair_stateless(initial_graph_state, state, MC_state_interleave_size(initial_graph_state));
543 xbt_fifo_unshift(mc_stack_liveness_stateless, mc_initial_pair);
546 set_pair_reached(state);
549 MC_restore_snapshot(initial_snapshot_liveness);
553 MC_ddfs_stateless(1);
562 void MC_ddfs_stateless(int search_cycle){
564 smx_process_t process;
565 mc_pair_stateless_t current_pair = NULL;
567 if(xbt_fifo_size(mc_stack_liveness_stateless) == 0)
571 /* Get current pair */
572 current_pair = (mc_pair_stateless_t)xbt_fifo_get_item_content(xbt_fifo_get_first_item(mc_stack_liveness_stateless));
574 /* Update current state in buchi automaton */
575 automaton->current_state = current_pair->automaton_state;
578 XBT_DEBUG("********************* ( Depth = %d, search_cycle = %d )", xbt_fifo_size(mc_stack_liveness_stateless), search_cycle);
579 XBT_DEBUG("Pair : graph=%p, automaton=%p(%s), %u interleave", current_pair->graph_state, current_pair->automaton_state, current_pair->automaton_state->id, MC_state_interleave_size(current_pair->graph_state));
581 mc_stats_pair->visited_pairs++;
586 mc_state_t next_graph_state = NULL;
587 smx_req_t req = NULL;
590 xbt_transition_t transition_succ;
591 unsigned int cursor = 0;
594 mc_pair_stateless_t next_pair = NULL;
595 mc_pair_stateless_t pair_succ;
597 if(xbt_fifo_size(mc_stack_liveness_stateless) < MAX_DEPTH_LIVENESS){
599 //set_pair_visited(current_pair->automaton_state, search_cycle);
600 set_pair_visited_hash(current_pair->automaton_state, search_cycle);
602 //XBT_DEBUG("Visited pairs : %d", xbt_fifo_size(visited_pairs));
603 //XBT_DEBUG("Visited pairs : %d", xbt_fifo_size(visited_pairs_hash));
605 if(current_pair->requests > 0){
607 while((req = MC_state_get_request(current_pair->graph_state, &value)) != NULL){
609 /* Debug information */
610 if(XBT_LOG_ISENABLED(mc_liveness, xbt_log_priority_debug)){
611 req_str = MC_request_to_string(req, value);
612 XBT_DEBUG("Execute: %s", req_str);
616 MC_state_set_executed_request(current_pair->graph_state, req, value);
618 /* Answer the request */
619 SIMIX_request_pre(req, value);
621 /* Wait for requests (schedules processes) */
622 MC_wait_for_requests();
627 /* Create the new expanded graph_state */
628 next_graph_state = MC_state_pair_new();
630 /* Get enabled process and insert it in the interleave set of the next graph_state */
631 xbt_swag_foreach(process, simix_global->process_list){
632 if(MC_process_is_enabled(process)){
633 MC_state_interleave_process(next_graph_state, process);
637 xbt_dynar_reset(successors);
643 xbt_dynar_foreach(current_pair->automaton_state->out, cursor, transition_succ){
645 res = MC_automaton_evaluate_label(transition_succ->label);
647 if(res == 1){ // enabled transition in automaton
649 next_pair = new_pair_stateless(next_graph_state, transition_succ->dst, MC_state_interleave_size(next_graph_state));
650 xbt_dynar_push(successors, &next_pair);
658 xbt_dynar_foreach(current_pair->automaton_state->out, cursor, transition_succ){
660 res = MC_automaton_evaluate_label(transition_succ->label);
662 if(res == 2){ // true transition in automaton
664 next_pair = new_pair_stateless(next_graph_state, transition_succ->dst, MC_state_interleave_size(next_graph_state));
665 xbt_dynar_push(successors, &next_pair);
673 xbt_dynar_foreach(successors, cursor, pair_succ){
675 //if(!visited(pair_succ->automaton_state, search_cycle)){
676 if(!visited_hash(pair_succ->automaton_state, search_cycle)){
678 if(search_cycle == 1){
680 if((pair_succ->automaton_state->type == 1) || (pair_succ->automaton_state->type == 2)){
682 if(reached(pair_succ->automaton_state) == 1){
684 XBT_DEBUG("Next pair (depth = %d, %d interleave) already reached !", xbt_fifo_size(mc_stack_liveness_stateless) + 1, MC_state_interleave_size(pair_succ->graph_state));
686 XBT_INFO("*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*");
687 XBT_INFO("| ACCEPTANCE CYCLE |");
688 XBT_INFO("*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*");
689 XBT_INFO("Counter-example that violates formula :");
690 MC_show_stack_liveness_stateless(mc_stack_liveness_stateless);
691 MC_dump_stack_liveness_stateless(mc_stack_liveness_stateless);
692 MC_print_statistics_pairs(mc_stats_pair);
697 XBT_DEBUG("Next pair (depth =%d) -> Acceptance pair : graph=%p, automaton=%p(%s)", xbt_fifo_size(mc_stack_liveness_stateless) + 1, pair_succ->graph_state, pair_succ->automaton_state, pair_succ->automaton_state->id);
699 set_pair_reached(pair_succ->automaton_state);
701 XBT_DEBUG("Reached pairs : %d", xbt_fifo_size(reached_pairs));
709 if(((pair_succ->automaton_state->type == 1) || (pair_succ->automaton_state->type == 2))){
711 XBT_DEBUG("Next pair (depth =%d) -> Acceptance pair : graph=%p, automaton=%p(%s)", xbt_fifo_size(mc_stack_liveness_stateless) + 1, pair_succ->graph_state, pair_succ->automaton_state, pair_succ->automaton_state->id);
713 set_pair_reached(pair_succ->automaton_state);
717 XBT_DEBUG("Reached pairs : %d", xbt_fifo_size(reached_pairs));
724 xbt_fifo_unshift(mc_stack_liveness_stateless, pair_succ);
727 MC_ddfs_stateless(search_cycle);
729 /* Restore system before checking others successors */
730 if(cursor != (xbt_dynar_length(successors) - 1))
731 MC_replay_liveness(mc_stack_liveness_stateless, 1);
735 XBT_DEBUG("Next pair already visited");
737 if(search_cycle == 1){
739 if((pair_succ->automaton_state->type == 1) || (pair_succ->automaton_state->type == 2)){
741 if(reached(pair_succ->automaton_state) == 1){
743 XBT_DEBUG("Next pair (depth = %d, %d interleave) already reached !", xbt_fifo_size(mc_stack_liveness_stateless) + 1, MC_state_interleave_size(pair_succ->graph_state));
745 XBT_INFO("*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*");
746 XBT_INFO("| ACCEPTANCE CYCLE |");
747 XBT_INFO("*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*");
748 XBT_INFO("Counter-example that violates formula :");
749 MC_show_stack_liveness_stateless(mc_stack_liveness_stateless);
750 MC_dump_stack_liveness_stateless(mc_stack_liveness_stateless);
751 MC_print_statistics_pairs(mc_stats_pair);
762 if(MC_state_interleave_size(current_pair->graph_state) > 0){
763 XBT_DEBUG("Backtracking to depth %u", xbt_fifo_size(mc_stack_liveness_stateless));
764 MC_replay_liveness(mc_stack_liveness_stateless, 0);
769 }else{ /*No request to execute, search evolution in Büchi automaton */
773 /* Create the new expanded graph_state */
774 next_graph_state = MC_state_pair_new();
776 xbt_dynar_reset(successors);
782 xbt_dynar_foreach(current_pair->automaton_state->out, cursor, transition_succ){
784 res = MC_automaton_evaluate_label(transition_succ->label);
786 if(res == 1){ // enabled transition in automaton
788 next_pair = new_pair_stateless(next_graph_state, transition_succ->dst, MC_state_interleave_size(next_graph_state));
789 xbt_dynar_push(successors, &next_pair);
797 xbt_dynar_foreach(current_pair->automaton_state->out, cursor, transition_succ){
799 res = MC_automaton_evaluate_label(transition_succ->label);
801 if(res == 2){ // true transition in automaton
803 next_pair = new_pair_stateless(next_graph_state, transition_succ->dst, MC_state_interleave_size(next_graph_state));
804 xbt_dynar_push(successors, &next_pair);
812 xbt_dynar_foreach(successors, cursor, pair_succ){
814 //if(!visited(pair_succ->automaton_state, search_cycle)){
815 if(!visited_hash(pair_succ->automaton_state, search_cycle)){
817 if(search_cycle == 1){
819 if((pair_succ->automaton_state->type == 1) || (pair_succ->automaton_state->type == 2)){
821 if(reached(pair_succ->automaton_state) == 1){
823 XBT_DEBUG("Next pair (depth = %d) already reached !", xbt_fifo_size(mc_stack_liveness_stateless) + 1);
825 XBT_INFO("*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*");
826 XBT_INFO("| ACCEPTANCE CYCLE |");
827 XBT_INFO("*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*");
828 XBT_INFO("Counter-example that violates formula :");
829 MC_show_stack_liveness_stateless(mc_stack_liveness_stateless);
830 MC_dump_stack_liveness_stateless(mc_stack_liveness_stateless);
831 MC_print_statistics_pairs(mc_stats_pair);
836 XBT_DEBUG("Next pair (depth =%d) -> Acceptance pair : graph=%p, automaton=%p(%s)", xbt_fifo_size(mc_stack_liveness_stateless) + 1, pair_succ->graph_state, pair_succ->automaton_state, pair_succ->automaton_state->id);
838 set_pair_reached(pair_succ->automaton_state);
840 XBT_DEBUG("Reached pairs : %d", xbt_fifo_size(reached_pairs));
848 if(((pair_succ->automaton_state->type == 1) || (pair_succ->automaton_state->type == 2))){
850 set_pair_reached(pair_succ->automaton_state);
854 XBT_DEBUG("Reached pairs : %d", xbt_fifo_size(reached_pairs));
861 xbt_fifo_unshift(mc_stack_liveness_stateless, pair_succ);
864 MC_ddfs_stateless(search_cycle);
866 /* Restore system before checking others successors */
867 if(cursor != xbt_dynar_length(successors) - 1)
868 MC_replay_liveness(mc_stack_liveness_stateless, 1);
872 XBT_DEBUG("Next pair already visited");
874 if(search_cycle == 1){
876 if((pair_succ->automaton_state->type == 1) || (pair_succ->automaton_state->type == 2)){
878 if(reached(pair_succ->automaton_state) == 1){
880 XBT_DEBUG("Next pair (depth = %d, %d interleave) already reached !", xbt_fifo_size(mc_stack_liveness_stateless) + 1, MC_state_interleave_size(pair_succ->graph_state));
882 XBT_INFO("*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*");
883 XBT_INFO("| ACCEPTANCE CYCLE |");
884 XBT_INFO("*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*");
885 XBT_INFO("Counter-example that violates formula :");
886 MC_show_stack_liveness_stateless(mc_stack_liveness_stateless);
887 MC_dump_stack_liveness_stateless(mc_stack_liveness_stateless);
888 MC_print_statistics_pairs(mc_stats_pair);
904 XBT_DEBUG("Max depth reached");
908 if(xbt_fifo_size(mc_stack_liveness_stateless) == MAX_DEPTH_LIVENESS ){
909 XBT_DEBUG("Pair (graph=%p, automaton =%p, search_cycle = %u, depth = %d) shifted in stack, maximum depth reached", current_pair->graph_state, current_pair->automaton_state, search_cycle, xbt_fifo_size(mc_stack_liveness_stateless) );
911 XBT_DEBUG("Pair (graph=%p, automaton =%p, search_cycle = %u, depth = %d) shifted in stack", current_pair->graph_state, current_pair->automaton_state, search_cycle, xbt_fifo_size(mc_stack_liveness_stateless) );
916 xbt_fifo_shift(mc_stack_liveness_stateless);
917 if((current_pair->automaton_state->type == 1) || (current_pair->automaton_state->type == 2)){
918 xbt_fifo_shift(reached_pairs);