controller_itp.ml 29.1 KB
Newer Older
1
open Format
Clément Fumex's avatar
Clément Fumex committed
2 3
open Session_itp

4 5
exception Noprogress

6 7 8
let () = Exn_printer.register
    (fun fmt e ->
      match e with
Sylvain Dailler's avatar
Sylvain Dailler committed
9 10
      | Noprogress ->
          Format.fprintf fmt "The transformation made no progress.\n"
11 12
      | _ -> raise e)

Clément Fumex's avatar
Clément Fumex committed
13 14 15 16 17 18 19 20 21
(** State of a proof *)
type proof_attempt_status =
    | Unedited (** editor not yet run for interactive proof *)
    | JustEdited (** edited but not run yet *)
    | Interrupted (** external proof has never completed *)
    | Scheduled (** external proof attempt is scheduled *)
    | Running (** external proof attempt is in progress *)
    | Done of Call_provers.prover_result (** external proof done *)
    | InternalFailure of exn (** external proof aborted by internal error *)
22
    | Uninstalled of Whyconf.prover (** prover is uninstalled *)
Clément Fumex's avatar
Clément Fumex committed
23

MARCHE Claude's avatar
MARCHE Claude committed
24 25
let print_status fmt st =
  match st with
Sylvain Dailler's avatar
Sylvain Dailler committed
26 27 28 29 30 31 32 33 34 35 36
  | Unedited          -> fprintf fmt "Unedited"
  | JustEdited        -> fprintf fmt "JustEdited"
  | Interrupted       -> fprintf fmt "Interrupted"
  | Scheduled         -> fprintf fmt "Scheduled"
  | Running           -> fprintf fmt "Running"
  | Done r            ->
      fprintf fmt "Done(%a)" Call_provers.print_prover_result r
  | InternalFailure e ->
      fprintf fmt "InternalFailure(%a)" Exn_printer.exn_printer e
  | Uninstalled pr    ->
      fprintf fmt "Prover %a is uninstalled" Whyconf.print_prover pr
MARCHE Claude's avatar
MARCHE Claude committed
37 38

type transformation_status =
39
  | TSscheduled | TSdone of transID | TSfailed of (proofNodeID * exn)
40 41 42 43

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

47 48 49 50
type strategy_status = STSgoto of proofNodeID * int | STShalt

let print_strategy_status fmt st =
  match st with
Sylvain Dailler's avatar
Sylvain Dailler committed
51 52
  | STSgoto(id,n) ->
      fprintf fmt "goto step %d in proofNode %a" n print_proofNodeID id
53 54 55
  | STShalt -> fprintf fmt "halt"


56 57 58
open Ident

type proof_state = {
59
    file_state: bool Stdlib.Hstr.t;
60 61 62 63 64
    th_state: bool Hid.t;
    tn_state: bool Htn.t;
    pn_state : bool Hpn.t;
  }

65 66 67 68 69 70
let init_proof_state () = {
    file_state = Stdlib.Hstr.create 3;
    th_state = Hid.create 7;
    tn_state = Htn.create 42;
    pn_state = Hpn.create 42;
  }
71

72
type controller =
Sylvain Dailler's avatar
Sylvain Dailler committed
73 74
  { mutable controller_session: Session_itp.session;
    proof_state: proof_state;
75
    controller_config : Whyconf.config;
Sylvain Dailler's avatar
Sylvain Dailler committed
76 77 78
    controller_env: Env.env;
    controller_provers:
      (Whyconf.config_prover * Driver.driver) Whyconf.Hprover.t;
79 80
  }

81
let clear_proof_state c =
82
  Stdlib.Hstr.clear c.proof_state.file_state;
83 84 85 86
  Hid.clear c.proof_state.th_state;
  Htn.clear c.proof_state.tn_state;
  Hpn.clear c.proof_state.pn_state

