X-Git-Url: http://info.iut-bm.univ-fcomte.fr/pub/gitweb/simgrid.git/blobdiff_plain/bafef7b73131ceb40d273d98b1850823329ee689..75840f2cdbae984b040060e55903f069a225e9f0:/src/mc/mc_liveness.c diff --git a/src/mc/mc_liveness.c b/src/mc/mc_liveness.c index e1b7444da2..4717fcd02c 100644 --- a/src/mc/mc_liveness.c +++ b/src/mc/mc_liveness.c @@ -1,4 +1,5 @@ -/* Copyright (c) 2008-2012 Da SimGrid Team. All rights reserved. */ +/* Copyright (c) 2011-2014. The SimGrid Team. + * All rights reserved. */ /* This program is free software; you can redistribute it and/or modify it * under the terms of the license (GNU LGPL) which comes with this package. */ @@ -10,654 +11,541 @@ XBT_LOG_NEW_DEFAULT_SUBCATEGORY(mc_liveness, mc, "Logging specific to algorithms for liveness properties verification"); -xbt_dynar_t reached_pairs; +/********* Global variables *********/ + +xbt_dynar_t acceptance_pairs; xbt_dynar_t successors; +xbt_parmap_t parmap; + +/********* Static functions *********/ -int create_dump(int pair) +static xbt_dynar_t get_atomic_propositions_values() { - // Try to enable core dumps - struct rlimit core_limit; - core_limit.rlim_cur = RLIM_INFINITY; - core_limit.rlim_max = RLIM_INFINITY; - - if(setrlimit(RLIMIT_CORE, &core_limit) < 0) - fprintf(stderr, "setrlimit: %s\nWarning: core dumps may be truncated or non-existant\n", strerror(errno)); - - int status; - switch(fork()){ - case 0: - // We are the child process -- run the actual program - xbt_abort(); - break; - - case -1: - // An error occurred, shouldn't happen - perror("fork"); - return -1; - - default: - // We are the parent process -- wait for the child process to exit - if(wait(&status) < 0) - perror("wait"); - if(WIFSIGNALED(status) && WCOREDUMP(status)){ - char *core_name = malloc(20); - sprintf(core_name,"core_%d", pair); - rename("core", core_name); - free(core_name); - } + int res; + int_f_void_t f; + unsigned int cursor = 0; + xbt_automaton_propositional_symbol_t ps = NULL; + xbt_dynar_t values = xbt_dynar_new(sizeof(int), NULL); + + xbt_dynar_foreach(_mc_property_automaton->propositional_symbols, cursor, ps) { + f = (int_f_void_t) ps->function; + res = f(); + xbt_dynar_push_as(values, int, res); } - return 0; + return values; } -int reached(xbt_state_t st){ - raw_mem_set = (mmalloc_get_current_heap() == raw_heap); +static mc_visited_pair_t is_reached_acceptance_pair(int pair_num, + xbt_automaton_state_t + automaton_state, + xbt_dynar_t + atomic_propositions) +{ - MC_SET_RAW_MEM; + int raw_mem_set = (mmalloc_get_current_heap() == mc_heap); - mc_pair_reached_t new_pair = NULL; - new_pair = xbt_new0(s_mc_pair_reached_t, 1); - new_pair->nb = xbt_dynar_length(reached_pairs) + 1; - new_pair->automaton_state = st; - new_pair->prop_ato = xbt_dynar_new(sizeof(int), NULL); - new_pair->system_state = MC_take_snapshot_liveness(); - - /* Get values of propositional symbols */ - int res; - int_f_void_t f; - unsigned int cursor = 0; - xbt_propositional_symbol_t ps = NULL; - xbt_dynar_foreach(_mc_property_automaton->propositional_symbols, cursor, ps){ - f = (int_f_void_t)ps->function; - res = (*f)(); - xbt_dynar_push_as(new_pair->prop_ato, int, res); - } - - MC_UNSET_RAW_MEM; - - if(xbt_dynar_is_empty(reached_pairs)/* || !compare*/){ - - MC_SET_RAW_MEM; - /* New pair reached */ - xbt_dynar_push(reached_pairs, &new_pair); - MC_UNSET_RAW_MEM; - - if(raw_mem_set) - MC_SET_RAW_MEM; - - return 0; - - }else{ - - MC_SET_RAW_MEM; - - cursor = 0; - mc_pair_reached_t pair_test = NULL; - - xbt_dynar_foreach(reached_pairs, cursor, pair_test){ - XBT_INFO("Pair reached #%d", pair_test->nb); - if(automaton_state_compare(pair_test->automaton_state, st) == 0){ - if(propositional_symbols_compare_value(pair_test->prop_ato, new_pair->prop_ato) == 0){ - if(snapshot_compare(new_pair->system_state, pair_test->system_state) == 0){ - - if(raw_mem_set) - MC_SET_RAW_MEM; - else - MC_UNSET_RAW_MEM; - - return 1; - } - }else{ - XBT_INFO("Different values of propositional symbols"); + MC_SET_MC_HEAP; + + mc_visited_pair_t pair = NULL; + pair = MC_visited_pair_new(pair_num, automaton_state, atomic_propositions); + pair->acceptance_pair = 1; + + if (xbt_dynar_is_empty(acceptance_pairs)) { + + xbt_dynar_push(acceptance_pairs, &pair); + + } else { + + int min = -1, max = -1, index; + //int res; + mc_visited_pair_t pair_test; + int cursor; + + index = get_search_interval(acceptance_pairs, pair, &min, &max); + + if (min != -1 && max != -1) { // Acceptance pair with same number of processes and same heap bytes used exists + + // Parallell implementation + /*res = xbt_parmap_mc_apply(parmap, snapshot_compare, xbt_dynar_get_ptr(acceptance_pairs, min), (max-min)+1, pair); + if(res != -1){ + if(!raw_mem_set) + MC_SET_STD_HEAP; + return ((mc_pair_t)xbt_dynar_get_as(acceptance_pairs, (min+res)-1, mc_pair_t))->num; + } */ + + cursor = min; + while (cursor <= max) { + pair_test = + (mc_visited_pair_t) xbt_dynar_get_as(acceptance_pairs, cursor, + mc_visited_pair_t); + if (xbt_automaton_state_compare + (pair_test->automaton_state, pair->automaton_state) == 0) { + if (xbt_automaton_propositional_symbols_compare_value + (pair_test->atomic_propositions, + pair->atomic_propositions) == 0) { + if (snapshot_compare(pair_test, pair) == 0) { + XBT_INFO("Pair %d already reached (equal to pair %d) !", + pair->num, pair_test->num); + + xbt_fifo_shift(mc_stack); + if (dot_output != NULL) + fprintf(dot_output, "\"%d\" -> \"%d\" [%s];\n", + initial_global_state->prev_pair, pair_test->num, + initial_global_state->prev_req); + + if (!raw_mem_set) + MC_SET_STD_HEAP; + + return NULL; + } + } } - }else{ - XBT_INFO("Different automaton state"); + cursor++; + } + xbt_dynar_insert_at(acceptance_pairs, min, &pair); + } else { + pair_test = + (mc_visited_pair_t) xbt_dynar_get_as(acceptance_pairs, index, + mc_visited_pair_t); + if (pair_test->nb_processes < pair->nb_processes) { + xbt_dynar_insert_at(acceptance_pairs, index + 1, &pair); + } else { + if (pair_test->heap_bytes_used < pair->heap_bytes_used) + xbt_dynar_insert_at(acceptance_pairs, index + 1, &pair); + else + xbt_dynar_insert_at(acceptance_pairs, index, &pair); } } - /* New pair reached */ - xbt_dynar_push(reached_pairs, &new_pair); - - MC_UNSET_RAW_MEM; - - if(raw_mem_set) - MC_SET_RAW_MEM; - - compare = 0; - - return 0; - } -} + if (!raw_mem_set) + MC_SET_STD_HEAP; -void set_pair_reached(xbt_state_t st){ + return pair; - raw_mem_set = (mmalloc_get_current_heap() == raw_heap); - - MC_SET_RAW_MEM; +} - mc_pair_reached_t pair = NULL; - pair = xbt_new0(s_mc_pair_reached_t, 1); - pair->nb = xbt_dynar_length(reached_pairs) + 1; - pair->automaton_state = st; - pair->prop_ato = xbt_dynar_new(sizeof(int), NULL); - pair->system_state = MC_take_snapshot_liveness(); +static void remove_acceptance_pair(int pair_num) +{ + + int raw_mem_set = (mmalloc_get_current_heap() == mc_heap); + + MC_SET_MC_HEAP; - /* Get values of propositional symbols */ unsigned int cursor = 0; - xbt_propositional_symbol_t ps = NULL; - int res; - int_f_void_t f; + mc_visited_pair_t pair_test = NULL; - xbt_dynar_foreach(_mc_property_automaton->propositional_symbols, cursor, ps){ - f = (int_f_void_t)ps->function; - res = (*f)(); - xbt_dynar_push_as(pair->prop_ato, int, res); + xbt_dynar_foreach(acceptance_pairs, cursor, pair_test) { + if (pair_test->num == pair_num) { + break; + } } - xbt_dynar_push(reached_pairs, &pair); - - MC_UNSET_RAW_MEM; + xbt_dynar_remove_at(acceptance_pairs, cursor, &pair_test); - if(raw_mem_set) - MC_SET_RAW_MEM; - -} + pair_test->acceptance_removed = 1; -void MC_pair_delete(mc_pair_t pair){ - xbt_free(pair->graph_state->proc_status); - xbt_free(pair->graph_state); - xbt_free(pair); + if (_sg_mc_visited == 0) { + MC_visited_pair_delete(pair_test); + } else if (pair_test->visited_removed == 1) { + MC_visited_pair_delete(pair_test); + } + + if (!raw_mem_set) + MC_SET_STD_HEAP; } +static int MC_automaton_evaluate_label(xbt_automaton_exp_label_t l, + xbt_dynar_t atomic_propositions_values) +{ -int MC_automaton_evaluate_label(xbt_exp_label_t l){ - - switch(l->type){ - case 0 : { - int left_res = MC_automaton_evaluate_label(l->u.or_and.left_exp); - int right_res = MC_automaton_evaluate_label(l->u.or_and.right_exp); - return (left_res || right_res); - } - case 1 : { - int left_res = MC_automaton_evaluate_label(l->u.or_and.left_exp); - int right_res = MC_automaton_evaluate_label(l->u.or_and.right_exp); - return (left_res && right_res); - } - case 2 : { - int res = MC_automaton_evaluate_label(l->u.exp_not); - return (!res); - } - case 3 : { - unsigned int cursor = 0; - xbt_propositional_symbol_t p = NULL; - int_f_void_t f; - xbt_dynar_foreach(_mc_property_automaton->propositional_symbols, cursor, p){ - if(strcmp(p->pred, l->u.predicat) == 0){ - f = (int_f_void_t)p->function; - return (*f)(); + 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); + 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); + return (left_res && right_res); + } + case 2:{ + int res = + MC_automaton_evaluate_label(l->u.exp_not, atomic_propositions_values); + return (!res); + } + case 3:{ + unsigned int cursor = 0; + xbt_automaton_propositional_symbol_t p = NULL; + xbt_dynar_foreach(_mc_property_automaton->propositional_symbols, cursor, + p) { + if (strcmp(p->pred, l->u.predicat) == 0) + return (int) xbt_dynar_get_as(atomic_propositions_values, cursor, + int); } + return -1; } - return -1; - } - case 4 : { - return 2; - } - default : + case 4:{ + return 2; + } + default: return -1; } } +void MC_pre_modelcheck_liveness(void) +{ -/********************* Double-DFS stateless *******************/ - -void pair_stateless_free(mc_pair_stateless_t pair){ - xbt_free(pair->graph_state->system_state); - xbt_free(pair->graph_state->proc_status); - xbt_free(pair->graph_state); - xbt_free(pair); -} - -void pair_stateless_free_voidp(void *p){ - pair_stateless_free((mc_pair_stateless_t) * (void **) p); -} + initial_global_state->raw_mem_set = (mmalloc_get_current_heap() == mc_heap); -mc_pair_stateless_t new_pair_stateless(mc_state_t sg, xbt_state_t st, int r){ - mc_pair_stateless_t p = NULL; - p = xbt_new0(s_mc_pair_stateless_t, 1); - p->automaton_state = st; - p->graph_state = sg; - p->requests = r; - mc_stats_pair->expanded_pairs++; - return p; -} - -void pair_reached_free(mc_pair_reached_t pair){ - if(pair){ - pair->automaton_state = NULL; - xbt_dynar_free(&(pair->prop_ato)); - MC_free_snapshot(pair->system_state); - xbt_free(pair); - } -} - -void pair_reached_free_voidp(void *p){ - pair_reached_free((mc_pair_reached_t) * (void **) p); -} + mc_pair_t initial_pair = NULL; + smx_process_t process; -void MC_ddfs_init(void){ + MC_wait_for_requests(); - raw_mem_set = (mmalloc_get_current_heap() == raw_heap); + MC_SET_MC_HEAP; - XBT_INFO("**************************************************"); - XBT_INFO("Double-DFS init"); - XBT_INFO("**************************************************"); + acceptance_pairs = xbt_dynar_new(sizeof(mc_visited_pair_t), NULL); + visited_pairs = xbt_dynar_new(sizeof(mc_visited_pair_t), NULL); + successors = xbt_dynar_new(sizeof(mc_pair_t), NULL); - mc_pair_stateless_t mc_initial_pair = NULL; - mc_state_t initial_graph_state = NULL; - smx_process_t process; + initial_global_state->snapshot = MC_take_snapshot(0); + initial_global_state->prev_pair = 0; - - MC_wait_for_requests(); + MC_SET_STD_HEAP; - MC_SET_RAW_MEM; + unsigned int cursor = 0; + xbt_automaton_state_t automaton_state; - initial_graph_state = MC_state_pair_new(); - xbt_swag_foreach(process, simix_global->process_list){ - if(MC_process_is_enabled(process)){ - MC_state_interleave_process(initial_graph_state, process); - } - } + xbt_dynar_foreach(_mc_property_automaton->states, cursor, automaton_state) { + if (automaton_state->type == -1) { /* Initial automaton state */ - reached_pairs = xbt_dynar_new(sizeof(mc_pair_reached_t), pair_reached_free_voidp); - successors = xbt_dynar_new(sizeof(mc_pair_stateless_t), NULL); + MC_SET_MC_HEAP; - /* Save the initial state */ - initial_state_liveness = xbt_new0(s_mc_global_t, 1); - initial_state_liveness->initial_snapshot = MC_take_snapshot_liveness(); + initial_pair = MC_pair_new(); + initial_pair->automaton_state = automaton_state; + initial_pair->graph_state = MC_state_new(); + initial_pair->atomic_propositions = get_atomic_propositions_values(); - MC_UNSET_RAW_MEM; - - unsigned int cursor = 0; - xbt_state_t state; - - xbt_dynar_foreach(_mc_property_automaton->states, cursor, state){ - if(state->type == -1){ - - MC_SET_RAW_MEM; - mc_initial_pair = new_pair_stateless(initial_graph_state, state, MC_state_interleave_size(initial_graph_state)); - xbt_fifo_unshift(mc_stack_liveness, mc_initial_pair); - MC_UNSET_RAW_MEM; - - if(cursor != 0){ - MC_restore_snapshot(initial_state_liveness->initial_snapshot); - MC_UNSET_RAW_MEM; + /* Get enabled processes and insert them in the interleave set of the graph_state */ + xbt_swag_foreach(process, simix_global->process_list) { + if (MC_process_is_enabled(process)) { + MC_state_interleave_process(initial_pair->graph_state, process); + } } - MC_ddfs(0); + initial_pair->requests = + MC_state_interleave_size(initial_pair->graph_state); + initial_pair->search_cycle = 0; - }else{ - if(state->type == 2){ - - MC_SET_RAW_MEM; - mc_initial_pair = new_pair_stateless(initial_graph_state, state, MC_state_interleave_size(initial_graph_state)); - xbt_fifo_unshift(mc_stack_liveness, mc_initial_pair); - MC_UNSET_RAW_MEM; + xbt_fifo_unshift(mc_stack, initial_pair); - set_pair_reached(state); + MC_SET_STD_HEAP; - if(cursor != 0){ - MC_restore_snapshot(initial_state_liveness->initial_snapshot); - MC_UNSET_RAW_MEM; - } - - MC_ddfs(1); - + MC_modelcheck_liveness(); + + if (cursor != 0) { + MC_restore_snapshot(initial_global_state->snapshot); + MC_SET_STD_HEAP; } } } - if(raw_mem_set) - MC_SET_RAW_MEM; + if (initial_global_state->raw_mem_set) + MC_SET_MC_HEAP; else - MC_UNSET_RAW_MEM; - + MC_SET_STD_HEAP; -} +} -void MC_ddfs(int search_cycle){ - raw_mem_set = (mmalloc_get_current_heap() == raw_heap); +void MC_modelcheck_liveness() +{ smx_process_t process; - mc_pair_stateless_t current_pair = NULL; + mc_pair_t current_pair = NULL; - if(xbt_fifo_size(mc_stack_liveness) == 0) + if (xbt_fifo_size(mc_stack) == 0) return; - /* Get current pair */ - current_pair = (mc_pair_stateless_t)xbt_fifo_get_item_content(xbt_fifo_get_first_item(mc_stack_liveness)); + current_pair = + (mc_pair_t) xbt_fifo_get_item_content(xbt_fifo_get_first_item(mc_stack)); /* Update current state in buchi automaton */ _mc_property_automaton->current_state = current_pair->automaton_state; - - XBT_DEBUG("********************* ( Depth = %d, search_cycle = %d )", xbt_fifo_size(mc_stack_liveness), search_cycle); - - mc_stats_pair->visited_pairs++; + XBT_DEBUG + ("********************* ( Depth = %d, search_cycle = %d, interleave size %d, pair_num %d)", + xbt_fifo_size(mc_stack), current_pair->search_cycle, + MC_state_interleave_size(current_pair->graph_state), current_pair->num); - //sleep(1); + mc_stats->visited_pairs++; int value; - mc_state_t next_graph_state = NULL; smx_simcall_t req = NULL; char *req_str; - xbt_transition_t transition_succ; + xbt_automaton_transition_t transition_succ; unsigned int cursor = 0; int res; + int visited_num; + + mc_pair_t next_pair = NULL; + xbt_dynar_t prop_values = NULL; + mc_visited_pair_t reached_pair = NULL; + int counter_example_depth = 0; + + if (xbt_fifo_size(mc_stack) < _sg_mc_max_depth) { + + if (current_pair->requests > 0) { + + if (current_pair->search_cycle) { + + if ((current_pair->automaton_state->type == 1) + || (current_pair->automaton_state->type == 2)) { + if ((reached_pair = + is_reached_acceptance_pair(current_pair->num, + current_pair->automaton_state, + current_pair->atomic_propositions)) == + NULL) { + + counter_example_depth = xbt_fifo_size(mc_stack); + XBT_INFO("*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*"); + XBT_INFO("| ACCEPTANCE CYCLE |"); + XBT_INFO("*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*"); + XBT_INFO("Counter-example that violates formula :"); + MC_show_stack_liveness(mc_stack); + MC_dump_stack_liveness(mc_stack); + MC_print_statistics(mc_stats); + XBT_INFO("Counter-example depth : %d", counter_example_depth); + xbt_abort(); - mc_pair_stateless_t next_pair = NULL; - mc_pair_stateless_t pair_succ; - - mc_pair_stateless_t remove_pair; - mc_pair_reached_t remove_pair_reached; - - if(xbt_fifo_size(mc_stack_liveness) < MAX_DEPTH_LIVENESS){ - - if(current_pair->requests > 0){ - - while((req = MC_state_get_request(current_pair->graph_state, &value)) != NULL){ - - /* Debug information */ - - req_str = MC_request_to_string(req, value); - XBT_DEBUG("Execute: %s", req_str); - xbt_free(req_str); - - MC_state_set_executed_request(current_pair->graph_state, req, value); - - /* Answer the request */ - SIMIX_simcall_pre(req, value); - - /* Wait for requests (schedules processes) */ - MC_wait_for_requests(); - - MC_SET_RAW_MEM; - - /* Create the new expanded graph_state */ - next_graph_state = MC_state_pair_new(); - - /* Get enabled process and insert it in the interleave set of the next graph_state */ - xbt_swag_foreach(process, simix_global->process_list){ - if(MC_process_is_enabled(process)){ - MC_state_interleave_process(next_graph_state, process); } } + } - xbt_dynar_reset(successors); - - MC_UNSET_RAW_MEM; - - - cursor= 0; - xbt_dynar_foreach(current_pair->automaton_state->out, cursor, transition_succ){ + if ((visited_num = + is_visited_pair(reached_pair, current_pair->num, + current_pair->automaton_state, + current_pair->atomic_propositions)) != -1) { + + MC_SET_MC_HEAP; + if (dot_output != NULL) + fprintf(dot_output, "\"%d\" -> \"%d\" [%s];\n", + initial_global_state->prev_pair, visited_num, + initial_global_state->prev_req); + MC_SET_STD_HEAP; + + } else { + + while ((req = + MC_state_get_request(current_pair->graph_state, + &value)) != NULL) { + + MC_SET_MC_HEAP; + if (dot_output != NULL) { + if (initial_global_state->prev_pair != 0 + && initial_global_state->prev_pair != current_pair->num) { + fprintf(dot_output, "\"%d\" -> \"%d\" [%s];\n", + initial_global_state->prev_pair, current_pair->num, + initial_global_state->prev_req); + xbt_free(initial_global_state->prev_req); + } + initial_global_state->prev_pair = current_pair->num; + } + MC_SET_STD_HEAP; - res = MC_automaton_evaluate_label(transition_succ->label); + /* Debug information */ + if (XBT_LOG_ISENABLED(mc_liveness, xbt_log_priority_debug)) { + req_str = MC_request_to_string(req, value); + XBT_DEBUG("Execute: %s", req_str); + xbt_free(req_str); + } - if(res == 1){ // enabled transition in automaton - MC_SET_RAW_MEM; - next_pair = new_pair_stateless(next_graph_state, transition_succ->dst, MC_state_interleave_size(next_graph_state)); - xbt_dynar_push(successors, &next_pair); - MC_UNSET_RAW_MEM; + MC_SET_MC_HEAP; + if (dot_output != NULL) { + initial_global_state->prev_req = + MC_request_get_dot_output(req, value); + if (current_pair->search_cycle) + fprintf(dot_output, "%d [shape=doublecircle];\n", + current_pair->num); } + MC_SET_STD_HEAP; - } + MC_state_set_executed_request(current_pair->graph_state, req, value); + mc_stats->executed_transitions++; - cursor = 0; - - xbt_dynar_foreach(current_pair->automaton_state->out, cursor, transition_succ){ - - res = MC_automaton_evaluate_label(transition_succ->label); - - if(res == 2){ // true transition in automaton - MC_SET_RAW_MEM; - next_pair = new_pair_stateless(next_graph_state, transition_succ->dst, MC_state_interleave_size(next_graph_state)); - xbt_dynar_push(successors, &next_pair); - MC_UNSET_RAW_MEM; - } + /* Answer the request */ + SIMIX_simcall_pre(req, value); - } + /* Wait for requests (schedules processes) */ + MC_wait_for_requests(); - cursor = 0; - - xbt_dynar_foreach(successors, cursor, pair_succ){ + MC_SET_MC_HEAP; + prop_values = get_atomic_propositions_values(); + MC_SET_STD_HEAP; - if(search_cycle == 1){ + int new_pair = 0; - if((pair_succ->automaton_state->type == 1) || (pair_succ->automaton_state->type == 2)){ - - if(reached(pair_succ->automaton_state)){ - - XBT_INFO("Next pair (depth = %d, %u interleave) already reached !", xbt_fifo_size(mc_stack_liveness) + 1, MC_state_interleave_size(pair_succ->graph_state)); + /* Evaluate enabled transition according to atomic propositions values */ + cursor = 0; + xbt_dynar_foreach(current_pair->automaton_state->out, cursor, + transition_succ) { - XBT_INFO("*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*"); - XBT_INFO("| ACCEPTANCE CYCLE |"); - XBT_INFO("*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*"); - XBT_INFO("Counter-example that violates formula :"); - MC_show_stack_liveness(mc_stack_liveness); - MC_dump_stack_liveness(mc_stack_liveness); - MC_print_statistics_pairs(mc_stats_pair); - xbt_abort(); + res = + MC_automaton_evaluate_label(transition_succ->label, + prop_values); - }else{ + if (res == 1) { // enabled transition in automaton - XBT_DEBUG("Next pair (depth =%d) -> Acceptance pair (%s)", xbt_fifo_size(mc_stack_liveness) + 1, pair_succ->automaton_state->id); + if (new_pair) + MC_replay_liveness(mc_stack, 1); - XBT_DEBUG("Reached pairs : %lu", xbt_dynar_length(reached_pairs)); + MC_SET_MC_HEAP; - MC_SET_RAW_MEM; - xbt_fifo_unshift(mc_stack_liveness, pair_succ); - MC_UNSET_RAW_MEM; - - MC_ddfs(search_cycle); + next_pair = MC_pair_new(); + next_pair->graph_state = MC_state_new(); + next_pair->automaton_state = transition_succ->dst; + next_pair->atomic_propositions = get_atomic_propositions_values(); + /* Get enabled processes and insert them in the interleave set of the next graph_state */ + xbt_swag_foreach(process, simix_global->process_list) { + if (MC_process_is_enabled(process)) { + MC_state_interleave_process(next_pair->graph_state, process); + } } - }else{ + next_pair->requests = + MC_state_interleave_size(next_pair->graph_state); - MC_SET_RAW_MEM; - xbt_fifo_unshift(mc_stack_liveness, pair_succ); - MC_UNSET_RAW_MEM; - - MC_ddfs(search_cycle); - - } + if (next_pair->automaton_state->type == 1 + || next_pair->automaton_state->type == 2 + || current_pair->search_cycle) + next_pair->search_cycle = 1; - }else{ - - if(((pair_succ->automaton_state->type == 1) || (pair_succ->automaton_state->type == 2))){ + xbt_fifo_unshift(mc_stack, next_pair); - XBT_DEBUG("Next pair (depth =%d) -> Acceptance pair (%s)", xbt_fifo_size(mc_stack_liveness) + 1, pair_succ->automaton_state->id); - - set_pair_reached(pair_succ->automaton_state); + if (mc_stats->expanded_pairs % 1000000 == 0) + XBT_INFO("Expanded pairs : %lu", mc_stats->expanded_pairs); - search_cycle = 1; + MC_SET_STD_HEAP; - XBT_DEBUG("Reached pairs : %lu", xbt_dynar_length(reached_pairs)); + new_pair = 1; + + MC_modelcheck_liveness(); } - MC_SET_RAW_MEM; - xbt_fifo_unshift(mc_stack_liveness, pair_succ); - MC_UNSET_RAW_MEM; - - MC_ddfs(search_cycle); - } - - /* Restore system before checking others successors */ - if(cursor != (xbt_dynar_length(successors) - 1)) - MC_replay_liveness(mc_stack_liveness, 1); - - - } - - if(MC_state_interleave_size(current_pair->graph_state) > 0){ - XBT_DEBUG("Backtracking to depth %d", xbt_fifo_size(mc_stack_liveness)); - MC_replay_liveness(mc_stack_liveness, 0); - } - } - - - }else{ - - XBT_DEBUG("No more request to execute in this state, search evolution in Büchi Automaton."); - - MC_SET_RAW_MEM; - - /* Create the new expanded graph_state */ - next_graph_state = MC_state_pair_new(); - - xbt_dynar_reset(successors); + /* Then, evaluate true transitions (always true, whatever atomic propositions values) */ + cursor = 0; + xbt_dynar_foreach(current_pair->automaton_state->out, cursor, + transition_succ) { - MC_UNSET_RAW_MEM; + res = + MC_automaton_evaluate_label(transition_succ->label, + prop_values); + if (res == 2) { // true transition in automaton - cursor= 0; - xbt_dynar_foreach(current_pair->automaton_state->out, cursor, transition_succ){ + if (new_pair) + MC_replay_liveness(mc_stack, 1); - res = MC_automaton_evaluate_label(transition_succ->label); + MC_SET_MC_HEAP; - if(res == 1){ // enabled transition in automaton - MC_SET_RAW_MEM; - next_pair = new_pair_stateless(next_graph_state, transition_succ->dst, MC_state_interleave_size(next_graph_state)); - xbt_dynar_push(successors, &next_pair); - MC_UNSET_RAW_MEM; - } - - } - - cursor = 0; - - xbt_dynar_foreach(current_pair->automaton_state->out, cursor, transition_succ){ - - res = MC_automaton_evaluate_label(transition_succ->label); - - if(res == 2){ // true transition in automaton - MC_SET_RAW_MEM; - next_pair = new_pair_stateless(next_graph_state, transition_succ->dst, MC_state_interleave_size(next_graph_state)); - xbt_dynar_push(successors, &next_pair); - MC_UNSET_RAW_MEM; - } + next_pair = MC_pair_new(); + next_pair->graph_state = MC_state_new(); + next_pair->automaton_state = transition_succ->dst; + next_pair->atomic_propositions = get_atomic_propositions_values(); - } + /* Get enabled process and insert it in the interleave set of the next graph_state */ + xbt_swag_foreach(process, simix_global->process_list) { + if (MC_process_is_enabled(process)) { + MC_state_interleave_process(next_pair->graph_state, process); + } + } - cursor = 0; - - xbt_dynar_foreach(successors, cursor, pair_succ){ + next_pair->requests = + MC_state_interleave_size(next_pair->graph_state); - if(search_cycle == 1){ + if (next_pair->automaton_state->type == 1 + || next_pair->automaton_state->type == 2 + || current_pair->search_cycle) + next_pair->search_cycle = 1; - if((pair_succ->automaton_state->type == 1) || (pair_succ->automaton_state->type == 2)){ + xbt_fifo_unshift(mc_stack, next_pair); - if(reached(pair_succ->automaton_state)){ - - XBT_INFO("Next pair (depth = %d) already reached !", xbt_fifo_size(mc_stack_liveness) + 1); - - XBT_INFO("*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*"); - XBT_INFO("| ACCEPTANCE CYCLE |"); - XBT_INFO("*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*"); - XBT_INFO("Counter-example that violates formula :"); - MC_show_stack_liveness(mc_stack_liveness); - MC_dump_stack_liveness(mc_stack_liveness); - MC_print_statistics_pairs(mc_stats_pair); - exit(0); + if (mc_stats->expanded_pairs % 1000000 == 0) + XBT_INFO("Expanded pairs : %lu", mc_stats->expanded_pairs); - }else{ + MC_SET_STD_HEAP; - XBT_INFO("Next pair (depth = %d) -> Acceptance pair (%s)", xbt_fifo_size(mc_stack_liveness) + 1, pair_succ->automaton_state->id); - - XBT_INFO("Reached pairs : %lu", xbt_dynar_length(reached_pairs)); + new_pair = 1; - MC_SET_RAW_MEM; - xbt_fifo_unshift(mc_stack_liveness, pair_succ); - MC_UNSET_RAW_MEM; - - MC_ddfs(search_cycle); + MC_modelcheck_liveness(); } - }else{ - - MC_SET_RAW_MEM; - xbt_fifo_unshift(mc_stack_liveness, pair_succ); - MC_UNSET_RAW_MEM; - - MC_ddfs(search_cycle); - } - - - }else{ - - if(((pair_succ->automaton_state->type == 1) || (pair_succ->automaton_state->type == 2))){ - - set_pair_reached(pair_succ->automaton_state); - - search_cycle = 1; - - XBT_INFO("Reached pairs : %lu", xbt_dynar_length(reached_pairs)); + if (MC_state_interleave_size(current_pair->graph_state) > 0) { + XBT_DEBUG("Backtracking to depth %d", xbt_fifo_size(mc_stack)); + MC_replay_liveness(mc_stack, 0); } - MC_SET_RAW_MEM; - xbt_fifo_unshift(mc_stack_liveness, pair_succ); - MC_UNSET_RAW_MEM; - - MC_ddfs(search_cycle); - } - /* Restore system before checking others successors */ - if(cursor != xbt_dynar_length(successors) - 1) - MC_replay_liveness(mc_stack_liveness, 1); + } - } + } + + } else { + XBT_WARN("/!\\ Max depth reached ! /!\\ "); + if (MC_state_interleave_size(current_pair->graph_state) > 0) { + XBT_WARN + ("/!\\ But, there are still processes to interleave. Model-checker will not be able to ensure the soundness of the verification from now. /!\\ "); + if (_sg_mc_max_depth == 1000) + XBT_WARN + ("Notice : the default value of max depth is 1000 but you can change it with cfg=model-check/max_depth:value."); } - - }else{ - - XBT_DEBUG("Max depth reached"); } - if(xbt_fifo_size(mc_stack_liveness) == MAX_DEPTH_LIVENESS ){ - XBT_DEBUG("Pair (depth = %d) shifted in stack, maximum depth reached", xbt_fifo_size(mc_stack_liveness) ); - }else{ - XBT_DEBUG("Pair (depth = %d) shifted in stack", xbt_fifo_size(mc_stack_liveness) ); + if (xbt_fifo_size(mc_stack) == _sg_mc_max_depth) { + XBT_DEBUG("Pair %d (depth = %d) shifted in stack, maximum depth reached", + current_pair->num, xbt_fifo_size(mc_stack)); + } else { + XBT_DEBUG("Pair %d (depth = %d) shifted in stack", current_pair->num, + xbt_fifo_size(mc_stack)); } - - MC_SET_RAW_MEM; - remove_pair = xbt_fifo_shift(mc_stack_liveness); - xbt_fifo_remove(mc_stack_liveness, remove_pair); - remove_pair = NULL; - if((current_pair->automaton_state->type == 1) || (current_pair->automaton_state->type == 2)){ - remove_pair_reached = xbt_dynar_pop_as(reached_pairs, mc_pair_reached_t); - pair_reached_free(remove_pair_reached); - remove_pair_reached = NULL; + + MC_SET_MC_HEAP; + xbt_dynar_free(&prop_values); + current_pair = xbt_fifo_shift(mc_stack); + if (xbt_fifo_size(mc_stack) != _sg_mc_max_depth - 1 + && current_pair->requests > 0 && current_pair->search_cycle) { + remove_acceptance_pair(current_pair->num); } - MC_UNSET_RAW_MEM; + MC_pair_delete(current_pair); - if(raw_mem_set) - MC_SET_RAW_MEM; + MC_SET_STD_HEAP; }