(*Some (ThreadPool.getThreadR Htid, virtue1)*)
(*Some virtue2*)

Lemma schedfail_step_diagram:
forall (m : option mem) (tge : HybridMachineSig.G)
(U : list nat) (tr1 tr2 : HybridMachineSig.event_trace)
(st1' : ThreadPool (Some hb)) (m1' : mem)
(st2 : ThreadPool (Some (S hb))) (m2 : mem)
(tid : nat) cd mu,
concur_match cd mu st1' m1' st2 m2 ->
List.Forall2 (inject_mevent mu) tr1 tr2 ->
HybridMachineSig.schedPeek U = Some tid ->
~ ThreadPool.containsThread st1' tid ->
HybridMachineSig.invariant st1' ->
HybridMachineSig.mem_compatible st1' m1' ->
exists
(st2' : ThreadPool (Some (S hb))) (m2' : mem)
(cd' : option compiler_index) (mu' : meminj),
concur_match cd' mu' st1' m1' st2' m2' /\
List.Forall2 (inject_mevent mu') tr1 tr2 /\
machine_semantics.machine_step (HybConcSem (Some (S hb)) m) tge
U tr2 st2 m2 (HybridMachineSig.schedSkip U) tr2 st2' m2'.