87
let create_controller config env =
88
  {
89 90
    controller_session = Session_itp.dummy_session;
    proof_state = init_proof_state ();
91
    controller_config = config;
92
    controller_env = env;
93
    controller_provers = Whyconf.Hprover.create 7;
94
  }
95

96
let init_controller s c =
97
  clear_proof_state c;
98 99
  c.controller_session <- s

Clément Fumex's avatar
Clément Fumex committed
100 101
let tn_proved c tid = Htn.find_def c.proof_state.tn_state false tid
let pn_proved c pid = Hpn.find_def c.proof_state.pn_state false pid
102 103 104 105 106
let th_proved c th  =
  if (theory_goals th = []) then
    Hid.find_def c.proof_state.th_state true (theory_name th)
  else
    Hid.find_def c.proof_state.th_state false (theory_name th)
107 108 109 110 111
let file_proved c f =
  if f.file_theories = [] then
    true
  else
    List.for_all (fun th -> th_proved c th) f.file_theories
112

113 114 115 116 117 118 119 120 121
let any_proved cont any : bool =
  match any with
  | AFile file -> file_proved cont file
  | ATh th -> th_proved cont th
  | ATn tn -> tn_proved cont tn
  | APn pn -> pn_proved cont pn
  | APa pa ->
      begin
        let pa = get_proof_attempt_node cont.controller_session pa in
Sylvain Dailler's avatar
Sylvain Dailler committed
122
        match pa.Session_itp.proof_state with
123 124 125 126 127 128 129 130 131
        | None -> false
        | Some pa ->
          begin
            match pa.Call_provers.pr_answer with
            | Call_provers.Valid -> true
            | _ -> false
          end
      end

132 133 134 135 136 137 138 139
let remove_any_proof_state cont any : unit =
  match any with
  | AFile _file -> ()
  | ATh th     -> Hid.remove cont.proof_state.th_state (theory_name th)
  | APn pn     -> Hpn.remove cont.proof_state.pn_state pn
  | ATn tn     -> Htn.remove cont.proof_state.tn_state tn
  | APa _pa     -> ()

140 141 142



143

144

145 146 147 148 149 150 151 152 153 154 155
(** TODO make the whole reloading of proof_state more efficient and natural *)

(* Note that f has side effect on the elements of l. We want this effect to
   happen. That's why we cannot use List.for_all (respectively List.exists)
   directly (List.for_all stops on first element that evaluates to false) *)
let for_all_se f l =
  List.for_all (fun b -> b) (List.map f l)

let exists_se f l =
  List.exists (fun b -> b) (List.map f l)

156
(* init proof state after reload *)
157
let rec reload_goal_proof_state c g =
158 159 160
  let ses = c.controller_session in
  let tr_list = get_transformations ses g in
  let pa_list = get_proof_attempts ses g in
161
  let proved = exists_se (reload_trans_proof_state c) tr_list in
162
  let proved = exists_se reload_pa_proof_state pa_list || proved in
163 164 165
  Hpn.replace c.proof_state.pn_state g proved;
  proved

166
and reload_trans_proof_state c tr =
167
  let proof_list = get_sub_tasks c.controller_session tr in
168
  let proved = for_all_se (reload_goal_proof_state c) proof_list in
169 170 171 172 173 174 175 176 177 178 179 180
  Htn.replace c.proof_state.tn_state tr proved;
  proved

and reload_pa_proof_state pa =
  match pa.proof_obsolete, pa.Session_itp.proof_state with
  | false, Some pr when pr.Call_provers.pr_answer = Call_provers.Valid -> true
  | _ -> false

(* to be called after reload *)
let reload_theory_proof_state c th =
  let ps = c.proof_state in
  let goals = theory_goals th in
181
  let proved = for_all_se (reload_goal_proof_state c) goals in
182 183 184 185 186 187 188 189 190 191 192
  Hid.replace ps.th_state (theory_name th) proved

(* to be called after reload *)
let reload_file_proof_state c f =
  List.iter (reload_theory_proof_state c) f.file_theories

