smtv2.ml 12.2 KB
Newer Older
1
2
(**************************************************************************)
(*                                                                        *)
3
(*  Copyright (C) 2010-2011                                               *)
4
5
6
(*    François Bobot                                                      *)
(*    Jean-Christophe Filliâtre                                           *)
(*    Claude Marché                                                       *)
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
(*    Andrei Paskevich                                                    *)
(*                                                                        *)
(*  This software is free software; you can redistribute it and/or        *)
(*  modify it under the terms of the GNU Library General Public           *)
(*  License version 2.1, with the special exception on linking            *)
(*  described in file LICENSE.                                            *)
(*                                                                        *)
(*  This software is distributed in the hope that it will be useful,      *)
(*  but WITHOUT ANY WARRANTY; without even the implied warranty of        *)
(*  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.                  *)
(*                                                                        *)
(**************************************************************************)

(** SMT v1 printer with some extensions *)

open Format
open Pp
open Ident
open Ty
open Term
open Decl
open Theory
open Task
open Printer

(** Options of this printer *)
let use_trigger = Theory.register_meta_excl "Smt : trigger" []
let use_builtin_array = Theory.register_meta_excl "Smt : builtin array" []

(** *)

let ident_printer =
  let bls = (*["and";" benchmark";" distinct";"exists";"false";"flet";"forall";
     "if then else";"iff";"implies";"ite";"let";"logic";"not";"or";
     "sat";"theory";"true";"unknown";"unsat";"xor";
     "assumption";"axioms";"defintion";"extensions";"formula";
     "funs";"extrafuns";"extrasorts";"extrapreds";"language";
     "notes";"preds";"sorts";"status";"theory";"Int";"Real";"Bool";
     "Array";"U";"select";"store"]*)
    (** smtlib2 V2 p71 *)
    [(** General: *)
      "!";"_"; "as"; "DECIMAL"; "exists"; "forall"; "let"; "NUMERAL";
      "par"; "STRING";
       (**Command names:*)
      "assert";"check-sat"; "declare-sort";"declare-fun";"define-sort";
      "define-fun";"exit";"get-assertions";"get-assignment"; "get-info";
      "get-option"; "get-proof"; "get-unsat-core"; "get-value"; "pop"; "push";
      "set-logic"; "set-info"; "set-option";
       (** for security *)
56
      "Bool";"unsat";"sat";"true";"false";"select";"store"]
57
58
59
60
61
62
63
64
65
66
67
68
  in
  let san = sanitizer char_to_alpha char_to_alnumus in
  create_ident_printer bls ~sanitizer:san

let print_ident fmt id =
  fprintf fmt "%s" (id_unique ident_printer id)

(** type *)
type info = {
  info_syn : string Mid.t;
  info_rem : Sid.t;
  use_trigger : bool;
69
  complex_type : ty Hty.t;
70
71
72
73
74
75
76
77
}

let rec print_type info fmt ty = match ty.ty_node with
  | Tyvar _ -> unsupported "smt : you must encode the polymorphism"
  | Tyapp (ts, []) -> begin match query_syntax info.info_syn ts.ts_name with
      | Some s -> syntax_arguments s (print_type info) fmt []
      | None -> fprintf fmt "%a" print_ident ts.ts_name
  end
78
79
80
81
82
83
84
  | Tyapp (ts, l) ->
     begin match query_syntax info.info_syn ts.ts_name with
      | Some s -> syntax_arguments s (print_type info) fmt l
      | None -> fprintf fmt "(%a %a)" print_ident ts.ts_name
        (print_list space (print_type info)) l
     end

85
let iter_complex_type info fmt () ty =
86
87
88
89
90
91
92
93
94
95
    match ty.ty_node with
      | Tyapp (_,_::_) when not (Hty.mem info.complex_type ty) ->
        let id = id_fresh (Pp.string_of_wnl Pretty.print_ty ty) in
        let ts = create_tysymbol id [] None in
        let cty = ty_app ts [] in
        fprintf fmt "(define-sorts ((%a %a)))@."
          print_ident ts.ts_name
          (print_type info) ty;
        Hty.add info.complex_type ty cty
      | _ -> ()
