#include "private.h"
+#include "unistd.h"
XBT_LOG_NEW_DEFAULT_SUBCATEGORY(mc_dfs, mc,
- "Logging specific to MC DFS exploration");
+ "Logging specific to MC DFS algorithm");
+xbt_dynar_t initial_pairs = NULL;
+int max_pair = 0;
+xbt_dynar_t visited_pairs;
+xbt_dynar_t reached_pairs;
+
+mc_pairs_t new_pair(mc_snapshot_t sn, mc_state_t sg, xbt_state_t st){
+ mc_pairs_t p = NULL;
+ p = xbt_new0(s_mc_pairs_t, 1);
+ p->system_state = sn;
+ p->automaton_state = st;
+ p->graph_state = sg;
+ p->num = max_pair;
+ max_pair++;
+ return p;
+
+}
+
+void set_pair_visited(mc_state_t gs, xbt_state_t as, int sc){
+
+ if(visited(gs, as, sc) == 0){
+ //XBT_DEBUG("New visited pair : graph=%p, automaton=%p", gs, as);
+ MC_SET_RAW_MEM;
+ mc_visited_pairs_t p = NULL;
+ p = xbt_new0(s_mc_visited_pairs_t, 1);
+ p->graph_state = gs;
+ p->automaton_state = as;
+ p->search_cycle = sc;
+ xbt_dynar_push(visited_pairs, &p);
+ MC_UNSET_RAW_MEM;
+ }
+
+ //XBT_DEBUG("New visited pair , length of visited pairs : %lu", xbt_dynar_length(visited_pairs));
+}
+
+int reached(mc_state_t gs, xbt_state_t as ){
+
+ mc_reached_pairs_t rp = NULL;
+ unsigned int c= 0;
+ unsigned int i;
+ int different_process;
-void MC_dfs_init()
-{
- mc_transition_t trans = NULL;
- mc_state_t initial_state = NULL;
- xbt_setset_cursor_t cursor = NULL;
-
MC_SET_RAW_MEM;
- initial_state = MC_state_new();
- /* Add the state data structure for the initial state */
- xbt_fifo_unshift(mc_stack, initial_state);
+ xbt_dynar_foreach(reached_pairs, c, rp){
+ if(rp->automaton_state == as){
+ different_process=0;
+ for(i=0; i < gs->max_pid; i++){
+ if(gs->proc_status[i].state != rp->graph_state->proc_status[i].state){
+ different_process++;
+ }
+ }
+ if(different_process==0){
+ MC_UNSET_RAW_MEM;
+ return 1;
+ }
+ }
+ }
MC_UNSET_RAW_MEM;
-
- DEBUG0("**************************************************");
- DEBUG0("Initial state");
-
- /* Schedule all the processes to detect the transitions from the initial state */
- MC_schedule_enabled_processes();
+ return 0;
+}
+
+void set_pair_reached(mc_state_t gs, xbt_state_t as){
+
+ if(reached(gs, as) == 0){
+ MC_SET_RAW_MEM;
+ mc_reached_pairs_t p = NULL;
+ p = xbt_new0(s_mc_reached_pairs_t, 1);
+ p->graph_state = gs;
+ p->automaton_state = as;
+ xbt_dynar_push(reached_pairs, &p);
+ //XBT_DEBUG("New reached pair : graph=%p, automaton=%p", gs, as);
+ MC_UNSET_RAW_MEM;
+ }
+
+}
+
+int visited(mc_state_t gs, xbt_state_t as, int sc){
+ unsigned int c = 0;
+ mc_visited_pairs_t p = NULL;
+ unsigned int i;
+ int different_process;
+
+ MC_SET_RAW_MEM;
+ xbt_dynar_foreach(visited_pairs, c, p){
+ if((p->automaton_state == as) && (p->search_cycle == sc)){
+ different_process=0;
+ for(i=0; i < gs->max_pid; i++){
+ if(gs->proc_status[i].state != p->graph_state->proc_status[i].state){
+ different_process++;
+ }
+ }
+ if(different_process==0){
+ MC_UNSET_RAW_MEM;
+ return 1;
+ }
+ }
+ }
+ MC_UNSET_RAW_MEM;
+ return 0;
+
+}
+
+void MC_dfs_init(xbt_automaton_t a){
+
+ XBT_DEBUG("**************************************************");
+ XBT_DEBUG("DFS init");
+ XBT_DEBUG("**************************************************");
+
+ mc_pairs_t mc_initial_pair;
+ mc_state_t initial_graph_state;
+ smx_process_t process;
+ mc_snapshot_t init_snapshot;
+
+ MC_wait_for_requests();
MC_SET_RAW_MEM;
- xbt_setset_add(initial_state->enabled_transitions, initial_state->transitions);
- xbt_setset_foreach(initial_state->enabled_transitions, cursor, trans){
- if(trans->type == mc_wait
- && (trans->comm->src_proc == NULL || trans->comm->dst_proc == NULL)){
- xbt_setset_set_remove(initial_state->enabled_transitions, trans);
+
+ init_snapshot = xbt_new0(s_mc_snapshot_t, 1);
+
+ initial_graph_state = MC_state_new();
+ xbt_swag_foreach(process, simix_global->process_list){
+ if(MC_process_is_enabled(process)){
+ MC_state_interleave_process(initial_graph_state, process);
+ }
+ }
+
+ visited_pairs = xbt_dynar_new(sizeof(mc_visited_pairs_t), NULL);
+ reached_pairs = xbt_dynar_new(sizeof(mc_reached_pairs_t), NULL);
+
+ MC_take_snapshot(init_snapshot);
+
+ MC_UNSET_RAW_MEM;
+
+
+ /* regarder dans l'automate toutes les transitions activables grâce à l'état initial du système
+ -> donnera les états initiaux de la propriété consistants avec l'état initial du système */
+
+ unsigned int cursor = 0;
+ unsigned int cursor2 = 0;
+ xbt_state_t state = NULL;
+ int res;
+ xbt_transition_t transition_succ;
+ xbt_dynar_t elses = xbt_dynar_new(sizeof(mc_pairs_t), NULL);
+ xbt_dynar_t successors = xbt_dynar_new(sizeof(mc_pairs_t), NULL);
+ // int enabled_transition = 0;
+ mc_pairs_t pair_succ;
+
+ xbt_dynar_foreach(a->states, cursor, state){
+ if(state->type == -1){
+ xbt_dynar_foreach(state->out, cursor2, transition_succ){
+ res = MC_automaton_evaluate_label(a, transition_succ->label);
+
+ if(res == 1){
+
+ MC_SET_RAW_MEM;
+
+ mc_initial_pair = new_pair(init_snapshot, initial_graph_state, transition_succ->dst);
+ xbt_dynar_push(successors, &mc_initial_pair);
+
+ //XBT_DEBUG("New initial successor");
+
+ MC_UNSET_RAW_MEM;
+
+ }else{
+ if(res == 2){
+
+ MC_SET_RAW_MEM;
+
+ mc_initial_pair = new_pair(init_snapshot, initial_graph_state, transition_succ->dst);
+ xbt_dynar_push(elses, &mc_initial_pair);
+
+ //XBT_DEBUG("New initial successor");
+
+ MC_UNSET_RAW_MEM;
+ }
+ }
+ }
}
}
- /* Fill the interleave set of the initial state with all enabled transitions */
- xbt_setset_add(initial_state->interleave, initial_state->enabled_transitions);
+ if(xbt_dynar_length(successors) > 0){
+
+ cursor = 0;
+ xbt_dynar_foreach(successors, cursor, pair_succ){
+ MC_SET_RAW_MEM;
+
+ xbt_fifo_unshift(mc_snapshot_stack, pair_succ);
+
+ XBT_DEBUG("**************************************************");
+ XBT_DEBUG("Initial state=%p ", pair_succ);
+
+ MC_UNSET_RAW_MEM;
+
+ set_pair_visited(pair_succ->graph_state, pair_succ->automaton_state, 0);
+
+ if(cursor == 0)
+ MC_dfs(a, 0, 0);
+ else
+ MC_dfs(a, 0, 1);
+
+ }
+
+ }else{
+
+ if(xbt_dynar_length(elses) > 0){
+ cursor = 0;
+ xbt_dynar_foreach(elses, cursor, pair_succ){
+ MC_SET_RAW_MEM;
- /* Update Statistics */
- mc_stats->state_size += xbt_setset_set_size(initial_state->enabled_transitions);
+ xbt_fifo_unshift(mc_snapshot_stack, pair_succ);
+
+ XBT_DEBUG("**************************************************");
+ XBT_DEBUG("Initial state=%p ", pair_succ);
+
+ MC_UNSET_RAW_MEM;
+
+ set_pair_visited(pair_succ->graph_state, pair_succ->automaton_state, 0);
+
+ if(cursor == 0)
+ MC_dfs(a, 0, 0);
+ else
+ MC_dfs(a, 0, 1);
+ }
+ }else{
+
+ XBT_DEBUG("No initial state !");
+
+ return;
+ }
+ }
- MC_UNSET_RAW_MEM;
}
-/**
- * \brief Perform the model-checking operation using a depth-first search exploration
- *
- * It performs the model-checking operation by executing all possible scheduling of the communication actions
- * \return The time spent to execute the simulation or -1 if the simulation ended
- */
-void MC_dfs(void)
-{
- mc_transition_t trans = NULL;
- mc_state_t current_state = NULL;
- mc_state_t next_state = NULL;
- xbt_setset_cursor_t cursor = NULL;
+
+
+void MC_dfs(xbt_automaton_t a, int search_cycle, int restore){
+
+
+ if(xbt_fifo_size(mc_snapshot_stack) == 0)
+ return;
+
+ if(restore == 1){
+ MC_restore_snapshot(((mc_pairs_t)xbt_fifo_get_item_content(xbt_fifo_get_first_item(mc_snapshot_stack)))->system_state);
+ MC_UNSET_RAW_MEM;
+ }
+
+
+ //XBT_DEBUG("Lpv length after restore snapshot: %lu", xbt_dynar_length(visited_pairs));
+
+ /* Get current state */
+ mc_pairs_t current_pair = (mc_pairs_t)xbt_fifo_get_item_content(xbt_fifo_get_first_item(mc_snapshot_stack));
+
+ XBT_DEBUG("**************************************************");
+ XBT_DEBUG("State : graph=%p, automaton=%p, %u interleave, stack size=%d", current_pair->graph_state, current_pair->automaton_state, MC_state_interleave_size(current_pair->graph_state), xbt_fifo_size(mc_snapshot_stack));
+ //XBT_DEBUG("Restore : %d", restore);
+
+
+ /* Update statistics */
+ //mc_stats->visited_states++;
+ //set_pair_visited(current_pair->graph_state, current_pair->automaton_state, search_cycle);
+
+ //sleep(1);
+
+ smx_process_t process = NULL;
+ int value;
+ mc_state_t next_graph_state = NULL;
+ smx_req_t req = NULL;
+ char *req_str;
+
+ mc_pairs_t pair_succ;
+ xbt_transition_t transition_succ;
+ unsigned int cursor;
+ int res;
+ //int enabled_transition = 0;
+
+ xbt_dynar_t elses = xbt_dynar_new(sizeof(mc_pairs_t), NULL);
+ xbt_dynar_t successors = xbt_dynar_new(sizeof(mc_pairs_t), NULL);
+
+ mc_pairs_t next_pair;
+ mc_snapshot_t next_snapshot;
+ mc_snapshot_t current_snapshot;
- while(xbt_fifo_size(mc_stack) > 0){
- DEBUG0("**************************************************");
+ while((req = MC_state_get_request(current_pair->graph_state, &value)) != NULL){
- /* FIXME: Think about what happens if there are no transitions but there are
- some actions on the models. (ex. all the processes do a sleep(0) in a round). */
+ //XBT_DEBUG("Current pair : %p (%u interleave)", current_pair, MC_state_interleave_size(current_pair->graph_state)+1);
+ //XBT_DEBUG("Visited pairs : %lu", xbt_dynar_length(visited_pairs));
- /* Get current state */
- current_state = (mc_state_t)
- xbt_fifo_get_item_content(xbt_fifo_get_first_item(mc_stack));
+ MC_SET_RAW_MEM;
+ current_snapshot = xbt_new0(s_mc_snapshot_t, 1);
+ MC_take_snapshot(current_snapshot);
+ MC_UNSET_RAW_MEM;
- /* If there are transitions to execute and the maximun depth has not been reached
- then perform one step of the exploration algorithm */
- if(xbt_setset_set_size(current_state->interleave) > 0 && xbt_fifo_size(mc_stack) < MAX_DEPTH){
+
+ /* Debug information */
+ if(XBT_LOG_ISENABLED(mc_dfs, xbt_log_priority_debug)){
+ req_str = MC_request_to_string(req, value);
+ XBT_DEBUG("Execute: %s", req_str);
+ xbt_free(req_str);
+ }
- DEBUG3("Exploration detph=%d (state=%p)(%d transitions)", xbt_fifo_size(mc_stack),
- current_state, xbt_setset_set_size(current_state->interleave));
+ MC_state_set_executed_request(current_pair->graph_state, req, value);
+ //mc_stats->executed_transitions++;
- /* Update statistics */
- mc_stats->visited_states++;
- mc_stats->executed_transitions++;
-
- /* Choose a transition to execute from the interleave set of the current state,
- and create the data structures for the new expanded state in the exploration
- stack. */
- MC_SET_RAW_MEM;
- trans = xbt_setset_set_extract(current_state->interleave);
+ /* Answer the request */
+ SIMIX_request_pre(req, value);
- /* Define it as the executed transition of this state */
- current_state->executed_transition = trans;
+ /* Wait for requests (schedules processes) */
+ MC_wait_for_requests();
- next_state = MC_state_new();
- xbt_fifo_unshift(mc_stack, next_state);
- MC_UNSET_RAW_MEM;
- DEBUG1("Executing transition %s", trans->name);
- SIMIX_process_schedule(trans->process);
+ /* Create the new expanded graph_state */
+ MC_SET_RAW_MEM;
- /* Do all surf's related black magic tricks to keep all working */
- MC_execute_surf_actions();
+ next_graph_state = MC_state_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);
+ }
+ }
- /* Schedule every process that got enabled due to the executed transition */
- MC_schedule_enabled_processes();
+ next_snapshot = xbt_new0(s_mc_snapshot_t, 1);
+ MC_take_snapshot(next_snapshot);
- /* Calculate the enabled transitions set of the next state:
- -add the transition sets of the current state and the next state
- -remove the executed transition from that set
- -remove all the transitions that are disabled (mc_wait only)
- -use the resulting set as the enabled transitions of the next state */
+ MC_UNSET_RAW_MEM;
+
+ xbt_dynar_reset(elses);
+ xbt_dynar_reset(successors);
+
+ cursor = 0;
+ xbt_dynar_foreach(current_pair->automaton_state->out, cursor, transition_succ){
+
+ res = MC_automaton_evaluate_label(a, transition_succ->label);
+
MC_SET_RAW_MEM;
- xbt_setset_add(next_state->transitions, current_state->transitions);
- xbt_setset_set_remove(next_state->transitions, trans);
- xbt_setset_add(next_state->enabled_transitions, next_state->transitions);
- xbt_setset_foreach(next_state->enabled_transitions, cursor, trans){
- if(trans->type == mc_wait
- && (trans->comm->src_proc == NULL || trans->comm->dst_proc == NULL)){
- xbt_setset_set_remove(next_state->enabled_transitions, trans);
- }
+ next_pair = new_pair(next_snapshot,next_graph_state, transition_succ->dst);
+
+ //XBT_DEBUG("Next pair : %p", next_pair);
+
+ if(res == 1){ // enabled transition in automaton
+ xbt_dynar_push(successors, &next_pair);
+ //XBT_DEBUG("New Successors length : %lu", xbt_dynar_length(successors));
+ }else{
+ if(res == 2){
+ xbt_dynar_push(elses, &next_pair);
+ //XBT_DEBUG("New Elses length : %lu", xbt_dynar_length(elses));
+ }
}
-
- /* Fill the interleave set of the new state with all enabled transitions */
- xbt_setset_add(next_state->interleave, next_state->enabled_transitions);
+
MC_UNSET_RAW_MEM;
+ }
- /* Update Statistics */
- mc_stats->state_size += xbt_setset_set_size(next_state->enabled_transitions);
+
+ if((xbt_dynar_length(successors) == 0) && (xbt_dynar_length(elses) == 0) ){
- /* Let's loop again */
-
- /* The interleave set is empty or the maximum depth is reached, let's back-track */
- }else{
- DEBUG0("There are no more actions to run");
-
MC_SET_RAW_MEM;
- xbt_fifo_shift(mc_stack);
- MC_state_delete(current_state);
-
- /* Go backwards in the stack until we find a state with transitions in the interleave set */
- while(xbt_fifo_size(mc_stack) > 0 && (current_state = (mc_state_t)xbt_fifo_shift(mc_stack))){
- if(xbt_setset_set_size(current_state->interleave) == 0){
- MC_state_delete(current_state);
- }else{
- xbt_fifo_unshift(mc_stack, current_state);
- DEBUG1("Back-tracking to depth %d", xbt_fifo_size(mc_stack));
- MC_replay(mc_stack);
- MC_UNSET_RAW_MEM;
- /* Let's loop again */
- break;
- }
- }
+ next_pair = new_pair(next_snapshot, next_graph_state, current_pair->automaton_state);
+ xbt_dynar_push(successors, &next_pair);
+ MC_UNSET_RAW_MEM;
+
}
+
+ //XBT_DEBUG("Successors length : %lu", xbt_dynar_length(successors));
+ //XBT_DEBUG("Elses length : %lu", xbt_dynar_length(elses));
+
+ if(xbt_dynar_length(successors) >0){
+
+ cursor = 0;
+ xbt_dynar_foreach(successors, cursor, pair_succ){
+
+ //XBT_DEBUG("Search visited pair : graph=%p, automaton=%p", pair_succ->graph_state, pair_succ->automaton_state);
+
+ if(visited(pair_succ->graph_state, pair_succ->automaton_state, search_cycle) == 0){
+
+ MC_SET_RAW_MEM;
+ xbt_fifo_unshift(mc_snapshot_stack, pair_succ);
+ MC_UNSET_RAW_MEM;
+
+ set_pair_visited(pair_succ->graph_state, pair_succ->automaton_state, search_cycle);
+ MC_dfs(a, search_cycle, 0);
+
+ if((search_cycle == 0) && (pair_succ->automaton_state->type == 1)){
+
+ /* mc_pairs_t first_item = (mc_pairs_t)xbt_fifo_get_item_content(xbt_fifo_get_first_item(mc_snapshot_stack)); */
+ /* if((first_item->graph_state != pair_succ->graph_state) || (first_item->automaton_state != pair_succ->automaton_state) ){ */
+ /* MC_SET_RAW_MEM; */
+ /* xbt_fifo_unshift(mc_snapshot_stack, pair_succ); */
+ /* MC_UNSET_RAW_MEM; */
+ /* } */
+
+ set_pair_reached(pair_succ->graph_state, pair_succ->automaton_state);
+ XBT_DEBUG("Acceptance state : graph=%p, automaton=%p", pair_succ->graph_state, pair_succ->automaton_state);
+ MC_dfs(a, 1, 0);
+ }
+ }else{
+ //XBT_DEBUG("Pair (graph=%p, automaton=%p) already visited !", pair_succ->graph_state, pair_succ->automaton_state );
+ set_pair_visited(pair_succ->graph_state, pair_succ->automaton_state, search_cycle);
+ }
+
+ }
+
+ }else{
+
+ cursor = 0;
+ xbt_dynar_foreach(elses, cursor, pair_succ){
+
+ //XBT_DEBUG("Search visited pair : graph=%p, automaton=%p", pair_succ->graph_state, pair_succ->automaton_state);
+
+ if(visited(pair_succ->graph_state, pair_succ->automaton_state, search_cycle) == 0){
+
+ MC_SET_RAW_MEM;
+ xbt_fifo_unshift(mc_snapshot_stack, pair_succ);
+ MC_UNSET_RAW_MEM;
+
+ set_pair_visited(pair_succ->graph_state, pair_succ->automaton_state, search_cycle);
+ MC_dfs(a, search_cycle, 0);
+
+ if((search_cycle == 0) && (pair_succ->automaton_state->type == 1)){
+
+ set_pair_reached(pair_succ->graph_state, pair_succ->automaton_state);
+ XBT_DEBUG("Acceptance state : graph state=%p, automaton state=%p",pair_succ->graph_state, pair_succ->automaton_state);
+ MC_dfs(a, 1, 0);
+
+ }
+ }else{
+ //XBT_DEBUG("Pair (graph=%p, automaton=%p) already visited !", pair_succ->graph_state, pair_succ->automaton_state );
+ /* Different graph_state */
+ set_pair_visited(pair_succ->graph_state, pair_succ->automaton_state, search_cycle);
+ }
+
+ }
+
+ }
+
+ if(MC_state_interleave_size(current_pair->graph_state) > 0){
+ MC_restore_snapshot(current_snapshot);
+ MC_UNSET_RAW_MEM;
+ //XBT_DEBUG("Snapshot restored");
+ }
+ }
+
+ if((search_cycle == 1) && (reached(current_pair->graph_state, current_pair->automaton_state) == 1)){
+ XBT_INFO("*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*");
+ XBT_INFO("| ACCEPTANCE CYCLE |");
+ XBT_INFO("*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*");
+ XBT_INFO("Counter-example that violates formula :");
+ MC_show_snapshot_stack(mc_snapshot_stack);
+ MC_dump_snapshot_stack(mc_snapshot_stack);
+ exit(0);
}
+
+ MC_SET_RAW_MEM;
+ xbt_fifo_shift(mc_snapshot_stack);
+ //XBT_DEBUG("State shifted in snapshot_stack, mc_snapshot_stack size=%d", xbt_fifo_size(mc_snapshot_stack));
MC_UNSET_RAW_MEM;
- /* We are done, show the statistics and return */
- MC_print_statistics(mc_stats);
-}
\ No newline at end of file
+
+
+}
+
+void MC_show_snapshot_stack(xbt_fifo_t stack){
+ int value;
+ mc_pairs_t pair;
+ xbt_fifo_item_t item;
+ smx_req_t req;
+ char *req_str = NULL;
+
+ for (item = xbt_fifo_get_last_item(stack);
+ (item ? (pair = (mc_pairs_t) (xbt_fifo_get_item_content(item)))
+ : (NULL)); item = xbt_fifo_get_prev_item(item)) {
+ req = MC_state_get_executed_request(pair->graph_state, &value);
+ if(req){
+ req_str = MC_request_to_string(req, value);
+ XBT_INFO("%s", req_str);
+ xbt_free(req_str);
+ }
+ }
+}
+
+void MC_dump_snapshot_stack(xbt_fifo_t stack){
+
+}
+
+
+int MC_automaton_evaluate_label(xbt_automaton_t a, xbt_exp_label_t l){
+
+ switch(l->type){
+ case 0 : {
+ int left_res = MC_automaton_evaluate_label(a, l->u.or_and.left_exp);
+ int right_res = MC_automaton_evaluate_label(a, l->u.or_and.right_exp);
+ return (left_res || right_res);
+ break;
+ }
+ case 1 : {
+ int left_res = MC_automaton_evaluate_label(a, l->u.or_and.left_exp);
+ int right_res = MC_automaton_evaluate_label(a, l->u.or_and.right_exp);
+ return (left_res && right_res);
+ break;
+ }
+ case 2 : {
+ int res = MC_automaton_evaluate_label(a, l->u.exp_not);
+ return (!res);
+ break;
+ }
+ case 3 : {
+ unsigned int cursor = 0;
+ xbt_propositional_symbol_t p = NULL;
+ xbt_dynar_foreach(a->propositional_symbols, cursor, p){
+ if(strcmp(p->pred, l->u.predicat) == 0){
+ int (*f)() = p->function;
+ return (*f)();
+ }
+ }
+ return -1;
+ break;
+ }
+ case 4 : {
+ return 2;
+ break;
+ }
+ default :
+ return -1;
+ }
+}
+
+/*void MC_dfs(xbt_automaton_t a, int search_cycle){
+
+ xbt_state_t current_state = (xbt_state_t)xbt_fifo_get_item_content(xbt_fifo_get_first_item(stack_automaton_dfs));
+ xbt_transition_t transition_succ = NULL;
+ xbt_state_t successor = NULL;
+ unsigned int cursor = 0;
+ xbt_dynar_t elses = xbt_dynar_new(sizeof(xbt_transition_t), NULL);
+ int res;
+
+ //printf("++ current state : %s\n", current_state->id);
+
+ xbt_dynar_foreach(current_state->out, cursor, transition_succ){
+ successor = transition_succ->dst;
+ res = MC_automaton_evaluate_label(a, transition_succ->label);
+ //printf("-- state : %s, transition_label : %d, res = %d\n", successor->id, transition_succ->label->type, res);
+ if(res == 1){
+ if(search_cycle == 1 && reached_dfs != NULL){
+ if(strcmp(reached_dfs->id, successor->id) == 0){
+ xbt_dynar_push(state_automaton_visited_dfs, &successor);
+ printf("\n-*-*-*-*-*-*- ACCEPTANCE CYCLE -*-*-*-*-*-*-\n");
+ printf("Visited states : \n");
+ unsigned int cursor2 = 0;
+ xbt_state_t visited_state = NULL;
+ xbt_dynar_foreach(state_automaton_visited_dfs, cursor2, visited_state){
+ printf("State : %s\n", visited_state->id);
+ }
+ exit(1);
+ }
+ }
+ if(successor->visited == 0){
+ successor->visited = 1;
+ xbt_fifo_unshift(stack_automaton_dfs, successor);
+ xbt_dynar_push(state_automaton_visited_dfs, &successor);
+ MC_dfs(a, search_cycle);
+ if(search_cycle == 0 && successor->type == 1){
+ reached_dfs = successor;
+ MC_dfs(a, 1);
+ }
+ }
+ }else{
+ if(res == 2){
+ xbt_dynar_push(elses,&transition_succ);
+ }
+ }
+ }
+
+ cursor = 0;
+ xbt_dynar_foreach(elses, cursor, transition_succ){
+ successor = transition_succ->dst;
+ if(search_cycle == 1 && reached_dfs != NULL){
+ if(strcmp(reached_dfs->id, successor->id) == 0){
+ xbt_dynar_push(state_automaton_visited_dfs, &successor);
+ printf("\n-*-*-*-*-*-*- ACCEPTANCE CYCLE -*-*-*-*-*-*-\n");
+ printf("Visited states : \n");
+ unsigned int cursor2 = 0;
+ xbt_state_t visited_state = NULL;
+ xbt_dynar_foreach(state_automaton_visited_dfs, cursor2, visited_state){
+ printf("State : %s\n", visited_state->id);
+ }
+ exit(1);
+ }
+ }
+ if(successor->visited == 0){
+ successor->visited = 1;
+ xbt_fifo_unshift(stack_automaton_dfs, successor);
+ xbt_dynar_push(state_automaton_visited_dfs, &successor);
+ MC_dfs(a, search_cycle);
+ if(search_cycle == 0 && successor->type == 1){
+ reached_dfs = successor;
+ MC_dfs(a, 1);
+ }
+ }
+ }
+
+ xbt_fifo_shift(stack_automaton_dfs);
+ }*/