(* to be called after reload *)
let reload_session_proof_state c =
  Stdlib.Hstr.iter
    (fun _ f -> reload_file_proof_state c f)
    (get_files c.controller_session)
193

194 195 196 197 198 199 200
(* Get children of any without proofattempts *)
let get_undetached_children_no_pa s any : any list =
  match any with
  | AFile f -> List.map (fun th -> ATh th) f.file_theories
  | 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
201
  | APa _ -> []
202

203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266



(* status update *)

type notifier = any -> unit

let pa_ok pa =
  not pa.proof_obsolete &&
    match pa.Session_itp.proof_state
    with
    | Some { Call_provers.pr_answer = Call_provers.Valid} -> true
    | _ -> false

(* [update_goal_node c id] update the proof status of node id
   update is propagated to parents when required. *)

let update_file_node notification c f =
  let ps = c.proof_state in
  let ths = f.file_theories in
  let proved = List.for_all (th_proved c) ths in
  if proved <> file_proved c f then
    begin
      Stdlib.Hstr.replace ps.file_state f.file_name proved;
      notification (AFile f);
    end

let update_theory_node notification c th =
  let ps = c.proof_state in
  let goals = theory_goals th in
  let proved = List.for_all (pn_proved c) goals in
  if proved <> th_proved c th then
    begin
      Hid.replace ps.th_state (theory_name th) proved;
      notification (ATh th);
      update_file_node notification c (theory_parent c.controller_session th)
    end

let rec update_goal_node notification c id =
  let ses = c.controller_session in
  let tr_list = get_transformations ses id in
  let pa_list = get_proof_attempts ses id in
  let proved = List.exists (tn_proved c) tr_list || List.exists pa_ok pa_list in
  if proved <> pn_proved c id then
    begin
      Hpn.replace c.proof_state.pn_state id proved;
      notification (APn id);
      match get_proof_parent ses id with
      | Trans trans_id -> update_trans_node notification c trans_id
      | Theory th -> update_theory_node notification c th
    end

and update_trans_node notification c trid =
  let ses = c.controller_session in
  let proof_list = get_sub_tasks ses trid in
  let proved = List.for_all (pn_proved c) proof_list in
  if proved <> tn_proved c trid then
    begin
      Htn.replace c.proof_state.tn_state trid proved;
      notification (ATn trid);
      update_goal_node notification c (get_trans_parent ses trid)
    end


267 268 269 270 271 272 273 274 275 276 277 278
(* printing *)

module PSession = struct

  open Stdlib

  type any =
    | Session
    | File of file
    | Theory of theory
    | Goal of proofNodeID
    | Transf of transID
279
    | ProofAttempt of proof_attempt_node
280 281 282 283 284 285 286 287 288 289 290

  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 ->
       f.file_name,
Sylvain Dailler's avatar
Sylvain Dailler committed
291 292 293 294
       List.fold_right
          (fun th -> n (Theory th))
          f.file_detached_theories
          (List.fold_right (fun th -> n (Theory th)) f.file_theories [])
295 296 297
    | Theory th ->
       let id = theory_name th in
       let name = id.Ident.id_string in
298
       let name = if th_proved x.tcont th then name^"!" else name^"?" in
299
       name,
Sylvain Dailler's avatar
Sylvain Dailler committed
300 301 302 303
       List.fold_right
         (fun g -> n (Goal g))
         (theory_goals th)
         (List.fold_right (fun g -> n (Goal g)) (theory_detached_goals th) [])
304 305 306
    | Goal id ->
       let gid = get_proof_name s id in
       let name = gid.Ident.id_string in
307
       let name = if pn_proved x.tcont id then name^"!" else name^"?" in
308 309 310 311 312 313 314
       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
315 316 317 318 319
          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 ""), []
320 321
    | Transf id ->
       let name = get_transf_name s id in
