controller_itp.ml 43.5 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11
(********************************************************************)
(*                                                                  *)
(*  The Why3 Verification Platform   /   The Why3 Development Team  *)
(*  Copyright 2010-2017   --   INRIA - CNRS - Paris-Sud University  *)
(*                                                                  *)
(*  This software is distributed under the terms of the GNU Lesser  *)
(*  General Public License version 2.1, with the special exception  *)
(*  on linking described in file LICENSE.                           *)
(*                                                                  *)
(********************************************************************)

12
open Format
Clément Fumex's avatar
Clément Fumex committed
13 14
open Session_itp

Sylvain Dailler's avatar
Sylvain Dailler committed
15 16 17 18
let debug_sched = Debug.register_info_flag "scheduler"
  ~desc:"Print@ debugging@ messages@ about@ scheduling@ of@ prover@ calls@ \
         and@ transformation@ applications."

Sylvain Dailler's avatar
Sylvain Dailler committed
19
let debug_call_prover = Debug.lookup_flag "call_prover"
20 21
let default_delay_ms = 100 (* 0.1 seconds *)

Sylvain Dailler's avatar
Sylvain Dailler committed
22

23 24
exception Noprogress

25 26 27
let () = Exn_printer.register
    (fun fmt e ->
      match e with
Sylvain Dailler's avatar
Sylvain Dailler committed
28 29
      | Noprogress ->
          Format.fprintf fmt "The transformation made no progress.\n"
30 31
      | _ -> raise e)

Clément Fumex's avatar
Clément Fumex committed
32 33
(** State of a proof *)
type proof_attempt_status =
34
  | Undone   (** prover was never called *)
35 36 37
  | Scheduled (** external proof attempt is scheduled *)
  | Running (** external proof attempt is in progress *)
  | Done of Call_provers.prover_result (** external proof done *)
38 39
  | Interrupted (** external proof has never completed *)
  | Detached (** parent goal has no task, is detached *)
40 41
  | InternalFailure of exn (** external proof aborted by internal error *)
  | Uninstalled of Whyconf.prover (** prover is uninstalled *)
42
  | UpgradeProver of Whyconf.prover (** prover is upgraded *)
Clément Fumex's avatar
Clément Fumex committed
43

MARCHE Claude's avatar
MARCHE Claude committed
44 45
let print_status fmt st =
  match st with
46
  | Undone            -> fprintf fmt "Undone"
Sylvain Dailler's avatar
Sylvain Dailler committed
47 48 49 50
  | Scheduled         -> fprintf fmt "Scheduled"
  | Running           -> fprintf fmt "Running"
  | Done r            ->
      fprintf fmt "Done(%a)" Call_provers.print_prover_result r
51 52
  | Interrupted       -> fprintf fmt "Interrupted"
  | Detached          -> fprintf fmt "Detached"
Sylvain Dailler's avatar
Sylvain Dailler committed
53 54 55 56
  | InternalFailure e ->
      fprintf fmt "InternalFailure(%a)" Exn_printer.exn_printer e
  | Uninstalled pr    ->
      fprintf fmt "Prover %a is uninstalled" Whyconf.print_prover pr
57 58
  | UpgradeProver pr    ->
      fprintf fmt "Prover upgrade to %a" Whyconf.print_prover pr
MARCHE Claude's avatar
MARCHE Claude committed
59 60

type transformation_status =
61
  | TSscheduled | TSdone of transID | TSfailed of (proofNodeID * exn)
62 63 64 65

let print_trans_status fmt st =
  match st with
  | TSscheduled -> fprintf fmt "TScheduled"
66
  | TSdone _tid -> fprintf fmt "TSdone" (* TODO print tid *)
67
  | TSfailed _e -> fprintf fmt "TSfailed"
Clément Fumex's avatar
Clément Fumex committed
68

69 70 71 72
type strategy_status = STSgoto of proofNodeID * int | STShalt

let print_strategy_status fmt st =
  match st with
Sylvain Dailler's avatar
Sylvain Dailler committed
73 74
  | STSgoto(id,n) ->
      fprintf fmt "goto step %d in proofNode %a" n print_proofNodeID id
75 76 77
  | STShalt -> fprintf fmt "halt"


78
type controller =
Sylvain Dailler's avatar
Sylvain Dailler committed
79
  { mutable controller_session: Session_itp.session;
80
    controller_config : Whyconf.config;
Sylvain Dailler's avatar
Sylvain Dailler committed
81 82 83
    controller_env: Env.env;
    controller_provers:
      (Whyconf.config_prover * Driver.driver) Whyconf.Hprover.t;
MARCHE Claude's avatar
MARCHE Claude committed
84
    controller_strategies : (string * string * string * Strategy.instruction array) Stdlib.Hstr.t;
85
    controller_running_proof_attempts : unit Hpan.t;
86 87
  }

88 89 90 91 92
let session_max_tasks = ref 1

let set_session_max_tasks n =
  session_max_tasks := n;
  Prove_client.set_max_running_provers n
93

94
let create_controller config env ses =
95 96
  let c =
    {
97
      controller_session = ses;
98 99 100
      controller_config = config;
      controller_env = env;
      controller_provers = Whyconf.Hprover.create 7;
101
      controller_strategies = Stdlib.Hstr.create 7;
102
      controller_running_proof_attempts = Hpan.create 17;
103 104 105 106 107 108
    }
  in
  let provers = Whyconf.get_provers config in
  Whyconf.Mprover.iter
    (fun _ p ->
     try
109
       let d = Whyconf.load_driver (Whyconf.get_main config) env p.Whyconf.driver [] in
110 111
       Whyconf.Hprover.add c.controller_provers p.Whyconf.prover (p,d)
     with e ->
Sylvain Dailler's avatar
Sylvain Dailler committed
112
       Debug.dprintf debug_call_prover
113 114 115 116 117 118
         "[Controller_itp] error while loading driver for prover %a: %a@."
         Whyconf.print_prover p.Whyconf.prover
         Exn_printer.exn_printer e)
    provers;
  c

119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139

(* Cannot remove a proof_attempt that was scheduled but did not finish yet.
   It can be interrupted though. *)
let removable_proof_attempt c pa =
  try let () = Hpan.find c.controller_running_proof_attempts pa in false
  with Not_found -> true

let any_removable c any =
  match any with
  | APa pa -> removable_proof_attempt c pa
  | _ -> true

(* Check whether the subtree [n] contains an unremovable proof_attempt
   (ie: scheduled or running) *)
let check_removable c (n: any) =
  fold_all_any c.controller_session (fun acc any -> acc && any_removable c any) true n


let remove_subtree ~(notification:notifier) ~(removed:notifier) c (n: any) =
  if check_removable c n then
    Session_itp.remove_subtree ~notification ~removed c.controller_session n
140

141 142 143
(* Get children of any without proofattempts *)
let get_undetached_children_no_pa s any : any list =
  match any with
