src/HOL/Tools/Nitpick/nitpick.ML
author blanchet
Fri Aug 06 10:50:52 2010 +0200 (2010-08-06 ago)
changeset 38212 a7e92239922f
parent 38209 3d1d928dce50
child 38214 8164c91039ea
permissions -rw-r--r--
improved "merge_type_vars" option: map supersorts to subsorts, to avoid distinguishing, say, "{}", and "HOL.type"
blanchet@33982
     1
(*  Title:      HOL/Tools/Nitpick/nitpick.ML
blanchet@33192
     2
    Author:     Jasmin Blanchette, TU Muenchen
blanchet@34982
     3
    Copyright   2008, 2009, 2010
blanchet@33192
     4
blanchet@33192
     5
Finite model generation for HOL formulas using Kodkod.
blanchet@33192
     6
*)
blanchet@33192
     7
blanchet@33192
     8
signature NITPICK =
blanchet@33192
     9
sig
blanchet@33705
    10
  type styp = Nitpick_Util.styp
blanchet@35711
    11
  type term_postprocessor = Nitpick_Model.term_postprocessor
blanchet@36390
    12
  type params =
blanchet@36390
    13
    {cards_assigns: (typ option * int list) list,
blanchet@36390
    14
     maxes_assigns: (styp option * int list) list,
blanchet@36390
    15
     iters_assigns: (styp option * int list) list,
blanchet@36390
    16
     bitss: int list,
blanchet@36390
    17
     bisim_depths: int list,
blanchet@36390
    18
     boxes: (typ option * bool option) list,
blanchet@36390
    19
     finitizes: (typ option * bool option) list,
blanchet@36390
    20
     monos: (typ option * bool option) list,
blanchet@36390
    21
     stds: (typ option * bool) list,
blanchet@36390
    22
     wfs: (styp option * bool option) list,
blanchet@36390
    23
     sat_solver: string,
blanchet@36390
    24
     blocking: bool,
blanchet@36390
    25
     falsify: bool,
blanchet@36390
    26
     debug: bool,
blanchet@36390
    27
     verbose: bool,
blanchet@36390
    28
     overlord: bool,
blanchet@36390
    29
     user_axioms: bool option,
blanchet@36390
    30
     assms: bool,
blanchet@38209
    31
     whacks: term list,
blanchet@36390
    32
     merge_type_vars: bool,
blanchet@36390
    33
     binary_ints: bool option,
blanchet@36390
    34
     destroy_constrs: bool,
blanchet@36390
    35
     specialize: bool,
blanchet@36390
    36
     star_linear_preds: bool,
blanchet@36390
    37
     fast_descrs: bool,
blanchet@36390
    38
     peephole_optim: bool,
blanchet@38124
    39
     datatype_sym_break: int,
blanchet@38124
    40
     kodkod_sym_break: int,
blanchet@36390
    41
     timeout: Time.time option,
blanchet@36390
    42
     tac_timeout: Time.time option,
blanchet@36390
    43
     max_threads: int,
blanchet@36390
    44
     show_datatypes: bool,
blanchet@36390
    45
     show_consts: bool,
blanchet@36390
    46
     evals: term list,
blanchet@36390
    47
     formats: (term option * int list) list,
blanchet@37260
    48
     atomss: (typ option * string list) list,
blanchet@36390
    49
     max_potential: int,
blanchet@36390
    50
     max_genuine: int,
blanchet@36390
    51
     check_potential: bool,
blanchet@36390
    52
     check_genuine: bool,
blanchet@36390
    53
     batch_size: int,
blanchet@36390
    54
     expect: string}
blanchet@33192
    55
blanchet@33192
    56
  val register_frac_type : string -> (string * string) list -> theory -> theory
blanchet@33192
    57
  val unregister_frac_type : string -> theory -> theory
blanchet@33192
    58
  val register_codatatype : typ -> string -> styp list -> theory -> theory
blanchet@33192
    59
  val unregister_codatatype : typ -> theory -> theory
blanchet@35711
    60
  val register_term_postprocessor :
blanchet@35711
    61
    typ -> term_postprocessor -> theory -> theory
blanchet@35711
    62
  val unregister_term_postprocessor : typ -> theory -> theory
blanchet@33192
    63
  val pick_nits_in_term :
blanchet@35335
    64
    Proof.state -> params -> bool -> int -> int -> int -> (term * term) list
blanchet@35335
    65
    -> term list -> term -> string * Proof.state
blanchet@33192
    66
  val pick_nits_in_subgoal :
blanchet@34982
    67
    Proof.state -> params -> bool -> int -> int -> string * Proof.state
blanchet@33192
    68
end;
blanchet@33192
    69
blanchet@33192
    70
structure Nitpick : NITPICK =
blanchet@33192
    71
struct
blanchet@33192
    72
blanchet@33232
    73
open Nitpick_Util
blanchet@33232
    74
open Nitpick_HOL
blanchet@35070
    75
open Nitpick_Preproc
blanchet@33232
    76
open Nitpick_Mono
blanchet@33232
    77
open Nitpick_Scope
blanchet@33232
    78
open Nitpick_Peephole
blanchet@33232
    79
open Nitpick_Rep
blanchet@33232
    80
open Nitpick_Nut
blanchet@33232
    81
open Nitpick_Kodkod
blanchet@33232
    82
open Nitpick_Model
blanchet@33192
    83
blanchet@34126
    84
structure KK = Kodkod
blanchet@34126
    85
blanchet@36390
    86
type params =
blanchet@36390
    87
  {cards_assigns: (typ option * int list) list,
blanchet@36390
    88
   maxes_assigns: (styp option * int list) list,
blanchet@36390
    89
   iters_assigns: (styp option * int list) list,
blanchet@36390
    90
   bitss: int list,
blanchet@36390
    91
   bisim_depths: int list,
blanchet@36390
    92
   boxes: (typ option * bool option) list,
blanchet@36390
    93
   finitizes: (typ option * bool option) list,
blanchet@36390
    94
   monos: (typ option * bool option) list,
blanchet@36390
    95
   stds: (typ option * bool) list,
blanchet@36390
    96
   wfs: (styp option * bool option) list,
blanchet@36390
    97
   sat_solver: string,
blanchet@36390
    98
   blocking: bool,
blanchet@36390
    99
   falsify: bool,
blanchet@36390
   100
   debug: bool,
blanchet@36390
   101
   verbose: bool,
blanchet@36390
   102
   overlord: bool,
blanchet@36390
   103
   user_axioms: bool option,
blanchet@36390
   104
   assms: bool,
blanchet@38209
   105
   whacks: term list,
blanchet@36390
   106
   merge_type_vars: bool,
blanchet@36390
   107
   binary_ints: bool option,
blanchet@36390
   108
   destroy_constrs: bool,
blanchet@36390
   109
   specialize: bool,
blanchet@36390
   110
   star_linear_preds: bool,
blanchet@36390
   111
   fast_descrs: bool,
blanchet@36390
   112
   peephole_optim: bool,
blanchet@38124
   113
   datatype_sym_break: int,
blanchet@38124
   114
   kodkod_sym_break: int,
blanchet@36390
   115
   timeout: Time.time option,
blanchet@36390
   116
   tac_timeout: Time.time option,
blanchet@36390
   117
   max_threads: int,
blanchet@36390
   118
   show_datatypes: bool,
blanchet@36390
   119
   show_consts: bool,
blanchet@36390
   120
   evals: term list,
blanchet@36390
   121
   formats: (term option * int list) list,
blanchet@37260
   122
   atomss: (typ option * string list) list,
blanchet@36390
   123
   max_potential: int,
blanchet@36390
   124
   max_genuine: int,
blanchet@36390
   125
   check_potential: bool,
blanchet@36390
   126
   check_genuine: bool,
blanchet@36390
   127
   batch_size: int,
blanchet@36390
   128
   expect: string}
blanchet@33192
   129
blanchet@36390
   130
type problem_extension =
blanchet@36390
   131
  {free_names: nut list,
blanchet@36390
   132
   sel_names: nut list,
blanchet@36390
   133
   nonsel_names: nut list,
blanchet@36390
   134
   rel_table: nut NameTable.table,
blanchet@36390
   135
   unsound: bool,
blanchet@36390
   136
   scope: scope}
blanchet@36390
   137
 
blanchet@34126
   138
type rich_problem = KK.problem * problem_extension
blanchet@33192
   139
blanchet@33192
   140
fun pretties_for_formulas _ _ [] = []
blanchet@33192
   141
  | pretties_for_formulas ctxt s ts =
blanchet@33192
   142
    [Pretty.str (s ^ plural_s_for_list ts ^ ":"),
blanchet@33192
   143
     Pretty.indent indent_size (Pretty.chunks
blanchet@33192
   144
         (map2 (fn j => fn t =>
blanchet@34121
   145
                   Pretty.block [t |> shorten_names_in_term
blanchet@33192
   146
                                   |> Syntax.pretty_term ctxt,
blanchet@33192
   147
                                 Pretty.str (if j = 1 then "." else ";")])
blanchet@33192
   148
               (length ts downto 1) ts))]