322
       let name = if tn_proved x.tcont id then name^"!" else name^"?" in
323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339
       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 }

(*********)



340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364
let read_file env ?format fn =
  let theories = Env.read_file Env.base_language env ?format fn in
  let ltheories =
    Stdlib.Mstr.fold
      (fun name th acc ->
        (* Hack : with WP [name] and [th.Theory.th_name.Ident.id_string] *)
        let th_name =
          Ident.id_register (Ident.id_derive name th.Theory.th_name) in
         match th.Theory.th_name.Ident.id_loc with
           | Some l -> (l,th_name,th)::acc
           | None   -> (Loc.dummy_position,th_name,th)::acc)
      theories []
  in
  let th =  List.sort
      (fun (l1,_,_) (l2,_,_) -> Loc.compare l1 l2)
      ltheories
  in
  List.map (fun (_,_,a) -> a) th


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

365
let merge_file (old_ses : session) (c : controller) ~use_shapes _ file =
366 367 368 369 370 371
  let format = file.file_format in
  let old_theories = file.file_theories in
  let file_name = Filename.concat (get_dir old_ses) file.file_name in
  let new_theories =
    try
      read_file c.controller_env file_name ?format
372 373
    with e -> (* TODO: filter only syntax error and typing errors *)
      raise e
374
  in
375
  merge_file_section
376 377
    c.controller_session ~use_shapes ~old_ses ~old_theories
    ~env:c.controller_env file_name new_theories format;
378
  reload_session_proof_state c
379

380
let reload_files (c : controller) ~use_shapes =
381
  let old_ses = c.controller_session in
Sylvain Dailler's avatar
Sylvain Dailler committed
382 383
  c.controller_session <-
    empty_session ~shape_version:(get_shape_version old_ses) (get_dir old_ses);
384 385 386 387 388 389 390
  try
    Stdlib.Hstr.iter
      (fun f -> merge_file old_ses c ~use_shapes f)
      (get_files old_ses)
  with e ->
    c.controller_session <- old_ses;
    raise e
391 392 393 394

let add_file c ?format fname =
  let theories = read_file c.controller_env ?format fname in
  add_file_section ~use_shapes:false c.controller_session fname theories format
395

396 397
(* Update the proof_state according to new false state and then remove
   the subtree *)
398
let remove_subtree c (n: any) ~removed ~notification =
399 400
  let removed = (fun x -> removed x; remove_any_proof_state c x) in
  let parent = get_any_parent c.controller_session n in
401 402 403 404 405 406 407 408 409 410 411 412 413 414
  (* Note that this line can raise RemoveError when called on inappropriate
     node (attached theory / goals) *)
  Session_itp.remove_subtree c.controller_session n ~notification:removed;
  (match parent with
  | Some (APn parent) ->
      (* If proof_state of the parent is actually changed update the branch
         otherwise do nothing *)
      let tr_list = get_transformations c.controller_session parent in
      let pa_list = get_proof_attempts c.controller_session parent in
      let proved = List.exists (tn_proved c) tr_list in
      let proved = List.exists reload_pa_proof_state pa_list || proved in
      if proved then
        ()
      else
415
        update_goal_node notification c parent
416 417 418 419 420 421 422 423
  | Some _ ->
      (* This case corresponds to removal of detached node. We don't need to
         update the proof_state *)
      ()
  | None ->
      (* Cannot remove root. Note that this should already have failed in call
         to Session_itp.remove_subtree *)
      raise RemoveError)
424 425 426 427 428 429

module type Scheduler = sig
  val timeout: ms:int -> (unit -> bool) -> unit
  val idle: prio:int -> (unit -> bool) -> unit
end

430 431
module Make(S : Scheduler) = struct

MARCHE Claude's avatar
MARCHE Claude committed
432 433 434 435 436 437 438 439
let scheduled_proof_attempts = Queue.create ()

let prover_tasks_in_progress = Queue.create ()

let timeout_handler_running = ref false

