controller_itp.ml 42.7 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
       List.fold_right
         (fun g -> n (Goal g))
         (theory_goals th)
MARCHE Claude's avatar
MARCHE Claude committed
185
         []
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
       let sts = get_sub_tasks s id in
       name,
MARCHE Claude's avatar
MARCHE Claude committed
207
       List.fold_right (fun g -> n (Goal g)) sts []
208 209 210 211 212 213 214 215 216 217 218 219

end

module P = Print_tree.PMake(PSession)

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

(*********)



220 221 222 223 224 225

(** 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 *)

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

let add_file c ?format fname =
239 240 241 242 243 244 245 246
  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

247

248 249

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

256 257
module Make(S : Scheduler) = struct

MARCHE Claude's avatar
MARCHE Claude committed
258 259
let scheduled_proof_attempts = Queue.create ()

260 261 262 263 264 265
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
266 267 268

let timeout_handler_running = ref false

269

MARCHE Claude's avatar
MARCHE Claude committed
270
let number_of_running_provers = ref 0
271

272 273 274 275
let observer = ref (fun _ _ _ -> ())

let register_observer = (:=) observer

276
module Hprover = Whyconf.Hprover
MARCHE Claude's avatar
MARCHE Claude committed
277

278 279 280 281 282 283 284 285 286 287 288 289 290
(* 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
291
    let steplimit = limits.Call_provers.limit_steps in
292 293 294 295 296 297 298 299
    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
300
       let increased_time = if interactive then 0
301 302 303 304 305
                            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
306 307
         | Call_provers.OutOfMemory -> increased_time, memlimit, steplimit
         | Call_provers.Timeout -> timelimit, increased_mem, steplimit
308 309
         | Call_provers.Valid ->
            let steplimit =
310 311 312 313 314 315 316 317 318
              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
319 320 321 322
            in
            increased_time, increased_mem, steplimit
         | Call_provers.Unknown _
         | Call_provers.StepLimitExceeded
323
         | Call_provers.Invalid -> increased_time, increased_mem, steplimit
324 325 326
         | Call_provers.Failure _
         | Call_provers.HighFailure ->
            (* correct ? failures are supposed to appear quickly anyway... *)
327
            timelimit, memlimit, steplimit
328 329
       end
    | None when interactive -> 0, 0, 0
330
    | None -> timelimit, memlimit, steplimit
331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352
  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 =
353
  let (config_pr,driver) = Hprover.find c.controller_provers pr in
354
  let with_steps = Call_provers.(limit.limit_steps <> empty_limit.limit_steps) in
355
  let command =
356
    Whyconf.get_complete_command config_pr ~with_steps in
357 358
  try
    let task = Session_itp.get_raw_task c.controller_session id in
359 360 361
    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
362 363 364 365 366 367 368 369 370
    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)
371 372
  with Not_found (* goal has no task, it is detached *) ->
       callback Detached
MARCHE Claude's avatar
MARCHE Claude committed
373

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

MARCHE Claude's avatar
MARCHE Claude committed
380 381
let timeout_handler () =
  (* examine all the prover tasks in progress *)
382 383 384
  (* 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
385
    let results = Call_provers.get_new_results ~blocking:S.blocking in
386 387 388 389
    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
390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412
        | 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))
413 414 415 416 417 418
        end
      | exception Not_found -> ()
        (* We probably received ProverStarted after ProverFinished,
           because what is sent to and received from the server is
           not ordered. *)
    ) results;
419 420
  end;

