1 (* Title: HOL/Nitpick/Tools/nitpick.ML
2 Author: Jasmin Blanchette, TU Muenchen
5 Finite model generation for HOL formulas using Kodkod.
11 cards_assigns: (typ option * int list) list,
12 maxes_assigns: (styp option * int list) list,
13 iters_assigns: (styp option * int list) list,
14 bisim_depths: int list,
15 boxes: (typ option * bool option) list,
16 monos: (typ option * bool option) list,
17 wfs: (styp option * bool option) list,
24 user_axioms: bool option,
26 coalesce_type_vars: bool,
27 destroy_constrs: bool,
30 star_linear_preds: bool,
34 timeout: Time.time option,
35 tac_timeout: Time.time option,
44 formats: (term option * int list) list,
47 check_potential: bool,
52 val register_frac_type : string -> (string * string) list -> theory -> theory
53 val unregister_frac_type : string -> theory -> theory
54 val register_codatatype : typ -> string -> styp list -> theory -> theory
55 val unregister_codatatype : typ -> theory -> theory
56 val pick_nits_in_term :
57 Proof.state -> params -> bool -> term list -> term -> string * Proof.state
58 val pick_nits_in_subgoal :
59 Proof.state -> params -> bool -> int -> string * Proof.state
62 structure Nitpick : NITPICK =
76 cards_assigns: (typ option * int list) list,
77 maxes_assigns: (styp option * int list) list,
78 iters_assigns: (styp option * int list) list,
79 bisim_depths: int list,
80 boxes: (typ option * bool option) list,
81 monos: (typ option * bool option) list,
82 wfs: (styp option * bool option) list,
89 user_axioms: bool option,
91 coalesce_type_vars: bool,
92 destroy_constrs: bool,
95 star_linear_preds: bool,
99 timeout: Time.time option,
100 tac_timeout: Time.time option,
106 show_datatypes: bool,
109 formats: (term option * int list) list,
112 check_potential: bool,
117 type problem_extension = {
118 free_names: nut list,
120 nonsel_names: nut list,
121 rel_table: nut NameTable.table,
124 core: Kodkod.formula,
125 defs: Kodkod.formula list}
127 type rich_problem = Kodkod.problem * problem_extension
129 (* Proof.context -> string -> term list -> Pretty.T list *)
130 fun pretties_for_formulas _ _ [] = []
131 | pretties_for_formulas ctxt s ts =
132 [Pretty.str (s ^ plural_s_for_list ts ^ ":"),
133 Pretty.indent indent_size (Pretty.chunks
134 (map2 (fn j => fn t =>
135 Pretty.block [t |> shorten_const_names_in_term
136 |> Syntax.pretty_term ctxt,
137 Pretty.str (if j = 1 then "." else ";")])
138 (length ts downto 1) ts))]
140 val max_liberal_delay_ms = 200
141 val max_liberal_delay_percent = 2
143 (* Time.time option -> int *)
144 fun liberal_delay_for_timeout NONE = max_liberal_delay_ms
145 | liberal_delay_for_timeout (SOME timeout) =
146 Int.max (0, Int.min (max_liberal_delay_ms,
147 Time.toMilliseconds timeout
148 * max_liberal_delay_percent div 100))
150 (* Time.time option -> bool *)
151 fun passed_deadline NONE = false
152 | passed_deadline (SOME time) = Time.compare (Time.now (), time) <> LESS
154 (* ('a * bool option) list -> bool *)
155 fun none_true asgns = forall (not_equal (SOME true) o snd) asgns
158 [@{sort default}, @{sort zero}, @{sort one}, @{sort plus}, @{sort minus},
159 @{sort uminus}, @{sort times}, @{sort inverse}, @{sort abs}, @{sort sgn},
160 @{sort ord}, @{sort eq}, @{sort number}]
161 (* theory -> typ -> bool *)
162 fun is_tfree_with_weaselly_sort thy (TFree (_, S)) =
163 exists (curry (Sign.subsort thy) S) weaselly_sorts
164 | is_tfree_with_weaselly_sort _ _ = false
165 (* theory term -> bool *)
166 val has_weaselly_sorts =
167 exists_type o exists_subtype o is_tfree_with_weaselly_sort
169 (* Time.time -> Proof.state -> params -> bool -> term -> string * Proof.state *)
170 fun pick_them_nits_in_term deadline state (params : params) auto orig_assm_ts
173 val timer = Timer.startRealTimer ()
174 val thy = Proof.theory_of state
175 val ctxt = Proof.context_of state
176 val {cards_assigns, maxes_assigns, iters_assigns, bisim_depths, boxes,
177 monos, wfs, sat_solver, blocking, falsify, debug, verbose, overlord,
178 user_axioms, assms, coalesce_type_vars, destroy_constrs, specialize,
179 skolemize, star_linear_preds, uncurry, fast_descrs, peephole_optim,
180 tac_timeout, sym_break, sharing_depth, flatten_props, max_threads,
181 show_skolems, show_datatypes, show_consts, evals, formats,
182 max_potential, max_genuine, check_potential, check_genuine, batch_size,
185 val state_ref = Unsynchronized.ref state
186 (* Pretty.T -> unit *)
189 Unsynchronized.change state_ref o Proof.goal_message o K
190 o curry Pretty.blk 0 o cons (Pretty.str "") o single
191 o Pretty.mark Markup.hilite
193 priority o Pretty.string_of
194 (* (unit -> Pretty.T) -> unit *)
195 fun pprint_m f = () |> not auto ? pprint o f
196 fun pprint_v f = () |> verbose ? pprint o f
197 fun pprint_d f = () |> debug ? pprint o f
199 val print = pprint o curry Pretty.blk 0 o pstrs
200 (* (unit -> string) -> unit *)
201 fun print_m f = pprint_m (curry Pretty.blk 0 o pstrs o f)
202 fun print_v f = pprint_v (curry Pretty.blk 0 o pstrs o f)
203 fun print_d f = pprint_d (curry Pretty.blk 0 o pstrs o f)
206 fun check_deadline () =
207 if debug andalso passed_deadline deadline then raise TimeLimit.TimeOut
210 fun do_interrupted () =
211 if passed_deadline deadline then raise TimeLimit.TimeOut
214 val _ = print_m (K "Nitpicking...")
215 val neg_t = if falsify then Logic.mk_implies (orig_t, @{prop False})
217 val assms_t = if assms orelse auto then
218 Logic.mk_conjunction_list (neg_t :: orig_assm_ts)
221 val (assms_t, evals) =
223 |> coalesce_type_vars ? coalesce_type_vars_in_terms
225 val original_max_potential = max_potential
226 val original_max_genuine = max_genuine
228 val _ = priority ("*** " ^ Syntax.string_of_term ctxt orig_t)
229 val _ = List.app (fn t => priority ("*** " ^ Syntax.string_of_term ctxt t))
232 val max_bisim_depth = fold Integer.max bisim_depths ~1
233 val case_names = case_const_names thy
234 val (defs, built_in_nondefs, user_nondefs) = all_axioms_of thy
235 val def_table = const_def_table ctxt defs
236 val nondef_table = const_nondef_table (built_in_nondefs @ user_nondefs)
237 val simp_table = Unsynchronized.ref (const_simp_table ctxt)
238 val psimp_table = const_psimp_table ctxt
239 val intro_table = inductive_intro_table ctxt def_table
240 val ground_thm_table = ground_theorem_table thy
241 val ersatz_table = ersatz_table thy
242 val (ext_ctxt as {skolems, special_funs, wf_cache, ...}) =
243 {thy = thy, ctxt = ctxt, max_bisim_depth = max_bisim_depth, boxes = boxes,
244 user_axioms = user_axioms, debug = debug, wfs = wfs,
245 destroy_constrs = destroy_constrs, specialize = specialize,
246 skolemize = skolemize, star_linear_preds = star_linear_preds,
247 uncurry = uncurry, fast_descrs = fast_descrs, tac_timeout = tac_timeout,
248 evals = evals, case_names = case_names, def_table = def_table,
249 nondef_table = nondef_table, user_nondefs = user_nondefs,
250 simp_table = simp_table, psimp_table = psimp_table,
251 intro_table = intro_table, ground_thm_table = ground_thm_table,
252 ersatz_table = ersatz_table, skolems = Unsynchronized.ref [],
253 special_funs = Unsynchronized.ref [],
254 unrolled_preds = Unsynchronized.ref [], wf_cache = Unsynchronized.ref []}
255 val frees = Term.add_frees assms_t []
256 val _ = null (Term.add_tvars assms_t [])
257 orelse raise NOT_SUPPORTED "schematic type variables"
258 val (((def_ts, nondef_ts), (got_all_mono_user_axioms, no_poly_user_axioms)),
259 core_t) = preprocess_term ext_ctxt assms_t
260 val got_all_user_axioms =
261 got_all_mono_user_axioms andalso no_poly_user_axioms
263 (* styp * (bool * bool) -> unit *)
264 fun print_wf (x, (gfp, wf)) =
265 pprint (Pretty.blk (0,
266 pstrs ("The " ^ (if gfp then "co" else "") ^ "inductive predicate \"")
267 @ Syntax.pretty_term ctxt (Const x) ::
269 "\" was proved well-founded. Nitpick can compute it \
272 "\" could not be proved well-founded. Nitpick might need to \
274 val _ = if verbose then List.app print_wf (!wf_cache) else ()
278 (pretties_for_formulas ctxt "Preprocessed formula" [core_t] @
279 pretties_for_formulas ctxt "Relevant definitional axiom" def_ts @
280 pretties_for_formulas ctxt "Relevant nondefinitional axiom"
282 val _ = List.app (ignore o Term.type_of) (core_t :: def_ts @ nondef_ts)
283 handle TYPE (_, Ts, ts) =>
284 raise TYPE ("Nitpick.pick_them_nits_in_term", Ts, ts)
286 val unique_scope = forall (equal 1 o length o snd) cards_assigns
288 fun is_free_type_monotonic T =
290 case triple_lookup (type_match thy) monos T of
292 | _ => formulas_monotonic ext_ctxt T def_ts nondef_ts core_t
293 fun is_datatype_monotonic T =
295 case triple_lookup (type_match thy) monos T of
298 not (is_pure_typedef thy T) orelse is_univ_typedef thy T
299 orelse is_number_type thy T
300 orelse formulas_monotonic ext_ctxt T def_ts nondef_ts core_t
301 val Ts = ground_types_in_terms ext_ctxt (core_t :: def_ts @ nondef_ts)
302 |> sort TermOrd.typ_ord
303 val (all_dataTs, all_free_Ts) =
304 List.partition (is_integer_type orf is_datatype thy) Ts
305 val (mono_dataTs, nonmono_dataTs) =
306 List.partition is_datatype_monotonic all_dataTs
307 val (mono_free_Ts, nonmono_free_Ts) =
308 List.partition is_free_type_monotonic all_free_Ts
311 if not unique_scope andalso not (null mono_free_Ts) then
314 val ss = map (quote o string_for_type ctxt) mono_free_Ts
316 "The type" ^ plural_s_for_list ss ^ " " ^
317 space_implode " " (serial_commas "and" ss) ^ " " ^
318 (if none_true monos then
319 "passed the monotonicity test"
321 (if length ss = 1 then "is" else "are") ^
322 " considered monotonic") ^
323 ". Nitpick might be able to skip some scopes."
327 val mono_Ts = mono_dataTs @ mono_free_Ts
328 val nonmono_Ts = nonmono_dataTs @ nonmono_free_Ts
331 val _ = priority "Monotonic datatypes:"
332 val _ = List.app (priority o string_for_type ctxt) mono_dataTs
333 val _ = priority "Nonmonotonic datatypes:"
334 val _ = List.app (priority o string_for_type ctxt) nonmono_dataTs
335 val _ = priority "Monotonic free types:"
336 val _ = List.app (priority o string_for_type ctxt) mono_free_Ts
337 val _ = priority "Nonmonotonic free types:"
338 val _ = List.app (priority o string_for_type ctxt) nonmono_free_Ts
341 val core_u = nut_from_term thy fast_descrs (!special_funs) Eq core_t
342 val def_us = map (nut_from_term thy fast_descrs (!special_funs) DefEq)
344 val nondef_us = map (nut_from_term thy fast_descrs (!special_funs) Eq)
346 val (free_names, const_names) =
347 fold add_free_and_const_names (core_u :: def_us @ nondef_us) ([], [])
348 val nonsel_names = filter_out (is_sel o nickname_of) const_names
349 val would_be_genuine = got_all_user_axioms andalso none_true wfs
351 val _ = List.app (priority o string_for_nut ctxt)
352 (core_u :: def_us @ nondef_us)
354 val need_incremental = Int.max (max_potential, max_genuine) >= 2
355 val effective_sat_solver =
356 if sat_solver <> "smart" then
357 if need_incremental andalso
358 not (sat_solver mem Kodkod_SAT.configured_sat_solvers true) then
359 (print_m (K ("An incremental SAT solver is required: \"SAT4J\" will \
360 \be used instead of " ^ quote sat_solver ^ "."));
365 Kodkod_SAT.smart_sat_solver_name need_incremental
367 if sat_solver = "smart" then
368 print_v (fn () => "Using SAT solver " ^ quote effective_sat_solver ^
370 (if need_incremental then " incremental " else " ") ^
371 "solvers are configured: " ^
372 commas (map quote (Kodkod_SAT.configured_sat_solvers
373 need_incremental)) ^ ".")
377 val too_big_scopes = Unsynchronized.ref []
379 (* bool -> scope -> rich_problem option *)
380 fun problem_for_scope liberal
381 (scope as {card_assigns, bisim_depth, datatypes, ofs, ...}) =
383 val _ = not (exists (fn other => scope_less_eq other scope)
385 orelse raise LIMIT ("Nitpick.pick_them_nits_in_term.\
386 \problem_for_scope", "too big scope")
388 val _ = priority "Offsets:"
389 val _ = List.app (fn (T, j0) =>
390 priority (string_for_type ctxt T ^ " = " ^
394 val all_precise = forall (is_precise_type datatypes) Ts
395 (* nut list -> rep NameTable.table -> nut list * rep NameTable.table *)
396 val repify_consts = choose_reps_for_consts scope all_precise
397 val main_j0 = offset_of_type ofs bool_T
398 val (nat_card, nat_j0) = spec_of_type scope nat_T
399 val (int_card, int_j0) = spec_of_type scope int_T
400 val _ = forall (equal main_j0) [nat_j0, int_j0]
401 orelse raise BAD ("Nitpick.pick_them_nits_in_term.\
402 \problem_for_scope", "bad offsets")
403 val kk = kodkod_constrs peephole_optim nat_card int_card main_j0
404 val (free_names, rep_table) =
405 choose_reps_for_free_vars scope free_names NameTable.empty
406 val (sel_names, rep_table) = choose_reps_for_all_sels scope rep_table
407 val (nonsel_names, rep_table) = repify_consts nonsel_names rep_table
408 val min_highest_arity =
409 NameTable.fold (curry Int.max o arity_of_rep o snd) rep_table 1
411 NameTable.fold (curry Int.max o min_univ_card_of_rep o snd) rep_table
412 (univ_card nat_card int_card main_j0 [] Kodkod.True)
413 val _ = check_arity min_univ_card min_highest_arity
415 val core_u = choose_reps_in_nut scope liberal rep_table false core_u
416 val def_us = map (choose_reps_in_nut scope liberal rep_table true)
418 val nondef_us = map (choose_reps_in_nut scope liberal rep_table false)
421 val _ = List.app (priority o string_for_nut ctxt)
422 (free_names @ sel_names @ nonsel_names @
423 core_u :: def_us @ nondef_us)
425 val (free_rels, pool, rel_table) =
426 rename_free_vars free_names initial_pool NameTable.empty
427 val (sel_rels, pool, rel_table) =
428 rename_free_vars sel_names pool rel_table
429 val (other_rels, pool, rel_table) =
430 rename_free_vars nonsel_names pool rel_table
431 val core_u = rename_vars_in_nut pool rel_table core_u
432 val def_us = map (rename_vars_in_nut pool rel_table) def_us
433 val nondef_us = map (rename_vars_in_nut pool rel_table) nondef_us
434 (* nut -> Kodkod.formula *)
435 val to_f = kodkod_formula_from_nut ofs liberal kk
436 val core_f = to_f core_u
437 val def_fs = map to_f def_us
438 val nondef_fs = map to_f nondef_us
439 val formula = fold (fold s_and) [def_fs, nondef_fs] core_f
440 val comment = (if liberal then "liberal" else "conservative") ^ "\n" ^
441 PrintMode.setmp [] multiline_string_for_scope scope
442 val kodkod_sat_solver = Kodkod_SAT.sat_solver_spec effective_sat_solver
444 val delay = if liberal then
445 Option.map (fn time => Time.- (time, Time.now ()))
447 |> liberal_delay_for_timeout
450 val settings = [("solver", commas (map quote kodkod_sat_solver)),
451 ("skolem_depth", "-1"),
453 ("symmetry_breaking", signed_string_of_int sym_break),
454 ("sharing", signed_string_of_int sharing_depth),
455 ("flatten", Bool.toString flatten_props),
456 ("delay", signed_string_of_int delay)]
457 val plain_rels = free_rels @ other_rels
458 val plain_bounds = map (bound_for_plain_rel ctxt debug) plain_rels
459 val plain_axioms = map (declarative_axiom_for_plain_rel kk) plain_rels
460 val sel_bounds = map (bound_for_sel_rel ctxt debug datatypes) sel_rels
461 val dtype_axioms = declarative_axioms_for_datatypes ext_ctxt ofs kk
463 val declarative_axioms = plain_axioms @ dtype_axioms
464 val univ_card = univ_card nat_card int_card main_j0
465 (plain_bounds @ sel_bounds) formula
466 val built_in_bounds = bounds_for_built_in_rels_in_formula debug
467 univ_card nat_card int_card main_j0 formula
468 val bounds = built_in_bounds @ plain_bounds @ sel_bounds
469 |> not debug ? merge_bounds
471 fold Integer.max (map (fst o fst) (maps fst bounds)) 0
472 val formula = fold_rev s_and declarative_axioms formula
473 val _ = if formula = Kodkod.False then ()
474 else check_arity univ_card highest_arity
476 SOME ({comment = comment, settings = settings, univ_card = univ_card,
477 tuple_assigns = [], bounds = bounds,
478 int_bounds = sequential_int_bounds univ_card,
479 expr_assigns = [], formula = formula},
480 {free_names = free_names, sel_names = sel_names,
481 nonsel_names = nonsel_names, rel_table = rel_table,
482 liberal = liberal, scope = scope, core = core_f,
483 defs = nondef_fs @ def_fs @ declarative_axioms})
485 handle LIMIT (loc, msg) =>
486 if loc = "Nitpick_Kodkod.check_arity"
487 andalso not (Typtab.is_empty ofs) then
488 problem_for_scope liberal
489 {ext_ctxt = ext_ctxt, card_assigns = card_assigns,
490 bisim_depth = bisim_depth, datatypes = datatypes,
492 else if loc = "Nitpick.pick_them_nits_in_term.\
493 \problem_for_scope" then
496 (Unsynchronized.change too_big_scopes (cons scope);
497 print_v (fn () => ("Limit reached: " ^ msg ^
498 ". Dropping " ^ (if liberal then "potential"
500 " component of scope."));
503 (* int -> (''a * int list list) list -> ''a -> Kodkod.tuple_set *)
504 fun tuple_set_for_rel univ_card =
505 Kodkod.TupleSet o map (kk_tuple debug univ_card) o the
506 oo AList.lookup (op =)
508 val word_model = if falsify then "counterexample" else "model"
510 val scopes = Unsynchronized.ref []
511 val generated_scopes = Unsynchronized.ref []
512 val generated_problems = Unsynchronized.ref []
513 val checked_problems = Unsynchronized.ref (SOME [])
514 val met_potential = Unsynchronized.ref 0
516 (* rich_problem list -> int list -> unit *)
517 fun update_checked_problems problems =
518 List.app (Unsynchronized.change checked_problems o Option.map o cons
521 (* bool -> Kodkod.raw_bound list -> problem_extension -> bool option *)
522 fun print_and_check_model genuine bounds
523 ({free_names, sel_names, nonsel_names, rel_table, scope, ...}
524 : problem_extension) =
526 val (reconstructed_model, codatatypes_ok) =
527 reconstruct_hol_model {show_skolems = show_skolems,
528 show_datatypes = show_datatypes,
529 show_consts = show_consts}
530 scope formats frees free_names sel_names nonsel_names rel_table
532 val would_be_genuine = would_be_genuine andalso codatatypes_ok
534 pprint (Pretty.chunks
536 (pstrs ("Nitpick found a" ^
537 (if not genuine then " potential "
538 else if would_be_genuine then " "
539 else " likely genuine ") ^ word_model) @
540 (case pretties_for_scope scope verbose of
542 | pretties => pstrs " for " @ pretties) @
543 [Pretty.str ":\n"])),
544 Pretty.indent indent_size reconstructed_model]);
546 (if check_genuine then
547 (case prove_hol_model scope tac_timeout free_names sel_names
548 rel_table bounds assms_t of
549 SOME true => print ("Confirmation by \"auto\": The above " ^
550 word_model ^ " is really genuine.")
552 if would_be_genuine then
553 error ("A supposedly genuine " ^ word_model ^ " was shown to\
554 \be spurious by \"auto\".\nThis should never happen.\n\
555 \Please send a bug report to blanchet\
558 print ("Refutation by \"auto\": The above " ^ word_model ^
560 | NONE => print "No confirmation by \"auto\".")
563 if has_weaselly_sorts thy orig_t then
564 print "Hint: Maybe you forgot a type constraint?"
567 if not would_be_genuine then
568 if no_poly_user_axioms then
571 [] |> not got_all_mono_user_axioms
572 ? cons ("user_axioms", "\"true\"")
573 |> not (none_true wfs)
574 ? cons ("wf", "\"smart\" or \"false\"")
575 |> not codatatypes_ok
576 ? cons ("bisim_depth", "a nonnegative value")
578 map (fn (name, value) => quote name ^ " set to " ^ value)
581 print ("Try again with " ^
582 space_implode " " (serial_commas "and" ss) ^
583 " to confirm that the " ^ word_model ^ " is genuine.")
586 print ("Nitpick is unable to guarantee the authenticity of \
587 \the " ^ word_model ^ " in the presence of polymorphic \
594 (Unsynchronized.inc met_potential;
595 if check_potential then
597 val status = prove_hol_model scope tac_timeout free_names
598 sel_names rel_table bounds assms_t
601 SOME true => print ("Confirmation by \"auto\": The above " ^
602 word_model ^ " is genuine.")
603 | SOME false => print ("Refutation by \"auto\": The above " ^
604 word_model ^ " is spurious.")
605 | NONE => print "No confirmation by \"auto\".");
613 (* int -> int -> int -> bool -> rich_problem list -> int * int * int *)
614 fun solve_any_problem max_potential max_genuine donno first_time problems =
616 val max_potential = Int.max (0, max_potential)
617 val max_genuine = Int.max (0, max_genuine)
618 (* bool -> int * Kodkod.raw_bound list -> bool option *)
619 fun print_and_check genuine (j, bounds) =
620 print_and_check_model genuine bounds (snd (nth problems j))
621 val max_solutions = max_potential + max_genuine
622 |> not need_incremental ? curry Int.min 1
624 if max_solutions <= 0 then
627 case Kodkod.solve_any_problem overlord deadline max_threads
628 max_solutions (map fst problems) of
629 Kodkod.Normal ([], unsat_js) =>
630 (update_checked_problems problems unsat_js;
631 (max_potential, max_genuine, donno))
632 | Kodkod.Normal (sat_ps, unsat_js) =>
634 val (lib_ps, con_ps) =
635 List.partition (#liberal o snd o nth problems o fst) sat_ps
637 update_checked_problems problems (unsat_js @ map fst lib_ps);
640 val num_genuine = Library.take (max_potential, lib_ps)
641 |> map (print_and_check false)
642 |> filter (equal (SOME true)) |> length
643 val max_genuine = max_genuine - num_genuine
644 val max_potential = max_potential
645 - (length lib_ps - num_genuine)
647 if max_genuine <= 0 then
651 (* "co_js" is the list of conservative problems whose
652 liberal pendants couldn't be satisfied and hence that
653 most probably can't be satisfied themselves. *)
655 map (fn j => j - 1) unsat_js
659 (#scope (snd (nth problems j)))
660 (#scope (snd (nth problems (j + 1)))))
661 val bye_js = sort_distinct int_ord (map fst sat_ps @
664 problems |> filter_out_indices bye_js
665 |> max_potential <= 0
666 ? filter_out (#liberal o snd)
668 solve_any_problem max_potential max_genuine donno false
674 val _ = Library.take (max_genuine, con_ps)
675 |> List.app (ignore o print_and_check true)
676 val max_genuine = max_genuine - length con_ps
678 if max_genuine <= 0 orelse not first_time then
679 (0, max_genuine, donno)
682 val bye_js = sort_distinct int_ord
683 (map fst sat_ps @ unsat_js)
685 problems |> filter_out_indices bye_js
686 |> filter_out (#liberal o snd)
687 in solve_any_problem 0 max_genuine donno false problems end
690 | Kodkod.TimedOut unsat_js =>
691 (update_checked_problems problems unsat_js; raise TimeLimit.TimeOut)
692 | Kodkod.Interrupted NONE =>
693 (checked_problems := NONE; do_interrupted ())
694 | Kodkod.Interrupted (SOME unsat_js) =>
695 (update_checked_problems problems unsat_js; do_interrupted ())
696 | Kodkod.Error (s, unsat_js) =>
697 (update_checked_problems problems unsat_js;
698 print_v (K ("Kodkod error: " ^ s ^ "."));
699 (max_potential, max_genuine, donno + 1))
702 (* int -> int -> scope list -> int * int * int -> int * int * int *)
703 fun run_batch j n scopes (max_potential, max_genuine, donno) =
707 print_m (K "The scope specification is inconsistent.")
709 pprint (Pretty.chunks
711 pstrs ((if n > 1 then
712 "Batch " ^ string_of_int (j + 1) ^ " of " ^
713 signed_string_of_int n ^ ": "
716 "Trying " ^ string_of_int (length scopes) ^
717 " scope" ^ plural_s_for_list scopes ^ ":")),
718 Pretty.indent indent_size
722 (case pretties_for_scope scope true of
723 [] => [Pretty.str "Empty"]
724 | pretties => pretties) @
725 [Pretty.str (if j = 1 then "." else ";")]))
726 (length scopes downto 1) scopes))])
729 (* scope * bool -> rich_problem list * bool
730 -> rich_problem list * bool *)
731 fun add_problem_for_scope (scope as {datatypes, ...}, liberal)
734 case problem_for_scope liberal scope of
737 |> (null problems orelse
738 not (Kodkod.problems_equivalent (fst problem)
739 (fst (hd problems))))
740 ? cons problem, donno)
741 | NONE => (problems, donno + 1))
742 val (problems, donno) =
743 fold add_problem_for_scope
744 (map_product pair scopes
745 ((if max_genuine > 0 then [false] else []) @
746 (if max_potential > 0 then [true] else [])))
748 val _ = Unsynchronized.change generated_problems (append problems)
749 val _ = Unsynchronized.change generated_scopes (append scopes)
751 solve_any_problem max_potential max_genuine donno true (rev problems)
754 (* rich_problem list -> scope -> int *)
755 fun scope_count (problems : rich_problem list) scope =
756 length (filter (scopes_equivalent scope o #scope o snd) problems)
757 (* string -> string *)
758 fun excipit did_so_and_so =
760 (* rich_problem list -> rich_problem list *)
762 if !met_potential = max_potential then filter_out (#liberal o snd)
764 val total = length (!scopes)
767 case scope_count (do_filter (!generated_problems)) scope of
770 if scope_count (do_filter (these (!checked_problems)))
774 I) (!generated_scopes) 0
776 "Nitpick " ^ did_so_and_so ^
777 (if is_some (!checked_problems) andalso total > 0 then
779 string_of_int (Int.min (total - 1, unsat)) ^ " of " ^
780 string_of_int total ^ " scope" ^ plural_s total
785 (* int -> int -> scope list -> int * int * int -> Kodkod.outcome *)
786 fun run_batches _ _ [] (max_potential, max_genuine, donno) =
787 if donno > 0 andalso max_genuine > 0 then
788 (print_m (fn () => excipit "ran out of resources"); "unknown")
789 else if max_genuine = original_max_genuine then
790 if max_potential = original_max_potential then
791 (print_m (K ("Nitpick found no " ^ word_model ^ ".")); "none")
793 (print_m (K ("Nitpick could not find " ^
794 (if max_genuine = 1 then "a better " ^ word_model ^ "."
795 else "any better " ^ word_model ^ "s.")));
798 if would_be_genuine then "genuine" else "likely_genuine"
799 | run_batches j n (batch :: batches) z =
800 let val (z as (_, max_genuine, _)) = run_batch j n batch z in
801 run_batches (j + 1) n (if max_genuine > 0 then batches else []) z
804 val _ = scopes := all_scopes ext_ctxt sym_break cards_assigns maxes_assigns
805 iters_assigns bisim_depths mono_Ts nonmono_Ts
806 val batches = batch_list batch_size (!scopes)
808 (run_batches 0 (length batches) batches (max_potential, max_genuine, 0)
809 handle Exn.Interrupt => do_interrupted ())
810 handle TimeLimit.TimeOut =>
811 (print_m (fn () => excipit "ran out of time");
812 if !met_potential > 0 then "potential" else "unknown")
813 | Exn.Interrupt => if auto orelse debug then raise Interrupt
814 else error (excipit "was interrupted")
815 val _ = print_v (fn () => "Total time: " ^
816 signed_string_of_int (Time.toMilliseconds
817 (Timer.checkRealTimer timer)) ^ " ms.")
818 in (outcome_code, !state_ref) end
819 handle Exn.Interrupt =>
820 if auto orelse #debug params then
823 if passed_deadline deadline then
824 (priority "Nitpick ran out of time."; ("unknown", state))
826 error "Nitpick was interrupted."
828 (* Proof.state -> params -> bool -> term -> string * Proof.state *)
829 fun pick_nits_in_term state (params as {debug, timeout, expect, ...})
830 auto orig_assm_ts orig_t =
832 val deadline = Option.map (curry Time.+ (Time.now ())) timeout
833 val outcome as (outcome_code, _) =
834 time_limit (if debug then NONE else timeout)
835 (pick_them_nits_in_term deadline state params auto orig_assm_ts)
838 if expect = "" orelse outcome_code = expect then outcome
839 else error ("Unexpected outcome: " ^ quote outcome_code ^ ".")
842 (* Proof.state -> params -> thm -> int -> string * Proof.state *)
843 fun pick_nits_in_subgoal state params auto subgoal =
845 val ctxt = Proof.context_of state
846 val t = state |> Proof.get_goal |> snd |> snd |> prop_of
848 if Logic.count_prems t = 0 then
849 (priority "No subgoal!"; ("none", state))
852 val assms = map term_of (Assumption.all_assms_of ctxt)
853 val (t, frees) = Logic.goal_params t subgoal
854 in pick_nits_in_term state params auto assms (subst_bounds (frees, t)) end