144
  | AFile f -> List.map (fun th -> ATh th) (file_theories f)
145 146 147
  | ATh th  -> List.map (fun g -> APn g) (theory_goals th)
  | ATn tn  -> List.map (fun pn -> APn pn) (get_sub_tasks s tn)
  | APn pn  -> List.map (fun tn -> ATn tn) (get_transformations s pn)
Sylvain Dailler's avatar
Sylvain Dailler committed
148
  | APa _ -> []
149

150 151


152 153 154 155 156 157 158 159 160 161 162 163
(* printing *)

module PSession = struct

  open Stdlib

  type any =
    | Session
    | File of file
    | Theory of theory
    | Goal of proofNodeID
    | Transf of transID
164
    | ProofAttempt of proof_attempt_node
165 166 167 168 169 170 171 172 173 174

  type 'a t = { tcont : controller;
                tkind : any }

  let decomp x =
    let s = x.tcont.controller_session in
    let n y acc = { x with tkind = y } :: acc in
    match x.tkind with
    | Session -> "", Hstr.fold (fun _ f -> n (File f)) (get_files s) []
    | File f ->
175
       (file_name f),
176
       List.fold_right (fun th -> n (Theory th)) (file_theories f) []
177 178 179
    | Theory th ->
       let id = theory_name th in
       let name = id.Ident.id_string in
180
       let name = if th_proved s th then name^"!" else name^"?" in
181
       name,
Sylvain Dailler's avatar
Sylvain Dailler committed
182 183 184 185
       List.fold_right
         (fun g -> n (Goal g))
         (theory_goals th)
         (List.fold_right (fun g -> n (Goal g)) (theory_detached_goals th) [])
186 187 188
    | Goal id ->
       let gid = get_proof_name s id in
       let name = gid.Ident.id_string in
189
       let name = if pn_proved s id then name^"!" else name^"?" in
190 191 192 193 194 195 196
       let pas = get_proof_attempts s id in
       let trs = get_transformations s id in
       name,
       List.fold_right (fun g -> n (Transf g)) trs
                       (List.fold_right (fun g -> n (ProofAttempt g)) pas [])
    | ProofAttempt pa ->
       Pp.sprintf_wnl "%a%s%s"
Sylvain Dailler's avatar
Sylvain Dailler committed
197 198 199 200 201
          Whyconf.print_prover pa.prover
          (match pa.Session_itp.proof_state with
          | Some { Call_provers.pr_answer = Call_provers.Valid} -> ""
          | _ -> "?")
          (if pa.proof_obsolete then "O" else ""), []
202 203
    | Transf id ->
       let name = get_transf_name s id in
204
       let name = if tn_proved s id then name^"!" else name^"?" in
205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221
       let sts = get_sub_tasks s id in
       let dsts = get_detached_sub_tasks s id in
       name,
       List.fold_right (fun g -> n (Goal g)) sts
                       (List.fold_right (fun g -> n (Goal g)) dsts [])

end

module P = Print_tree.PMake(PSession)

let print_session fmt c =
  P.print fmt { PSession.tcont = c; PSession.tkind = PSession.Session }

(*********)



222 223 224 225 226 227

(** reload files, associating old proof attempts and transformations
    to the new goals.  old theories and old goals for which we cannot
    find a corresponding new theory resp. old goal are kept, with
    tasks associated to them *)

228
let reload_files (c : controller) ~use_shapes =
229
  let old_ses = c.controller_session in
230
  c.controller_session <- empty_session ~from:old_ses (get_dir old_ses);
MARCHE Claude's avatar
MARCHE Claude committed
231 232
(*  try
 *)
233
    merge_files ~use_shapes c.controller_env c.controller_session old_ses
MARCHE Claude's avatar
MARCHE Claude committed
234
(* not need_anymore
235 236 237
  with e ->
    c.controller_session <- old_ses;
    raise e
MARCHE Claude's avatar
MARCHE Claude committed
238
 *)
239 240

let add_file c ?format fname =
241 242 243 244 245 246 247 248
  try
    let theories = Session_itp.read_file c.controller_env ?format fname in
    let (_ : file) = add_file_section c.controller_session fname (Some theories) format in
    None
  with e ->
    let (_ : file) = add_file_section c.controller_session fname None format in
    Some e

249

250 251

module type Scheduler = sig
252
  val blocking: bool
253
  val multiplier: int
254 255 256 257
  val timeout: ms:int -> (unit -> bool) -> unit
  val idle: prio:int -> (unit -> bool) -> unit
end

258 259
module Make(S : Scheduler) = struct

MARCHE Claude's avatar
MARCHE Claude committed
260 261
let scheduled_proof_attempts = Queue.create ()

262 263 264 265 266 267
let prover_tasks_in_progress = Hashtbl.create 17