421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440
  (* 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;
441 442

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

461
let interrupt () =
462 463 464 465 466 467 468
  (* 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
469
    let (_ses,_id,_pr,callback,_started,_call,_ores) =
470
      Queue.pop prover_tasks_edited in
471 472
    callback Interrupted
  done;
473
  *)
474 475
  number_of_running_provers := 0;
  while not (Queue.is_empty scheduled_proof_attempts) do
476 477
    let (_c,_id,_pr,_limit,_proof_script,callback,_cntexample,_ores) =
      Queue.pop scheduled_proof_attempts in
478 479 480 481
    callback Interrupted
  done;
  !observer 0 0 0

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

489 490 491 492
let schedule_proof_attempt c id pr
                           ~counterexmp ~limit ~callback ~notification =
  let ses = c.controller_session in
  let callback panid s =
493 494
    begin
      match s with
495
      | UpgradeProver _ -> ()
496 497 498 499 500 501 502 503
      | 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
504 505
      | Interrupted
      | InternalFailure _ ->
506 507 508 509 510
         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
511 512
      | Detached -> assert false
      | Uninstalled _ -> assert false
513
      | Undone -> assert false
514
    end;
515 516 517
    callback panid s
  in
  let adaptlimit,ores,proof_script =
518
    try
519
      let h = get_proof_attempt_ids ses id in
520
      let pa = Hprover.find h pr in
521
      let a = get_proof_attempt_node ses pa in
522 523 524 525 526
      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
527 528 529 530 531 532
      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
533
  in
534
  let panid = graft_proof_attempt ~limit ses id pr in
535
  Queue.add (c,id,pr,adaptlimit,proof_script,callback panid,counterexmp,ores)
536
            scheduled_proof_attempts;
537
  callback panid Scheduled;
MARCHE Claude's avatar
MARCHE Claude committed
538
  run_timeout_handler ()
Clément Fumex's avatar
Clément Fumex committed
539

540

541 542


543 544
(*** { 2 edition of proof scripts} *)

Sylvain Dailler's avatar
Sylvain Dailler committed
545 546 547
(* 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
548
  let driver = snd (Hprover.find c.controller_provers pr) in
549
  let task = Session_itp.get_raw_task session pn in
Sylvain Dailler's avatar
Sylvain Dailler committed
550 551 552 553
  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
554
  let fn = Filename.chop_extension (Filename.basename (file_name f)) in
Sylvain Dailler's avatar
Sylvain Dailler committed
555 556 557 558 559 560
  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

561
let prepare_edition c ?file pn pr ~notification =
Sylvain Dailler's avatar
Sylvain Dailler committed
562
  let session = c.controller_session in
563 564 565
  let proof_attempts_id = get_proof_attempt_ids session pn in
  let panid =
    try
566 567 568 569 570 571 572 573 574 575 576 577 578 579
      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
580
    with Not_found ->
581 582 583 584
      let file = match file with
        | Some f -> f
        | None -> create_file_rel_path c pr pn
      in
585 586
      let limit = Call_provers.empty_limit in
      graft_proof_attempt session pn pr ~file ~limit
Sylvain Dailler's avatar
Sylvain Dailler committed
587
  in
588
  update_goal_node notification session pn;
589 590 591
  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
592 593 594 595 596 597 598 599 600 601 602 603 604 605 606
  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
607 608
  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
609 610 611
  Driver.print_task ~cntexample:false ?old driver fmt task;
  Opt.iter close_in old;
  close_out ch;
612
  panid,file
Sylvain Dailler's avatar
Sylvain Dailler committed
613 614 615

exception Editor_not_found

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

663 664
(*** { 2 transformations} *)

665 666 667 668 669 670 671 672 673
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
674
  let apply_trans () =
675 676
    begin
      try
677 678 679
        let subtasks =
          apply_trans_to_goal ~allow_no_effect:false
                              c.controller_session c.controller_env name args id
680
        in
681 682 683 684 685 686
        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))
687
      | e when not (Debug.test_flag Debug.stack_trace) ->
688
          (* "@[Exception raised in Session_itp.apply_trans_to_goal %s:@ %a@.@]"
689
          name Exn_printer.exn_printer e; TODO *)
690
        callback (TSfailed (id, e))
691 692
    end;
    false
693 694 695
  in
  S.idle ~prio:0 apply_trans;
  callback TSscheduled
Clément Fumex's avatar
Clément Fumex committed
696

697 698 699

open Strategy

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

Sylvain Dailler's avatar
Sylvain Dailler committed
756 757
let schedule_pa_with_same_arguments
    c (pa: proof_attempt_node) (pn: proofNodeID) ~callback ~notification =
Sylvain Dailler's avatar
Sylvain Dailler committed
758 759 760 761
  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
762 763
let schedule_tr_with_same_arguments
    c (tr: transID) (pn: proofNodeID) ~callback ~notification =
Sylvain Dailler's avatar
Sylvain Dailler committed
764 765 766
  let s = c.controller_session in
  let args = get_transf_args s tr in
  let name = get_transf_name s tr in
767
  let callback = callback name args in
Sylvain Dailler's avatar
Sylvain Dailler committed
768 769
  schedule_transformation c pn name args ~callback ~notification

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

777

Sylvain Dailler's avatar
Sylvain Dailler committed
778
let clean c ~removed nid =
779

780 781
  (* clean should not change proved status *)
  let notification _ = assert false in
782
  let s = c.controller_session in
783
  (* This function is applied on leafs first for the case of removes *)
784
  let clean_aux () any =
785 786 787 788 789 790
    let do_remove =
      Session_itp.is_detached s any ||
      match any with
      | APa pa ->
         let pa = Session_itp.get_proof_attempt_node s pa in
         pn_proved s pa.parent && not (proof_is_complete pa)
791
      | ATn tn ->
