1 /* Copyright (c) 2008 Martin Quinson, Cristian Rosa.
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. */
9 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(mc_dpor, mc,
10 "Logging specific to MC DPOR exploration");
13 * \brief Initialize the DPOR exploration algorithm
17 mc_state_t initial_state = NULL;
18 smx_process_t process;
20 /* Create the initial state and push it into the exploration stack */
22 initial_state = MC_state_new();
23 xbt_fifo_unshift(mc_stack, initial_state);
26 XBT_DEBUG("**************************************************");
27 XBT_DEBUG("Initial state");
29 /* Wait for requests (schedules processes) */
30 MC_wait_for_requests();
33 /* Get an enabled process and insert it in the interleave set of the initial state */
34 xbt_swag_foreach(process, simix_global->process_list){
35 if(MC_process_is_enabled(process)){
36 MC_state_interleave_process(initial_state, process);
42 /* FIXME: Update Statistics
43 mc_stats->state_size +=
44 xbt_setset_set_size(initial_state->enabled_transitions); */
49 * \brief Perform the model-checking operation using a depth-first search exploration
50 * with Dynamic Partial Order Reductions
56 smx_req_t req = NULL, prev_req = NULL;
57 mc_state_t state = NULL, prev_state = NULL, next_state = NULL;
58 smx_process_t process = NULL;
59 xbt_fifo_item_t item = NULL;
61 while (xbt_fifo_size(mc_stack) > 0) {
63 /* Get current state */
65 xbt_fifo_get_item_content(xbt_fifo_get_first_item(mc_stack));
67 XBT_DEBUG("**************************************************");
68 XBT_DEBUG("Exploration depth=%d (state=%p)(%u interleave)",
69 xbt_fifo_size(mc_stack), state,
70 MC_state_interleave_size(state));
72 /* Update statistics */
73 mc_stats->visited_states++;
75 /* If there are processes to interleave and the maximum depth has not been reached
76 then perform one step of the exploration algorithm */
77 if (xbt_fifo_size(mc_stack) < MAX_DEPTH &&
78 (req = MC_state_get_request(state, &value))) {
80 /* Debug information */
81 if(XBT_LOG_ISENABLED(mc_dpor, xbt_log_priority_debug)){
82 req_str = MC_request_to_string(req, value);
83 XBT_DEBUG("Execute: %s", req_str);
87 MC_state_set_executed_request(state, req, value);
88 mc_stats->executed_transitions++;
90 /* Answer the request */
91 SIMIX_request_pre(req, value); /* After this call req is no longer usefull */
93 /* Wait for requests (schedules processes) */
94 MC_wait_for_requests();
96 /* Create the new expanded state */
98 next_state = MC_state_new();
99 xbt_fifo_unshift(mc_stack, next_state);
101 /* Get an enabled process and insert it in the interleave set of the next state */
102 xbt_swag_foreach(process, simix_global->process_list){
103 if(MC_process_is_enabled(process)){
104 MC_state_interleave_process(next_state, process);
110 /* FIXME: Update Statistics
111 mc_stats->state_size +=
112 xbt_setset_set_size(next_state->enabled_transitions);*/
114 /* Let's loop again */
116 /* The interleave set is empty or the maximum depth is reached, let's back-track */
118 XBT_DEBUG("There are no more processes to interleave.");
120 /* Trash the current state, no longer needed */
122 xbt_fifo_shift(mc_stack);
123 MC_state_delete(state);
126 /* Check for deadlocks */
127 if(MC_deadlock_check()){
128 MC_show_deadlock(NULL);
133 /* Traverse the stack backwards until a state with a non empty interleave
134 set is found, deleting all the states that have it empty in the way.
135 For each deleted state, check if the request that has generated it
136 (from it's predecesor state), depends on any other previous request
137 executed before it. If it does then add it to the interleave set of the
138 state that executed that previous request. */
139 while ((state = xbt_fifo_shift(mc_stack)) != NULL) {
140 req = MC_state_get_internal_request(state);
141 xbt_fifo_foreach(mc_stack, item, prev_state, mc_state_t) {
142 if(MC_request_depend(req, MC_state_get_internal_request(prev_state))){
143 if(XBT_LOG_ISENABLED(mc_dpor, xbt_log_priority_debug)){
144 XBT_DEBUG("Dependent Transitions:");
145 prev_req = MC_state_get_executed_request(prev_state, &value);
146 req_str = MC_request_to_string(prev_req, value);
147 XBT_DEBUG("%s (state=%p)", req_str, prev_state);
149 prev_req = MC_state_get_executed_request(state, &value);
150 req_str = MC_request_to_string(prev_req, value);
151 XBT_DEBUG("%s (state=%p)", req_str, state);
155 if(!MC_state_process_is_done(prev_state, req->issuer))
156 MC_state_interleave_process(prev_state, req->issuer);
158 XBT_DEBUG("Process %p is in done set", req->issuer);
163 if (MC_state_interleave_size(state)) {
164 /* We found a back-tracking point, let's loop */
165 xbt_fifo_unshift(mc_stack, state);
166 XBT_DEBUG("Back-tracking to depth %d", xbt_fifo_size(mc_stack));
171 MC_state_delete(state);
182 /********************* DPOR without replay *********************/
184 mc_state_ws_t new_state_ws(mc_snapshot_t s, mc_state_t gs){
185 mc_state_ws_t sws = NULL;
186 sws = xbt_new0(s_mc_state_ws_t, 1);
187 sws->system_state = s;
188 sws->graph_state = gs;
192 void MC_dpor_with_restore_snapshot_init(){
194 XBT_DEBUG("**************************************************");
195 XBT_DEBUG("DPOR (with restore snapshot) init");
196 XBT_DEBUG("**************************************************");
198 mc_state_t initial_graph_state;
199 smx_process_t process;
200 mc_snapshot_t initial_system_snapshot;
201 mc_state_ws_t initial_state ;
203 MC_wait_for_requests();
207 initial_system_snapshot = xbt_new0(s_mc_snapshot_t, 1);
209 initial_graph_state = MC_state_new();
210 xbt_swag_foreach(process, simix_global->process_list){
211 if(MC_process_is_enabled(process)){
212 MC_state_interleave_process(initial_graph_state, process);
217 MC_take_snapshot(initial_system_snapshot);
219 initial_state = new_state_ws(initial_system_snapshot, initial_graph_state);
220 xbt_fifo_unshift(mc_snapshot_stack, initial_state);
224 MC_dpor_with_restore_snapshot();
228 void MC_dpor_with_restore_snapshot(){
230 smx_process_t process = NULL;
232 if(xbt_fifo_size(mc_snapshot_stack) == 0)
236 mc_state_t next_graph_state = NULL;
237 smx_req_t req = NULL, prev_req = NULL;
239 xbt_fifo_item_t item = NULL;
241 mc_snapshot_t next_snapshot;
242 mc_state_ws_t current_state;
243 mc_state_ws_t prev_state;
244 mc_state_ws_t next_state;
246 while(xbt_fifo_size(mc_snapshot_stack) > 0){
248 current_state = (mc_state_ws_t)xbt_fifo_get_item_content(xbt_fifo_get_first_item(mc_snapshot_stack));
251 XBT_DEBUG("**************************************************");
252 XBT_DEBUG("Depth : %d, State : %p , %u interleave", xbt_fifo_size(mc_snapshot_stack),current_state, MC_state_interleave_size(current_state->graph_state));
255 if((xbt_fifo_size(mc_snapshot_stack) < MAX_DEPTH) && (req = MC_state_get_request(current_state->graph_state, &value))){
257 /* Debug information */
258 if(XBT_LOG_ISENABLED(mc_dpor, xbt_log_priority_debug)){
259 req_str = MC_request_to_string(req, value);
260 XBT_DEBUG("Execute: %s", req_str);
264 MC_state_set_executed_request(current_state->graph_state, req, value);
266 /* Answer the request */
267 SIMIX_request_pre(req, value);
269 /* Wait for requests (schedules processes) */
270 MC_wait_for_requests();
272 /* Create the new expanded graph_state */
275 next_graph_state = MC_state_new();
277 /* Get an enabled process and insert it in the interleave set of the next graph_state */
278 xbt_swag_foreach(process, simix_global->process_list){
279 if(MC_process_is_enabled(process)){
280 MC_state_interleave_process(next_graph_state, process);
285 next_snapshot = xbt_new0(s_mc_snapshot_t, 1);
286 MC_take_snapshot(next_snapshot);
288 next_state = new_state_ws(next_snapshot, next_graph_state);
289 xbt_fifo_unshift(mc_snapshot_stack, next_state);
294 XBT_DEBUG("There are no more processes to interleave.");
296 /* Trash the current state, no longer needed */
298 xbt_fifo_shift(mc_snapshot_stack);
301 while((current_state = xbt_fifo_shift(mc_snapshot_stack)) != NULL){
302 req = MC_state_get_internal_request(current_state->graph_state);
303 xbt_fifo_foreach(mc_snapshot_stack, item, prev_state, mc_state_ws_t) {
304 if(MC_request_depend(req, MC_state_get_internal_request(prev_state->graph_state))){
305 if(XBT_LOG_ISENABLED(mc_dpor, xbt_log_priority_debug)){
306 XBT_DEBUG("Dependent Transitions:");
307 prev_req = MC_state_get_executed_request(prev_state->graph_state, &value);
308 req_str = MC_request_to_string(prev_req, value);
309 XBT_DEBUG("%s (state=%p)", req_str, prev_state->graph_state);
311 prev_req = MC_state_get_executed_request(current_state->graph_state, &value);
312 req_str = MC_request_to_string(prev_req, value);
313 XBT_DEBUG("%s (state=%p)", req_str, current_state->graph_state);
317 if(!MC_state_process_is_done(prev_state->graph_state, req->issuer)){
318 MC_state_interleave_process(prev_state->graph_state, req->issuer);
321 XBT_DEBUG("Process %p is in done set", req->issuer);
328 if(MC_state_interleave_size(current_state->graph_state)){
329 MC_restore_snapshot(current_state->system_state);
330 xbt_fifo_unshift(mc_snapshot_stack, current_state);
331 XBT_DEBUG("Back-tracking to depth %d", xbt_fifo_size(mc_snapshot_stack));
347 /************ DPOR 2 (invisible and independant transitions) ************/
350 void MC_dpor2_init(xbt_automaton_t a)
352 mc_pair_t initial_pair = NULL;
353 mc_state_t initial_graph_state = NULL;
354 mc_snapshot_t initial_system_state = NULL;
355 xbt_state_t initial_automaton_state = NULL;
356 smx_process_t process;
360 initial_graph_state = MC_state_new();
363 /* Wait for requests (schedules processes) */
364 MC_wait_for_requests();
367 xbt_swag_foreach(process, simix_global->process_list){
368 if(MC_process_is_enabled(process)){
369 MC_state_interleave_process(initial_graph_state, process);
375 unsigned int cursor = 0;
376 unsigned int cursor2 = 0;
377 xbt_state_t automaton_state = NULL;
379 xbt_transition_t transition_succ;
381 xbt_dynar_foreach(a->states, cursor, automaton_state){
382 if(automaton_state->type == -1){
383 xbt_dynar_foreach(automaton_state->out, cursor2, transition_succ){
384 res = MC_automaton_evaluate_label(a, transition_succ->label);
385 if((res == 1) || (res == 2)){
386 initial_automaton_state = transition_succ->dst;
392 if(xbt_fifo_size(mc_snapshot_stack) > 0)
396 if(xbt_fifo_size(mc_snapshot_stack) == 0){
398 xbt_dynar_foreach(a->states, cursor, automaton_state){
399 if(automaton_state->type == -1){
400 initial_automaton_state = automaton_state;
407 initial_system_state = xbt_new0(s_mc_snapshot_t, 1);
408 MC_take_snapshot(initial_system_state);
409 initial_pair = new_pair(initial_system_state, initial_graph_state, initial_automaton_state);
410 xbt_fifo_unshift(mc_snapshot_stack, initial_pair);
413 XBT_DEBUG("**************************************************");
414 XBT_DEBUG("Initial pair");
421 void MC_dpor2(xbt_automaton_t a, int search_cycle)
425 smx_req_t req = NULL, prev_req = NULL;
426 mc_state_t next_graph_state = NULL;
427 mc_snapshot_t next_system_state = NULL;
428 xbt_state_t next_automaton_state = NULL;
429 xbt_transition_t transition_succ;
432 mc_pair_t pair = NULL, next_pair = NULL, prev_pair = NULL;
433 smx_process_t process = NULL;
434 xbt_fifo_item_t item = NULL;
436 while (xbt_fifo_size(mc_snapshot_stack) > 0) {
438 /* Get current pair */
440 xbt_fifo_get_item_content(xbt_fifo_get_first_item(mc_snapshot_stack));
442 XBT_DEBUG("**************************************************");
443 XBT_DEBUG("Exploration depth=%d (pair=%p)(%u interleave)",
444 xbt_fifo_size(mc_snapshot_stack), pair,
445 MC_state_interleave_size(pair->graph_state));
447 /* Update statistics */
448 mc_stats_pair->visited_pairs++;
450 /* Test acceptance pair and acceptance cycle*/
452 if(pair->automaton_state->type == 1){
453 if(search_cycle == 0){
454 set_pair_reached(pair);
455 XBT_DEBUG("Acceptance pair : graph=%p, automaton=%p(%s)", pair->graph_state, pair->automaton_state, pair->automaton_state->id);
457 if(reached(pair) == 1){
458 XBT_INFO("*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*");
459 XBT_INFO("| ACCEPTANCE CYCLE |");
460 XBT_INFO("*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*");
461 XBT_INFO("Counter-example that violates formula :");
462 MC_show_snapshot_stack(mc_snapshot_stack);
463 MC_dump_snapshot_stack(mc_snapshot_stack);
464 MC_print_statistics_pairs(mc_stats_pair);
470 /* If there are processes to interleave and the maximum depth has not been reached
471 then perform one step of the exploration algorithm */
472 if (xbt_fifo_size(mc_snapshot_stack) < MAX_DEPTH &&
473 (req = MC_state_get_request(pair->graph_state, &value))) {
475 /* Debug information */
476 if(XBT_LOG_ISENABLED(mc_dpor, xbt_log_priority_debug)){
477 req_str = MC_request_to_string(req, value);
478 XBT_DEBUG("Execute: %s", req_str);
482 MC_state_set_executed_request(pair->graph_state, req, value);
483 //mc_stats_pairs->executed_transitions++;
485 /* Answer the request */
486 SIMIX_request_pre(req, value); /* After this call req is no longer usefull */
488 /* Wait for requests (schedules processes) */
489 MC_wait_for_requests();
491 /* Create the new expanded state */
493 next_graph_state = MC_state_new();
495 /* Get an enabled process and insert it in the interleave set of the next state */
496 xbt_swag_foreach(process, simix_global->process_list){
497 if(MC_process_is_enabled(process)){
498 MC_state_interleave_process(next_graph_state, process);
503 next_system_state = xbt_new0(s_mc_snapshot_t, 1);
504 MC_take_snapshot(next_system_state);
508 xbt_dynar_foreach(pair->automaton_state->out, cursor, transition_succ){
509 res = MC_automaton_evaluate_label(a, transition_succ->label);
510 if((res == 1) || (res == 2)){ // enabled transition in automaton
511 next_automaton_state = transition_succ->dst;
516 if(next_automaton_state == NULL){
517 next_automaton_state = pair->automaton_state;
521 next_pair = new_pair(next_system_state, next_graph_state, next_automaton_state);
522 xbt_fifo_unshift(mc_snapshot_stack, next_pair);
525 /* Let's loop again */
527 /* The interleave set is empty or the maximum depth is reached, let's back-track */
529 XBT_DEBUG("There are no more processes to interleave.");
531 /* Trash the current state, no longer needed */
533 xbt_fifo_shift(mc_snapshot_stack);
534 //MC_state_delete(state);
537 /* Check for deadlocks */
538 if(MC_deadlock_check()){
539 MC_show_deadlock(NULL);
544 /* Traverse the stack backwards until a state with a non empty interleave
545 set is found, deleting all the states that have it empty in the way.
546 For each deleted state, check if the request that has generated it
547 (from it's predecesor state), depends on any other previous request
548 executed before it. If it does then add it to the interleave set of the
549 state that executed that previous request. */
550 while ((pair = xbt_fifo_shift(mc_snapshot_stack)) != NULL) {
551 req = MC_state_get_internal_request(pair->graph_state);
552 xbt_fifo_foreach(mc_snapshot_stack, item, prev_pair, mc_pair_t) {
553 if(MC_request_depend(req, MC_state_get_internal_request(prev_pair->graph_state))){
554 if(XBT_LOG_ISENABLED(mc_dpor, xbt_log_priority_debug)){
555 XBT_DEBUG("Dependent Transitions:");
556 prev_req = MC_state_get_executed_request(prev_pair->graph_state, &value);
557 req_str = MC_request_to_string(prev_req, value);
558 XBT_DEBUG("%s (pair=%p)", req_str, prev_pair);
560 prev_req = MC_state_get_executed_request(pair->graph_state, &value);
561 req_str = MC_request_to_string(prev_req, value);
562 XBT_DEBUG("%s (pair=%p)", req_str, pair);
566 if(!MC_state_process_is_done(prev_pair->graph_state, req->issuer))
567 MC_state_interleave_process(prev_pair->graph_state, req->issuer);
569 XBT_DEBUG("Process %p is in done set", req->issuer);
574 if (MC_state_interleave_size(pair->graph_state)) {
575 /* We found a back-tracking point, let's loop */
576 MC_restore_snapshot(pair->system_state);
577 xbt_fifo_unshift(mc_snapshot_stack, pair);
578 XBT_DEBUG("Back-tracking to depth %d", xbt_fifo_size(mc_snapshot_stack));
582 //MC_state_delete(state);