Package evaluation of SpatialAccessTrees on Julia 1.10.8 (92f03a4775*) started at 2025-02-25T10:15:19.441


################################################################################
# Set-up
#

Installing PkgEval dependencies (TestEnv)...

Set-up completed after 5.19s


################################################################################
# Installation
#

Installing SpatialAccessTrees...
   Resolving package versions...
    Updating `~/.julia/environments/v1.10/Project.toml`
  [c0867ef0] + SpatialAccessTrees v0.3.3
    Updating `~/.julia/environments/v1.10/Manifest.toml`
⌅ [79e6a3ab] + Adapt v3.7.2
⌅ [4fba245c] + ArrayInterface v6.0.25
  [30b0a656] + ArrayInterfaceCore v0.1.29
  [015c0d05] + ArrayInterfaceOffsetArrays v0.1.7
  [b0d46f97] + ArrayInterfaceStaticArrays v0.1.5
  [dd5226c6] + ArrayInterfaceStaticArraysCore v0.1.4
  [62783981] + BitTwiddlingConvenienceFunctions v0.1.6
⌅ [2a0fbf3d] + CPUSummary v0.1.30
⌃ [fb6a15b2] + CloseOpenIntervals v0.1.11
  [34da2185] + Compat v4.16.0
  [adafc99b] + CpuId v0.3.1
  [9a962f9c] + DataAPI v1.16.0
  [864edb3b] + DataStructures v0.18.20
  [b4f34e82] + Distances v0.10.12
  [ffbed154] + DocStringExtensions v0.9.3
  [5789e2e9] + FileIO v1.16.6
  [3e5b6fbb] + HostCPUFeatures v0.1.17
  [615f187c] + IfElse v0.1.1
  [92d709cd] + IrrationalConstants v0.2.4
⌅ [033835bb] + JLD2 v0.4.54
⌃ [10f19ff3] + LayoutPointers v0.1.13
  [2ab3a3ac] + LogExpFunctions v0.3.29
⌃ [bdcacae8] + LoopVectorization v0.12.150
  [1914dd2f] + MacroTools v0.5.15
  [d125e4d3] + ManualMemory v0.1.8
  [e1d29d7a] + Missings v1.2.0
  [6fe1bfb0] + OffsetArrays v1.15.0
  [bac558e1] + OrderedCollections v1.8.0
  [d96e819e] + Parameters v0.12.3
⌅ [f517fe37] + Polyester v0.6.20
⌅ [1d0040c9] + PolyesterWeave v0.1.13
  [aea7be01] + PrecompileTools v1.2.1
  [21216c6a] + Preferences v1.4.3
  [ae029012] + Requires v1.3.0
  [94e857df] + SIMDTypes v0.1.0
  [476501e8] + SLEEFPirates v0.6.43
⌅ [0e966ebe] + SearchModels v0.3.3
⌅ [053f045d] + SimilaritySearch v0.10.12
  [66db9d55] + SnoopPrecompile v1.0.3
  [a2af1166] + SortingAlgorithms v1.2.1
  [c0867ef0] + SpatialAccessTrees v0.3.3
⌅ [aedffcd0] + Static v0.8.10
  [90137ffa] + StaticArrays v1.9.12
  [1e83bf80] + StaticArraysCore v1.4.3
  [82ae8749] + StatsAPI v1.7.0
⌅ [2913bbd2] + StatsBase v0.33.21
⌅ [7792a7ef] + StrideArraysCore v0.4.7
  [8290d209] + ThreadingUtilities v0.5.2
  [3bb67fe8] + TranscodingStreams v0.11.3
  [3a884ed6] + UnPack v1.0.2
