controller_itp.ml 21.6 KB
Newer Older
1 2 3 4



open Format
Clément Fumex's avatar
Clément Fumex committed
5 6
open Session_itp

7 8
exception Noprogress

9 10 11 12 13 14
let () = Exn_printer.register
    (fun fmt e ->
      match e with
      | Noprogress -> Format.fprintf fmt "The transformation made no progress.\n"
      | _ -> raise e)

Clément Fumex's avatar
Clément Fumex committed
15 16 17 18 19 20 21 22 23
(** 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 *)
24
    | Uninstalled of Whyconf.prover (** prover is uninstalled *)
Clément Fumex's avatar
Clément Fumex committed
25

MARCHE Claude's avatar
MARCHE Claude committed
26 27 28 29 30 31 32 33 34
let print_status fmt st =
  match st with
  | 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
35
  | Uninstalled pr -> fprintf fmt "Prover %a is uninstalled" Whyconf.print_prover pr
MARCHE Claude's avatar
MARCHE Claude committed
36 37

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

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

46 47 48 49 50 51 52 53
type strategy_status = STSgoto of proofNodeID * int | STShalt

let print_strategy_status fmt st =
  match st with
  | STSgoto(id,n) -> fprintf fmt "goto step %d in proofNode %a" n print_proofNodeID id
  | STShalt -> fprintf fmt "halt"


54 55 56 57 58 59 60 61
open Ident

type proof_state = {
    th_state: bool Hid.t;
    tn_state: bool Htn.t;
    pn_state : bool Hpn.t;
  }

62
let init_proof_state () =
63 64 65 66
  {th_state = Hid.create 7;
   tn_state = Htn.create 42;
   pn_state = Hpn.create 42}

67
type controller =
68
  { mutable controller_session : Session_itp.session;
69
    proof_state : proof_state;
70
    controller_env : Env.env;
71 72 73
    controller_provers : (Whyconf.config_prover * Driver.driver) Whyconf.Hprover.t;
  }

74 75 76
let create_controller env = {
    controller_session = Session_itp.dummy_session;
    proof_state = init_proof_state ();
77
    controller_env = env;
78 79 80
    controller_provers = Whyconf.Hprover.create 7;
}

81 82 83
let init_controller s c =
  c.controller_session <- s

Clément Fumex's avatar
Clément Fumex committed
84 85
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
86 87 88 89 90
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)
91 92 93 94 95
let file_proved c f =
  if f.file_theories = [] then
    true
  else
    List.for_all (fun th -> th_proved c th) f.file_theories
96 97

(* Update the result of the theory according to its children *)
98
let update_theory_proof_state ps th =
99 100
  let goals = theory_goals th in
  Hid.replace ps.th_state (theory_name th)
101
    (List.for_all (fun id -> Hpn.find_def ps.pn_state false id) goals)
102 103 104

let rec propagate_proof c (id: Session_itp.proofNodeID) =
  let tr_list = get_transformations c.controller_session id in
Clément Fumex's avatar
Clément Fumex committed
105 106
  let new_state = List.exists (fun id -> tn_proved c id) tr_list in
  if new_state != pn_proved c id then
107 108 109 110 111 112 113
    begin
      Hpn.replace c.proof_state.pn_state id new_state;
      update_proof c id
    end

and propagate_trans c (tid: Session_itp.transID) =
  let proof_list = get_sub_tasks c.controller_session tid in
Clément Fumex's avatar
Clément Fumex committed
114 115
  let cur_state = tn_proved c tid in
  let new_state = List.for_all (fun id -> pn_proved c id) proof_list in
116 117 118 119 120 121 122 123
  if cur_state != new_state then
    begin
      Htn.replace c.proof_state.tn_state tid new_state;
      propagate_proof c (get_trans_parent c.controller_session tid)
    end

and update_proof c id =
  match get_proof_parent c.controller_session id with
124
  | Theory th -> update_theory_proof_state c.proof_state th
125 126 127 128 129
  | Trans tid -> propagate_trans c tid

(* [update_proof_node c id b] Update the whole proof_state
   of c according to the result (id, b) *)
let update_proof_node c id b =
130 131 132 133
  match pn_proved c id with
  | true -> ()
  | false -> Hpn.replace c.proof_state.pn_state id b;
    update_proof c id
134 135 136 137 138 139

(* [update_trans_node c id b] Update the proof_state of c to take the result of (id,b). Then
   propagates it to its parents *)
let update_trans_node c id b =
  Htn.replace c.proof_state.tn_state id b;
  propagate_proof c (get_trans_parent c.controller_session id)
140