blanchet@33192
   149
blanchet@35696
   150
fun install_java_message () =
blanchet@35696
   151
  "Nitpick requires a Java 1.5 virtual machine called \"java\"."
blanchet@33568
   152
fun install_kodkodi_message () =
blanchet@33568
   153
  "Nitpick requires the external Java program Kodkodi. To install it, download \
blanchet@33568
   154
  \the package from Isabelle's web page and add the \"kodkodi-x.y.z\" \
blanchet@33568
   155
  \directory's full path to \"" ^
blanchet@33568
   156
  Path.implode (Path.expand (Path.appends
blanchet@33568
   157
      (Path.variable "ISABELLE_HOME_USER" ::
blanchet@36266
   158
       map Path.basic ["etc", "components"]))) ^ "\" on a line of its own."
blanchet@33568
   159
blanchet@35185
   160
val max_unsound_delay_ms = 200
blanchet@35185
   161
val max_unsound_delay_percent = 2
blanchet@33192
   162
blanchet@35185
   163
fun unsound_delay_for_timeout NONE = max_unsound_delay_ms
blanchet@35185
   164
  | unsound_delay_for_timeout (SOME timeout) =
blanchet@35185
   165
    Int.max (0, Int.min (max_unsound_delay_ms,
blanchet@33192
   166
                         Time.toMilliseconds timeout
blanchet@35185
   167
                         * max_unsound_delay_percent div 100))
blanchet@33192
   168
blanchet@33192
   169
fun passed_deadline NONE = false
blanchet@33192
   170
  | passed_deadline (SOME time) = Time.compare (Time.now (), time) <> LESS
blanchet@33192
   171
blanchet@34123
   172
fun none_true assigns = forall (not_equal (SOME true) o snd) assigns
blanchet@33192
   173
blanchet@34038
   174
val syntactic_sorts =
blanchet@34038
   175
  @{sort "{default,zero,one,plus,minus,uminus,times,inverse,abs,sgn,ord,eq}"} @
blanchet@34038
   176
  @{sort number}
blanchet@34038
   177
fun has_tfree_syntactic_sort (TFree (_, S as _ :: _)) =
blanchet@34038
   178
    subset (op =) (S, syntactic_sorts)
blanchet@34038
   179
  | has_tfree_syntactic_sort _ = false
blanchet@34038
   180
val has_syntactic_sorts = exists_type (exists_subtype has_tfree_syntactic_sort)
blanchet@33192
   181
blanchet@33568
   182
fun plazy f = Pretty.blk (0, pstrs (f ()))
blanchet@33568
   183
blanchet@34982
   184
fun pick_them_nits_in_term deadline state (params : params) auto i n step
blanchet@38169
   185
                           subst assm_ts orig_t =
blanchet@33192
   186
  let
blanchet@33192
   187
    val timer = Timer.startRealTimer ()
blanchet@34935
   188
    val thy = Proof.theory_of state
blanchet@34935
   189
    val ctxt = Proof.context_of state
blanchet@35386
   190
(* FIXME: reintroduce code before new release:
blanchet@35386
   191
wenzelm@37216
   192
    val nitpick_thy = Thy_Info.get_theory "Nitpick"
blanchet@34936
   193
    val _ = Theory.subthy (nitpick_thy, thy) orelse
blanchet@34936
   194
            error "You must import the theory \"Nitpick\" to use Nitpick"
blanchet@34982
   195
*)
blanchet@34124
   196
    val {cards_assigns, maxes_assigns, iters_assigns, bitss, bisim_depths,
blanchet@35665
   197
         boxes, finitizes, monos, stds, wfs, sat_solver, falsify, debug,
blanchet@38209
   198
         verbose, overlord, user_axioms, assms, whacks, merge_type_vars,
blanchet@38209
   199
         binary_ints, destroy_constrs, specialize, star_linear_preds,
blanchet@38209
   200
         fast_descrs, peephole_optim, datatype_sym_break, kodkod_sym_break,
blanchet@38209
   201
         tac_timeout, max_threads, show_datatypes, show_consts, evals, formats,
blanchet@38209
   202
         atomss, max_potential, max_genuine, check_potential, check_genuine,
blanchet@38209
   203
         batch_size, ...} = params
blanchet@33192
   204
    val state_ref = Unsynchronized.ref state
blanchet@33192
   205
    val pprint =
blanchet@33192
   206
      if auto then
blanchet@33192
   207
        Unsynchronized.change state_ref o Proof.goal_message o K
blanchet@33561
   208
        o Pretty.chunks o cons (Pretty.str "") o single
blanchet@33192
   209
        o Pretty.mark Markup.hilite
blanchet@33192
   210
      else
blanchet@36128
   211
        (fn s => (priority s; if debug then tracing s else ()))
blanchet@36128
   212
        o Pretty.string_of
blanchet@33192
   213
    fun pprint_m f = () |> not auto ? pprint o f
blanchet@33192
   214
    fun pprint_v f = () |> verbose ? pprint o f
blanchet@33192
   215
    fun pprint_d f = () |> debug ? pprint o f
blanchet@33192
   216
    val print = pprint o curry Pretty.blk 0 o pstrs
blanchet@36128
   217
    val print_g = pprint o Pretty.str
blanchet@33568
   218
    val print_m = pprint_m o K o plazy
blanchet@33568
   219
    val print_v = pprint_v o K o plazy
blanchet@33192
   220
blanchet@33192
   221
    fun check_deadline () =
blanchet@33192
   222
      if debug andalso passed_deadline deadline then raise TimeLimit.TimeOut
blanchet@33192
   223
      else ()
blanchet@33192
   224
    fun do_interrupted () =
blanchet@33192
   225
      if passed_deadline deadline then raise TimeLimit.TimeOut
blanchet@33192
   226
      else raise Interrupt
blanchet@33192
   227
blanchet@38169
   228
    val assm_ts = if assms orelse auto then assm_ts else []
blanchet@34982
   229
    val _ =
blanchet@34982
   230
      if step = 0 then
blanchet@34982
   231
        print_m (fn () => "Nitpicking formula...")
blanchet@34982
   232
      else
blanchet@34982
   233
        pprint_m (fn () => Pretty.chunks (
blanchet@34982
   234
            pretties_for_formulas ctxt ("Nitpicking " ^
blanchet@34982
   235
                (if i <> 1 orelse n <> 1 then
blanchet@34982
   236
                   "subgoal " ^ string_of_int i ^ " of " ^ string_of_int n
blanchet@34982
   237
                 else
blanchet@38169
   238
                   "goal")) [Logic.list_implies (assm_ts, orig_t)]))
blanchet@33192
   239
    val neg_t = if falsify then Logic.mk_implies (orig_t, @{prop False})
blanchet@33192
   240
                else orig_t
blanchet@38169
   241
    val tfree_table =
blanchet@38169
   242
      if merge_type_vars then
blanchet@38212
   243
        merged_type_var_table_for_terms thy (neg_t :: assm_ts @ evals)
blanchet@38169
   244
      else
blanchet@38169
   245
        []
blanchet@38212
   246
    val neg_t = merge_type_vars_in_term thy merge_type_vars tfree_table neg_t
blanchet@38212
   247
    val assm_ts = map (merge_type_vars_in_term thy merge_type_vars tfree_table)
blanchet@38169
   248
                      assm_ts
blanchet@38212
   249
    val evals = map (merge_type_vars_in_term thy merge_type_vars tfree_table)
blanchet@38212
   250
                    evals
blanchet@33192
   251
    val original_max_potential = max_potential
blanchet@33192
   252
    val original_max_genuine = max_genuine
blanchet@33192
   253
    val max_bisim_depth = fold Integer.max bisim_depths ~1
blanchet@35220
   254
    val case_names = case_const_names thy stds
blanchet@37256
   255
    val (defs, built_in_nondefs, user_nondefs) = all_axioms_of ctxt subst
blanchet@35335
   256
    val def_table = const_def_table ctxt subst defs
blanchet@33192
   257
    val nondef_table = const_nondef_table (built_in_nondefs @ user_nondefs)
blanchet@35335
   258
    val simp_table = Unsynchronized.ref (const_simp_table ctxt subst)
blanchet@35335
   259
    val psimp_table = const_psimp_table ctxt subst
blanchet@35807
   260
    val choice_spec_table = const_choice_spec_table ctxt subst
blanchet@35807
   261
    val user_nondefs =
blanchet@35807
   262
      user_nondefs |> filter_out (is_choice_spec_axiom thy choice_spec_table)
blanchet@35335
   263
    val intro_table = inductive_intro_table ctxt subst def_table
blanchet@33192
   264
    val ground_thm_table = ground_theorem_table thy
blanchet@33192
   265
    val ersatz_table = ersatz_table thy
blanchet@35070
   266
    val (hol_ctxt as {wf_cache, ...}) =