let max_number_of_running_provers = ref 1

440 441 442 443 444
let set_max_tasks n =
  max_number_of_running_provers := n;
  Prove_client.set_max_running_provers n


MARCHE Claude's avatar
MARCHE Claude committed
445
let number_of_running_provers = ref 0
446

447 448 449 450
let observer = ref (fun _ _ _ -> ())

let register_observer = (:=) observer

451
module Hprover = Whyconf.Hprover
MARCHE Claude's avatar
MARCHE Claude committed
452

453
let build_prover_call ~cntexample c id pr limit callback =
454 455
  let (config_pr,driver) = Hprover.find c.controller_provers pr in
  let command =
Sylvain Dailler's avatar
Sylvain Dailler committed
456 457 458
    Whyconf.get_complete_command
      config_pr
      ~with_steps:Call_provers.(limit.limit_steps <> empty_limit.limit_steps) in
459
  let task = Session_itp.get_task c.controller_session id in
460
  let table = Session_itp.get_table c.controller_session id in
461
  let call =
462
    Driver.prove_task ?old:None ~cntexample:cntexample ~inplace:false ~command
463
                      ~limit ?name_table:table driver task
464
  in
465
  let pa = (c.controller_session,id,pr,callback,false,call) in
MARCHE Claude's avatar
MARCHE Claude committed
466 467 468 469 470 471
  Queue.push pa prover_tasks_in_progress

let timeout_handler () =
  (* examine all the prover tasks in progress *)
  let q = Queue.create () in
  while not (Queue.is_empty prover_tasks_in_progress) do
Sylvain Dailler's avatar
Sylvain Dailler committed
472 473
    let (ses,id,pr,callback,started,call) as c =
      Queue.pop prover_tasks_in_progress in
474
    match Call_provers.query_call call with
MARCHE Claude's avatar
MARCHE Claude committed
475 476 477 478 479
    | Call_provers.NoUpdates -> Queue.add c q
    | Call_provers.ProverStarted ->
       assert (not started);
       callback Running;
       incr number_of_running_provers;
480
       Queue.add (ses,id,pr,callback,true,call) q
MARCHE Claude's avatar
MARCHE Claude committed
481 482
    | Call_provers.ProverFinished res ->
       if started then decr number_of_running_provers;
483 484 485
       (* update the session *)
       update_proof_attempt ses id pr res;
       (* inform the callback *)
MARCHE Claude's avatar
MARCHE Claude committed
486
       callback (Done res)
487 488 489 490 491 492 493 494
    | Call_provers.ProverInterrupted ->
       if started then decr number_of_running_provers;
       (* inform the callback *)
       callback (Interrupted)
    | Call_provers.InternalFailure exn ->
       if started then decr number_of_running_provers;
       (* inform the callback *)
       callback (InternalFailure (exn))
MARCHE Claude's avatar
MARCHE Claude committed
495 496
  done;
  Queue.transfer q prover_tasks_in_progress;
497
  (* if the number of prover tasks is less than 3 times the maximum
MARCHE Claude's avatar
MARCHE Claude committed
498 499
     number of running provers, then we heuristically decide to add
     more tasks *)
500 501 502 503
  begin
    try
      for _i = Queue.length prover_tasks_in_progress
          to 3 * !max_number_of_running_provers do
504
        let (c,id,pr,limit,callback,cntexample) = Queue.pop scheduled_proof_attempts in
505
        try
506
          build_prover_call ~cntexample c id pr limit callback
507
        with e when not (Debug.test_flag Debug.stack_trace) ->
508
          (*Format.eprintf
509
            "@[Exception raised in Controller_itp.build_prover_call:@ %a@.@]"
510
            Exn_printer.exn_printer e;*)
511 512 513 514 515 516 517 518 519
          callback (InternalFailure e)
      done
  with Queue.Empty -> ()
  end;
  let scheduled = Queue.length scheduled_proof_attempts in
  let waiting_or_running = Queue.length prover_tasks_in_progress in
  let running = !number_of_running_provers in
  !observer scheduled (waiting_or_running - running) running;
  true