(* We need to separate tasks that are edited from proofattempt in progress
   because we are not using why3server for the edited proofs and timeout_handler
   rely on a loop on why3server's results. *)
let prover_tasks_edited = Queue.create ()
MARCHE Claude's avatar
MARCHE Claude committed
268 269 270

let timeout_handler_running = ref false

271

MARCHE Claude's avatar
MARCHE Claude committed
272
let number_of_running_provers = ref 0
273

274 275 276 277
let observer = ref (fun _ _ _ -> ())

let register_observer = (:=) observer

278
module Hprover = Whyconf.Hprover
MARCHE Claude's avatar
MARCHE Claude committed
279

280 281 282 283 284 285 286 287 288 289 290 291 292
(* calling provers, with limits adaptation

 *)


(* to avoid corner cases when prover results are obtained very closely
   to the time or mem limits, we adapt these limits when we replay a
   proof *)

let adapt_limits ~interactive ~use_steps limits a =
  let t, m, s =
    let timelimit = limits.Call_provers.limit_time in
    let memlimit = limits.Call_provers.limit_mem in
293
    let steplimit = limits.Call_provers.limit_steps in
294 295 296 297 298 299 300 301
    match a.proof_state with
    | Some { Call_provers.pr_answer = r;
             Call_provers.pr_time = t;
             Call_provers.pr_steps = s } ->
       (* increased time limit is 1 + twice the previous running time,
       but enforced to remain inside the interval [l,2l] where l is
       the previous time limit *)
       let t = truncate (1.0 +. 2.0 *. t) in
302
       let increased_time = if interactive then 0
303 304 305 306 307
                            else max timelimit (min t (2 * timelimit)) in
       (* increased mem limit is just 1.5 times the previous mem limit *)
       let increased_mem = if interactive then 0 else 3 * memlimit / 2 in
       begin
         match r with
308 309
         | Call_provers.OutOfMemory -> increased_time, memlimit, steplimit
         | Call_provers.Timeout -> timelimit, increased_mem, steplimit
310 311
         | Call_provers.Valid ->
            let steplimit =
312 313 314 315 316 317 318 319 320
              if use_steps && not a.proof_obsolete then
                (* We need to allow at least one more step than what was used to
                   prove the same statement. Otherwise, the prover run out of
                   steps: this happens with cvc4 on some very fast proofs
                   (steps = 28).
                *)
                s + 1
              else
                0
321 322 323 324
            in
            increased_time, increased_mem, steplimit
         | Call_provers.Unknown _
         | Call_provers.StepLimitExceeded
325
         | Call_provers.Invalid -> increased_time, increased_mem, steplimit
326 327 328
         | Call_provers.Failure _
         | Call_provers.HighFailure ->
            (* correct ? failures are supposed to appear quickly anyway... *)
329
            timelimit, memlimit, steplimit
330 331
       end
    | None when interactive -> 0, 0, 0
332
    | None -> timelimit, memlimit, steplimit
333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354
  in
  { Call_provers.limit_time = t; limit_mem = m; limit_steps = s }

let group_answer a =
  match a with
  | Call_provers.OutOfMemory
  | Call_provers.Unknown _
  | Call_provers.Timeout -> Call_provers.Timeout
  | _ -> a

let fuzzy_proof_time nres ores =
  let ansold = ores.Call_provers.pr_answer in
  let told = ores.Call_provers.pr_time in
  let ansnew = nres.Call_provers.pr_answer in
  let tnew = nres.Call_provers.pr_time in
  if group_answer ansold = group_answer ansnew &&
       tnew >= told *. 0.9 -. 0.1 && tnew <= told *. 1.1 +. 0.1
  then { nres with Call_provers.pr_time = told }
  else nres


let build_prover_call ?proof_script ~cntexample c id pr limit callback ores =
355
  let (config_pr,driver) = Hprover.find c.controller_provers pr in
356
  let with_steps = Call_provers.(limit.limit_steps <> empty_limit.limit_steps) in
357
  let command =
358
    Whyconf.get_complete_command config_pr ~with_steps in
359 360
  try
    let task = Session_itp.get_raw_task c.controller_session id in
361 362 363
    Debug.dprintf debug_sched "[build_prover_call] Script file = %a@."
                  (Pp.print_option Pp.string) proof_script;
    let inplace = config_pr.Whyconf.in_place in
364 365 366 367 368 369 370 371 372
    try
      let call =
        Driver.prove_task ?old:proof_script ~cntexample:cntexample ~inplace ~command
                          ~limit driver task
      in
      let pa = (c.controller_session,id,pr,callback,false,call,ores) in
      Hashtbl.replace prover_tasks_in_progress call pa
    with Sys_error _ as e ->
      callback (InternalFailure e)
373 374
  with Not_found (* goal has no task, it is detached *) ->
       callback Detached
MARCHE Claude's avatar
MARCHE Claude committed
375

376 377
let update_observer () =
  let scheduled = Queue.length scheduled_proof_attempts in
378
  let waiting_or_running = Hashtbl.length prover_tasks_in_progress in
379 380 381
  let running = !number_of_running_provers in
  !observer scheduled (waiting_or_running - running) running

MARCHE Claude's avatar
MARCHE Claude committed
382 383
let timeout_handler () =
  (* examine all the prover tasks in progress *)
384 385 386
  (* When no tasks are there, probably no tasks were scheduled and the server
     was not launched so getting results could fail. *)
  if Hashtbl.length prover_tasks_in_progress != 0 then begin
387
    let results = Call_provers.get_new_results ~blocking:S.blocking in
388 389 390 391
    List.iter (fun (call, prover_update) ->
      match Hashtbl.find prover_tasks_in_progress call with
      | (ses,id,pr,callback,started,call,ores) ->
        begin match prover_update with
392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414
        | Call_provers.NoUpdates -> ()
        | Call_provers.ProverStarted ->
            assert (not started);
            callback Running;
            incr number_of_running_provers;
            Hashtbl.replace prover_tasks_in_progress call
              (ses,id,pr,callback,true,call,ores)
        | Call_provers.ProverFinished res ->
            Hashtbl.remove prover_tasks_in_progress call;
            if started then decr number_of_running_provers;
            let res = Opt.fold fuzzy_proof_time res ores in
            (* inform the callback *)
            callback (Done res)
        | Call_provers.ProverInterrupted ->
            Hashtbl.remove prover_tasks_in_progress call;
            if started then decr number_of_running_provers;
            (* inform the callback *)
            callback (Interrupted)
        | Call_provers.InternalFailure exn ->
            Hashtbl.remove prover_tasks_in_progress call;
            if started then decr number_of_running_provers;
            (* inform the callback *)
            callback (InternalFailure (exn))
415 416 417 418 419 420
        end
      | exception Not_found -> ()
        (* We probably received ProverStarted after ProverFinished,
           because what is sent to and received from the server is
           not ordered. *)
    ) results;
421 422
  end;

423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442
  (* When blocking is activated, we are in script mode and we don't want editors
     to be launched so we don't need to go in this loop. *)
  if not S.blocking then begin
    (* Check for editor calls which are not finished *)
    let q = Queue.create () in
    while not (Queue.is_empty prover_tasks_edited) do
      (* call is an EditorCall *)
      let (_ses,_id,_pr,callback,_started,call,ores) as c =
        Queue.pop prover_tasks_edited in
      let prover_update = Call_provers.query_call call in
      match prover_update with
      | Call_provers.NoUpdates -> Queue.add c q
      | Call_provers.ProverFinished res ->
          let res = Opt.fold fuzzy_proof_time res ores in
          (* inform the callback *)
          callback (Done res)
      | _ -> assert (false) (* An edition can only return Noupdates or finished *)
    done;
    Queue.transfer q prover_tasks_edited;
  end;
443 444

  (* if the number of prover tasks is less than S.multiplier times the maximum
MARCHE Claude's avatar
MARCHE Claude committed
445 446
     number of running provers, then we heuristically decide to add
     more tasks *)
447 448
  begin
    try
449
      for _i = Hashtbl.length prover_tasks_in_progress
450
          to S.multiplier * !session_max_tasks do
451 452
        let (c,id,pr,limit,proof_script,callback,cntexample,ores) =
          Queue.pop scheduled_proof_attempts in
453
        try
454
          build_prover_call ?proof_script ~cntexample c id pr limit callback ores
455 456 457 458 459
        with e when not (Debug.test_flag Debug.stack_trace) ->
          callback (InternalFailure e)
      done
  with Queue.Empty -> ()
  end;
460
  update_observer ();
461
  true
MARCHE Claude's avatar
MARCHE Claude committed
462

463
let interrupt () =
464 465 466 467 468 469 470
  (* Interrupt provers *)
  Hashtbl.iter (fun _k e ->
    let (_, _, _, callback, _, _, _) = e in callback Interrupted)
    prover_tasks_in_progress;
  Hashtbl.clear prover_tasks_in_progress;
  (* Do not interrupt editors
  while not (Queue.is_empty prover_tasks_edited) do
471
    let (_ses,_id,_pr,callback,_started,_call,_ores) =
472
      Queue.pop prover_tasks_edited in
473 474
    callback Interrupted
  done;
475
  *)
476 477
  number_of_running_provers := 0;
  while not (Queue.is_empty scheduled_proof_attempts) do
478 479
    let (_c,_id,_pr,_limit,_proof_script,callback,_cntexample,_ores) =
      Queue.pop scheduled_proof_attempts in
480 481 482 483
    callback Interrupted
  done;
  !observer 0 0 0

MARCHE Claude's avatar
MARCHE Claude committed
484 485 486 487
let run_timeout_handler () =
  if not !timeout_handler_running then
    begin
      timeout_handler_running := true;
488
      S.timeout ~ms:default_delay_ms timeout_handler;
MARCHE Claude's avatar
MARCHE Claude committed
489 490
    end

491 492 493 494
let schedule_proof_attempt c id pr
                           ~counterexmp ~limit ~callback ~notification =
  let ses = c.controller_session in
  let callback panid s =
495 496
    begin
      match s with
497
      | UpgradeProver _ -> ()
498 499 500 501 502 503 504 505
      | Scheduled ->
         Hpan.add c.controller_running_proof_attempts panid ();
         update_goal_node notification ses id
      | Running -> update_goal_node notification ses id
      | Done res ->
         Hpan.remove c.controller_running_proof_attempts panid;
         update_proof_attempt ~obsolete:false notification ses id pr res;
         update_goal_node notification ses id
506 507
      | Interrupted
      | InternalFailure _ ->
508 509 510 511 512
         Hpan.remove c.controller_running_proof_attempts panid;
         (* what to do ?
         update_proof_attempt ~obsolete:false notification ses id pr res;
          *)
         update_goal_node notification ses id
513 514
      | Detached -> assert false
      | Uninstalled _ -> assert false
515
      | Undone -> assert false
516
    end;
517 518 519
    callback panid s
  in
  let adaptlimit,ores,proof_script =
520
    try
521
      let h = get_proof_attempt_ids ses id in
522
      let pa = Hprover.find h pr in
523
      let a = get_proof_attempt_node ses pa in
524 525 526 527 528
      let old_res = a.proof_state in
      let config_pr,_ = Hprover.find c.controller_provers pr in
      let interactive = config_pr.Whyconf.interactive in
      let use_steps = Call_provers.(limit.limit_steps <> empty_limit.limit_steps) in
      let limit = adapt_limits ~interactive ~use_steps limit a in
529 530 531 532 533 534
      let script = Opt.map (fun s ->
                            Debug.dprintf debug_sched "Script file = %s@." s;
                            Filename.concat (get_dir ses) s) a.proof_script
      in
      limit, old_res, script
    with Not_found | Session_itp.BadID -> limit,None,None
535
  in
536
  let panid = graft_proof_attempt ~limit ses id pr in
537
  Queue.add (c,id,pr,adaptlimit,proof_script,callback panid,counterexmp,ores)
538
            scheduled_proof_attempts;
539
  callback panid Scheduled;
MARCHE Claude's avatar
MARCHE Claude committed
540
  run_timeout_handler ()
Clément Fumex's avatar
Clément Fumex committed
541

542

543 544


545 546
(*** { 2 edition of proof scripts} *)

Sylvain Dailler's avatar
Sylvain Dailler committed
547 548 549
(* create the path to a file for saving the external proof script *)
let create_file_rel_path c pr pn =
  let session = c.controller_session in
550
  let driver = snd (Hprover.find c.controller_provers pr) in
551
  let task = Session_itp.get_raw_task session pn in
Sylvain Dailler's avatar
Sylvain Dailler committed
552 553 554 555
  let session_dir = Session_itp.get_dir session in
  let th = get_encapsulating_theory session (APn pn) in
  let th_name = (Session_itp.theory_name th).Ident.id_string in
  let f = get_encapsulating_file session (ATh th) in
556
  let fn = Filename.chop_extension (Filename.basename (file_name f)) in
Sylvain Dailler's avatar
Sylvain Dailler committed
557 558 559 560 561 562
  let file = Driver.file_of_task driver fn th_name task in
  let file = Filename.concat session_dir file in
  let file = Sysutil.uniquify file in
  let file = Sysutil.relativize_filename session_dir file in
  file

563
let prepare_edition c ?file pn pr ~notification =
Sylvain Dailler's avatar
Sylvain Dailler committed
564
  let session = c.controller_session in
565 566 567
  let proof_attempts_id = get_proof_attempt_ids session pn in
  let panid =
    try
568 569 570 571 572 573 574 575 576 577 578 579 580 581
      let panid = Hprover.find proof_attempts_id pr in
      (* if no proof script yet, we need to add one
         it happens e.g when editing a file for an automatic prover
       *)
      let pa = get_proof_attempt_node session panid in
      match pa.proof_script with
      | None ->
         let file = match file with
           | Some f -> f
           | None -> create_file_rel_path c pr pn
         in
         set_proof_script pa file;
         panid
      | Some _ -> panid
582
    with Not_found ->
583 584 585 586
      let file = match file with
        | Some f -> f
        | None -> create_file_rel_path c pr pn
      in
587 588
      let limit = Call_provers.empty_limit in
      graft_proof_attempt session pn pr ~file ~limit
Sylvain Dailler's avatar
Sylvain Dailler committed
589
  in
590
  update_goal_node notification session pn;
591 592 593
  let pa = get_proof_attempt_node session panid in
  let file = Opt.get pa.proof_script in
  let session_dir = Session_itp.get_dir session in
Sylvain Dailler's avatar
Sylvain Dailler committed
594 595 596 597 598 599 600 601 602 603 604 605 606 607 608
  let file = Filename.concat session_dir file in
  let old =
    if Sys.file_exists file
    then
      begin
        let backup = file ^ ".bak" in
        if Sys.file_exists backup
        then Sys.remove backup;
        Sys.rename file backup;
        Some(open_in backup)
      end
    else None
  in
  let ch = open_out file in
  let fmt = formatter_of_out_channel ch in
609 610
  let task = Session_itp.get_raw_task session pn in
  let driver = snd (Hprover.find c.controller_provers pr) in
Sylvain Dailler's avatar
Sylvain Dailler committed
611 612 613
  Driver.print_task ~cntexample:false ?old driver fmt task;
  Opt.iter close_in old;
  close_out ch;
614
  panid,file
Sylvain Dailler's avatar
Sylvain Dailler committed
615 616 617

exception Editor_not_found

618
let schedule_edition c id pr ~callback ~notification =
Sylvain Dailler's avatar
Sylvain Dailler committed
619 620 621 622
  Debug.dprintf debug_sched "[Sched] Scheduling an edition@.";
  let config = c.controller_config in
  let session = c.controller_session in
  let prover_conf = Whyconf.get_prover_config config pr in
623
  (* Make sure editor exists. Fails otherwise *)
Sylvain Dailler's avatar
Sylvain Dailler committed
624 625
  let editor =
    match prover_conf.Whyconf.editor with
626
    | "" -> raise Editor_not_found
Sylvain Dailler's avatar
Sylvain Dailler committed
627
    | s ->
628 629 630 631 632
       try
         let ed = Whyconf.editor_by_id config s in
         String.concat " " (ed.Whyconf.editor_command ::
                              ed.Whyconf.editor_options)
       with Not_found -> raise Editor_not_found
Sylvain Dailler's avatar
Sylvain Dailler committed
633
  in
634
  let panid,file = prepare_edition c id pr ~notification in
635
  (* Notification node *)
636 637 638
  let callback panid s =
    begin
      match s with
639
      | UpgradeProver _ -> ()
640
      | Running -> ()
641 642
      | Done res ->
         (* set obsolete to true since we do not know if the manual
643
            proof was completed or not *)
644 645 646 647 648
         Debug.dprintf debug_sched
                       "Setting status of %a under parent %a to obsolete@."
                       print_proofAttemptID panid print_proofNodeID id;
         update_proof_attempt ~obsolete:true notification session id pr res;
         update_goal_node notification session id
649 650 651 652
      | Interrupted
      | InternalFailure _ ->
         update_goal_node notification session id
      | Undone | Detached | Uninstalled _ | Scheduled -> assert false
653 654
    end;
    callback panid s
655
  in
Sylvain Dailler's avatar
Sylvain Dailler committed
656
  Debug.dprintf debug_sched "[Editing] goal %s with command '%s' on file %s@."
657 658
                (Session_itp.get_proof_name session id).Ident.id_string
                editor file;
659 660
  let call = Call_provers.call_editor ~command:editor file in
  callback panid Running;
661
  Queue.add (c.controller_session,id,pr,callback panid,false,call,None)
662
            prover_tasks_edited;
663
  run_timeout_handler ()
664

665 666
(*** { 2 transformations} *)

667 668 669 670 671 672 673 674 675
let schedule_transformation c id name args ~callback ~notification =
  let callback s =
    begin match s with
          | TSdone tid -> update_trans_node notification c.controller_session tid
          | TSscheduled
          | TSfailed _ -> ()
    end;
    callback s
  in
676
  let apply_trans () =
677 678
    begin
      try
679 680 681
        let subtasks =
          apply_trans_to_goal ~allow_no_effect:false
                              c.controller_session c.controller_env name args id
682
        in
683 684 685 686 687 688
        let tid = graft_transf c.controller_session id name args subtasks in
        callback (TSdone tid)
      with
      | Exit ->
         (* if result is same as input task, consider it as a failure *)
         callback (TSfailed (id, Noprogress))
689
      | e when not (Debug.test_flag Debug.stack_trace) ->
690
          (* "@[Exception raised in Session_itp.apply_trans_to_goal %s:@ %a@.@]"
691
          name Exn_printer.exn_printer e; TODO *)
692
        callback (TSfailed (id, e))
693 694
    end;
    false
695 696 697
  in
  S.idle ~prio:0 apply_trans;
  callback TSscheduled
Clément Fumex's avatar
Clément Fumex committed
698

699 700 701

open Strategy

Sylvain Dailler's avatar
Sylvain Dailler committed
702
let run_strategy_on_goal
703
    c id strat ~counterexmp ~callback_pa ~callback_tr ~callback ~notification =
704 705 706 707 708 709
  let rec exec_strategy pc strat g =
    if pc < 0 || pc >= Array.length strat then
      callback STShalt
    else
      match Array.get strat pc with
      | Icall_prover(p,timelimit,memlimit) ->
MARCHE Claude's avatar
MARCHE Claude committed
710 711
         let callback panid res =
           callback_pa panid res;
712
           match res with
713
           | UpgradeProver _ | Scheduled | Running -> (* nothing to do yet *) ()
714 715 716
           | Done { Call_provers.pr_answer = Call_provers.Valid } ->
              (* proof succeeded, nothing more to do *)
              callback STShalt
717 718
           | Interrupted | InternalFailure _ ->
              callback STShalt
719 720 721 722 723
           | Done _ ->
              (* proof did not succeed, goto to next step *)
              callback (STSgoto (g,pc+1));
              let run_next () = exec_strategy (pc+1) strat g; false in
              S.idle ~prio:0 run_next
724
           | Undone | Detached | Uninstalled _ ->
725 726 727 728 729 730
                         (* should not happen *)
                         assert false
         in
         let limit = { Call_provers.empty_limit with
                       Call_provers.limit_time = timelimit;
                       limit_mem  = memlimit} in
731
         schedule_proof_attempt c g p ~counterexmp ~limit ~callback ~notification
732 733
      | Itransform(trname,pcsuccess) ->
         let callback ntr =
734
           callback_tr trname [] ntr;
735
           match ntr with
736
           | TSfailed _e -> (* transformation failed *)
737 738 739 740 741 742 743 744 745 746 747 748
              callback (STSgoto (g,pc+1));
              let run_next () = exec_strategy (pc+1) strat g; false in
              S.idle ~prio:0 run_next
           | TSscheduled -> ()
           | TSdone tid ->
              List.iter
                (fun g ->
                 callback (STSgoto (g,pcsuccess));
                 let run_next () =
                   exec_strategy pcsuccess strat g; false
                 in
                 S.idle ~prio:0 run_next)
MARCHE Claude's avatar
MARCHE Claude committed
749
                (get_sub_tasks c.controller_session tid)
750
         in
751
         schedule_transformation c g trname [] ~callback ~notification
752 753 754 755 756 757
      | Igoto pc ->
         callback (STSgoto (g,pc));
         exec_strategy pc strat g
  in
  exec_strategy 0 strat id

Sylvain Dailler's avatar
Sylvain Dailler committed
758 759
let schedule_pa_with_same_arguments
    c (pa: proof_attempt_node) (pn: proofNodeID) ~callback ~notification =
Sylvain Dailler's avatar
Sylvain Dailler committed
760 761 762 763
  let prover = pa.prover in
  let limit = pa.limit in
  schedule_proof_attempt c pn prover ~limit ~callback ~notification

Sylvain Dailler's avatar
Sylvain Dailler committed
764 765
let schedule_tr_with_same_arguments
    c (tr: transID) (pn: proofNodeID) ~callback ~notification =
Sylvain Dailler's avatar
Sylvain Dailler committed
766 767 768
  let s = c.controller_session in
  let args = get_transf_args s tr in
  let name = get_transf_name s tr in
769
  let callback = callback name args in
Sylvain Dailler's avatar
Sylvain Dailler committed
770 771
  schedule_transformation c pn name args ~callback ~notification

MARCHE Claude's avatar
MARCHE Claude committed
772 773 774 775 776
let proof_is_complete pa =
  match pa.Session_itp.proof_state with
  | None -> false
  | Some pr ->
     not pa.Session_itp.proof_obsolete &&
777
       Call_provers.(pr.pr_answer = Valid)
MARCHE Claude's avatar
MARCHE Claude committed
778

779

Sylvain Dailler's avatar
Sylvain Dailler committed
780
let clean c ~removed nid =
781

782 783
  (* clean should not change proved status *)
  let notification _ = assert false in
784
  let s = c.controller_session in
785
  (* This function is applied on leafs first for the case of removes *)
786 787 788
  let clean_aux () any =
    match any with
    | APa pa ->
789 790
        let pa = Session_itp.get_proof_attempt_node s pa in
        if pn_proved s pa.parent then
MARCHE Claude's avatar
MARCHE Claude committed
791
          if not (proof_is_complete pa) then
792
            remove_subtree ~notification ~removed c any
793
      | ATn tn ->
794 795
        let pn = get_trans_parent s tn in
        if pn_proved s pn && not (tn_proved s tn) then
796
          remove_subtree ~notification ~removed c (ATn tn)
797 798 799 800 801 802 803 804
      | _ -> ()
  in

  match nid with
  | Some nid ->
      Session_itp.fold_all_any s clean_aux () nid
  | None ->
      Session_itp.fold_all_session s clean_aux ()
805

806 807
(* This function folds on any subelements of given node and tries to mark all
   proof attempts it encounters *)
808
let mark_as_obsolete ~notification c any =
809
  let s = c.controller_session in
810
  (* Case for proof attempt only *)
811
  let mark_as_obsolete_pa n =
812 813
    let parent = get_proof_attempt_parent s n in
    Session_itp.mark_obsolete s n;
814
    notification (APa n);
815
    update_goal_node notification s parent
816
  in
817 818 819 820 821 822 823 824 825 826
  match any with
  | Some any ->
      fold_all_any s
        (fun () any -> match any with
        | APa n -> mark_as_obsolete_pa n
        | _ -> ()) () any
  | None ->
      session_iter_proof_attempt
        (fun pa _pan ->
          mark_as_obsolete_pa pa) s
827

Sylvain Dailler's avatar
Sylvain Dailler committed
828 829 830 831 832 833 834 835 836 837 838 839 840 841
exception BadCopyPaste

(* Reproduce the transformation made on node on an other one *)
let rec copy_paste ~notification ~callback_pa ~callback_tr c from_any to_any =
  let s = c.controller_session in
  if (not (is_below s from_any to_any) &&
      not (is_below s to_any from_any)) then
    match from_any, to_any with
    | AFile _, AFile _ ->
        raise BadCopyPaste
    | ATh _from_th, ATh _to_th ->
        raise BadCopyPaste
    | APn from_pn, APn to_pn ->
      let from_pa_list = get_proof_attempts s from_pn in
842
      List.iter (fun x -> schedule_pa_with_same_arguments c x to_pn ~counterexmp:false
Sylvain Dailler's avatar
Sylvain Dailler committed
843 844
          ~callback:callback_pa ~notification) from_pa_list;
      let from_tr_list = get_transformations s from_pn in
845
      let callback x tr args st = callback_tr tr args st;
Sylvain Dailler's avatar
Sylvain Dailler committed
846
        match st with
Sylvain Dailler's avatar
Sylvain Dailler committed
847 848
        | TSdone tid ->
          copy_paste c (ATn x) (ATn tid) ~notification ~callback_pa ~callback_tr
Sylvain Dailler's avatar
Sylvain Dailler committed
849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868
        | _ -> ()
      in
      List.iter (fun x -> schedule_tr_with_same_arguments c x to_pn
          ~callback:(callback x) ~notification) from_tr_list
    | ATn from_tn, ATn to_tn ->
        let from_tn_list = get_sub_tasks s from_tn in
        let to_tn_list = get_sub_tasks s to_tn in
        if (List.length from_tn_list = List.length to_tn_list) then
          List.iter2 (fun x y -> copy_paste c (APn x) (APn y)
              ~notification ~callback_pa ~callback_tr) from_tn_list to_tn_list
    | _ -> raise BadCopyPaste


let copy_detached ~copy c from_any =
  match from_any with
  | APn from_pn ->
    begin
      let pn_id = copy_proof_node_as_detached c.controller_session from_pn in
      let parent = get_any_parent c.controller_session from_any in
      match parent with
869
      | None -> raise (BadCopyDetached "copy_detached no parent")
Sylvain Dailler's avatar
Sylvain Dailler committed
870 871
      | Some parent ->
          copy ~parent (APn pn_id);
Sylvain Dailler's avatar
Sylvain Dailler committed
872 873
          copy_structure
            ~notification:copy c.controller_session (APn from_pn) (APn pn_id)
Sylvain Dailler's avatar
Sylvain Dailler committed
874
    end
875 876
  (* Only goal can be detached *)
  | _ -> raise (BadCopyDetached "copy_detached. Can only copy goal")
Sylvain Dailler's avatar
Sylvain Dailler committed
877

MARCHE Claude's avatar
MARCHE Claude committed
878 879 880 881 882 883 884 885 886 887 888







(***************** {2 replay} ****************)



889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936
let find_prover notification c goal_id pr =
  if Hprover.mem c.controller_provers pr then Some pr else
   match Whyconf.get_prover_upgrade_policy c.controller_config pr with
   | exception Not_found -> None
   | Whyconf.CPU_keep -> None
   | Whyconf.CPU_upgrade new_pr ->
      (* does a proof using new_pr already exists ? *)
      if Hprover.mem (get_proof_attempt_ids c.controller_session goal_id) new_pr
      then (* yes, then we do nothing *)
        None
      else
        begin
          (* we modify the prover in-place *)
          Session_itp.change_prover notification c.controller_session goal_id pr new_pr;
          Some new_pr
        end
   | Whyconf.CPU_duplicate _new_pr ->
      assert false (* TODO *)
(*
      (* does a proof using new_p already exists ? *)
      if Hprover.mem (goal_external_proofs parid) new_pr
      then (* yes, then we do nothing *)
        None
      else
        begin
          (* we duplicate the proof_attempt *)
          let new_a = copy_external_proof
                        ~notify ~keygen:O.create ~prover:new_p ~env_session:eS a
          in
          Some new_pr
        end
*)

let replay_proof_attempt c pr limit (parid: proofNodeID) id ~callback ~notification =
  (* The replay can be done on a different machine so we need
     to check more things before giving the attempt to the scheduler *)
  match find_prover notification c parid pr with
  | None -> callback id (Uninstalled pr)
  | Some pr' ->
     try
       if pr' <> pr then callback id (UpgradeProver pr');
       let _ = get_raw_task c.controller_session parid in
       schedule_proof_attempt c parid pr' ~counterexmp:false ~limit ~callback ~notification
     with Not_found ->
       callback id Detached



937 938 939 940
type report =
  | Result of Call_provers.prover_result * Call_provers.prover_result
  (** Result(new_result,old_result) *)
  | CallFailed of exn
941
  | Replay_interrupted
942 943 944 945 946 947 948 949 950 951 952
  | Prover_not_installed
  | Edited_file_absent of string
  | No_former_result of Call_provers.prover_result

(* TODO find a better way to print it *)
let print_report fmt (r: report) =
  match r with
  | Result (new_r, old_r) ->
    Format.fprintf fmt "new_result = %a, old_result = %a@."
      Call_provers.print_prover_result new_r
      Call_provers.print_prover_result old_r
953 954 955 956
  | CallFailed e ->
    Format.fprintf fmt "Callfailed %a@." Exn_printer.exn_printer e
  | Replay_interrupted ->
    Format.fprintf fmt "Interrupted@."
957 958 959 960 961 962 963 964 965
  | Prover_not_installed ->
    Format.fprintf fmt "Prover not installed@."
  | Edited_file_absent _ ->
    Format.fprintf fmt "No edited file@."
  | No_former_result new_r ->
    Format.fprintf fmt "new_result = %a, no former result@."
      Call_provers.print_prover_result new_r

(* TODO to be removed when we have a better way to print *)
966
let replay_print fmt (lr: (proofNodeID * Whyconf.prover * Call_provers.resource_limit * report) list) =
967 968
  let pp_elem fmt (id, pr, rl, report) =
    fprintf fmt "ProofNodeID: %d, Prover: %a, Timelimit?: %d, Result: %a@."
Sylvain Dailler's avatar
Sylvain Dailler committed
969 970
      (Obj.magic id) Whyconf.print_prover pr
      rl.Call_provers.limit_time print_report report
971
  in
972
  Format.fprintf fmt "%a@." (Pp.print_list Pp.newline pp_elem) lr
973

974
let replay ~valid_only ~obsolete_only ?(use_steps=false)
Sylvain Dailler's avatar
Sylvain Dailler committed
975
           c ~callback ~notification ~final_callback ~any =
976

977
  let craft_report count s r id pr limits pa =
978
    match s with
979
    | UpgradeProver _ | Scheduled | Running -> ()
980
    | Undone | Interrupted ->
981
       decr count;
982
       r := (id, pr, limits, Replay_interrupted ) :: !r
983
    | Done new_r ->
984
       decr count;
985 986 987 988
        (match pa.Session_itp.proof_state with
        | None -> (r := (id, pr, limits, No_former_result new_r) :: !r)
        | Some old_r -> r := (id, pr, limits, Result (new_r, old_r)) :: !r)
    | InternalFailure e ->
989
       decr count;
990
        r := (id, pr, limits, CallFailed (e)) :: !r
991 992 993
    | Uninstalled _ ->
       decr count;
       r := (id, pr, limits, Prover_not_installed) :: !r;
994
    | Detached -> decr count
995
  in
996

997 998 999 1000 1001 1002 1003 1004
  let need_replay pa =
    (pa.proof_obsolete || not obsolete_only) &&
      (not valid_only ||
         match pa.Session_itp.proof_state with
         | None -> false
         | Some pr -> Call_provers.(pr.pr_answer = Valid))
  in

1005 1006 1007 1008 1009 1010
  let session = c.controller_session in
  let count = ref 0 in
  let report = ref [] in

  (* TODO count the number of node in a more efficient way *)
  (* Counting the number of proof_attempt to print report only once *)
Sylvain Dailler's avatar
Sylvain Dailler committed
1011 1012 1013
  (match any with
  | None ->
      Session_itp.session_iter_proof_attempt
1014
        (fun _ pa -> if need_replay pa then incr count) session
Sylvain Dailler's avatar
Sylvain Dailler committed
1015 1016
  | Some nid ->
      Session_itp.any_iter_proof_attempt session
1017
        (fun _ pa -> if need_replay pa then incr count) nid);
1018 1019

  (* Replaying function *)
1020
  let replay_pa id pa =
1021
    if need_replay pa then
1022 1023 1024
      begin
        let parid = pa.parent in
        let pr = pa.prover in
1025 1026 1027 1028
        (* TODO: if pr is not installed, lookup for a replacement policy
         OR: delegate this work to the replay_proof_attempt function *)
        (* If use_steps, we give only steps as a limit
         TODO: steps should not be used if prover was replaced above *)
1029 1030 1031 1032 1033 1034
        let limit =
          if use_steps then
            Call_provers.{empty_limit with limit_steps = pa.limit.limit_steps}
          else
            Call_provers.{ pa.limit with limit_steps = empty_limit.limit_steps }
        in
1035
        replay_proof_attempt c pr limit parid id
1036 1037 1038 1039 1040 1041
                             ~callback:(fun id s ->
                                        craft_report count s report parid pr limit pa;
                                        callback id s;
                                        if !count = 0 then final_callback !report)
                             ~notification
      end in
1042

1043
  if !count = 0 then final_callback !report else
1044
  (* Calling replay on all the proof_attempts of the session *)
Sylvain Dailler's avatar
Sylvain Dailler committed
1045 1046 1047
  match any with
  | None -> Session_itp.session_iter_proof_attempt replay_pa session
  | Some nid -> Session_itp.any_iter_proof_attempt session replay_pa nid
1048

MARCHE Claude's avatar
MARCHE Claude committed
1049 1050 1051 1052 1053 1054 1055 1056 1057



(*************** bisect **********)



let debug = Debug.register_flag ~desc:"Task bisection" "bisect"

1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072
let create_rem_list =
  let b = Buffer.create 17 in
  fun rem ->
  Buffer.clear b;
  let add pr id =
    if Buffer.length b > 0 then Buffer.add_char b ',';
    Buffer.add_string b (Pp.string_of pr id)
  in
  let remove_ts ts = add Pretty.print_ts ts in
  let remove_ls ls = add Pretty.print_ls ls in
  let remove_pr pr = add Pretty.print_pr pr in
  Ty.Sts.iter remove_ts rem.Eliminate_definition.rem_ts;
  Term.Sls.iter remove_ls rem.Eliminate_definition.rem_ls;
  Decl.Spr.iter remove_pr rem.Eliminate_definition.rem_pr;
  Buffer.contents b
MARCHE Claude's avatar
MARCHE Claude committed
1073 1074


1075
let bisect_proof_attempt ~callback_tr ~callback_pa ~notification ~removed c pa_id =
MARCHE Claude's avatar
MARCHE Claude committed
1076 1077
  let ses = c.controller_session in
  let pa = get_proof_attempt_node ses pa_id in
MARCHE Claude's avatar
MARCHE Claude committed
1078 1079
  if not (proof_is_complete pa) then
    invalid_arg "bisect: proof attempt should be valid";
MARCHE Claude's avatar
MARCHE Claude committed
1080 1081 1082 1083 1084 1085
  let goal_id = pa.parent in
  let prover = pa.prover in
  let limit = { pa.limit with
                Call_provers.limit_steps =
                  Call_provers.empty_limit.Call_provers.limit_steps }
  in
1086
  let timelimit = ref limit.Call_provers.limit_time in
MARCHE Claude's avatar
MARCHE Claude committed
1087 1088
  let set_timelimit res =
    timelimit := 1 + (int_of_float (floor res.Call_provers.pr_time)) in
MARCHE Claude's avatar
MARCHE Claude committed
1089 1090 1091 1092 1093 1094 1095 1096 1097 1098
  let bisect_end rem =
    if Decl.Spr.is_empty rem.Eliminate_definition.rem_pr &&
         Term.Sls.is_empty rem.Eliminate_definition.rem_ls &&
           Ty.Sts.is_empty rem.Eliminate_definition.rem_ts
    then
      Debug.dprintf debug "Bisecting didn't reduce the task.@."
    else
      begin
        Debug.dprintf debug "Bisecting done.@.";
        (* apply again the transformation *)
1099 1100 1101 1102
        let rem = create_rem_list rem in
        let callback st =
          callback_tr "remove" [rem] st;
          begin match st with
MARCHE Claude's avatar
MARCHE Claude committed
1103 1104 1105 1106 1107 1108
          | TSscheduled -> ()
          | TSfailed _ -> assert false
          | TSdone trid ->
             match get_sub_tasks ses trid with
             | [pn] ->
                let limit = { limit with Call_provers.limit_time = !timelimit; } in
1109 1110 1111
                let callback paid st =
                  callback_pa paid st;
                  begin match st with
1112
                  | UpgradeProver _ | Scheduled | Running -> ()
MARCHE Claude's avatar
MARCHE Claude committed
1113
                  | Detached | Uninstalled _ -> assert false
1114
                  | Undone | Interrupted -> Debug.dprintf debug "Bisecting interrupted.@."
MARCHE Claude's avatar
MARCHE Claude committed
1115 1116 1117 1118 1119 1120 1121
                  | InternalFailure exn ->
                     (* Perhaps the test can be considered false in this case? *)
                     Debug.dprintf debug "Bisecting interrupted by an error %a.@."
                                   Exn_printer.exn_printer exn
                  | Done res ->
                     assert (res.Call_provers.pr_answer = Call_provers.Valid);
                     Debug.dprintf debug "Bisecting: %a.@."
1122 1123
                                   Call_provers.print_prover_result res
                  end
MARCHE Claude's avatar
MARCHE Claude committed
1124 1125 1126
                in
                schedule_proof_attempt c pn prover ~counterexmp:false ~limit ~callback ~notification
             | _ -> assert false
1127
          end
MARCHE Claude's avatar
MARCHE Claude committed
1128
        in
1129 1130
        Debug.dprintf debug "To remove: %s@." rem;
        schedule_transformation c goal_id "remove" [rem] ~callback ~notification
MARCHE Claude's avatar
MARCHE Claude committed
1131
      end
MARCHE Claude's avatar
MARCHE Claude committed
1132
  in
MARCHE Claude's avatar
MARCHE Claude committed
1133 1134 1135 1136 1137 1138 1139 1140 1141 1142
  let rec bisect_step rem kont =
    (* we have to:
       1) apply transformation remove with the given rem
       2) on the generated sub-goal, run the prover with some callback
       3) the callback should :
          compute (next_iter success_value)
          if result is done, do nothing more
          if result is some new rem, remove the previous transformation
           and recursively call bisect_step
     *)