blanchet@33192
   267
      {thy = thy, ctxt = ctxt, max_bisim_depth = max_bisim_depth, boxes = boxes,
blanchet@34982
   268
       stds = stds, wfs = wfs, user_axioms = user_axioms, debug = debug,
blanchet@38209
   269
       whacks = whacks, binary_ints = binary_ints,
blanchet@38209
   270
       destroy_constrs = destroy_constrs, specialize = specialize,
blanchet@38209
   271
       star_linear_preds = star_linear_preds, fast_descrs = fast_descrs,
blanchet@38209
   272
       tac_timeout = tac_timeout, evals = evals, case_names = case_names,
blanchet@38209
   273
       def_table = def_table, nondef_table = nondef_table,
blanchet@38209
   274
       user_nondefs = user_nondefs, simp_table = simp_table,
blanchet@38209
   275
       psimp_table = psimp_table, choice_spec_table = choice_spec_table,
blanchet@38209
   276
       intro_table = intro_table, ground_thm_table = ground_thm_table,
blanchet@38209
   277
       ersatz_table = ersatz_table, skolems = Unsynchronized.ref [],
blanchet@38209
   278
       special_funs = Unsynchronized.ref [],
blanchet@33580
   279
       unrolled_preds = Unsynchronized.ref [], wf_cache = Unsynchronized.ref [],
blanchet@33580
   280
       constr_cache = Unsynchronized.ref []}
blanchet@38170
   281
    val pseudo_frees = fold Term.add_frees assm_ts []
blanchet@38170
   282
    val real_frees = subtract (op =) pseudo_frees (Term.add_frees neg_t [])
blanchet@38169
   283
    val _ = null (fold Term.add_tvars (neg_t :: assm_ts) []) orelse
blanchet@34936
   284
            raise NOT_SUPPORTED "schematic type variables"
blanchet@35386
   285
    val (nondef_ts, def_ts, got_all_mono_user_axioms, no_poly_user_axioms,
blanchet@38169
   286
         binarize) = preprocess_formulas hol_ctxt finitizes monos assm_ts neg_t
blanchet@33192
   287
    val got_all_user_axioms =
blanchet@33192
   288
      got_all_mono_user_axioms andalso no_poly_user_axioms
blanchet@33192
   289
blanchet@33192
   290
    fun print_wf (x, (gfp, wf)) =