792 793 794 795 796 797
         let pn = get_trans_parent s tn in
         pn_proved s pn && not (tn_proved s tn)
      | _ -> false
    in
    if do_remove then
      remove_subtree ~notification ~removed c any
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
        | _ -> ()
      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


MARCHE Claude's avatar
MARCHE Claude committed
862 863 864 865 866 867 868 869 870





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



871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 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
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



919 920 921 922
type report =
  | Result of Call_provers.prover_result * Call_provers.prover_result
  (** Result(new_result,old_result) *)
  | CallFailed of exn
923
  | Replay_interrupted
924 925 926 927 928 929 930 931 932 933 934
  | 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
935 936 937 938
  | CallFailed e ->
    Format.fprintf fmt "Callfailed %a@." Exn_printer.exn_printer e
  | Replay_interrupted ->
    Format.fprintf fmt "Interrupted@."
939 940 941 942 943 944 945 946 947
  | 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 *)
948
let replay_print fmt (lr: (proofNodeID * Whyconf.prover * Call_provers.resource_limit * report) list) =
949 950
  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
951 952
      (Obj.magic id) Whyconf.print_prover pr
      rl.Call_provers.limit_time print_report report
953
  in
954
  Format.fprintf fmt "%a@." (Pp.print_list Pp.newline pp_elem) lr
955

956
let replay ~valid_only ~obsolete_only ?(use_steps=false)
Sylvain Dailler's avatar
Sylvain Dailler committed
957
           c ~callback ~notification ~final_callback ~any =
958

959
  let craft_report count s r id pr limits pa =
960
    match s with
961
    | UpgradeProver _ | Scheduled | Running -> ()
962
    | Undone | Interrupted ->
963
       decr count;
964
       r := (id, pr, limits, Replay_interrupted ) :: !r
965
    | Done new_r ->
966
       decr count;
967 968 969 970
        (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 ->
971
       decr count;
972
        r := (id, pr, limits, CallFailed (e)) :: !r
973 974 975
    | Uninstalled _ ->
       decr count;
       r := (id, pr, limits, Prover_not_installed) :: !r;
976
    | Detached -> decr count
977
  in
978

979 980 981 982 983 984 985 986
  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

987 988 989 990 991 992
  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
993 994 995
  (match any with
  | None ->
      Session_itp.session_iter_proof_attempt
996
        (fun _ pa -> if need_replay pa then incr count) session
Sylvain Dailler's avatar
Sylvain Dailler committed
997 998
  | Some nid ->
      Session_itp.any_iter_proof_attempt session
999
        (fun _ pa -> if need_replay pa then incr count) nid);
1000 1001

  (* Replaying function *)
1002
  let replay_pa id pa =
1003
    if need_replay pa then
1004 1005 1006
      begin
        let parid = pa.parent in
        let pr = pa.prover in
1007 1008 1009 1010
        (* 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 *)
1011 1012 1013 1014 1015 1016
        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
1017
        replay_proof_attempt c pr limit parid id
1018 1019 1020 1021 1022 1023
                             ~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
1024

1025
  if !count = 0 then final_callback !report else
1026
  (* Calling replay on all the proof_attempts of the session *)
Sylvain Dailler's avatar
Sylvain Dailler committed
1027 1028 1029
  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
1030

MARCHE Claude's avatar
MARCHE Claude committed
1031 1032 1033 1034 1035 1036 1037 1038 1039



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



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

1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054
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
1055 1056


1057
let bisect_proof_attempt ~callback_tr ~callback_pa ~notification ~removed c pa_id =
MARCHE Claude's avatar
MARCHE Claude committed
1058 1059
  let ses = c.controller_session in
  let pa = get_proof_attempt_node ses pa_id in
MARCHE Claude's avatar
MARCHE Claude committed
1060 1061
  if not (proof_is_complete pa) then
    invalid_arg "bisect: proof attempt should be valid";
MARCHE Claude's avatar
MARCHE Claude committed
1062 1063 1064 1065 1066 1067
  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
1068
  let timelimit = ref limit.Call_provers.limit_time in
MARCHE Claude's avatar
MARCHE Claude committed
1069 1070
  let set_timelimit res =
    timelimit := 1 + (int_of_float (floor res.Call_provers.pr_time)) in
MARCHE Claude's avatar
MARCHE Claude committed
1071 1072 1073 1074 1075 1076 1077 1078 1079 1080
  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 *)
1081 1082 1083 1084
        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
1085 1086 1087 1088 1089 1090
          | TSscheduled -> ()
          | TSfailed _ -> assert false
          | TSdone trid ->
             match get_sub_tasks ses trid with
             | [pn] ->
                let limit = { limit with Call_provers.limit_time = !timelimit; } in
1091 1092 1093
                let callback paid st =
                  callback_pa paid st;
                  begin match st with
