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