MARCHE Claude's avatar
MARCHE Claude committed
520

521 522 523 524 525 526 527 528 529
let interrupt () =
  while not (Queue.is_empty prover_tasks_in_progress) do
    let (_ses,_id,_pr,callback,_started,_call) =
      Queue.pop prover_tasks_in_progress in
    (* TODO: apply some Call_provers.interrupt_call call *)
    callback Interrupted
  done;
  number_of_running_provers := 0;
  while not (Queue.is_empty scheduled_proof_attempts) do
530
    let (_c,_id,_pr,_limit,callback,_cntexample) = Queue.pop scheduled_proof_attempts in
531 532 533 534
    callback Interrupted
  done;
  !observer 0 0 0

MARCHE Claude's avatar
MARCHE Claude committed
535 536 537 538 539 540 541
let run_timeout_handler () =
  if not !timeout_handler_running then
    begin
      timeout_handler_running := true;
      S.timeout ~ms:125 timeout_handler;
    end

542
let schedule_proof_attempt_r c id pr ~counterexmp ~limit ~callback =
543
  let panid =
544
    graft_proof_attempt c.controller_session id pr ~limit
545
  in
546
  Queue.add (c,id,pr,limit,callback panid,counterexmp) scheduled_proof_attempts;
547
  callback panid Scheduled;
MARCHE Claude's avatar
MARCHE Claude committed
548
  run_timeout_handler ()
Clément Fumex's avatar
Clément Fumex committed
549

550
let schedule_proof_attempt c id pr ~counterexmp ~limit ~callback ~notification =
Sylvain Dailler's avatar
Sylvain Dailler committed
551
  let callback panid s = callback panid s;
Sylvain Dailler's avatar
Sylvain Dailler committed
552
    (match s with
553
    | Scheduled | Done _ -> update_goal_node notification c id
Sylvain Dailler's avatar
Sylvain Dailler committed
554
    | _ -> ())
555
  in
556
  schedule_proof_attempt_r c id pr ~counterexmp ~limit ~callback
557 558

let schedule_transformation_r c id name args ~callback =
559 560
  let apply_trans () =
    let task = get_task c.controller_session id in
561 562 563
    let table = match get_table c.controller_session id with
    | None -> raise (Task.Bad_name_table "Controller_itp.schedule_transformation_r")
    | Some table -> table in
564 565
    begin
      try
Sylvain Dailler's avatar
Sylvain Dailler committed
566
        let subtasks =
567
          Trans.apply_transform_args name c.controller_env args table task in
