Algo.fibonacci_heap.Generated definitions
DefinitionAlgo_fibonacci_heap_GeneratedDefinitions and required structural lemmas from Algo.fibonacci_heap.Generated. Source declarations are retained by compiler-reported ranges; imports are redirected to the corresponding definition bundles. This bundle contains no theorem stubs.
Algo2Lean provenance and reproduction. These definitions target Algo2Lean v0.1.4, using the compiler source at public commit 0f79d5e4242e6477531c9ee4410409f5b1c92f76, and Lean 4.33.1. The versioned compiler location is Algo2Lean v0.1.4. Compile all supplied .algo files and imports to reproduce the raw generated definitions. Release publication and exact website parity require their separately recorded checks; this metadata alone does not assert them. Prove2Me imports and declaration packaging are mechanically adapted, with original hashes, compiler-reported source ranges, and adaptations recorded in transplant provenance. Exact reproduction does not prove the compiler correct.
import Definitions.Def_Algo2LeanLib_Modules
set_option autoImplicit true
set_option backward.isDefEq.respectTransparency false
set_option backward.defeqAttrib.useBackward true
-- Generated by Algo2Lean 0.1.4 https://github.com/lunjiah/algo2lean
namespace Algo.«fibonacci_heap»
open _root_.Algo2LeanGenerated
-- Independently compiled module; imported algorithms keep their own transitions.
namespace Algo2LeanGenerated
abbrev Ref_FibonacciHeap := ObjectRef
-- Shallow class membership; fields and referenced objects are observed separately.
def is_FibonacciHeap (h : Heap) (ref : Ref_FibonacciHeap) : Prop :=
ref < h.nextObject ∧ h.objectClass ref = some "fibonacci_heap.FibonacciHeap"
instance (h : Heap) (ref : Ref_FibonacciHeap) : Decidable (is_FibonacciHeap h ref) :=
inferInstanceAs (Decidable (ref < h.nextObject ∧ h.objectClass ref = some "fibonacci_heap.FibonacciHeap"))
def field_FibonacciHeap_keys (h : Heap) (ref : Ref_FibonacciHeap) : Option SeqRef :=
if is_FibonacciHeap h ref then (h.readField ref "keys").bind ObjectValue.asSeq else none
def set_FibonacciHeap_keys (h : Heap) (ref : Ref_FibonacciHeap) (value : SeqRef) : Heap :=
h.writeField ref "keys" (ObjectValue.seqValue value)
@[simp] theorem field_FibonacciHeap_keys_set (h : Heap) (ref : Ref_FibonacciHeap) (value : SeqRef)
(valid : is_FibonacciHeap h ref) :
field_FibonacciHeap_keys (set_FibonacciHeap_keys h ref value) ref = some value := by
have valid' : is_FibonacciHeap (set_FibonacciHeap_keys h ref value) ref := by
simpa [set_FibonacciHeap_keys, is_FibonacciHeap] using valid
rw [field_FibonacciHeap_keys, if_pos valid']
unfold set_FibonacciHeap_keys
rw [Heap.readField_writeField_same h ref "keys" _ "fibonacci_heap.FibonacciHeap" valid.2]
rfl
def field_FibonacciHeap_parents (h : Heap) (ref : Ref_FibonacciHeap) : Option SeqRef :=
if is_FibonacciHeap h ref then (h.readField ref "parents").bind ObjectValue.asSeq else none
def set_FibonacciHeap_parents (h : Heap) (ref : Ref_FibonacciHeap) (value : SeqRef) : Heap :=
h.writeField ref "parents" (ObjectValue.seqValue value)
@[simp] theorem field_FibonacciHeap_parents_set (h : Heap) (ref : Ref_FibonacciHeap) (value : SeqRef)
(valid : is_FibonacciHeap h ref) :
field_FibonacciHeap_parents (set_FibonacciHeap_parents h ref value) ref = some value := by
have valid' : is_FibonacciHeap (set_FibonacciHeap_parents h ref value) ref := by
simpa [set_FibonacciHeap_parents, is_FibonacciHeap] using valid
rw [field_FibonacciHeap_parents, if_pos valid']
unfold set_FibonacciHeap_parents
rw [Heap.readField_writeField_same h ref "parents" _ "fibonacci_heap.FibonacciHeap" valid.2]
rfl
def field_FibonacciHeap_children (h : Heap) (ref : Ref_FibonacciHeap) : Option SeqRef :=
if is_FibonacciHeap h ref then (h.readField ref "children").bind ObjectValue.asSeq else none
def set_FibonacciHeap_children (h : Heap) (ref : Ref_FibonacciHeap) (value : SeqRef) : Heap :=
h.writeField ref "children" (ObjectValue.seqValue value)
@[simp] theorem field_FibonacciHeap_children_set (h : Heap) (ref : Ref_FibonacciHeap) (value : SeqRef)
(valid : is_FibonacciHeap h ref) :
field_FibonacciHeap_children (set_FibonacciHeap_children h ref value) ref = some value := by
have valid' : is_FibonacciHeap (set_FibonacciHeap_children h ref value) ref := by
simpa [set_FibonacciHeap_children, is_FibonacciHeap] using valid
rw [field_FibonacciHeap_children, if_pos valid']
unfold set_FibonacciHeap_children
rw [Heap.readField_writeField_same h ref "children" _ "fibonacci_heap.FibonacciHeap" valid.2]
rfl
def field_FibonacciHeap_left (h : Heap) (ref : Ref_FibonacciHeap) : Option SeqRef :=
if is_FibonacciHeap h ref then (h.readField ref "left").bind ObjectValue.asSeq else none
def set_FibonacciHeap_left (h : Heap) (ref : Ref_FibonacciHeap) (value : SeqRef) : Heap :=
h.writeField ref "left" (ObjectValue.seqValue value)
@[simp] theorem field_FibonacciHeap_left_set (h : Heap) (ref : Ref_FibonacciHeap) (value : SeqRef)
(valid : is_FibonacciHeap h ref) :
field_FibonacciHeap_left (set_FibonacciHeap_left h ref value) ref = some value := by
have valid' : is_FibonacciHeap (set_FibonacciHeap_left h ref value) ref := by
simpa [set_FibonacciHeap_left, is_FibonacciHeap] using valid
rw [field_FibonacciHeap_left, if_pos valid']
unfold set_FibonacciHeap_left
rw [Heap.readField_writeField_same h ref "left" _ "fibonacci_heap.FibonacciHeap" valid.2]
rfl
def field_FibonacciHeap_right (h : Heap) (ref : Ref_FibonacciHeap) : Option SeqRef :=
if is_FibonacciHeap h ref then (h.readField ref "right").bind ObjectValue.asSeq else none
def set_FibonacciHeap_right (h : Heap) (ref : Ref_FibonacciHeap) (value : SeqRef) : Heap :=
h.writeField ref "right" (ObjectValue.seqValue value)
@[simp] theorem field_FibonacciHeap_right_set (h : Heap) (ref : Ref_FibonacciHeap) (value : SeqRef)
(valid : is_FibonacciHeap h ref) :
field_FibonacciHeap_right (set_FibonacciHeap_right h ref value) ref = some value := by
have valid' : is_FibonacciHeap (set_FibonacciHeap_right h ref value) ref := by
simpa [set_FibonacciHeap_right, is_FibonacciHeap] using valid
rw [field_FibonacciHeap_right, if_pos valid']
unfold set_FibonacciHeap_right
rw [Heap.readField_writeField_same h ref "right" _ "fibonacci_heap.FibonacciHeap" valid.2]
rfl
def field_FibonacciHeap_degrees (h : Heap) (ref : Ref_FibonacciHeap) : Option SeqRef :=
if is_FibonacciHeap h ref then (h.readField ref "degrees").bind ObjectValue.asSeq else none
def set_FibonacciHeap_degrees (h : Heap) (ref : Ref_FibonacciHeap) (value : SeqRef) : Heap :=
h.writeField ref "degrees" (ObjectValue.seqValue value)
@[simp] theorem field_FibonacciHeap_degrees_set (h : Heap) (ref : Ref_FibonacciHeap) (value : SeqRef)
(valid : is_FibonacciHeap h ref) :
field_FibonacciHeap_degrees (set_FibonacciHeap_degrees h ref value) ref = some value := by
have valid' : is_FibonacciHeap (set_FibonacciHeap_degrees h ref value) ref := by
simpa [set_FibonacciHeap_degrees, is_FibonacciHeap] using valid
rw [field_FibonacciHeap_degrees, if_pos valid']
unfold set_FibonacciHeap_degrees
rw [Heap.readField_writeField_same h ref "degrees" _ "fibonacci_heap.FibonacciHeap" valid.2]
rfl
def field_FibonacciHeap_marks (h : Heap) (ref : Ref_FibonacciHeap) : Option SeqRef :=
if is_FibonacciHeap h ref then (h.readField ref "marks").bind ObjectValue.asSeq else none
def set_FibonacciHeap_marks (h : Heap) (ref : Ref_FibonacciHeap) (value : SeqRef) : Heap :=
h.writeField ref "marks" (ObjectValue.seqValue value)
@[simp] theorem field_FibonacciHeap_marks_set (h : Heap) (ref : Ref_FibonacciHeap) (value : SeqRef)
(valid : is_FibonacciHeap h ref) :
field_FibonacciHeap_marks (set_FibonacciHeap_marks h ref value) ref = some value := by
have valid' : is_FibonacciHeap (set_FibonacciHeap_marks h ref value) ref := by
simpa [set_FibonacciHeap_marks, is_FibonacciHeap] using valid
rw [field_FibonacciHeap_marks, if_pos valid']
unfold set_FibonacciHeap_marks
rw [Heap.readField_writeField_same h ref "marks" _ "fibonacci_heap.FibonacciHeap" valid.2]
rfl
def field_FibonacciHeap_present (h : Heap) (ref : Ref_FibonacciHeap) : Option SeqRef :=
if is_FibonacciHeap h ref then (h.readField ref "present").bind ObjectValue.asSeq else none
def set_FibonacciHeap_present (h : Heap) (ref : Ref_FibonacciHeap) (value : SeqRef) : Heap :=
h.writeField ref "present" (ObjectValue.seqValue value)
@[simp] theorem field_FibonacciHeap_present_set (h : Heap) (ref : Ref_FibonacciHeap) (value : SeqRef)
(valid : is_FibonacciHeap h ref) :
field_FibonacciHeap_present (set_FibonacciHeap_present h ref value) ref = some value := by
have valid' : is_FibonacciHeap (set_FibonacciHeap_present h ref value) ref := by
simpa [set_FibonacciHeap_present, is_FibonacciHeap] using valid
rw [field_FibonacciHeap_present, if_pos valid']
unfold set_FibonacciHeap_present
rw [Heap.readField_writeField_same h ref "present" _ "fibonacci_heap.FibonacciHeap" valid.2]
rfl
def field_FibonacciHeap_table (h : Heap) (ref : Ref_FibonacciHeap) : Option SeqRef :=
if is_FibonacciHeap h ref then (h.readField ref "table").bind ObjectValue.asSeq else none
def set_FibonacciHeap_table (h : Heap) (ref : Ref_FibonacciHeap) (value : SeqRef) : Heap :=
h.writeField ref "table" (ObjectValue.seqValue value)
@[simp] theorem field_FibonacciHeap_table_set (h : Heap) (ref : Ref_FibonacciHeap) (value : SeqRef)
(valid : is_FibonacciHeap h ref) :
field_FibonacciHeap_table (set_FibonacciHeap_table h ref value) ref = some value := by
have valid' : is_FibonacciHeap (set_FibonacciHeap_table h ref value) ref := by
simpa [set_FibonacciHeap_table, is_FibonacciHeap] using valid
rw [field_FibonacciHeap_table, if_pos valid']
unfold set_FibonacciHeap_table
rw [Heap.readField_writeField_same h ref "table" _ "fibonacci_heap.FibonacciHeap" valid.2]
rfl
def field_FibonacciHeap_minimum (h : Heap) (ref : Ref_FibonacciHeap) : Option Int :=
if is_FibonacciHeap h ref then (h.readField ref "minimum").bind ObjectValue.asInt else none
def set_FibonacciHeap_minimum (h : Heap) (ref : Ref_FibonacciHeap) (value : Int) : Heap :=
h.writeField ref "minimum" (ObjectValue.intValue value)
@[simp] theorem field_FibonacciHeap_minimum_set (h : Heap) (ref : Ref_FibonacciHeap) (value : Int)
(valid : is_FibonacciHeap h ref) :
field_FibonacciHeap_minimum (set_FibonacciHeap_minimum h ref value) ref = some value := by
have valid' : is_FibonacciHeap (set_FibonacciHeap_minimum h ref value) ref := by
simpa [set_FibonacciHeap_minimum, is_FibonacciHeap] using valid
rw [field_FibonacciHeap_minimum, if_pos valid']
unfold set_FibonacciHeap_minimum
rw [Heap.readField_writeField_same h ref "minimum" _ "fibonacci_heap.FibonacciHeap" valid.2]
rfl
def field_FibonacciHeap_size (h : Heap) (ref : Ref_FibonacciHeap) : Option Int :=
if is_FibonacciHeap h ref then (h.readField ref "size").bind ObjectValue.asInt else none
def set_FibonacciHeap_size (h : Heap) (ref : Ref_FibonacciHeap) (value : Int) : Heap :=
h.writeField ref "size" (ObjectValue.intValue value)
@[simp] theorem field_FibonacciHeap_size_set (h : Heap) (ref : Ref_FibonacciHeap) (value : Int)
(valid : is_FibonacciHeap h ref) :
field_FibonacciHeap_size (set_FibonacciHeap_size h ref value) ref = some value := by
have valid' : is_FibonacciHeap (set_FibonacciHeap_size h ref value) ref := by
simpa [set_FibonacciHeap_size, is_FibonacciHeap] using valid
rw [field_FibonacciHeap_size, if_pos valid']
unfold set_FibonacciHeap_size
rw [Heap.readField_writeField_same h ref "size" _ "fibonacci_heap.FibonacciHeap" valid.2]
rfl
/-- Build input data directly; this helper does not execute `__init__`. -/
def create_FibonacciHeap (h : Heap) (value_keys : SeqRef) (value_parents : SeqRef) (value_children : SeqRef) (value_left : SeqRef) (value_right : SeqRef) (value_degrees : SeqRef) (value_marks : SeqRef) (value_present : SeqRef) (value_table : SeqRef) (value_minimum : Int) (value_size : Int) : Heap × Ref_FibonacciHeap :=
let ref := h.nextObject
let h := h.allocateObject "fibonacci_heap.FibonacciHeap"
let h := set_FibonacciHeap_keys h ref value_keys
let h := set_FibonacciHeap_parents h ref value_parents
let h := set_FibonacciHeap_children h ref value_children
let h := set_FibonacciHeap_left h ref value_left
let h := set_FibonacciHeap_right h ref value_right
let h := set_FibonacciHeap_degrees h ref value_degrees
let h := set_FibonacciHeap_marks h ref value_marks
let h := set_FibonacciHeap_present h ref value_present
let h := set_FibonacciHeap_table h ref value_table
let h := set_FibonacciHeap_minimum h ref value_minimum
let h := set_FibonacciHeap_size h ref value_size
(h, ref)
structure State_FibonacciHeap___init__ where
v0 : Ref_FibonacciHeap := 0 -- self
t1 : Unit := () -- temporary
t2 : SeqRef := 0 -- temporary
t3 : Ref_FibonacciHeap := 0 -- temporary
t4 : Int := 0 -- temporary
t5 : SeqRef := 0 -- temporary
t6 : Ref_FibonacciHeap := 0 -- temporary
t7 : Int := 0 -- temporary
t8 : SeqRef := 0 -- temporary
t9 : Ref_FibonacciHeap := 0 -- temporary
t10 : Int := 0 -- temporary
t11 : SeqRef := 0 -- temporary
t12 : Ref_FibonacciHeap := 0 -- temporary
t13 : Int := 0 -- temporary
t14 : SeqRef := 0 -- temporary
t15 : Ref_FibonacciHeap := 0 -- temporary
t16 : Int := 0 -- temporary
t17 : SeqRef := 0 -- temporary
t18 : Ref_FibonacciHeap := 0 -- temporary
t19 : Int := 0 -- temporary
t20 : SeqRef := 0 -- temporary
t21 : Ref_FibonacciHeap := 0 -- temporary
t22 : Int := 0 -- temporary
t23 : SeqRef := 0 -- temporary
t24 : Ref_FibonacciHeap := 0 -- temporary
t25 : Int := 0 -- temporary
t26 : SeqRef := 0 -- temporary
t27 : Ref_FibonacciHeap := 0 -- temporary
t28 : Int := 0 -- temporary
structure State_FibonacciHeap_remove_from_ring where
v0 : Ref_FibonacciHeap := 0 -- self
v1 : Int := 0 -- vertex
v2 : Int := 0 -- before
v3 : Int := 0 -- after
t4 : Unit := () -- temporary
structure State_FibonacciHeap_add_root where
v0 : Ref_FibonacciHeap := 0 -- self
v1 : Int := 0 -- vertex
v2 : Int := 0 -- first
v3 : Int := 0 -- after
t4 : Unit := () -- temporary
t5 : Bool := false -- temporary
t6 : Bool := false -- temporary
structure State_FibonacciHeap_link where
v0 : Ref_FibonacciHeap := 0 -- self
v1 : Int := 0 -- child
v2 : Int := 0 -- parent
v3 : Int := 0 -- first
v4 : Int := 0 -- before
t5 : Unit := () -- temporary
t6 : Bool := false -- temporary
structure State_FibonacciHeap_consolidate where
v0 : Ref_FibonacciHeap := 0 -- self
v1 : SeqRef := 0 -- table
v2 : Int := 0 -- maximum_degree
v3 : Int := 0 -- vertex
v4 : Int := 0 -- degree
v5 : Int := 0 -- other
v6 : Int := 0 -- temporary
t7 : Unit := () -- temporary
t8 : Bool := false -- temporary
t9 : Bool := false -- temporary
t10 : Unit := () -- temporary
t11 : Ref_FibonacciHeap := 0 -- temporary
t12 : Int := 0 -- temporary
t13 : Bool := false -- temporary
t14 : Bool := false -- temporary
t15 : Bool := false -- temporary
t16 : Unit := () -- temporary
t17 : Ref_FibonacciHeap := 0 -- temporary
t18 : Int := 0 -- temporary
t19 : Int := 0 -- temporary
t20 : Bool := false -- temporary
t21 : Unit := () -- temporary
t22 : Ref_FibonacciHeap := 0 -- temporary
t23 : Int := 0 -- temporary
t24 : Bool := false -- temporary
structure State_FibonacciHeap_cut where
v0 : Ref_FibonacciHeap := 0 -- self
v1 : Int := 0 -- vertex
v2 : Int := 0 -- parent
t3 : Unit := () -- temporary
t4 : Unit := () -- temporary
t5 : Ref_FibonacciHeap := 0 -- temporary
t6 : Int := 0 -- temporary
t7 : Unit := () -- temporary
t8 : Ref_FibonacciHeap := 0 -- temporary
t9 : Int := 0 -- temporary
t10 : Bool := false -- temporary
t11 : Bool := false -- temporary
structure State_FibonacciHeap_cascading_cut where
v0 : Ref_FibonacciHeap := 0 -- self
v1 : Int := 0 -- vertex
v2 : Int := 0 -- parent
t3 : Unit := () -- temporary
t4 : Bool := false -- temporary
t5 : Unit := () -- temporary
t6 : Ref_FibonacciHeap := 0 -- temporary
t7 : Int := 0 -- temporary
t8 : Int := 0 -- temporary
t9 : Bool := false -- temporary
t10 : Unit := () -- temporary
structure State_FibonacciHeap_push_or_decrease where
v0 : Ref_FibonacciHeap := 0 -- self
v1 : Int := 0 -- vertex
v2 : Int := 0 -- key
v3 : Int := 0 -- parent
t4 : Unit := () -- temporary
t5 : Bool := false -- temporary
t6 : Bool := false -- temporary
t7 : Bool := false -- temporary
t8 : Unit := () -- temporary
t9 : Ref_FibonacciHeap := 0 -- temporary
t10 : Int := 0 -- temporary
t11 : Unit := () -- temporary
t12 : Ref_FibonacciHeap := 0 -- temporary
t13 : Int := 0 -- temporary
t14 : Int := 0 -- temporary
t15 : Bool := false -- temporary
t16 : Unit := () -- temporary
t17 : Bool := false -- temporary
t18 : Unit := () -- temporary
t19 : Unit := () -- temporary
t20 : Ref_FibonacciHeap := 0 -- temporary
t21 : Int := 0 -- temporary
t22 : Ref_FibonacciHeap := 0 -- temporary
t23 : Int := 0 -- temporary
t24 : Int := 0 -- temporary
structure State_FibonacciHeap_pop_min where
v0 : Ref_FibonacciHeap := 0 -- self
v1 : Int := 0 -- vertex
v2 : Int := 0 -- child
v3 : Int := 0 -- after
t4 : Int := 0 -- temporary
t5 : Bool := false -- temporary
t6 : Unit := () -- temporary
t7 : Ref_FibonacciHeap := 0 -- temporary
t8 : Ref_FibonacciHeap := 0 -- temporary
t9 : Int := 0 -- temporary
t10 : Int := 0 -- temporary
t11 : Unit := () -- temporary
t12 : Ref_FibonacciHeap := 0 -- temporary
t13 : Int := 0 -- temporary
t14 : Bool := false -- temporary
t15 : Unit := () -- temporary
t16 : Ref_FibonacciHeap := 0 -- temporary
t17 : Int := 0 -- temporary
t18 : Unit := () -- temporary
t19 : Ref_FibonacciHeap := 0 -- temporary
t20 : Int := 0 -- temporary
t21 : Bool := false -- temporary
t22 : Bool := false -- temporary
t23 : Int := 0 -- temporary
structure State_FibonacciHeap_is_empty where
v0 : Ref_FibonacciHeap := 0 -- self
t1 : Bool := false -- temporary
structure State_FibonacciHeap where
v0 : Ref_FibonacciHeap := 0 -- _instance
t1 : Ref_FibonacciHeap := 0 -- temporary
t2 : Unit := () -- temporary
t3 : Ref_FibonacciHeap := 0 -- temporary
t4 : Ref_FibonacciHeap := 0 -- temporary
inductive Frame where
| invalid
| fn_FibonacciHeap___init__ (pc : Nat) (state : State_FibonacciHeap___init__)
| fn_FibonacciHeap_remove_from_ring (pc : Nat) (state : State_FibonacciHeap_remove_from_ring)
| fn_FibonacciHeap_add_root (pc : Nat) (state : State_FibonacciHeap_add_root)
| fn_FibonacciHeap_link (pc : Nat) (state : State_FibonacciHeap_link)
| fn_FibonacciHeap_consolidate (pc : Nat) (state : State_FibonacciHeap_consolidate)
| fn_FibonacciHeap_cut (pc : Nat) (state : State_FibonacciHeap_cut)
| fn_FibonacciHeap_cascading_cut (pc : Nat) (state : State_FibonacciHeap_cascading_cut)
| fn_FibonacciHeap_push_or_decrease (pc : Nat) (state : State_FibonacciHeap_push_or_decrease)
| fn_FibonacciHeap_pop_min (pc : Nat) (state : State_FibonacciHeap_pop_min)
| fn_FibonacciHeap_is_empty (pc : Nat) (state : State_FibonacciHeap_is_empty)
| fn_FibonacciHeap (pc : Nat) (state : State_FibonacciHeap)
inductive Result where
| fn_FibonacciHeap___init__ (value : Unit)
| fn_FibonacciHeap_remove_from_ring (value : Unit)
| fn_FibonacciHeap_add_root (value : Unit)
| fn_FibonacciHeap_link (value : Unit)
| fn_FibonacciHeap_consolidate (value : Unit)
| fn_FibonacciHeap_cut (value : Unit)
| fn_FibonacciHeap_cascading_cut (value : Unit)
| fn_FibonacciHeap_push_or_decrease (value : Unit)
| fn_FibonacciHeap_pop_min (value : Int)
| fn_FibonacciHeap_is_empty (value : Bool)
| fn_FibonacciHeap (value : Ref_FibonacciHeap)
abbrev Configuration := Algo2LeanCore.Config Heap (Frame) Result
abbrev Stack := Algo2LeanCore.Stack (Frame) Result
abbrev Transcript := List (Configuration)
inductive Step : Configuration → Configuration → Prop where
| FibonacciHeap___init___pc1 (h : Heap) (s : State_FibonacciHeap___init__) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap___init__ 1 s) stack) (Algo2LeanCore.resumeConfig h (Result.fn_FibonacciHeap___init__ (s.t1)) stack)
| FibonacciHeap___init___pc2 (h : Heap) (s : State_FibonacciHeap___init__) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap___init__ 2 s) stack) (.active h (Frame.fn_FibonacciHeap___init__ 1 { s with t1 := () }) stack)
| FibonacciHeap___init___pc3 (h : Heap) (s : State_FibonacciHeap___init__) (stack : Stack) (defined : (is_FibonacciHeap h (s.v0))) :
Step (.active h (Frame.fn_FibonacciHeap___init__ 3 s) stack) (.active (set_FibonacciHeap_size h (s.v0) ((0 : Int))) (Frame.fn_FibonacciHeap___init__ 2 s) stack)
| FibonacciHeap___init___pc4 (h : Heap) (s : State_FibonacciHeap___init__) (stack : Stack) (defined : (is_FibonacciHeap h (s.v0))) :
Step (.active h (Frame.fn_FibonacciHeap___init__ 4 s) stack) (.active (set_FibonacciHeap_minimum h (s.v0) ((-(1 : Int)))) (Frame.fn_FibonacciHeap___init__ 3 s) stack)
| FibonacciHeap___init___pc5 (h : Heap) (s : State_FibonacciHeap___init__) (stack : Stack) (defined : (is_FibonacciHeap h (s.t3))) :
Step (.active h (Frame.fn_FibonacciHeap___init__ 5 s) stack) (.active (set_FibonacciHeap_table h (s.t3) (s.t2)) (Frame.fn_FibonacciHeap___init__ 4 s) stack)
| FibonacciHeap___init___pc6 (h : Heap) (s : State_FibonacciHeap___init__) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap___init__ 6 s) stack) (.active h (Frame.fn_FibonacciHeap___init__ 5 { s with t3 := s.v0 }) stack)
| FibonacciHeap___init___pc7 (h : Heap) (s : State_FibonacciHeap___init__) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap___init__ 7 s) stack) (.active (h.allocate (fun _ => s.t4)) (Frame.fn_FibonacciHeap___init__ 6 { s with t2 := h.nextRef }) stack)
| FibonacciHeap___init___pc8 (h : Heap) (s : State_FibonacciHeap___init__) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap___init__ 8 s) stack) (.active h (Frame.fn_FibonacciHeap___init__ 7 { s with t4 := (-(1 : Int)) }) stack)
| FibonacciHeap___init___pc9 (h : Heap) (s : State_FibonacciHeap___init__) (stack : Stack) (defined : (is_FibonacciHeap h (s.t6))) :
Step (.active h (Frame.fn_FibonacciHeap___init__ 9 s) stack) (.active (set_FibonacciHeap_present h (s.t6) (s.t5)) (Frame.fn_FibonacciHeap___init__ 8 s) stack)
| FibonacciHeap___init___pc10 (h : Heap) (s : State_FibonacciHeap___init__) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap___init__ 10 s) stack) (.active h (Frame.fn_FibonacciHeap___init__ 9 { s with t6 := s.v0 }) stack)
| FibonacciHeap___init___pc11 (h : Heap) (s : State_FibonacciHeap___init__) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap___init__ 11 s) stack) (.active (h.allocate (fun _ => s.t7)) (Frame.fn_FibonacciHeap___init__ 10 { s with t5 := h.nextRef }) stack)
| FibonacciHeap___init___pc12 (h : Heap) (s : State_FibonacciHeap___init__) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap___init__ 12 s) stack) (.active h (Frame.fn_FibonacciHeap___init__ 11 { s with t7 := (0 : Int) }) stack)
| FibonacciHeap___init___pc13 (h : Heap) (s : State_FibonacciHeap___init__) (stack : Stack) (defined : (is_FibonacciHeap h (s.t9))) :
Step (.active h (Frame.fn_FibonacciHeap___init__ 13 s) stack) (.active (set_FibonacciHeap_marks h (s.t9) (s.t8)) (Frame.fn_FibonacciHeap___init__ 12 s) stack)
| FibonacciHeap___init___pc14 (h : Heap) (s : State_FibonacciHeap___init__) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap___init__ 14 s) stack) (.active h (Frame.fn_FibonacciHeap___init__ 13 { s with t9 := s.v0 }) stack)
| FibonacciHeap___init___pc15 (h : Heap) (s : State_FibonacciHeap___init__) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap___init__ 15 s) stack) (.active (h.allocate (fun _ => s.t10)) (Frame.fn_FibonacciHeap___init__ 14 { s with t8 := h.nextRef }) stack)
| FibonacciHeap___init___pc16 (h : Heap) (s : State_FibonacciHeap___init__) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap___init__ 16 s) stack) (.active h (Frame.fn_FibonacciHeap___init__ 15 { s with t10 := (0 : Int) }) stack)
| FibonacciHeap___init___pc17 (h : Heap) (s : State_FibonacciHeap___init__) (stack : Stack) (defined : (is_FibonacciHeap h (s.t12))) :
Step (.active h (Frame.fn_FibonacciHeap___init__ 17 s) stack) (.active (set_FibonacciHeap_degrees h (s.t12) (s.t11)) (Frame.fn_FibonacciHeap___init__ 16 s) stack)
| FibonacciHeap___init___pc18 (h : Heap) (s : State_FibonacciHeap___init__) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap___init__ 18 s) stack) (.active h (Frame.fn_FibonacciHeap___init__ 17 { s with t12 := s.v0 }) stack)
| FibonacciHeap___init___pc19 (h : Heap) (s : State_FibonacciHeap___init__) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap___init__ 19 s) stack) (.active (h.allocate (fun _ => s.t13)) (Frame.fn_FibonacciHeap___init__ 18 { s with t11 := h.nextRef }) stack)
| FibonacciHeap___init___pc20 (h : Heap) (s : State_FibonacciHeap___init__) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap___init__ 20 s) stack) (.active h (Frame.fn_FibonacciHeap___init__ 19 { s with t13 := (0 : Int) }) stack)
| FibonacciHeap___init___pc21 (h : Heap) (s : State_FibonacciHeap___init__) (stack : Stack) (defined : (is_FibonacciHeap h (s.t15))) :
Step (.active h (Frame.fn_FibonacciHeap___init__ 21 s) stack) (.active (set_FibonacciHeap_right h (s.t15) (s.t14)) (Frame.fn_FibonacciHeap___init__ 20 s) stack)
| FibonacciHeap___init___pc22 (h : Heap) (s : State_FibonacciHeap___init__) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap___init__ 22 s) stack) (.active h (Frame.fn_FibonacciHeap___init__ 21 { s with t15 := s.v0 }) stack)
| FibonacciHeap___init___pc23 (h : Heap) (s : State_FibonacciHeap___init__) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap___init__ 23 s) stack) (.active (h.allocate (fun _ => s.t16)) (Frame.fn_FibonacciHeap___init__ 22 { s with t14 := h.nextRef }) stack)
| FibonacciHeap___init___pc24 (h : Heap) (s : State_FibonacciHeap___init__) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap___init__ 24 s) stack) (.active h (Frame.fn_FibonacciHeap___init__ 23 { s with t16 := (0 : Int) }) stack)
| FibonacciHeap___init___pc25 (h : Heap) (s : State_FibonacciHeap___init__) (stack : Stack) (defined : (is_FibonacciHeap h (s.t18))) :
Step (.active h (Frame.fn_FibonacciHeap___init__ 25 s) stack) (.active (set_FibonacciHeap_left h (s.t18) (s.t17)) (Frame.fn_FibonacciHeap___init__ 24 s) stack)
| FibonacciHeap___init___pc26 (h : Heap) (s : State_FibonacciHeap___init__) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap___init__ 26 s) stack) (.active h (Frame.fn_FibonacciHeap___init__ 25 { s with t18 := s.v0 }) stack)
| FibonacciHeap___init___pc27 (h : Heap) (s : State_FibonacciHeap___init__) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap___init__ 27 s) stack) (.active (h.allocate (fun _ => s.t19)) (Frame.fn_FibonacciHeap___init__ 26 { s with t17 := h.nextRef }) stack)
| FibonacciHeap___init___pc28 (h : Heap) (s : State_FibonacciHeap___init__) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap___init__ 28 s) stack) (.active h (Frame.fn_FibonacciHeap___init__ 27 { s with t19 := (0 : Int) }) stack)
| FibonacciHeap___init___pc29 (h : Heap) (s : State_FibonacciHeap___init__) (stack : Stack) (defined : (is_FibonacciHeap h (s.t21))) :
Step (.active h (Frame.fn_FibonacciHeap___init__ 29 s) stack) (.active (set_FibonacciHeap_children h (s.t21) (s.t20)) (Frame.fn_FibonacciHeap___init__ 28 s) stack)
| FibonacciHeap___init___pc30 (h : Heap) (s : State_FibonacciHeap___init__) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap___init__ 30 s) stack) (.active h (Frame.fn_FibonacciHeap___init__ 29 { s with t21 := s.v0 }) stack)
| FibonacciHeap___init___pc31 (h : Heap) (s : State_FibonacciHeap___init__) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap___init__ 31 s) stack) (.active (h.allocate (fun _ => s.t22)) (Frame.fn_FibonacciHeap___init__ 30 { s with t20 := h.nextRef }) stack)
| FibonacciHeap___init___pc32 (h : Heap) (s : State_FibonacciHeap___init__) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap___init__ 32 s) stack) (.active h (Frame.fn_FibonacciHeap___init__ 31 { s with t22 := (-(1 : Int)) }) stack)
| FibonacciHeap___init___pc33 (h : Heap) (s : State_FibonacciHeap___init__) (stack : Stack) (defined : (is_FibonacciHeap h (s.t24))) :
Step (.active h (Frame.fn_FibonacciHeap___init__ 33 s) stack) (.active (set_FibonacciHeap_parents h (s.t24) (s.t23)) (Frame.fn_FibonacciHeap___init__ 32 s) stack)
| FibonacciHeap___init___pc34 (h : Heap) (s : State_FibonacciHeap___init__) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap___init__ 34 s) stack) (.active h (Frame.fn_FibonacciHeap___init__ 33 { s with t24 := s.v0 }) stack)
| FibonacciHeap___init___pc35 (h : Heap) (s : State_FibonacciHeap___init__) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap___init__ 35 s) stack) (.active (h.allocate (fun _ => s.t25)) (Frame.fn_FibonacciHeap___init__ 34 { s with t23 := h.nextRef }) stack)
| FibonacciHeap___init___pc36 (h : Heap) (s : State_FibonacciHeap___init__) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap___init__ 36 s) stack) (.active h (Frame.fn_FibonacciHeap___init__ 35 { s with t25 := (-(1 : Int)) }) stack)
| FibonacciHeap___init___pc37 (h : Heap) (s : State_FibonacciHeap___init__) (stack : Stack) (defined : (is_FibonacciHeap h (s.t27))) :
Step (.active h (Frame.fn_FibonacciHeap___init__ 37 s) stack) (.active (set_FibonacciHeap_keys h (s.t27) (s.t26)) (Frame.fn_FibonacciHeap___init__ 36 s) stack)
| FibonacciHeap___init___pc38 (h : Heap) (s : State_FibonacciHeap___init__) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap___init__ 38 s) stack) (.active h (Frame.fn_FibonacciHeap___init__ 37 { s with t27 := s.v0 }) stack)
| FibonacciHeap___init___pc39 (h : Heap) (s : State_FibonacciHeap___init__) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap___init__ 39 s) stack) (.active (h.allocate (fun _ => s.t28)) (Frame.fn_FibonacciHeap___init__ 38 { s with t26 := h.nextRef }) stack)
| FibonacciHeap___init___pc40 (h : Heap) (s : State_FibonacciHeap___init__) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap___init__ 40 s) stack) (.active h (Frame.fn_FibonacciHeap___init__ 39 { s with t28 := (0 : Int) }) stack)
| FibonacciHeap_remove_from_ring_pc1 (h : Heap) (s : State_FibonacciHeap_remove_from_ring) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_remove_from_ring 1 s) stack) (Algo2LeanCore.resumeConfig h (Result.fn_FibonacciHeap_remove_from_ring (s.t4)) stack)
| FibonacciHeap_remove_from_ring_pc2 (h : Heap) (s : State_FibonacciHeap_remove_from_ring) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_remove_from_ring 2 s) stack) (.active h (Frame.fn_FibonacciHeap_remove_from_ring 1 { s with t4 := () }) stack)
| FibonacciHeap_remove_from_ring_pc3 (h : Heap) (s : State_FibonacciHeap_remove_from_ring) (stack : Stack) (defined : (((((field_FibonacciHeap_right h (s.v0)).isSome = true)))) ∧ (((field_FibonacciHeap_right h (s.v0)).getD 0) < h.nextRef)) :
Step (.active h (Frame.fn_FibonacciHeap_remove_from_ring 3 s) stack) (.active (h.write ((field_FibonacciHeap_right h (s.v0)).getD 0) s.v1 s.v1) (Frame.fn_FibonacciHeap_remove_from_ring 2 s) stack)
| FibonacciHeap_remove_from_ring_pc4 (h : Heap) (s : State_FibonacciHeap_remove_from_ring) (stack : Stack) (defined : (((((field_FibonacciHeap_left h (s.v0)).isSome = true)))) ∧ (((field_FibonacciHeap_left h (s.v0)).getD 0) < h.nextRef)) :
Step (.active h (Frame.fn_FibonacciHeap_remove_from_ring 4 s) stack) (.active (h.write ((field_FibonacciHeap_left h (s.v0)).getD 0) s.v1 s.v1) (Frame.fn_FibonacciHeap_remove_from_ring 3 s) stack)
| FibonacciHeap_remove_from_ring_pc5 (h : Heap) (s : State_FibonacciHeap_remove_from_ring) (stack : Stack) (defined : (((((field_FibonacciHeap_left h (s.v0)).isSome = true)))) ∧ (((field_FibonacciHeap_left h (s.v0)).getD 0) < h.nextRef)) :
Step (.active h (Frame.fn_FibonacciHeap_remove_from_ring 5 s) stack) (.active (h.write ((field_FibonacciHeap_left h (s.v0)).getD 0) s.v3 s.v2) (Frame.fn_FibonacciHeap_remove_from_ring 4 s) stack)
| FibonacciHeap_remove_from_ring_pc6 (h : Heap) (s : State_FibonacciHeap_remove_from_ring) (stack : Stack) (defined : (((((field_FibonacciHeap_right h (s.v0)).isSome = true)))) ∧ (((field_FibonacciHeap_right h (s.v0)).getD 0) < h.nextRef)) :
Step (.active h (Frame.fn_FibonacciHeap_remove_from_ring 6 s) stack) (.active (h.write ((field_FibonacciHeap_right h (s.v0)).getD 0) s.v2 s.v3) (Frame.fn_FibonacciHeap_remove_from_ring 5 s) stack)
| FibonacciHeap_remove_from_ring_pc7 (h : Heap) (s : State_FibonacciHeap_remove_from_ring) (stack : Stack) (defined : ((((field_FibonacciHeap_right h (s.v0)).isSome = true))) ∧ (((field_FibonacciHeap_right h (s.v0)).getD 0) < h.nextRef)) :
Step (.active h (Frame.fn_FibonacciHeap_remove_from_ring 7 s) stack) (.active h (Frame.fn_FibonacciHeap_remove_from_ring 6 { s with v3 := (h.read ((field_FibonacciHeap_right h (s.v0)).getD 0) s.v1) }) stack)
| FibonacciHeap_remove_from_ring_pc8 (h : Heap) (s : State_FibonacciHeap_remove_from_ring) (stack : Stack) (defined : ((((field_FibonacciHeap_left h (s.v0)).isSome = true))) ∧ (((field_FibonacciHeap_left h (s.v0)).getD 0) < h.nextRef)) :
Step (.active h (Frame.fn_FibonacciHeap_remove_from_ring 8 s) stack) (.active h (Frame.fn_FibonacciHeap_remove_from_ring 7 { s with v2 := (h.read ((field_FibonacciHeap_left h (s.v0)).getD 0) s.v1) }) stack)
| FibonacciHeap_add_root_pc1 (h : Heap) (s : State_FibonacciHeap_add_root) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_add_root 1 s) stack) (Algo2LeanCore.resumeConfig h (Result.fn_FibonacciHeap_add_root (s.t4)) stack)
| FibonacciHeap_add_root_pc2 (h : Heap) (s : State_FibonacciHeap_add_root) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_add_root 2 s) stack) (.active h (Frame.fn_FibonacciHeap_add_root 1 { s with t4 := () }) stack)
| FibonacciHeap_add_root_pc3 (h : Heap) (s : State_FibonacciHeap_add_root) (stack : Stack) (defined : (is_FibonacciHeap h (s.v0))) :
Step (.active h (Frame.fn_FibonacciHeap_add_root 3 s) stack) (.active (set_FibonacciHeap_minimum h (s.v0) (s.v1)) (Frame.fn_FibonacciHeap_add_root 2 s) stack)
| FibonacciHeap_add_root_pc4 (h : Heap) (s : State_FibonacciHeap_add_root) (stack : Stack) (defined : (((((field_FibonacciHeap_right h (s.v0)).isSome = true)))) ∧ (((field_FibonacciHeap_right h (s.v0)).getD 0) < h.nextRef)) :
Step (.active h (Frame.fn_FibonacciHeap_add_root 4 s) stack) (.active (h.write ((field_FibonacciHeap_right h (s.v0)).getD 0) s.v1 s.v1) (Frame.fn_FibonacciHeap_add_root 3 s) stack)
| FibonacciHeap_add_root_pc5 (h : Heap) (s : State_FibonacciHeap_add_root) (stack : Stack) (defined : (((((field_FibonacciHeap_left h (s.v0)).isSome = true)))) ∧ (((field_FibonacciHeap_left h (s.v0)).getD 0) < h.nextRef)) :
Step (.active h (Frame.fn_FibonacciHeap_add_root 5 s) stack) (.active (h.write ((field_FibonacciHeap_left h (s.v0)).getD 0) s.v1 s.v1) (Frame.fn_FibonacciHeap_add_root 4 s) stack)
| FibonacciHeap_add_root_pc6 (h : Heap) (s : State_FibonacciHeap_add_root) (stack : Stack) (defined : (is_FibonacciHeap h (s.v0))) :
Step (.active h (Frame.fn_FibonacciHeap_add_root 6 s) stack) (.active (set_FibonacciHeap_minimum h (s.v0) (s.v1)) (Frame.fn_FibonacciHeap_add_root 2 s) stack)
| FibonacciHeap_add_root_pc7_true (h : Heap) (s : State_FibonacciHeap_add_root) (stack : Stack) (condition : s.t6 = true) :
Step (.active h (Frame.fn_FibonacciHeap_add_root 7 s) stack) (.active h (Frame.fn_FibonacciHeap_add_root 6 s) stack)
| FibonacciHeap_add_root_pc7_false (h : Heap) (s : State_FibonacciHeap_add_root) (stack : Stack) (condition : s.t6 = false) :
Step (.active h (Frame.fn_FibonacciHeap_add_root 7 s) stack) (.active h (Frame.fn_FibonacciHeap_add_root 2 s) stack)
| FibonacciHeap_add_root_pc8 (h : Heap) (s : State_FibonacciHeap_add_root) (stack : Stack) (defined : (((((field_FibonacciHeap_keys h (s.v0)).isSome = true))) ∧ (((field_FibonacciHeap_keys h (s.v0)).getD 0) < h.nextRef))) :
Step (.active h (Frame.fn_FibonacciHeap_add_root 8 s) stack) (.active h (Frame.fn_FibonacciHeap_add_root 7 { s with t6 := (decide (((h.read ((field_FibonacciHeap_keys h (s.v0)).getD 0) s.v1) < (h.read ((field_FibonacciHeap_keys h (s.v0)).getD 0) s.v2)))) }) stack)
| FibonacciHeap_add_root_pc9 (h : Heap) (s : State_FibonacciHeap_add_root) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_add_root 9 s) stack) (.active (h.tick "heap_comparisons" 1) (Frame.fn_FibonacciHeap_add_root 8 s) stack)
| FibonacciHeap_add_root_pc10 (h : Heap) (s : State_FibonacciHeap_add_root) (stack : Stack) (defined : (((((field_FibonacciHeap_left h (s.v0)).isSome = true)))) ∧ (((field_FibonacciHeap_left h (s.v0)).getD 0) < h.nextRef)) :
Step (.active h (Frame.fn_FibonacciHeap_add_root 10 s) stack) (.active (h.write ((field_FibonacciHeap_left h (s.v0)).getD 0) s.v3 s.v1) (Frame.fn_FibonacciHeap_add_root 9 s) stack)
| FibonacciHeap_add_root_pc11 (h : Heap) (s : State_FibonacciHeap_add_root) (stack : Stack) (defined : (((((field_FibonacciHeap_right h (s.v0)).isSome = true)))) ∧ (((field_FibonacciHeap_right h (s.v0)).getD 0) < h.nextRef)) :
Step (.active h (Frame.fn_FibonacciHeap_add_root 11 s) stack) (.active (h.write ((field_FibonacciHeap_right h (s.v0)).getD 0) s.v2 s.v1) (Frame.fn_FibonacciHeap_add_root 10 s) stack)
| FibonacciHeap_add_root_pc12 (h : Heap) (s : State_FibonacciHeap_add_root) (stack : Stack) (defined : (((((field_FibonacciHeap_right h (s.v0)).isSome = true)))) ∧ (((field_FibonacciHeap_right h (s.v0)).getD 0) < h.nextRef)) :
Step (.active h (Frame.fn_FibonacciHeap_add_root 12 s) stack) (.active (h.write ((field_FibonacciHeap_right h (s.v0)).getD 0) s.v1 s.v3) (Frame.fn_FibonacciHeap_add_root 11 s) stack)
| FibonacciHeap_add_root_pc13 (h : Heap) (s : State_FibonacciHeap_add_root) (stack : Stack) (defined : (((((field_FibonacciHeap_left h (s.v0)).isSome = true)))) ∧ (((field_FibonacciHeap_left h (s.v0)).getD 0) < h.nextRef)) :
Step (.active h (Frame.fn_FibonacciHeap_add_root 13 s) stack) (.active (h.write ((field_FibonacciHeap_left h (s.v0)).getD 0) s.v1 s.v2) (Frame.fn_FibonacciHeap_add_root 12 s) stack)
| FibonacciHeap_add_root_pc14 (h : Heap) (s : State_FibonacciHeap_add_root) (stack : Stack) (defined : ((((field_FibonacciHeap_right h (s.v0)).isSome = true))) ∧ (((field_FibonacciHeap_right h (s.v0)).getD 0) < h.nextRef)) :
Step (.active h (Frame.fn_FibonacciHeap_add_root 14 s) stack) (.active h (Frame.fn_FibonacciHeap_add_root 13 { s with v3 := (h.read ((field_FibonacciHeap_right h (s.v0)).getD 0) s.v2) }) stack)
| FibonacciHeap_add_root_pc15 (h : Heap) (s : State_FibonacciHeap_add_root) (stack : Stack) (defined : (((field_FibonacciHeap_minimum h (s.v0)).isSome = true))) :
Step (.active h (Frame.fn_FibonacciHeap_add_root 15 s) stack) (.active h (Frame.fn_FibonacciHeap_add_root 14 { s with v2 := ((field_FibonacciHeap_minimum h (s.v0)).getD 0) }) stack)
| FibonacciHeap_add_root_pc16_true (h : Heap) (s : State_FibonacciHeap_add_root) (stack : Stack) (condition : s.t5 = true) :
Step (.active h (Frame.fn_FibonacciHeap_add_root 16 s) stack) (.active h (Frame.fn_FibonacciHeap_add_root 5 s) stack)
| FibonacciHeap_add_root_pc16_false (h : Heap) (s : State_FibonacciHeap_add_root) (stack : Stack) (condition : s.t5 = false) :
Step (.active h (Frame.fn_FibonacciHeap_add_root 16 s) stack) (.active h (Frame.fn_FibonacciHeap_add_root 15 s) stack)
| FibonacciHeap_add_root_pc17 (h : Heap) (s : State_FibonacciHeap_add_root) (stack : Stack) (defined : ((((field_FibonacciHeap_minimum h (s.v0)).isSome = true)))) :
Step (.active h (Frame.fn_FibonacciHeap_add_root 17 s) stack) (.active h (Frame.fn_FibonacciHeap_add_root 16 { s with t5 := (decide ((((field_FibonacciHeap_minimum h (s.v0)).getD 0) < (0 : Int)))) }) stack)
| FibonacciHeap_add_root_pc18 (h : Heap) (s : State_FibonacciHeap_add_root) (stack : Stack) (defined : (((((field_FibonacciHeap_marks h (s.v0)).isSome = true)))) ∧ (((field_FibonacciHeap_marks h (s.v0)).getD 0) < h.nextRef)) :
Step (.active h (Frame.fn_FibonacciHeap_add_root 18 s) stack) (.active (h.write ((field_FibonacciHeap_marks h (s.v0)).getD 0) s.v1 (0 : Int)) (Frame.fn_FibonacciHeap_add_root 17 s) stack)
| FibonacciHeap_add_root_pc19 (h : Heap) (s : State_FibonacciHeap_add_root) (stack : Stack) (defined : (((((field_FibonacciHeap_parents h (s.v0)).isSome = true)))) ∧ (((field_FibonacciHeap_parents h (s.v0)).getD 0) < h.nextRef)) :
Step (.active h (Frame.fn_FibonacciHeap_add_root 19 s) stack) (.active (h.write ((field_FibonacciHeap_parents h (s.v0)).getD 0) s.v1 (-(1 : Int))) (Frame.fn_FibonacciHeap_add_root 18 s) stack)
| FibonacciHeap_link_pc1 (h : Heap) (s : State_FibonacciHeap_link) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_link 1 s) stack) (Algo2LeanCore.resumeConfig h (Result.fn_FibonacciHeap_link (s.t5)) stack)
| FibonacciHeap_link_pc2 (h : Heap) (s : State_FibonacciHeap_link) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_link 2 s) stack) (.active h (Frame.fn_FibonacciHeap_link 1 { s with t5 := () }) stack)
| FibonacciHeap_link_pc3 (h : Heap) (s : State_FibonacciHeap_link) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_link 3 s) stack) (.active (h.tick "heap_links" 1) (Frame.fn_FibonacciHeap_link 2 s) stack)
| FibonacciHeap_link_pc4 (h : Heap) (s : State_FibonacciHeap_link) (stack : Stack) (defined : (((((((field_FibonacciHeap_degrees h (s.v0)).isSome = true))) ∧ (((field_FibonacciHeap_degrees h (s.v0)).getD 0) < h.nextRef))) ∧ ((((field_FibonacciHeap_degrees h (s.v0)).isSome = true)))) ∧ (((field_FibonacciHeap_degrees h (s.v0)).getD 0) < h.nextRef)) :
Step (.active h (Frame.fn_FibonacciHeap_link 4 s) stack) (.active (h.write ((field_FibonacciHeap_degrees h (s.v0)).getD 0) s.v2 ((h.read ((field_FibonacciHeap_degrees h (s.v0)).getD 0) s.v2) + (1 : Int))) (Frame.fn_FibonacciHeap_link 3 s) stack)
| FibonacciHeap_link_pc5 (h : Heap) (s : State_FibonacciHeap_link) (stack : Stack) (defined : (((((field_FibonacciHeap_children h (s.v0)).isSome = true)))) ∧ (((field_FibonacciHeap_children h (s.v0)).getD 0) < h.nextRef)) :
Step (.active h (Frame.fn_FibonacciHeap_link 5 s) stack) (.active (h.write ((field_FibonacciHeap_children h (s.v0)).getD 0) s.v2 s.v1) (Frame.fn_FibonacciHeap_link 4 s) stack)
| FibonacciHeap_link_pc6 (h : Heap) (s : State_FibonacciHeap_link) (stack : Stack) (defined : (((((field_FibonacciHeap_right h (s.v0)).isSome = true)))) ∧ (((field_FibonacciHeap_right h (s.v0)).getD 0) < h.nextRef)) :
Step (.active h (Frame.fn_FibonacciHeap_link 6 s) stack) (.active (h.write ((field_FibonacciHeap_right h (s.v0)).getD 0) s.v1 s.v1) (Frame.fn_FibonacciHeap_link 5 s) stack)
| FibonacciHeap_link_pc7 (h : Heap) (s : State_FibonacciHeap_link) (stack : Stack) (defined : (((((field_FibonacciHeap_left h (s.v0)).isSome = true)))) ∧ (((field_FibonacciHeap_left h (s.v0)).getD 0) < h.nextRef)) :
Step (.active h (Frame.fn_FibonacciHeap_link 7 s) stack) (.active (h.write ((field_FibonacciHeap_left h (s.v0)).getD 0) s.v1 s.v1) (Frame.fn_FibonacciHeap_link 6 s) stack)
| FibonacciHeap_link_pc8 (h : Heap) (s : State_FibonacciHeap_link) (stack : Stack) (defined : (((((field_FibonacciHeap_left h (s.v0)).isSome = true)))) ∧ (((field_FibonacciHeap_left h (s.v0)).getD 0) < h.nextRef)) :
Step (.active h (Frame.fn_FibonacciHeap_link 8 s) stack) (.active (h.write ((field_FibonacciHeap_left h (s.v0)).getD 0) s.v3 s.v1) (Frame.fn_FibonacciHeap_link 5 s) stack)
| FibonacciHeap_link_pc9 (h : Heap) (s : State_FibonacciHeap_link) (stack : Stack) (defined : (((((field_FibonacciHeap_right h (s.v0)).isSome = true)))) ∧ (((field_FibonacciHeap_right h (s.v0)).getD 0) < h.nextRef)) :
Step (.active h (Frame.fn_FibonacciHeap_link 9 s) stack) (.active (h.write ((field_FibonacciHeap_right h (s.v0)).getD 0) s.v4 s.v1) (Frame.fn_FibonacciHeap_link 8 s) stack)
| FibonacciHeap_link_pc10 (h : Heap) (s : State_FibonacciHeap_link) (stack : Stack) (defined : (((((field_FibonacciHeap_right h (s.v0)).isSome = true)))) ∧ (((field_FibonacciHeap_right h (s.v0)).getD 0) < h.nextRef)) :
Step (.active h (Frame.fn_FibonacciHeap_link 10 s) stack) (.active (h.write ((field_FibonacciHeap_right h (s.v0)).getD 0) s.v1 s.v3) (Frame.fn_FibonacciHeap_link 9 s) stack)
| FibonacciHeap_link_pc11 (h : Heap) (s : State_FibonacciHeap_link) (stack : Stack) (defined : (((((field_FibonacciHeap_left h (s.v0)).isSome = true)))) ∧ (((field_FibonacciHeap_left h (s.v0)).getD 0) < h.nextRef)) :
Step (.active h (Frame.fn_FibonacciHeap_link 11 s) stack) (.active (h.write ((field_FibonacciHeap_left h (s.v0)).getD 0) s.v1 s.v4) (Frame.fn_FibonacciHeap_link 10 s) stack)
| FibonacciHeap_link_pc12 (h : Heap) (s : State_FibonacciHeap_link) (stack : Stack) (defined : ((((field_FibonacciHeap_left h (s.v0)).isSome = true))) ∧ (((field_FibonacciHeap_left h (s.v0)).getD 0) < h.nextRef)) :
Step (.active h (Frame.fn_FibonacciHeap_link 12 s) stack) (.active h (Frame.fn_FibonacciHeap_link 11 { s with v4 := (h.read ((field_FibonacciHeap_left h (s.v0)).getD 0) s.v3) }) stack)
| FibonacciHeap_link_pc13_true (h : Heap) (s : State_FibonacciHeap_link) (stack : Stack) (condition : s.t6 = true) :
Step (.active h (Frame.fn_FibonacciHeap_link 13 s) stack) (.active h (Frame.fn_FibonacciHeap_link 7 s) stack)
| FibonacciHeap_link_pc13_false (h : Heap) (s : State_FibonacciHeap_link) (stack : Stack) (condition : s.t6 = false) :
Step (.active h (Frame.fn_FibonacciHeap_link 13 s) stack) (.active h (Frame.fn_FibonacciHeap_link 12 s) stack)
| FibonacciHeap_link_pc14 (h : Heap) (s : State_FibonacciHeap_link) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_link 14 s) stack) (.active h (Frame.fn_FibonacciHeap_link 13 { s with t6 := (decide ((s.v3 < (0 : Int)))) }) stack)
| FibonacciHeap_link_pc15 (h : Heap) (s : State_FibonacciHeap_link) (stack : Stack) (defined : ((((field_FibonacciHeap_children h (s.v0)).isSome = true))) ∧ (((field_FibonacciHeap_children h (s.v0)).getD 0) < h.nextRef)) :
Step (.active h (Frame.fn_FibonacciHeap_link 15 s) stack) (.active h (Frame.fn_FibonacciHeap_link 14 { s with v3 := (h.read ((field_FibonacciHeap_children h (s.v0)).getD 0) s.v2) }) stack)
| FibonacciHeap_link_pc16 (h : Heap) (s : State_FibonacciHeap_link) (stack : Stack) (defined : (((((field_FibonacciHeap_marks h (s.v0)).isSome = true)))) ∧ (((field_FibonacciHeap_marks h (s.v0)).getD 0) < h.nextRef)) :
Step (.active h (Frame.fn_FibonacciHeap_link 16 s) stack) (.active (h.write ((field_FibonacciHeap_marks h (s.v0)).getD 0) s.v1 (0 : Int)) (Frame.fn_FibonacciHeap_link 15 s) stack)
| FibonacciHeap_link_pc17 (h : Heap) (s : State_FibonacciHeap_link) (stack : Stack) (defined : (((((field_FibonacciHeap_parents h (s.v0)).isSome = true)))) ∧ (((field_FibonacciHeap_parents h (s.v0)).getD 0) < h.nextRef)) :
Step (.active h (Frame.fn_FibonacciHeap_link 17 s) stack) (.active (h.write ((field_FibonacciHeap_parents h (s.v0)).getD 0) s.v1 s.v2) (Frame.fn_FibonacciHeap_link 16 s) stack)
| FibonacciHeap_consolidate_pc1 (h : Heap) (s : State_FibonacciHeap_consolidate) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_consolidate 1 s) stack) (Algo2LeanCore.resumeConfig h (Result.fn_FibonacciHeap_consolidate (s.t7)) stack)
| FibonacciHeap_consolidate_pc2 (h : Heap) (s : State_FibonacciHeap_consolidate) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_consolidate 2 s) stack) (.active h (Frame.fn_FibonacciHeap_consolidate 1 { s with t7 := () }) stack)
| FibonacciHeap_consolidate_pc3_true (h : Heap) (s : State_FibonacciHeap_consolidate) (stack : Stack) (condition : s.t8 = true) :
Step (.active h (Frame.fn_FibonacciHeap_consolidate 3 s) stack) (.active h (Frame.fn_FibonacciHeap_consolidate 14 s) stack)
| FibonacciHeap_consolidate_pc3_false (h : Heap) (s : State_FibonacciHeap_consolidate) (stack : Stack) (condition : s.t8 = false) :
Step (.active h (Frame.fn_FibonacciHeap_consolidate 3 s) stack) (.active h (Frame.fn_FibonacciHeap_consolidate 2 s) stack)
| FibonacciHeap_consolidate_pc4 (h : Heap) (s : State_FibonacciHeap_consolidate) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_consolidate 4 s) stack) (.active h (Frame.fn_FibonacciHeap_consolidate 3 { s with t8 := (decide ((s.v4 ≤ s.v2))) }) stack)
| FibonacciHeap_consolidate_pc5 (h : Heap) (s : State_FibonacciHeap_consolidate) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_consolidate 5 s) stack) (.active h (Frame.fn_FibonacciHeap_consolidate 4 { s with v4 := (s.v4 + (1 : Int)) }) stack)
| FibonacciHeap_consolidate_pc6 (h : Heap) (s : State_FibonacciHeap_consolidate) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_consolidate 6 s) stack) (.active h (Frame.fn_FibonacciHeap_add_root 19 ({ v0 := (s.t11), v1 := s.t12 } : State_FibonacciHeap_add_root)) ((fun value => match value with | .fn_FibonacciHeap_add_root result => (Frame.fn_FibonacciHeap_consolidate 5 { s with t10 := result }) | _ => .invalid) :: stack))
| FibonacciHeap_consolidate_pc7 (h : Heap) (s : State_FibonacciHeap_consolidate) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_consolidate 7 s) stack) (.active h (Frame.fn_FibonacciHeap_consolidate 6 { s with t12 := s.v3 }) stack)
| FibonacciHeap_consolidate_pc8 (h : Heap) (s : State_FibonacciHeap_consolidate) (stack : Stack) (defined : (is_FibonacciHeap h (s.t11))) :
Step (.active h (Frame.fn_FibonacciHeap_consolidate 8 s) stack) (.active h (Frame.fn_FibonacciHeap_consolidate 7 { s with t11 := s.t11 }) stack)
| FibonacciHeap_consolidate_pc9 (h : Heap) (s : State_FibonacciHeap_consolidate) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_consolidate 9 s) stack) (.active h (Frame.fn_FibonacciHeap_consolidate 8 { s with t11 := s.v0 }) stack)
| FibonacciHeap_consolidate_pc10_true (h : Heap) (s : State_FibonacciHeap_consolidate) (stack : Stack) (condition : s.t9 = true) :
Step (.active h (Frame.fn_FibonacciHeap_consolidate 10 s) stack) (.active h (Frame.fn_FibonacciHeap_consolidate 9 s) stack)
| FibonacciHeap_consolidate_pc10_false (h : Heap) (s : State_FibonacciHeap_consolidate) (stack : Stack) (condition : s.t9 = false) :
Step (.active h (Frame.fn_FibonacciHeap_consolidate 10 s) stack) (.active h (Frame.fn_FibonacciHeap_consolidate 5 s) stack)
| FibonacciHeap_consolidate_pc11 (h : Heap) (s : State_FibonacciHeap_consolidate) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_consolidate 11 s) stack) (.active h (Frame.fn_FibonacciHeap_consolidate 10 { s with t9 := (decide ((s.v3 ≥ (0 : Int)))) }) stack)
| FibonacciHeap_consolidate_pc12 (h : Heap) (s : State_FibonacciHeap_consolidate) (stack : Stack) (defined : s.v1 < h.nextRef) :
Step (.active h (Frame.fn_FibonacciHeap_consolidate 12 s) stack) (.active (h.write s.v1 s.v4 (-(1 : Int))) (Frame.fn_FibonacciHeap_consolidate 11 s) stack)
| FibonacciHeap_consolidate_pc13 (h : Heap) (s : State_FibonacciHeap_consolidate) (stack : Stack) (defined : (s.v1 < h.nextRef)) :
Step (.active h (Frame.fn_FibonacciHeap_consolidate 13 s) stack) (.active h (Frame.fn_FibonacciHeap_consolidate 12 { s with v3 := (h.read s.v1 s.v4) }) stack)
| FibonacciHeap_consolidate_pc14 (h : Heap) (s : State_FibonacciHeap_consolidate) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_consolidate 14 s) stack) (.active (h.tick "heap_degree_scans" 1) (Frame.fn_FibonacciHeap_consolidate 13 s) stack)
| FibonacciHeap_consolidate_pc15 (h : Heap) (s : State_FibonacciHeap_consolidate) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_consolidate 15 s) stack) (.active h (Frame.fn_FibonacciHeap_consolidate 4 { s with v4 := (0 : Int) }) stack)
| FibonacciHeap_consolidate_pc16_true (h : Heap) (s : State_FibonacciHeap_consolidate) (stack : Stack) (condition : s.t13 = true) :
Step (.active h (Frame.fn_FibonacciHeap_consolidate 16 s) stack) (.active h (Frame.fn_FibonacciHeap_consolidate 48 s) stack)
| FibonacciHeap_consolidate_pc16_false (h : Heap) (s : State_FibonacciHeap_consolidate) (stack : Stack) (condition : s.t13 = false) :
Step (.active h (Frame.fn_FibonacciHeap_consolidate 16 s) stack) (.active h (Frame.fn_FibonacciHeap_consolidate 15 s) stack)
| FibonacciHeap_consolidate_pc17 (h : Heap) (s : State_FibonacciHeap_consolidate) (stack : Stack) (defined : ((((field_FibonacciHeap_minimum h (s.v0)).isSome = true)))) :
Step (.active h (Frame.fn_FibonacciHeap_consolidate 17 s) stack) (.active h (Frame.fn_FibonacciHeap_consolidate 16 { s with t13 := (decide ((((field_FibonacciHeap_minimum h (s.v0)).getD 0) ≥ (0 : Int)))) }) stack)
| FibonacciHeap_consolidate_pc18 (h : Heap) (s : State_FibonacciHeap_consolidate) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_consolidate 18 s) stack) (.active h (Frame.fn_FibonacciHeap_consolidate 17 { s with v2 := s.v4 }) stack)
| FibonacciHeap_consolidate_pc19_true (h : Heap) (s : State_FibonacciHeap_consolidate) (stack : Stack) (condition : s.t14 = true) :
Step (.active h (Frame.fn_FibonacciHeap_consolidate 19 s) stack) (.active h (Frame.fn_FibonacciHeap_consolidate 18 s) stack)
| FibonacciHeap_consolidate_pc19_false (h : Heap) (s : State_FibonacciHeap_consolidate) (stack : Stack) (condition : s.t14 = false) :
Step (.active h (Frame.fn_FibonacciHeap_consolidate 19 s) stack) (.active h (Frame.fn_FibonacciHeap_consolidate 17 s) stack)
| FibonacciHeap_consolidate_pc20 (h : Heap) (s : State_FibonacciHeap_consolidate) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_consolidate 20 s) stack) (.active h (Frame.fn_FibonacciHeap_consolidate 19 { s with t14 := (decide ((s.v4 > s.v2))) }) stack)
| FibonacciHeap_consolidate_pc21 (h : Heap) (s : State_FibonacciHeap_consolidate) (stack : Stack) (defined : s.v1 < h.nextRef) :
Step (.active h (Frame.fn_FibonacciHeap_consolidate 21 s) stack) (.active (h.write s.v1 s.v4 s.v3) (Frame.fn_FibonacciHeap_consolidate 20 s) stack)
| FibonacciHeap_consolidate_pc22_true (h : Heap) (s : State_FibonacciHeap_consolidate) (stack : Stack) (condition : s.t15 = true) :
Step (.active h (Frame.fn_FibonacciHeap_consolidate 22 s) stack) (.active h (Frame.fn_FibonacciHeap_consolidate 37 s) stack)
| FibonacciHeap_consolidate_pc22_false (h : Heap) (s : State_FibonacciHeap_consolidate) (stack : Stack) (condition : s.t15 = false) :
Step (.active h (Frame.fn_FibonacciHeap_consolidate 22 s) stack) (.active h (Frame.fn_FibonacciHeap_consolidate 21 s) stack)
| FibonacciHeap_consolidate_pc23 (h : Heap) (s : State_FibonacciHeap_consolidate) (stack : Stack) (defined : ((s.v1 < h.nextRef))) :
Step (.active h (Frame.fn_FibonacciHeap_consolidate 23 s) stack) (.active h (Frame.fn_FibonacciHeap_consolidate 22 { s with t15 := (decide (((h.read s.v1 s.v4) ≥ (0 : Int)))) }) stack)
| FibonacciHeap_consolidate_pc24 (h : Heap) (s : State_FibonacciHeap_consolidate) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_consolidate 24 s) stack) (.active h (Frame.fn_FibonacciHeap_consolidate 23 { s with v4 := (s.v4 + (1 : Int)) }) stack)
| FibonacciHeap_consolidate_pc25 (h : Heap) (s : State_FibonacciHeap_consolidate) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_consolidate 25 s) stack) (.active h (Frame.fn_FibonacciHeap_link 17 ({ v0 := (s.t17), v1 := s.t18, v2 := s.t19 } : State_FibonacciHeap_link)) ((fun value => match value with | .fn_FibonacciHeap_link result => (Frame.fn_FibonacciHeap_consolidate 24 { s with t16 := result }) | _ => .invalid) :: stack))
| FibonacciHeap_consolidate_pc26 (h : Heap) (s : State_FibonacciHeap_consolidate) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_consolidate 26 s) stack) (.active h (Frame.fn_FibonacciHeap_consolidate 25 { s with t19 := s.v3 }) stack)
| FibonacciHeap_consolidate_pc27 (h : Heap) (s : State_FibonacciHeap_consolidate) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_consolidate 27 s) stack) (.active h (Frame.fn_FibonacciHeap_consolidate 26 { s with t18 := s.v5 }) stack)
| FibonacciHeap_consolidate_pc28 (h : Heap) (s : State_FibonacciHeap_consolidate) (stack : Stack) (defined : (is_FibonacciHeap h (s.t17))) :
Step (.active h (Frame.fn_FibonacciHeap_consolidate 28 s) stack) (.active h (Frame.fn_FibonacciHeap_consolidate 27 { s with t17 := s.t17 }) stack)
| FibonacciHeap_consolidate_pc29 (h : Heap) (s : State_FibonacciHeap_consolidate) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_consolidate 29 s) stack) (.active h (Frame.fn_FibonacciHeap_consolidate 28 { s with t17 := s.v0 }) stack)
| FibonacciHeap_consolidate_pc30 (h : Heap) (s : State_FibonacciHeap_consolidate) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_consolidate 30 s) stack) (.active h (Frame.fn_FibonacciHeap_consolidate 29 { s with v5 := s.v6 }) stack)
| FibonacciHeap_consolidate_pc31 (h : Heap) (s : State_FibonacciHeap_consolidate) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_consolidate 31 s) stack) (.active h (Frame.fn_FibonacciHeap_consolidate 30 { s with v3 := s.v5 }) stack)
| FibonacciHeap_consolidate_pc32 (h : Heap) (s : State_FibonacciHeap_consolidate) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_consolidate 32 s) stack) (.active h (Frame.fn_FibonacciHeap_consolidate 31 { s with v6 := s.v3 }) stack)
| FibonacciHeap_consolidate_pc33_true (h : Heap) (s : State_FibonacciHeap_consolidate) (stack : Stack) (condition : s.t20 = true) :
Step (.active h (Frame.fn_FibonacciHeap_consolidate 33 s) stack) (.active h (Frame.fn_FibonacciHeap_consolidate 32 s) stack)
| FibonacciHeap_consolidate_pc33_false (h : Heap) (s : State_FibonacciHeap_consolidate) (stack : Stack) (condition : s.t20 = false) :
Step (.active h (Frame.fn_FibonacciHeap_consolidate 33 s) stack) (.active h (Frame.fn_FibonacciHeap_consolidate 29 s) stack)
| FibonacciHeap_consolidate_pc34 (h : Heap) (s : State_FibonacciHeap_consolidate) (stack : Stack) (defined : (((((field_FibonacciHeap_keys h (s.v0)).isSome = true))) ∧ (((field_FibonacciHeap_keys h (s.v0)).getD 0) < h.nextRef))) :
Step (.active h (Frame.fn_FibonacciHeap_consolidate 34 s) stack) (.active h (Frame.fn_FibonacciHeap_consolidate 33 { s with t20 := (decide (((h.read ((field_FibonacciHeap_keys h (s.v0)).getD 0) s.v5) < (h.read ((field_FibonacciHeap_keys h (s.v0)).getD 0) s.v3)))) }) stack)
| FibonacciHeap_consolidate_pc35 (h : Heap) (s : State_FibonacciHeap_consolidate) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_consolidate 35 s) stack) (.active (h.tick "heap_comparisons" 1) (Frame.fn_FibonacciHeap_consolidate 34 s) stack)
| FibonacciHeap_consolidate_pc36 (h : Heap) (s : State_FibonacciHeap_consolidate) (stack : Stack) (defined : s.v1 < h.nextRef) :
Step (.active h (Frame.fn_FibonacciHeap_consolidate 36 s) stack) (.active (h.write s.v1 s.v4 (-(1 : Int))) (Frame.fn_FibonacciHeap_consolidate 35 s) stack)
| FibonacciHeap_consolidate_pc37 (h : Heap) (s : State_FibonacciHeap_consolidate) (stack : Stack) (defined : (s.v1 < h.nextRef)) :
Step (.active h (Frame.fn_FibonacciHeap_consolidate 37 s) stack) (.active h (Frame.fn_FibonacciHeap_consolidate 36 { s with v5 := (h.read s.v1 s.v4) }) stack)
| FibonacciHeap_consolidate_pc38 (h : Heap) (s : State_FibonacciHeap_consolidate) (stack : Stack) (defined : ((((field_FibonacciHeap_degrees h (s.v0)).isSome = true))) ∧ (((field_FibonacciHeap_degrees h (s.v0)).getD 0) < h.nextRef)) :
Step (.active h (Frame.fn_FibonacciHeap_consolidate 38 s) stack) (.active h (Frame.fn_FibonacciHeap_consolidate 23 { s with v4 := (h.read ((field_FibonacciHeap_degrees h (s.v0)).getD 0) s.v3) }) stack)
| FibonacciHeap_consolidate_pc39 (h : Heap) (s : State_FibonacciHeap_consolidate) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_consolidate 39 s) stack) (.active (h.tick "heap_root_scans" 1) (Frame.fn_FibonacciHeap_consolidate 38 s) stack)
| FibonacciHeap_consolidate_pc40 (h : Heap) (s : State_FibonacciHeap_consolidate) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_consolidate 40 s) stack) (.active h (Frame.fn_FibonacciHeap_remove_from_ring 8 ({ v0 := (s.t22), v1 := s.t23 } : State_FibonacciHeap_remove_from_ring)) ((fun value => match value with | .fn_FibonacciHeap_remove_from_ring result => (Frame.fn_FibonacciHeap_consolidate 39 { s with t21 := result }) | _ => .invalid) :: stack))
| FibonacciHeap_consolidate_pc41 (h : Heap) (s : State_FibonacciHeap_consolidate) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_consolidate 41 s) stack) (.active h (Frame.fn_FibonacciHeap_consolidate 40 { s with t23 := s.v3 }) stack)
| FibonacciHeap_consolidate_pc42 (h : Heap) (s : State_FibonacciHeap_consolidate) (stack : Stack) (defined : (is_FibonacciHeap h (s.t22))) :
Step (.active h (Frame.fn_FibonacciHeap_consolidate 42 s) stack) (.active h (Frame.fn_FibonacciHeap_consolidate 41 { s with t22 := s.t22 }) stack)
| FibonacciHeap_consolidate_pc43 (h : Heap) (s : State_FibonacciHeap_consolidate) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_consolidate 43 s) stack) (.active h (Frame.fn_FibonacciHeap_consolidate 42 { s with t22 := s.v0 }) stack)
| FibonacciHeap_consolidate_pc44 (h : Heap) (s : State_FibonacciHeap_consolidate) (stack : Stack) (defined : (is_FibonacciHeap h (s.v0))) :
Step (.active h (Frame.fn_FibonacciHeap_consolidate 44 s) stack) (.active (set_FibonacciHeap_minimum h (s.v0) ((-(1 : Int)))) (Frame.fn_FibonacciHeap_consolidate 43 s) stack)
| FibonacciHeap_consolidate_pc45 (h : Heap) (s : State_FibonacciHeap_consolidate) (stack : Stack) (defined : ((((((field_FibonacciHeap_right h (s.v0)).isSome = true))) ∧ (((field_FibonacciHeap_right h (s.v0)).getD 0) < h.nextRef))) ∧ (is_FibonacciHeap h (s.v0))) :
Step (.active h (Frame.fn_FibonacciHeap_consolidate 45 s) stack) (.active (set_FibonacciHeap_minimum h (s.v0) ((h.read ((field_FibonacciHeap_right h (s.v0)).getD 0) s.v3))) (Frame.fn_FibonacciHeap_consolidate 43 s) stack)
| FibonacciHeap_consolidate_pc46_true (h : Heap) (s : State_FibonacciHeap_consolidate) (stack : Stack) (condition : s.t24 = true) :
Step (.active h (Frame.fn_FibonacciHeap_consolidate 46 s) stack) (.active h (Frame.fn_FibonacciHeap_consolidate 44 s) stack)
| FibonacciHeap_consolidate_pc46_false (h : Heap) (s : State_FibonacciHeap_consolidate) (stack : Stack) (condition : s.t24 = false) :
Step (.active h (Frame.fn_FibonacciHeap_consolidate 46 s) stack) (.active h (Frame.fn_FibonacciHeap_consolidate 45 s) stack)
| FibonacciHeap_consolidate_pc47 (h : Heap) (s : State_FibonacciHeap_consolidate) (stack : Stack) (defined : (((((field_FibonacciHeap_right h (s.v0)).isSome = true))) ∧ (((field_FibonacciHeap_right h (s.v0)).getD 0) < h.nextRef))) :
Step (.active h (Frame.fn_FibonacciHeap_consolidate 47 s) stack) (.active h (Frame.fn_FibonacciHeap_consolidate 46 { s with t24 := (decide (((h.read ((field_FibonacciHeap_right h (s.v0)).getD 0) s.v3) = s.v3))) }) stack)
| FibonacciHeap_consolidate_pc48 (h : Heap) (s : State_FibonacciHeap_consolidate) (stack : Stack) (defined : (((field_FibonacciHeap_minimum h (s.v0)).isSome = true))) :
Step (.active h (Frame.fn_FibonacciHeap_consolidate 48 s) stack) (.active h (Frame.fn_FibonacciHeap_consolidate 47 { s with v3 := ((field_FibonacciHeap_minimum h (s.v0)).getD 0) }) stack)
| FibonacciHeap_consolidate_pc49 (h : Heap) (s : State_FibonacciHeap_consolidate) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_consolidate 49 s) stack) (.active h (Frame.fn_FibonacciHeap_consolidate 17 { s with v2 := (-(1 : Int)) }) stack)
| FibonacciHeap_consolidate_pc50 (h : Heap) (s : State_FibonacciHeap_consolidate) (stack : Stack) (defined : (((field_FibonacciHeap_table h (s.v0)).isSome = true))) :
Step (.active h (Frame.fn_FibonacciHeap_consolidate 50 s) stack) (.active h (Frame.fn_FibonacciHeap_consolidate 49 { s with v1 := ((field_FibonacciHeap_table h (s.v0)).getD 0) }) stack)
| FibonacciHeap_cut_pc1 (h : Heap) (s : State_FibonacciHeap_cut) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_cut 1 s) stack) (Algo2LeanCore.resumeConfig h (Result.fn_FibonacciHeap_cut (s.t3)) stack)
| FibonacciHeap_cut_pc2 (h : Heap) (s : State_FibonacciHeap_cut) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_cut 2 s) stack) (.active h (Frame.fn_FibonacciHeap_cut 1 { s with t3 := () }) stack)
| FibonacciHeap_cut_pc3 (h : Heap) (s : State_FibonacciHeap_cut) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_cut 3 s) stack) (.active (h.tick "heap_cuts" 1) (Frame.fn_FibonacciHeap_cut 2 s) stack)
| FibonacciHeap_cut_pc4 (h : Heap) (s : State_FibonacciHeap_cut) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_cut 4 s) stack) (.active h (Frame.fn_FibonacciHeap_add_root 19 ({ v0 := (s.t5), v1 := s.t6 } : State_FibonacciHeap_add_root)) ((fun value => match value with | .fn_FibonacciHeap_add_root result => (Frame.fn_FibonacciHeap_cut 3 { s with t4 := result }) | _ => .invalid) :: stack))
| FibonacciHeap_cut_pc5 (h : Heap) (s : State_FibonacciHeap_cut) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_cut 5 s) stack) (.active h (Frame.fn_FibonacciHeap_cut 4 { s with t6 := s.v1 }) stack)
| FibonacciHeap_cut_pc6 (h : Heap) (s : State_FibonacciHeap_cut) (stack : Stack) (defined : (is_FibonacciHeap h (s.t5))) :
Step (.active h (Frame.fn_FibonacciHeap_cut 6 s) stack) (.active h (Frame.fn_FibonacciHeap_cut 5 { s with t5 := s.t5 }) stack)
| FibonacciHeap_cut_pc7 (h : Heap) (s : State_FibonacciHeap_cut) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_cut 7 s) stack) (.active h (Frame.fn_FibonacciHeap_cut 6 { s with t5 := s.v0 }) stack)
| FibonacciHeap_cut_pc8 (h : Heap) (s : State_FibonacciHeap_cut) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_cut 8 s) stack) (.active h (Frame.fn_FibonacciHeap_remove_from_ring 8 ({ v0 := (s.t8), v1 := s.t9 } : State_FibonacciHeap_remove_from_ring)) ((fun value => match value with | .fn_FibonacciHeap_remove_from_ring result => (Frame.fn_FibonacciHeap_cut 7 { s with t7 := result }) | _ => .invalid) :: stack))
| FibonacciHeap_cut_pc9 (h : Heap) (s : State_FibonacciHeap_cut) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_cut 9 s) stack) (.active h (Frame.fn_FibonacciHeap_cut 8 { s with t9 := s.v1 }) stack)
| FibonacciHeap_cut_pc10 (h : Heap) (s : State_FibonacciHeap_cut) (stack : Stack) (defined : (is_FibonacciHeap h (s.t8))) :
Step (.active h (Frame.fn_FibonacciHeap_cut 10 s) stack) (.active h (Frame.fn_FibonacciHeap_cut 9 { s with t8 := s.t8 }) stack)
| FibonacciHeap_cut_pc11 (h : Heap) (s : State_FibonacciHeap_cut) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_cut 11 s) stack) (.active h (Frame.fn_FibonacciHeap_cut 10 { s with t8 := s.v0 }) stack)
| FibonacciHeap_cut_pc12 (h : Heap) (s : State_FibonacciHeap_cut) (stack : Stack) (defined : (((((((field_FibonacciHeap_degrees h (s.v0)).isSome = true))) ∧ (((field_FibonacciHeap_degrees h (s.v0)).getD 0) < h.nextRef))) ∧ ((((field_FibonacciHeap_degrees h (s.v0)).isSome = true)))) ∧ (((field_FibonacciHeap_degrees h (s.v0)).getD 0) < h.nextRef)) :
Step (.active h (Frame.fn_FibonacciHeap_cut 12 s) stack) (.active (h.write ((field_FibonacciHeap_degrees h (s.v0)).getD 0) s.v2 ((h.read ((field_FibonacciHeap_degrees h (s.v0)).getD 0) s.v2) - (1 : Int))) (Frame.fn_FibonacciHeap_cut 11 s) stack)
| FibonacciHeap_cut_pc13 (h : Heap) (s : State_FibonacciHeap_cut) (stack : Stack) (defined : (((((field_FibonacciHeap_children h (s.v0)).isSome = true)))) ∧ (((field_FibonacciHeap_children h (s.v0)).getD 0) < h.nextRef)) :
Step (.active h (Frame.fn_FibonacciHeap_cut 13 s) stack) (.active (h.write ((field_FibonacciHeap_children h (s.v0)).getD 0) s.v2 (-(1 : Int))) (Frame.fn_FibonacciHeap_cut 12 s) stack)
| FibonacciHeap_cut_pc14 (h : Heap) (s : State_FibonacciHeap_cut) (stack : Stack) (defined : ((((((field_FibonacciHeap_right h (s.v0)).isSome = true))) ∧ (((field_FibonacciHeap_right h (s.v0)).getD 0) < h.nextRef)) ∧ ((((field_FibonacciHeap_children h (s.v0)).isSome = true)))) ∧ (((field_FibonacciHeap_children h (s.v0)).getD 0) < h.nextRef)) :
Step (.active h (Frame.fn_FibonacciHeap_cut 14 s) stack) (.active (h.write ((field_FibonacciHeap_children h (s.v0)).getD 0) s.v2 (h.read ((field_FibonacciHeap_right h (s.v0)).getD 0) s.v1)) (Frame.fn_FibonacciHeap_cut 12 s) stack)
| FibonacciHeap_cut_pc15_true (h : Heap) (s : State_FibonacciHeap_cut) (stack : Stack) (condition : s.t11 = true) :
Step (.active h (Frame.fn_FibonacciHeap_cut 15 s) stack) (.active h (Frame.fn_FibonacciHeap_cut 13 s) stack)
| FibonacciHeap_cut_pc15_false (h : Heap) (s : State_FibonacciHeap_cut) (stack : Stack) (condition : s.t11 = false) :
Step (.active h (Frame.fn_FibonacciHeap_cut 15 s) stack) (.active h (Frame.fn_FibonacciHeap_cut 14 s) stack)
| FibonacciHeap_cut_pc16 (h : Heap) (s : State_FibonacciHeap_cut) (stack : Stack) (defined : (((((field_FibonacciHeap_right h (s.v0)).isSome = true))) ∧ (((field_FibonacciHeap_right h (s.v0)).getD 0) < h.nextRef))) :
Step (.active h (Frame.fn_FibonacciHeap_cut 16 s) stack) (.active h (Frame.fn_FibonacciHeap_cut 15 { s with t11 := (decide (((h.read ((field_FibonacciHeap_right h (s.v0)).getD 0) s.v1) = s.v1))) }) stack)
| FibonacciHeap_cut_pc17_true (h : Heap) (s : State_FibonacciHeap_cut) (stack : Stack) (condition : s.t10 = true) :
Step (.active h (Frame.fn_FibonacciHeap_cut 17 s) stack) (.active h (Frame.fn_FibonacciHeap_cut 16 s) stack)
| FibonacciHeap_cut_pc17_false (h : Heap) (s : State_FibonacciHeap_cut) (stack : Stack) (condition : s.t10 = false) :
Step (.active h (Frame.fn_FibonacciHeap_cut 17 s) stack) (.active h (Frame.fn_FibonacciHeap_cut 12 s) stack)
| FibonacciHeap_cut_pc18 (h : Heap) (s : State_FibonacciHeap_cut) (stack : Stack) (defined : (((((field_FibonacciHeap_children h (s.v0)).isSome = true))) ∧ (((field_FibonacciHeap_children h (s.v0)).getD 0) < h.nextRef))) :
Step (.active h (Frame.fn_FibonacciHeap_cut 18 s) stack) (.active h (Frame.fn_FibonacciHeap_cut 17 { s with t10 := (decide (((h.read ((field_FibonacciHeap_children h (s.v0)).getD 0) s.v2) = s.v1))) }) stack)
| FibonacciHeap_cascading_cut_pc1 (h : Heap) (s : State_FibonacciHeap_cascading_cut) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_cascading_cut 1 s) stack) (Algo2LeanCore.resumeConfig h (Result.fn_FibonacciHeap_cascading_cut (s.t3)) stack)
| FibonacciHeap_cascading_cut_pc2 (h : Heap) (s : State_FibonacciHeap_cascading_cut) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_cascading_cut 2 s) stack) (.active h (Frame.fn_FibonacciHeap_cascading_cut 1 { s with t3 := () }) stack)
| FibonacciHeap_cascading_cut_pc3_true (h : Heap) (s : State_FibonacciHeap_cascading_cut) (stack : Stack) (condition : s.t4 = true) :
Step (.active h (Frame.fn_FibonacciHeap_cascading_cut 3 s) stack) (.active h (Frame.fn_FibonacciHeap_cascading_cut 16 s) stack)
| FibonacciHeap_cascading_cut_pc3_false (h : Heap) (s : State_FibonacciHeap_cascading_cut) (stack : Stack) (condition : s.t4 = false) :
Step (.active h (Frame.fn_FibonacciHeap_cascading_cut 3 s) stack) (.active h (Frame.fn_FibonacciHeap_cascading_cut 2 s) stack)
| FibonacciHeap_cascading_cut_pc4 (h : Heap) (s : State_FibonacciHeap_cascading_cut) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_cascading_cut 4 s) stack) (.active h (Frame.fn_FibonacciHeap_cascading_cut 3 { s with t4 := (decide ((s.v2 ≥ (0 : Int)))) }) stack)
| FibonacciHeap_cascading_cut_pc5 (h : Heap) (s : State_FibonacciHeap_cascading_cut) (stack : Stack) (defined : ((((field_FibonacciHeap_parents h (s.v0)).isSome = true))) ∧ (((field_FibonacciHeap_parents h (s.v0)).getD 0) < h.nextRef)) :
Step (.active h (Frame.fn_FibonacciHeap_cascading_cut 5 s) stack) (.active h (Frame.fn_FibonacciHeap_cascading_cut 4 { s with v2 := (h.read ((field_FibonacciHeap_parents h (s.v0)).getD 0) s.v1) }) stack)
| FibonacciHeap_cascading_cut_pc6 (h : Heap) (s : State_FibonacciHeap_cascading_cut) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_cascading_cut 6 s) stack) (.active h (Frame.fn_FibonacciHeap_cascading_cut 5 { s with v1 := s.v2 }) stack)
| FibonacciHeap_cascading_cut_pc7 (h : Heap) (s : State_FibonacciHeap_cascading_cut) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_cascading_cut 7 s) stack) (.active h (Frame.fn_FibonacciHeap_cut 18 ({ v0 := (s.t6), v1 := s.t7, v2 := s.t8 } : State_FibonacciHeap_cut)) ((fun value => match value with | .fn_FibonacciHeap_cut result => (Frame.fn_FibonacciHeap_cascading_cut 6 { s with t5 := result }) | _ => .invalid) :: stack))
| FibonacciHeap_cascading_cut_pc8 (h : Heap) (s : State_FibonacciHeap_cascading_cut) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_cascading_cut 8 s) stack) (.active h (Frame.fn_FibonacciHeap_cascading_cut 7 { s with t8 := s.v2 }) stack)
| FibonacciHeap_cascading_cut_pc9 (h : Heap) (s : State_FibonacciHeap_cascading_cut) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_cascading_cut 9 s) stack) (.active h (Frame.fn_FibonacciHeap_cascading_cut 8 { s with t7 := s.v1 }) stack)
| FibonacciHeap_cascading_cut_pc10 (h : Heap) (s : State_FibonacciHeap_cascading_cut) (stack : Stack) (defined : (is_FibonacciHeap h (s.t6))) :
Step (.active h (Frame.fn_FibonacciHeap_cascading_cut 10 s) stack) (.active h (Frame.fn_FibonacciHeap_cascading_cut 9 { s with t6 := s.t6 }) stack)
| FibonacciHeap_cascading_cut_pc11 (h : Heap) (s : State_FibonacciHeap_cascading_cut) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_cascading_cut 11 s) stack) (.active h (Frame.fn_FibonacciHeap_cascading_cut 10 { s with t6 := s.v0 }) stack)
| FibonacciHeap_cascading_cut_pc12 (h : Heap) (s : State_FibonacciHeap_cascading_cut) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_cascading_cut 12 s) stack) (Algo2LeanCore.resumeConfig h (Result.fn_FibonacciHeap_cascading_cut (s.t10)) stack)
| FibonacciHeap_cascading_cut_pc13 (h : Heap) (s : State_FibonacciHeap_cascading_cut) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_cascading_cut 13 s) stack) (.active h (Frame.fn_FibonacciHeap_cascading_cut 12 { s with t10 := () }) stack)
| FibonacciHeap_cascading_cut_pc14 (h : Heap) (s : State_FibonacciHeap_cascading_cut) (stack : Stack) (defined : (((((field_FibonacciHeap_marks h (s.v0)).isSome = true)))) ∧ (((field_FibonacciHeap_marks h (s.v0)).getD 0) < h.nextRef)) :
Step (.active h (Frame.fn_FibonacciHeap_cascading_cut 14 s) stack) (.active (h.write ((field_FibonacciHeap_marks h (s.v0)).getD 0) s.v1 (1 : Int)) (Frame.fn_FibonacciHeap_cascading_cut 13 s) stack)
| FibonacciHeap_cascading_cut_pc15_true (h : Heap) (s : State_FibonacciHeap_cascading_cut) (stack : Stack) (condition : s.t9 = true) :
Step (.active h (Frame.fn_FibonacciHeap_cascading_cut 15 s) stack) (.active h (Frame.fn_FibonacciHeap_cascading_cut 14 s) stack)
| FibonacciHeap_cascading_cut_pc15_false (h : Heap) (s : State_FibonacciHeap_cascading_cut) (stack : Stack) (condition : s.t9 = false) :
Step (.active h (Frame.fn_FibonacciHeap_cascading_cut 15 s) stack) (.active h (Frame.fn_FibonacciHeap_cascading_cut 11 s) stack)
| FibonacciHeap_cascading_cut_pc16 (h : Heap) (s : State_FibonacciHeap_cascading_cut) (stack : Stack) (defined : (((((field_FibonacciHeap_marks h (s.v0)).isSome = true))) ∧ (((field_FibonacciHeap_marks h (s.v0)).getD 0) < h.nextRef))) :
Step (.active h (Frame.fn_FibonacciHeap_cascading_cut 16 s) stack) (.active h (Frame.fn_FibonacciHeap_cascading_cut 15 { s with t9 := (decide (((h.read ((field_FibonacciHeap_marks h (s.v0)).getD 0) s.v1) = (0 : Int)))) }) stack)
| FibonacciHeap_cascading_cut_pc17 (h : Heap) (s : State_FibonacciHeap_cascading_cut) (stack : Stack) (defined : ((((field_FibonacciHeap_parents h (s.v0)).isSome = true))) ∧ (((field_FibonacciHeap_parents h (s.v0)).getD 0) < h.nextRef)) :
Step (.active h (Frame.fn_FibonacciHeap_cascading_cut 17 s) stack) (.active h (Frame.fn_FibonacciHeap_cascading_cut 4 { s with v2 := (h.read ((field_FibonacciHeap_parents h (s.v0)).getD 0) s.v1) }) stack)
| FibonacciHeap_push_or_decrease_pc1 (h : Heap) (s : State_FibonacciHeap_push_or_decrease) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_push_or_decrease 1 s) stack) (Algo2LeanCore.resumeConfig h (Result.fn_FibonacciHeap_push_or_decrease (s.t4)) stack)
| FibonacciHeap_push_or_decrease_pc2 (h : Heap) (s : State_FibonacciHeap_push_or_decrease) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_push_or_decrease 2 s) stack) (.active h (Frame.fn_FibonacciHeap_push_or_decrease 1 { s with t4 := () }) stack)
| FibonacciHeap_push_or_decrease_pc3 (h : Heap) (s : State_FibonacciHeap_push_or_decrease) (stack : Stack) (defined : (is_FibonacciHeap h (s.v0))) :
Step (.active h (Frame.fn_FibonacciHeap_push_or_decrease 3 s) stack) (.active (set_FibonacciHeap_minimum h (s.v0) (s.v1)) (Frame.fn_FibonacciHeap_push_or_decrease 2 s) stack)
| FibonacciHeap_push_or_decrease_pc4_true (h : Heap) (s : State_FibonacciHeap_push_or_decrease) (stack : Stack) (condition : s.t5 = true) :
Step (.active h (Frame.fn_FibonacciHeap_push_or_decrease 4 s) stack) (.active h (Frame.fn_FibonacciHeap_push_or_decrease 3 s) stack)
| FibonacciHeap_push_or_decrease_pc4_false (h : Heap) (s : State_FibonacciHeap_push_or_decrease) (stack : Stack) (condition : s.t5 = false) :
Step (.active h (Frame.fn_FibonacciHeap_push_or_decrease 4 s) stack) (.active h (Frame.fn_FibonacciHeap_push_or_decrease 2 s) stack)
| FibonacciHeap_push_or_decrease_pc5 (h : Heap) (s : State_FibonacciHeap_push_or_decrease) (stack : Stack) (defined : (((((field_FibonacciHeap_keys h (s.v0)).isSome = true))) ∧ (((field_FibonacciHeap_keys h (s.v0)).getD 0) < h.nextRef)) ∧ (((((field_FibonacciHeap_keys h (s.v0)).isSome = true))) ∧ ((((field_FibonacciHeap_minimum h (s.v0)).isSome = true))) ∧ (((field_FibonacciHeap_keys h (s.v0)).getD 0) < h.nextRef))) :
Step (.active h (Frame.fn_FibonacciHeap_push_or_decrease 5 s) stack) (.active h (Frame.fn_FibonacciHeap_push_or_decrease 4 { s with t5 := (decide (((h.read ((field_FibonacciHeap_keys h (s.v0)).getD 0) s.v1) < (h.read ((field_FibonacciHeap_keys h (s.v0)).getD 0) ((field_FibonacciHeap_minimum h (s.v0)).getD 0))))) }) stack)
| FibonacciHeap_push_or_decrease_pc6 (h : Heap) (s : State_FibonacciHeap_push_or_decrease) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_push_or_decrease 6 s) stack) (.active (h.tick "heap_comparisons" 1) (Frame.fn_FibonacciHeap_push_or_decrease 5 s) stack)
| FibonacciHeap_push_or_decrease_pc7 (h : Heap) (s : State_FibonacciHeap_push_or_decrease) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_push_or_decrease 7 s) stack) (.active h (Frame.fn_FibonacciHeap_cascading_cut 17 ({ v0 := (s.t9), v1 := s.t10 } : State_FibonacciHeap_cascading_cut)) ((fun value => match value with | .fn_FibonacciHeap_cascading_cut result => (Frame.fn_FibonacciHeap_push_or_decrease 6 { s with t8 := result }) | _ => .invalid) :: stack))
| FibonacciHeap_push_or_decrease_pc8 (h : Heap) (s : State_FibonacciHeap_push_or_decrease) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_push_or_decrease 8 s) stack) (.active h (Frame.fn_FibonacciHeap_push_or_decrease 7 { s with t10 := s.v3 }) stack)
| FibonacciHeap_push_or_decrease_pc9 (h : Heap) (s : State_FibonacciHeap_push_or_decrease) (stack : Stack) (defined : (is_FibonacciHeap h (s.t9))) :
Step (.active h (Frame.fn_FibonacciHeap_push_or_decrease 9 s) stack) (.active h (Frame.fn_FibonacciHeap_push_or_decrease 8 { s with t9 := s.t9 }) stack)
| FibonacciHeap_push_or_decrease_pc10 (h : Heap) (s : State_FibonacciHeap_push_or_decrease) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_push_or_decrease 10 s) stack) (.active h (Frame.fn_FibonacciHeap_push_or_decrease 9 { s with t9 := s.v0 }) stack)
| FibonacciHeap_push_or_decrease_pc11 (h : Heap) (s : State_FibonacciHeap_push_or_decrease) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_push_or_decrease 11 s) stack) (.active h (Frame.fn_FibonacciHeap_cut 18 ({ v0 := (s.t12), v1 := s.t13, v2 := s.t14 } : State_FibonacciHeap_cut)) ((fun value => match value with | .fn_FibonacciHeap_cut result => (Frame.fn_FibonacciHeap_push_or_decrease 10 { s with t11 := result }) | _ => .invalid) :: stack))
| FibonacciHeap_push_or_decrease_pc12 (h : Heap) (s : State_FibonacciHeap_push_or_decrease) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_push_or_decrease 12 s) stack) (.active h (Frame.fn_FibonacciHeap_push_or_decrease 11 { s with t14 := s.v3 }) stack)
| FibonacciHeap_push_or_decrease_pc13 (h : Heap) (s : State_FibonacciHeap_push_or_decrease) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_push_or_decrease 13 s) stack) (.active h (Frame.fn_FibonacciHeap_push_or_decrease 12 { s with t13 := s.v1 }) stack)
| FibonacciHeap_push_or_decrease_pc14 (h : Heap) (s : State_FibonacciHeap_push_or_decrease) (stack : Stack) (defined : (is_FibonacciHeap h (s.t12))) :
Step (.active h (Frame.fn_FibonacciHeap_push_or_decrease 14 s) stack) (.active h (Frame.fn_FibonacciHeap_push_or_decrease 13 { s with t12 := s.t12 }) stack)
| FibonacciHeap_push_or_decrease_pc15 (h : Heap) (s : State_FibonacciHeap_push_or_decrease) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_push_or_decrease 15 s) stack) (.active h (Frame.fn_FibonacciHeap_push_or_decrease 14 { s with t12 := s.v0 }) stack)
| FibonacciHeap_push_or_decrease_pc16_true (h : Heap) (s : State_FibonacciHeap_push_or_decrease) (stack : Stack) (condition : s.t7 = true) :
Step (.active h (Frame.fn_FibonacciHeap_push_or_decrease 16 s) stack) (.active h (Frame.fn_FibonacciHeap_push_or_decrease 15 s) stack)
| FibonacciHeap_push_or_decrease_pc16_false (h : Heap) (s : State_FibonacciHeap_push_or_decrease) (stack : Stack) (condition : s.t7 = false) :
Step (.active h (Frame.fn_FibonacciHeap_push_or_decrease 16 s) stack) (.active h (Frame.fn_FibonacciHeap_push_or_decrease 6 s) stack)
| FibonacciHeap_push_or_decrease_pc17 (h : Heap) (s : State_FibonacciHeap_push_or_decrease) (stack : Stack) (defined : (((((field_FibonacciHeap_keys h (s.v0)).isSome = true))) ∧ (((field_FibonacciHeap_keys h (s.v0)).getD 0) < h.nextRef))) :
Step (.active h (Frame.fn_FibonacciHeap_push_or_decrease 17 s) stack) (.active h (Frame.fn_FibonacciHeap_push_or_decrease 16 { s with t7 := (decide ((s.v2 < (h.read ((field_FibonacciHeap_keys h (s.v0)).getD 0) s.v3)))) }) stack)
| FibonacciHeap_push_or_decrease_pc18 (h : Heap) (s : State_FibonacciHeap_push_or_decrease) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_push_or_decrease 18 s) stack) (.active (h.tick "heap_comparisons" 1) (Frame.fn_FibonacciHeap_push_or_decrease 17 s) stack)
| FibonacciHeap_push_or_decrease_pc19_true (h : Heap) (s : State_FibonacciHeap_push_or_decrease) (stack : Stack) (condition : s.t6 = true) :
Step (.active h (Frame.fn_FibonacciHeap_push_or_decrease 19 s) stack) (.active h (Frame.fn_FibonacciHeap_push_or_decrease 18 s) stack)
| FibonacciHeap_push_or_decrease_pc19_false (h : Heap) (s : State_FibonacciHeap_push_or_decrease) (stack : Stack) (condition : s.t6 = false) :
Step (.active h (Frame.fn_FibonacciHeap_push_or_decrease 19 s) stack) (.active h (Frame.fn_FibonacciHeap_push_or_decrease 6 s) stack)
| FibonacciHeap_push_or_decrease_pc20 (h : Heap) (s : State_FibonacciHeap_push_or_decrease) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_push_or_decrease 20 s) stack) (.active h (Frame.fn_FibonacciHeap_push_or_decrease 19 { s with t6 := (decide ((s.v3 ≥ (0 : Int)))) }) stack)
| FibonacciHeap_push_or_decrease_pc21 (h : Heap) (s : State_FibonacciHeap_push_or_decrease) (stack : Stack) (defined : ((((field_FibonacciHeap_parents h (s.v0)).isSome = true))) ∧ (((field_FibonacciHeap_parents h (s.v0)).getD 0) < h.nextRef)) :
Step (.active h (Frame.fn_FibonacciHeap_push_or_decrease 21 s) stack) (.active h (Frame.fn_FibonacciHeap_push_or_decrease 20 { s with v3 := (h.read ((field_FibonacciHeap_parents h (s.v0)).getD 0) s.v1) }) stack)
| FibonacciHeap_push_or_decrease_pc22 (h : Heap) (s : State_FibonacciHeap_push_or_decrease) (stack : Stack) (defined : (((((field_FibonacciHeap_keys h (s.v0)).isSome = true)))) ∧ (((field_FibonacciHeap_keys h (s.v0)).getD 0) < h.nextRef)) :
Step (.active h (Frame.fn_FibonacciHeap_push_or_decrease 22 s) stack) (.active (h.write ((field_FibonacciHeap_keys h (s.v0)).getD 0) s.v1 s.v2) (Frame.fn_FibonacciHeap_push_or_decrease 21 s) stack)
| FibonacciHeap_push_or_decrease_pc23 (h : Heap) (s : State_FibonacciHeap_push_or_decrease) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_push_or_decrease 23 s) stack) (Algo2LeanCore.resumeConfig h (Result.fn_FibonacciHeap_push_or_decrease (s.t16)) stack)
| FibonacciHeap_push_or_decrease_pc24 (h : Heap) (s : State_FibonacciHeap_push_or_decrease) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_push_or_decrease 24 s) stack) (.active h (Frame.fn_FibonacciHeap_push_or_decrease 23 { s with t16 := () }) stack)
| FibonacciHeap_push_or_decrease_pc25_true (h : Heap) (s : State_FibonacciHeap_push_or_decrease) (stack : Stack) (condition : s.t15 = true) :
Step (.active h (Frame.fn_FibonacciHeap_push_or_decrease 25 s) stack) (.active h (Frame.fn_FibonacciHeap_push_or_decrease 24 s) stack)
| FibonacciHeap_push_or_decrease_pc25_false (h : Heap) (s : State_FibonacciHeap_push_or_decrease) (stack : Stack) (condition : s.t15 = false) :
Step (.active h (Frame.fn_FibonacciHeap_push_or_decrease 25 s) stack) (.active h (Frame.fn_FibonacciHeap_push_or_decrease 22 s) stack)
| FibonacciHeap_push_or_decrease_pc26 (h : Heap) (s : State_FibonacciHeap_push_or_decrease) (stack : Stack) (defined : (((((field_FibonacciHeap_keys h (s.v0)).isSome = true))) ∧ (((field_FibonacciHeap_keys h (s.v0)).getD 0) < h.nextRef))) :
Step (.active h (Frame.fn_FibonacciHeap_push_or_decrease 26 s) stack) (.active h (Frame.fn_FibonacciHeap_push_or_decrease 25 { s with t15 := (decide ((s.v2 ≥ (h.read ((field_FibonacciHeap_keys h (s.v0)).getD 0) s.v1)))) }) stack)
| FibonacciHeap_push_or_decrease_pc27 (h : Heap) (s : State_FibonacciHeap_push_or_decrease) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_push_or_decrease 27 s) stack) (.active (h.tick "heap_comparisons" 1) (Frame.fn_FibonacciHeap_push_or_decrease 26 s) stack)
| FibonacciHeap_push_or_decrease_pc28 (h : Heap) (s : State_FibonacciHeap_push_or_decrease) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_push_or_decrease 28 s) stack) (Algo2LeanCore.resumeConfig h (Result.fn_FibonacciHeap_push_or_decrease (s.t18)) stack)
| FibonacciHeap_push_or_decrease_pc29 (h : Heap) (s : State_FibonacciHeap_push_or_decrease) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_push_or_decrease 29 s) stack) (.active h (Frame.fn_FibonacciHeap_push_or_decrease 28 { s with t18 := () }) stack)
| FibonacciHeap_push_or_decrease_pc30 (h : Heap) (s : State_FibonacciHeap_push_or_decrease) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_push_or_decrease 30 s) stack) (.active h (Frame.fn_FibonacciHeap_add_root 19 ({ v0 := (s.t20), v1 := s.t21 } : State_FibonacciHeap_add_root)) ((fun value => match value with | .fn_FibonacciHeap_add_root result => (Frame.fn_FibonacciHeap_push_or_decrease 29 { s with t19 := result }) | _ => .invalid) :: stack))
| FibonacciHeap_push_or_decrease_pc31 (h : Heap) (s : State_FibonacciHeap_push_or_decrease) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_push_or_decrease 31 s) stack) (.active h (Frame.fn_FibonacciHeap_push_or_decrease 30 { s with t21 := s.v1 }) stack)
| FibonacciHeap_push_or_decrease_pc32 (h : Heap) (s : State_FibonacciHeap_push_or_decrease) (stack : Stack) (defined : (is_FibonacciHeap h (s.t20))) :
Step (.active h (Frame.fn_FibonacciHeap_push_or_decrease 32 s) stack) (.active h (Frame.fn_FibonacciHeap_push_or_decrease 31 { s with t20 := s.t20 }) stack)
| FibonacciHeap_push_or_decrease_pc33 (h : Heap) (s : State_FibonacciHeap_push_or_decrease) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_push_or_decrease 33 s) stack) (.active h (Frame.fn_FibonacciHeap_push_or_decrease 32 { s with t20 := s.v0 }) stack)
| FibonacciHeap_push_or_decrease_pc34 (h : Heap) (s : State_FibonacciHeap_push_or_decrease) (stack : Stack) (defined : (is_FibonacciHeap h (s.t22))) :
Step (.active h (Frame.fn_FibonacciHeap_push_or_decrease 34 s) stack) (.active (set_FibonacciHeap_size h (s.t22) ((s.t23 + s.t24))) (Frame.fn_FibonacciHeap_push_or_decrease 33 s) stack)
| FibonacciHeap_push_or_decrease_pc35 (h : Heap) (s : State_FibonacciHeap_push_or_decrease) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_push_or_decrease 35 s) stack) (.active h (Frame.fn_FibonacciHeap_push_or_decrease 34 { s with t24 := (1 : Int) }) stack)
| FibonacciHeap_push_or_decrease_pc36 (h : Heap) (s : State_FibonacciHeap_push_or_decrease) (stack : Stack) (defined : ((field_FibonacciHeap_size h (s.t22)).isSome = true)) :
Step (.active h (Frame.fn_FibonacciHeap_push_or_decrease 36 s) stack) (.active h (Frame.fn_FibonacciHeap_push_or_decrease 35 { s with t23 := ((field_FibonacciHeap_size h (s.t22)).getD 0) }) stack)
| FibonacciHeap_push_or_decrease_pc37 (h : Heap) (s : State_FibonacciHeap_push_or_decrease) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_push_or_decrease 37 s) stack) (.active h (Frame.fn_FibonacciHeap_push_or_decrease 36 { s with t22 := s.v0 }) stack)
| FibonacciHeap_push_or_decrease_pc38 (h : Heap) (s : State_FibonacciHeap_push_or_decrease) (stack : Stack) (defined : (((((field_FibonacciHeap_present h (s.v0)).isSome = true)))) ∧ (((field_FibonacciHeap_present h (s.v0)).getD 0) < h.nextRef)) :
Step (.active h (Frame.fn_FibonacciHeap_push_or_decrease 38 s) stack) (.active (h.write ((field_FibonacciHeap_present h (s.v0)).getD 0) s.v1 (1 : Int)) (Frame.fn_FibonacciHeap_push_or_decrease 37 s) stack)
| FibonacciHeap_push_or_decrease_pc39 (h : Heap) (s : State_FibonacciHeap_push_or_decrease) (stack : Stack) (defined : (((((field_FibonacciHeap_degrees h (s.v0)).isSome = true)))) ∧ (((field_FibonacciHeap_degrees h (s.v0)).getD 0) < h.nextRef)) :
Step (.active h (Frame.fn_FibonacciHeap_push_or_decrease 39 s) stack) (.active (h.write ((field_FibonacciHeap_degrees h (s.v0)).getD 0) s.v1 (0 : Int)) (Frame.fn_FibonacciHeap_push_or_decrease 38 s) stack)
| FibonacciHeap_push_or_decrease_pc40 (h : Heap) (s : State_FibonacciHeap_push_or_decrease) (stack : Stack) (defined : (((((field_FibonacciHeap_children h (s.v0)).isSome = true)))) ∧ (((field_FibonacciHeap_children h (s.v0)).getD 0) < h.nextRef)) :
Step (.active h (Frame.fn_FibonacciHeap_push_or_decrease 40 s) stack) (.active (h.write ((field_FibonacciHeap_children h (s.v0)).getD 0) s.v1 (-(1 : Int))) (Frame.fn_FibonacciHeap_push_or_decrease 39 s) stack)
| FibonacciHeap_push_or_decrease_pc41 (h : Heap) (s : State_FibonacciHeap_push_or_decrease) (stack : Stack) (defined : (((((field_FibonacciHeap_keys h (s.v0)).isSome = true)))) ∧ (((field_FibonacciHeap_keys h (s.v0)).getD 0) < h.nextRef)) :
Step (.active h (Frame.fn_FibonacciHeap_push_or_decrease 41 s) stack) (.active (h.write ((field_FibonacciHeap_keys h (s.v0)).getD 0) s.v1 s.v2) (Frame.fn_FibonacciHeap_push_or_decrease 40 s) stack)
| FibonacciHeap_push_or_decrease_pc42_true (h : Heap) (s : State_FibonacciHeap_push_or_decrease) (stack : Stack) (condition : s.t17 = true) :
Step (.active h (Frame.fn_FibonacciHeap_push_or_decrease 42 s) stack) (.active h (Frame.fn_FibonacciHeap_push_or_decrease 41 s) stack)
| FibonacciHeap_push_or_decrease_pc42_false (h : Heap) (s : State_FibonacciHeap_push_or_decrease) (stack : Stack) (condition : s.t17 = false) :
Step (.active h (Frame.fn_FibonacciHeap_push_or_decrease 42 s) stack) (.active h (Frame.fn_FibonacciHeap_push_or_decrease 27 s) stack)
| FibonacciHeap_push_or_decrease_pc43 (h : Heap) (s : State_FibonacciHeap_push_or_decrease) (stack : Stack) (defined : (((((field_FibonacciHeap_present h (s.v0)).isSome = true))) ∧ (((field_FibonacciHeap_present h (s.v0)).getD 0) < h.nextRef))) :
Step (.active h (Frame.fn_FibonacciHeap_push_or_decrease 43 s) stack) (.active h (Frame.fn_FibonacciHeap_push_or_decrease 42 { s with t17 := (decide (((h.read ((field_FibonacciHeap_present h (s.v0)).getD 0) s.v1) = (0 : Int)))) }) stack)
| FibonacciHeap_push_or_decrease_pc44 (h : Heap) (s : State_FibonacciHeap_push_or_decrease) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_push_or_decrease 44 s) stack) (.active (h.tick "heap_operations" 1) (Frame.fn_FibonacciHeap_push_or_decrease 43 s) stack)
| FibonacciHeap_pop_min_pc1 (h : Heap) (s : State_FibonacciHeap_pop_min) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_pop_min 1 s) stack) (Algo2LeanCore.resumeConfig h (Result.fn_FibonacciHeap_pop_min (s.t4)) stack)
| FibonacciHeap_pop_min_pc2 (h : Heap) (s : State_FibonacciHeap_pop_min) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_pop_min 2 s) stack) (.active h (Frame.fn_FibonacciHeap_pop_min 1 { s with t4 := s.v1 }) stack)
| FibonacciHeap_pop_min_pc3 (h : Heap) (s : State_FibonacciHeap_pop_min) (stack : Stack) (defined : (is_FibonacciHeap h (s.v0))) :
Step (.active h (Frame.fn_FibonacciHeap_pop_min 3 s) stack) (.active (set_FibonacciHeap_minimum h (s.v0) ((-(1 : Int)))) (Frame.fn_FibonacciHeap_pop_min 2 s) stack)
| FibonacciHeap_pop_min_pc4 (h : Heap) (s : State_FibonacciHeap_pop_min) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_pop_min 4 s) stack) (.active h (Frame.fn_FibonacciHeap_consolidate 50 ({ v0 := (s.t7) } : State_FibonacciHeap_consolidate)) ((fun value => match value with | .fn_FibonacciHeap_consolidate result => (Frame.fn_FibonacciHeap_pop_min 2 { s with t6 := result }) | _ => .invalid) :: stack))
| FibonacciHeap_pop_min_pc5 (h : Heap) (s : State_FibonacciHeap_pop_min) (stack : Stack) (defined : (is_FibonacciHeap h (s.t7))) :
Step (.active h (Frame.fn_FibonacciHeap_pop_min 5 s) stack) (.active h (Frame.fn_FibonacciHeap_pop_min 4 { s with t7 := s.t7 }) stack)
| FibonacciHeap_pop_min_pc6 (h : Heap) (s : State_FibonacciHeap_pop_min) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_pop_min 6 s) stack) (.active h (Frame.fn_FibonacciHeap_pop_min 5 { s with t7 := s.v0 }) stack)
| FibonacciHeap_pop_min_pc7 (h : Heap) (s : State_FibonacciHeap_pop_min) (stack : Stack) (defined : (is_FibonacciHeap h (s.v0))) :
Step (.active h (Frame.fn_FibonacciHeap_pop_min 7 s) stack) (.active (set_FibonacciHeap_minimum h (s.v0) (s.v3)) (Frame.fn_FibonacciHeap_pop_min 6 s) stack)
| FibonacciHeap_pop_min_pc8_true (h : Heap) (s : State_FibonacciHeap_pop_min) (stack : Stack) (condition : s.t5 = true) :
Step (.active h (Frame.fn_FibonacciHeap_pop_min 8 s) stack) (.active h (Frame.fn_FibonacciHeap_pop_min 3 s) stack)
| FibonacciHeap_pop_min_pc8_false (h : Heap) (s : State_FibonacciHeap_pop_min) (stack : Stack) (condition : s.t5 = false) :
Step (.active h (Frame.fn_FibonacciHeap_pop_min 8 s) stack) (.active h (Frame.fn_FibonacciHeap_pop_min 7 s) stack)
| FibonacciHeap_pop_min_pc9 (h : Heap) (s : State_FibonacciHeap_pop_min) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_pop_min 9 s) stack) (.active h (Frame.fn_FibonacciHeap_pop_min 8 { s with t5 := (decide ((s.v3 = s.v1))) }) stack)
| FibonacciHeap_pop_min_pc10 (h : Heap) (s : State_FibonacciHeap_pop_min) (stack : Stack) (defined : (is_FibonacciHeap h (s.t8))) :
Step (.active h (Frame.fn_FibonacciHeap_pop_min 10 s) stack) (.active (set_FibonacciHeap_size h (s.t8) ((s.t9 - s.t10))) (Frame.fn_FibonacciHeap_pop_min 9 s) stack)
| FibonacciHeap_pop_min_pc11 (h : Heap) (s : State_FibonacciHeap_pop_min) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_pop_min 11 s) stack) (.active h (Frame.fn_FibonacciHeap_pop_min 10 { s with t10 := (1 : Int) }) stack)
| FibonacciHeap_pop_min_pc12 (h : Heap) (s : State_FibonacciHeap_pop_min) (stack : Stack) (defined : ((field_FibonacciHeap_size h (s.t8)).isSome = true)) :
Step (.active h (Frame.fn_FibonacciHeap_pop_min 12 s) stack) (.active h (Frame.fn_FibonacciHeap_pop_min 11 { s with t9 := ((field_FibonacciHeap_size h (s.t8)).getD 0) }) stack)
| FibonacciHeap_pop_min_pc13 (h : Heap) (s : State_FibonacciHeap_pop_min) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_pop_min 13 s) stack) (.active h (Frame.fn_FibonacciHeap_pop_min 12 { s with t8 := s.v0 }) stack)
| FibonacciHeap_pop_min_pc14 (h : Heap) (s : State_FibonacciHeap_pop_min) (stack : Stack) (defined : (((((field_FibonacciHeap_present h (s.v0)).isSome = true)))) ∧ (((field_FibonacciHeap_present h (s.v0)).getD 0) < h.nextRef)) :
Step (.active h (Frame.fn_FibonacciHeap_pop_min 14 s) stack) (.active (h.write ((field_FibonacciHeap_present h (s.v0)).getD 0) s.v1 (0 : Int)) (Frame.fn_FibonacciHeap_pop_min 13 s) stack)
| FibonacciHeap_pop_min_pc15 (h : Heap) (s : State_FibonacciHeap_pop_min) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_pop_min 15 s) stack) (.active h (Frame.fn_FibonacciHeap_remove_from_ring 8 ({ v0 := (s.t12), v1 := s.t13 } : State_FibonacciHeap_remove_from_ring)) ((fun value => match value with | .fn_FibonacciHeap_remove_from_ring result => (Frame.fn_FibonacciHeap_pop_min 14 { s with t11 := result }) | _ => .invalid) :: stack))
| FibonacciHeap_pop_min_pc16 (h : Heap) (s : State_FibonacciHeap_pop_min) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_pop_min 16 s) stack) (.active h (Frame.fn_FibonacciHeap_pop_min 15 { s with t13 := s.v1 }) stack)
| FibonacciHeap_pop_min_pc17 (h : Heap) (s : State_FibonacciHeap_pop_min) (stack : Stack) (defined : (is_FibonacciHeap h (s.t12))) :
Step (.active h (Frame.fn_FibonacciHeap_pop_min 17 s) stack) (.active h (Frame.fn_FibonacciHeap_pop_min 16 { s with t12 := s.t12 }) stack)
| FibonacciHeap_pop_min_pc18 (h : Heap) (s : State_FibonacciHeap_pop_min) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_pop_min 18 s) stack) (.active h (Frame.fn_FibonacciHeap_pop_min 17 { s with t12 := s.v0 }) stack)
| FibonacciHeap_pop_min_pc19 (h : Heap) (s : State_FibonacciHeap_pop_min) (stack : Stack) (defined : ((((field_FibonacciHeap_right h (s.v0)).isSome = true))) ∧ (((field_FibonacciHeap_right h (s.v0)).getD 0) < h.nextRef)) :
Step (.active h (Frame.fn_FibonacciHeap_pop_min 19 s) stack) (.active h (Frame.fn_FibonacciHeap_pop_min 18 { s with v3 := (h.read ((field_FibonacciHeap_right h (s.v0)).getD 0) s.v1) }) stack)
| FibonacciHeap_pop_min_pc20_true (h : Heap) (s : State_FibonacciHeap_pop_min) (stack : Stack) (condition : s.t14 = true) :
Step (.active h (Frame.fn_FibonacciHeap_pop_min 20 s) stack) (.active h (Frame.fn_FibonacciHeap_pop_min 36 s) stack)
| FibonacciHeap_pop_min_pc20_false (h : Heap) (s : State_FibonacciHeap_pop_min) (stack : Stack) (condition : s.t14 = false) :
Step (.active h (Frame.fn_FibonacciHeap_pop_min 20 s) stack) (.active h (Frame.fn_FibonacciHeap_pop_min 19 s) stack)
| FibonacciHeap_pop_min_pc21 (h : Heap) (s : State_FibonacciHeap_pop_min) (stack : Stack) (defined : (((((field_FibonacciHeap_children h (s.v0)).isSome = true))) ∧ (((field_FibonacciHeap_children h (s.v0)).getD 0) < h.nextRef))) :
Step (.active h (Frame.fn_FibonacciHeap_pop_min 21 s) stack) (.active h (Frame.fn_FibonacciHeap_pop_min 20 { s with t14 := (decide (((h.read ((field_FibonacciHeap_children h (s.v0)).getD 0) s.v1) ≥ (0 : Int)))) }) stack)
| FibonacciHeap_pop_min_pc22 (h : Heap) (s : State_FibonacciHeap_pop_min) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_pop_min 22 s) stack) (.active (h.tick "heap_promotions" 1) (Frame.fn_FibonacciHeap_pop_min 21 s) stack)
| FibonacciHeap_pop_min_pc23 (h : Heap) (s : State_FibonacciHeap_pop_min) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_pop_min 23 s) stack) (.active h (Frame.fn_FibonacciHeap_add_root 19 ({ v0 := (s.t16), v1 := s.t17 } : State_FibonacciHeap_add_root)) ((fun value => match value with | .fn_FibonacciHeap_add_root result => (Frame.fn_FibonacciHeap_pop_min 22 { s with t15 := result }) | _ => .invalid) :: stack))
| FibonacciHeap_pop_min_pc24 (h : Heap) (s : State_FibonacciHeap_pop_min) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_pop_min 24 s) stack) (.active h (Frame.fn_FibonacciHeap_pop_min 23 { s with t17 := s.v2 }) stack)
| FibonacciHeap_pop_min_pc25 (h : Heap) (s : State_FibonacciHeap_pop_min) (stack : Stack) (defined : (is_FibonacciHeap h (s.t16))) :
Step (.active h (Frame.fn_FibonacciHeap_pop_min 25 s) stack) (.active h (Frame.fn_FibonacciHeap_pop_min 24 { s with t16 := s.t16 }) stack)
| FibonacciHeap_pop_min_pc26 (h : Heap) (s : State_FibonacciHeap_pop_min) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_pop_min 26 s) stack) (.active h (Frame.fn_FibonacciHeap_pop_min 25 { s with t16 := s.v0 }) stack)
| FibonacciHeap_pop_min_pc27 (h : Heap) (s : State_FibonacciHeap_pop_min) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_pop_min 27 s) stack) (.active h (Frame.fn_FibonacciHeap_remove_from_ring 8 ({ v0 := (s.t19), v1 := s.t20 } : State_FibonacciHeap_remove_from_ring)) ((fun value => match value with | .fn_FibonacciHeap_remove_from_ring result => (Frame.fn_FibonacciHeap_pop_min 26 { s with t18 := result }) | _ => .invalid) :: stack))
| FibonacciHeap_pop_min_pc28 (h : Heap) (s : State_FibonacciHeap_pop_min) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_pop_min 28 s) stack) (.active h (Frame.fn_FibonacciHeap_pop_min 27 { s with t20 := s.v2 }) stack)
| FibonacciHeap_pop_min_pc29 (h : Heap) (s : State_FibonacciHeap_pop_min) (stack : Stack) (defined : (is_FibonacciHeap h (s.t19))) :
Step (.active h (Frame.fn_FibonacciHeap_pop_min 29 s) stack) (.active h (Frame.fn_FibonacciHeap_pop_min 28 { s with t19 := s.t19 }) stack)
| FibonacciHeap_pop_min_pc30 (h : Heap) (s : State_FibonacciHeap_pop_min) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_pop_min 30 s) stack) (.active h (Frame.fn_FibonacciHeap_pop_min 29 { s with t19 := s.v0 }) stack)
| FibonacciHeap_pop_min_pc31 (h : Heap) (s : State_FibonacciHeap_pop_min) (stack : Stack) (defined : (((((((field_FibonacciHeap_degrees h (s.v0)).isSome = true))) ∧ (((field_FibonacciHeap_degrees h (s.v0)).getD 0) < h.nextRef))) ∧ ((((field_FibonacciHeap_degrees h (s.v0)).isSome = true)))) ∧ (((field_FibonacciHeap_degrees h (s.v0)).getD 0) < h.nextRef)) :
Step (.active h (Frame.fn_FibonacciHeap_pop_min 31 s) stack) (.active (h.write ((field_FibonacciHeap_degrees h (s.v0)).getD 0) s.v1 ((h.read ((field_FibonacciHeap_degrees h (s.v0)).getD 0) s.v1) - (1 : Int))) (Frame.fn_FibonacciHeap_pop_min 30 s) stack)
| FibonacciHeap_pop_min_pc32 (h : Heap) (s : State_FibonacciHeap_pop_min) (stack : Stack) (defined : (((((field_FibonacciHeap_children h (s.v0)).isSome = true)))) ∧ (((field_FibonacciHeap_children h (s.v0)).getD 0) < h.nextRef)) :
Step (.active h (Frame.fn_FibonacciHeap_pop_min 32 s) stack) (.active (h.write ((field_FibonacciHeap_children h (s.v0)).getD 0) s.v1 (-(1 : Int))) (Frame.fn_FibonacciHeap_pop_min 31 s) stack)
| FibonacciHeap_pop_min_pc33 (h : Heap) (s : State_FibonacciHeap_pop_min) (stack : Stack) (defined : ((((((field_FibonacciHeap_right h (s.v0)).isSome = true))) ∧ (((field_FibonacciHeap_right h (s.v0)).getD 0) < h.nextRef)) ∧ ((((field_FibonacciHeap_children h (s.v0)).isSome = true)))) ∧ (((field_FibonacciHeap_children h (s.v0)).getD 0) < h.nextRef)) :
Step (.active h (Frame.fn_FibonacciHeap_pop_min 33 s) stack) (.active (h.write ((field_FibonacciHeap_children h (s.v0)).getD 0) s.v1 (h.read ((field_FibonacciHeap_right h (s.v0)).getD 0) s.v2)) (Frame.fn_FibonacciHeap_pop_min 31 s) stack)
| FibonacciHeap_pop_min_pc34_true (h : Heap) (s : State_FibonacciHeap_pop_min) (stack : Stack) (condition : s.t21 = true) :
Step (.active h (Frame.fn_FibonacciHeap_pop_min 34 s) stack) (.active h (Frame.fn_FibonacciHeap_pop_min 32 s) stack)
| FibonacciHeap_pop_min_pc34_false (h : Heap) (s : State_FibonacciHeap_pop_min) (stack : Stack) (condition : s.t21 = false) :
Step (.active h (Frame.fn_FibonacciHeap_pop_min 34 s) stack) (.active h (Frame.fn_FibonacciHeap_pop_min 33 s) stack)
| FibonacciHeap_pop_min_pc35 (h : Heap) (s : State_FibonacciHeap_pop_min) (stack : Stack) (defined : (((((field_FibonacciHeap_right h (s.v0)).isSome = true))) ∧ (((field_FibonacciHeap_right h (s.v0)).getD 0) < h.nextRef))) :
Step (.active h (Frame.fn_FibonacciHeap_pop_min 35 s) stack) (.active h (Frame.fn_FibonacciHeap_pop_min 34 { s with t21 := (decide (((h.read ((field_FibonacciHeap_right h (s.v0)).getD 0) s.v2) = s.v2))) }) stack)
| FibonacciHeap_pop_min_pc36 (h : Heap) (s : State_FibonacciHeap_pop_min) (stack : Stack) (defined : ((((field_FibonacciHeap_children h (s.v0)).isSome = true))) ∧ (((field_FibonacciHeap_children h (s.v0)).getD 0) < h.nextRef)) :
Step (.active h (Frame.fn_FibonacciHeap_pop_min 36 s) stack) (.active h (Frame.fn_FibonacciHeap_pop_min 35 { s with v2 := (h.read ((field_FibonacciHeap_children h (s.v0)).getD 0) s.v1) }) stack)
| FibonacciHeap_pop_min_pc37 (h : Heap) (s : State_FibonacciHeap_pop_min) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_pop_min 37 s) stack) (Algo2LeanCore.resumeConfig h (Result.fn_FibonacciHeap_pop_min (s.t23)) stack)
| FibonacciHeap_pop_min_pc38 (h : Heap) (s : State_FibonacciHeap_pop_min) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_pop_min 38 s) stack) (.active h (Frame.fn_FibonacciHeap_pop_min 37 { s with t23 := (-(1 : Int)) }) stack)
| FibonacciHeap_pop_min_pc39_true (h : Heap) (s : State_FibonacciHeap_pop_min) (stack : Stack) (condition : s.t22 = true) :
Step (.active h (Frame.fn_FibonacciHeap_pop_min 39 s) stack) (.active h (Frame.fn_FibonacciHeap_pop_min 38 s) stack)
| FibonacciHeap_pop_min_pc39_false (h : Heap) (s : State_FibonacciHeap_pop_min) (stack : Stack) (condition : s.t22 = false) :
Step (.active h (Frame.fn_FibonacciHeap_pop_min 39 s) stack) (.active h (Frame.fn_FibonacciHeap_pop_min 21 s) stack)
| FibonacciHeap_pop_min_pc40 (h : Heap) (s : State_FibonacciHeap_pop_min) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_pop_min 40 s) stack) (.active h (Frame.fn_FibonacciHeap_pop_min 39 { s with t22 := (decide ((s.v1 < (0 : Int)))) }) stack)
| FibonacciHeap_pop_min_pc41 (h : Heap) (s : State_FibonacciHeap_pop_min) (stack : Stack) (defined : (((field_FibonacciHeap_minimum h (s.v0)).isSome = true))) :
Step (.active h (Frame.fn_FibonacciHeap_pop_min 41 s) stack) (.active h (Frame.fn_FibonacciHeap_pop_min 40 { s with v1 := ((field_FibonacciHeap_minimum h (s.v0)).getD 0) }) stack)
| FibonacciHeap_pop_min_pc42 (h : Heap) (s : State_FibonacciHeap_pop_min) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_pop_min 42 s) stack) (.active (h.tick "heap_operations" 1) (Frame.fn_FibonacciHeap_pop_min 41 s) stack)
| FibonacciHeap_is_empty_pc1 (h : Heap) (s : State_FibonacciHeap_is_empty) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap_is_empty 1 s) stack) (Algo2LeanCore.resumeConfig h (Result.fn_FibonacciHeap_is_empty (s.t1)) stack)
| FibonacciHeap_is_empty_pc2 (h : Heap) (s : State_FibonacciHeap_is_empty) (stack : Stack) (defined : ((((field_FibonacciHeap_size h (s.v0)).isSome = true)))) :
Step (.active h (Frame.fn_FibonacciHeap_is_empty 2 s) stack) (.active h (Frame.fn_FibonacciHeap_is_empty 1 { s with t1 := (decide ((((field_FibonacciHeap_size h (s.v0)).getD 0) ≤ (0 : Int)))) }) stack)
| FibonacciHeap_pc1 (h : Heap) (s : State_FibonacciHeap) (stack : Stack) (defined : is_FibonacciHeap h s.t1) :
Step (.active h (Frame.fn_FibonacciHeap 1 s) stack) (Algo2LeanCore.resumeConfig h (Result.fn_FibonacciHeap (s.t1)) stack)
| FibonacciHeap_pc2 (h : Heap) (s : State_FibonacciHeap) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap 2 s) stack) (.active h (Frame.fn_FibonacciHeap 1 { s with t1 := s.v0 }) stack)
| FibonacciHeap_pc3 (h : Heap) (s : State_FibonacciHeap) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap 3 s) stack) (.active h (Frame.fn_FibonacciHeap___init__ 40 ({ v0 := s.t3 } : State_FibonacciHeap___init__)) ((fun value => match value with | .fn_FibonacciHeap___init__ result => (Frame.fn_FibonacciHeap 2 { s with t2 := result }) | _ => .invalid) :: stack))
| FibonacciHeap_pc4 (h : Heap) (s : State_FibonacciHeap) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap 4 s) stack) (.active h (Frame.fn_FibonacciHeap 3 { s with t3 := s.v0 }) stack)
| FibonacciHeap_pc5 (h : Heap) (s : State_FibonacciHeap) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap 5 s) stack) (.active h (Frame.fn_FibonacciHeap 4 { s with v0 := s.t4 }) stack)
| FibonacciHeap_pc6 (h : Heap) (s : State_FibonacciHeap) (stack : Stack) :
Step (.active h (Frame.fn_FibonacciHeap 6 s) stack) (.active (h.allocateObject "fibonacci_heap.FibonacciHeap") (Frame.fn_FibonacciHeap 5 { s with t4 := h.nextObject }) stack)
theorem terminal (h : Heap) (result : Result) :
Algo2LeanCore.Terminal Step (.done h result) := by
intro next transition
cases transition
end Algo2LeanGenerated
open Algo2LeanGenerated
def entry_FibonacciHeap___init__ (input : Ref_FibonacciHeap) : Frame :=
(Frame.fn_FibonacciHeap___init__ 40 ({ v0 := input } : State_FibonacciHeap___init__))
def FibonacciHeap.__init__.ValidInput (h : Heap) (input : Ref_FibonacciHeap) : Prop := is_FibonacciHeap h input
def FibonacciHeap.__init__.initial (h : Heap) (input : Ref_FibonacciHeap) : Configuration :=
Algo2LeanCore.start h (Frame.fn_FibonacciHeap___init__ 40 ({ v0 := input } : State_FibonacciHeap___init__))
def FibonacciHeap.__init__.Run (h : Heap) (input : Ref_FibonacciHeap) (h' : Heap) (output : Unit) : Prop :=
_root_.Algo.«fibonacci_heap».FibonacciHeap.__init__.ValidInput h input ∧ Algo2LeanCore.Reaches Step (_root_.Algo.«fibonacci_heap».FibonacciHeap.__init__.initial h input) (.done h' (Result.fn_FibonacciHeap___init__ output))
def FibonacciHeap.__init__.ValidHeapTranscript (h : Heap) (input : Ref_FibonacciHeap) (trace : Transcript) : Prop :=
_root_.Algo.«fibonacci_heap».FibonacciHeap.__init__.ValidInput h input ∧ ∃ final, Algo2LeanCore.Valid Step (_root_.Algo.«fibonacci_heap».FibonacciHeap.__init__.initial h input) trace final
def FibonacciHeap.__init__.Call (h : Heap) (input : Ref_FibonacciHeap) (h' : Heap) (output : Unit) : Prop :=
_root_.Algo.«fibonacci_heap».FibonacciHeap.__init__.ValidInput h input ∧ Algo2LeanCore.Summary Step h (Frame.fn_FibonacciHeap___init__ 40 ({ v0 := input } : State_FibonacciHeap___init__)) h' (Result.fn_FibonacciHeap___init__ output)
-- Complete this function from the supplied local state, under any caller stack.
def FibonacciHeap.__init__.CallFrom (state : Configuration) (finalHeap : Heap) (output : Unit) : Prop :=
match state with
| .active heap (Frame.fn_FibonacciHeap___init__ pc locals) _ =>
Algo2LeanCore.Summary Step heap (Frame.fn_FibonacciHeap___init__ pc locals) finalHeap (Result.fn_FibonacciHeap___init__ output)
| _ => False
-- Object inputs carry their heap, preserving shared references and cycles.
def FibonacciHeap.__init__.load (input : Heap × (Ref_FibonacciHeap)) : Heap × (Ref_FibonacciHeap) := input
def FibonacciHeap.__init__.ValidTranscript (my_input : Heap × (Ref_FibonacciHeap)) (trace : Transcript) : Prop :=
let loaded := _root_.Algo.«fibonacci_heap».FibonacciHeap.__init__.load my_input
_root_.Algo.«fibonacci_heap».FibonacciHeap.__init__.ValidHeapTranscript loaded.1 loaded.2 trace
def FibonacciHeap.__init__.Returns (my_input : Heap × (Ref_FibonacciHeap)) (my_output : Unit) : Prop :=
let loaded := _root_.Algo.«fibonacci_heap».FibonacciHeap.__init__.load my_input
∃ finalHeap, _root_.Algo.«fibonacci_heap».FibonacciHeap.__init__.Run loaded.1 loaded.2 finalHeap my_output
-- Output and clock increments from one completed execution.
def FibonacciHeap.__init__.ReturnsWithCost (my_input : Heap × (Ref_FibonacciHeap)) (my_output : Unit) (costs : Clocks) : Prop :=
let loaded := _root_.Algo.«fibonacci_heap».FibonacciHeap.__init__.load my_input
∃ finalHeap, _root_.Algo.«fibonacci_heap».FibonacciHeap.__init__.Run loaded.1 loaded.2 finalHeap my_output ∧ Heap.cost loaded.1 finalHeap = costs
theorem FibonacciHeap.__init__.ReturnsWithCost.returns {input output costs}
(run : _root_.Algo.«fibonacci_heap».FibonacciHeap.__init__.ReturnsWithCost input output costs) : _root_.Algo.«fibonacci_heap».FibonacciHeap.__init__.Returns input output := by
obtain ⟨heap, execution, _⟩ := run
exact ⟨heap, execution⟩
theorem FibonacciHeap.__init__.Returns.withCost {input output}
(run : _root_.Algo.«fibonacci_heap».FibonacciHeap.__init__.Returns input output) : ∃ costs, _root_.Algo.«fibonacci_heap».FibonacciHeap.__init__.ReturnsWithCost input output costs := by
obtain ⟨heap, execution⟩ := run
exact ⟨Heap.cost (_root_.Algo.«fibonacci_heap».FibonacciHeap.__init__.load input).1 heap, heap, execution, rfl⟩
theorem FibonacciHeap.__init__.Call.run {before input after output}
(call : _root_.Algo.«fibonacci_heap».FibonacciHeap.__init__.Call before input after output) :
_root_.Algo.«fibonacci_heap».FibonacciHeap.__init__.Run before input after output :=
⟨call.1, call.2.root⟩
def entry_FibonacciHeap_remove_from_ring (input : Ref_FibonacciHeap × Int) : Frame :=
(Frame.fn_FibonacciHeap_remove_from_ring 8 ({ v0 := input.1, v1 := input.2 } : State_FibonacciHeap_remove_from_ring))
def FibonacciHeap.remove_from_ring.ValidInput (h : Heap) (input : Ref_FibonacciHeap × Int) : Prop := is_FibonacciHeap h input.1
def FibonacciHeap.remove_from_ring.initial (h : Heap) (input : Ref_FibonacciHeap × Int) : Configuration :=
Algo2LeanCore.start h (Frame.fn_FibonacciHeap_remove_from_ring 8 ({ v0 := input.1, v1 := input.2 } : State_FibonacciHeap_remove_from_ring))
def FibonacciHeap.remove_from_ring.Run (h : Heap) (input : Ref_FibonacciHeap × Int) (h' : Heap) (output : Unit) : Prop :=
_root_.Algo.«fibonacci_heap».FibonacciHeap.remove_from_ring.ValidInput h input ∧ Algo2LeanCore.Reaches Step (_root_.Algo.«fibonacci_heap».FibonacciHeap.remove_from_ring.initial h input) (.done h' (Result.fn_FibonacciHeap_remove_from_ring output))
def FibonacciHeap.remove_from_ring.ValidHeapTranscript (h : Heap) (input : Ref_FibonacciHeap × Int) (trace : Transcript) : Prop :=
_root_.Algo.«fibonacci_heap».FibonacciHeap.remove_from_ring.ValidInput h input ∧ ∃ final, Algo2LeanCore.Valid Step (_root_.Algo.«fibonacci_heap».FibonacciHeap.remove_from_ring.initial h input) trace final
def FibonacciHeap.remove_from_ring.Call (h : Heap) (input : Ref_FibonacciHeap × Int) (h' : Heap) (output : Unit) : Prop :=
_root_.Algo.«fibonacci_heap».FibonacciHeap.remove_from_ring.ValidInput h input ∧ Algo2LeanCore.Summary Step h (Frame.fn_FibonacciHeap_remove_from_ring 8 ({ v0 := input.1, v1 := input.2 } : State_FibonacciHeap_remove_from_ring)) h' (Result.fn_FibonacciHeap_remove_from_ring output)
-- Complete this function from the supplied local state, under any caller stack.
def FibonacciHeap.remove_from_ring.CallFrom (state : Configuration) (finalHeap : Heap) (output : Unit) : Prop :=
match state with
| .active heap (Frame.fn_FibonacciHeap_remove_from_ring pc locals) _ =>
Algo2LeanCore.Summary Step heap (Frame.fn_FibonacciHeap_remove_from_ring pc locals) finalHeap (Result.fn_FibonacciHeap_remove_from_ring output)
| _ => False
-- Object inputs carry their heap, preserving shared references and cycles.
def FibonacciHeap.remove_from_ring.load (input : Heap × (Ref_FibonacciHeap × Int)) : Heap × (Ref_FibonacciHeap × Int) := input
def FibonacciHeap.remove_from_ring.ValidTranscript (my_input : Heap × (Ref_FibonacciHeap × Int)) (trace : Transcript) : Prop :=
let loaded := _root_.Algo.«fibonacci_heap».FibonacciHeap.remove_from_ring.load my_input
_root_.Algo.«fibonacci_heap».FibonacciHeap.remove_from_ring.ValidHeapTranscript loaded.1 loaded.2 trace
def FibonacciHeap.remove_from_ring.Returns (my_input : Heap × (Ref_FibonacciHeap × Int)) (my_output : Unit) : Prop :=
let loaded := _root_.Algo.«fibonacci_heap».FibonacciHeap.remove_from_ring.load my_input
∃ finalHeap, _root_.Algo.«fibonacci_heap».FibonacciHeap.remove_from_ring.Run loaded.1 loaded.2 finalHeap my_output
-- Output and clock increments from one completed execution.
def FibonacciHeap.remove_from_ring.ReturnsWithCost (my_input : Heap × (Ref_FibonacciHeap × Int)) (my_output : Unit) (costs : Clocks) : Prop :=
let loaded := _root_.Algo.«fibonacci_heap».FibonacciHeap.remove_from_ring.load my_input
∃ finalHeap, _root_.Algo.«fibonacci_heap».FibonacciHeap.remove_from_ring.Run loaded.1 loaded.2 finalHeap my_output ∧ Heap.cost loaded.1 finalHeap = costs
theorem FibonacciHeap.remove_from_ring.ReturnsWithCost.returns {input output costs}
(run : _root_.Algo.«fibonacci_heap».FibonacciHeap.remove_from_ring.ReturnsWithCost input output costs) : _root_.Algo.«fibonacci_heap».FibonacciHeap.remove_from_ring.Returns input output := by
obtain ⟨heap, execution, _⟩ := run
exact ⟨heap, execution⟩
theorem FibonacciHeap.remove_from_ring.Returns.withCost {input output}
(run : _root_.Algo.«fibonacci_heap».FibonacciHeap.remove_from_ring.Returns input output) : ∃ costs, _root_.Algo.«fibonacci_heap».FibonacciHeap.remove_from_ring.ReturnsWithCost input output costs := by
obtain ⟨heap, execution⟩ := run
exact ⟨Heap.cost (_root_.Algo.«fibonacci_heap».FibonacciHeap.remove_from_ring.load input).1 heap, heap, execution, rfl⟩
theorem FibonacciHeap.remove_from_ring.Call.run {before input after output}
(call : _root_.Algo.«fibonacci_heap».FibonacciHeap.remove_from_ring.Call before input after output) :
_root_.Algo.«fibonacci_heap».FibonacciHeap.remove_from_ring.Run before input after output :=
⟨call.1, call.2.root⟩
def entry_FibonacciHeap_add_root (input : Ref_FibonacciHeap × Int) : Frame :=
(Frame.fn_FibonacciHeap_add_root 19 ({ v0 := input.1, v1 := input.2 } : State_FibonacciHeap_add_root))
def FibonacciHeap.add_root.ValidInput (h : Heap) (input : Ref_FibonacciHeap × Int) : Prop := is_FibonacciHeap h input.1
def FibonacciHeap.add_root.initial (h : Heap) (input : Ref_FibonacciHeap × Int) : Configuration :=
Algo2LeanCore.start h (Frame.fn_FibonacciHeap_add_root 19 ({ v0 := input.1, v1 := input.2 } : State_FibonacciHeap_add_root))
def FibonacciHeap.add_root.Run (h : Heap) (input : Ref_FibonacciHeap × Int) (h' : Heap) (output : Unit) : Prop :=
_root_.Algo.«fibonacci_heap».FibonacciHeap.add_root.ValidInput h input ∧ Algo2LeanCore.Reaches Step (_root_.Algo.«fibonacci_heap».FibonacciHeap.add_root.initial h input) (.done h' (Result.fn_FibonacciHeap_add_root output))
def FibonacciHeap.add_root.ValidHeapTranscript (h : Heap) (input : Ref_FibonacciHeap × Int) (trace : Transcript) : Prop :=
_root_.Algo.«fibonacci_heap».FibonacciHeap.add_root.ValidInput h input ∧ ∃ final, Algo2LeanCore.Valid Step (_root_.Algo.«fibonacci_heap».FibonacciHeap.add_root.initial h input) trace final
def FibonacciHeap.add_root.Call (h : Heap) (input : Ref_FibonacciHeap × Int) (h' : Heap) (output : Unit) : Prop :=
_root_.Algo.«fibonacci_heap».FibonacciHeap.add_root.ValidInput h input ∧ Algo2LeanCore.Summary Step h (Frame.fn_FibonacciHeap_add_root 19 ({ v0 := input.1, v1 := input.2 } : State_FibonacciHeap_add_root)) h' (Result.fn_FibonacciHeap_add_root output)
-- Complete this function from the supplied local state, under any caller stack.
def FibonacciHeap.add_root.CallFrom (state : Configuration) (finalHeap : Heap) (output : Unit) : Prop :=
match state with
| .active heap (Frame.fn_FibonacciHeap_add_root pc locals) _ =>
Algo2LeanCore.Summary Step heap (Frame.fn_FibonacciHeap_add_root pc locals) finalHeap (Result.fn_FibonacciHeap_add_root output)
| _ => False
-- Object inputs carry their heap, preserving shared references and cycles.
def FibonacciHeap.add_root.load (input : Heap × (Ref_FibonacciHeap × Int)) : Heap × (Ref_FibonacciHeap × Int) := input
def FibonacciHeap.add_root.ValidTranscript (my_input : Heap × (Ref_FibonacciHeap × Int)) (trace : Transcript) : Prop :=
let loaded := _root_.Algo.«fibonacci_heap».FibonacciHeap.add_root.load my_input
_root_.Algo.«fibonacci_heap».FibonacciHeap.add_root.ValidHeapTranscript loaded.1 loaded.2 trace
def FibonacciHeap.add_root.Returns (my_input : Heap × (Ref_FibonacciHeap × Int)) (my_output : Unit) : Prop :=
let loaded := _root_.Algo.«fibonacci_heap».FibonacciHeap.add_root.load my_input
∃ finalHeap, _root_.Algo.«fibonacci_heap».FibonacciHeap.add_root.Run loaded.1 loaded.2 finalHeap my_output
-- Output and clock increments from one completed execution.
def FibonacciHeap.add_root.ReturnsWithCost (my_input : Heap × (Ref_FibonacciHeap × Int)) (my_output : Unit) (costs : Clocks) : Prop :=
let loaded := _root_.Algo.«fibonacci_heap».FibonacciHeap.add_root.load my_input
∃ finalHeap, _root_.Algo.«fibonacci_heap».FibonacciHeap.add_root.Run loaded.1 loaded.2 finalHeap my_output ∧ Heap.cost loaded.1 finalHeap = costs
theorem FibonacciHeap.add_root.ReturnsWithCost.returns {input output costs}
(run : _root_.Algo.«fibonacci_heap».FibonacciHeap.add_root.ReturnsWithCost input output costs) : _root_.Algo.«fibonacci_heap».FibonacciHeap.add_root.Returns input output := by
obtain ⟨heap, execution, _⟩ := run
exact ⟨heap, execution⟩
theorem FibonacciHeap.add_root.Returns.withCost {input output}
(run : _root_.Algo.«fibonacci_heap».FibonacciHeap.add_root.Returns input output) : ∃ costs, _root_.Algo.«fibonacci_heap».FibonacciHeap.add_root.ReturnsWithCost input output costs := by
obtain ⟨heap, execution⟩ := run
exact ⟨Heap.cost (_root_.Algo.«fibonacci_heap».FibonacciHeap.add_root.load input).1 heap, heap, execution, rfl⟩
theorem FibonacciHeap.add_root.Call.run {before input after output}
(call : _root_.Algo.«fibonacci_heap».FibonacciHeap.add_root.Call before input after output) :
_root_.Algo.«fibonacci_heap».FibonacciHeap.add_root.Run before input after output :=
⟨call.1, call.2.root⟩
def entry_FibonacciHeap_link (input : Ref_FibonacciHeap × Int × Int) : Frame :=
(Frame.fn_FibonacciHeap_link 17 ({ v0 := input.1, v1 := input.2.1, v2 := input.2.2 } : State_FibonacciHeap_link))
def FibonacciHeap.link.ValidInput (h : Heap) (input : Ref_FibonacciHeap × Int × Int) : Prop := is_FibonacciHeap h input.1
def FibonacciHeap.link.initial (h : Heap) (input : Ref_FibonacciHeap × Int × Int) : Configuration :=
Algo2LeanCore.start h (Frame.fn_FibonacciHeap_link 17 ({ v0 := input.1, v1 := input.2.1, v2 := input.2.2 } : State_FibonacciHeap_link))
def FibonacciHeap.link.Run (h : Heap) (input : Ref_FibonacciHeap × Int × Int) (h' : Heap) (output : Unit) : Prop :=
_root_.Algo.«fibonacci_heap».FibonacciHeap.link.ValidInput h input ∧ Algo2LeanCore.Reaches Step (_root_.Algo.«fibonacci_heap».FibonacciHeap.link.initial h input) (.done h' (Result.fn_FibonacciHeap_link output))
def FibonacciHeap.link.ValidHeapTranscript (h : Heap) (input : Ref_FibonacciHeap × Int × Int) (trace : Transcript) : Prop :=
_root_.Algo.«fibonacci_heap».FibonacciHeap.link.ValidInput h input ∧ ∃ final, Algo2LeanCore.Valid Step (_root_.Algo.«fibonacci_heap».FibonacciHeap.link.initial h input) trace final
def FibonacciHeap.link.Call (h : Heap) (input : Ref_FibonacciHeap × Int × Int) (h' : Heap) (output : Unit) : Prop :=
_root_.Algo.«fibonacci_heap».FibonacciHeap.link.ValidInput h input ∧ Algo2LeanCore.Summary Step h (Frame.fn_FibonacciHeap_link 17 ({ v0 := input.1, v1 := input.2.1, v2 := input.2.2 } : State_FibonacciHeap_link)) h' (Result.fn_FibonacciHeap_link output)
-- Complete this function from the supplied local state, under any caller stack.
def FibonacciHeap.link.CallFrom (state : Configuration) (finalHeap : Heap) (output : Unit) : Prop :=
match state with
| .active heap (Frame.fn_FibonacciHeap_link pc locals) _ =>
Algo2LeanCore.Summary Step heap (Frame.fn_FibonacciHeap_link pc locals) finalHeap (Result.fn_FibonacciHeap_link output)
| _ => False
-- Object inputs carry their heap, preserving shared references and cycles.
def FibonacciHeap.link.load (input : Heap × (Ref_FibonacciHeap × Int × Int)) : Heap × (Ref_FibonacciHeap × Int × Int) := input
def FibonacciHeap.link.ValidTranscript (my_input : Heap × (Ref_FibonacciHeap × Int × Int)) (trace : Transcript) : Prop :=
let loaded := _root_.Algo.«fibonacci_heap».FibonacciHeap.link.load my_input
_root_.Algo.«fibonacci_heap».FibonacciHeap.link.ValidHeapTranscript loaded.1 loaded.2 trace
def FibonacciHeap.link.Returns (my_input : Heap × (Ref_FibonacciHeap × Int × Int)) (my_output : Unit) : Prop :=
let loaded := _root_.Algo.«fibonacci_heap».FibonacciHeap.link.load my_input
∃ finalHeap, _root_.Algo.«fibonacci_heap».FibonacciHeap.link.Run loaded.1 loaded.2 finalHeap my_output
-- Output and clock increments from one completed execution.
def FibonacciHeap.link.ReturnsWithCost (my_input : Heap × (Ref_FibonacciHeap × Int × Int)) (my_output : Unit) (costs : Clocks) : Prop :=
let loaded := _root_.Algo.«fibonacci_heap».FibonacciHeap.link.load my_input
∃ finalHeap, _root_.Algo.«fibonacci_heap».FibonacciHeap.link.Run loaded.1 loaded.2 finalHeap my_output ∧ Heap.cost loaded.1 finalHeap = costs
theorem FibonacciHeap.link.ReturnsWithCost.returns {input output costs}
(run : _root_.Algo.«fibonacci_heap».FibonacciHeap.link.ReturnsWithCost input output costs) : _root_.Algo.«fibonacci_heap».FibonacciHeap.link.Returns input output := by
obtain ⟨heap, execution, _⟩ := run
exact ⟨heap, execution⟩
theorem FibonacciHeap.link.Returns.withCost {input output}
(run : _root_.Algo.«fibonacci_heap».FibonacciHeap.link.Returns input output) : ∃ costs, _root_.Algo.«fibonacci_heap».FibonacciHeap.link.ReturnsWithCost input output costs := by
obtain ⟨heap, execution⟩ := run
exact ⟨Heap.cost (_root_.Algo.«fibonacci_heap».FibonacciHeap.link.load input).1 heap, heap, execution, rfl⟩
theorem FibonacciHeap.link.Call.run {before input after output}
(call : _root_.Algo.«fibonacci_heap».FibonacciHeap.link.Call before input after output) :
_root_.Algo.«fibonacci_heap».FibonacciHeap.link.Run before input after output :=
⟨call.1, call.2.root⟩
def entry_FibonacciHeap_consolidate (input : Ref_FibonacciHeap) : Frame :=
(Frame.fn_FibonacciHeap_consolidate 50 ({ v0 := input } : State_FibonacciHeap_consolidate))
def FibonacciHeap.consolidate.ValidInput (h : Heap) (input : Ref_FibonacciHeap) : Prop := is_FibonacciHeap h input
def FibonacciHeap.consolidate.initial (h : Heap) (input : Ref_FibonacciHeap) : Configuration :=
Algo2LeanCore.start h (Frame.fn_FibonacciHeap_consolidate 50 ({ v0 := input } : State_FibonacciHeap_consolidate))
def FibonacciHeap.consolidate.Run (h : Heap) (input : Ref_FibonacciHeap) (h' : Heap) (output : Unit) : Prop :=
_root_.Algo.«fibonacci_heap».FibonacciHeap.consolidate.ValidInput h input ∧ Algo2LeanCore.Reaches Step (_root_.Algo.«fibonacci_heap».FibonacciHeap.consolidate.initial h input) (.done h' (Result.fn_FibonacciHeap_consolidate output))
def FibonacciHeap.consolidate.ValidHeapTranscript (h : Heap) (input : Ref_FibonacciHeap) (trace : Transcript) : Prop :=
_root_.Algo.«fibonacci_heap».FibonacciHeap.consolidate.ValidInput h input ∧ ∃ final, Algo2LeanCore.Valid Step (_root_.Algo.«fibonacci_heap».FibonacciHeap.consolidate.initial h input) trace final
def FibonacciHeap.consolidate.Call (h : Heap) (input : Ref_FibonacciHeap) (h' : Heap) (output : Unit) : Prop :=
_root_.Algo.«fibonacci_heap».FibonacciHeap.consolidate.ValidInput h input ∧ Algo2LeanCore.Summary Step h (Frame.fn_FibonacciHeap_consolidate 50 ({ v0 := input } : State_FibonacciHeap_consolidate)) h' (Result.fn_FibonacciHeap_consolidate output)
-- Complete this function from the supplied local state, under any caller stack.
def FibonacciHeap.consolidate.CallFrom (state : Configuration) (finalHeap : Heap) (output : Unit) : Prop :=
match state with
| .active heap (Frame.fn_FibonacciHeap_consolidate pc locals) _ =>
Algo2LeanCore.Summary Step heap (Frame.fn_FibonacciHeap_consolidate pc locals) finalHeap (Result.fn_FibonacciHeap_consolidate output)
| _ => False
-- Object inputs carry their heap, preserving shared references and cycles.
def FibonacciHeap.consolidate.load (input : Heap × (Ref_FibonacciHeap)) : Heap × (Ref_FibonacciHeap) := input
def FibonacciHeap.consolidate.ValidTranscript (my_input : Heap × (Ref_FibonacciHeap)) (trace : Transcript) : Prop :=
let loaded := _root_.Algo.«fibonacci_heap».FibonacciHeap.consolidate.load my_input
_root_.Algo.«fibonacci_heap».FibonacciHeap.consolidate.ValidHeapTranscript loaded.1 loaded.2 trace
def FibonacciHeap.consolidate.Returns (my_input : Heap × (Ref_FibonacciHeap)) (my_output : Unit) : Prop :=
let loaded := _root_.Algo.«fibonacci_heap».FibonacciHeap.consolidate.load my_input
∃ finalHeap, _root_.Algo.«fibonacci_heap».FibonacciHeap.consolidate.Run loaded.1 loaded.2 finalHeap my_output
-- Output and clock increments from one completed execution.
def FibonacciHeap.consolidate.ReturnsWithCost (my_input : Heap × (Ref_FibonacciHeap)) (my_output : Unit) (costs : Clocks) : Prop :=
let loaded := _root_.Algo.«fibonacci_heap».FibonacciHeap.consolidate.load my_input
∃ finalHeap, _root_.Algo.«fibonacci_heap».FibonacciHeap.consolidate.Run loaded.1 loaded.2 finalHeap my_output ∧ Heap.cost loaded.1 finalHeap = costs
theorem FibonacciHeap.consolidate.ReturnsWithCost.returns {input output costs}
(run : _root_.Algo.«fibonacci_heap».FibonacciHeap.consolidate.ReturnsWithCost input output costs) : _root_.Algo.«fibonacci_heap».FibonacciHeap.consolidate.Returns input output := by
obtain ⟨heap, execution, _⟩ := run
exact ⟨heap, execution⟩
theorem FibonacciHeap.consolidate.Returns.withCost {input output}
(run : _root_.Algo.«fibonacci_heap».FibonacciHeap.consolidate.Returns input output) : ∃ costs, _root_.Algo.«fibonacci_heap».FibonacciHeap.consolidate.ReturnsWithCost input output costs := by
obtain ⟨heap, execution⟩ := run
exact ⟨Heap.cost (_root_.Algo.«fibonacci_heap».FibonacciHeap.consolidate.load input).1 heap, heap, execution, rfl⟩
theorem FibonacciHeap.consolidate.Call.run {before input after output}
(call : _root_.Algo.«fibonacci_heap».FibonacciHeap.consolidate.Call before input after output) :
_root_.Algo.«fibonacci_heap».FibonacciHeap.consolidate.Run before input after output :=
⟨call.1, call.2.root⟩
def entry_FibonacciHeap_cut (input : Ref_FibonacciHeap × Int × Int) : Frame :=
(Frame.fn_FibonacciHeap_cut 18 ({ v0 := input.1, v1 := input.2.1, v2 := input.2.2 } : State_FibonacciHeap_cut))
def FibonacciHeap.cut.ValidInput (h : Heap) (input : Ref_FibonacciHeap × Int × Int) : Prop := is_FibonacciHeap h input.1
def FibonacciHeap.cut.initial (h : Heap) (input : Ref_FibonacciHeap × Int × Int) : Configuration :=
Algo2LeanCore.start h (Frame.fn_FibonacciHeap_cut 18 ({ v0 := input.1, v1 := input.2.1, v2 := input.2.2 } : State_FibonacciHeap_cut))
def FibonacciHeap.cut.Run (h : Heap) (input : Ref_FibonacciHeap × Int × Int) (h' : Heap) (output : Unit) : Prop :=
_root_.Algo.«fibonacci_heap».FibonacciHeap.cut.ValidInput h input ∧ Algo2LeanCore.Reaches Step (_root_.Algo.«fibonacci_heap».FibonacciHeap.cut.initial h input) (.done h' (Result.fn_FibonacciHeap_cut output))
def FibonacciHeap.cut.ValidHeapTranscript (h : Heap) (input : Ref_FibonacciHeap × Int × Int) (trace : Transcript) : Prop :=
_root_.Algo.«fibonacci_heap».FibonacciHeap.cut.ValidInput h input ∧ ∃ final, Algo2LeanCore.Valid Step (_root_.Algo.«fibonacci_heap».FibonacciHeap.cut.initial h input) trace final
def FibonacciHeap.cut.Call (h : Heap) (input : Ref_FibonacciHeap × Int × Int) (h' : Heap) (output : Unit) : Prop :=
_root_.Algo.«fibonacci_heap».FibonacciHeap.cut.ValidInput h input ∧ Algo2LeanCore.Summary Step h (Frame.fn_FibonacciHeap_cut 18 ({ v0 := input.1, v1 := input.2.1, v2 := input.2.2 } : State_FibonacciHeap_cut)) h' (Result.fn_FibonacciHeap_cut output)
-- Complete this function from the supplied local state, under any caller stack.
def FibonacciHeap.cut.CallFrom (state : Configuration) (finalHeap : Heap) (output : Unit) : Prop :=
match state with
| .active heap (Frame.fn_FibonacciHeap_cut pc locals) _ =>
Algo2LeanCore.Summary Step heap (Frame.fn_FibonacciHeap_cut pc locals) finalHeap (Result.fn_FibonacciHeap_cut output)
| _ => False
-- Object inputs carry their heap, preserving shared references and cycles.
def FibonacciHeap.cut.load (input : Heap × (Ref_FibonacciHeap × Int × Int)) : Heap × (Ref_FibonacciHeap × Int × Int) := input
def FibonacciHeap.cut.ValidTranscript (my_input : Heap × (Ref_FibonacciHeap × Int × Int)) (trace : Transcript) : Prop :=
let loaded := _root_.Algo.«fibonacci_heap».FibonacciHeap.cut.load my_input
_root_.Algo.«fibonacci_heap».FibonacciHeap.cut.ValidHeapTranscript loaded.1 loaded.2 trace
def FibonacciHeap.cut.Returns (my_input : Heap × (Ref_FibonacciHeap × Int × Int)) (my_output : Unit) : Prop :=
let loaded := _root_.Algo.«fibonacci_heap».FibonacciHeap.cut.load my_input
∃ finalHeap, _root_.Algo.«fibonacci_heap».FibonacciHeap.cut.Run loaded.1 loaded.2 finalHeap my_output
-- Output and clock increments from one completed execution.
def FibonacciHeap.cut.ReturnsWithCost (my_input : Heap × (Ref_FibonacciHeap × Int × Int)) (my_output : Unit) (costs : Clocks) : Prop :=
let loaded := _root_.Algo.«fibonacci_heap».FibonacciHeap.cut.load my_input
∃ finalHeap, _root_.Algo.«fibonacci_heap».FibonacciHeap.cut.Run loaded.1 loaded.2 finalHeap my_output ∧ Heap.cost loaded.1 finalHeap = costs
theorem FibonacciHeap.cut.ReturnsWithCost.returns {input output costs}
(run : _root_.Algo.«fibonacci_heap».FibonacciHeap.cut.ReturnsWithCost input output costs) : _root_.Algo.«fibonacci_heap».FibonacciHeap.cut.Returns input output := by
obtain ⟨heap, execution, _⟩ := run
exact ⟨heap, execution⟩
theorem FibonacciHeap.cut.Returns.withCost {input output}
(run : _root_.Algo.«fibonacci_heap».FibonacciHeap.cut.Returns input output) : ∃ costs, _root_.Algo.«fibonacci_heap».FibonacciHeap.cut.ReturnsWithCost input output costs := by
obtain ⟨heap, execution⟩ := run
exact ⟨Heap.cost (_root_.Algo.«fibonacci_heap».FibonacciHeap.cut.load input).1 heap, heap, execution, rfl⟩
theorem FibonacciHeap.cut.Call.run {before input after output}
(call : _root_.Algo.«fibonacci_heap».FibonacciHeap.cut.Call before input after output) :
_root_.Algo.«fibonacci_heap».FibonacciHeap.cut.Run before input after output :=
⟨call.1, call.2.root⟩
def entry_FibonacciHeap_cascading_cut (input : Ref_FibonacciHeap × Int) : Frame :=
(Frame.fn_FibonacciHeap_cascading_cut 17 ({ v0 := input.1, v1 := input.2 } : State_FibonacciHeap_cascading_cut))
def FibonacciHeap.cascading_cut.ValidInput (h : Heap) (input : Ref_FibonacciHeap × Int) : Prop := is_FibonacciHeap h input.1
def FibonacciHeap.cascading_cut.initial (h : Heap) (input : Ref_FibonacciHeap × Int) : Configuration :=
Algo2LeanCore.start h (Frame.fn_FibonacciHeap_cascading_cut 17 ({ v0 := input.1, v1 := input.2 } : State_FibonacciHeap_cascading_cut))
def FibonacciHeap.cascading_cut.Run (h : Heap) (input : Ref_FibonacciHeap × Int) (h' : Heap) (output : Unit) : Prop :=
_root_.Algo.«fibonacci_heap».FibonacciHeap.cascading_cut.ValidInput h input ∧ Algo2LeanCore.Reaches Step (_root_.Algo.«fibonacci_heap».FibonacciHeap.cascading_cut.initial h input) (.done h' (Result.fn_FibonacciHeap_cascading_cut output))
def FibonacciHeap.cascading_cut.ValidHeapTranscript (h : Heap) (input : Ref_FibonacciHeap × Int) (trace : Transcript) : Prop :=
_root_.Algo.«fibonacci_heap».FibonacciHeap.cascading_cut.ValidInput h input ∧ ∃ final, Algo2LeanCore.Valid Step (_root_.Algo.«fibonacci_heap».FibonacciHeap.cascading_cut.initial h input) trace final
def FibonacciHeap.cascading_cut.Call (h : Heap) (input : Ref_FibonacciHeap × Int) (h' : Heap) (output : Unit) : Prop :=
_root_.Algo.«fibonacci_heap».FibonacciHeap.cascading_cut.ValidInput h input ∧ Algo2LeanCore.Summary Step h (Frame.fn_FibonacciHeap_cascading_cut 17 ({ v0 := input.1, v1 := input.2 } : State_FibonacciHeap_cascading_cut)) h' (Result.fn_FibonacciHeap_cascading_cut output)
-- Complete this function from the supplied local state, under any caller stack.
def FibonacciHeap.cascading_cut.CallFrom (state : Configuration) (finalHeap : Heap) (output : Unit) : Prop :=
match state with
| .active heap (Frame.fn_FibonacciHeap_cascading_cut pc locals) _ =>
Algo2LeanCore.Summary Step heap (Frame.fn_FibonacciHeap_cascading_cut pc locals) finalHeap (Result.fn_FibonacciHeap_cascading_cut output)
| _ => False
-- Object inputs carry their heap, preserving shared references and cycles.
def FibonacciHeap.cascading_cut.load (input : Heap × (Ref_FibonacciHeap × Int)) : Heap × (Ref_FibonacciHeap × Int) := input
def FibonacciHeap.cascading_cut.ValidTranscript (my_input : Heap × (Ref_FibonacciHeap × Int)) (trace : Transcript) : Prop :=
let loaded := _root_.Algo.«fibonacci_heap».FibonacciHeap.cascading_cut.load my_input
_root_.Algo.«fibonacci_heap».FibonacciHeap.cascading_cut.ValidHeapTranscript loaded.1 loaded.2 trace
def FibonacciHeap.cascading_cut.Returns (my_input : Heap × (Ref_FibonacciHeap × Int)) (my_output : Unit) : Prop :=
let loaded := _root_.Algo.«fibonacci_heap».FibonacciHeap.cascading_cut.load my_input
∃ finalHeap, _root_.Algo.«fibonacci_heap».FibonacciHeap.cascading_cut.Run loaded.1 loaded.2 finalHeap my_output
-- Output and clock increments from one completed execution.
def FibonacciHeap.cascading_cut.ReturnsWithCost (my_input : Heap × (Ref_FibonacciHeap × Int)) (my_output : Unit) (costs : Clocks) : Prop :=
let loaded := _root_.Algo.«fibonacci_heap».FibonacciHeap.cascading_cut.load my_input
∃ finalHeap, _root_.Algo.«fibonacci_heap».FibonacciHeap.cascading_cut.Run loaded.1 loaded.2 finalHeap my_output ∧ Heap.cost loaded.1 finalHeap = costs
theorem FibonacciHeap.cascading_cut.ReturnsWithCost.returns {input output costs}
(run : _root_.Algo.«fibonacci_heap».FibonacciHeap.cascading_cut.ReturnsWithCost input output costs) : _root_.Algo.«fibonacci_heap».FibonacciHeap.cascading_cut.Returns input output := by
obtain ⟨heap, execution, _⟩ := run
exact ⟨heap, execution⟩
theorem FibonacciHeap.cascading_cut.Returns.withCost {input output}
(run : _root_.Algo.«fibonacci_heap».FibonacciHeap.cascading_cut.Returns input output) : ∃ costs, _root_.Algo.«fibonacci_heap».FibonacciHeap.cascading_cut.ReturnsWithCost input output costs := by
obtain ⟨heap, execution⟩ := run
exact ⟨Heap.cost (_root_.Algo.«fibonacci_heap».FibonacciHeap.cascading_cut.load input).1 heap, heap, execution, rfl⟩
theorem FibonacciHeap.cascading_cut.Call.run {before input after output}
(call : _root_.Algo.«fibonacci_heap».FibonacciHeap.cascading_cut.Call before input after output) :
_root_.Algo.«fibonacci_heap».FibonacciHeap.cascading_cut.Run before input after output :=
⟨call.1, call.2.root⟩
def entry_FibonacciHeap_push_or_decrease (input : Ref_FibonacciHeap × Int × Int) : Frame :=
(Frame.fn_FibonacciHeap_push_or_decrease 44 ({ v0 := input.1, v1 := input.2.1, v2 := input.2.2 } : State_FibonacciHeap_push_or_decrease))
def FibonacciHeap.push_or_decrease.ValidInput (h : Heap) (input : Ref_FibonacciHeap × Int × Int) : Prop := is_FibonacciHeap h input.1
def FibonacciHeap.push_or_decrease.initial (h : Heap) (input : Ref_FibonacciHeap × Int × Int) : Configuration :=
Algo2LeanCore.start h (Frame.fn_FibonacciHeap_push_or_decrease 44 ({ v0 := input.1, v1 := input.2.1, v2 := input.2.2 } : State_FibonacciHeap_push_or_decrease))
def FibonacciHeap.push_or_decrease.Run (h : Heap) (input : Ref_FibonacciHeap × Int × Int) (h' : Heap) (output : Unit) : Prop :=
_root_.Algo.«fibonacci_heap».FibonacciHeap.push_or_decrease.ValidInput h input ∧ Algo2LeanCore.Reaches Step (_root_.Algo.«fibonacci_heap».FibonacciHeap.push_or_decrease.initial h input) (.done h' (Result.fn_FibonacciHeap_push_or_decrease output))
def FibonacciHeap.push_or_decrease.ValidHeapTranscript (h : Heap) (input : Ref_FibonacciHeap × Int × Int) (trace : Transcript) : Prop :=
_root_.Algo.«fibonacci_heap».FibonacciHeap.push_or_decrease.ValidInput h input ∧ ∃ final, Algo2LeanCore.Valid Step (_root_.Algo.«fibonacci_heap».FibonacciHeap.push_or_decrease.initial h input) trace final
def FibonacciHeap.push_or_decrease.Call (h : Heap) (input : Ref_FibonacciHeap × Int × Int) (h' : Heap) (output : Unit) : Prop :=
_root_.Algo.«fibonacci_heap».FibonacciHeap.push_or_decrease.ValidInput h input ∧ Algo2LeanCore.Summary Step h (Frame.fn_FibonacciHeap_push_or_decrease 44 ({ v0 := input.1, v1 := input.2.1, v2 := input.2.2 } : State_FibonacciHeap_push_or_decrease)) h' (Result.fn_FibonacciHeap_push_or_decrease output)
-- Complete this function from the supplied local state, under any caller stack.
def FibonacciHeap.push_or_decrease.CallFrom (state : Configuration) (finalHeap : Heap) (output : Unit) : Prop :=
match state with
| .active heap (Frame.fn_FibonacciHeap_push_or_decrease pc locals) _ =>
Algo2LeanCore.Summary Step heap (Frame.fn_FibonacciHeap_push_or_decrease pc locals) finalHeap (Result.fn_FibonacciHeap_push_or_decrease output)
| _ => False
-- Object inputs carry their heap, preserving shared references and cycles.
def FibonacciHeap.push_or_decrease.load (input : Heap × (Ref_FibonacciHeap × Int × Int)) : Heap × (Ref_FibonacciHeap × Int × Int) := input
def FibonacciHeap.push_or_decrease.ValidTranscript (my_input : Heap × (Ref_FibonacciHeap × Int × Int)) (trace : Transcript) : Prop :=
let loaded := _root_.Algo.«fibonacci_heap».FibonacciHeap.push_or_decrease.load my_input
_root_.Algo.«fibonacci_heap».FibonacciHeap.push_or_decrease.ValidHeapTranscript loaded.1 loaded.2 trace
def FibonacciHeap.push_or_decrease.Returns (my_input : Heap × (Ref_FibonacciHeap × Int × Int)) (my_output : Unit) : Prop :=
let loaded := _root_.Algo.«fibonacci_heap».FibonacciHeap.push_or_decrease.load my_input
∃ finalHeap, _root_.Algo.«fibonacci_heap».FibonacciHeap.push_or_decrease.Run loaded.1 loaded.2 finalHeap my_output
-- Output and clock increments from one completed execution.
def FibonacciHeap.push_or_decrease.ReturnsWithCost (my_input : Heap × (Ref_FibonacciHeap × Int × Int)) (my_output : Unit) (costs : Clocks) : Prop :=
let loaded := _root_.Algo.«fibonacci_heap».FibonacciHeap.push_or_decrease.load my_input
∃ finalHeap, _root_.Algo.«fibonacci_heap».FibonacciHeap.push_or_decrease.Run loaded.1 loaded.2 finalHeap my_output ∧ Heap.cost loaded.1 finalHeap = costs
theorem FibonacciHeap.push_or_decrease.ReturnsWithCost.returns {input output costs}
(run : _root_.Algo.«fibonacci_heap».FibonacciHeap.push_or_decrease.ReturnsWithCost input output costs) : _root_.Algo.«fibonacci_heap».FibonacciHeap.push_or_decrease.Returns input output := by
obtain ⟨heap, execution, _⟩ := run
exact ⟨heap, execution⟩
theorem FibonacciHeap.push_or_decrease.Returns.withCost {input output}
(run : _root_.Algo.«fibonacci_heap».FibonacciHeap.push_or_decrease.Returns input output) : ∃ costs, _root_.Algo.«fibonacci_heap».FibonacciHeap.push_or_decrease.ReturnsWithCost input output costs := by
obtain ⟨heap, execution⟩ := run
exact ⟨Heap.cost (_root_.Algo.«fibonacci_heap».FibonacciHeap.push_or_decrease.load input).1 heap, heap, execution, rfl⟩
theorem FibonacciHeap.push_or_decrease.Call.run {before input after output}
(call : _root_.Algo.«fibonacci_heap».FibonacciHeap.push_or_decrease.Call before input after output) :
_root_.Algo.«fibonacci_heap».FibonacciHeap.push_or_decrease.Run before input after output :=
⟨call.1, call.2.root⟩
def entry_FibonacciHeap_pop_min (input : Ref_FibonacciHeap) : Frame :=
(Frame.fn_FibonacciHeap_pop_min 42 ({ v0 := input } : State_FibonacciHeap_pop_min))
def FibonacciHeap.pop_min.ValidInput (h : Heap) (input : Ref_FibonacciHeap) : Prop := is_FibonacciHeap h input
def FibonacciHeap.pop_min.initial (h : Heap) (input : Ref_FibonacciHeap) : Configuration :=
Algo2LeanCore.start h (Frame.fn_FibonacciHeap_pop_min 42 ({ v0 := input } : State_FibonacciHeap_pop_min))
def FibonacciHeap.pop_min.Run (h : Heap) (input : Ref_FibonacciHeap) (h' : Heap) (output : Int) : Prop :=
_root_.Algo.«fibonacci_heap».FibonacciHeap.pop_min.ValidInput h input ∧ Algo2LeanCore.Reaches Step (_root_.Algo.«fibonacci_heap».FibonacciHeap.pop_min.initial h input) (.done h' (Result.fn_FibonacciHeap_pop_min output))
def FibonacciHeap.pop_min.ValidHeapTranscript (h : Heap) (input : Ref_FibonacciHeap) (trace : Transcript) : Prop :=
_root_.Algo.«fibonacci_heap».FibonacciHeap.pop_min.ValidInput h input ∧ ∃ final, Algo2LeanCore.Valid Step (_root_.Algo.«fibonacci_heap».FibonacciHeap.pop_min.initial h input) trace final
def FibonacciHeap.pop_min.Call (h : Heap) (input : Ref_FibonacciHeap) (h' : Heap) (output : Int) : Prop :=
_root_.Algo.«fibonacci_heap».FibonacciHeap.pop_min.ValidInput h input ∧ Algo2LeanCore.Summary Step h (Frame.fn_FibonacciHeap_pop_min 42 ({ v0 := input } : State_FibonacciHeap_pop_min)) h' (Result.fn_FibonacciHeap_pop_min output)
-- Complete this function from the supplied local state, under any caller stack.
def FibonacciHeap.pop_min.CallFrom (state : Configuration) (finalHeap : Heap) (output : Int) : Prop :=
match state with
| .active heap (Frame.fn_FibonacciHeap_pop_min pc locals) _ =>
Algo2LeanCore.Summary Step heap (Frame.fn_FibonacciHeap_pop_min pc locals) finalHeap (Result.fn_FibonacciHeap_pop_min output)
| _ => False
-- Object inputs carry their heap, preserving shared references and cycles.
def FibonacciHeap.pop_min.load (input : Heap × (Ref_FibonacciHeap)) : Heap × (Ref_FibonacciHeap) := input
def FibonacciHeap.pop_min.ValidTranscript (my_input : Heap × (Ref_FibonacciHeap)) (trace : Transcript) : Prop :=
let loaded := _root_.Algo.«fibonacci_heap».FibonacciHeap.pop_min.load my_input
_root_.Algo.«fibonacci_heap».FibonacciHeap.pop_min.ValidHeapTranscript loaded.1 loaded.2 trace
def FibonacciHeap.pop_min.Returns (my_input : Heap × (Ref_FibonacciHeap)) (my_output : Int) : Prop :=
let loaded := _root_.Algo.«fibonacci_heap».FibonacciHeap.pop_min.load my_input
∃ finalHeap, _root_.Algo.«fibonacci_heap».FibonacciHeap.pop_min.Run loaded.1 loaded.2 finalHeap my_output
-- Output and clock increments from one completed execution.
def FibonacciHeap.pop_min.ReturnsWithCost (my_input : Heap × (Ref_FibonacciHeap)) (my_output : Int) (costs : Clocks) : Prop :=
let loaded := _root_.Algo.«fibonacci_heap».FibonacciHeap.pop_min.load my_input
∃ finalHeap, _root_.Algo.«fibonacci_heap».FibonacciHeap.pop_min.Run loaded.1 loaded.2 finalHeap my_output ∧ Heap.cost loaded.1 finalHeap = costs
theorem FibonacciHeap.pop_min.ReturnsWithCost.returns {input output costs}
(run : _root_.Algo.«fibonacci_heap».FibonacciHeap.pop_min.ReturnsWithCost input output costs) : _root_.Algo.«fibonacci_heap».FibonacciHeap.pop_min.Returns input output := by
obtain ⟨heap, execution, _⟩ := run
exact ⟨heap, execution⟩
theorem FibonacciHeap.pop_min.Returns.withCost {input output}
(run : _root_.Algo.«fibonacci_heap».FibonacciHeap.pop_min.Returns input output) : ∃ costs, _root_.Algo.«fibonacci_heap».FibonacciHeap.pop_min.ReturnsWithCost input output costs := by
obtain ⟨heap, execution⟩ := run
exact ⟨Heap.cost (_root_.Algo.«fibonacci_heap».FibonacciHeap.pop_min.load input).1 heap, heap, execution, rfl⟩
theorem FibonacciHeap.pop_min.Call.run {before input after output}
(call : _root_.Algo.«fibonacci_heap».FibonacciHeap.pop_min.Call before input after output) :
_root_.Algo.«fibonacci_heap».FibonacciHeap.pop_min.Run before input after output :=
⟨call.1, call.2.root⟩
def entry_FibonacciHeap_is_empty (input : Ref_FibonacciHeap) : Frame :=
(Frame.fn_FibonacciHeap_is_empty 2 ({ v0 := input } : State_FibonacciHeap_is_empty))
def FibonacciHeap.is_empty.ValidInput (h : Heap) (input : Ref_FibonacciHeap) : Prop := is_FibonacciHeap h input
def FibonacciHeap.is_empty.initial (h : Heap) (input : Ref_FibonacciHeap) : Configuration :=
Algo2LeanCore.start h (Frame.fn_FibonacciHeap_is_empty 2 ({ v0 := input } : State_FibonacciHeap_is_empty))
def FibonacciHeap.is_empty.Run (h : Heap) (input : Ref_FibonacciHeap) (h' : Heap) (output : Bool) : Prop :=
_root_.Algo.«fibonacci_heap».FibonacciHeap.is_empty.ValidInput h input ∧ Algo2LeanCore.Reaches Step (_root_.Algo.«fibonacci_heap».FibonacciHeap.is_empty.initial h input) (.done h' (Result.fn_FibonacciHeap_is_empty output))
def FibonacciHeap.is_empty.ValidHeapTranscript (h : Heap) (input : Ref_FibonacciHeap) (trace : Transcript) : Prop :=
_root_.Algo.«fibonacci_heap».FibonacciHeap.is_empty.ValidInput h input ∧ ∃ final, Algo2LeanCore.Valid Step (_root_.Algo.«fibonacci_heap».FibonacciHeap.is_empty.initial h input) trace final
def FibonacciHeap.is_empty.Call (h : Heap) (input : Ref_FibonacciHeap) (h' : Heap) (output : Bool) : Prop :=
_root_.Algo.«fibonacci_heap».FibonacciHeap.is_empty.ValidInput h input ∧ Algo2LeanCore.Summary Step h (Frame.fn_FibonacciHeap_is_empty 2 ({ v0 := input } : State_FibonacciHeap_is_empty)) h' (Result.fn_FibonacciHeap_is_empty output)
-- Complete this function from the supplied local state, under any caller stack.
def FibonacciHeap.is_empty.CallFrom (state : Configuration) (finalHeap : Heap) (output : Bool) : Prop :=
match state with
| .active heap (Frame.fn_FibonacciHeap_is_empty pc locals) _ =>
Algo2LeanCore.Summary Step heap (Frame.fn_FibonacciHeap_is_empty pc locals) finalHeap (Result.fn_FibonacciHeap_is_empty output)
| _ => False
-- Object inputs carry their heap, preserving shared references and cycles.
def FibonacciHeap.is_empty.load (input : Heap × (Ref_FibonacciHeap)) : Heap × (Ref_FibonacciHeap) := input
def FibonacciHeap.is_empty.ValidTranscript (my_input : Heap × (Ref_FibonacciHeap)) (trace : Transcript) : Prop :=
let loaded := _root_.Algo.«fibonacci_heap».FibonacciHeap.is_empty.load my_input
_root_.Algo.«fibonacci_heap».FibonacciHeap.is_empty.ValidHeapTranscript loaded.1 loaded.2 trace
def FibonacciHeap.is_empty.Returns (my_input : Heap × (Ref_FibonacciHeap)) (my_output : Bool) : Prop :=
let loaded := _root_.Algo.«fibonacci_heap».FibonacciHeap.is_empty.load my_input
∃ finalHeap, _root_.Algo.«fibonacci_heap».FibonacciHeap.is_empty.Run loaded.1 loaded.2 finalHeap my_output
-- Output and clock increments from one completed execution.
def FibonacciHeap.is_empty.ReturnsWithCost (my_input : Heap × (Ref_FibonacciHeap)) (my_output : Bool) (costs : Clocks) : Prop :=
let loaded := _root_.Algo.«fibonacci_heap».FibonacciHeap.is_empty.load my_input
∃ finalHeap, _root_.Algo.«fibonacci_heap».FibonacciHeap.is_empty.Run loaded.1 loaded.2 finalHeap my_output ∧ Heap.cost loaded.1 finalHeap = costs
theorem FibonacciHeap.is_empty.ReturnsWithCost.returns {input output costs}
(run : _root_.Algo.«fibonacci_heap».FibonacciHeap.is_empty.ReturnsWithCost input output costs) : _root_.Algo.«fibonacci_heap».FibonacciHeap.is_empty.Returns input output := by
obtain ⟨heap, execution, _⟩ := run
exact ⟨heap, execution⟩
theorem FibonacciHeap.is_empty.Returns.withCost {input output}
(run : _root_.Algo.«fibonacci_heap».FibonacciHeap.is_empty.Returns input output) : ∃ costs, _root_.Algo.«fibonacci_heap».FibonacciHeap.is_empty.ReturnsWithCost input output costs := by
obtain ⟨heap, execution⟩ := run
exact ⟨Heap.cost (_root_.Algo.«fibonacci_heap».FibonacciHeap.is_empty.load input).1 heap, heap, execution, rfl⟩
theorem FibonacciHeap.is_empty.Call.run {before input after output}
(call : _root_.Algo.«fibonacci_heap».FibonacciHeap.is_empty.Call before input after output) :
_root_.Algo.«fibonacci_heap».FibonacciHeap.is_empty.Run before input after output :=
⟨call.1, call.2.root⟩
def entry_FibonacciHeap (_input : Unit) : Frame :=
(Frame.fn_FibonacciHeap 6 ({ } : State_FibonacciHeap))
def FibonacciHeap.ValidInput (_h : Heap) (_input : Unit) : Prop := True
def FibonacciHeap.initial (h : Heap) (_input : Unit) : Configuration :=
Algo2LeanCore.start h (Frame.fn_FibonacciHeap 6 ({ } : State_FibonacciHeap))
def FibonacciHeap.Run (h : Heap) (input : Unit) (h' : Heap) (output : Ref_FibonacciHeap) : Prop :=
_root_.Algo.«fibonacci_heap».FibonacciHeap.ValidInput h input ∧ Algo2LeanCore.Reaches Step (_root_.Algo.«fibonacci_heap».FibonacciHeap.initial h input) (.done h' (Result.fn_FibonacciHeap output))
def FibonacciHeap.ValidHeapTranscript (h : Heap) (input : Unit) (trace : Transcript) : Prop :=
_root_.Algo.«fibonacci_heap».FibonacciHeap.ValidInput h input ∧ ∃ final, Algo2LeanCore.Valid Step (_root_.Algo.«fibonacci_heap».FibonacciHeap.initial h input) trace final
def FibonacciHeap.Call (h : Heap) (input : Unit) (h' : Heap) (output : Ref_FibonacciHeap) : Prop :=
_root_.Algo.«fibonacci_heap».FibonacciHeap.ValidInput h input ∧ Algo2LeanCore.Summary Step h (Frame.fn_FibonacciHeap 6 ({ } : State_FibonacciHeap)) h' (Result.fn_FibonacciHeap output)
-- Complete this function from the supplied local state, under any caller stack.
def FibonacciHeap.CallFrom (state : Configuration) (finalHeap : Heap) (output : Ref_FibonacciHeap) : Prop :=
match state with
| .active heap (Frame.fn_FibonacciHeap pc locals) _ =>
Algo2LeanCore.Summary Step heap (Frame.fn_FibonacciHeap pc locals) finalHeap (Result.fn_FibonacciHeap output)
| _ => False
-- The value view gives each sequence input its own object.
def FibonacciHeap.load (_input : Unit) : Heap × (Unit) :=
let h0 : Heap := {}
(h0, ())
def FibonacciHeap.ValidTranscript (my_input : Unit) (trace : Transcript) : Prop :=
let loaded := _root_.Algo.«fibonacci_heap».FibonacciHeap.load my_input
_root_.Algo.«fibonacci_heap».FibonacciHeap.ValidHeapTranscript loaded.1 loaded.2 trace
def FibonacciHeap.Returns (my_input : Unit) (my_output : Heap × (Ref_FibonacciHeap)) : Prop :=
let loaded := _root_.Algo.«fibonacci_heap».FibonacciHeap.load my_input
_root_.Algo.«fibonacci_heap».FibonacciHeap.Run loaded.1 loaded.2 my_output.1 my_output.2
-- Output and clock increments from one completed execution.
def FibonacciHeap.ReturnsWithCost (my_input : Unit) (my_output : Heap × (Ref_FibonacciHeap)) (costs : Clocks) : Prop :=
let loaded := _root_.Algo.«fibonacci_heap».FibonacciHeap.load my_input
_root_.Algo.«fibonacci_heap».FibonacciHeap.Run loaded.1 loaded.2 my_output.1 my_output.2 ∧ Heap.cost loaded.1 my_output.1 = costs
theorem FibonacciHeap.ReturnsWithCost.returns {input output costs}
(run : _root_.Algo.«fibonacci_heap».FibonacciHeap.ReturnsWithCost input output costs) : _root_.Algo.«fibonacci_heap».FibonacciHeap.Returns input output := by
obtain ⟨execution, _⟩ := run
exact execution
theorem FibonacciHeap.Returns.withCost {input output}
(run : _root_.Algo.«fibonacci_heap».FibonacciHeap.Returns input output) : ∃ costs, _root_.Algo.«fibonacci_heap».FibonacciHeap.ReturnsWithCost input output costs := by
exact ⟨Heap.cost (_root_.Algo.«fibonacci_heap».FibonacciHeap.load input).1 output.1, run, rfl⟩
theorem FibonacciHeap.Call.run {before input after output}
(call : _root_.Algo.«fibonacci_heap».FibonacciHeap.Call before input after output) :
_root_.Algo.«fibonacci_heap».FibonacciHeap.Run before input after output :=
⟨call.1, call.2.root⟩
end Algo.«fibonacci_heap»