1094
                  | UpgradeProver _ | Scheduled | Running -> ()
MARCHE Claude's avatar
MARCHE Claude committed
1095
                  | Detached | Uninstalled _ -> assert false
1096
                  | Undone | Interrupted -> Debug.dprintf debug "Bisecting interrupted.@."
MARCHE Claude's avatar
MARCHE Claude committed
1097 1098 1099 1100 1101 1102 1103
                  | 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.@."
1104 1105
                                   Call_provers.print_prover_result res
                  end
MARCHE Claude's avatar
MARCHE Claude committed
1106 1107 1108
                in
                schedule_proof_attempt c pn prover ~counterexmp:false ~limit ~callback ~notification
             | _ -> assert false
1109
          end
MARCHE Claude's avatar
MARCHE Claude committed
1110
        in
1111 1112
        Debug.dprintf debug "To remove: %s@." rem;
        schedule_transformation c goal_id "remove" [rem] ~callback ~notification
MARCHE Claude's avatar
MARCHE Claude committed
1113
      end
MARCHE Claude's avatar
MARCHE Claude committed
1114
  in
MARCHE Claude's avatar
MARCHE Claude committed
1115 1116 1117 1118 1119 1120 1121 1122 1123 1124
  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
     *)
1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135
    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
1136
         begin
1137 1138 1139
           Debug.dprintf
             debug
             "[Bisect] transformation failed %a@." Exn_printer.exn_printer exn;
MARCHE Claude's avatar
MARCHE Claude committed
1140 1141 1142 1143 1144 1145 1146
           match kont false with
           | Eliminate_definition.BSstep (rem,kont) ->
              bisect_step rem kont
           | Eliminate_definition.BSdone rem ->
              bisect_end rem
         end
      | TSdone trid ->
1147 1148 1149
         Debug.dprintf
           debug
           "[Bisect] transformation 'remove' succeeds@.";
MARCHE Claude's avatar
MARCHE Claude committed
1150 1151 1152
         match get_sub_tasks ses trid with
         | [pn] ->
            let limit = { limit with Call_provers.limit_time = !timelimit; } in
1153 1154
            let callback paid st =
              callback_pa paid st;
1155 1156 1157
              begin
              match st with
              | UpgradeProver _ -> ()
1158 1159 1160 1161 1162 1163 1164 1165
              | Scheduled ->
                 Debug.dprintf
                   debug "[Bisect] prover on subtask is scheduled@."
              | Running ->
                 Debug.dprintf
                   debug "[Bisect] prover on subtask is running@.";
              | Detached
              | Uninstalled _ -> assert false
1166
              | Undone | Interrupted -> Debug.dprintf debug "Bisecting interrupted.@."
MARCHE Claude's avatar
MARCHE Claude committed
1167 1168
              | InternalFailure exn ->
                 (* Perhaps the test can be considered false in this case? *)
1169
                 Debug.dprintf debug "[Bisect] prover interrupted by an error: %a.@."
MARCHE Claude's avatar
MARCHE Claude committed
1170 1171
                               Exn_printer.exn_printer exn
              | Done res ->
1172 1173 1174
                 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
1175 1176 1177 1178
                 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) ->
1179
                    Session_itp.remove_subtree ~notification ~removed ses (Session_itp.ATn trid);
MARCHE Claude's avatar
MARCHE Claude committed
1180 1181 1182
                    bisect_step rem kont
                 | Eliminate_definition.BSdone rem ->
                    bisect_end rem
1183
              end
MARCHE Claude's avatar
MARCHE Claude committed
1184
            in
1185 1186
            Debug.dprintf
              debug "[Bisect] running the prover on subtask@.";
MARCHE Claude's avatar
MARCHE Claude committed
1187 1188
            schedule_proof_attempt c pn prover ~counterexmp:false ~limit ~callback ~notification
         | _ -> assert false
1189
      end
MARCHE Claude's avatar
MARCHE Claude committed
1190
    in
1191 1192
    Debug.dprintf debug "To remove: %s@." rem;
    schedule_transformation c goal_id "remove" [rem] ~callback ~notification
MARCHE Claude's avatar
MARCHE Claude committed
1193 1194
  in
  Debug.dprintf debug "Bisecting with %a started.@."
MARCHE Claude's avatar
MARCHE Claude committed
1195 1196 1197 1198 1199
                Whyconf.print_prover prover;
  let t = get_raw_task ses goal_id in
  match Eliminate_definition.bisect_step t with
  | Eliminate_definition.BSdone _ -> assert false
  | Eliminate_definition.BSstep(rem,kont) -> bisect_step rem kont
MARCHE Claude's avatar
MARCHE Claude committed
1200