568 569 570 571
        (* if result is same as input task, consider it as a failure *)
        begin
          match subtasks with
          | [t'] when Task.task_equal t' task ->
572
             callback (TSfailed (id, Noprogress))
573 574 575 576 577
          | _ ->
             let tid = graft_transf c.controller_session id name args subtasks in
             callback (TSdone tid)
        end
      with e when not (Debug.test_flag Debug.stack_trace) ->
578
        (* Format.eprintf
579
          "@[Exception raised in Trans.apply_transform %s:@ %a@.@]"
580
          name Exn_printer.exn_printer e; TODO *)
581
        callback (TSfailed (id, e))
582 583
    end;
    false
584 585 586
  in
  S.idle ~prio:0 apply_trans;
  callback TSscheduled
Clément Fumex's avatar
Clément Fumex committed
587

588
let schedule_transformation c id name args ~callback ~notification =
589
  let callback s = callback s; (match s with
590
      | TSdone tid -> update_trans_node notification c tid
591
      | TSfailed _e -> ()
592
      | _ -> ()) in
593 594 595 596
  schedule_transformation_r c id name args ~callback

open Strategy

Sylvain Dailler's avatar
Sylvain Dailler committed
597
let run_strategy_on_goal
598
    c id strat ~counterexmp ~callback_pa ~callback_tr ~callback ~notification =
599 600 601 602 603 604
  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
605 606
         let callback panid res =
           callback_pa panid res;
607 608 609 610 611
           match res with
           | Scheduled | Running -> (* nothing to do yet *) ()
           | Done { Call_provers.pr_answer = Call_provers.Valid } ->
              (* proof succeeded, nothing more to do *)
              callback STShalt
612 613
           | Interrupted | InternalFailure _ ->
              callback STShalt
614 615 616 617 618
           | 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
619
           | Unedited | JustEdited | Uninstalled _ ->
620 621 622 623 624 625
                         (* should not happen *)
                         assert false
         in
         let limit = { Call_provers.empty_limit with
                       Call_provers.limit_time = timelimit;
                       limit_mem  = memlimit} in
626
         schedule_proof_attempt c g p ~counterexmp ~limit ~callback ~notification
627 628
      | Itransform(trname,pcsuccess) ->
         let callback ntr =
MARCHE Claude's avatar
MARCHE Claude committed
629
           callback_tr ntr;
630
           match ntr with
631
           | TSfailed _e -> (* transformation failed *)
632 633 634 635 636 637 638 639 640 641 642 643
              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
644
                (get_sub_tasks c.controller_session tid)
645
         in
646
         schedule_transformation c g trname [] ~callback ~notification
647 648 649 650 651 652
      | Igoto pc ->
         callback (STSgoto (g,pc));
         exec_strategy pc strat g
  in
  exec_strategy 0 strat id

Sylvain Dailler's avatar
Sylvain Dailler committed
653 654
let schedule_pa_with_same_arguments
    c (pa: proof_attempt_node) (pn: proofNodeID) ~callback ~notification =
Sylvain Dailler's avatar
Sylvain Dailler committed
655 656 657 658
  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
659 660
let schedule_tr_with_same_arguments
    c (tr: transID) (pn: proofNodeID) ~callback ~notification =
Sylvain Dailler's avatar
Sylvain Dailler committed
661 662 663 664 665
  let s = c.controller_session in
  let args = get_transf_args s tr in
  let name = get_transf_name s tr in
  schedule_transformation c pn name args ~callback ~notification

666 667


668
let clean_session c ~remove =
669 670
  let s = c.controller_session in
  Session_itp.session_iter_proof_attempt
671 672 673 674 675 676 677 678 679
    (fun id pa ->
      if pn_proved c pa.parent then
        match pa.Session_itp.proof_state with
        | None -> ()
        | Some pr ->
           if pa.Session_itp.proof_obsolete ||
                Call_provers.(pr.pr_answer <> Valid)
           then
             remove_subtree c ~removed:remove ~notification:(fun _ -> ()) (APa id))
680
    s
681

682 683
(* This function folds on any subelements of given node and tries to mark all
   proof attempts it encounters *)
684
let mark_as_obsolete ~notification c any =
685
  (* Case for proof attempt only *)
686
  let mark_as_obsolete_pa c n =
687
    let s = c.controller_session in
688 689
    let parent = get_proof_attempt_parent s n in
    Session_itp.mark_obsolete s n;
690 691
    notification (APa n);
    update_goal_node notification c parent
692 693 694 695
  in
  let s = c.controller_session in
  fold_all_any s
    (fun () any -> match any with
696
    | APa n -> mark_as_obsolete_pa c n
697
    | _ -> ()) () any
698

Sylvain Dailler's avatar
Sylvain Dailler committed
699 700 701 702 703 704 705 706 707 708 709 710 711 712
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
713
      List.iter (fun x -> schedule_pa_with_same_arguments c x to_pn ~counterexmp:false
Sylvain Dailler's avatar
Sylvain Dailler committed
714 715 716 717
          ~callback:callback_pa ~notification) from_pa_list;
      let from_tr_list = get_transformations s from_pn in
      let callback x st = callback_tr st;
        match st with
Sylvain Dailler's avatar
Sylvain Dailler committed
718 719
        | TSdone tid ->
          copy_paste c (ATn x) (ATn tid) ~notification ~callback_pa ~callback_tr
Sylvain Dailler's avatar
Sylvain Dailler committed
720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739
        | _ -> ()
      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
740
      | None -> raise (BadCopyDetached "copy_detached no parent")
Sylvain Dailler's avatar
Sylvain Dailler committed
741 742
      | Some parent ->
          copy ~parent (APn pn_id);
Sylvain Dailler's avatar
Sylvain Dailler committed
743 744
          copy_structure
            ~notification:copy c.controller_session (APn from_pn) (APn pn_id)
Sylvain Dailler's avatar
Sylvain Dailler committed
745
    end
746 747
  (* Only goal can be detached *)
  | _ -> raise (BadCopyDetached "copy_detached. Can only copy goal")
Sylvain Dailler's avatar
Sylvain Dailler committed
748 749


750
let replay_proof_attempt c pr limit (parid: proofNodeID) id ~callback ~notification =
751 752 753
  (* The replay can be done on a different machine so we need
     to check more things before giving the attempt to the scheduler *)
  if not (Hprover.mem c.controller_provers pr) then
754
    callback id (Uninstalled pr)
755
  else
756
    schedule_proof_attempt c parid pr ~counterexmp:false ~limit ~callback ~notification
757 758 759 760 761

type report =
  | Result of Call_provers.prover_result * Call_provers.prover_result
  (** Result(new_result,old_result) *)
  | CallFailed of exn
762
  | Replay_interrupted
763 764 765 766 767 768 769 770 771 772 773
  | 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
774 775 776 777
  | CallFailed e ->
    Format.fprintf fmt "Callfailed %a@." Exn_printer.exn_printer e
  | Replay_interrupted ->
    Format.fprintf fmt "Interrupted@."
778 779 780 781 782 783 784 785 786
  | 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 *)