1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153
    let rem = create_rem_list rem in
    let callback st =
      callback_tr "remove" [rem] st;
      begin match st with
      | TSscheduled ->
         Debug.dprintf
           debug
           "[Bisect] transformation 'remove' scheduled@."
      | TSfailed(_,exn) ->
         (* may happen if removing a type or a lsymbol that is used
later on. We do has if proof fails. *)
MARCHE Claude's avatar
MARCHE Claude committed
1154
         begin
1155 1156 1157
           Debug.dprintf
             debug
             "[Bisect] transformation failed %a@." Exn_printer.exn_printer exn;
MARCHE Claude's avatar
MARCHE Claude committed
1158 1159 1160 1161 1162 1163 1164
           match kont false with
           | Eliminate_definition.BSstep (rem,kont) ->
              bisect_step rem kont
           | Eliminate_definition.BSdone rem ->
              bisect_end rem
         end
      | TSdone trid ->
1165 1166 1167
         Debug.dprintf
           debug
           "[Bisect] transformation 'remove' succeeds@.";
MARCHE Claude's avatar
MARCHE Claude committed
1168 1169 1170
         match get_sub_tasks ses trid with
         | [pn] ->
            let limit = { limit with Call_provers.limit_time = !timelimit; } in
1171 1172
            let callback paid st =
              callback_pa paid st;