96
97
98


let find_complex_type info fmt f =
99
  t_ty_fold (iter_complex_type info fmt) () f
100
101

let find_complex_type_expr info fmt f =
102
  TermTF.t_selecti
103
    (t_ty_fold (iter_complex_type info fmt))
104
    (t_ty_fold (iter_complex_type info fmt))
105
    () f
106
107
108
109
110
111

let print_type info fmt ty =
  print_type info fmt
    (try
       Hty.find info.complex_type ty
     with Not_found -> ty)
112
113
114
115
116
117

(* and print_tyapp info fmt = function *)
(*   | [] -> () *)
(*   | [ty] -> fprintf fmt "%a " (print_type info) ty *)
(*   | tl -> fprintf fmt "(%a) " (print_list comma (print_type info)) tl *)

118
119
let print_type info fmt =
  catch_unsupportedType (print_type info fmt)
120
121
122
123
124
125
126
127
128
129
130
131
132

let print_type_value info fmt = function
  | None -> fprintf fmt "Bool"
  | Some ty -> print_type info fmt ty

(** var *)
let forget_var v = forget_id ident_printer v.vs_name

let print_var fmt {vs_name = id} =
  let n = id_unique ident_printer id in
  fprintf fmt "%s" n

let print_typed_var info fmt vs =
133
134
  fprintf fmt "(%a %a)" print_var vs
    (print_type info) vs.vs_ty
135
136
137
138
139
140
141
142
143

let print_var_list info fmt vsl =
  print_list space (print_typed_var info) fmt vsl

(** expr *)
let rec print_term info fmt t = match t.t_node with
  | Tconst (ConstInt n) -> fprintf fmt "%s" n
  | Tconst (ConstReal c) ->
      Print_real.print_with_integers
144
        "%s.0" "(* %s.0 %s.0)" "(/ %s.0 %s.0)" fmt c
145
146
  | Tvar v -> print_var fmt v
  | Tapp (ls, tl) -> begin match query_syntax info.info_syn ls.ls_name with
147
148
      | Some s -> syntax_arguments_typed s (print_term info)
        (print_type info) (Some t) fmt tl