787
let replay_print fmt (lr: (proofNodeID * Whyconf.prover * Call_provers.resource_limit * report) list) =
788 789
  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
790 791
      (Obj.magic id) Whyconf.print_prover pr
      rl.Call_provers.limit_time print_report report
792
  in
793
  Format.fprintf fmt "%a@." (Pp.print_list Pp.newline pp_elem) lr
794

795 796
let replay ?(obsolete_only=true) ?(use_steps=false)
           c ~callback ~notification ~final_callback =
797

798
  let craft_report count s r id pr limits pa =
799
    match s with
800 801 802
    | Scheduled | Running -> ()
    | Unedited | JustEdited -> assert false
    | Interrupted ->
803
       decr count;
804
       r := (id, pr, limits, Replay_interrupted ) :: !r
805
    | Done new_r ->
806
       decr count;
807 808 809 810
        (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 ->
811
       decr count;
812
        r := (id, pr, limits, CallFailed (e)) :: !r
813 814 815
    | Uninstalled _ ->
       decr count;
       r := (id, pr, limits, Prover_not_installed) :: !r;
816
  in
817 818 819 820 821 822 823 824 825

  (* === replay === *)
  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 *)
  Session_itp.session_iter_proof_attempt
826
    (fun _ pa -> if pa.proof_obsolete || not obsolete_only then incr count) session;
827 828

  (* Replaying function *)
829
  let replay_pa id pa =
830 831 832 833
    if pa.proof_obsolete || not obsolete_only then
      begin
        let parid = pa.parent in
        let pr = pa.prover in
834 835 836 837
        (* 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 *)
838 839 840 841 842 843 844 845 846 847 848 849 850
        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
        replay_proof_attempt c pr limit parid id
                             ~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
851 852

  (* Calling replay on all the proof_attempts of the session *)
853
  Session_itp.session_iter_proof_attempt replay_pa session
854

855
end