1173 1174 1175
              begin
              match st with
              | UpgradeProver _ -> ()
1176 1177 1178 1179 1180 1181 1182 1183
              | Scheduled ->
                 Debug.dprintf
                   debug "[Bisect] prover on subtask is scheduled@."
              | Running ->
                 Debug.dprintf
                   debug "[Bisect] prover on subtask is running@.";
              | Detached
              | Uninstalled _ -> assert false
1184
              | Undone | Interrupted -> Debug.dprintf debug "Bisecting interrupted.@."
MARCHE Claude's avatar
MARCHE Claude committed
1185 1186
              | InternalFailure exn ->
                 (* Perhaps the test can be considered false in this case? *)
1187
                 Debug.dprintf debug "[Bisect] prover interrupted by an error: %a.@."
MARCHE Claude's avatar
MARCHE Claude committed
1188 1189
                               Exn_printer.exn_printer exn
              | Done res ->
1190 1191 1192
                 Debug.dprintf
                   debug "[Bisect] prover on subtask returns %a@."
                   Call_provers.print_prover_answer res.Call_provers.pr_answer;
MARCHE Claude's avatar
MARCHE Claude committed
1193 1194 1195 1196
                 let b = res.Call_provers.pr_answer = Call_provers.Valid in
                 if b then set_timelimit res;
                 match kont b with
                 | Eliminate_definition.BSstep (rem,kont) ->
1197
                    Session_itp.remove_subtree ~notification ~removed ses (Session_itp.ATn trid);
MARCHE Claude's avatar
MARCHE Claude committed
1198 1199 1200
                    bisect_step rem kont
                 | Eliminate_definition.BSdone rem ->
                    bisect_end rem
1201
              end
MARCHE Claude's avatar
MARCHE Claude committed
1202
            in
1203 1204