149
150
151
      | None -> begin match tl with (* for cvc3 wich doesn't accept (toto ) *)
          | [] -> fprintf fmt "@[%a@]" print_ident ls.ls_name
          | _ -> fprintf fmt "@[(%a@ %a)@]"
152
              print_ident ls.ls_name (print_list space (print_term info)) tl
153
154
155
156
157
158
159
160
161
162
163
164
165
        end end
  | Tlet (t1, tb) ->
      let v, t2 = t_open_bound tb in
      fprintf fmt "@[(let (%a %a)@ %a)@]" print_var v
        (print_term info) t1 (print_term info) t2;
      forget_var v
  | Tif (f1,t1,t2) ->
      fprintf fmt "@[(ite %a@ %a@ %a)@]"
        (print_fmla info) f1 (print_term info) t1 (print_term info) t2
  | Tcase _ -> unsupportedTerm t
      "smtv2 : you must eliminate match"
  | Teps _ -> unsupportedTerm t
      "smtv2 : you must eliminate epsilon"
166
  | Tquant _ | Tbinop _ | Tnot _ | Ttrue | Tfalse -> raise (TermExpected t)
167

168
169
and print_fmla info fmt f = match f.t_node with
  | Tapp ({ ls_name = id }, []) ->
170
      print_ident fmt id
171
  | Tapp (ls, tl) -> begin match query_syntax info.info_syn ls.ls_name with
172
173
      | Some s -> syntax_arguments_typed s (print_term info)
        (print_type info) None fmt tl
174
175
176
      | None -> begin match tl with (* for cvc3 wich doesn't accept (toto ) *)
          | [] -> fprintf fmt "%a" print_ident ls.ls_name
          | _ -> fprintf fmt "(%a@ %a)"
177
              print_ident ls.ls_name (print_list space (print_term info)) tl
178
        end end
179
180
181
  | Tquant (q, fq) ->
      let q = match q with Tforall -> "forall" | Texists -> "exists" in
      let vl, tl, f = t_open_quant fq in
182
183
184
      (* TODO trigger dépend des capacités du prover : 2 printers?
      smtwithtriggers/smtstrict *)
      if tl = [] then
185
        fprintf fmt "@[(%s@ (%a)@ %a)@]"
186
187
188
189
          q
          (print_var_list info) vl
          (print_fmla info) f
      else
190
        fprintf fmt "@[(%s@ (%a)@ (! %a %a))@]"
191
192
193
194
195
          q
          (print_var_list info) vl
          (print_fmla info) f
          (print_triggers info) tl;
      List.iter forget_var vl
196
  | Tbinop (Tand, f1, f2) ->
197
      fprintf fmt "@[(and@ %a@ %a)@]" (print_fmla info) f1 (print_fmla info) f2
198
  | Tbinop (Tor, f1, f2) ->
199
      fprintf fmt "@[(or@ %a@ %a)@]" (print_fmla info) f1 (print_fmla info) f2
200
  | Tbinop (Timplies, f1, f2) ->
201
202
      fprintf fmt "@[(implies@ %a@ %a)@]"
        (print_fmla info) f1 (print_fmla info) f2
203
  | Tbinop (Tiff, f1, f2) ->
204
      fprintf fmt "@[(iff@ %a@ %a)@]" (print_fmla info) f1 (print_fmla info) f2
205
  | Tnot f ->
206
      fprintf fmt "@[(not@ %a)@]" (print_fmla info) f
207
  | Ttrue ->
208
      fprintf fmt "true"
209
  | Tfalse ->
210
      fprintf fmt "false"
211
  | Tif (f1, f2, f3) ->
212
      fprintf fmt "@[(if_then_else %a@ %a@ %a)@]"
213
        (print_fmla info) f1 (print_fmla info) f2 (print_fmla info) f3
214
  | Tlet (t1, tb) ->
215
      let v, f2 = t_open_bound tb in
216
217
218
      fprintf fmt "@[(let ((%a %a))@ %a)@]" print_var v
        (print_term info) t1 (print_fmla info) f2;
      forget_var v
219
  | Tcase _ -> unsupportedTerm f
220
      "smtv2 : you must eliminate match"
221
  | Tvar _ | Tconst _ | Teps _ -> raise (FmlaExpected f)
222

223
224
and print_expr info fmt =
  TermTF.t_select (print_term info fmt) (print_fmla info fmt)
225
226
227
228
229
230
231
232
233
234

and print_trigger info fmt e = fprintf fmt "(%a)" (print_expr info) e

and print_triggers info fmt = function
  | [] -> ()
  | a::l -> fprintf fmt ":pattern (%a) %a"
    (print_list space (print_trigger info)) a
    (print_triggers info) l

let print_logic_binder info fmt v =
235
236
  fprintf fmt "%a: %a" print_ident v.vs_name
    (print_type info) v.vs_ty
237
238
239
240

let print_type_decl info fmt = function
  | ts, Tabstract when Sid.mem ts.ts_name info.info_rem -> false
  | ts, Tabstract when ts.ts_args = [] ->
241
      fprintf fmt "(declare-sort %a 0)" print_ident ts.ts_name; true
242
243
244
245
  | ts, Tabstract when ts.ts_def = None ->
    let len = List.length ts.ts_args in
    fprintf fmt "(declare-sort %a %i)" print_ident ts.ts_name len; true
  | _, Tabstract -> false
246
247
248
  | _, Talgebraic _ -> unsupported
          "smtv2 : algebraic type are not supported"

249
250
251
let print_logic_decl info fmt (ls,ld) =
  if not (Mid.mem ls.ls_name info.info_syn) then
  match ld with
252
253
254
255
256
257
258
  | None ->
    fprintf fmt "@[<hov 2>(declare-fun %a (%a) %a)@]@\n"
      print_ident ls.ls_name
      (print_list space (print_type info)) ls.ls_args
      (print_type_value info) ls.ls_value
  | Some def ->
    let vsl,expr = Decl.open_ls_defn def  in
259
    find_complex_type_expr info fmt expr;
260
261
262
263
    fprintf fmt "@[<hov 2>(declare-fun %a (%a) %a %a)@]@\n"
      print_ident ls.ls_name
      (print_var_list info) vsl
      (print_type_value info) ls.ls_value
264
265
      (print_expr info) expr;
    List.iter forget_var vsl
266
267
268
269
270
271
272
273
274
275
276
277
278
279

let print_logic_decl info fmt d =
  if Sid.mem (fst d).ls_name info.info_rem then
    false else (print_logic_decl info fmt d; true)

let print_decl info fmt d = match d.d_node with
  | Dtype dl ->
      print_list_opt newline (print_type_decl info) fmt dl
  | Dlogic dl ->
      print_list_opt newline (print_logic_decl info) fmt dl
  | Dind _ -> unsupportedDecl d
      "smt : inductive definition are not supported"
  | Dprop (Paxiom, pr, _) when Sid.mem pr.pr_name info.info_rem -> false
  | Dprop (Paxiom, pr, f) ->
280
    find_complex_type info fmt f;
281
282
283
284
      fprintf fmt "@[<hov 2>;; %s@\n(assert@ %a)@]@\n"
        pr.pr_name.id_string
        (print_fmla info) f; true
  | Dprop (Pgoal, pr, f) ->
285
    find_complex_type info fmt f;
286
287
      fprintf fmt "@[(assert@\n";
      fprintf fmt "@[;; %a@]@\n" print_ident pr.pr_name;
288
      (match pr.pr_name.id_loc with
289
290
291
292
293
294
295
296
297
298
        | None -> ()
        | Some loc -> fprintf fmt " @[;; %a@]@\n"
            Loc.gen_report_position loc);
      fprintf fmt "  @[(not@ %a))@]" (print_fmla info) f;
      fprintf fmt "@[(check-sat)@]@\n";
      true
  | Dprop ((Plemma|Pskip), _, _) -> assert false

let print_decl info fmt = catch_unsupportedDecl (print_decl info fmt)

299
300
301
302
303
304
305
306
307
308
let distingued =
  let dist_syntax mls = function
    | [MAls ls;MAstr s] -> Mls.add ls s mls
    | _ -> assert false in
  let dist_dist syntax mls = function
    | [MAls ls;MAls lsdis] ->
      begin try
              Mid.add lsdis.ls_name (Mls.find ls syntax) mls
        with Not_found -> mls end
    | _ -> assert false in
309
  Trans.on_meta meta_syntax_logic (fun syntax ->
310
    let syntax = List.fold_left dist_syntax Mls.empty syntax in
311
    Trans.on_meta Discriminate.meta_lsinst (fun dis ->
312
313
314
      let dis2 = List.fold_left (dist_dist syntax) Mid.empty dis in
      Trans.return dis2))

315
316
317
318
let print_task pr thpr fmt task =
  print_prelude fmt pr;
  print_th_prelude task fmt thpr;
  let info = {
319
320
    info_syn = Mid.union (fun _ _ s -> Some s)
      (get_syntax_map task) (Trans.apply distingued task);
321
322
    info_rem = get_remove_set task;
    use_trigger = false;
323
    complex_type = Hty.create 5;
324
325
326
327
328
329
330
331
332
  }
  in
  let decls = Task.task_decls task in
  ignore (print_list_opt (add_flush newline2) (print_decl info) fmt decls)

let () = register_printer "smtv2"
  (fun _env pr thpr ?old:_ fmt task ->
     forget_all ident_printer;
     print_task pr thpr fmt task)