⌃ [3d5dd08c] + VectorizationBase v0.21.58
  [0dad84c5] + ArgTools v1.1.1
  [56f22d72] + Artifacts
  [2a0f44e3] + Base64
  [ade2ca70] + Dates
  [8ba89e20] + Distributed
  [f43a241f] + Downloads v1.6.0
  [7b1f6079] + FileWatching
  [b77e0a4c] + InteractiveUtils
  [b27032c2] + LibCURL v0.6.4
  [76f85450] + LibGit2
  [8f399da3] + Libdl
  [37e2e46d] + LinearAlgebra
  [56ddb016] + Logging
  [d6f4376e] + Markdown
  [a63ad114] + Mmap
  [ca575930] + NetworkOptions v1.2.0
  [44cfe95a] + Pkg v1.10.0
  [de0858da] + Printf
  [3fa0cd96] + REPL
  [9a3f8284] + Random
  [ea8e919c] + SHA v0.7.0
  [9e88b42a] + Serialization
  [6462fe0b] + Sockets
  [2f01184e] + SparseArrays v1.10.0
  [10745b16] + Statistics v1.10.0
  [4607b0f0] + SuiteSparse
  [fa267f1f] + TOML v1.0.3
  [a4e569a6] + Tar v1.10.0
  [cf7118a7] + UUIDs
  [4ec0a83e] + Unicode
  [e66e0078] + CompilerSupportLibraries_jll v1.1.1+0
  [deac9b47] + LibCURL_jll v8.4.0+0
  [e37daf67] + LibGit2_jll v1.6.4+0
  [29816b5a] + LibSSH2_jll v1.11.0+1
  [c8ffd9c3] + MbedTLS_jll v2.28.2+1
  [14a3606d] + MozillaCACerts_jll v2023.1.10
  [4536629a] + OpenBLAS_jll v0.3.23+4
  [bea87d4a] + SuiteSparse_jll v7.2.1+1
  [83775a58] + Zlib_jll v1.2.13+1
  [8e850b90] + libblastrampoline_jll v5.11.0+0
  [8e850ede] + nghttp2_jll v1.52.0+1
  [3f19e933] + p7zip_jll v17.4.0+2
        Info Packages marked with ⌃ and ⌅ have new versions available. Those with ⌃ may be upgradable, but those with ⌅ are restricted by compatibility constraints from upgrading. To see why use `status --outdated -m`

Installation completed after 5.75s


################################################################################
# Precompilation
#

Precompiling PkgEval dependencies...

Precompiling package dependencies...

Precompilation completed after 138.4s


################################################################################
# Testing
#

     Testing SpatialAccessTrees
      Status `/tmp/jl_uSAn6j/Project.toml`
  [d96e819e] Parameters v0.12.3
⌅ [f517fe37] Polyester v0.6.20
⌅ [0e966ebe] SearchModels v0.3.3
⌅ [053f045d] SimilaritySearch v0.10.12
  [c0867ef0] SpatialAccessTrees v0.3.3
  [9a3f8284] Random
  [8dfed614] Test
      Status `/tmp/jl_uSAn6j/Manifest.toml`
⌅ [79e6a3ab] Adapt v3.7.2
⌅ [4fba245c] ArrayInterface v6.0.25
  [30b0a656] ArrayInterfaceCore v0.1.29
  [015c0d05] ArrayInterfaceOffsetArrays v0.1.7
  [b0d46f97] ArrayInterfaceStaticArrays v0.1.5
  [dd5226c6] ArrayInterfaceStaticArraysCore v0.1.4
  [62783981] BitTwiddlingConvenienceFunctions v0.1.6
⌅ [2a0fbf3d] CPUSummary v0.1.30
⌃ [fb6a15b2] CloseOpenIntervals v0.1.11
  [34da2185] Compat v4.16.0
  [adafc99b] CpuId v0.3.1
  [9a962f9c] DataAPI v1.16.0
  [864edb3b] DataStructures v0.18.20
  [b4f34e82] Distances v0.10.12
  [ffbed154] DocStringExtensions v0.9.3
  [5789e2e9] FileIO v1.16.6
  [3e5b6fbb] HostCPUFeatures v0.1.17
  [615f187c] IfElse v0.1.1
  [92d709cd] IrrationalConstants v0.2.4
⌅ [033835bb] JLD2 v0.4.54
⌃ [10f19ff3] LayoutPointers v0.1.13
  [2ab3a3ac] LogExpFunctions v0.3.29