141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168
(* init proof state after reload *)
let rec reload_goal_proof_state ps c g =
  let ses = c.controller_session in
  let tr_list = get_transformations ses g in
  let pa_list = get_proof_attempts ses g in
  let proved = List.exists (reload_trans_proof_state ps c) tr_list in
  let proved = List.exists reload_pa_proof_state pa_list || proved in
  Hpn.replace c.proof_state.pn_state g proved;
  proved

and reload_trans_proof_state ps c tr =
  let proof_list = get_sub_tasks c.controller_session tr in
  let proved = List.for_all (reload_goal_proof_state ps c) proof_list in
  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
  let proved = List.for_all (reload_goal_proof_state ps c) goals in
  Hid.replace ps.th_state (theory_name th)
    proved
169 170 171 172 173 174 175 176 177 178 179 180 181

(* printing *)

module PSession = struct

  open Stdlib

  type any =
    | Session
    | File of file
    | Theory of theory
    | Goal of proofNodeID
    | Transf of transID
182
    | ProofAttempt of proof_attempt_node
183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198

  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,
       List.fold_right (fun th -> n (Theory th)) f.file_detached_theories
                       (List.fold_right (fun th -> n (Theory th)) f.file_theories [])
    | Theory th ->
       let id = theory_name th in
       let name = id.Ident.id_string in
199
       let name = if th_proved x.tcont th then name^"!" else name^"?" in
200 201 202 203 204 205
       name,
       List.fold_right (fun g -> n (Goal g)) (theory_goals th)
                       (List.fold_right (fun g -> n (Goal g)) (theory_detached_goals th) [])
    | Goal id ->
       let gid = get_proof_name s id in
       let name = gid.Ident.id_string in
206
       let name = if pn_proved x.tcont id then name^"!" else name^"?" in
207 208 209 210 211 212 213 214 215 216 217 218 219 220
       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"
                      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 ""), []
    | Transf id ->
       let name = get_transf_name s id in
221
       let name = if tn_proved x.tcont id then name^"!" else name^"?" in
222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238
       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 }

(*********)



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 267 268 269 270 271 272 273
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 *)

let merge_file (old_ses : session) (c : controller) env ~use_shapes _ file =
  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
    with _ -> (* TODO: filter only syntax error and typing errors *)
      []
  in
274 275 276 277 278
  merge_file_section
    c.controller_session ~use_shapes ~old_ses ~old_theories ~env file_name new_theories format;
  Stdlib.Hstr.iter
    (fun _ f -> List.iter (reload_theory_proof_state c) f.file_theories)
    (get_files c.controller_session)
279 280 281 282 283 284 285 286 287 288


let reload_files (c : controller) (env : Env.env) ~use_shapes =
  let old_ses = c.controller_session in
  c.controller_session <- empty_session ~shape_version:(get_shape_version old_ses) (get_dir old_ses);
  Stdlib.Hstr.iter (merge_file old_ses c env ~use_shapes) (get_files old_ses)

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
289

290 291 292 293 294 295 296 297


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


298 299
module Make(S : Scheduler) = struct

MARCHE Claude's avatar
MARCHE Claude committed
300 301 302 303 304 305 306 307
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

308 309 310 311 312
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
313
let number_of_running_provers = ref 0
314

315 316 317 318
let observer = ref (fun _ _ _ -> ())

let register_observer = (:=) observer

319
module Hprover = Whyconf.Hprover
MARCHE Claude's avatar
MARCHE Claude committed
320

321
(*
MARCHE Claude's avatar
MARCHE Claude committed
322 323 324 325 326 327 328 329 330
let dummy_result =
  {
    pr_answer = Call_provers.Unknown ("I'm dumb", None);
    pr_status = Unix.WEXITED 0;
    pr_output = "";
    pr_time   = 3.14;
    pr_steps  = 42;
    pr_model  = Model_parser.default_model;
}
331
 *)
MARCHE Claude's avatar
MARCHE Claude committed
332

333 334 335 336
let build_prover_call c id pr limit callback =
  let (config_pr,driver) = Hprover.find c.controller_provers pr in
  let command =
    Whyconf.get_complete_command config_pr
MARCHE Claude's avatar
MARCHE Claude committed
337
          ~with_steps:Call_provers.(limit.limit_steps <> empty_limit.limit_steps) in
338
  let task = Session_itp.get_task c.controller_session id in
339
  let tables = Session_itp.get_tables c.controller_session id in
340
  let call =
MARCHE Claude's avatar
itp  
MARCHE Claude committed
341
    Driver.prove_task ?old:None ~cntexample:true ~inplace:false ~command
