Commit | Line | Data |
---|---|---|
34e49164 C |
1 | (*external c_counter : unit -> int = "c_counter"*) |
2 | let timeout = 800 | |
3 | (* Optimize triples_conj by first extracting the intersection of the two sets, | |
4 | which can certainly be in the intersection *) | |
5 | let pTRIPLES_CONJ_OPT = ref true | |
6 | (* For complement, make NegState for the negation of a single state *) | |
7 | let pTRIPLES_COMPLEMENT_OPT = ref true | |
8 | (* For complement, do something special for the case where the environment | |
9 | and witnesses are empty *) | |
10 | let pTRIPLES_COMPLEMENT_SIMPLE_OPT = ref true | |
11 | (* "Double negate" the arguments of the path operators *) | |
12 | let pDOUBLE_NEGATE_OPT = ref true | |
13 | (* Only do pre_forall/pre_exists on new elements in fixpoint iteration *) | |
14 | let pNEW_INFO_OPT = ref true | |
15 | (* Filter the result of the label function to drop entries that aren't | |
16 | compatible with any of the available environments *) | |
17 | let pREQUIRED_ENV_OPT = ref true | |
18 | (* Memoize the raw result of the label function *) | |
19 | let pSATLABEL_MEMO_OPT = ref true | |
20 | (* Filter results according to the required states *) | |
21 | let pREQUIRED_STATES_OPT = ref true | |
22 | (* Drop negative witnesses at Uncheck *) | |
23 | let pUNCHECK_OPT = ref true | |
24 | let pANY_NEG_OPT = ref true | |
25 | let pLazyOpt = ref true | |
26 | ||
485bce71 C |
27 | (* Nico: This stack is use for graphical traces *) |
28 | let graph_stack = ref ([] : string list) | |
29 | let graph_hash = (Hashtbl.create 101) | |
30 | ||
34e49164 C |
31 | (* |
32 | let pTRIPLES_CONJ_OPT = ref false | |
33 | let pTRIPLES_COMPLEMENT_OPT = ref false | |
34 | let pTRIPLES_COMPLEMENT_SIMPLE_OPT = ref false | |
35 | let pDOUBLE_NEGATE_OPT = ref false | |
36 | let pNEW_INFO_OPT = ref false | |
37 | let pREQUIRED_ENV_OPT = ref false | |
38 | let pSATLABEL_MEMO_OPT = ref false | |
39 | let pREQUIRED_STATES_OPT = ref false | |
40 | let pUNCHECK_OPT = ref false | |
41 | let pANY_NEG_OPT = ref false | |
42 | let pLazyOpt = ref false | |
43 | *) | |
44 | ||
45 | ||
46 | let step_count = ref 0 | |
47 | exception Steps | |
48 | let inc_step _ = | |
49 | if not (!step_count = 0) | |
50 | then | |
51 | begin | |
52 | step_count := !step_count - 1; | |
53 | if !step_count = 0 then raise Steps | |
54 | end | |
55 | ||
56 | let inc cell = cell := !cell + 1 | |
57 | ||
58 | let satEU_calls = ref 0 | |
59 | let satAW_calls = ref 0 | |
60 | let satAU_calls = ref 0 | |
61 | let satEF_calls = ref 0 | |
62 | let satAF_calls = ref 0 | |
63 | let satEG_calls = ref 0 | |
64 | let satAG_calls = ref 0 | |
65 | ||
66 | let triples = ref 0 | |
67 | ||
68 | let ctr = ref 0 | |
69 | let new_let _ = | |
70 | let c = !ctr in | |
71 | ctr := c + 1; | |
72 | Printf.sprintf "_fresh_r_%d" c | |
73 | ||
74 | (* ********************************************************************** | |
75 | * | |
76 | * Implementation of a Witness Tree model checking engine for CTL-FVex | |
77 | * | |
78 | * | |
79 | * **********************************************************************) | |
80 | ||
81 | (* ********************************************************************** *) | |
82 | (* Module: SUBST (substitutions: meta. vars and values) *) | |
83 | (* ********************************************************************** *) | |
84 | ||
85 | module type SUBST = | |
86 | sig | |
87 | type value | |
88 | type mvar | |
89 | val eq_mvar: mvar -> mvar -> bool | |
90 | val eq_val: value -> value -> bool | |
91 | val merge_val: value -> value -> value | |
92 | val print_mvar : mvar -> unit | |
93 | val print_value : value -> unit | |
94 | end | |
95 | ;; | |
96 | ||
97 | (* ********************************************************************** *) | |
98 | (* Module: GRAPH (control flow graphs / model) *) | |
99 | (* ********************************************************************** *) | |
100 | ||
101 | module type GRAPH = | |
102 | sig | |
103 | type node | |
104 | type cfg | |
105 | val predecessors: cfg -> node -> node list | |
106 | val successors: cfg -> node -> node list | |
107 | val extract_is_loop : cfg -> node -> bool | |
108 | val print_node : node -> unit | |
109 | val size : cfg -> int | |
485bce71 C |
110 | val print_graph : cfg -> string option -> |
111 | (node * string) list -> (node * string) list -> string -> unit | |
34e49164 C |
112 | end |
113 | ;; | |
114 | ||
115 | module OGRAPHEXT_GRAPH = | |
116 | struct | |
117 | type node = int;; | |
118 | type cfg = (string,unit) Ograph_extended.ograph_mutable;; | |
119 | let predecessors cfg n = List.map fst ((cfg#predecessors n)#tolist);; | |
120 | let print_node i = Format.print_string (Common.i_to_s i) | |
121 | end | |
122 | ;; | |
123 | ||
124 | (* ********************************************************************** *) | |
125 | (* Module: PREDICATE (predicates for CTL formulae) *) | |
126 | (* ********************************************************************** *) | |
127 | ||
128 | module type PREDICATE = | |
129 | sig | |
130 | type t | |
131 | val print_predicate : t -> unit | |
132 | end | |
133 | ||
134 | ||
135 | (* ********************************************************************** *) | |
136 | ||
137 | (* ---------------------------------------------------------------------- *) | |
138 | (* Misc. useful generic functions *) | |
139 | (* ---------------------------------------------------------------------- *) | |
140 | ||
485bce71 C |
141 | let get_graph_files () = !graph_stack |
142 | let get_graph_comp_files outfile = Hashtbl.find_all graph_hash outfile | |
143 | ||
34e49164 C |
144 | let head = List.hd |
145 | ||
146 | let tail l = | |
147 | match l with | |
148 | [] -> [] | |
149 | | (x::xs) -> xs | |
150 | ;; | |
151 | ||
152 | let foldl = List.fold_left;; | |
153 | ||
154 | let foldl1 f xs = foldl f (head xs) (tail xs) | |
155 | ||
156 | type 'a esc = ESC of 'a | CONT of 'a | |
157 | ||
158 | let foldr = List.fold_right;; | |
159 | ||
160 | let concat = List.concat;; | |
161 | ||
162 | let map = List.map;; | |
163 | ||
164 | let filter = List.filter;; | |
165 | ||
166 | let partition = List.partition;; | |
167 | ||
168 | let concatmap f l = List.concat (List.map f l);; | |
169 | ||
170 | let maybe f g opt = | |
171 | match opt with | |
172 | | None -> g | |
173 | | Some x -> f x | |
174 | ;; | |
175 | ||
176 | let some_map f opts = map (maybe (fun x -> Some (f x)) None) opts | |
177 | ||
178 | let some_tolist_alt opts = concatmap (maybe (fun x -> [x]) []) opts | |
179 | ||
180 | let rec some_tolist opts = | |
181 | match opts with | |
182 | | [] -> [] | |
183 | | (Some x)::rest -> x::(some_tolist rest) | |
184 | | _::rest -> some_tolist rest | |
185 | ;; | |
186 | ||
187 | let rec groupBy eq l = | |
188 | match l with | |
189 | [] -> [] | |
190 | | (x::xs) -> | |
191 | let (xs1,xs2) = partition (fun x' -> eq x x') xs in | |
192 | (x::xs1)::(groupBy eq xs2) | |
193 | ;; | |
194 | ||
195 | let group l = groupBy (=) l;; | |
196 | ||
197 | let rec memBy eq x l = | |
198 | match l with | |
199 | [] -> false | |
200 | | (y::ys) -> if (eq x y) then true else (memBy eq x ys) | |
201 | ;; | |
202 | ||
203 | let rec nubBy eq ls = | |
204 | match ls with | |
205 | [] -> [] | |
206 | | (x::xs) when (memBy eq x xs) -> nubBy eq xs | |
207 | | (x::xs) -> x::(nubBy eq xs) | |
208 | ;; | |
209 | ||
210 | let rec nub ls = | |
211 | match ls with | |
212 | [] -> [] | |
213 | | (x::xs) when (List.mem x xs) -> nub xs | |
214 | | (x::xs) -> x::(nub xs) | |
215 | ;; | |
216 | ||
217 | let state_compare (s1,_,_) (s2,_,_) = compare s1 s2 | |
218 | ||
219 | let setifyBy eq xs = nubBy eq xs;; | |
220 | ||
221 | let setify xs = nub xs;; | |
222 | ||
223 | let inner_setify xs = List.sort compare (nub xs);; | |
224 | ||
225 | let unionBy compare eq xs = function | |
226 | [] -> xs | |
227 | | ys -> | |
228 | let rec loop = function | |
229 | [] -> ys | |
230 | | x::xs -> if memBy eq x ys then loop xs else x::(loop xs) in | |
231 | List.sort compare (loop xs) | |
232 | ;; | |
233 | ||
234 | let union xs ys = unionBy state_compare (=) xs ys;; | |
235 | ||
236 | let setdiff xs ys = filter (fun x -> not (List.mem x ys)) xs;; | |
237 | ||
238 | let subseteqBy eq xs ys = List.for_all (fun x -> memBy eq x ys) xs;; | |
239 | ||
240 | let subseteq xs ys = List.for_all (fun x -> List.mem x ys) xs;; | |
241 | let supseteq xs ys = subseteq ys xs | |
242 | ||
243 | let setequalBy eq xs ys = (subseteqBy eq xs ys) & (subseteqBy eq ys xs);; | |
244 | ||
245 | let setequal xs ys = (subseteq xs ys) & (subseteq ys xs);; | |
246 | ||
247 | (* Fix point calculation *) | |
248 | let rec fix eq f x = | |
249 | let x' = f x in if (eq x' x) then x' else fix eq f x' | |
250 | ;; | |
251 | ||
252 | (* Fix point calculation on set-valued functions *) | |
253 | let setfix f x = (fix subseteq f x) (*if new is a subset of old, stop*) | |
254 | let setgfix f x = (fix supseteq f x) (*if new is a supset of old, stop*) | |
255 | ||
256 | let get_states l = nub (List.map (function (s,_,_) -> s) l) | |
257 | ||
258 | (* ********************************************************************** *) | |
259 | (* Module: CTL_ENGINE *) | |
260 | (* ********************************************************************** *) | |
261 | ||
262 | module CTL_ENGINE = | |
263 | functor (SUB : SUBST) -> | |
264 | functor (G : GRAPH) -> | |
265 | functor (P : PREDICATE) -> | |
266 | struct | |
267 | ||
268 | module A = Ast_ctl | |
269 | ||
270 | type substitution = (SUB.mvar, SUB.value) Ast_ctl.generic_substitution | |
271 | ||
272 | type ('pred,'anno) witness = | |
273 | (G.node, substitution, | |
274 | ('pred, SUB.mvar, 'anno) Ast_ctl.generic_ctl list) | |
275 | Ast_ctl.generic_witnesstree | |
276 | ||
277 | type ('pred,'anno) triples = | |
278 | (G.node * substitution * ('pred,'anno) witness list) list | |
279 | ||
280 | (* ---------------------------------------------------------------------- *) | |
281 | (* Pretty printing functions *) | |
282 | (* ---------------------------------------------------------------------- *) | |
283 | ||
284 | let (print_generic_substitution : substitution -> unit) = fun substxs -> | |
285 | let print_generic_subst = function | |
286 | A.Subst (mvar, v) -> | |
287 | SUB.print_mvar mvar; Format.print_string " --> "; SUB.print_value v | |
288 | | A.NegSubst (mvar, v) -> | |
289 | SUB.print_mvar mvar; Format.print_string " -/-> "; SUB.print_value v in | |
290 | Format.print_string "["; | |
291 | Common.print_between (fun () -> Format.print_string ";" ) | |
292 | print_generic_subst substxs; | |
293 | Format.print_string "]" | |
294 | ||
295 | let rec (print_generic_witness: ('pred, 'anno) witness -> unit) = | |
296 | function | |
297 | | A.Wit (state, subst, anno, childrens) -> | |
298 | Format.print_string "wit "; | |
299 | G.print_node state; | |
300 | print_generic_substitution subst; | |
301 | (match childrens with | |
302 | [] -> Format.print_string "{}" | |
303 | | _ -> | |
304 | Format.force_newline(); Format.print_string " "; Format.open_box 0; | |
305 | print_generic_witnesstree childrens; Format.close_box()) | |
306 | | A.NegWit(wit) -> | |
307 | Format.print_string "!"; | |
308 | print_generic_witness wit | |
309 | ||
310 | and (print_generic_witnesstree: ('pred,'anno) witness list -> unit) = | |
311 | fun witnesstree -> | |
312 | Format.open_box 1; | |
313 | Format.print_string "{"; | |
314 | Common.print_between | |
315 | (fun () -> Format.print_string ";"; Format.force_newline() ) | |
316 | print_generic_witness witnesstree; | |
317 | Format.print_string "}"; | |
318 | Format.close_box() | |
319 | ||
320 | and print_generic_triple (node,subst,tree) = | |
321 | G.print_node node; | |
322 | print_generic_substitution subst; | |
323 | print_generic_witnesstree tree | |
324 | ||
325 | and (print_generic_algo : ('pred,'anno) triples -> unit) = fun xs -> | |
326 | Format.print_string "<"; | |
327 | Common.print_between | |
328 | (fun () -> Format.print_string ";"; Format.force_newline()) | |
329 | print_generic_triple xs; | |
330 | Format.print_string ">" | |
331 | ;; | |
332 | ||
333 | let print_state (str : string) (l : ('pred,'anno) triples) = | |
334 | Printf.printf "%s\n" str; | |
335 | List.iter (function x -> | |
336 | print_generic_triple x; Format.print_newline(); flush stdout) | |
337 | (List.sort compare l); | |
338 | Printf.printf "\n" | |
339 | ||
340 | let print_required_states = function | |
341 | None -> Printf.printf "no required states\n" | |
342 | | Some states -> | |
343 | Printf.printf "required states: "; | |
344 | List.iter | |
345 | (function x -> | |
346 | G.print_node x; Format.print_string " "; Format.print_flush()) | |
347 | states; | |
348 | Printf.printf "\n" | |
349 | ||
350 | let mkstates states = function | |
351 | None -> states | |
352 | | Some states -> states | |
485bce71 C |
353 | |
354 | let print_graph grp required_states res str = function | |
355 | A.Exists (keep,v,phi) -> () | |
356 | | phi -> | |
357 | if !Flag_ctl.graphical_trace && not !Flag_ctl.checking_reachability | |
358 | then | |
359 | match phi with | |
360 | | A.Exists (keep,v,phi) -> () | |
361 | | _ -> | |
362 | let label = | |
363 | Printf.sprintf "%s%s" | |
364 | (String.escaped | |
365 | (Common.format_to_string | |
366 | (function _ -> | |
367 | Pretty_print_ctl.pp_ctl | |
368 | (P.print_predicate, SUB.print_mvar) | |
369 | false phi))) | |
370 | str in | |
371 | let file = (match !Flag.currentfile with | |
372 | None -> "graphical_trace" | |
373 | | Some f -> f | |
374 | ) in | |
375 | (if not (List.mem file !graph_stack) then | |
376 | graph_stack := file :: !graph_stack); | |
377 | let filename = Filename.temp_file (file^":") ".dot" in | |
378 | Hashtbl.add graph_hash file filename; | |
379 | G.print_graph grp | |
380 | (if !Flag_ctl.gt_without_label then None else (Some label)) | |
381 | (match required_states with | |
382 | None -> [] | |
383 | | Some required_states -> | |
384 | (List.map (function s -> (s,"blue")) required_states)) | |
385 | (List.map (function (s,_,_) -> (s,"\"#FF8080\"")) res) filename | |
386 | ||
387 | let print_graph_c grp required_states res ctr phi = | |
388 | let str = "iter: "^(string_of_int !ctr) in | |
389 | print_graph grp required_states res str phi | |
390 | ||
34e49164 C |
391 | (* ---------------------------------------------------------------------- *) |
392 | (* *) | |
393 | (* ---------------------------------------------------------------------- *) | |
394 | ||
395 | ||
396 | (* ************************* *) | |
397 | (* Substitutions *) | |
398 | (* ************************* *) | |
399 | ||
400 | let dom_sub sub = | |
401 | match sub with | |
402 | | A.Subst(x,_) -> x | |
403 | | A.NegSubst(x,_) -> x | |
404 | ;; | |
405 | ||
406 | let ran_sub sub = | |
407 | match sub with | |
408 | | A.Subst(_,x) -> x | |
409 | | A.NegSubst(_,x) -> x | |
410 | ;; | |
411 | ||
412 | let eq_subBy eqx eqv sub sub' = | |
413 | match (sub,sub') with | |
414 | | (A.Subst(x,v),A.Subst(x',v')) -> (eqx x x') && (eqv v v') | |
415 | | (A.NegSubst(x,v),A.NegSubst(x',v')) -> (eqx x x') && (eqv v v') | |
416 | | _ -> false | |
417 | ;; | |
418 | ||
419 | (* NOTE: functor *) | |
420 | let eq_sub sub sub' = eq_subBy SUB.eq_mvar SUB.eq_val sub sub' | |
421 | ||
422 | let eq_subst th th' = setequalBy eq_sub th th';; | |
423 | ||
424 | let merge_subBy eqx (===) (>+<) sub sub' = | |
425 | (* variable part is guaranteed to be the same *) | |
426 | match (sub,sub') with | |
427 | (A.Subst (x,v),A.Subst (x',v')) -> | |
428 | if (v === v') | |
429 | then Some [A.Subst(x, v >+< v')] | |
430 | else None | |
431 | | (A.NegSubst(x,v),A.Subst(x',v')) -> | |
432 | if (not (v === v')) | |
433 | then Some [A.Subst(x',v')] | |
434 | else None | |
435 | | (A.Subst(x,v),A.NegSubst(x',v')) -> | |
436 | if (not (v === v')) | |
437 | then Some [A.Subst(x,v)] | |
438 | else None | |
439 | | (A.NegSubst(x,v),A.NegSubst(x',v')) -> | |
440 | if (v === v') | |
441 | then | |
442 | let merged = v >+< v' in | |
443 | if merged = v && merged = v' | |
444 | then Some [A.NegSubst(x,v >+< v')] | |
445 | else | |
446 | (* positions are compatible, but not identical. keep apart. *) | |
447 | Some [A.NegSubst(x,v);A.NegSubst(x',v')] | |
448 | else Some [A.NegSubst(x,v);A.NegSubst(x',v')] | |
449 | ;; | |
450 | ||
451 | (* NOTE: functor *) | |
452 | let merge_sub sub sub' = | |
453 | merge_subBy SUB.eq_mvar SUB.eq_val SUB.merge_val sub sub' | |
454 | ||
455 | let clean_substBy eq cmp theta = List.sort cmp (nubBy eq theta);; | |
456 | ||
457 | (* NOTE: we sort by using the generic "compare" on (meta-)variable | |
458 | * names; we could also require a definition of compare for meta-variables | |
459 | * or substitutions but that seems like overkill for sorting | |
460 | *) | |
461 | let clean_subst theta = | |
462 | let res = | |
463 | clean_substBy eq_sub | |
464 | (fun s s' -> | |
465 | let res = compare (dom_sub s) (dom_sub s') in | |
466 | if res = 0 | |
467 | then | |
468 | match (s,s') with | |
469 | (A.Subst(_,_),A.NegSubst(_,_)) -> -1 | |
470 | | (A.NegSubst(_,_),A.Subst(_,_)) -> 1 | |
471 | | _ -> compare (ran_sub s) (ran_sub s') | |
472 | else res) | |
473 | theta in | |
474 | let rec loop = function | |
475 | [] -> [] | |
476 | | (A.Subst(x,v)::A.NegSubst(y,v')::rest) when SUB.eq_mvar x y -> | |
477 | loop (A.Subst(x,v)::rest) | |
478 | | x::xs -> x::(loop xs) in | |
479 | loop res | |
480 | ||
481 | let top_subst = [];; (* Always TRUE subst. *) | |
482 | ||
483 | (* Split a theta in two parts: one with (only) "x" and one without *) | |
484 | (* NOTE: functor *) | |
485 | let split_subst theta x = | |
486 | partition (fun sub -> SUB.eq_mvar (dom_sub sub) x) theta;; | |
487 | ||
488 | exception SUBST_MISMATCH | |
489 | let conj_subst theta theta' = | |
490 | match (theta,theta') with | |
491 | | ([],_) -> Some theta' | |
492 | | (_,[]) -> Some theta | |
493 | | _ -> | |
494 | let rec classify = function | |
495 | [] -> [] | |
496 | | [x] -> [(dom_sub x,[x])] | |
497 | | x::xs -> | |
498 | (match classify xs with | |
499 | ((nm,y)::ys) as res -> | |
500 | if dom_sub x = nm | |
501 | then (nm,x::y)::ys | |
502 | else (dom_sub x,[x])::res | |
503 | | _ -> failwith "not possible") in | |
504 | let merge_all theta theta' = | |
505 | foldl | |
506 | (function rest -> | |
507 | function sub -> | |
508 | foldl | |
509 | (function rest -> | |
510 | function sub' -> | |
511 | match (merge_sub sub sub') with | |
512 | Some subs -> subs @ rest | |
513 | | _ -> raise SUBST_MISMATCH) | |
514 | rest theta') | |
515 | [] theta in | |
516 | let rec loop = function | |
517 | ([],ctheta') -> | |
518 | List.concat (List.map (function (_,ths) -> ths) ctheta') | |
519 | | (ctheta,[]) -> | |
520 | List.concat (List.map (function (_,ths) -> ths) ctheta) | |
521 | | ((x,ths)::xs,(y,ths')::ys) -> | |
522 | (match compare x y with | |
523 | 0 -> (merge_all ths ths') @ loop (xs,ys) | |
524 | | -1 -> ths @ loop (xs,((y,ths')::ys)) | |
525 | | 1 -> ths' @ loop (((x,ths)::xs),ys) | |
526 | | _ -> failwith "not possible") in | |
527 | try Some (clean_subst(loop (classify theta, classify theta'))) | |
528 | with SUBST_MISMATCH -> None | |
529 | ;; | |
530 | ||
531 | (* theta' must be a subset of theta *) | |
532 | let conj_subst_none theta theta' = | |
533 | match (theta,theta') with | |
534 | | (_,[]) -> Some theta | |
535 | | ([],_) -> None | |
536 | | _ -> | |
537 | let rec classify = function | |
538 | [] -> [] | |
539 | | [x] -> [(dom_sub x,[x])] | |
540 | | x::xs -> | |
541 | (match classify xs with | |
542 | ((nm,y)::ys) as res -> | |
543 | if dom_sub x = nm | |
544 | then (nm,x::y)::ys | |
545 | else (dom_sub x,[x])::res | |
546 | | _ -> failwith "not possible") in | |
547 | let merge_all theta theta' = | |
548 | foldl | |
549 | (function rest -> | |
550 | function sub -> | |
551 | foldl | |
552 | (function rest -> | |
553 | function sub' -> | |
554 | match (merge_sub sub sub') with | |
555 | Some subs -> subs @ rest | |
556 | | _ -> raise SUBST_MISMATCH) | |
557 | rest theta') | |
558 | [] theta in | |
559 | let rec loop = function | |
560 | (ctheta,[]) -> | |
561 | List.concat (List.map (function (_,ths) -> ths) ctheta) | |
562 | | ([],ctheta') -> raise SUBST_MISMATCH | |
563 | | ((x,ths)::xs,(y,ths')::ys) -> | |
564 | (match compare x y with | |
565 | 0 -> (merge_all ths ths') @ loop (xs,ys) | |
566 | | -1 -> ths @ loop (xs,((y,ths')::ys)) | |
567 | | 1 -> raise SUBST_MISMATCH | |
568 | | _ -> failwith "not possible") in | |
569 | try Some (clean_subst(loop (classify theta, classify theta'))) | |
570 | with SUBST_MISMATCH -> None | |
571 | ;; | |
572 | ||
573 | let negate_sub sub = | |
574 | match sub with | |
575 | | A.Subst(x,v) -> A.NegSubst (x,v) | |
576 | | A.NegSubst(x,v) -> A.Subst(x,v) | |
577 | ;; | |
578 | ||
579 | (* Turn a (big) theta into a list of (small) thetas *) | |
580 | let negate_subst theta = (map (fun sub -> [negate_sub sub]) theta);; | |
581 | ||
582 | ||
583 | (* ************************* *) | |
584 | (* Witnesses *) | |
585 | (* ************************* *) | |
586 | ||
587 | (* Always TRUE witness *) | |
588 | let top_wit = ([] : (('pred, 'anno) witness list));; | |
589 | ||
590 | let eq_wit wit wit' = wit = wit';; | |
591 | ||
592 | let union_wit wit wit' = (*List.sort compare (wit' @ wit) for popl*) | |
593 | let res = unionBy compare (=) wit wit' in | |
594 | let anynegwit = (* if any is neg, then all are *) | |
595 | List.exists (function A.NegWit _ -> true | A.Wit _ -> false) in | |
596 | if anynegwit res | |
597 | then List.filter (function A.NegWit _ -> true | A.Wit _ -> false) res | |
598 | else res | |
599 | ||
600 | let negate_wit wit = A.NegWit wit (* | |
601 | match wit with | |
602 | | A.Wit(s,th,anno,ws) -> A.NegWitWit(s,th,anno,ws) | |
603 | | A.NegWitWit(s,th,anno,ws) -> A.Wit(s,th,anno,ws)*) | |
604 | ;; | |
605 | ||
606 | let negate_wits wits = | |
607 | List.sort compare (map (fun wit -> [negate_wit wit]) wits);; | |
608 | ||
609 | let unwitify trips = | |
610 | let anynegwit = (* if any is neg, then all are *) | |
611 | List.exists (function A.NegWit _ -> true | A.Wit _ -> false) in | |
612 | setify | |
613 | (List.fold_left | |
614 | (function prev -> | |
615 | function (s,th,wit) -> | |
616 | if anynegwit wit then prev else (s,th,top_wit)::prev) | |
617 | [] trips) | |
618 | ||
619 | (* ************************* *) | |
620 | (* Triples *) | |
621 | (* ************************* *) | |
622 | ||
623 | (* Triples are equal when the constituents are equal *) | |
624 | let eq_trip (s,th,wit) (s',th',wit') = | |
625 | (s = s') && (eq_wit wit wit') && (eq_subst th th');; | |
626 | ||
627 | let triples_top states = map (fun s -> (s,top_subst,top_wit)) states;; | |
628 | ||
629 | let normalize trips = | |
630 | List.map | |
631 | (function (st,th,wit) -> (st,List.sort compare th,List.sort compare wit)) | |
632 | trips | |
633 | ||
634 | ||
635 | (* conj opt doesn't work ((1,[],{{x=3}}) v (1,[],{{x=4}})) & (1,[],{{x=4}}) = | |
636 | (1,[],{{x=3},{x=4}}), not (1,[],{{x=4}}) *) | |
637 | let triples_conj trips trips' = | |
638 | let (trips,shared,trips') = | |
639 | if false && !pTRIPLES_CONJ_OPT (* see comment above *) | |
640 | then | |
641 | let (shared,trips) = | |
642 | List.partition (function t -> List.mem t trips') trips in | |
643 | let trips' = | |
644 | List.filter (function t -> not(List.mem t shared)) trips' in | |
645 | (trips,shared,trips') | |
646 | else (trips,[],trips') in | |
647 | foldl (* returns a set - setify inlined *) | |
648 | (function rest -> | |
649 | function (s1,th1,wit1) -> | |
650 | foldl | |
651 | (function rest -> | |
652 | function (s2,th2,wit2) -> | |
653 | if (s1 = s2) then | |
654 | (match (conj_subst th1 th2) with | |
655 | Some th -> | |
656 | let t = (s1,th,union_wit wit1 wit2) in | |
657 | if List.mem t rest then rest else t::rest | |
658 | | _ -> rest) | |
659 | else rest) | |
660 | rest trips') | |
661 | shared trips | |
662 | ;; | |
663 | ||
664 | (* ignore the state in the right argument. always pretend it is the same as | |
665 | the left one *) | |
666 | (* env on right has to be a subset of env on left *) | |
667 | let triples_conj_none trips trips' = | |
668 | let (trips,shared,trips') = | |
669 | if false && !pTRIPLES_CONJ_OPT (* see comment above *) | |
670 | then | |
671 | let (shared,trips) = | |
672 | List.partition (function t -> List.mem t trips') trips in | |
673 | let trips' = | |
674 | List.filter (function t -> not(List.mem t shared)) trips' in | |
675 | (trips,shared,trips') | |
676 | else (trips,[],trips') in | |
677 | foldl (* returns a set - setify inlined *) | |
678 | (function rest -> | |
679 | function (s1,th1,wit1) -> | |
680 | foldl | |
681 | (function rest -> | |
682 | function (s2,th2,wit2) -> | |
683 | match (conj_subst_none th1 th2) with | |
684 | Some th -> | |
685 | let t = (s1,th,union_wit wit1 wit2) in | |
686 | if List.mem t rest then rest else t::rest | |
687 | | _ -> rest) | |
688 | rest trips') | |
689 | shared trips | |
690 | ;; | |
691 | ||
692 | exception AW | |
693 | ||
694 | let triples_conj_AW trips trips' = | |
695 | let (trips,shared,trips') = | |
696 | if false && !pTRIPLES_CONJ_OPT | |
697 | then | |
698 | let (shared,trips) = | |
699 | List.partition (function t -> List.mem t trips') trips in | |
700 | let trips' = | |
701 | List.filter (function t -> not(List.mem t shared)) trips' in | |
702 | (trips,shared,trips') | |
703 | else (trips,[],trips') in | |
704 | foldl (* returns a set - setify inlined *) | |
705 | (function rest -> | |
706 | function (s1,th1,wit1) -> | |
707 | foldl | |
708 | (function rest -> | |
709 | function (s2,th2,wit2) -> | |
710 | if (s1 = s2) then | |
711 | (match (conj_subst th1 th2) with | |
712 | Some th -> | |
713 | let t = (s1,th,union_wit wit1 wit2) in | |
714 | if List.mem t rest then rest else t::rest | |
715 | | _ -> raise AW) | |
716 | else rest) | |
717 | rest trips') | |
718 | shared trips | |
719 | ;; | |
720 | ||
721 | (* *************************** *) | |
722 | (* NEGATION (NegState style) *) | |
723 | (* *************************** *) | |
724 | ||
725 | (* Constructive negation at the state level *) | |
726 | type ('a) state = | |
727 | PosState of 'a | |
728 | | NegState of 'a list | |
729 | ;; | |
730 | ||
731 | let compatible_states = function | |
732 | (PosState s1, PosState s2) -> | |
733 | if s1 = s2 then Some (PosState s1) else None | |
734 | | (PosState s1, NegState s2) -> | |
735 | if List.mem s1 s2 then None else Some (PosState s1) | |
736 | | (NegState s1, PosState s2) -> | |
737 | if List.mem s2 s1 then None else Some (PosState s2) | |
738 | | (NegState s1, NegState s2) -> Some (NegState (s1 @ s2)) | |
739 | ;; | |
740 | ||
741 | (* Conjunction on triples with "special states" *) | |
742 | let triples_state_conj trips trips' = | |
743 | let (trips,shared,trips') = | |
744 | if !pTRIPLES_CONJ_OPT | |
745 | then | |
746 | let (shared,trips) = | |
747 | List.partition (function t -> List.mem t trips') trips in | |
748 | let trips' = | |
749 | List.filter (function t -> not(List.mem t shared)) trips' in | |
750 | (trips,shared,trips') | |
751 | else (trips,[],trips') in | |
752 | foldl | |
753 | (function rest -> | |
754 | function (s1,th1,wit1) -> | |
755 | foldl | |
756 | (function rest -> | |
757 | function (s2,th2,wit2) -> | |
758 | match compatible_states(s1,s2) with | |
759 | Some s -> | |
760 | (match (conj_subst th1 th2) with | |
761 | Some th -> | |
762 | let t = (s,th,union_wit wit1 wit2) in | |
763 | if List.mem t rest then rest else t::rest | |
764 | | _ -> rest) | |
765 | | _ -> rest) | |
766 | rest trips') | |
767 | shared trips | |
768 | ;; | |
769 | ||
770 | let triple_negate (s,th,wits) = | |
771 | let negstates = (NegState [s],top_subst,top_wit) in | |
772 | let negths = map (fun th -> (PosState s,th,top_wit)) (negate_subst th) in | |
773 | let negwits = map (fun nwit -> (PosState s,th,nwit)) (negate_wits wits) in | |
774 | negstates :: (negths @ negwits) (* all different *) | |
775 | ||
776 | (* FIX ME: it is not necessary to do full conjunction *) | |
777 | let triples_complement states (trips : ('pred, 'anno) triples) = | |
778 | if !pTRIPLES_COMPLEMENT_OPT | |
779 | then | |
780 | (let cleanup (s,th,wit) = | |
781 | match s with | |
782 | PosState s' -> [(s',th,wit)] | |
783 | | NegState ss -> | |
784 | assert (th=top_subst); | |
785 | assert (wit=top_wit); | |
786 | map (fun st -> (st,top_subst,top_wit)) (setdiff states ss) in | |
787 | let (simple,complex) = | |
788 | if !pTRIPLES_COMPLEMENT_SIMPLE_OPT | |
789 | then | |
790 | let (simple,complex) = | |
791 | List.partition (function (s,[],[]) -> true | _ -> false) trips in | |
792 | let simple = | |
793 | [(NegState(List.map (function (s,_,_) -> s) simple), | |
794 | top_subst,top_wit)] in | |
795 | (simple,complex) | |
796 | else ([(NegState [],top_subst,top_wit)],trips) in | |
797 | let rec compl trips = | |
798 | match trips with | |
799 | [] -> simple | |
800 | | (t::ts) -> triples_state_conj (triple_negate t) (compl ts) in | |
801 | let compld = (compl complex) in | |
802 | let compld = concatmap cleanup compld in | |
803 | compld) | |
804 | else | |
805 | let negstates (st,th,wits) = | |
806 | map (function st -> (st,top_subst,top_wit)) (setdiff states [st]) in | |
807 | let negths (st,th,wits) = | |
808 | map (function th -> (st,th,top_wit)) (negate_subst th) in | |
809 | let negwits (st,th,wits) = | |
810 | map (function nwit -> (st,th,nwit)) (negate_wits wits) in | |
811 | match trips with | |
812 | [] -> map (function st -> (st,top_subst,top_wit)) states | |
813 | | x::xs -> | |
814 | setify | |
815 | (foldl | |
816 | (function prev -> | |
817 | function cur -> | |
818 | triples_conj (negstates cur @ negths cur @ negwits cur) prev) | |
819 | (negstates x @ negths x @ negwits x) xs) | |
820 | ;; | |
821 | ||
822 | let triple_negate (s,th,wits) = | |
823 | let negths = map (fun th -> (s,th,top_wit)) (negate_subst th) in | |
824 | let negwits = map (fun nwit -> (s,th,nwit)) (negate_wits wits) in | |
825 | ([s], negths @ negwits) (* all different *) | |
826 | ||
827 | let print_compl_state str (n,p) = | |
828 | Printf.printf "%s neg: " str; | |
829 | List.iter | |
830 | (function x -> G.print_node x; Format.print_flush(); Printf.printf " ") | |
831 | n; | |
832 | Printf.printf "\n"; | |
833 | print_state "pos" p | |
834 | ||
835 | let triples_complement states (trips : ('pred, 'anno) triples) = | |
836 | if trips = [] | |
837 | then map (function st -> (st,top_subst,top_wit)) states | |
838 | else | |
839 | let cleanup (neg,pos) = | |
840 | let keep_pos = | |
841 | List.filter (function (s,_,_) -> List.mem s neg) pos in | |
842 | (map (fun st -> (st,top_subst,top_wit)) (setdiff states neg)) @ | |
843 | keep_pos in | |
844 | let trips = List.sort state_compare trips in | |
845 | let all_negated = List.map triple_negate trips in | |
846 | let merge_one (neg1,pos1) (neg2,pos2) = | |
847 | let (pos1conj,pos1keep) = | |
848 | List.partition (function (s,_,_) -> List.mem s neg2) pos1 in | |
849 | let (pos2conj,pos2keep) = | |
850 | List.partition (function (s,_,_) -> List.mem s neg1) pos2 in | |
851 | (Common.union_set neg1 neg2, | |
852 | (triples_conj pos1conj pos2conj) @ pos1keep @ pos2keep) in | |
853 | let rec inner_loop = function | |
854 | x1::x2::rest -> (merge_one x1 x2) :: (inner_loop rest) | |
855 | | l -> l in | |
856 | let rec outer_loop = function | |
857 | [x] -> x | |
858 | | l -> outer_loop (inner_loop l) in | |
859 | cleanup (outer_loop all_negated) | |
860 | ||
861 | (* ********************************** *) | |
862 | (* END OF NEGATION (NegState style) *) | |
863 | (* ********************************** *) | |
864 | ||
865 | (* now this is always true, so we could get rid of it *) | |
866 | let something_dropped = ref true | |
867 | ||
868 | let triples_union trips trips' = | |
869 | (*unionBy compare eq_trip trips trips';;*) | |
870 | (* returns -1 is t1 > t2, 1 if t2 >= t1, and 0 otherwise *) | |
871 | (* | |
872 | The following does not work. Suppose we have ([x->3],{A}) and ([],{A,B}). | |
873 | Then, the following says that since the first is a more restrictive | |
874 | environment and has fewer witnesses, then it should be dropped. But having | |
875 | fewer witnesses is not necessarily less informative than having more, | |
876 | because fewer witnesses can mean the absence of the witness-causing thing. | |
877 | So the fewer witnesses have to be kept around. | |
878 | subseteq changed to = to make it hopefully work | |
879 | *) | |
880 | if !pNEW_INFO_OPT | |
881 | then | |
882 | begin | |
883 | something_dropped := false; | |
884 | if trips = trips' | |
885 | then (something_dropped := true; trips) | |
886 | else | |
887 | let subsumes (s1,th1,wit1) (s2,th2,wit2) = | |
888 | if s1 = s2 | |
889 | then | |
890 | (match conj_subst th1 th2 with | |
891 | Some conj -> | |
892 | if conj = th1 | |
893 | then if (*subseteq*) wit1 = wit2 then 1 else 0 | |
894 | else | |
895 | if conj = th2 | |
896 | then if (*subseteq*) wit2 = wit1 then (-1) else 0 | |
897 | else 0 | |
898 | | None -> 0) | |
899 | else 0 in | |
900 | let rec first_loop second = function | |
901 | [] -> second | |
902 | | x::xs -> first_loop (second_loop x second) xs | |
903 | and second_loop x = function | |
904 | [] -> [x] | |
905 | | (y::ys) as all -> | |
906 | match subsumes x y with | |
907 | 1 -> something_dropped := true; all | |
908 | | (-1) -> second_loop x ys | |
909 | | _ -> y::(second_loop x ys) in | |
910 | first_loop trips trips' | |
911 | end | |
912 | else unionBy compare eq_trip trips trips' | |
913 | ||
914 | ||
915 | let triples_witness x unchecked not_keep trips = | |
916 | let anyneg = (* if any is neg, then all are *) | |
917 | List.exists (function A.NegSubst _ -> true | A.Subst _ -> false) in | |
918 | let anynegwit = (* if any is neg, then all are *) | |
919 | List.exists (function A.NegWit _ -> true | A.Wit _ -> false) in | |
920 | let allnegwit = (* if any is neg, then all are *) | |
921 | List.for_all (function A.NegWit _ -> true | A.Wit _ -> false) in | |
922 | let negtopos = | |
923 | List.map (function A.NegWit w -> w | A.Wit _ -> failwith "bad wit")in | |
924 | let res = | |
925 | List.fold_left | |
926 | (function prev -> | |
927 | function (s,th,wit) as t -> | |
928 | let (th_x,newth) = split_subst th x in | |
929 | match th_x with | |
930 | [] -> | |
931 | (* one consider whether if not not_keep is true, then we should | |
932 | fail. but it could be that the variable is a used_after and | |
933 | then it is the later rule that should fail and not this one *) | |
934 | if not not_keep && !Flag_ctl.verbose_ctl_engine | |
935 | then | |
936 | (SUB.print_mvar x; Format.print_flush(); | |
937 | print_state ": empty witness from" [t]); | |
938 | t::prev | |
939 | | l when anyneg l && !pANY_NEG_OPT -> prev | |
940 | (* see tests/nestseq for how neg bindings can come up even | |
941 | without eg partial matches | |
942 | (* negated substitution only allowed with negwits. | |
943 | just dropped *) | |
944 | if anynegwit wit && allnegwit wit (* nonempty negwit list *) | |
945 | then prev | |
946 | else | |
947 | (print_generic_substitution l; Format.print_newline(); | |
948 | failwith"unexpected negative binding with positive witnesses")*) | |
949 | | _ -> | |
950 | let new_triple = | |
951 | if unchecked or not_keep | |
952 | then (s,newth,wit) | |
953 | else | |
954 | if anynegwit wit && allnegwit wit | |
955 | then (s,newth,[A.NegWit(A.Wit(s,th_x,[],negtopos wit))]) | |
956 | else (s,newth,[A.Wit(s,th_x,[],wit)]) in | |
957 | new_triple::prev) | |
958 | [] trips in | |
959 | if unchecked || !Flag_ctl.partial_match (* the only way to have a NegWit *) | |
960 | then setify res | |
961 | else List.rev res | |
962 | ;; | |
963 | ||
964 | ||
965 | (* ---------------------------------------------------------------------- *) | |
966 | (* SAT - Model Checking Algorithm for CTL-FVex *) | |
967 | (* *) | |
968 | (* TODO: Implement _all_ operators (directly) *) | |
969 | (* ---------------------------------------------------------------------- *) | |
970 | ||
971 | ||
972 | (* ************************************* *) | |
973 | (* The SAT algorithm and special helpers *) | |
974 | (* ************************************* *) | |
975 | ||
976 | let rec pre_exist dir (grp,_,_) y reqst = | |
977 | let check s = | |
978 | match reqst with None -> true | Some reqst -> List.mem s reqst in | |
979 | let exp (s,th,wit) = | |
980 | concatmap | |
981 | (fun s' -> if check s' then [(s',th,wit)] else []) | |
982 | (match dir with | |
983 | A.FORWARD -> G.predecessors grp s | |
984 | | A.BACKWARD -> G.successors grp s) in | |
985 | setify (concatmap exp y) | |
986 | ;; | |
987 | ||
988 | exception Empty | |
989 | ||
990 | let pre_forall dir (grp,_,states) y all reqst = | |
991 | let check s = | |
992 | match reqst with | |
993 | None -> true | Some reqst -> List.mem s reqst in | |
994 | let pred = | |
995 | match dir with | |
996 | A.FORWARD -> G.predecessors | A.BACKWARD -> G.successors in | |
997 | let succ = | |
998 | match dir with | |
999 | A.FORWARD -> G.successors | A.BACKWARD -> G.predecessors in | |
1000 | let neighbors = | |
1001 | List.map | |
1002 | (function p -> (p,succ grp p)) | |
1003 | (setify | |
1004 | (concatmap | |
1005 | (function (s,_,_) -> List.filter check (pred grp s)) y)) in | |
1006 | (* would a hash table be more efficient? *) | |
1007 | let all = List.sort state_compare all in | |
1008 | let rec up_nodes child s = function | |
1009 | [] -> [] | |
1010 | | (s1,th,wit)::xs -> | |
1011 | (match compare s1 child with | |
1012 | -1 -> up_nodes child s xs | |
1013 | | 0 -> (s,th,wit)::(up_nodes child s xs) | |
1014 | | _ -> []) in | |
1015 | let neighbor_triples = | |
1016 | List.fold_left | |
1017 | (function rest -> | |
1018 | function (s,children) -> | |
1019 | try | |
1020 | (List.map | |
1021 | (function child -> | |
1022 | match up_nodes child s all with [] -> raise Empty | l -> l) | |
1023 | children) :: rest | |
1024 | with Empty -> rest) | |
1025 | [] neighbors in | |
1026 | match neighbor_triples with | |
1027 | [] -> [] | |
1028 | | _ -> | |
1029 | (*normalize*) | |
1030 | (foldl1 (@) (List.map (foldl1 triples_conj) neighbor_triples)) | |
1031 | ||
1032 | let pre_forall_AW dir (grp,_,states) y all reqst = | |
1033 | let check s = | |
1034 | match reqst with | |
1035 | None -> true | Some reqst -> List.mem s reqst in | |
1036 | let pred = | |
1037 | match dir with | |
1038 | A.FORWARD -> G.predecessors | A.BACKWARD -> G.successors in | |
1039 | let succ = | |
1040 | match dir with | |
1041 | A.FORWARD -> G.successors | A.BACKWARD -> G.predecessors in | |
1042 | let neighbors = | |
1043 | List.map | |
1044 | (function p -> (p,succ grp p)) | |
1045 | (setify | |
1046 | (concatmap | |
1047 | (function (s,_,_) -> List.filter check (pred grp s)) y)) in | |
1048 | (* would a hash table be more efficient? *) | |
1049 | let all = List.sort state_compare all in | |
1050 | let rec up_nodes child s = function | |
1051 | [] -> [] | |
1052 | | (s1,th,wit)::xs -> | |
1053 | (match compare s1 child with | |
1054 | -1 -> up_nodes child s xs | |
1055 | | 0 -> (s,th,wit)::(up_nodes child s xs) | |
1056 | | _ -> []) in | |
1057 | let neighbor_triples = | |
1058 | List.fold_left | |
1059 | (function rest -> | |
1060 | function (s,children) -> | |
1061 | (List.map | |
1062 | (function child -> | |
1063 | match up_nodes child s all with [] -> raise AW | l -> l) | |
1064 | children) :: rest) | |
1065 | [] neighbors in | |
1066 | match neighbor_triples with | |
1067 | [] -> [] | |
1068 | | _ -> foldl1 (@) (List.map (foldl1 triples_conj_AW) neighbor_triples) | |
1069 | ||
1070 | (* drop_negwits will call setify *) | |
1071 | let satEX dir m s reqst = pre_exist dir m s reqst;; | |
1072 | ||
1073 | let satAX dir m s reqst = pre_forall dir m s s reqst | |
1074 | ;; | |
1075 | ||
1076 | (* E[phi1 U phi2] == phi2 \/ (phi1 /\ EXE[phi1 U phi2]) *) | |
485bce71 | 1077 | let satEU dir ((_,_,states) as m) s1 s2 reqst print_graph = |
978fd7e5 C |
1078 | (*Printf.printf "EU\n"; |
1079 | let ctr = ref 0 in*) | |
34e49164 C |
1080 | inc satEU_calls; |
1081 | if s1 = [] | |
1082 | then s2 | |
1083 | else | |
1084 | (*let ctr = ref 0 in*) | |
1085 | if !pNEW_INFO_OPT | |
1086 | then | |
1087 | let rec f y new_info = | |
1088 | inc_step(); | |
1089 | match new_info with | |
1090 | [] -> y | |
1091 | | new_info -> | |
978fd7e5 C |
1092 | (*ctr := !ctr + 1; |
1093 | print_graph y ctr;*) | |
34e49164 C |
1094 | let first = triples_conj s1 (pre_exist dir m new_info reqst) in |
1095 | let res = triples_union first y in | |
1096 | let new_info = setdiff res y in | |
1097 | (*Printf.printf "iter %d res %d new_info %d\n" | |
1098 | !ctr (List.length res) (List.length new_info); | |
978fd7e5 C |
1099 | print_state "res" res; |
1100 | print_state "new_info" new_info; | |
34e49164 C |
1101 | flush stdout;*) |
1102 | f res new_info in | |
1103 | f s2 s2 | |
1104 | else | |
1105 | let f y = | |
1106 | inc_step(); | |
978fd7e5 C |
1107 | (*ctr := !ctr + 1; |
1108 | print_graph y ctr;*) | |
34e49164 C |
1109 | let pre = pre_exist dir m y reqst in |
1110 | triples_union s2 (triples_conj s1 pre) in | |
1111 | setfix f s2 | |
1112 | ;; | |
1113 | ||
1114 | (* EF phi == E[true U phi] *) | |
1115 | let satEF dir m s2 reqst = | |
1116 | inc satEF_calls; | |
1117 | (*let ctr = ref 0 in*) | |
1118 | if !pNEW_INFO_OPT | |
1119 | then | |
1120 | let rec f y new_info = | |
1121 | inc_step(); | |
1122 | match new_info with | |
1123 | [] -> y | |
1124 | | new_info -> | |
1125 | (*ctr := !ctr + 1; | |
1126 | print_state (Printf.sprintf "iteration %d\n" !ctr) y;*) | |
1127 | let first = pre_exist dir m new_info reqst in | |
1128 | let res = triples_union first y in | |
1129 | let new_info = setdiff res y in | |
1130 | (*Printf.printf "EF %s iter %d res %d new_info %d\n" | |
1131 | (if dir = A.BACKWARD then "reachable" else "real ef") | |
1132 | !ctr (List.length res) (List.length new_info); | |
1133 | print_state "new info" new_info; | |
1134 | flush stdout;*) | |
1135 | f res new_info in | |
1136 | f s2 s2 | |
1137 | else | |
1138 | let f y = | |
1139 | inc_step(); | |
1140 | let pre = pre_exist dir m y reqst in | |
1141 | triples_union s2 pre in | |
1142 | setfix f s2 | |
1143 | ||
1144 | ||
1145 | type ('pred,'anno) auok = | |
1146 | AUok of ('pred,'anno) triples | AUfailed of ('pred,'anno) triples | |
1147 | ||
1148 | (* A[phi1 U phi2] == phi2 \/ (phi1 /\ AXA[phi1 U phi2]) *) | |
485bce71 C |
1149 | let satAU dir ((cfg,_,states) as m) s1 s2 reqst print_graph = |
1150 | let ctr = ref 0 in | |
34e49164 C |
1151 | inc satAU_calls; |
1152 | if s1 = [] | |
1153 | then AUok s2 | |
1154 | else | |
1155 | (*let ctr = ref 0 in*) | |
1156 | let pre_forall = | |
1157 | if !Flag_ctl.loop_in_src_code | |
1158 | then pre_forall_AW | |
1159 | else pre_forall in | |
1160 | if !pNEW_INFO_OPT | |
1161 | then | |
1162 | let rec f y newinfo = | |
1163 | inc_step(); | |
1164 | match newinfo with | |
1165 | [] -> AUok y | |
1166 | | new_info -> | |
485bce71 C |
1167 | ctr := !ctr + 1; |
1168 | (*print_state (Printf.sprintf "iteration %d\n" !ctr) y; | |
34e49164 | 1169 | flush stdout;*) |
485bce71 | 1170 | print_graph y ctr; |
34e49164 C |
1171 | let pre = |
1172 | try Some (pre_forall dir m new_info y reqst) | |
1173 | with AW -> None in | |
1174 | match pre with | |
1175 | None -> AUfailed y | |
1176 | | Some pre -> | |
1177 | match triples_conj s1 pre with | |
1178 | [] -> AUok y | |
1179 | | first -> | |
1180 | (*print_state "s1" s1; | |
1181 | print_state "pre" pre; | |
1182 | print_state "first" first;*) | |
1183 | let res = triples_union first y in | |
1184 | let new_info = | |
1185 | if not !something_dropped | |
1186 | then first | |
1187 | else setdiff res y in | |
1188 | (*Printf.printf | |
1189 | "iter %d res %d new_info %d\n" | |
1190 | !ctr (List.length res) (List.length new_info); | |
1191 | flush stdout;*) | |
1192 | f res new_info in | |
1193 | f s2 s2 | |
1194 | else | |
1195 | if !Flag_ctl.loop_in_src_code | |
1196 | then AUfailed s2 | |
1197 | else | |
1198 | (*let setfix = | |
1199 | fix (function s1 -> function s2 -> | |
1200 | let s1 = List.map (function (s,th,w) -> (s,th,nub w)) s1 in | |
1201 | let s2 = List.map (function (s,th,w) -> (s,th,nub w)) s2 in | |
1202 | subseteq s1 s2) in for popl *) | |
1203 | let f y = | |
1204 | inc_step(); | |
485bce71 C |
1205 | ctr := !ctr + 1; |
1206 | print_graph y ctr; | |
34e49164 C |
1207 | let pre = pre_forall dir m y y reqst in |
1208 | triples_union s2 (triples_conj s1 pre) in | |
1209 | AUok (setfix f s2) | |
1210 | ;; | |
1211 | ||
1212 | ||
1213 | (* reqst could be the states of s1 *) | |
1214 | (* | |
1215 | let lstates = mkstates states reqst in | |
1216 | let initial_removed = | |
1217 | triples_complement lstates (triples_union s1 s2) in | |
1218 | let initial_base = triples_conj s1 (triples_complement lstates s2) in | |
1219 | let rec loop base removed = | |
1220 | let new_removed = | |
1221 | triples_conj base (pre_exist dir m removed reqst) in | |
1222 | let new_base = | |
1223 | triples_conj base (triples_complement lstates new_removed) in | |
1224 | if supseteq new_base base | |
1225 | then triples_union base s2 | |
1226 | else loop new_base new_removed in | |
1227 | loop initial_base initial_removed *) | |
1228 | ||
1229 | let satAW dir ((grp,_,states) as m) s1 s2 reqst = | |
1230 | inc satAW_calls; | |
1231 | if s1 = [] | |
1232 | then s2 | |
1233 | else | |
1234 | (* | |
1235 | This works extremely badly when the region is small and the end of the | |
1236 | region is very ambiguous, eg free(x) ... x | |
1237 | see free.c | |
1238 | if !pNEW_INFO_OPT | |
1239 | then | |
1240 | let get_states l = setify(List.map (function (s,_,_) -> s) l) in | |
1241 | let ostates = Common.union_set (get_states s1) (get_states s2) in | |
1242 | let succ = | |
1243 | (match dir with | |
1244 | A.FORWARD -> G.successors grp | |
1245 | | A.BACKWARD -> G.predecessors grp) in | |
1246 | let states = | |
1247 | List.fold_left Common.union_set ostates (List.map succ ostates) in | |
1248 | let negphi = triples_complement states s1 in | |
1249 | let negpsi = triples_complement states s2 in | |
1250 | triples_complement ostates | |
1251 | (satEU dir m negpsi (triples_conj negphi negpsi) (Some ostates)) | |
1252 | else | |
1253 | *) | |
1254 | (*let ctr = ref 0 in*) | |
1255 | let f y = | |
1256 | inc_step(); | |
1257 | (*ctr := !ctr + 1; | |
1258 | Printf.printf "iter %d y %d\n" !ctr (List.length y); | |
1259 | print_state "y" y; | |
1260 | flush stdout;*) | |
1261 | let pre = pre_forall dir m y y reqst in | |
978fd7e5 | 1262 | (*print_state "pre" pre;*) |
34e49164 C |
1263 | let conj = triples_conj s1 pre in (* or triples_conj_AW *) |
1264 | triples_union s2 conj in | |
978fd7e5 C |
1265 | let drop_wits = List.map (function (s,e,_) -> (s,e,[])) in |
1266 | (* drop wits on s1 represents that we don't want any witnesses from | |
1267 | the case that infinitely loops, only from the case that gets | |
1268 | out of the loop. s1 is like a guard. To see the problem, consider | |
1269 | an example where both s1 and s2 match some code after the loop. | |
1270 | we only want the witness from s2. *) | |
fc1ad971 | 1271 | setgfix f (triples_union (nub(drop_wits s1)) s2) |
34e49164 C |
1272 | ;; |
1273 | ||
1274 | let satAF dir m s reqst = | |
1275 | inc satAF_calls; | |
1276 | if !pNEW_INFO_OPT | |
1277 | then | |
1278 | let rec f y newinfo = | |
1279 | inc_step(); | |
1280 | match newinfo with | |
1281 | [] -> y | |
1282 | | new_info -> | |
1283 | let first = pre_forall dir m new_info y reqst in | |
1284 | let res = triples_union first y in | |
1285 | let new_info = setdiff res y in | |
1286 | f res new_info in | |
1287 | f s s | |
1288 | else | |
1289 | let f y = | |
1290 | inc_step(); | |
1291 | let pre = pre_forall dir m y y reqst in | |
1292 | triples_union s pre in | |
1293 | setfix f s | |
1294 | ||
1295 | let satAG dir ((_,_,states) as m) s reqst = | |
1296 | inc satAG_calls; | |
1297 | let f y = | |
1298 | inc_step(); | |
1299 | let pre = pre_forall dir m y y reqst in | |
1300 | triples_conj y pre in | |
1301 | setgfix f s | |
1302 | ||
1303 | let satEG dir ((_,_,states) as m) s reqst = | |
1304 | inc satEG_calls; | |
1305 | let f y = | |
1306 | inc_step(); | |
1307 | let pre = pre_exist dir m y reqst in | |
1308 | triples_conj y pre in | |
1309 | setgfix f s | |
1310 | ||
1311 | (* **************************************************************** *) | |
1312 | (* Inner And - a way of dealing with multiple matches within a node *) | |
1313 | (* **************************************************************** *) | |
1314 | (* applied to the result of matching a node. collect witnesses when the | |
1315 | states and environments are the same *) | |
1316 | ||
1317 | let inner_and trips = | |
1318 | let rec loop = function | |
1319 | [] -> ([],[]) | |
1320 | | (s,th,w)::trips -> | |
1321 | let (cur,acc) = loop trips in | |
1322 | (match cur with | |
1323 | (s',_,_)::_ when s = s' -> | |
1324 | let rec loop' = function | |
1325 | [] -> [(s,th,w)] | |
1326 | | ((_,th',w') as t')::ts' -> | |
1327 | (match conj_subst th th' with | |
1328 | Some th'' -> (s,th'',union_wit w w')::ts' | |
1329 | | None -> t'::(loop' ts')) in | |
1330 | (loop' cur,acc) | |
1331 | | _ -> ([(s,th,w)],cur@acc)) in | |
1332 | let (cur,acc) = | |
1333 | loop (List.sort state_compare trips) (* is this sort needed? *) in | |
1334 | cur@acc | |
1335 | ||
1336 | (* *************** *) | |
1337 | (* Partial matches *) | |
1338 | (* *************** *) | |
1339 | ||
1340 | let filter_conj states unwanted partial_matches = | |
1341 | let x = | |
1342 | triples_conj (triples_complement states (unwitify unwanted)) | |
1343 | partial_matches in | |
1344 | triples_conj (unwitify x) (triples_complement states x) | |
1345 | ||
1346 | let strict_triples_conj strict states trips trips' = | |
1347 | let res = triples_conj trips trips' in | |
1348 | if !Flag_ctl.partial_match && strict = A.STRICT | |
1349 | then | |
1350 | let fail_left = filter_conj states trips trips' in | |
1351 | let fail_right = filter_conj states trips' trips in | |
1352 | let ors = triples_union fail_left fail_right in | |
1353 | triples_union res ors | |
1354 | else res | |
1355 | ||
1356 | let strict_triples_conj_none strict states trips trips' = | |
1357 | let res = triples_conj_none trips trips' in | |
1358 | if !Flag_ctl.partial_match && strict = A.STRICT | |
1359 | then | |
1360 | let fail_left = filter_conj states trips trips' in | |
1361 | let fail_right = filter_conj states trips' trips in | |
1362 | let ors = triples_union fail_left fail_right in | |
1363 | triples_union res ors | |
1364 | else res | |
1365 | ||
1366 | let left_strict_triples_conj strict states trips trips' = | |
1367 | let res = triples_conj trips trips' in | |
1368 | if !Flag_ctl.partial_match && strict = A.STRICT | |
1369 | then | |
1370 | let fail_left = filter_conj states trips trips' in | |
1371 | triples_union res fail_left | |
1372 | else res | |
1373 | ||
1374 | let strict_A1 strict op failop dir ((_,_,states) as m) trips required_states = | |
1375 | let res = op dir m trips required_states in | |
1376 | if !Flag_ctl.partial_match && strict = A.STRICT | |
1377 | then | |
1378 | let states = mkstates states required_states in | |
1379 | let fail = filter_conj states res (failop dir m trips required_states) in | |
1380 | triples_union res fail | |
1381 | else res | |
1382 | ||
1383 | let strict_A2 strict op failop dir ((_,_,states) as m) trips trips' | |
1384 | required_states = | |
1385 | let res = op dir m trips trips' required_states in | |
1386 | if !Flag_ctl.partial_match && strict = A.STRICT | |
1387 | then | |
1388 | let states = mkstates states required_states in | |
1389 | let fail = filter_conj states res (failop dir m trips' required_states) in | |
1390 | triples_union res fail | |
1391 | else res | |
1392 | ||
1393 | let strict_A2au strict op failop dir ((_,_,states) as m) trips trips' | |
485bce71 C |
1394 | required_states print_graph = |
1395 | match op dir m trips trips' required_states print_graph with | |
34e49164 C |
1396 | AUok res -> |
1397 | if !Flag_ctl.partial_match && strict = A.STRICT | |
1398 | then | |
1399 | let states = mkstates states required_states in | |
1400 | let fail = | |
1401 | filter_conj states res (failop dir m trips' required_states) in | |
1402 | AUok (triples_union res fail) | |
1403 | else AUok res | |
1404 | | AUfailed res -> AUfailed res | |
1405 | ||
1406 | (* ********************* *) | |
1407 | (* Environment functions *) | |
1408 | (* ********************* *) | |
1409 | ||
1410 | let drop_wits required_states s phi = | |
1411 | match required_states with | |
1412 | None -> s | |
1413 | | Some states -> List.filter (function (s,_,_) -> List.mem s states) s | |
1414 | ||
1415 | ||
1416 | let print_required required = | |
1417 | List.iter | |
1418 | (function l -> | |
1419 | Format.print_string "{"; | |
1420 | List.iter | |
1421 | (function reqd -> | |
1422 | print_generic_substitution reqd; Format.print_newline()) | |
1423 | l; | |
1424 | Format.print_string "}"; | |
1425 | Format.print_newline()) | |
1426 | required | |
1427 | ||
1428 | exception Too_long | |
1429 | ||
1430 | let extend_required trips required = | |
1431 | if !Flag_ctl.partial_match | |
1432 | then required | |
1433 | else | |
1434 | if !pREQUIRED_ENV_OPT | |
1435 | then | |
1436 | (* make it a set *) | |
1437 | let envs = | |
1438 | List.fold_left | |
1439 | (function rest -> | |
1440 | function (_,t,_) -> if List.mem t rest then rest else t::rest) | |
1441 | [] trips in | |
1442 | let envs = if List.mem [] envs then [] else envs in | |
1443 | match (envs,required) with | |
1444 | ([],_) -> required | |
1445 | | (envs,hd::tl) -> | |
1446 | (try | |
1447 | let hdln = List.length hd + 5 (* let it grow a little bit *) in | |
1448 | let (_,merged) = | |
1449 | let add x (ln,y) = | |
1450 | if List.mem x y | |
1451 | then (ln,y) | |
1452 | else if ln + 1 > hdln then raise Too_long else (ln+1,x::y) in | |
1453 | foldl | |
1454 | (function rest -> | |
1455 | function t -> | |
1456 | foldl | |
1457 | (function rest -> | |
1458 | function r -> | |
1459 | match conj_subst t r with | |
1460 | None -> rest | Some th -> add th rest) | |
1461 | rest hd) | |
1462 | (0,[]) envs in | |
1463 | merged :: tl | |
1464 | with Too_long -> envs :: required) | |
1465 | | (envs,_) -> envs :: required | |
1466 | else required | |
1467 | ||
1468 | let drop_required v required = | |
1469 | if !pREQUIRED_ENV_OPT | |
1470 | then | |
1471 | let res = | |
1472 | inner_setify | |
1473 | (List.map | |
1474 | (function l -> | |
1475 | inner_setify | |
1476 | (List.map (List.filter (function sub -> not(dom_sub sub = v))) l)) | |
1477 | required) in | |
1478 | (* check whether an entry has become useless *) | |
1479 | List.filter (function l -> not (List.exists (function x -> x = []) l)) res | |
1480 | else required | |
1481 | ||
1482 | (* no idea how to write this function ... *) | |
1483 | let memo_label = | |
1484 | (Hashtbl.create(50) : (P.t, (G.node * substitution) list) Hashtbl.t) | |
1485 | ||
1486 | let satLabel label required p = | |
1487 | let triples = | |
1488 | if !pSATLABEL_MEMO_OPT | |
1489 | then | |
1490 | try | |
1491 | let states_subs = Hashtbl.find memo_label p in | |
1492 | List.map (function (st,th) -> (st,th,[])) states_subs | |
1493 | with | |
1494 | Not_found -> | |
1495 | let triples = setify(label p) in | |
1496 | Hashtbl.add memo_label p | |
1497 | (List.map (function (st,th,_) -> (st,th)) triples); | |
1498 | triples | |
1499 | else setify(label p) in | |
1500 | normalize | |
1501 | (if !pREQUIRED_ENV_OPT | |
1502 | then | |
1503 | foldl | |
1504 | (function rest -> | |
1505 | function ((s,th,_) as t) -> | |
1506 | if List.for_all | |
1507 | (List.exists (function th' -> not(conj_subst th th' = None))) | |
1508 | required | |
1509 | then t::rest | |
1510 | else rest) | |
1511 | [] triples | |
1512 | else triples) | |
1513 | ||
1514 | let get_required_states l = | |
1515 | if !pREQUIRED_STATES_OPT && not !Flag_ctl.partial_match | |
1516 | then | |
1517 | Some(inner_setify (List.map (function (s,_,_) -> s) l)) | |
1518 | else None | |
1519 | ||
1520 | let get_children_required_states dir (grp,_,_) required_states = | |
1521 | if !pREQUIRED_STATES_OPT && not !Flag_ctl.partial_match | |
1522 | then | |
1523 | match required_states with | |
1524 | None -> None | |
1525 | | Some states -> | |
1526 | let fn = | |
1527 | match dir with | |
1528 | A.FORWARD -> G.successors | |
1529 | | A.BACKWARD -> G.predecessors in | |
1530 | Some (inner_setify (List.concat (List.map (fn grp) states))) | |
1531 | else None | |
1532 | ||
1533 | let reachable_table = | |
1534 | (Hashtbl.create(50) : (G.node * A.direction, G.node list) Hashtbl.t) | |
1535 | ||
1536 | (* like satEF, but specialized for get_reachable *) | |
1537 | let reachsatEF dir (grp,_,_) s2 = | |
1538 | let dirop = | |
1539 | match dir with A.FORWARD -> G.successors | A.BACKWARD -> G.predecessors in | |
1540 | let union = unionBy compare (=) in | |
1541 | let rec f y = function | |
1542 | [] -> y | |
1543 | | new_info -> | |
1544 | let (pre_collected,new_info) = | |
1545 | List.partition (function Common.Left x -> true | _ -> false) | |
1546 | (List.map | |
1547 | (function x -> | |
1548 | try Common.Left (Hashtbl.find reachable_table (x,dir)) | |
1549 | with Not_found -> Common.Right x) | |
1550 | new_info) in | |
1551 | let y = | |
1552 | List.fold_left | |
1553 | (function rest -> | |
1554 | function Common.Left x -> union x rest | |
1555 | | _ -> failwith "not possible") | |
1556 | y pre_collected in | |
1557 | let new_info = | |
1558 | List.map | |
1559 | (function Common.Right x -> x | _ -> failwith "not possible") | |
1560 | new_info in | |
1561 | let first = inner_setify (concatmap (dirop grp) new_info) in | |
1562 | let new_info = setdiff first y in | |
1563 | let res = new_info @ y in | |
1564 | f res new_info in | |
1565 | List.rev(f s2 s2) (* put root first *) | |
1566 | ||
1567 | let get_reachable dir m required_states = | |
1568 | match required_states with | |
1569 | None -> None | |
1570 | | Some states -> | |
1571 | Some | |
1572 | (List.fold_left | |
1573 | (function rest -> | |
1574 | function cur -> | |
1575 | if List.mem cur rest | |
1576 | then rest | |
1577 | else | |
1578 | Common.union_set | |
1579 | (try Hashtbl.find reachable_table (cur,dir) | |
1580 | with | |
1581 | Not_found -> | |
1582 | let states = reachsatEF dir m [cur] in | |
1583 | Hashtbl.add reachable_table (cur,dir) states; | |
1584 | states) | |
1585 | rest) | |
1586 | [] states) | |
1587 | ||
1588 | let ctr = ref 0 | |
1589 | let new_var _ = | |
1590 | let c = !ctr in | |
1591 | ctr := !ctr + 1; | |
1592 | Printf.sprintf "_c%d" c | |
1593 | ||
1594 | (* **************************** *) | |
1595 | (* End of environment functions *) | |
1596 | (* **************************** *) | |
1597 | ||
1598 | type ('code,'value) cell = Frozen of 'code | Thawed of 'value | |
1599 | ||
1600 | let rec satloop unchecked required required_states | |
1601 | ((grp,label,states) as m) phi env = | |
1602 | let rec loop unchecked required required_states phi = | |
1603 | (*Common.profile_code "satloop" (fun _ -> *) | |
1604 | let res = | |
1605 | match phi with | |
1606 | A.False -> [] | |
1607 | | A.True -> triples_top states | |
1608 | | A.Pred(p) -> satLabel label required p | |
1609 | | A.Uncheck(phi1) -> | |
1610 | let unchecked = if !pUNCHECK_OPT then true else false in | |
1611 | loop unchecked required required_states phi1 | |
1612 | | A.Not(phi) -> | |
1613 | let phires = loop unchecked required required_states phi in | |
1614 | (*let phires = | |
1615 | List.map (function (s,th,w) -> (s,th,[])) phires in*) | |
1616 | triples_complement (mkstates states required_states) | |
1617 | phires | |
1618 | | A.Or(phi1,phi2) -> | |
1619 | triples_union | |
1620 | (loop unchecked required required_states phi1) | |
1621 | (loop unchecked required required_states phi2) | |
1622 | | A.SeqOr(phi1,phi2) -> | |
1623 | let res1 = loop unchecked required required_states phi1 in | |
1624 | let res2 = loop unchecked required required_states phi2 in | |
1625 | let res1neg = unwitify res1 in | |
1626 | triples_union res1 | |
1627 | (triples_conj | |
1628 | (triples_complement (mkstates states required_states) res1neg) | |
1629 | res2) | |
1630 | | A.And(strict,phi1,phi2) -> | |
1631 | (* phi1 is considered to be more likely to be [], because of the | |
1632 | definition of asttoctl. Could use heuristics such as the size of | |
1633 | the term *) | |
1634 | let pm = !Flag_ctl.partial_match in | |
1635 | (match (pm,loop unchecked required required_states phi1) with | |
1636 | (false,[]) when !pLazyOpt -> [] | |
1637 | | (_,phi1res) -> | |
1638 | let new_required = extend_required phi1res required in | |
1639 | let new_required_states = get_required_states phi1res in | |
1640 | (match (pm,loop unchecked new_required new_required_states phi2) | |
1641 | with | |
1642 | (false,[]) when !pLazyOpt -> [] | |
1643 | | (_,phi2res) -> | |
1644 | strict_triples_conj strict | |
1645 | (mkstates states required_states) | |
1646 | phi1res phi2res)) | |
1647 | | A.AndAny(dir,strict,phi1,phi2) -> | |
1648 | (* phi2 can appear anywhere that is reachable *) | |
1649 | let pm = !Flag_ctl.partial_match in | |
1650 | (match (pm,loop unchecked required required_states phi1) with | |
1651 | (false,[]) -> [] | |
1652 | | (_,phi1res) -> | |
1653 | let new_required = extend_required phi1res required in | |
1654 | let new_required_states = get_required_states phi1res in | |
1655 | let new_required_states = | |
1656 | get_reachable dir m new_required_states in | |
1657 | (match (pm,loop unchecked new_required new_required_states phi2) | |
1658 | with | |
1659 | (false,[]) -> phi1res | |
1660 | | (_,phi2res) -> | |
1661 | (match phi1res with | |
1662 | [] -> (* !Flag_ctl.partial_match must be true *) | |
1663 | if phi2res = [] | |
1664 | then [] | |
1665 | else | |
1666 | let s = mkstates states required_states in | |
1667 | List.fold_left | |
1668 | (function a -> function b -> | |
1669 | strict_triples_conj strict s a [b]) | |
1670 | [List.hd phi2res] (List.tl phi2res) | |
1671 | | [(state,_,_)] -> | |
1672 | let phi2res = | |
1673 | List.map (function (s,e,w) -> [(state,e,w)]) phi2res in | |
1674 | let s = mkstates states required_states in | |
1675 | List.fold_left | |
1676 | (function a -> function b -> | |
1677 | strict_triples_conj strict s a b) | |
1678 | phi1res phi2res | |
1679 | | _ -> | |
1680 | failwith | |
1681 | "only one result allowed for the left arg of AndAny"))) | |
1682 | | A.HackForStmt(dir,strict,phi1,phi2) -> | |
1683 | (* phi2 can appear anywhere that is reachable *) | |
1684 | let pm = !Flag_ctl.partial_match in | |
1685 | (match (pm,loop unchecked required required_states phi1) with | |
1686 | (false,[]) -> [] | |
1687 | | (_,phi1res) -> | |
1688 | let new_required = extend_required phi1res required in | |
1689 | let new_required_states = get_required_states phi1res in | |
1690 | let new_required_states = | |
1691 | get_reachable dir m new_required_states in | |
1692 | (match (pm,loop unchecked new_required new_required_states phi2) | |
1693 | with | |
1694 | (false,[]) -> phi1res | |
1695 | | (_,phi2res) -> | |
1696 | (* if there is more than one state, something about the | |
1697 | environment has to ensure that the right triples of | |
1698 | phi2 get associated with the triples of phi1. | |
1699 | the asttoctl2 has to ensure that that is the case. | |
1700 | these should thus be structural properties. | |
1701 | env of phi2 has to be a proper subset of env of phi1 | |
1702 | to ensure all end up being consistent. no new triples | |
1703 | should be generated. strict_triples_conj_none takes | |
1704 | care of this. | |
1705 | *) | |
1706 | let s = mkstates states required_states in | |
1707 | List.fold_left | |
1708 | (function acc -> | |
1709 | function (st,th,_) as phi2_elem -> | |
1710 | let inverse = | |
1711 | triples_complement [st] [(st,th,[])] in | |
1712 | strict_triples_conj_none strict s acc | |
1713 | (phi2_elem::inverse)) | |
1714 | phi1res phi2res)) | |
1715 | | A.InnerAnd(phi) -> | |
1716 | inner_and(loop unchecked required required_states phi) | |
1717 | | A.EX(dir,phi) -> | |
1718 | let new_required_states = | |
1719 | get_children_required_states dir m required_states in | |
1720 | satEX dir m (loop unchecked required new_required_states phi) | |
1721 | required_states | |
1722 | | A.AX(dir,strict,phi) -> | |
1723 | let new_required_states = | |
1724 | get_children_required_states dir m required_states in | |
1725 | let res = loop unchecked required new_required_states phi in | |
1726 | strict_A1 strict satAX satEX dir m res required_states | |
1727 | | A.EF(dir,phi) -> | |
1728 | let new_required_states = get_reachable dir m required_states in | |
1729 | satEF dir m (loop unchecked required new_required_states phi) | |
1730 | new_required_states | |
1731 | | A.AF(dir,strict,phi) -> | |
1732 | if !Flag_ctl.loop_in_src_code | |
1733 | then | |
1734 | loop unchecked required required_states | |
1735 | (A.AU(dir,strict,A.True,phi)) | |
1736 | else | |
1737 | let new_required_states = get_reachable dir m required_states in | |
1738 | let res = loop unchecked required new_required_states phi in | |
1739 | strict_A1 strict satAF satEF dir m res new_required_states | |
1740 | | A.EG(dir,phi) -> | |
1741 | let new_required_states = get_reachable dir m required_states in | |
1742 | satEG dir m (loop unchecked required new_required_states phi) | |
1743 | new_required_states | |
1744 | | A.AG(dir,strict,phi) -> | |
1745 | let new_required_states = get_reachable dir m required_states in | |
1746 | let res = loop unchecked required new_required_states phi in | |
1747 | strict_A1 strict satAG satEF dir m res new_required_states | |
1748 | | A.EU(dir,phi1,phi2) -> | |
1749 | let new_required_states = get_reachable dir m required_states in | |
1750 | (match loop unchecked required new_required_states phi2 with | |
1751 | [] when !pLazyOpt -> [] | |
1752 | | s2 -> | |
1753 | let new_required = extend_required s2 required in | |
1754 | let s1 = loop unchecked new_required new_required_states phi1 in | |
485bce71 C |
1755 | satEU dir m s1 s2 new_required_states |
1756 | (fun y ctr -> print_graph_c grp new_required_states y ctr phi)) | |
34e49164 C |
1757 | | A.AW(dir,strict,phi1,phi2) -> |
1758 | let new_required_states = get_reachable dir m required_states in | |
1759 | (match loop unchecked required new_required_states phi2 with | |
1760 | [] when !pLazyOpt -> [] | |
1761 | | s2 -> | |
1762 | let new_required = extend_required s2 required in | |
1763 | let s1 = loop unchecked new_required new_required_states phi1 in | |
1764 | strict_A2 strict satAW satEF dir m s1 s2 new_required_states) | |
1765 | | A.AU(dir,strict,phi1,phi2) -> | |
1766 | (*Printf.printf "using AU\n"; flush stdout;*) | |
1767 | let new_required_states = get_reachable dir m required_states in | |
1768 | (match loop unchecked required new_required_states phi2 with | |
1769 | [] when !pLazyOpt -> [] | |
1770 | | s2 -> | |
1771 | let new_required = extend_required s2 required in | |
1772 | let s1 = loop unchecked new_required new_required_states phi1 in | |
1773 | let res = | |
485bce71 C |
1774 | strict_A2au strict satAU satEF dir m s1 s2 new_required_states |
1775 | (fun y ctr -> | |
1776 | print_graph_c grp new_required_states y ctr phi) in | |
34e49164 C |
1777 | match res with |
1778 | AUok res -> res | |
1779 | | AUfailed tmp_res -> | |
1780 | (* found a loop, have to try AW *) | |
1781 | (* the formula is | |
1782 | A[E[phi1 U phi2] & phi1 W phi2] | |
1783 | the and is nonstrict *) | |
1784 | (* tmp_res is bigger than s2, so perhaps closer to s1 *) | |
1785 | (*Printf.printf "using AW\n"; flush stdout;*) | |
1786 | let s1 = | |
485bce71 C |
1787 | triples_conj |
1788 | (satEU dir m s1 tmp_res new_required_states | |
1789 | (* no graph, for the moment *) | |
1790 | (fun y str -> ())) | |
34e49164 | 1791 | s1 in |
978fd7e5 C |
1792 | strict_A2 strict satAW satEF dir m s1 s2 new_required_states |
1793 | ) | |
34e49164 C |
1794 | | A.Implies(phi1,phi2) -> |
1795 | loop unchecked required required_states (A.Or(A.Not phi1,phi2)) | |
1796 | | A.Exists (keep,v,phi) -> | |
1797 | let new_required = drop_required v required in | |
1798 | triples_witness v unchecked (not keep) | |
1799 | (loop unchecked new_required required_states phi) | |
1800 | | A.Let(v,phi1,phi2) -> | |
1801 | (* should only be used when the properties unchecked, required, | |
1802 | and required_states are known to be the same or at least | |
1803 | compatible between all the uses. this is not checked. *) | |
1804 | let res = loop unchecked required required_states phi1 in | |
1805 | satloop unchecked required required_states m phi2 ((v,res) :: env) | |
1806 | | A.LetR(dir,v,phi1,phi2) -> | |
1807 | (* should only be used when the properties unchecked, required, | |
1808 | and required_states are known to be the same or at least | |
1809 | compatible between all the uses. this is not checked. *) | |
485bce71 | 1810 | (* doesn't seem to be used any more *) |
34e49164 C |
1811 | let new_required_states = get_reachable dir m required_states in |
1812 | let res = loop unchecked required new_required_states phi1 in | |
1813 | satloop unchecked required required_states m phi2 ((v,res) :: env) | |
1814 | | A.Ref(v) -> | |
1815 | let res = List.assoc v env in | |
1816 | if unchecked | |
1817 | then List.map (function (s,th,_) -> (s,th,[])) res | |
1818 | else res | |
1819 | | A.XX(phi) -> failwith "should have been removed" in | |
1820 | if !Flag_ctl.bench > 0 then triples := !triples + (List.length res); | |
485bce71 C |
1821 | let res = drop_wits required_states res phi (* ) *) in |
1822 | print_graph grp required_states res "" phi; | |
1823 | res in | |
34e49164 C |
1824 | |
1825 | loop unchecked required required_states phi | |
1826 | ;; | |
1827 | ||
1828 | ||
1829 | (* SAT with tracking *) | |
1830 | let rec sat_verbose_loop unchecked required required_states annot maxlvl lvl | |
1831 | ((_,label,states) as m) phi env = | |
1832 | let anno res children = (annot lvl phi res children,res) in | |
1833 | let satv unchecked required required_states phi0 env = | |
1834 | sat_verbose_loop unchecked required required_states annot maxlvl (lvl+1) | |
1835 | m phi0 env in | |
1836 | if (lvl > maxlvl) && (maxlvl > -1) then | |
1837 | anno (satloop unchecked required required_states m phi env) [] | |
1838 | else | |
1839 | let (child,res) = | |
1840 | match phi with | |
1841 | A.False -> anno [] [] | |
1842 | | A.True -> anno (triples_top states) [] | |
1843 | | A.Pred(p) -> | |
1844 | Printf.printf "label\n"; flush stdout; | |
1845 | anno (satLabel label required p) [] | |
1846 | | A.Uncheck(phi1) -> | |
1847 | let unchecked = if !pUNCHECK_OPT then true else false in | |
1848 | let (child1,res1) = satv unchecked required required_states phi1 env in | |
1849 | Printf.printf "uncheck\n"; flush stdout; | |
1850 | anno res1 [child1] | |
1851 | | A.Not(phi1) -> | |
1852 | let (child,res) = | |
1853 | satv unchecked required required_states phi1 env in | |
1854 | Printf.printf "not\n"; flush stdout; | |
1855 | anno (triples_complement (mkstates states required_states) res) [child] | |
1856 | | A.Or(phi1,phi2) -> | |
1857 | let (child1,res1) = | |
1858 | satv unchecked required required_states phi1 env in | |
1859 | let (child2,res2) = | |
1860 | satv unchecked required required_states phi2 env in | |
1861 | Printf.printf "or\n"; flush stdout; | |
1862 | anno (triples_union res1 res2) [child1; child2] | |
1863 | | A.SeqOr(phi1,phi2) -> | |
1864 | let (child1,res1) = | |
1865 | satv unchecked required required_states phi1 env in | |
1866 | let (child2,res2) = | |
1867 | satv unchecked required required_states phi2 env in | |
1868 | let res1neg = | |
1869 | List.map (function (s,th,_) -> (s,th,[])) res1 in | |
1870 | Printf.printf "seqor\n"; flush stdout; | |
1871 | anno (triples_union res1 | |
1872 | (triples_conj | |
1873 | (triples_complement (mkstates states required_states) | |
1874 | res1neg) | |
1875 | res2)) | |
1876 | [child1; child2] | |
1877 | | A.And(strict,phi1,phi2) -> | |
1878 | let pm = !Flag_ctl.partial_match in | |
1879 | (match (pm,satv unchecked required required_states phi1 env) with | |
1880 | (false,(child1,[])) -> | |
1881 | Printf.printf "and\n"; flush stdout; anno [] [child1] | |
1882 | | (_,(child1,res1)) -> | |
1883 | let new_required = extend_required res1 required in | |
1884 | let new_required_states = get_required_states res1 in | |
1885 | (match (pm,satv unchecked new_required new_required_states phi2 | |
1886 | env) with | |
1887 | (false,(child2,[])) -> | |
1888 | Printf.printf "and\n"; flush stdout; anno [] [child1;child2] | |
1889 | | (_,(child2,res2)) -> | |
1890 | Printf.printf "and\n"; flush stdout; | |
1891 | let res = | |
1892 | strict_triples_conj strict | |
1893 | (mkstates states required_states) | |
1894 | res1 res2 in | |
1895 | anno res [child1; child2])) | |
1896 | | A.AndAny(dir,strict,phi1,phi2) -> | |
1897 | let pm = !Flag_ctl.partial_match in | |
1898 | (match (pm,satv unchecked required required_states phi1 env) with | |
1899 | (false,(child1,[])) -> | |
1900 | Printf.printf "and\n"; flush stdout; anno [] [child1] | |
1901 | | (_,(child1,res1)) -> | |
1902 | let new_required = extend_required res1 required in | |
1903 | let new_required_states = get_required_states res1 in | |
1904 | let new_required_states = | |
1905 | get_reachable dir m new_required_states in | |
1906 | (match (pm,satv unchecked new_required new_required_states phi2 | |
1907 | env) with | |
1908 | (false,(child2,[])) -> | |
1909 | Printf.printf "andany\n"; flush stdout; | |
1910 | anno res1 [child1;child2] | |
1911 | | (_,(child2,res2)) -> | |
1912 | (match res1 with | |
1913 | [] -> (* !Flag_ctl.partial_match must be true *) | |
1914 | if res2 = [] | |
1915 | then anno [] [child1; child2] | |
1916 | else | |
1917 | let res = | |
1918 | let s = mkstates states required_states in | |
1919 | List.fold_left | |
1920 | (function a -> function b -> | |
1921 | strict_triples_conj strict s a [b]) | |
1922 | [List.hd res2] (List.tl res2) in | |
1923 | anno res [child1; child2] | |
1924 | | [(state,_,_)] -> | |
1925 | let res2 = | |
1926 | List.map (function (s,e,w) -> [(state,e,w)]) res2 in | |
1927 | Printf.printf "andany\n"; flush stdout; | |
1928 | let res = | |
1929 | let s = mkstates states required_states in | |
1930 | List.fold_left | |
1931 | (function a -> function b -> | |
1932 | strict_triples_conj strict s a b) | |
1933 | res1 res2 in | |
1934 | anno res [child1; child2] | |
1935 | | _ -> | |
1936 | failwith | |
1937 | "only one result allowed for the left arg of AndAny"))) | |
1938 | | A.HackForStmt(dir,strict,phi1,phi2) -> | |
1939 | let pm = !Flag_ctl.partial_match in | |
1940 | (match (pm,satv unchecked required required_states phi1 env) with | |
1941 | (false,(child1,[])) -> | |
1942 | Printf.printf "and\n"; flush stdout; anno [] [child1] | |
1943 | | (_,(child1,res1)) -> | |
1944 | let new_required = extend_required res1 required in | |
1945 | let new_required_states = get_required_states res1 in | |
1946 | let new_required_states = | |
1947 | get_reachable dir m new_required_states in | |
1948 | (match (pm,satv unchecked new_required new_required_states phi2 | |
1949 | env) with | |
1950 | (false,(child2,[])) -> | |
1951 | Printf.printf "andany\n"; flush stdout; | |
1952 | anno res1 [child1;child2] | |
1953 | | (_,(child2,res2)) -> | |
1954 | let res = | |
1955 | let s = mkstates states required_states in | |
1956 | List.fold_left | |
1957 | (function acc -> | |
1958 | function (st,th,_) as phi2_elem -> | |
1959 | let inverse = | |
1960 | triples_complement [st] [(st,th,[])] in | |
1961 | strict_triples_conj_none strict s acc | |
1962 | (phi2_elem::inverse)) | |
1963 | res1 res2 in | |
1964 | anno res [child1; child2])) | |
1965 | | A.InnerAnd(phi1) -> | |
1966 | let (child1,res1) = satv unchecked required required_states phi1 env in | |
1967 | Printf.printf "uncheck\n"; flush stdout; | |
1968 | anno (inner_and res1) [child1] | |
1969 | | A.EX(dir,phi1) -> | |
1970 | let new_required_states = | |
1971 | get_children_required_states dir m required_states in | |
1972 | let (child,res) = | |
1973 | satv unchecked required new_required_states phi1 env in | |
1974 | Printf.printf "EX\n"; flush stdout; | |
1975 | anno (satEX dir m res required_states) [child] | |
1976 | | A.AX(dir,strict,phi1) -> | |
1977 | let new_required_states = | |
1978 | get_children_required_states dir m required_states in | |
1979 | let (child,res) = | |
1980 | satv unchecked required new_required_states phi1 env in | |
1981 | Printf.printf "AX\n"; flush stdout; | |
1982 | let res = strict_A1 strict satAX satEX dir m res required_states in | |
1983 | anno res [child] | |
1984 | | A.EF(dir,phi1) -> | |
1985 | let new_required_states = get_reachable dir m required_states in | |
1986 | let (child,res) = | |
1987 | satv unchecked required new_required_states phi1 env in | |
1988 | Printf.printf "EF\n"; flush stdout; | |
1989 | anno (satEF dir m res new_required_states) [child] | |
1990 | | A.AF(dir,strict,phi1) -> | |
1991 | if !Flag_ctl.loop_in_src_code | |
1992 | then | |
1993 | satv unchecked required required_states | |
1994 | (A.AU(dir,strict,A.True,phi1)) | |
1995 | env | |
1996 | else | |
1997 | (let new_required_states = get_reachable dir m required_states in | |
1998 | let (child,res) = | |
1999 | satv unchecked required new_required_states phi1 env in | |
2000 | Printf.printf "AF\n"; flush stdout; | |
2001 | let res = | |
2002 | strict_A1 strict satAF satEF dir m res new_required_states in | |
2003 | anno res [child]) | |
2004 | | A.EG(dir,phi1) -> | |
2005 | let new_required_states = get_reachable dir m required_states in | |
2006 | let (child,res) = | |
2007 | satv unchecked required new_required_states phi1 env in | |
2008 | Printf.printf "EG\n"; flush stdout; | |
2009 | anno (satEG dir m res new_required_states) [child] | |
2010 | | A.AG(dir,strict,phi1) -> | |
2011 | let new_required_states = get_reachable dir m required_states in | |
2012 | let (child,res) = | |
2013 | satv unchecked required new_required_states phi1 env in | |
2014 | Printf.printf "AG\n"; flush stdout; | |
2015 | let res = strict_A1 strict satAG satEF dir m res new_required_states in | |
2016 | anno res [child] | |
2017 | ||
2018 | | A.EU(dir,phi1,phi2) -> | |
2019 | let new_required_states = get_reachable dir m required_states in | |
2020 | (match satv unchecked required new_required_states phi2 env with | |
2021 | (child2,[]) -> | |
2022 | Printf.printf "EU\n"; flush stdout; | |
2023 | anno [] [child2] | |
2024 | | (child2,res2) -> | |
2025 | let new_required = extend_required res2 required in | |
2026 | let (child1,res1) = | |
2027 | satv unchecked new_required new_required_states phi1 env in | |
2028 | Printf.printf "EU\n"; flush stdout; | |
485bce71 C |
2029 | anno (satEU dir m res1 res2 new_required_states (fun y str -> ())) |
2030 | [child1; child2]) | |
34e49164 C |
2031 | | A.AW(dir,strict,phi1,phi2) -> |
2032 | failwith "should not be used" (* | |
2033 | let new_required_states = get_reachable dir m required_states in | |
2034 | (match satv unchecked required new_required_states phi2 env with | |
2035 | (child2,[]) -> | |
2036 | Printf.printf "AW %b\n" unchecked; flush stdout; anno [] [child2] | |
2037 | | (child2,res2) -> | |
2038 | let new_required = extend_required res2 required in | |
2039 | let (child1,res1) = | |
2040 | satv unchecked new_required new_required_states phi1 env in | |
2041 | Printf.printf "AW %b\n" unchecked; flush stdout; | |
2042 | let res = | |
2043 | strict_A2 strict satAW satEF dir m res1 res2 | |
2044 | new_required_states in | |
2045 | anno res [child1; child2]) *) | |
2046 | | A.AU(dir,strict,phi1,phi2) -> | |
2047 | let new_required_states = get_reachable dir m required_states in | |
2048 | (match satv unchecked required new_required_states phi2 env with | |
2049 | (child2,[]) -> | |
2050 | Printf.printf "AU\n"; flush stdout; anno [] [child2] | |
2051 | | (child2,s2) -> | |
2052 | let new_required = extend_required s2 required in | |
2053 | let (child1,s1) = | |
2054 | satv unchecked new_required new_required_states phi1 env in | |
2055 | Printf.printf "AU\n"; flush stdout; | |
2056 | let res = | |
485bce71 C |
2057 | strict_A2au strict satAU satEF dir m s1 s2 new_required_states |
2058 | (fun y str -> ()) in | |
34e49164 C |
2059 | (match res with |
2060 | AUok res -> | |
2061 | anno res [child1; child2] | |
2062 | | AUfailed tmp_res -> | |
2063 | (* found a loop, have to try AW *) | |
2064 | (* the formula is | |
2065 | A[E[phi1 U phi2] & phi1 W phi2] | |
2066 | the and is nonstrict *) | |
2067 | (* tmp_res is bigger than s2, so perhaps closer to s1 *) | |
2068 | Printf.printf "AW\n"; flush stdout; | |
2069 | let s1 = | |
485bce71 C |
2070 | triples_conj |
2071 | (satEU dir m s1 tmp_res new_required_states | |
2072 | (* no graph, for the moment *) | |
2073 | (fun y str -> ())) | |
2074 | s1 in | |
34e49164 C |
2075 | let res = |
2076 | strict_A2 strict satAW satEF dir m s1 s2 new_required_states in | |
2077 | anno res [child1; child2])) | |
2078 | | A.Implies(phi1,phi2) -> | |
2079 | satv unchecked required required_states | |
2080 | (A.Or(A.Not phi1,phi2)) | |
2081 | env | |
2082 | | A.Exists (keep,v,phi1) -> | |
2083 | let new_required = drop_required v required in | |
2084 | let (child,res) = | |
2085 | satv unchecked new_required required_states phi1 env in | |
2086 | Printf.printf "exists\n"; flush stdout; | |
2087 | anno (triples_witness v unchecked (not keep) res) [child] | |
2088 | | A.Let(v,phi1,phi2) -> | |
2089 | let (child1,res1) = | |
2090 | satv unchecked required required_states phi1 env in | |
2091 | let (child2,res2) = | |
2092 | satv unchecked required required_states phi2 ((v,res1) :: env) in | |
2093 | anno res2 [child1;child2] | |
2094 | | A.LetR(dir,v,phi1,phi2) -> | |
2095 | let new_required_states = get_reachable dir m required_states in | |
2096 | let (child1,res1) = | |
2097 | satv unchecked required new_required_states phi1 env in | |
2098 | let (child2,res2) = | |
2099 | satv unchecked required required_states phi2 ((v,res1) :: env) in | |
2100 | anno res2 [child1;child2] | |
2101 | | A.Ref(v) -> | |
2102 | Printf.printf "Ref\n"; flush stdout; | |
2103 | let res = List.assoc v env in | |
2104 | let res = | |
2105 | if unchecked | |
2106 | then List.map (function (s,th,_) -> (s,th,[])) res | |
2107 | else res in | |
2108 | anno res [] | |
2109 | | A.XX(phi) -> failwith "should have been removed" in | |
2110 | let res1 = drop_wits required_states res phi in | |
2111 | if not(res1 = res) | |
2112 | then | |
2113 | begin | |
2114 | print_required_states required_states; | |
2115 | print_state "after drop_wits" res1 end; | |
2116 | (child,res1) | |
2117 | ||
2118 | ;; | |
2119 | ||
2120 | let sat_verbose annotate maxlvl lvl m phi = | |
2121 | sat_verbose_loop false [] None annotate maxlvl lvl m phi [] | |
2122 | ||
2123 | (* Type for annotations collected in a tree *) | |
2124 | type ('a) witAnnoTree = WitAnno of ('a * ('a witAnnoTree) list);; | |
2125 | ||
2126 | let sat_annotree annotate m phi = | |
2127 | let tree_anno l phi res chld = WitAnno(annotate l phi res,chld) in | |
2128 | sat_verbose_loop false [] None tree_anno (-1) 0 m phi [] | |
2129 | ;; | |
2130 | ||
2131 | (* | |
2132 | let sat m phi = satloop m phi [] | |
2133 | ;; | |
2134 | *) | |
2135 | ||
2136 | let simpleanno l phi res = | |
2137 | let pp s = | |
2138 | Format.print_string ("\n" ^ s ^ "\n------------------------------\n"); | |
2139 | print_generic_algo (List.sort compare res); | |
2140 | Format.print_string "\n------------------------------\n\n" in | |
2141 | let pp_dir = function | |
2142 | A.FORWARD -> () | |
2143 | | A.BACKWARD -> pp "^" in | |
2144 | match phi with | |
2145 | | A.False -> pp "False" | |
2146 | | A.True -> pp "True" | |
2147 | | A.Pred(p) -> pp ("Pred" ^ (Common.dump p)) | |
2148 | | A.Not(phi) -> pp "Not" | |
2149 | | A.Exists(_,v,phi) -> pp ("Exists " ^ (Common.dump(v))) | |
2150 | | A.And(_,phi1,phi2) -> pp "And" | |
2151 | | A.AndAny(dir,_,phi1,phi2) -> pp "AndAny" | |
2152 | | A.HackForStmt(dir,_,phi1,phi2) -> pp "HackForStmt" | |
2153 | | A.Or(phi1,phi2) -> pp "Or" | |
2154 | | A.SeqOr(phi1,phi2) -> pp "SeqOr" | |
2155 | | A.Implies(phi1,phi2) -> pp "Implies" | |
2156 | | A.AF(dir,_,phi1) -> pp "AF"; pp_dir dir | |
2157 | | A.AX(dir,_,phi1) -> pp "AX"; pp_dir dir | |
2158 | | A.AG(dir,_,phi1) -> pp "AG"; pp_dir dir | |
2159 | | A.AW(dir,_,phi1,phi2)-> pp "AW"; pp_dir dir | |
2160 | | A.AU(dir,_,phi1,phi2)-> pp "AU"; pp_dir dir | |
2161 | | A.EF(dir,phi1) -> pp "EF"; pp_dir dir | |
2162 | | A.EX(dir,phi1) -> pp "EX"; pp_dir dir | |
2163 | | A.EG(dir,phi1) -> pp "EG"; pp_dir dir | |
2164 | | A.EU(dir,phi1,phi2) -> pp "EU"; pp_dir dir | |
2165 | | A.Let (x,phi1,phi2) -> pp ("Let"^" "^x) | |
2166 | | A.LetR (dir,x,phi1,phi2) -> pp ("LetR"^" "^x); pp_dir dir | |
2167 | | A.Ref(s) -> pp ("Ref("^s^")") | |
2168 | | A.Uncheck(s) -> pp "Uncheck" | |
2169 | | A.InnerAnd(s) -> pp "InnerAnd" | |
2170 | | A.XX(phi1) -> pp "XX" | |
2171 | ;; | |
2172 | ||
2173 | ||
2174 | (* pad: Rene, you can now use the module pretty_print_ctl.ml to | |
2175 | print a ctl formula more accurately if you want. | |
2176 | Use the print_xxx provided in the different module to call | |
2177 | Pretty_print_ctl.pp_ctl. | |
2178 | *) | |
2179 | ||
2180 | let simpleanno2 l phi res = | |
2181 | begin | |
2182 | Pretty_print_ctl.pp_ctl (P.print_predicate, SUB.print_mvar) false phi; | |
2183 | Format.print_newline (); | |
2184 | Format.print_string "----------------------------------------------------"; | |
2185 | Format.print_newline (); | |
2186 | print_generic_algo (List.sort compare res); | |
2187 | Format.print_newline (); | |
2188 | Format.print_string "----------------------------------------------------"; | |
2189 | Format.print_newline (); | |
2190 | Format.print_newline (); | |
2191 | end | |
2192 | ||
2193 | ||
2194 | (* ---------------------------------------------------------------------- *) | |
2195 | (* Benchmarking *) | |
2196 | (* ---------------------------------------------------------------------- *) | |
2197 | ||
2198 | type optentry = bool ref * string | |
2199 | type options = {label : optentry; unch : optentry; | |
2200 | conj : optentry; compl1 : optentry; compl2 : optentry; | |
2201 | newinfo : optentry; | |
2202 | reqenv : optentry; reqstates : optentry} | |
2203 | ||
2204 | let options = | |
2205 | {label = (pSATLABEL_MEMO_OPT,"satlabel_memo_opt"); | |
2206 | unch = (pUNCHECK_OPT,"uncheck_opt"); | |
2207 | conj = (pTRIPLES_CONJ_OPT,"triples_conj_opt"); | |
2208 | compl1 = (pTRIPLES_COMPLEMENT_OPT,"triples_complement_opt"); | |
2209 | compl2 = (pTRIPLES_COMPLEMENT_SIMPLE_OPT,"triples_complement_simple_opt"); | |
2210 | newinfo = (pNEW_INFO_OPT,"new_info_opt"); | |
2211 | reqenv = (pREQUIRED_ENV_OPT,"required_env_opt"); | |
2212 | reqstates = (pREQUIRED_STATES_OPT,"required_states_opt")} | |
2213 | ||
2214 | let baseline = | |
2215 | [("none ",[]); | |
2216 | ("label ",[options.label]); | |
2217 | ("unch ",[options.unch]); | |
2218 | ("unch and label ",[options.label;options.unch])] | |
2219 | ||
2220 | let conjneg = | |
2221 | [("conj ", [options.conj]); | |
2222 | ("compl1 ", [options.compl1]); | |
2223 | ("compl12 ", [options.compl1;options.compl2]); | |
2224 | ("conj/compl12 ", [options.conj;options.compl1;options.compl2]); | |
2225 | ("conj unch satl ", [options.conj;options.unch;options.label]); | |
2226 | (* | |
2227 | ("compl1 unch satl ", [options.compl1;options.unch;options.label]); | |
2228 | ("compl12 unch satl ", | |
2229 | [options.compl1;options.compl2;options.unch;options.label]); *) | |
2230 | ("conj/compl12 unch satl ", | |
2231 | [options.conj;options.compl1;options.compl2;options.unch;options.label])] | |
2232 | ||
2233 | let path = | |
2234 | [("newinfo ", [options.newinfo]); | |
2235 | ("newinfo unch satl ", [options.newinfo;options.unch;options.label])] | |
2236 | ||
2237 | let required = | |
2238 | [("reqenv ", [options.reqenv]); | |
2239 | ("reqstates ", [options.reqstates]); | |
2240 | ("reqenv/states ", [options.reqenv;options.reqstates]); | |
2241 | (* ("reqenv unch satl ", [options.reqenv;options.unch;options.label]); | |
2242 | ("reqstates unch satl ", | |
2243 | [options.reqstates;options.unch;options.label]);*) | |
2244 | ("reqenv/states unch satl ", | |
2245 | [options.reqenv;options.reqstates;options.unch;options.label])] | |
2246 | ||
2247 | let all_options = | |
2248 | [options.label;options.unch;options.conj;options.compl1;options.compl2; | |
2249 | options.newinfo;options.reqenv;options.reqstates] | |
2250 | ||
2251 | let all = | |
2252 | [("all ",all_options)] | |
2253 | ||
2254 | let all_options_but_path = | |
2255 | [options.label;options.unch;options.conj;options.compl1;options.compl2; | |
2256 | options.reqenv;options.reqstates] | |
2257 | ||
2258 | let all_but_path = ("all but path ",all_options_but_path) | |
2259 | ||
2260 | let counters = | |
2261 | [(satAW_calls, "satAW", ref 0); | |
2262 | (satAU_calls, "satAU", ref 0); | |
2263 | (satEF_calls, "satEF", ref 0); | |
2264 | (satAF_calls, "satAF", ref 0); | |
2265 | (satEG_calls, "satEG", ref 0); | |
2266 | (satAG_calls, "satAG", ref 0); | |
2267 | (satEU_calls, "satEU", ref 0)] | |
2268 | ||
2269 | let perms = | |
2270 | map | |
2271 | (function (opt,x) -> | |
2272 | (opt,x,ref 0.0,ref 0, | |
2273 | List.map (function _ -> (ref 0, ref 0, ref 0)) counters)) | |
2274 | [List.hd all;all_but_path] | |
2275 | (*(all@baseline@conjneg@path@required)*) | |
2276 | ||
2277 | exception Out | |
2278 | ||
2279 | let rec iter fn = function | |
2280 | 1 -> fn() | |
2281 | | n -> let _ = fn() in | |
2282 | (Hashtbl.clear reachable_table; | |
2283 | Hashtbl.clear memo_label; | |
2284 | triples := 0; | |
2285 | iter fn (n-1)) | |
2286 | ||
2287 | let copy_to_stderr fl = | |
2288 | let i = open_in fl in | |
2289 | let rec loop _ = | |
2290 | Printf.fprintf stderr "%s\n" (input_line i); | |
2291 | loop() in | |
2292 | try loop() with _ -> (); | |
2293 | close_in i | |
2294 | ||
2295 | let bench_sat (_,_,states) fn = | |
2296 | List.iter (function (opt,_) -> opt := false) all_options; | |
2297 | let answers = | |
2298 | concatmap | |
2299 | (function (name,options,time,trips,counter_info) -> | |
2300 | let iterct = !Flag_ctl.bench in | |
2301 | if !time > float_of_int timeout then time := -100.0; | |
2302 | if not (!time = -100.0) | |
2303 | then | |
2304 | begin | |
2305 | Hashtbl.clear reachable_table; | |
2306 | Hashtbl.clear memo_label; | |
2307 | List.iter (function (opt,_) -> opt := true) options; | |
2308 | List.iter (function (calls,_,save_calls) -> save_calls := !calls) | |
2309 | counters; | |
2310 | triples := 0; | |
2311 | let res = | |
2312 | let bef = Sys.time() in | |
2313 | try | |
2314 | Common.timeout_function timeout | |
2315 | (fun () -> | |
2316 | let bef = Sys.time() in | |
2317 | let res = iter fn iterct in | |
2318 | let aft = Sys.time() in | |
2319 | time := !time +. (aft -. bef); | |
2320 | trips := !trips + !triples; | |
2321 | List.iter2 | |
2322 | (function (calls,_,save_calls) -> | |
2323 | function (current_calls,current_cfg,current_max_cfg) -> | |
2324 | current_calls := | |
2325 | !current_calls + (!calls - !save_calls); | |
2326 | if (!calls - !save_calls) > 0 | |
2327 | then | |
2328 | (let st = List.length states in | |
2329 | current_cfg := !current_cfg + st; | |
2330 | if st > !current_max_cfg | |
2331 | then current_max_cfg := st)) | |
2332 | counters counter_info; | |
2333 | [res]) | |
2334 | with | |
2335 | Common.Timeout -> | |
2336 | begin | |
2337 | let aft = Sys.time() in | |
2338 | time := -100.0; | |
2339 | Printf.fprintf stderr "Timeout at %f on: %s\n" | |
2340 | (aft -. bef) name; | |
2341 | [] | |
2342 | end in | |
2343 | List.iter (function (opt,_) -> opt := false) options; | |
2344 | res | |
2345 | end | |
2346 | else []) | |
2347 | perms in | |
2348 | Printf.fprintf stderr "\n"; | |
2349 | match answers with | |
2350 | [] -> [] | |
2351 | | res::rest -> | |
2352 | (if not(List.for_all (function x -> x = res) rest) | |
2353 | then | |
2354 | (List.iter (print_state "a state") answers; | |
2355 | Printf.printf "something doesn't work\n"); | |
2356 | res) | |
2357 | ||
2358 | let print_bench _ = | |
2359 | let iterct = !Flag_ctl.bench in | |
2360 | if iterct > 0 | |
2361 | then | |
2362 | (List.iter | |
2363 | (function (name,options,time,trips,counter_info) -> | |
2364 | Printf.fprintf stderr "%s Numbers: %f %d " | |
2365 | name (!time /. (float_of_int iterct)) !trips; | |
2366 | List.iter | |
2367 | (function (calls,cfg,max_cfg) -> | |
2368 | Printf.fprintf stderr "%d %d %d " (!calls / iterct) !cfg !max_cfg) | |
2369 | counter_info; | |
2370 | Printf.fprintf stderr "\n") | |
2371 | perms) | |
2372 | ||
2373 | (* ---------------------------------------------------------------------- *) | |
2374 | (* preprocessing: ignore irrelevant functions *) | |
2375 | ||
2376 | let preprocess (cfg,_,_) label = function | |
2377 | [] -> true (* no information, try everything *) | |
2378 | | l -> | |
2379 | let sz = G.size cfg in | |
2380 | let verbose_output pred = function | |
2381 | [] -> | |
2382 | Printf.printf "did not find:\n"; | |
2383 | P.print_predicate pred; Format.print_newline() | |
2384 | | _ -> | |
2385 | Printf.printf "found:\n"; | |
2386 | P.print_predicate pred; Format.print_newline(); | |
2387 | Printf.printf "but it was not enough\n" in | |
2388 | let get_any verbose x = | |
2389 | let res = | |
2390 | try Hashtbl.find memo_label x | |
2391 | with | |
2392 | Not_found -> | |
2393 | (let triples = label x in | |
2394 | let filtered = | |
2395 | List.map (function (st,th,_) -> (st,th)) triples in | |
2396 | Hashtbl.add memo_label x filtered; | |
2397 | filtered) in | |
2398 | if verbose then verbose_output x res; | |
2399 | not([] = res) in | |
2400 | let get_all l = | |
2401 | (* don't bother testing when there are more patterns than nodes *) | |
2402 | if List.length l > sz-2 | |
2403 | then false | |
2404 | else List.for_all (get_any false) l in | |
2405 | if List.exists get_all l | |
2406 | then true | |
2407 | else | |
2408 | (if !Flag_ctl.verbose_match | |
2409 | then | |
2410 | List.iter (List.iter (function x -> let _ = get_any true x in ())) | |
2411 | l; | |
2412 | false) | |
2413 | ||
2414 | let filter_partial_matches trips = | |
2415 | if !Flag_ctl.partial_match | |
2416 | then | |
2417 | let anynegwit = (* if any is neg, then all are *) | |
2418 | List.exists (function A.NegWit _ -> true | A.Wit _ -> false) in | |
2419 | let (bad,good) = | |
2420 | List.partition (function (s,th,wit) -> anynegwit wit) trips in | |
2421 | (match bad with | |
2422 | [] -> () | |
2423 | | _ -> print_state "partial matches" bad; Format.print_newline()); | |
2424 | good | |
2425 | else trips | |
2426 | ||
2427 | (* ---------------------------------------------------------------------- *) | |
2428 | (* Main entry point for engine *) | |
2429 | let sat m phi reqopt = | |
2430 | try | |
2431 | (match !Flag_ctl.steps with | |
2432 | None -> step_count := 0 | |
2433 | | Some x -> step_count := x); | |
2434 | Hashtbl.clear reachable_table; | |
2435 | Hashtbl.clear memo_label; | |
2436 | let (x,label,states) = m in | |
2437 | if (!Flag_ctl.bench > 0) or (preprocess m label reqopt) | |
2438 | then | |
2439 | ((* to drop when Yoann initialized this flag *) | |
2440 | if List.exists (G.extract_is_loop x) states | |
2441 | then Flag_ctl.loop_in_src_code := true; | |
2442 | let m = (x,label,List.sort compare states) in | |
2443 | let res = | |
2444 | if(!Flag_ctl.verbose_ctl_engine) | |
2445 | then | |
2446 | let fn _ = snd (sat_annotree simpleanno2 m phi) in | |
2447 | if !Flag_ctl.bench > 0 | |
2448 | then bench_sat m fn | |
2449 | else fn() | |
2450 | else | |
2451 | let fn _ = satloop false [] None m phi [] in | |
2452 | if !Flag_ctl.bench > 0 | |
2453 | then bench_sat m fn | |
2454 | else Common.profile_code "ctl" (fun _ -> fn()) in | |
2455 | let res = filter_partial_matches res in | |
2456 | (* | |
2457 | Printf.printf "steps: start %d, stop %d\n" | |
2458 | (match !Flag_ctl.steps with Some x -> x | _ -> 0) | |
2459 | !step_count; | |
2460 | Printf.printf "triples: %d\n" !triples; | |
2461 | print_state "final result" res; | |
2462 | *) | |
708f4980 | 2463 | List.sort compare res) |
34e49164 C |
2464 | else |
2465 | (if !Flag_ctl.verbose_ctl_engine | |
2466 | then Common.pr2 "missing something required"; | |
2467 | []) | |
2468 | with Steps -> [] | |
2469 | ;; | |
2470 | ||
2471 | (* ********************************************************************** *) | |
2472 | (* End of Module: CTL_ENGINE *) | |
2473 | (* ********************************************************************** *) | |
2474 | end | |
2475 | ;; |