⌃ [bdcacae8] LoopVectorization v0.12.150
  [1914dd2f] MacroTools v0.5.15
  [d125e4d3] ManualMemory v0.1.8
  [e1d29d7a] Missings v1.2.0
  [6fe1bfb0] OffsetArrays v1.15.0
  [bac558e1] OrderedCollections v1.8.0
  [d96e819e] Parameters v0.12.3
⌅ [f517fe37] Polyester v0.6.20
⌅ [1d0040c9] PolyesterWeave v0.1.13
  [aea7be01] PrecompileTools v1.2.1
  [21216c6a] Preferences v1.4.3
  [ae029012] Requires v1.3.0
  [94e857df] SIMDTypes v0.1.0
  [476501e8] SLEEFPirates v0.6.43
⌅ [0e966ebe] SearchModels v0.3.3
⌅ [053f045d] SimilaritySearch v0.10.12
  [66db9d55] SnoopPrecompile v1.0.3
  [a2af1166] SortingAlgorithms v1.2.1
  [c0867ef0] SpatialAccessTrees v0.3.3
⌅ [aedffcd0] Static v0.8.10
  [90137ffa] StaticArrays v1.9.12
  [1e83bf80] StaticArraysCore v1.4.3
  [82ae8749] StatsAPI v1.7.0
⌅ [2913bbd2] StatsBase v0.33.21
⌅ [7792a7ef] StrideArraysCore v0.4.7
  [8290d209] ThreadingUtilities v0.5.2
  [3bb67fe8] TranscodingStreams v0.11.3
  [3a884ed6] UnPack v1.0.2
⌃ [3d5dd08c] VectorizationBase v0.21.58
  [0dad84c5] ArgTools v1.1.1
  [56f22d72] Artifacts
  [2a0f44e3] Base64
  [ade2ca70] Dates
  [8ba89e20] Distributed
  [f43a241f] Downloads v1.6.0
  [7b1f6079] FileWatching
  [b77e0a4c] InteractiveUtils
  [b27032c2] LibCURL v0.6.4
  [76f85450] LibGit2
  [8f399da3] Libdl
  [37e2e46d] LinearAlgebra
  [56ddb016] Logging
  [d6f4376e] Markdown
  [a63ad114] Mmap
  [ca575930] NetworkOptions v1.2.0
  [44cfe95a] Pkg v1.10.0
  [de0858da] Printf
  [3fa0cd96] REPL
  [9a3f8284] Random
  [ea8e919c] SHA v0.7.0
  [9e88b42a] Serialization
  [6462fe0b] Sockets
  [2f01184e] SparseArrays v1.10.0
  [10745b16] Statistics v1.10.0
  [4607b0f0] SuiteSparse
  [fa267f1f] TOML v1.0.3
  [a4e569a6] Tar v1.10.0
  [8dfed614] Test
  [cf7118a7] UUIDs
  [4ec0a83e] Unicode
  [e66e0078] CompilerSupportLibraries_jll v1.1.1+0
  [deac9b47] LibCURL_jll v8.4.0+0
  [e37daf67] LibGit2_jll v1.6.4+0
  [29816b5a] LibSSH2_jll v1.11.0+1
  [c8ffd9c3] MbedTLS_jll v2.28.2+1
  [14a3606d] MozillaCACerts_jll v2023.1.10
  [4536629a] OpenBLAS_jll v0.3.23+4
  [bea87d4a] SuiteSparse_jll v7.2.1+1
  [83775a58] Zlib_jll v1.2.13+1
  [8e850b90] libblastrampoline_jll v5.11.0+0
  [8e850ede] nghttp2_jll v1.52.0+1
  [3f19e933] p7zip_jll v17.4.0+2
        Info Packages marked with ⌃ and ⌅ have new versions available. Those with ⌃ may be upgradable, but those with ⌅ are restricted by compatibility constraints from upgrading.
     Testing Running tests...