342
                      ~limit driver tables task
343
  in
344
  let pa = (c.controller_session,id,pr,callback,false,call) in
MARCHE Claude's avatar
MARCHE Claude committed
345 346 347 348 349 350
  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
351
    let (ses,id,pr,callback,started,call) as c = Queue.pop prover_tasks_in_progress in
352
    match Call_provers.query_call call with
MARCHE Claude's avatar
MARCHE Claude committed
353 354 355 356 357
    | Call_provers.NoUpdates -> Queue.add c q
    | Call_provers.ProverStarted ->
       assert (not started);
       callback Running;
       incr number_of_running_provers;
358
       Queue.add (ses,id,pr,callback,true,call) q
MARCHE Claude's avatar
MARCHE Claude committed
359 360
    | Call_provers.ProverFinished res ->
       if started then decr number_of_running_provers;
361 362 363
       (* update the session *)
       update_proof_attempt ses id pr res;
       (* inform the callback *)
MARCHE Claude's avatar
MARCHE Claude committed
364
       callback (Done res)
365 366 367 368 369 370 371 372
    | 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
373 374
  done;
  Queue.transfer q prover_tasks_in_progress;
375
  (* if the number of prover tasks is less than 3 times the maximum
MARCHE Claude's avatar
MARCHE Claude committed
376 377
     number of running provers, then we heuristically decide to add
     more tasks *)
378 379 380 381 382 383 384 385
  begin
    try
      for _i = Queue.length prover_tasks_in_progress
          to 3 * !max_number_of_running_provers do
        let (c,id,pr,limit,callback) = Queue.pop scheduled_proof_attempts in
        try
          build_prover_call c id pr limit callback
        with e when not (Debug.test_flag Debug.stack_trace) ->
386
          (*Format.eprintf
387
            "@[Exception raised in Controller_itp.build_prover_call:@ %a@.@]"
388
            Exn_printer.exn_printer e;*)
389 390 391 392 393 394 395 396 397
          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
398 399 400 401 402 403 404 405

let run_timeout_handler () =
  if not !timeout_handler_running then
    begin
      timeout_handler_running := true;
      S.timeout ~ms:125 timeout_handler;
    end

406
let schedule_proof_attempt_r c id pr ~limit ~callback =
407 408 409 410 411
  let panid =
    graft_proof_attempt c.controller_session id pr ~timelimit:limit.Call_provers.limit_time
  in
  Queue.add (c,id,pr,limit,callback panid) scheduled_proof_attempts;
  callback panid Scheduled;
MARCHE Claude's avatar
MARCHE Claude committed
412
  run_timeout_handler ()
Clément Fumex's avatar
Clément Fumex committed
413

414
let schedule_proof_attempt c id pr ~limit ~callback =
415
  let callback panid s = (match s with
Clément Fumex's avatar
Clément Fumex committed
416
  | Done pr -> update_proof_node c id (pr.Call_provers.pr_answer == Call_provers.Valid)
417 418
  | Interrupted | InternalFailure _ -> update_proof_node c id false
  | _ -> ());
419
  callback panid s
420
  in
421
  schedule_proof_attempt_r c id pr ~limit:limit ~callback
422 423

let schedule_transformation_r c id name args ~callback =
424 425
  let apply_trans () =
    let task = get_task c.controller_session id in
426 427 428
    let tables = match get_tables c.controller_session id with
    | None -> raise (Task.Bad_name_table "schedule_transformation")
    | Some tables -> tables in
429 430
    begin
      try
431
        let subtasks = Trans.apply_transform_args name c.controller_env args tables task in
432 433 434 435
        (* if result is same as input task, consider it as a failure *)
        begin
          match subtasks with
          | [t'] when Task.task_equal t' task ->
436
             callback (TSfailed (id, Noprogress))
437 438 439 440 441
          | _ ->
             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) ->
442
        (* Format.eprintf
443
          "@[Exception raised in Trans.apply_transform %s:@ %a@.@]"
444
          name Exn_printer.exn_printer e; TODO *)
445
        callback (TSfailed (id, e))
446 447
    end;
    false
448 449 450
  in
  S.idle ~prio:0 apply_trans;
  callback TSscheduled
Clément Fumex's avatar
Clément Fumex committed
451

452 453
let schedule_transformation c id name args ~callback =
  let callback s = (match s with
454 455 456 457 458 459 460
      | TSdone tid ->
        let has_subtasks =
          match get_sub_tasks c.controller_session tid with
          | [] -> true
          | _ -> false
        in
        update_trans_node c tid has_subtasks
461
      | TSfailed _e -> ()
462
      | _ -> ()); callback s in