blanchet@33192
   291
      pprint (Pretty.blk (0,
blanchet@33192
   292
          pstrs ("The " ^ (if gfp then "co" else "") ^ "inductive predicate \"")
blanchet@33192
   293
          @ Syntax.pretty_term ctxt (Const x) ::
blanchet@33192
   294
          pstrs (if wf then
blanchet@33192
   295
                   "\" was proved well-founded. Nitpick can compute it \
blanchet@33192
   296
                   \efficiently."
blanchet@33192
   297
                 else
blanchet@33192
   298
                   "\" could not be proved well-founded. Nitpick might need to \
blanchet@33192
   299
                   \unroll it.")))
blanchet@33192
   300
    val _ = if verbose then List.app print_wf (!wf_cache) else ()
blanchet@38171
   301
    val das_wort_formula = if falsify then "Negated conjecture" else "Formula"
blanchet@33192
   302
    val _ =
blanchet@35386
   303
      pprint_d (fn () => Pretty.chunks
blanchet@38171
   304
          (pretties_for_formulas ctxt das_wort_formula [hd nondef_ts] @
blanchet@35386
   305
           pretties_for_formulas ctxt "Relevant definitional axiom" def_ts @
blanchet@35386
   306
           pretties_for_formulas ctxt "Relevant nondefinitional axiom"
blanchet@35386
   307
                                 (tl nondef_ts)))
blanchet@35386
   308
    val _ = List.app (ignore o Term.type_of) (nondef_ts @ def_ts)
blanchet@33192
   309
            handle TYPE (_, Ts, ts) =>
blanchet@33192
   310
                   raise TYPE ("Nitpick.pick_them_nits_in_term", Ts, ts)
blanchet@33192
   311
blanchet@35386
   312
    val nondef_us = map (nut_from_term hol_ctxt Eq) nondef_ts
blanchet@35070
   313
    val def_us = map (nut_from_term hol_ctxt DefEq) def_ts
blanchet@33558
   314
    val (free_names, const_names) =
blanchet@35386
   315
      fold add_free_and_const_names (nondef_us @ def_us) ([], [])
blanchet@33558
   316
    val (sel_names, nonsel_names) =
blanchet@33558
   317
      List.partition (is_sel o nickname_of) const_names
blanchet@35665
   318
    val sound_finitizes =
blanchet@35665
   319
      none_true (filter_out (fn (SOME (Type (@{type_name fun}, _)), _) => true
blanchet@35665
   320
                          | _ => false) finitizes)
blanchet@34982
   321
    val standard = forall snd stds
blanchet@33558
   322
(*
blanchet@36128
   323
    val _ = List.app (print_g o string_for_nut ctxt) (nondef_us @ def_us)
blanchet@33558
   324
*)
blanchet@33558
   325
blanchet@34121
   326
    val unique_scope = forall (curry (op =) 1 o length o snd) cards_assigns
blanchet@35385
   327
    fun monotonicity_message Ts extra =
blanchet@38188
   328
      let val pretties = map (pretty_maybe_quote o pretty_for_type ctxt) Ts in
blanchet@38188
   329
        Pretty.blk (0,
blanchet@38188
   330
          pstrs ("The type" ^ plural_s_for_list pretties ^ " ") @
blanchet@38188
   331
          pretty_serial_commas "and" pretties @
blanchet@38188
   332
          pstrs (" " ^
blanchet@38188
   333
          (if none_true monos then
blanchet@38188
   334
             "passed the monotonicity test"
blanchet@38188
   335
           else
blanchet@38188
   336
             (if length pretties = 1 then "is" else "are") ^ " considered monotonic") ^
blanchet@38188
   337
          ". " ^ extra))
blanchet@35385
   338
      end
blanchet@35665
   339
    fun is_type_fundamentally_monotonic T =
blanchet@37256
   340
      (is_datatype ctxt stds T andalso not (is_quot_type thy T) andalso
blanchet@37256
   341
       (not (is_pure_typedef ctxt T) orelse is_univ_typedef ctxt T)) orelse
blanchet@35075
   342
      is_number_type thy T orelse is_bit_type T
blanchet@35385
   343
    fun is_type_actually_monotonic T =
blanchet@35386
   344
      formulas_monotonic hol_ctxt binarize T (nondef_ts, def_ts)
blanchet@35665
   345
    fun is_type_kind_of_monotonic T =
blanchet@35665
   346
      case triple_lookup (type_match thy) monos T of
blanchet@35665
   347
        SOME (SOME false) => false
blanchet@35665
   348
      | _ => is_type_actually_monotonic T
blanchet@34936
   349
    fun is_type_monotonic T =
blanchet@33192
   350
      unique_scope orelse
blanchet@33192
   351
      case triple_lookup (type_match thy) monos T of
blanchet@33192
   352
        SOME (SOME b) => b
blanchet@35665
   353
      | _ => is_type_fundamentally_monotonic T orelse
blanchet@35665
   354
             is_type_actually_monotonic T
blanchet@35665
   355
    fun is_shallow_datatype_finitizable (T as Type (@{type_name fin_fun}, _)) =
blanchet@35665
   356
        is_type_kind_of_monotonic T
blanchet@35665
   357
      | is_shallow_datatype_finitizable (T as Type (@{type_name fun_box}, _)) =
blanchet@35665
   358
        is_type_kind_of_monotonic T
blanchet@35665
   359
      | is_shallow_datatype_finitizable T =
blanchet@35665
   360
        case triple_lookup (type_match thy) finitizes T of
blanchet@35665
   361
          SOME (SOME b) => b
blanchet@35665
   362
        | _ => is_type_kind_of_monotonic T
blanchet@35385
   363
    fun is_datatype_deep T =
blanchet@35385
   364
      not standard orelse T = nat_T orelse is_word_type T orelse
blanchet@35385
   365
      exists (curry (op =) T o domain_type o type_of) sel_names
blanchet@35386
   366
    val all_Ts = ground_types_in_terms hol_ctxt binarize (nondef_ts @ def_ts)
wenzelm@35408
   367
                 |> sort Term_Ord.typ_ord
blanchet@34936
   368
    val _ = if verbose andalso binary_ints = SOME true andalso
blanchet@34982
   369
               exists (member (op =) [nat_T, int_T]) all_Ts then
blanchet@34124
   370
              print_v (K "The option \"binary_ints\" will be ignored because \
blanchet@34126
   371
                         \of the presence of rationals, reals, \"Suc\", \
blanchet@35386
   372
                         \\"gcd\", or \"lcm\" in the problem or because of the \
blanchet@35386
   373
                         \\"non_std\" option.")
blanchet@34124
   374
            else
blanchet@34124
   375
              ()
blanchet@34982
   376
    val (mono_Ts, nonmono_Ts) = List.partition is_type_monotonic all_Ts
blanchet@33192
   377
    val _ =
blanchet@34936
   378
      if verbose andalso not unique_scope then
blanchet@35665
   379
        case filter_out is_type_fundamentally_monotonic mono_Ts of
blanchet@34936
   380
          [] => ()
blanchet@34936
   381
        | interesting_mono_Ts =>
blanchet@38188
   382
          pprint_v (K (monotonicity_message interesting_mono_Ts
blanchet@38188
   383
                          "Nitpick might be able to skip some scopes."))
blanchet@33192
   384
      else
blanchet@33192
   385
        ()
blanchet@35385
   386
    val (deep_dataTs, shallow_dataTs) =
blanchet@37256
   387
      all_Ts |> filter (is_datatype ctxt stds)
blanchet@37256
   388
             |> List.partition is_datatype_deep
blanchet@35385
   389
    val finitizable_dataTs =
blanchet@35385
   390
      shallow_dataTs |> filter_out (is_finite_type hol_ctxt)
blanchet@35665
   391
                     |> filter is_shallow_datatype_finitizable
blanchet@35385
   392
    val _ =
blanchet@35385
   393
      if verbose andalso not (null finitizable_dataTs) then
blanchet@38188
   394
        pprint_v (K (monotonicity_message finitizable_dataTs
blanchet@38188
   395
                         "Nitpick can use a more precise finite encoding."))
blanchet@35385
   396
      else
blanchet@35385
   397
        ()
blanchet@35183
   398
    (* This detection code is an ugly hack. Fortunately, it is used only to
blanchet@35183
   399
       provide a hint to the user. *)
blanchet@35183
   400
    fun is_struct_induct_step (name, (Rule_Cases.Case {fixes, assumes, ...}, _)) =
blanchet@35183
   401
      not (null fixes) andalso
blanchet@35183
   402
      exists (String.isSuffix ".hyps" o fst) assumes andalso
blanchet@35183
   403
      exists (exists (curry (op =) name o shortest_name o fst)
blanchet@35183
   404
              o datatype_constrs hol_ctxt) deep_dataTs
blanchet@35183
   405
    val likely_in_struct_induct_step =
blanchet@35183
   406
      exists is_struct_induct_step (ProofContext.cases_of ctxt)
blanchet@35183
   407
    val _ = if standard andalso likely_in_struct_induct_step then
blanchet@34982
   408
              pprint_m (fn () => Pretty.blk (0,
blanchet@34982
   409
                  pstrs "Hint: To check that the induction hypothesis is \
blanchet@35177
   410
                        \general enough, try this command: " @
blanchet@34982
   411
                  [Pretty.mark Markup.sendback (Pretty.blk (0,
blanchet@35183
   412
                       pstrs ("nitpick [non_std, show_all]")))] @ pstrs "."))
blanchet@34982
   413
            else
blanchet@34982
   414
              ()
blanchet@33192
   415
(*
blanchet@36128
   416
    val _ = print_g "Monotonic types:"
blanchet@36128
   417
    val _ = List.app (print_g o string_for_type ctxt) mono_Ts
blanchet@36128
   418
    val _ = print_g "Nonmonotonic types:"
blanchet@36128
   419
    val _ = List.app (print_g o string_for_type ctxt) nonmono_Ts
blanchet@33192
   420
*)
blanchet@33192
   421
blanchet@36384
   422
    val incremental = Int.max (max_potential, max_genuine) >= 2
blanchet@36384
   423
    val actual_sat_solver =
blanchet@33192
   424
      if sat_solver <> "smart" then
blanchet@36384
   425
        if incremental andalso
blanchet@34936
   426
           not (member (op =) (Kodkod_SAT.configured_sat_solvers true)
blanchet@35333
   427
                       sat_solver) then
blanchet@33192
   428
          (print_m (K ("An incremental SAT solver is required: \"SAT4J\" will \
blanchet@33192
   429
                       \be used instead of " ^ quote sat_solver ^ "."));
blanchet@33192
   430
           "SAT4J")
blanchet@33192
   431
        else
blanchet@33192
   432
          sat_solver
blanchet@33192
   433
      else
blanchet@36384
   434
        Kodkod_SAT.smart_sat_solver_name incremental
blanchet@33192
   435
    val _ =
blanchet@33192
   436
      if sat_solver = "smart" then
blanchet@36384
   437
        print_v (fn () =>
blanchet@36384
   438
            "Using SAT solver " ^ quote actual_sat_solver ^ ". The following" ^
blanchet@36384
   439
            (if incremental then " incremental " else " ") ^
blanchet@36384
   440
            "solvers are configured: " ^
blanchet@36384
   441
            commas_quote (Kodkod_SAT.configured_sat_solvers incremental) ^ ".")
blanchet@33192
   442
      else
blanchet@33192
   443
        ()
blanchet@33192
   444
blanchet@33192
   445
    val too_big_scopes = Unsynchronized.ref []
blanchet@33192
   446
blanchet@35185
   447
    fun problem_for_scope unsound
blanchet@34124
   448
            (scope as {card_assigns, bits, bisim_depth, datatypes, ofs, ...}) =
blanchet@33192
   449
      let
blanchet@33192
   450
        val _ = not (exists (fn other => scope_less_eq other scope)
blanchet@34936
   451
                            (!too_big_scopes)) orelse
blanchet@34936
   452
                raise TOO_LARGE ("Nitpick.pick_them_nits_in_term.\
blanchet@34936
   453
                                 \problem_for_scope", "too large scope")
blanchet@33192
   454
(*
blanchet@36128
   455
        val _ = print_g "Offsets:"
blanchet@33192
   456
        val _ = List.app (fn (T, j0) =>
blanchet@36128
   457
                             print_g (string_for_type ctxt T ^ " = " ^
blanchet@36128
   458
                                    string_of_int j0))
blanchet@33192
   459
                         (Typtab.dest ofs)
blanchet@33192
   460
*)
blanchet@35385
   461
        val all_exact = forall (is_exact_type datatypes true) all_Ts
blanchet@33192
   462
        val main_j0 = offset_of_type ofs bool_T
blanchet@33192
   463
        val (nat_card, nat_j0) = spec_of_type scope nat_T
blanchet@33192
   464
        val (int_card, int_j0) = spec_of_type scope int_T
blanchet@34936
   465
        val _ = (nat_j0 = main_j0 andalso int_j0 = main_j0) orelse
blanchet@34936
   466
                raise BAD ("Nitpick.pick_them_nits_in_term.problem_for_scope",
blanchet@34936
   467
                           "bad offsets")
blanchet@33192
   468
        val kk = kodkod_constrs peephole_optim nat_card int_card main_j0
blanchet@33192
   469
        val (free_names, rep_table) =
blanchet@38170
   470
          choose_reps_for_free_vars scope pseudo_frees free_names
blanchet@38170
   471
                                    NameTable.empty
blanchet@33192
   472
        val (sel_names, rep_table) = choose_reps_for_all_sels scope rep_table
blanchet@38170
   473
        val (nonsel_names, rep_table) =
blanchet@38170
   474
          choose_reps_for_consts scope all_exact nonsel_names rep_table
blanchet@38182
   475
        val (guiltiest_party, min_highest_arity) =
blanchet@38182
   476
          NameTable.fold (fn (name, R) => fn (s, n) =>
blanchet@38182
   477
                             let val n' = arity_of_rep R in
blanchet@38182
   478
                               if n' > n then (nickname_of name, n') else (s, n)
blanchet@38182
   479
                             end) rep_table ("", 1)
blanchet@33192
   480
        val min_univ_card =
blanchet@36384
   481
          NameTable.fold (Integer.max o min_univ_card_of_rep o snd) rep_table
blanchet@34126
   482
                         (univ_card nat_card int_card main_j0 [] KK.True)
blanchet@38182
   483
        val _ = check_arity guiltiest_party min_univ_card min_highest_arity
blanchet@33192
   484
blanchet@35185
   485
        val def_us = map (choose_reps_in_nut scope unsound rep_table true)
blanchet@33192
   486
                         def_us
blanchet@35185
   487
        val nondef_us = map (choose_reps_in_nut scope unsound rep_table false)
blanchet@33192
   488
                            nondef_us
blanchet@33745
   489
(*
blanchet@36128
   490
        val _ = List.app (print_g o string_for_nut ctxt)
blanchet@33192
   491
                         (free_names @ sel_names @ nonsel_names @
blanchet@35386
   492
                          nondef_us @ def_us)
blanchet@33745
   493
*)
blanchet@33192
   494
        val (free_rels, pool, rel_table) =
blanchet@33192
   495
          rename_free_vars free_names initial_pool NameTable.empty
blanchet@33192
   496
        val (sel_rels, pool, rel_table) =
blanchet@33192
   497
          rename_free_vars sel_names pool rel_table
blanchet@33192
   498
        val (other_rels, pool, rel_table) =
blanchet@33192
   499
          rename_free_vars nonsel_names pool rel_table
blanchet@35386
   500
        val nondef_us = map (rename_vars_in_nut pool rel_table) nondef_us
blanchet@33192
   501
        val def_us = map (rename_vars_in_nut pool rel_table) def_us
blanchet@35386
   502
        val nondef_fs = map (kodkod_formula_from_nut ofs kk) nondef_us
blanchet@35280
   503
        val def_fs = map (kodkod_formula_from_nut ofs kk) def_us
blanchet@35386
   504
        val formula = fold (fold s_and) [def_fs, nondef_fs] KK.True
blanchet@35185
   505
        val comment = (if unsound then "unsound" else "sound") ^ "\n" ^
wenzelm@37146
   506
                      Print_Mode.setmp [] multiline_string_for_scope scope
blanchet@34998
   507
        val kodkod_sat_solver =
blanchet@36384
   508
          Kodkod_SAT.sat_solver_spec actual_sat_solver |> snd
blanchet@34124
   509
        val bit_width = if bits = 0 then 16 else bits + 1
blanchet@36384
   510
        val delay =
blanchet@36384
   511
          if unsound then
blanchet@36384
   512
            Option.map (fn time => Time.- (time, Time.now ())) deadline
blanchet@36384
   513
            |> unsound_delay_for_timeout
blanchet@36384
   514
          else
blanchet@36384
   515
            0
blanchet@36384
   516
        val settings = [("solver", commas_quote kodkod_sat_solver),
blanchet@34124
   517
                        ("bit_width", string_of_int bit_width),
blanchet@38124
   518
                        ("symmetry_breaking", string_of_int kodkod_sym_break),
blanchet@36386
   519
                        ("sharing", "3"),
blanchet@36386
   520
                        ("flatten", "false"),
blanchet@33192
   521
                        ("delay", signed_string_of_int delay)]
blanchet@33192
   522
        val plain_rels = free_rels @ other_rels
blanchet@33192
   523
        val plain_bounds = map (bound_for_plain_rel ctxt debug) plain_rels
blanchet@33192
   524
        val plain_axioms = map (declarative_axiom_for_plain_rel kk) plain_rels
blanchet@33192
   525
        val sel_bounds = map (bound_for_sel_rel ctxt debug datatypes) sel_rels
blanchet@35190
   526
        val dtype_axioms =
blanchet@38126
   527
          declarative_axioms_for_datatypes hol_ctxt binarize datatype_sym_break
blanchet@38126
   528
                                           bits ofs kk rel_table datatypes
blanchet@33192
   529
        val declarative_axioms = plain_axioms @ dtype_axioms
blanchet@35220
   530
        val univ_card = Int.max (univ_card nat_card int_card main_j0
blanchet@35220
   531
                                     (plain_bounds @ sel_bounds) formula,
blanchet@35220
   532
                                 main_j0 |> bits > 0 ? Integer.add (bits + 1))
blanchet@38126
   533
        val (built_in_bounds, built_in_axioms) =
blanchet@38126
   534
          bounds_and_axioms_for_built_in_rels_in_formulas debug ofs
blanchet@38126
   535
              univ_card nat_card int_card main_j0
blanchet@38126
   536
              (formula :: declarative_axioms)
blanchet@33192
   537
        val bounds = built_in_bounds @ plain_bounds @ sel_bounds
blanchet@33192
   538
                     |> not debug ? merge_bounds
blanchet@38126
   539
        val axioms = built_in_axioms @ declarative_axioms
blanchet@33192
   540
        val highest_arity =
blanchet@33192
   541
          fold Integer.max (map (fst o fst) (maps fst bounds)) 0
blanchet@38126
   542
        val formula = fold_rev s_and axioms formula
blanchet@34124
   543
        val _ = if bits = 0 then () else check_bits bits formula
blanchet@34126
   544
        val _ = if formula = KK.False then ()
blanchet@38182
   545
                else check_arity "" univ_card highest_arity
blanchet@33192
   546
      in
blanchet@33192
   547
        SOME ({comment = comment, settings = settings, univ_card = univ_card,
blanchet@33192
   548
               tuple_assigns = [], bounds = bounds,
blanchet@35280
   549
               int_bounds = if bits = 0 then sequential_int_bounds univ_card
blanchet@35280
   550
                            else pow_of_two_int_bounds bits main_j0,
blanchet@33192
   551
               expr_assigns = [], formula = formula},
blanchet@33192
   552
              {free_names = free_names, sel_names = sel_names,
blanchet@33192
   553
               nonsel_names = nonsel_names, rel_table = rel_table,
blanchet@35386
   554
               unsound = unsound, scope = scope})
blanchet@33192
   555
      end
blanchet@34124
   556
      handle TOO_LARGE (loc, msg) =>
blanchet@34936
   557
             if loc = "Nitpick_Kodkod.check_arity" andalso
blanchet@34936
   558
                not (Typtab.is_empty ofs) then
blanchet@35185
   559
               problem_for_scope unsound
blanchet@35190
   560
                   {hol_ctxt = hol_ctxt, binarize = binarize,
blanchet@35190
   561
                    card_assigns = card_assigns, bits = bits,
blanchet@35190
   562
                    bisim_depth = bisim_depth, datatypes = datatypes,
blanchet@35190
   563
                    ofs = Typtab.empty}
blanchet@33192
   564
             else if loc = "Nitpick.pick_them_nits_in_term.\
blanchet@33192
   565
                           \problem_for_scope" then
blanchet@33192
   566
               NONE
blanchet@33192
   567
             else
blanchet@33192
   568
               (Unsynchronized.change too_big_scopes (cons scope);
blanchet@33192
   569
                print_v (fn () => ("Limit reached: " ^ msg ^
blanchet@35185
   570
                                   ". Skipping " ^ (if unsound then "potential"
blanchet@33192
   571
                                                    else "genuine") ^
blanchet@33192
   572
                                   " component of scope."));
blanchet@33192
   573
                NONE)
blanchet@35280
   574
           | TOO_SMALL (_, msg) =>
blanchet@34124
   575
             (print_v (fn () => ("Limit reached: " ^ msg ^
blanchet@35185
   576
                                 ". Skipping " ^ (if unsound then "potential"
blanchet@34124
   577
                                                  else "genuine") ^
blanchet@34124
   578
                                 " component of scope."));
blanchet@34124
   579
              NONE)
blanchet@33192
   580
blanchet@34982
   581
    val das_wort_model =
blanchet@34982
   582
      (if falsify then "counterexample" else "model")
blanchet@34982
   583
      |> not standard ? prefix "nonstandard "
blanchet@33192
   584
blanchet@33192
   585
    val scopes = Unsynchronized.ref []
blanchet@33192
   586
    val generated_scopes = Unsynchronized.ref []
blanchet@35185
   587
    val generated_problems = Unsynchronized.ref ([] : rich_problem list)
blanchet@33192
   588
    val checked_problems = Unsynchronized.ref (SOME [])
blanchet@33192
   589
    val met_potential = Unsynchronized.ref 0
blanchet@33192
   590
blanchet@33192
   591
    fun update_checked_problems problems =
blanchet@33192
   592
      List.app (Unsynchronized.change checked_problems o Option.map o cons
blanchet@33192
   593
                o nth problems)
blanchet@35333
   594
    fun show_kodkod_warning "" = ()
blanchet@35334
   595
      | show_kodkod_warning s = print_m (fn () => "Kodkod warning: " ^ s ^ ".")
blanchet@33192
   596
blanchet@33192
   597
    fun print_and_check_model genuine bounds
blanchet@33192
   598
            ({free_names, sel_names, nonsel_names, rel_table, scope, ...}
blanchet@33192
   599
             : problem_extension) =
blanchet@33192
   600
      let
blanchet@33192
   601
        val (reconstructed_model, codatatypes_ok) =
blanchet@36390
   602
          reconstruct_hol_model {show_datatypes = show_datatypes,
blanchet@33192
   603
                                 show_consts = show_consts}
blanchet@38170
   604
              scope formats atomss real_frees pseudo_frees free_names sel_names
blanchet@38170
   605
              nonsel_names rel_table bounds
blanchet@35671
   606
        val genuine_means_genuine =
blanchet@35671
   607
          got_all_user_axioms andalso none_true wfs andalso
blanchet@35671
   608
          sound_finitizes andalso codatatypes_ok
blanchet@38169
   609
        fun assms_prop () = Logic.mk_conjunction_list (neg_t :: assm_ts)
blanchet@33192
   610
      in
blanchet@35671
   611
        (pprint (Pretty.chunks
blanchet@35671
   612
             [Pretty.blk (0,
blanchet@35671
   613
                  (pstrs ("Nitpick found a" ^
blanchet@35671
   614
                          (if not genuine then " potential "
blanchet@35671
   615
                           else if genuine_means_genuine then " "
blanchet@35671
   616
                           else " quasi genuine ") ^ das_wort_model) @
blanchet@35671
   617
                   (case pretties_for_scope scope verbose of
blanchet@35671
   618
                      [] => []
blanchet@35671
   619
                    | pretties => pstrs " for " @ pretties) @
blanchet@35671
   620
                   [Pretty.str ":\n"])),
blanchet@35671
   621
              Pretty.indent indent_size reconstructed_model]);
blanchet@35671
   622
         if genuine then
blanchet@35671
   623
           (if check_genuine andalso standard then
blanchet@35671
   624
              case prove_hol_model scope tac_timeout free_names sel_names
blanchet@38169
   625
                                   rel_table bounds (assms_prop ()) of
blanchet@35671
   626
                SOME true =>
blanchet@35671
   627
                print ("Confirmation by \"auto\": The above " ^
blanchet@35671
   628
                       das_wort_model ^ " is really genuine.")
blanchet@33192
   629
              | SOME false =>
blanchet@34982
   630
                if genuine_means_genuine then
blanchet@34982
   631
                  error ("A supposedly genuine " ^ das_wort_model ^ " was \
blanchet@34982
   632
                         \shown to be spurious by \"auto\".\nThis should never \
blanchet@34982
   633
                         \happen.\nPlease send a bug report to blanchet\
blanchet@33192
   634
                         \te@in.tum.de.")
blanchet@35671
   635
                 else
blanchet@35671
   636
                   print ("Refutation by \"auto\": The above " ^
blanchet@35671
   637
                          das_wort_model ^ " is spurious.")
blanchet@35671
   638
               | NONE => print "No confirmation by \"auto\"."
blanchet@35671
   639
            else
blanchet@35671
   640
              ();
blanchet@35671
   641
            if not standard andalso likely_in_struct_induct_step then
blanchet@35671
   642
              print "The existence of a nonstandard model suggests that the \
blanchet@36126
   643
                    \induction hypothesis is not general enough or may even be \
blanchet@36126
   644
                    \wrong. See the Nitpick manual's \"Inductive Properties\" \
blanchet@36126
   645
                    \section for details (\"isabelle doc nitpick\")."
blanchet@35671
   646
            else
blanchet@35671
   647
              ();
blanchet@35671
   648
            if has_syntactic_sorts orig_t then
blanchet@35671
   649
              print "Hint: Maybe you forgot a type constraint?"
blanchet@35671
   650
            else
blanchet@35671
   651
              ();
blanchet@35671
   652
            if not genuine_means_genuine then
blanchet@35671
   653
              if no_poly_user_axioms then
blanchet@35671
   654
                let
blanchet@35671
   655
                  val options =
blanchet@35671
   656
                    [] |> not got_all_mono_user_axioms
blanchet@35671
   657
                          ? cons ("user_axioms", "\"true\"")
blanchet@35671
   658
                       |> not (none_true wfs)
blanchet@35671
   659
                          ? cons ("wf", "\"smart\" or \"false\"")
blanchet@35671
   660
                       |> not sound_finitizes
blanchet@35671
   661
                          ? cons ("finitize", "\"smart\" or \"false\"")
blanchet@35671
   662
                       |> not codatatypes_ok
blanchet@35671
   663
                          ? cons ("bisim_depth", "a nonnegative value")
blanchet@35671
   664
                  val ss =
blanchet@35671
   665
                    map (fn (name, value) => quote name ^ " set to " ^ value)
blanchet@35671
   666
                        options
blanchet@35671
   667
                in
blanchet@35671
   668
                  print ("Try again with " ^
blanchet@38188
   669
                         implode (serial_commas "and" ss) ^
blanchet@35671
   670
                         " to confirm that the " ^ das_wort_model ^
blanchet@35671
   671
                         " is genuine.")
blanchet@35671
   672
                end
blanchet@35671
   673
              else
blanchet@35671
   674
                print ("Nitpick is unable to guarantee the authenticity of \
blanchet@35671
   675
                       \the " ^ das_wort_model ^ " in the presence of \
blanchet@35671
   676
                       \polymorphic axioms.")
blanchet@35671
   677
            else
blanchet@35671
   678
              ();
blanchet@35671
   679
            NONE)
blanchet@35671
   680
         else
blanchet@35671
   681
           if not genuine then
blanchet@35671
   682
             (Unsynchronized.inc met_potential;
blanchet@35671
   683
              if check_potential then
blanchet@35671
   684
                let
blanchet@35671
   685
                  val status = prove_hol_model scope tac_timeout free_names
blanchet@38169
   686
                                               sel_names rel_table bounds
blanchet@38169
   687
                                               (assms_prop ())
blanchet@35671
   688
                in
blanchet@35671
   689
                  (case status of
blanchet@35671
   690
                     SOME true => print ("Confirmation by \"auto\": The \
blanchet@35671
   691
                                         \above " ^ das_wort_model ^
blanchet@35671
   692
                                         " is genuine.")
blanchet@35671
   693
                   | SOME false => print ("Refutation by \"auto\": The above " ^
blanchet@35671
   694
                                          das_wort_model ^ " is spurious.")
blanchet@35671
   695
                   | NONE => print "No confirmation by \"auto\".");
blanchet@35671
   696
                  status
blanchet@35671
   697
                end
blanchet@35671
   698
              else
blanchet@35671
   699
                NONE)
blanchet@33192
   700
           else
blanchet@35671
   701
             NONE)
blanchet@35671
   702
        |> pair genuine_means_genuine
blanchet@33192
   703
      end
blanchet@35671
   704
    fun solve_any_problem (found_really_genuine, max_potential, max_genuine,
blanchet@35671
   705
                           donno) first_time problems =
blanchet@33192
   706
      let
blanchet@33192
   707
        val max_potential = Int.max (0, max_potential)
blanchet@33192
   708
        val max_genuine = Int.max (0, max_genuine)
blanchet@33192
   709
        fun print_and_check genuine (j, bounds) =
blanchet@33192
   710
          print_and_check_model genuine bounds (snd (nth problems j))
blanchet@33192
   711
        val max_solutions = max_potential + max_genuine
blanchet@36384
   712
                            |> not incremental ? Integer.min 1
blanchet@33192
   713
      in
blanchet@33192
   714
        if max_solutions <= 0 then
blanchet@35671
   715
          (found_really_genuine, 0, 0, donno)
blanchet@33192
   716
        else
blanchet@34126
   717
          case KK.solve_any_problem overlord deadline max_threads max_solutions
blanchet@34126
   718
                                    (map fst problems) of
blanchet@35696
   719
            KK.JavaNotInstalled =>
blanchet@35696
   720
            (print_m install_java_message;
blanchet@35696
   721
             (found_really_genuine, max_potential, max_genuine, donno + 1))
blanchet@35696
   722
          | KK.KodkodiNotInstalled =>
blanchet@33568
   723
            (print_m install_kodkodi_message;
blanchet@35671
   724
             (found_really_genuine, max_potential, max_genuine, donno + 1))
blanchet@35333
   725
          | KK.Normal ([], unsat_js, s) =>
blanchet@35333
   726
            (update_checked_problems problems unsat_js; show_kodkod_warning s;
blanchet@35671
   727
             (found_really_genuine, max_potential, max_genuine, donno))
blanchet@35333
   728
          | KK.Normal (sat_ps, unsat_js, s) =>
blanchet@33192
   729
            let
blanchet@33192
   730
              val (lib_ps, con_ps) =
blanchet@35185
   731
                List.partition (#unsound o snd o nth problems o fst) sat_ps
blanchet@33192
   732
            in
blanchet@33192
   733
              update_checked_problems problems (unsat_js @ map fst lib_ps);
blanchet@35333
   734
              show_kodkod_warning s;
blanchet@33192
   735
              if null con_ps then
blanchet@33192
   736
                let
blanchet@35671
   737
                  val genuine_codes =
blanchet@35671
   738
                    lib_ps |> take max_potential
blanchet@35671
   739
                           |> map (print_and_check false)
blanchet@35671
   740
                           |> filter (curry (op =) (SOME true) o snd)
blanchet@35671
   741
                  val found_really_genuine =
blanchet@35671
   742
                    found_really_genuine orelse exists fst genuine_codes
blanchet@35671
   743
                  val num_genuine = length genuine_codes
blanchet@33192
   744
                  val max_genuine = max_genuine - num_genuine
blanchet@33192
   745
                  val max_potential = max_potential
blanchet@33192
   746
                                      - (length lib_ps - num_genuine)
blanchet@33192
   747
                in
blanchet@33192
   748
                  if max_genuine <= 0 then
blanchet@35671
   749
                    (found_really_genuine, 0, 0, donno)
blanchet@33192
   750
                  else
blanchet@33192
   751
                    let
blanchet@35185
   752
                      (* "co_js" is the list of sound problems whose unsound
blanchet@35185
   753
                         pendants couldn't be satisfied and hence that most
blanchet@35185
   754
                         probably can't be satisfied themselves. *)
blanchet@33192
   755
                      val co_js =
blanchet@33192
   756
                        map (fn j => j - 1) unsat_js
blanchet@33192
   757
                        |> filter (fn j =>
blanchet@33192
   758
                                      j >= 0 andalso
blanchet@33192
   759
                                      scopes_equivalent
blanchet@35814
   760
                                          (#scope (snd (nth problems j)),
blanchet@35814
   761
                                           #scope (snd (nth problems (j + 1)))))
blanchet@33192
   762
                      val bye_js = sort_distinct int_ord (map fst sat_ps @
blanchet@33192
   763
                                                          unsat_js @ co_js)
blanchet@33192
   764
                      val problems =
blanchet@33192
   765
                        problems |> filter_out_indices bye_js
blanchet@33192
   766
                                 |> max_potential <= 0
blanchet@35185
   767
                                    ? filter_out (#unsound o snd)
blanchet@33192
   768
                    in
blanchet@35671
   769
                      solve_any_problem (found_really_genuine, max_potential,
blanchet@35671
   770
                                         max_genuine, donno) false problems
blanchet@33192
   771
                    end
blanchet@33192
   772
                end
blanchet@33192
   773
              else
blanchet@33192
   774
                let
blanchet@35671
   775
                  val genuine_codes =
blanchet@35671
   776
                    con_ps |> take max_genuine
blanchet@35671
   777
                           |> map (print_and_check true)
blanchet@35671
   778
                  val max_genuine = max_genuine - length genuine_codes
blanchet@35671
   779
                  val found_really_genuine =
blanchet@35671
   780
                    found_really_genuine orelse exists fst genuine_codes
blanchet@33192
   781
                in
blanchet@33192
   782
                  if max_genuine <= 0 orelse not first_time then
blanchet@35671
   783
                    (found_really_genuine, 0, max_genuine, donno)
blanchet@33192
   784
                  else
blanchet@33192
   785
                    let
blanchet@33192
   786
                      val bye_js = sort_distinct int_ord
blanchet@33192
   787
                                                 (map fst sat_ps @ unsat_js)
blanchet@33192
   788
                      val problems =
blanchet@33192
   789
                        problems |> filter_out_indices bye_js
blanchet@35185
   790
                                 |> filter_out (#unsound o snd)
blanchet@35671
   791
                    in
blanchet@35671
   792
                      solve_any_problem (found_really_genuine, 0, max_genuine,
blanchet@35671
   793
                                         donno) false problems
blanchet@35671
   794
                    end
blanchet@33192
   795
                end
blanchet@33192
   796
            end
blanchet@34126
   797
          | KK.TimedOut unsat_js =>
blanchet@33192
   798
            (update_checked_problems problems unsat_js; raise TimeLimit.TimeOut)
blanchet@34126
   799
          | KK.Interrupted NONE => (checked_problems := NONE; do_interrupted ())
blanchet@34126
   800
          | KK.Interrupted (SOME unsat_js) =>
blanchet@33192
   801
            (update_checked_problems problems unsat_js; do_interrupted ())
blanchet@34126
   802
          | KK.Error (s, unsat_js) =>
blanchet@33192
   803
            (update_checked_problems problems unsat_js;
blanchet@33192
   804
             print_v (K ("Kodkod error: " ^ s ^ "."));
blanchet@35671
   805
             (found_really_genuine, max_potential, max_genuine, donno + 1))
blanchet@33192
   806
      end
blanchet@33192
   807
blanchet@35671
   808
    fun run_batch j n scopes (found_really_genuine, max_potential, max_genuine,
blanchet@35671
   809
                              donno) =
blanchet@33192
   810
      let
blanchet@33192
   811
        val _ =
blanchet@33192
   812
          if null scopes then
blanchet@33192
   813
            print_m (K "The scope specification is inconsistent.")
blanchet@33192
   814
          else if verbose then
blanchet@33192
   815
            pprint (Pretty.chunks
blanchet@33192
   816
                [Pretty.blk (0,
blanchet@33192
   817
                     pstrs ((if n > 1 then
blanchet@33192
   818
                               "Batch " ^ string_of_int (j + 1) ^ " of " ^
blanchet@33192
   819
                               signed_string_of_int n ^ ": "
blanchet@33192
   820
                             else
blanchet@33192
   821
                               "") ^
blanchet@33192
   822
                            "Trying " ^ string_of_int (length scopes) ^
blanchet@33192
   823
                            " scope" ^ plural_s_for_list scopes ^ ":")),
blanchet@33192
   824
                 Pretty.indent indent_size
blanchet@33192
   825
                     (Pretty.chunks (map2
blanchet@33192
   826
                          (fn j => fn scope =>
blanchet@33192
   827
                              Pretty.block (
blanchet@33192
   828
                                  (case pretties_for_scope scope true of
blanchet@33192
   829
                                     [] => [Pretty.str "Empty"]
blanchet@33192
   830
                                   | pretties => pretties) @
blanchet@33192
   831
                                  [Pretty.str (if j = 1 then "." else ";")]))
blanchet@33192
   832
                          (length scopes downto 1) scopes))])
blanchet@33192
   833
          else
blanchet@33192
   834
            ()
blanchet@35280
   835
        fun add_problem_for_scope (scope, unsound) (problems, donno) =
blanchet@33192
   836
          (check_deadline ();
blanchet@35185
   837
           case problem_for_scope unsound scope of
blanchet@33192
   838
             SOME problem =>
blanchet@33192
   839
             (problems
blanchet@33192
   840
              |> (null problems orelse
blanchet@35814
   841
                  not (KK.problems_equivalent (fst problem, fst (hd problems))))
blanchet@33192
   842
                  ? cons problem, donno)
blanchet@33192
   843
           | NONE => (problems, donno + 1))
blanchet@33192
   844
        val (problems, donno) =
blanchet@33192
   845
          fold add_problem_for_scope
blanchet@33192
   846
               (map_product pair scopes
blanchet@33192
   847
                    ((if max_genuine > 0 then [false] else []) @
blanchet@33192
   848
                     (if max_potential > 0 then [true] else [])))
blanchet@33192
   849
               ([], donno)
blanchet@33192
   850
        val _ = Unsynchronized.change generated_problems (append problems)
blanchet@33192
   851
        val _ = Unsynchronized.change generated_scopes (append scopes)
blanchet@35185
   852
        val _ =
blanchet@35185
   853
          if j + 1 = n then
blanchet@35185
   854
            let
blanchet@35185
   855
              val (unsound_problems, sound_problems) =
blanchet@35185
   856
                List.partition (#unsound o snd) (!generated_problems)
blanchet@35185
   857
            in
blanchet@35185
   858
              if not (null sound_problems) andalso
blanchet@35185
   859
                 forall (KK.is_problem_trivially_false o fst)
blanchet@35185
   860
                        sound_problems then
blanchet@35185
   861
                print_m (fn () =>
blanchet@35220
   862
                    "Warning: The conjecture either trivially holds for the \
blanchet@35384
   863
                    \given scopes or lies outside Nitpick's supported \
blanchet@35384
   864
                    \fragment." ^
blanchet@35185
   865
                    (if exists (not o KK.is_problem_trivially_false o fst)
blanchet@35185
   866
                               unsound_problems then
blanchet@36913
   867
                       " Only potential " ^ das_wort_model ^ "s may be found."
blanchet@35185
   868
                     else
blanchet@35185
   869
                       ""))
blanchet@35185
   870
              else
blanchet@35185
   871
                ()
blanchet@35185
   872
            end
blanchet@35185
   873
          else
blanchet@35185
   874
            ()
blanchet@33192
   875
      in
blanchet@35671
   876
        solve_any_problem (found_really_genuine, max_potential, max_genuine,
blanchet@35671
   877
                           donno) true (rev problems)
blanchet@33192
   878
      end
blanchet@33192
   879
blanchet@33192
   880
    fun scope_count (problems : rich_problem list) scope =
blanchet@35814
   881
      length (filter (curry scopes_equivalent scope o #scope o snd) problems)
blanchet@33192
   882
    fun excipit did_so_and_so =
blanchet@33192
   883
      let
blanchet@33192
   884
        val do_filter =
blanchet@35185
   885
          if !met_potential = max_potential then filter_out (#unsound o snd)
blanchet@33192
   886
          else I
blanchet@33192
   887
        val total = length (!scopes)
blanchet@33192
   888
        val unsat =
blanchet@33192
   889
          fold (fn scope =>
blanchet@33192
   890
                   case scope_count (do_filter (!generated_problems)) scope of
blanchet@33192
   891
                     0 => I
blanchet@33192
   892
                   | n =>
blanchet@33556
   893
                     scope_count (do_filter (these (!checked_problems)))
blanchet@33556
   894
                                 scope = n
blanchet@33556
   895
                     ? Integer.add 1) (!generated_scopes) 0
blanchet@33192
   896
      in
blanchet@33192
   897
        "Nitpick " ^ did_so_and_so ^
blanchet@33192
   898
        (if is_some (!checked_problems) andalso total > 0 then
blanchet@35696
   899
           " " ^ string_of_int (Int.min (total - 1, unsat)) ^ " of " ^
blanchet@33192
   900
           string_of_int total ^ " scope" ^ plural_s total
blanchet@33192
   901
         else
blanchet@33192
   902
           "") ^ "."
blanchet@33192
   903
      end
blanchet@33192
   904
blanchet@37704
   905
    val (skipped, the_scopes) =
blanchet@37704
   906
      all_scopes hol_ctxt binarize cards_assigns maxes_assigns iters_assigns
blanchet@37704
   907
                 bitss bisim_depths mono_Ts nonmono_Ts deep_dataTs
blanchet@37704
   908
                 finitizable_dataTs
blanchet@37704
   909
    val _ = if skipped > 0 then
blanchet@37704
   910
              print_m (fn () => "Too many scopes. Skipping " ^
blanchet@37704
   911
                                string_of_int skipped ^ " scope" ^
blanchet@37704
   912
                                plural_s skipped ^
blanchet@37704
   913
                                ". (Consider using \"mono\" or \
blanchet@37704
   914
                                \\"merge_type_vars\" to prevent this.)")
blanchet@37704
   915
            else
blanchet@37704
   916
              ()
blanchet@37704
   917
    val _ = scopes := the_scopes
blanchet@37704
   918
blanchet@35671
   919
    fun run_batches _ _ []
blanchet@35671
   920
                    (found_really_genuine, max_potential, max_genuine, donno) =
blanchet@33192
   921
        if donno > 0 andalso max_genuine > 0 then
blanchet@35696
   922
          (print_m (fn () => excipit "checked"); "unknown")
blanchet@33192
   923
        else if max_genuine = original_max_genuine then
blanchet@33192
   924
          if max_potential = original_max_potential then
blanchet@34982
   925
            (print_m (fn () =>
blanchet@34982
   926
                 "Nitpick found no " ^ das_wort_model ^ "." ^
blanchet@35183
   927
                 (if not standard andalso likely_in_struct_induct_step then
blanchet@34982
   928
                    " This suggests that the induction hypothesis might be \
blanchet@34982
   929
                    \general enough to prove this subgoal."
blanchet@34982
   930
                  else
blanchet@37704
   931
                    "")); if skipped > 0 then "unknown" else "none")
blanchet@33192
   932
          else
blanchet@34982
   933
            (print_m (fn () =>
blanchet@38123
   934
                 excipit ("could not find a" ^
blanchet@38123
   935
                          (if max_genuine = 1 then
blanchet@38123
   936
                             " better " ^ das_wort_model ^ "."
blanchet@38123
   937
                           else
blanchet@38123
   938
                             "ny better " ^ das_wort_model ^ "s.") ^
blanchet@38123
   939
                          " It checked"));
blanchet@38123
   940
             "potential")
blanchet@35671
   941
        else if found_really_genuine then
blanchet@35671
   942
          "genuine"
blanchet@33192
   943
        else
blanchet@35671
   944
          "quasi_genuine"
blanchet@33192
   945
      | run_batches j n (batch :: batches) z =
blanchet@35671
   946
        let val (z as (_, _, max_genuine, _)) = run_batch j n batch z in
blanchet@33192
   947
          run_batches (j + 1) n (if max_genuine > 0 then batches else []) z
blanchet@33192
   948
        end
blanchet@33192
   949
blanchet@33192
   950
    val batches = batch_list batch_size (!scopes)
blanchet@33192
   951
    val outcome_code =
blanchet@35671
   952
      (run_batches 0 (length batches) batches
blanchet@35671
   953
                   (false, max_potential, max_genuine, 0)
blanchet@33192
   954
       handle Exn.Interrupt => do_interrupted ())
blanchet@33192
   955
      handle TimeLimit.TimeOut =>
blanchet@35696
   956
             (print_m (fn () => excipit "ran out of time after checking");
blanchet@33192
   957
              if !met_potential > 0 then "potential" else "unknown")
blanchet@35696
   958
           | Exn.Interrupt =>
blanchet@35696
   959
             if auto orelse debug then raise Interrupt
blanchet@35696
   960
             else error (excipit "was interrupted after checking")
blanchet@33192
   961
    val _ = print_v (fn () => "Total time: " ^
blanchet@33192
   962
                              signed_string_of_int (Time.toMilliseconds
blanchet@33192
   963
                                    (Timer.checkRealTimer timer)) ^ " ms.")
blanchet@33192
   964
  in (outcome_code, !state_ref) end
blanchet@33192
   965
  handle Exn.Interrupt =>
blanchet@33192
   966
         if auto orelse #debug params then
blanchet@33192
   967
           raise Interrupt
blanchet@33192
   968
         else
blanchet@33192
   969
           if passed_deadline deadline then
blanchet@33192
   970
             (priority "Nitpick ran out of time."; ("unknown", state))
blanchet@33192
   971
           else
blanchet@33192
   972
             error "Nitpick was interrupted."
blanchet@33192
   973
blanchet@34982
   974
fun pick_nits_in_term state (params as {debug, timeout, expect, ...}) auto i n
blanchet@38169
   975
                      step subst assm_ts orig_t =
blanchet@37497
   976
  let val warning_m = if auto then K () else warning in
blanchet@37213
   977
    if getenv "KODKODI" = "" then
blanchet@37497
   978
      (* The "expect" argument is deliberately ignored if Kodkodi is missing so
blanchet@37497
   979
         that the "Nitpick_Examples" can be processed on any machine. *)
blanchet@37213
   980
      (warning_m (Pretty.string_of (plazy install_kodkodi_message));
blanchet@37497
   981
       ("no_kodkodi", state))
blanchet@37213
   982
    else
blanchet@37213
   983
      let
blanchet@37497
   984
        val unknown_outcome = ("unknown", state)
blanchet@37213
   985
        val deadline = Option.map (curry Time.+ (Time.now ())) timeout
blanchet@37213
   986
        val outcome as (outcome_code, _) =
blanchet@37213
   987
          time_limit (if debug then NONE else timeout)
blanchet@37213
   988
              (pick_them_nits_in_term deadline state params auto i n step subst
blanchet@38169
   989
                                      assm_ts) orig_t
blanchet@37213
   990
          handle TOO_LARGE (_, details) =>
blanchet@37213
   991
                 (warning ("Limit reached: " ^ details ^ "."); unknown_outcome)
blanchet@37213
   992
               | TOO_SMALL (_, details) =>
blanchet@37213
   993
                 (warning ("Limit reached: " ^ details ^ "."); unknown_outcome)
blanchet@37213
   994
               | Kodkod.SYNTAX (_, details) =>
blanchet@37213
   995
                 (warning ("Ill-formed Kodkodi output: " ^ details ^ ".");
blanchet@37213
   996
                  unknown_outcome)
blanchet@37213
   997
      in
blanchet@37213
   998
        if expect = "" orelse outcome_code = expect then outcome
blanchet@37213
   999
        else error ("Unexpected outcome: " ^ quote outcome_code ^ ".")
blanchet@37213
  1000
      end
blanchet@37213
  1001
  end
blanchet@33192
  1002
blanchet@35335
  1003
fun is_fixed_equation fixes
blanchet@35335
  1004
                      (Const (@{const_name "=="}, _) $ Free (s, _) $ Const _) =
blanchet@35335
  1005
    member (op =) fixes s
blanchet@35335
  1006
  | is_fixed_equation _ _ = false
blanchet@35335
  1007
fun extract_fixed_frees ctxt (assms, t) =
blanchet@35335
  1008
  let
blanchet@35335
  1009
    val fixes = Variable.fixes_of ctxt |> map snd
blanchet@35335
  1010
    val (subst, other_assms) =
blanchet@35335
  1011
      List.partition (is_fixed_equation fixes) assms
blanchet@35335
  1012
      |>> map Logic.dest_equals
blanchet@35335
  1013
  in (subst, other_assms, subst_atomic subst t) end
blanchet@35335
  1014
blanchet@34982
  1015
fun pick_nits_in_subgoal state params auto i step =
blanchet@33192
  1016
  let
blanchet@33192
  1017
    val ctxt = Proof.context_of state
wenzelm@33292
  1018
    val t = state |> Proof.raw_goal |> #goal |> prop_of
blanchet@33192
  1019
  in
blanchet@34982
  1020
    case Logic.count_prems t of
blanchet@34982
  1021
      0 => (priority "No subgoal!"; ("none", state))
blanchet@34982
  1022
    | n =>
blanchet@33192
  1023
      let
blanchet@36406
  1024
        val t = Logic.goal_params t i |> fst
blanchet@33192
  1025
        val assms = map term_of (Assumption.all_assms_of ctxt)
blanchet@35335
  1026
        val (subst, assms, t) = extract_fixed_frees ctxt (assms, t)
blanchet@35335
  1027
      in pick_nits_in_term state params auto i n step subst assms t end
blanchet@33192
  1028
  end
blanchet@33192
  1029
blanchet@33192
  1030
end;