1 /* Copyright (c) 2008-2012 Da SimGrid Team. All rights reserved. */
3 /* This program is free software; you can redistribute it and/or modify it
4 * under the terms of the license (GNU LGPL) which comes with this package. */
6 #include "mc_private.h"
10 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(mc_liveness, mc,
11 "Logging specific to algorithms for liveness properties verification");
13 xbt_dynar_t reached_pairs;
14 xbt_dynar_t successors;
16 int create_dump(int pair)
18 // Try to enable core dumps
19 struct rlimit core_limit;
20 core_limit.rlim_cur = RLIM_INFINITY;
21 core_limit.rlim_max = RLIM_INFINITY;
23 if(setrlimit(RLIMIT_CORE, &core_limit) < 0)
24 fprintf(stderr, "setrlimit: %s\nWarning: core dumps may be truncated or non-existant\n", strerror(errno));
29 // We are the child process -- run the actual program
34 // An error occurred, shouldn't happen
39 // We are the parent process -- wait for the child process to exit
42 if(WIFSIGNALED(status) && WCOREDUMP(status)){
43 char *core_name = malloc(20);
44 sprintf(core_name,"core_%d", pair);
45 rename("core", core_name);
53 int reached(xbt_state_t st){
55 raw_mem_set = (mmalloc_get_current_heap() == raw_heap);
59 mc_pair_reached_t new_pair = NULL;
60 new_pair = xbt_new0(s_mc_pair_reached_t, 1);
61 new_pair->nb = xbt_dynar_length(reached_pairs) + 1;
62 new_pair->automaton_state = st;
63 new_pair->prop_ato = xbt_dynar_new(sizeof(int), NULL);
64 new_pair->system_state = MC_take_snapshot_liveness();
66 /* Get values of propositional symbols */
69 unsigned int cursor = 0;
70 xbt_propositional_symbol_t ps = NULL;
71 xbt_dynar_foreach(_mc_property_automaton->propositional_symbols, cursor, ps){
72 f = (int_f_void_t)ps->function;
74 xbt_dynar_push_as(new_pair->prop_ato, int, res);
79 if(xbt_dynar_is_empty(reached_pairs) || !compare){
82 /* New pair reached */
83 xbt_dynar_push(reached_pairs, &new_pair);
93 mc_pair_reached_t pair_test = NULL;
95 xbt_dynar_foreach(reached_pairs, cursor, pair_test){
96 XBT_INFO("Pair reached #%d", pair_test->nb);
97 if(automaton_state_compare(pair_test->automaton_state, st) == 0){
98 if(propositional_symbols_compare_value(pair_test->prop_ato, new_pair->prop_ato) == 0){
99 if(snapshot_compare(new_pair->system_state, pair_test->system_state) == 0){
109 XBT_INFO("Different values of propositional symbols");
112 XBT_INFO("Different automaton state");
116 /* New pair reached */
117 xbt_dynar_push(reached_pairs, &new_pair);
134 void set_pair_reached(xbt_state_t st){
136 raw_mem_set = (mmalloc_get_current_heap() == raw_heap);
140 mc_pair_reached_t pair = NULL;
141 pair = xbt_new0(s_mc_pair_reached_t, 1);
142 pair->nb = xbt_dynar_length(reached_pairs) + 1;
143 pair->automaton_state = st;
144 pair->prop_ato = xbt_dynar_new(sizeof(int), NULL);
145 pair->system_state = MC_take_snapshot_liveness();
147 /* Get values of propositional symbols */
148 unsigned int cursor = 0;
149 xbt_propositional_symbol_t ps = NULL;
153 xbt_dynar_foreach(_mc_property_automaton->propositional_symbols, cursor, ps){
154 f = (int_f_void_t)ps->function;
156 xbt_dynar_push_as(pair->prop_ato, int, res);
159 xbt_dynar_push(reached_pairs, &pair);
170 void MC_pair_delete(mc_pair_t pair){
171 xbt_free(pair->graph_state->proc_status);
172 xbt_free(pair->graph_state);
178 int MC_automaton_evaluate_label(xbt_exp_label_t l){
182 int left_res = MC_automaton_evaluate_label(l->u.or_and.left_exp);
183 int right_res = MC_automaton_evaluate_label(l->u.or_and.right_exp);
184 return (left_res || right_res);
187 int left_res = MC_automaton_evaluate_label(l->u.or_and.left_exp);
188 int right_res = MC_automaton_evaluate_label(l->u.or_and.right_exp);
189 return (left_res && right_res);
192 int res = MC_automaton_evaluate_label(l->u.exp_not);
196 unsigned int cursor = 0;
197 xbt_propositional_symbol_t p = NULL;
199 xbt_dynar_foreach(_mc_property_automaton->propositional_symbols, cursor, p){
200 if(strcmp(p->pred, l->u.predicat) == 0){
201 f = (int_f_void_t)p->function;
216 /********************* Double-DFS stateless *******************/
218 void pair_stateless_free(mc_pair_stateless_t pair){
222 void pair_stateless_free_voidp(void *p){
223 pair_stateless_free((mc_pair_stateless_t) * (void **) p);
226 mc_pair_stateless_t new_pair_stateless(mc_state_t sg, xbt_state_t st, int r){
227 mc_pair_stateless_t p = NULL;
228 p = xbt_new0(s_mc_pair_stateless_t, 1);
229 p->automaton_state = st;
232 mc_stats_pair->expanded_pairs++;
236 void pair_reached_free(mc_pair_reached_t pair){
238 pair->automaton_state = NULL;
239 xbt_dynar_free(&(pair->prop_ato));
240 MC_free_snapshot(pair->system_state);
245 void pair_reached_free_voidp(void *p){
246 pair_reached_free((mc_pair_reached_t) * (void **) p);
249 void MC_ddfs_init(void){
251 raw_mem_set = (mmalloc_get_current_heap() == raw_heap);
253 XBT_INFO("**************************************************");
254 XBT_INFO("Double-DFS init");
255 XBT_INFO("**************************************************");
257 mc_pair_stateless_t mc_initial_pair = NULL;
258 mc_state_t initial_graph_state = NULL;
259 smx_process_t process;
262 MC_wait_for_requests();
266 initial_graph_state = MC_state_pair_new();
267 xbt_swag_foreach(process, simix_global->process_list){
268 if(MC_process_is_enabled(process)){
269 MC_state_interleave_process(initial_graph_state, process);
273 reached_pairs = xbt_dynar_new(sizeof(mc_pair_reached_t), pair_reached_free_voidp);
274 successors = xbt_dynar_new(sizeof(mc_pair_stateless_t), NULL);
276 /* Save the initial state */
277 initial_state_liveness = xbt_new0(s_mc_global_t, 1);
278 initial_state_liveness->initial_snapshot = MC_take_snapshot_liveness();
282 unsigned int cursor = 0;
285 xbt_dynar_foreach(_mc_property_automaton->states, cursor, state){
286 if(state->type == -1){
289 mc_initial_pair = new_pair_stateless(initial_graph_state, state, MC_state_interleave_size(initial_graph_state));
290 xbt_fifo_unshift(mc_stack_liveness, mc_initial_pair);
294 MC_restore_snapshot(initial_state_liveness->initial_snapshot);
301 if(state->type == 2){
304 mc_initial_pair = new_pair_stateless(initial_graph_state, state, MC_state_interleave_size(initial_graph_state));
305 xbt_fifo_unshift(mc_stack_liveness, mc_initial_pair);
308 set_pair_reached(state);
311 MC_restore_snapshot(initial_state_liveness->initial_snapshot);
330 void MC_ddfs(int search_cycle){
332 raw_mem_set = (mmalloc_get_current_heap() == raw_heap);
334 smx_process_t process;
335 mc_pair_stateless_t current_pair = NULL;
337 if(xbt_fifo_size(mc_stack_liveness) == 0)
341 /* Get current pair */
342 current_pair = (mc_pair_stateless_t)xbt_fifo_get_item_content(xbt_fifo_get_first_item(mc_stack_liveness));
344 /* Update current state in buchi automaton */
345 _mc_property_automaton->current_state = current_pair->automaton_state;
348 XBT_DEBUG("********************* ( Depth = %d, search_cycle = %d )", xbt_fifo_size(mc_stack_liveness), search_cycle);
350 mc_stats_pair->visited_pairs++;
355 mc_state_t next_graph_state = NULL;
356 smx_simcall_t req = NULL;
359 xbt_transition_t transition_succ;
360 unsigned int cursor = 0;
363 mc_pair_stateless_t next_pair = NULL;
364 mc_pair_stateless_t pair_succ;
366 if(xbt_fifo_size(mc_stack_liveness) < MAX_DEPTH_LIVENESS){
368 if(current_pair->requests > 0){
370 while((req = MC_state_get_request(current_pair->graph_state, &value)) != NULL){
372 /* Debug information */
374 req_str = MC_request_to_string(req, value);
375 XBT_DEBUG("Execute: %s", req_str);
378 MC_state_set_executed_request(current_pair->graph_state, req, value);
380 /* Answer the request */
381 SIMIX_simcall_pre(req, value);
383 /* Wait for requests (schedules processes) */
384 MC_wait_for_requests();
388 /* Create the new expanded graph_state */
389 next_graph_state = MC_state_pair_new();
391 /* Get enabled process and insert it in the interleave set of the next graph_state */
392 xbt_swag_foreach(process, simix_global->process_list){
393 if(MC_process_is_enabled(process)){
394 MC_state_interleave_process(next_graph_state, process);
398 xbt_dynar_reset(successors);
404 xbt_dynar_foreach(current_pair->automaton_state->out, cursor, transition_succ){
406 res = MC_automaton_evaluate_label(transition_succ->label);
408 if(res == 1){ // enabled transition in automaton
410 next_pair = new_pair_stateless(next_graph_state, transition_succ->dst, MC_state_interleave_size(next_graph_state));
411 xbt_dynar_push(successors, &next_pair);
419 xbt_dynar_foreach(current_pair->automaton_state->out, cursor, transition_succ){
421 res = MC_automaton_evaluate_label(transition_succ->label);
423 if(res == 2){ // true transition in automaton
425 next_pair = new_pair_stateless(next_graph_state, transition_succ->dst, MC_state_interleave_size(next_graph_state));
426 xbt_dynar_push(successors, &next_pair);
434 xbt_dynar_foreach(successors, cursor, pair_succ){
436 if(search_cycle == 1){
438 if((pair_succ->automaton_state->type == 1) || (pair_succ->automaton_state->type == 2)){
440 if(reached(pair_succ->automaton_state)){
442 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));
444 XBT_INFO("*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*");
445 XBT_INFO("| ACCEPTANCE CYCLE |");
446 XBT_INFO("*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*");
447 XBT_INFO("Counter-example that violates formula :");
448 MC_show_stack_liveness(mc_stack_liveness);
449 MC_dump_stack_liveness(mc_stack_liveness);
450 MC_print_statistics_pairs(mc_stats_pair);
455 XBT_DEBUG("Next pair (depth =%d) -> Acceptance pair (%s)", xbt_fifo_size(mc_stack_liveness) + 1, pair_succ->automaton_state->id);
457 XBT_DEBUG("Reached pairs : %lu", xbt_dynar_length(reached_pairs));
460 xbt_fifo_unshift(mc_stack_liveness, pair_succ);
463 MC_ddfs(search_cycle);
470 xbt_fifo_unshift(mc_stack_liveness, pair_succ);
473 MC_ddfs(search_cycle);
479 if(((pair_succ->automaton_state->type == 1) || (pair_succ->automaton_state->type == 2))){
481 XBT_DEBUG("Next pair (depth =%d) -> Acceptance pair (%s)", xbt_fifo_size(mc_stack_liveness) + 1, pair_succ->automaton_state->id);
483 set_pair_reached(pair_succ->automaton_state);
487 XBT_DEBUG("Reached pairs : %lu", xbt_dynar_length(reached_pairs));
492 xbt_fifo_unshift(mc_stack_liveness, pair_succ);
495 MC_ddfs(search_cycle);
500 /* Restore system before checking others successors */
501 if(cursor != (xbt_dynar_length(successors) - 1))
502 MC_replay_liveness(mc_stack_liveness, 1);
507 if(MC_state_interleave_size(current_pair->graph_state) > 0){
508 XBT_DEBUG("Backtracking to depth %d", xbt_fifo_size(mc_stack_liveness));
509 MC_replay_liveness(mc_stack_liveness, 0);
518 XBT_DEBUG("Max depth reached");
522 if(xbt_fifo_size(mc_stack_liveness) == MAX_DEPTH_LIVENESS ){
523 XBT_DEBUG("Pair (depth = %d) shifted in stack, maximum depth reached", xbt_fifo_size(mc_stack_liveness) );
525 XBT_DEBUG("Pair (depth = %d) shifted in stack", xbt_fifo_size(mc_stack_liveness) );
530 xbt_fifo_shift(mc_stack_liveness);
531 if((current_pair->automaton_state->type == 1) || (current_pair->automaton_state->type == 2)){
532 xbt_dynar_pop(reached_pairs, NULL);