463 464 465 466
  schedule_transformation_r c id name args ~callback

open Strategy

MARCHE Claude's avatar
MARCHE Claude committed
467
let run_strategy_on_goal c id strat ~callback_pa ~callback_tr ~callback =
468 469 470 471 472 473
  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
474 475
         let callback panid res =
           callback_pa panid res;
476 477 478 479 480 481 482 483 484 485 486
           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
           | Interrupted | InternalFailure _
           | 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
487
           | Unedited | JustEdited | Uninstalled _ ->
488 489 490 491 492 493 494 495 496
                         (* should not happen *)
                         assert false
         in
         let limit = { Call_provers.empty_limit with
                       Call_provers.limit_time = timelimit;
                       limit_mem  = memlimit} in
         schedule_proof_attempt c g p ~limit ~callback
      | Itransform(trname,pcsuccess) ->
         let callback ntr =
MARCHE Claude's avatar
MARCHE Claude committed
497
           callback_tr ntr;
498
           match ntr with
499
           | TSfailed _e -> (* transformation failed *)
500 501 502 503 504 505 506 507 508 509 510 511
              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
512
                (get_sub_tasks c.controller_session tid)
513 514 515 516 517 518 519 520
         in
         schedule_transformation c g trname [] ~callback
      | Igoto pc ->
         callback (STSgoto (g,pc));
         exec_strategy pc strat g
  in
  exec_strategy 0 strat id

521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557
let replay_proof_attempt c pr limit (id: proofNodeID) ~callback =

  (* 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
    callback (Uninstalled pr)
  else
    (Queue.add (c, id, pr, limit, callback) scheduled_proof_attempts;
     callback Scheduled;
     run_timeout_handler ())

type report =
  | Result of Call_provers.prover_result * Call_provers.prover_result
  (** Result(new_result,old_result) *)
  | CallFailed of exn
  | 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
  | CallFailed _ ->
    Format.fprintf fmt "Callfailed@."
  | 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 *)
558
let replay_print fmt (lr: (proofNodeID * Whyconf.prover * Call_provers.resource_limit * report) list) =
559 560 561 562
  let pp_elem fmt (id, pr, rl, report) =
    fprintf fmt "ProofNodeID: %d, Prover: %a, Timelimit?: %d, Result: %a@."
      (Obj.magic id) Whyconf.print_prover pr rl.Call_provers.limit_time print_report report
  in
563
  Format.fprintf fmt "%a@." (Pp.print_list Pp.newline pp_elem) lr
564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638

let replay ~remove_obsolete ~use_steps c ~callback =

  (* === Side functions used by replay === *)
  let counting s count =
    match s with
    | Interrupted -> count := !count - 1
    | Done _ -> count := !count - 1
    | InternalFailure _ -> count := !count - 1
    | Uninstalled _ -> count := !count - 1
    | _ -> () in

  let craft_report s r id pr limits pa =
    match s with
    | Interrupted -> assert false
(* Never happen r := (id, pr, limits, CallFailed (User_interrupt)) :: !r *)
    | Done new_r ->
        (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 ->
        r := (id, pr, limits, CallFailed (e)) :: !r
    | Uninstalled _ -> r := (id, pr, limits, Prover_not_installed) :: !r;
    | _ -> () in

  let update_node pa s =
    match s with
    | Done new_r ->
        (pa.Session_itp.proof_state <- Some new_r;
         pa.proof_obsolete <- false)
    | InternalFailure _ ->
        pa.proof_obsolete <- true
    | Uninstalled _ ->
        pa.proof_obsolete <- true
    | _ -> () in

  let update_uninstalled c remove_obsolete id s pr =
    match s with
    | Uninstalled _ ->
        if remove_obsolete then
          remove_proof_attempt c.controller_session id pr
        else
          ()
    | _ -> () in

  (* === 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
    (fun _ _ -> count := !count + 1) session;

  (* Replaying function *)
  let replay_pa id pa =
    let pr = pa.prover in
    (* If use_steps, we give only steps as a limit *)
    let limit =
      if use_steps then
        Call_provers.{empty_limit with limit_steps = pa.limit.limit_steps}
      else
        pa.limit
    in
    replay_proof_attempt c pr limit id
      ~callback:(fun s ->
        counting s count; craft_report s report id pr limit pa; update_node pa s;
        update_uninstalled c remove_obsolete id s pr;
        if !count = 0 then callback !report) in

  (* Calling replay on all the proof_attempts of the session *)
  Session_itp.session_iter_proof_attempt
    (fun id pa -> replay_pa id pa) session

639
end