WARNING: Method definition boundscheck() in module StrideArraysCore at /home/pkgeval/.julia/packages/StrideArraysCore/lUhTe/src/ptr_array.jl:886 overwritten at /home/pkgeval/.julia/packages/StrideArraysCore/lUhTe/src/StrideArraysCore.jl:72.
[ Info: ============================= SatInitialPartition() -- ProximalSortSat() -- minleaf=4 ================
[ Info: Sat
sum((c !== nothing for c = sat.children)) = 2246
[ Info: SearchGraph
  6.097906 seconds (2.50 M allocations: 165.207 MiB, 6.70% gc time, 84.97% compilation time)
[ Info: ------------ brute force: 0.02303286 -- sort sat: ProximalSortSat -- brute-force searchtime: 0.02303286, buildtime: 1.534072736
┌ Info:  exact sat:
│   recall = 1.0
│   searchtime = 0.016945721
└   bruteforcesearchtime / searchtime = 1.3592139278110384
┌ Info:  permuted exact sat:
│   precall = 1.0
│   psearchtime = 0.015260098
└   bruteforcesearchtime / psearchtime = 1.5093520369266304
┌ Info:  sat with probabilistic spell:
│   arecall = 0.9329999999999998
│   asearchtime = 0.010028051
│   bruteforcesearchtime / asearchtime = 2.296843125349083
└   first(alist) = SpatialAccessTrees.PruningSatFactor(0.2620316f0) => (visited = (1002.0, 1829.1, 2635.0), radius = (0.10851771384477615, 0.12929896712303163, 0.16461490094661713), recall = 0.9099999999999999, searchtime = 0.00010430700000000002)
┌ Info:  perm sat with probabilistic spell:
│   parecall = 0.9329999999999998
│   pasearchtime = 0.00903375
│   bruteforcesearchtime / pasearchtime = 2.549645496056455
└   first(palist) = SpatialAccessTrees.PruningSatFactor(0.2620316f0) => (visited = (1002.0, 1829.1, 2635.0), radius = (0.10851771384477615, 0.12929896712303163, 0.16461490094661713), recall = 0.9099999999999999, searchtime = 8.89751e-5)
┌ Info:  sat with beam search:
│   brecall = 0.7870000000000001
│   bsearchtime = 0.003185909
│   bruteforcesearchtime / bsearchtime = 7.229603858741728
│   first(blist) =
│    BeamSearch
│      bsize: Int32 122
│      Δ: Float32 3.0f0
│      maxvisits: Int64 1000000
└     => (visited = (121.0, 433.8, 1209.0), radius = (0.10854209214448929, 0.13862940594553946, 0.17589925229549408), recall = 0.76, searchtime = 2.75957e-5)
┌ Info:  search graph:
│   grecall = 0.9470000000000003
│   gsearchtime = 0.001131189
│   bruteforcesearchtime / gsearchtime = 20.361637179993796
│   first(glist) =
│    BeamSearch
│      bsize: Int32 2
│      Δ: Float32 0.963f0
│      maxvisits: Int64 1000000
└     => (visited = (117.0, 142.4, 171.0), radius = (0.10851771384477615, 0.12800471782684325, 0.15423834323883057), recall = 0.9, searchtime = 9.3519e-6)
[ Info: ============================= SatInitialPartition() -- DistalSortSat() -- minleaf=4 ================
[ Info: Sat
sum((c !== nothing for c = sat.children)) = 2346
[ Info: SearchGraph
  0.576778 seconds (371.63 k allocations: 24.943 MiB)
[ Info: ------------ brute force: 0.02303286 -- sort sat: DistalSortSat -- brute-force searchtime: 0.02303286, buildtime: 0.778661498
┌ Info:  exact sat:
│   recall = 1.0
│   searchtime = 0.008524825
└   bruteforcesearchtime / searchtime = 2.701857222875543
┌ Info:  permuted exact sat:
│   precall = 1.0
│   psearchtime = 0.007762653
└   bruteforcesearchtime / psearchtime = 2.9671376525525486
┌ Info:  sat with probabilistic spell:
│   arecall = 0.9050000000000002
│   asearchtime = 0.004083769
│   bruteforcesearchtime / asearchtime = 5.640098644169148
└   first(alist) = SpatialAccessTrees.PruningSatFactor(0.3814476f0) => (visited = (371.0, 592.7, 1005.0), radius = (0.10851771384477615, 0.12902068346738815, 0.16184668242931366), recall = 0.9, searchtime = 3.73286e-5)
┌ Info:  perm sat with probabilistic spell:
│   parecall = 0.9050000000000002
│   pasearchtime = 0.003753313
│   bruteforcesearchtime / pasearchtime = 6.136674452676875
└   first(palist) = SpatialAccessTrees.PruningSatFactor(0.3814476f0) => (visited = (371.0, 592.7, 1005.0), radius = (0.10851771384477615, 0.12902068346738815, 0.16184668242931366), recall = 0.9, searchtime = 3.47687e-5)
┌ Info:  sat with beam search:
│   brecall = 0.6249999999999997
│   bsearchtime = 0.002552365
│   bruteforcesearchtime / bsearchtime = 9.024124684361366
│   first(blist) =
│    BeamSearch
│      bsize: Int32 18
│      Δ: Float32 2.1599998f0
│      maxvisits: Int64 1000000
└     => (visited = (219.0, 342.1, 695.0), radius = (0.10851771384477615, 0.1284828156232834, 0.17579084634780884), recall = 0.9, searchtime = 2.73987e-5)
┌ Info:  search graph:
│   grecall = 0.9640000000000001
│   gsearchtime = 0.00104156
│   bruteforcesearchtime / gsearchtime = 22.113810054149546
│   first(glist) =
│    BeamSearch
│      bsize: Int32 3
│      Δ: Float32 0.867f0
│      maxvisits: Int64 1000000
└     => (visited = (122.0, 140.0, 174.0), radius = (0.10851771384477615, 0.12737310230731963, 0.15885987877845764), recall = 0.9, searchtime = 9.2909e-6)
[ Info: ============================= RandomInitialPartition(64, false) -- RandomSortSat() -- minleaf=4 ================
[ Info: Sat
sum((c !== nothing for c = sat.children)) = 2353
[ Info: SearchGraph
  0.581955 seconds (382.55 k allocations: 25.475 MiB)
[ Info: ------------ brute force: 0.02303286 -- sort sat: RandomSortSat -- brute-force searchtime: 0.02303286, buildtime: 1.26968779
┌ Info:  exact sat:
│   recall = 1.0
│   searchtime = 0.022572065
└   bruteforcesearchtime / searchtime = 1.020414392746078
┌ Info:  permuted exact sat:
│   precall = 1.0
│   psearchtime = 0.023242908
└   bruteforcesearchtime / psearchtime = 0.9909629208186859
┌ Info:  sat with probabilistic spell:
│   arecall = 0.8950000000000002
│   asearchtime = 0.018381897
│   bruteforcesearchtime / asearchtime = 1.2530186628724989
└   first(alist) = SpatialAccessTrees.PruningSatFactor(0.11640181f0) => (visited = (2815.0, 3574.8, 4840.0), radius = (0.10851771384477615, 0.12582445442676543, 0.15091389417648315), recall = 0.9700000000000001, searchtime = 0.0001849792)
┌ Info:  perm sat with probabilistic spell:
│   parecall = 0.8900000000000001
│   pasearchtime = 0.017623564
│   bruteforcesearchtime / pasearchtime = 1.306935418965199
└   first(palist) = SpatialAccessTrees.PruningSatFactor(0.10166984f0) => (visited = (2793.0, 3548.8, 4813.0), radius = (0.10851771384477615, 0.12582445442676543, 0.15091389417648315), recall = 0.9700000000000001, searchtime = 0.00017708629999999999)
┌ Info:  sat with beam search:
│   brecall = 0.5760000000000002
│   bsearchtime = 0.016999991
│   bruteforcesearchtime / bsearchtime = 1.354874834933736
│   first(blist) =
│    BeamSearch
│      bsize: Int32 203
│      Δ: Float32 3.0f0
│      maxvisits: Int64 1000000
└     => (visited = (1570.0, 1978.6, 2628.0), radius = (0.12423194944858551, 0.14553252309560777, 0.17532506585121155), recall = 0.5800000000000001, searchtime = 0.00017308029999999998)
┌ Info:  search graph:
│   grecall = 0.9010000000000004
│   gsearchtime = 0.000903541
│   bruteforcesearchtime / gsearchtime = 25.491770711013665
│   first(glist) =
│    BeamSearch
│      bsize: Int32 2
│      Δ: Float32 0.76294845f0
│      maxvisits: Int64 1000000
└     => (visited = (117.0, 132.7, 148.0), radius = (0.10851771384477615, 0.12810490056872367, 0.1545017957687378), recall = 0.9099999999999999, searchtime = 8.4619e-6)
[ Info: ============================= RandomInitialPartition(64, true) -- RandomSortSat() -- minleaf=4 ================
[ Info: Sat
sum((c !== nothing for c = sat.children)) = 2358
[ Info: SearchGraph
  0.584501 seconds (378.90 k allocations: 24.653 MiB, 2.59% gc time)
[ Info: ------------ brute force: 0.02303286 -- sort sat: RandomSortSat -- brute-force searchtime: 0.02303286, buildtime: 0.008859942
┌ Info:  exact sat:
│   recall = 1.0
│   searchtime = 0.025874033
└   bruteforcesearchtime / searchtime = 0.8901921088219992
┌ Info:  permuted exact sat:
│   precall = 1.0
│   psearchtime = 0.023475557
└   bruteforcesearchtime / psearchtime = 0.9811422152837522
┌ Info:  sat with probabilistic spell:
│   arecall = 0.9069999999999997
│   asearchtime = 0.022320038
│   bruteforcesearchtime / asearchtime = 1.0319364151620172
└   first(alist) = SpatialAccessTrees.PruningSatFactor(0.16318011f0) => (visited = (2883.0, 3702.0, 5093.0), radius = (0.10854209214448929, 0.1280097745358944, 0.15423834323883057), recall = 0.9400000000000001, searchtime = 0.0002172518)
┌ Info:  perm sat with probabilistic spell:
│   parecall = 0.8740000000000001
│   pasearchtime = 0.018340317
│   bruteforcesearchtime / pasearchtime = 1.2558594270753336
└   first(palist) = SpatialAccessTrees.PruningSatFactor(0.1f0) => (visited = (2812.0, 3607.7, 5028.0), radius = (0.10854209214448929, 0.12864048257470131, 0.15423834323883057), recall = 0.9100000000000001, searchtime = 0.0001824291)
┌ Info:  sat with beam search:
│   brecall = 0.5340000000000001
│   bsearchtime = 0.01703153
│   bruteforcesearchtime / bsearchtime = 1.3523658767004492
│   first(blist) =
│    BeamSearch
│      bsize: Int32 126
│      Δ: Float32 2.9903998f0
│      maxvisits: Int64 1000000
└     => (visited = (1554.0, 1935.1, 2540.0), radius = (0.12133993208408356, 0.1451302647590637, 0.16455982625484467), recall = 0.57, searchtime = 0.0001643853)
┌ Info:  search graph:
│   grecall = 0.9450000000000003
│   gsearchtime = 0.00097709
│   bruteforcesearchtime / gsearchtime = 23.57291549396678
│   first(glist) =
│    BeamSearch
│      bsize: Int32 2
│      Δ: Float32 0.87098f0
│      maxvisits: Int64 1000000
└     => (visited = (110.0, 137.0, 169.0), radius = (0.10854209214448929, 0.12891991883516313, 0.1545017957687378), recall = 0.9100000000000001, searchtime = 8.6739e-6)
[ Info: ============================= SatInitialPartition() -- RandomSortSat() -- minleaf=4 ================
[ Info: Sat
sum((c !== nothing for c = sat.children)) = 2365
[ Info: SearchGraph
  0.607834 seconds (389.59 k allocations: 26.465 MiB, 1.93% gc time)
[ Info: ------------ brute force: 0.02303286 -- sort sat: RandomSortSat -- brute-force searchtime: 0.02303286, buildtime: 0.03210837
┌ Info:  exact sat:
│   recall = 1.0
│   searchtime = 0.009532255
└   bruteforcesearchtime / searchtime = 2.416307578846768
┌ Info:  permuted exact sat:
│   precall = 1.0
│   psearchtime = 0.008533755
└   bruteforcesearchtime / psearchtime = 2.6990299112172775
┌ Info:  sat with probabilistic spell:
│   arecall = 0.9079999999999998
│   asearchtime = 0.004848681
│   bruteforcesearchtime / asearchtime = 4.7503351942517975
└   first(alist) = SpatialAccessTrees.PruningSatFactor(0.32651913f0) => (visited = (478.0, 706.7, 1029.0), radius = (0.10851771384477615, 0.1284685753285885, 0.15423834323883057), recall = 0.9, searchtime = 4.54436e-5)
┌ Info:  perm sat with probabilistic spell:
│   parecall = 0.9079999999999998
│   pasearchtime = 0.004274258
│   bruteforcesearchtime / pasearchtime = 5.3887388173573045
└   first(palist) = SpatialAccessTrees.PruningSatFactor(0.32651913f0) => (visited = (478.0, 706.7, 1029.0), radius = (0.10851771384477615, 0.1284685753285885, 0.15423834323883057), recall = 0.9, searchtime = 4.00916e-5)
┌ Info:  sat with beam search:
│   brecall = 0.9009999999999999
│   bsearchtime = 0.003238188
│   bruteforcesearchtime / bsearchtime = 7.112885354401906
│   first(blist) =
│    BeamSearch
│      bsize: Int32 30
│      Δ: Float32 2.287875f0
│      maxvisits: Int64 1000000
└     => (visited = (390.0, 469.7, 512.0), radius = (0.10851771384477615, 0.1298907957971096, 0.18698854744434357), recall = 0.9, searchtime = 2.9447700000000003e-5)
┌ Info:  search graph:
│   grecall = 0.9630000000000001
│   gsearchtime = 0.001601284
│   bruteforcesearchtime / gsearchtime = 14.383994344538507
│   first(glist) =
│    BeamSearch
│      bsize: Int32 48
│      Δ: Float32 0.74766356f0
│      maxvisits: Int64 1000000
└     => (visited = (158.0, 190.3, 221.0), radius = (0.10851771384477615, 0.1262296788394451, 0.1545017957687378), recall = 0.9400000000000001, searchtime = 1.07429e-5)
Test Summary:      | Pass  Total   Time
SpatialAccessTrees |   45     45  36.7s
================= PrunParSat ================
SpatialAccessTrees.PrunParSatConfig(8, 0.30515808f0) => (visited = (764.0, 1431.1875, 2805.0), radius = (0.3412967324256897, 0.38826138712465763, 0.4489295780658722), recall = 0.9, searchtime = 0.0001146663125)
bruteforcesearchtime = 3.051222157
bruteforcesearchtime / searchtime = 2.7545998162887018
searchtime = 1.107682553
buildtime = 0.025597275
macrorecall(Igold, I) = 0.8775733333333712
================= BeamSearchParSat ================
SpatialAccessTrees.BeamSearchParSatConfig(15, BeamSearch
  bsize: Int32 38
  Δ: Float32 1.872f0
  maxvisits: Int64 1000000
) => (visited = (411.0, 701.75, 930.0), radius = (0.3430739641189575, 0.3854223545640707, 0.45316895842552185), recall = 0.9062500000000002, searchtime = 5.724375e-5)
bruteforcesearchtime = 3.051222157
bruteforcesearchtime / searchtime = 4.337022969511085
searchtime = 0.703529167
buildtime = 0.024876283
macrorecall(Igold, I) = 0.8668200000000325
Test Summary:      | Time
SpatialAccessTrees | None  11.6s
     Testing SpatialAccessTrees tests passed 

Testing completed after 65.13s

PkgEval succeeded after 244.19s