If you think that there is an error in how your package is being tested or represented, please file an issue at NewPkgEval.jl , making sure to read the FAQ first.
Results with Julia v1.2.0
Testing was successful .
Last evaluation was ago and took 11 minutes, 32 seconds.
Click here to download the log file.
Click here to show the log contents.
Resolving package versions...
Installed Missings ──────────────────── v0.4.3
Installed DataAPI ───────────────────── v1.1.0
Installed Inflate ───────────────────── v0.1.1
Installed TableTraits ───────────────── v1.0.0
Installed MbedTLS ───────────────────── v0.7.0
Installed FileIO ────────────────────── v1.1.0
Installed IncrementalInference ──────── v0.8.2
Installed DataFrames ────────────────── v0.19.4
Installed LineSearches ──────────────── v7.0.1
Installed PDMats ────────────────────── v0.9.10
Installed CommonSubexpressions ──────── v0.2.0
Installed BinaryProvider ────────────── v0.5.8
Installed StatsBase ─────────────────── v0.32.0
Installed JLD2 ──────────────────────── v0.1.9
Installed Colors ────────────────────── v0.9.6
Installed Measures ──────────────────── v0.3.0
Installed StatsFuns ─────────────────── v0.9.0
Installed URIParser ─────────────────── v0.4.0
Installed Neo4j ─────────────────────── v2.0.0
Installed NLSolversBase ─────────────── v7.5.0
Installed DocStringExtensions ───────── v0.8.1
Installed KernelDensityEstimate ─────── v0.5.2
Installed DataValueInterfaces ───────── v1.0.0
Installed Compose ───────────────────── v0.7.3
Installed Requires ──────────────────── v0.5.2
Installed PooledArrays ──────────────── v0.5.2
Installed InvertedIndices ───────────── v1.0.0
Installed Reexport ──────────────────── v0.2.0
Installed Compat ────────────────────── v2.2.0
Installed ForwardDiff ───────────────── v0.10.7
Installed DistributedFactorGraphs ───── v0.5.1
Installed TransformUtils ────────────── v0.2.2
Installed OrderedCollections ────────── v1.1.0
Installed Rmath ─────────────────────── v0.5.1
Installed Tables ────────────────────── v0.2.11
Installed CoordinateTransformations ─── v0.5.0
Installed IterTools ─────────────────── v1.3.0
Installed JSON2 ─────────────────────── v0.3.1
Installed IniFile ───────────────────── v0.5.0
Installed DataStructures ────────────── v0.17.6
Installed FixedPointNumbers ─────────── v0.6.1
Installed Calculus ──────────────────── v0.5.1
Installed Distributions ─────────────── v0.21.9
Installed FillArrays ────────────────── v0.8.2
Installed DiffEqDiffTools ───────────── v1.5.0
Installed DiffRules ─────────────────── v0.1.0
Installed LightGraphs ───────────────── v1.3.0
Installed Parsers ───────────────────── v0.3.10
Installed TranscodingStreams ────────── v0.9.5
Installed Graphs ────────────────────── v0.10.3
Installed JSON ──────────────────────── v0.21.0
Installed CodecZlib ─────────────────── v0.6.0
Installed ArrayInterface ────────────── v2.0.0
Installed FunctionalStateMachine ────── v0.1.3
Installed NaNMath ───────────────────── v0.3.3
Installed DiffResults ───────────────── v0.0.4
Installed HTTP ──────────────────────── v0.8.8
Installed StaticArrays ──────────────── v0.12.1
Installed Parameters ────────────────── v0.12.0
Installed IteratorInterfaceExtensions ─ v1.0.0
Installed SimpleTraits ──────────────── v0.9.1
Installed CategoricalArrays ─────────── v0.7.3
Installed QuadGK ────────────────────── v2.1.1
Installed ApproxManifoldProducts ────── v0.1.2
Installed NLsolve ───────────────────── v4.2.0
Installed GraphPlot ─────────────────── v0.3.1
Installed Distances ─────────────────── v0.8.2
Installed SortingAlgorithms ─────────── v0.3.1
Installed MacroTools ────────────────── v0.5.2
Installed ColorTypes ────────────────── v0.8.0
Installed SpecialFunctions ──────────── v0.8.0
Installed PositiveFactorizations ────── v0.2.3
Installed ArnoldiMethod ─────────────── v0.0.4
Installed BinDeps ───────────────────── v0.8.10
Installed ProgressMeter ─────────────── v1.2.0
Installed Optim ─────────────────────── v0.19.5
Installed Rotations ─────────────────── v0.12.0
Installed Arpack ────────────────────── v0.3.1
Updating `~/.julia/environments/v1.2/Project.toml`
[904591bb] + IncrementalInference v0.8.2
Updating `~/.julia/environments/v1.2/Manifest.toml`
[9bbbb610] + ApproxManifoldProducts v0.1.2
[ec485272] + ArnoldiMethod v0.0.4
[7d9fca2a] + Arpack v0.3.1
[4fba245c] + ArrayInterface v2.0.0
[9e28174c] + BinDeps v0.8.10
[b99e7846] + BinaryProvider v0.5.8
[49dc2e85] + Calculus v0.5.1
[324d7699] + CategoricalArrays v0.7.3
[944b1d66] + CodecZlib v0.6.0
[3da002f7] + ColorTypes v0.8.0
[5ae59095] + Colors v0.9.6
[bbf7d656] + CommonSubexpressions v0.2.0
[34da2185] + Compat v2.2.0
[a81c6b42] + Compose v0.7.3
[150eb455] + CoordinateTransformations v0.5.0
[9a962f9c] + DataAPI v1.1.0
[a93c6f00] + DataFrames v0.19.4
[864edb3b] + DataStructures v0.17.6
[e2d170a0] + DataValueInterfaces v1.0.0
[01453d9d] + DiffEqDiffTools v1.5.0
[163ba53b] + DiffResults v0.0.4
[b552c78f] + DiffRules v0.1.0
[b4f34e82] + Distances v0.8.2
[b5cc3c7e] + DistributedFactorGraphs v0.5.1
[31c24e10] + Distributions v0.21.9
[ffbed154] + DocStringExtensions v0.8.1
[5789e2e9] + FileIO v1.1.0
[1a297f60] + FillArrays v0.8.2
[53c48c17] + FixedPointNumbers v0.6.1
[f6369f11] + ForwardDiff v0.10.7
[3e9e306e] + FunctionalStateMachine v0.1.3
[a2cc645c] + GraphPlot v0.3.1
[86223c79] + Graphs v0.10.3
[cd3eb016] + HTTP v0.8.8
[904591bb] + IncrementalInference v0.8.2
[d25df0c9] + Inflate v0.1.1
[83e8ac13] + IniFile v0.5.0
[41ab1584] + InvertedIndices v1.0.0
[c8e1da08] + IterTools v1.3.0
[82899510] + IteratorInterfaceExtensions v1.0.0
[033835bb] + JLD2 v0.1.9
[682c06a0] + JSON v0.21.0
[2535ab7d] + JSON2 v0.3.1
[2472808a] + KernelDensityEstimate v0.5.2
[093fc24a] + LightGraphs v1.3.0
[d3d80556] + LineSearches v7.0.1
[1914dd2f] + MacroTools v0.5.2
[739be429] + MbedTLS v0.7.0
[442fdcdd] + Measures v0.3.0
[e1d29d7a] + Missings v0.4.3
[d41bc354] + NLSolversBase v7.5.0
[2774e3e8] + NLsolve v4.2.0
[77ba4419] + NaNMath v0.3.3
[d2adbeaf] + Neo4j v2.0.0
[429524aa] + Optim v0.19.5
[bac558e1] + OrderedCollections v1.1.0
[90014a1f] + PDMats v0.9.10
[d96e819e] + Parameters v0.12.0
[69de0a69] + Parsers v0.3.10
[2dfb63ee] + PooledArrays v0.5.2
[85a6dd25] + PositiveFactorizations v0.2.3
[92933f4c] + ProgressMeter v1.2.0
[1fd47b50] + QuadGK v2.1.1
[189a3867] + Reexport v0.2.0
[ae029012] + Requires v0.5.2
[79098fc4] + Rmath v0.5.1
[6038ab10] + Rotations v0.12.0
[699a6c99] + SimpleTraits v0.9.1
[a2af1166] + SortingAlgorithms v0.3.1
[276daf66] + SpecialFunctions v0.8.0
[90137ffa] + StaticArrays v0.12.1
[2913bbd2] + StatsBase v0.32.0
[4c63d2b9] + StatsFuns v0.9.0
[3783bdb8] + TableTraits v1.0.0
[bd369af6] + Tables v0.2.11
[3bb67fe8] + TranscodingStreams v0.9.5
[9b8138ad] + TransformUtils v0.2.2
[30578b45] + URIParser v0.4.0
[2a0f44e3] + Base64
[ade2ca70] + Dates
[8bb1440f] + DelimitedFiles
[8ba89e20] + Distributed
[9fa8497b] + Future
[b77e0a4c] + InteractiveUtils
[76f85450] + LibGit2
[8f399da3] + Libdl
[37e2e46d] + LinearAlgebra
[56ddb016] + Logging
[d6f4376e] + Markdown
[a63ad114] + Mmap
[44cfe95a] + Pkg
[de0858da] + Printf
[9abbd945] + Profile
[3fa0cd96] + REPL
[9a3f8284] + Random
[ea8e919c] + SHA
[9e88b42a] + Serialization
[1a1011a3] + SharedArrays
[6462fe0b] + Sockets
[2f01184e] + SparseArrays
[10745b16] + Statistics
[4607b0f0] + SuiteSparse
[8dfed614] + Test
[cf7118a7] + UUIDs
[4ec0a83e] + Unicode
Building MbedTLS ─────────→ `~/.julia/packages/MbedTLS/a1JFn/deps/build.log`
Building Rmath ───────────→ `~/.julia/packages/Rmath/4wt82/deps/build.log`
Building CodecZlib ───────→ `~/.julia/packages/CodecZlib/5t9zO/deps/build.log`
Building SpecialFunctions → `~/.julia/packages/SpecialFunctions/ne2iw/deps/build.log`
Building Arpack ──────────→ `~/.julia/packages/Arpack/cu5By/deps/build.log`
Testing IncrementalInference
Resolving package versions...
Status `/tmp/jl_QUNdSW/Manifest.toml`
[9bbbb610] ApproxManifoldProducts v0.1.2
[ec485272] ArnoldiMethod v0.0.4
[7d9fca2a] Arpack v0.3.1
[4fba245c] ArrayInterface v2.0.0
[9e28174c] BinDeps v0.8.10
[b99e7846] BinaryProvider v0.5.8
[49dc2e85] Calculus v0.5.1
[324d7699] CategoricalArrays v0.7.3
[944b1d66] CodecZlib v0.6.0
[3da002f7] ColorTypes v0.8.0
[5ae59095] Colors v0.9.6
[bbf7d656] CommonSubexpressions v0.2.0
[34da2185] Compat v2.2.0
[a81c6b42] Compose v0.7.3
[150eb455] CoordinateTransformations v0.5.0
[9a962f9c] DataAPI v1.1.0
[a93c6f00] DataFrames v0.19.4
[864edb3b] DataStructures v0.17.6
[e2d170a0] DataValueInterfaces v1.0.0
[01453d9d] DiffEqDiffTools v1.5.0
[163ba53b] DiffResults v0.0.4
[b552c78f] DiffRules v0.1.0
[b4f34e82] Distances v0.8.2
[b5cc3c7e] DistributedFactorGraphs v0.5.1
[31c24e10] Distributions v0.21.9
[ffbed154] DocStringExtensions v0.8.1
[5789e2e9] FileIO v1.1.0
[1a297f60] FillArrays v0.8.2
[53c48c17] FixedPointNumbers v0.6.1
[f6369f11] ForwardDiff v0.10.7
[3e9e306e] FunctionalStateMachine v0.1.3
[a2cc645c] GraphPlot v0.3.1
[86223c79] Graphs v0.10.3
[cd3eb016] HTTP v0.8.8
[904591bb] IncrementalInference v0.8.2
[d25df0c9] Inflate v0.1.1
[83e8ac13] IniFile v0.5.0
[41ab1584] InvertedIndices v1.0.0
[c8e1da08] IterTools v1.3.0
[82899510] IteratorInterfaceExtensions v1.0.0
[033835bb] JLD2 v0.1.9
[682c06a0] JSON v0.21.0
[2535ab7d] JSON2 v0.3.1
[2472808a] KernelDensityEstimate v0.5.2
[093fc24a] LightGraphs v1.3.0
[d3d80556] LineSearches v7.0.1
[1914dd2f] MacroTools v0.5.2
[739be429] MbedTLS v0.7.0
[442fdcdd] Measures v0.3.0
[e1d29d7a] Missings v0.4.3
[d41bc354] NLSolversBase v7.5.0
[2774e3e8] NLsolve v4.2.0
[77ba4419] NaNMath v0.3.3
[d2adbeaf] Neo4j v2.0.0
[429524aa] Optim v0.19.5
[bac558e1] OrderedCollections v1.1.0
[90014a1f] PDMats v0.9.10
[d96e819e] Parameters v0.12.0
[69de0a69] Parsers v0.3.10
[2dfb63ee] PooledArrays v0.5.2
[85a6dd25] PositiveFactorizations v0.2.3
[92933f4c] ProgressMeter v1.2.0
[1fd47b50] QuadGK v2.1.1
[189a3867] Reexport v0.2.0
[ae029012] Requires v0.5.2
[79098fc4] Rmath v0.5.1
[6038ab10] Rotations v0.12.0
[699a6c99] SimpleTraits v0.9.1
[a2af1166] SortingAlgorithms v0.3.1
[276daf66] SpecialFunctions v0.8.0
[90137ffa] StaticArrays v0.12.1
[2913bbd2] StatsBase v0.32.0
[4c63d2b9] StatsFuns v0.9.0
[3783bdb8] TableTraits v1.0.0
[bd369af6] Tables v0.2.11
[3bb67fe8] TranscodingStreams v0.9.5
[9b8138ad] TransformUtils v0.2.2
[30578b45] URIParser v0.4.0
[2a0f44e3] Base64 [`@stdlib/Base64`]
[ade2ca70] Dates [`@stdlib/Dates`]
[8bb1440f] DelimitedFiles [`@stdlib/DelimitedFiles`]
[8ba89e20] Distributed [`@stdlib/Distributed`]
[9fa8497b] Future [`@stdlib/Future`]
[b77e0a4c] InteractiveUtils [`@stdlib/InteractiveUtils`]
[76f85450] LibGit2 [`@stdlib/LibGit2`]
[8f399da3] Libdl [`@stdlib/Libdl`]
[37e2e46d] LinearAlgebra [`@stdlib/LinearAlgebra`]
[56ddb016] Logging [`@stdlib/Logging`]
[d6f4376e] Markdown [`@stdlib/Markdown`]
[a63ad114] Mmap [`@stdlib/Mmap`]
[44cfe95a] Pkg [`@stdlib/Pkg`]
[de0858da] Printf [`@stdlib/Printf`]
[9abbd945] Profile [`@stdlib/Profile`]
[3fa0cd96] REPL [`@stdlib/REPL`]
[9a3f8284] Random [`@stdlib/Random`]
[ea8e919c] SHA [`@stdlib/SHA`]
[9e88b42a] Serialization [`@stdlib/Serialization`]
[1a1011a3] SharedArrays [`@stdlib/SharedArrays`]
[6462fe0b] Sockets [`@stdlib/Sockets`]
[2f01184e] SparseArrays [`@stdlib/SparseArrays`]
[10745b16] Statistics [`@stdlib/Statistics`]
[4607b0f0] SuiteSparse [`@stdlib/SuiteSparse`]
[8dfed614] Test [`@stdlib/Test`]
[cf7118a7] UUIDs [`@stdlib/UUIDs`]
[4ec0a83e] Unicode [`@stdlib/Unicode`]
[ Info: Multithreaded convolutions possible, Threads.nthreads()=1. See `addFactor!(.;threadmodel=MultiThreaded)`.
[ Info: KernelDensityEstimate.FORCE_EVAL_DIRECT = true
WARNING: Method definition (::Type{DistributedFactorGraphs.VariableNodeData{T} where T<:DistributedFactorGraphs.InferenceVariable})(Array{Float64, 2}, Array{Float64, 2}, Array{Symbol, 1}, Array{Int64, 1}, Int64, Bool, Symbol, Array{Symbol, 1}, T<:DistributedFactorGraphs.InferenceVariable, Bool, Float64, Bool, Bool, Int64) where {T<:DistributedFactorGraphs.InferenceVariable} in module DistributedFactorGraphs at /root/.julia/packages/DistributedFactorGraphs/NMxiR/src/entities/DFGVariable.jl:11 overwritten at /root/.julia/packages/DistributedFactorGraphs/NMxiR/src/entities/DFGVariable.jl:41.
** incremental compilation may be fatally broken for this module **
WARNING: Method definition (::Type{DistributedFactorGraphs.VariableNodeData{T} where T<:DistributedFactorGraphs.InferenceVariable})(Array{Float64, 2}, Array{Float64, 2}, Array{Symbol, 1}, Array{Int64, 1}, Int64, Bool, Symbol, Array{Symbol, 1}, T<:DistributedFactorGraphs.InferenceVariable, Bool, Float64, Bool, Bool, Int64) where {T<:DistributedFactorGraphs.InferenceVariable} in module DistributedFactorGraphs at /root/.julia/packages/DistributedFactorGraphs/NMxiR/src/entities/DFGVariable.jl:11 overwritten at /root/.julia/packages/DistributedFactorGraphs/NMxiR/src/entities/DFGVariable.jl:41.
** incremental compilation may be fatally broken for this module **
WARNING: Method definition (::Type{DistributedFactorGraphs.VariableNodeData{T} where T<:DistributedFactorGraphs.InferenceVariable})(Array{Float64, 2}, Array{Float64, 2}, Array{Symbol, 1}, Array{Int64, 1}, Int64, Bool, Symbol, Array{Symbol, 1}, T<:DistributedFactorGraphs.InferenceVariable, Bool, Float64, Bool, Bool, Int64) where {T<:DistributedFactorGraphs.InferenceVariable} in module DistributedFactorGraphs at /root/.julia/packages/DistributedFactorGraphs/NMxiR/src/entities/DFGVariable.jl:41 overwritten at /root/.julia/packages/DistributedFactorGraphs/NMxiR/src/entities/DFGVariable.jl:11.
** incremental compilation may be fatally broken for this module **
WARNING: Method definition (::Type{DistributedFactorGraphs.VariableNodeData{T} where T<:DistributedFactorGraphs.InferenceVariable})(Array{Float64, 2}, Array{Float64, 2}, Array{Symbol, 1}, Array{Int64, 1}, Int64, Bool, Symbol, Array{Symbol, 1}, T<:DistributedFactorGraphs.InferenceVariable, Bool, Float64, Bool, Bool, Int64) where {T<:DistributedFactorGraphs.InferenceVariable} in module DistributedFactorGraphs at /root/.julia/packages/DistributedFactorGraphs/NMxiR/src/entities/DFGVariable.jl:11 overwritten at /root/.julia/packages/DistributedFactorGraphs/NMxiR/src/entities/DFGVariable.jl:41.
** incremental compilation may be fatally broken for this module **
[ Info: KernelDensityEstimate.FORCE_EVAL_DIRECT = true
[ Info: Adding graph visualization tools.
evalPotential sees SecondType(1)
evalPotential also sees SecondAgain(3)
evalPotential sees SecondType(1)
evalPotential sees SecondType(1)
evalPotential also sees SecondAgain(3)
Check the speed is reasonable
Test Summary: | Pass Total
out of module evalPotential... | 3 3
State machine iter=1
do foo!
State machine iter=2
do bar!
State machine iter=3
do foo!
do bar!
do foo!
do foo!
State machine iter=1
do bar!
State machine iter=2
Test Summary: | Pass Total
Test IIF's generic state machine... | 5 5
[ Info: try doautoinit! of x0
[ Info: try doautoinit! of x0
[ Info: init with useinitfct Symbol[:x0f1]
[ Info: do init of x0
[ Info: try doautoinit! of x1
[ Info: x1
[ Info: x0
[ Info: x1
[ Info: x0
┌ Warning: compareFactorGraphs will skip comparisons on: Symbol[:g, :bn, :IDs, :fIDs, :id, :nodeIDs, :factorIDs, :fifo, :solverParams]
└ @ DistributedFactorGraphs ~/.julia/packages/DistributedFactorGraphs/NMxiR/src/services/CompareUtils.jl:317
[ Info: x1
[ Info: x0
┌ Warning: compareFactorGraphs will skip comparisons on: Symbol[:g, :bn, :IDs, :fIDs, :id, :nodeIDs, :factorIDs, :fifo, :solverParams]
└ @ DistributedFactorGraphs ~/.julia/packages/DistributedFactorGraphs/NMxiR/src/services/CompareUtils.jl:317
[ Info: x1
[ Info: x0
[ Info: Solving over the Bayes (Junction) tree.
Building Bayes net...
[ Info:
[ Info: Eliminating x0
[ Info: ===============
[ Info:
[ Info: - Removing x0
Si = Symbol[:x1]
[ Info:
[ Info: Eliminating x1
[ Info: ===============
[ Info:
[ Info: - Removing x1
[ Info: Looking at x1f1
[ Info: - Breaking link x1f1->x1...
[ Info: - Original links: Symbol[:x1]
[ Info: - New links: Symbol[]
[ Info: x1f1 doesn't have any other links, not adding it back...
Find potential functions for each clique
[ Info: Get potentials x1,x0,:
[ Info: using all factors among cliq variables
[ Info: finding all frontals for down WIP
Bayes Tree
[ Info: Do tree based init-inference on tree
State machine iter=1
State machine iter=2
State machine iter=3
State machine iter=4
State machine iter=5
State machine iter=6
[ Info: up w 0 msgs
[ Info: ---------- successive fnc approx ------------x1,x0,:
[ Info: #1 --
[ Info: ---------- successive fnc approx ------------x1,x0,:
[ Info: #1 --
[ Info: [2x0p,d1,N100],
[ Info: #2 --
[ Info: [2x0p,d1,N100],
[ Info: #3 --
[ Info: [2x0p,d1,N100],
[ Info: fmcmc! -- solverData(vert=x1).inferdim=1.0
[ Info: fmcmc! -- solverData(vert=x0).inferdim=2.0
[ Info: Outgoing msg density on:
[ Info: prepCliqInitMsgsUp, seps=Symbol[]
State machine iter=7
State machine iter=8
[ Info: transferUpdateSubGraph! -- syms=Symbol[:x1, :x0]
[ Info: sym=x1, mem size of val=(1, 100) and (1, 100)
┌ Warning: Deprecated
└ @ IncrementalInference ~/.julia/packages/IncrementalInference/FweX2/src/FactorGraphTypes.jl:362
[ Info: sym=x0, mem size of val=(1, 100) and (1, 100)
┌ Warning: Deprecated
└ @ IncrementalInference ~/.julia/packages/IncrementalInference/FweX2/src/FactorGraphTypes.jl:362
State machine iter=9
[ Info: Finished tree based init-inference
[ Info: x1
[ Info: x0
┌ Warning: compareFactorGraphs will skip comparisons on: Symbol[:g, :bn, :IDs, :fIDs, :id, :nodeIDs, :factorIDs, :fifo, :solverParams]
└ @ DistributedFactorGraphs ~/.julia/packages/DistributedFactorGraphs/NMxiR/src/services/CompareUtils.jl:317
[ Info: x1
[ Info: x0
┌ Warning: compareFactorGraphs will skip comparisons on: Symbol[:g, :bn, :IDs, :fIDs, :id, :nodeIDs, :factorIDs, :fifo, :solverParams]
└ @ DistributedFactorGraphs ~/.julia/packages/DistributedFactorGraphs/NMxiR/src/services/CompareUtils.jl:317
[ Info: x1
[ Info: x0
[ Info: x1 is not initialized, and will do so now...
[ Info: try doautoinit! of x1
[ Info: init with useinitfct Symbol[:x0x1f1]
[ Info: do init of x1
[ Info: x1
[ Info: x0
[ Info: x1
[ Info: x0
Building Bayes net...
[ Info:
[ Info: Eliminating x0
[ Info: ===============
[ Info:
[ Info: - Removing x0
Si = Symbol[:x1]
[ Info:
[ Info: Eliminating x1
[ Info: ===============
[ Info:
[ Info: - Removing x1
[ Info: Looking at x1f1
[ Info: - Breaking link x1f1->x1...
[ Info: - Original links: Symbol[:x1]
[ Info: - New links: Symbol[]
[ Info: x1f1 doesn't have any other links, not adding it back...
Find potential functions for each clique
[ Info: Get potentials x1,x0,:
[ Info: using all factors among cliq variables
[ Info: finding all frontals for down WIP
Bayes Tree
┌ Warning: compareFactorGraphs will skip comparisons on: Symbol[:g, :bn, :IDs, :fIDs, :id, :nodeIDs, :factorIDs, :fifo, :solverParams, :initialized, :inferdim, :estimateDict]
└ @ DistributedFactorGraphs ~/.julia/packages/DistributedFactorGraphs/NMxiR/src/services/CompareUtils.jl:317
[ Info: x1
[ Info: x0
Test Summary: | Pass Total
testing compare functions for variables and factors... | 21 21
[ Info: try doautoinit! of x0
[ Info: try doautoinit! of x0
[ Info: init with useinitfct Symbol[:x0f1]
[ Info: do init of x0
[ Info: try doautoinit! of x1
[ Info: try doautoinit! of x1
[ Info: init with useinitfct Symbol[:x0x1f1]
[ Info: do init of x1
[ Info: try doautoinit! of x2
[ Info: try doautoinit! of l1
┌ Warning: compareFactorGraphs will skip comparisons on: Symbol[:g, :bn, :IDs, :fIDs, :id, :nodeIDs, :factorIDs, :fifo, :solverParams, :labelDict, :addHistory, :logpath]
└ @ DistributedFactorGraphs ~/.julia/packages/DistributedFactorGraphs/NMxiR/src/services/CompareUtils.jl:317
[ Info: x1
[ Info: x0
Test Summary: | Pass Total
test subgraph functions... | 1 1
Test Summary: | Pass Total
Ensure memory return is working properly... | 1 1
Test Summary: | Pass Total
test the basics | 2 2
[ Info: try doautoinit! of x0
maniT = if length(manifolds) < x
([manifolds[1] for i = 1:x]...,)
else
manifolds
end = (:Euclid, :Euclid)
[ Info: try doautoinit! of x1
Test Summary: | Pass Total
testing basic partial factor functions... | 2 2
[ Info: try doautoinit! of x1
[ Info: try doautoinit! of x1
[ Info: init with useinitfct Symbol[:x1f1]
[ Info: do init of x1
[ Info: try doautoinit! of x2
[ Info: try doautoinit! of x2
[ Info: init with useinitfct Symbol[:x1x2f1]
[ Info: do init of x2
[ Info: try doautoinit! of x3
[ Info: try doautoinit! of l1
[ Info: try doautoinit! of l1
[ Info: init with useinitfct Symbol[:x2l1f1, :x1l1f1]
[ Info: do init of l1
[ Info: [2x0p,d1,N100],
[ Info: try doautoinit! of x3
[ Info: init with useinitfct Symbol[:x2x3f1]
[ Info: do init of x3
[ Info: try doautoinit! of l2
Building Bayes net...
[ Info:
[ Info: Eliminating l1
[ Info: ===============
[ Info:
[ Info: - Removing l1
Si = Symbol[:x2, :x1]
[ Info:
[ Info: Eliminating l2
[ Info: ===============
[ Info:
[ Info: - Removing l2
Si = Symbol[:x3]
[ Info:
[ Info: Eliminating x1
[ Info: ===============
[ Info:
[ Info: - Removing x1
[ Info: Looking at x2x1f1
[ Info: - Breaking link x2x1f1->x1...
[ Info: - Original links: Symbol[:x2, :x1]
[ Info: - New links: Symbol[:x2]
[ Info: x2x1f1 still has links to other variables, readding it back...
Si = Symbol[:x2]
[ Info:
[ Info: Eliminating x2
[ Info: ===============
[ Info:
[ Info: - Removing x2
[ Info: Looking at x2f1
[ Info: - Breaking link x2f1->x2...
[ Info: - Original links: Symbol[:x2]
[ Info: - New links: Symbol[]
[ Info: x2f1 doesn't have any other links, not adding it back...
[ Info: Looking at x2f2
[ Info: - Breaking link x2f2->x2...
[ Info: - Original links: Symbol[:x2]
[ Info: - New links: Symbol[]
[ Info: x2f2 doesn't have any other links, not adding it back...
Si = Symbol[:x3]
[ Info:
[ Info: Eliminating x3
[ Info: ===============
[ Info:
[ Info: - Removing x3
[ Info: Looking at x3f2
[ Info: - Breaking link x3f2->x3...
[ Info: - Original links: Symbol[:x3]
[ Info: - New links: Symbol[]
[ Info: x3f2 doesn't have any other links, not adding it back...
[ Info: Looking at x3f1
[ Info: - Breaking link x3f1->x3...
[ Info: - Original links: Symbol[:x3]
[ Info: - New links: Symbol[]
[ Info: x3f1 doesn't have any other links, not adding it back...
Find potential functions for each clique
[ Info: Get potentials x1,l1,: x2,
[ Info: using all factors among cliq variables
[ Info: finding all frontals for down WIP
[ Info: Get potentials l2,: x3,
[ Info: using all factors among cliq variables
[ Info: finding all frontals for down WIP
[ Info: Get potentials x3,x2,:
[ Info: using all factors among cliq variables
[ Info: finding all frontals for down WIP
[ Info: cliq=1 adding factor that is no in separator, l2
[ Info: cliq=1 adding factor that is no in separator, l1
[ Info: cliq=1 adding factor that is no in separator, x1
┌ Warning: add test tree verification
└ @ Main ~/.julia/packages/IncrementalInference/FweX2/test/testBayesTreeiSAM2Example.jl:73
Building Bayes net...
[ Info:
[ Info: Eliminating x2
[ Info: ===============
[ Info:
[ Info: - Removing x2
Si = Symbol[:l1, :x3, :x1]
[ Info:
[ Info: Eliminating x1
[ Info: ===============
[ Info:
[ Info: - Removing x1
[ Info: Looking at l1x3x1f1
[ Info: - Breaking link l1x3x1f1->x1...
[ Info: - Original links: Symbol[:l1, :x3, :x1]
[ Info: - New links: Symbol[:l1, :x3]
[ Info: l1x3x1f1 still has links to other variables, readding it back...
Si = Symbol[:l1, :x3]
[ Info:
[ Info: Eliminating x3
[ Info: ===============
[ Info:
[ Info: - Removing x3
[ Info: Looking at l1x3f1
[ Info: - Breaking link l1x3f1->x3...
[ Info: - Original links: Symbol[:l1, :x3]
[ Info: - New links: Symbol[:l1]
[ Info: l1x3f1 still has links to other variables, readding it back...
[ Info: Looking at l1x3f2
[ Info: - Breaking link l1x3f2->x3...
[ Info: - Original links: Symbol[:l1, :x3]
[ Info: - New links: Symbol[:l1]
[ Info: l1x3f2 still has links to other variables, readding it back...
Si = Symbol[:l2, :l1]
[ Info:
[ Info: Eliminating l1
[ Info: ===============
[ Info:
[ Info: - Removing l1
[ Info: Looking at l1f2
[ Info: - Breaking link l1f2->l1...
[ Info: - Original links: Symbol[:l1]
[ Info: - New links: Symbol[]
[ Info: l1f2 doesn't have any other links, not adding it back...
[ Info: Looking at l2l1f1
[ Info: - Breaking link l2l1f1->l1...
[ Info: - Original links: Symbol[:l2, :l1]
[ Info: - New links: Symbol[:l2]
[ Info: l2l1f1 still has links to other variables, readding it back...
[ Info: Looking at l1f1
[ Info: - Breaking link l1f1->l1...
[ Info: - Original links: Symbol[:l1]
[ Info: - New links: Symbol[]
[ Info: l1f1 doesn't have any other links, not adding it back...
Si = Symbol[:l2]
[ Info:
[ Info: Eliminating l2
[ Info: ===============
[ Info:
[ Info: - Removing l2
[ Info: Looking at l2f1
[ Info: - Breaking link l2f1->l2...
[ Info: - Original links: Symbol[:l2]
[ Info: - New links: Symbol[]
[ Info: l2f1 doesn't have any other links, not adding it back...
[ Info: Looking at l2f2
[ Info: - Breaking link l2f2->l2...
[ Info: - Original links: Symbol[:l2]
[ Info: - New links: Symbol[]
[ Info: l2f2 doesn't have any other links, not adding it back...
Find potential functions for each clique
[ Info: Get potentials x1,x2,: l1,x3,
[ Info: using all factors among cliq variables
[ Info: finding all frontals for down WIP
[ Info: Get potentials l2,l1,x3,:
[ Info: using all factors among cliq variables
[ Info: finding all frontals for down WIP
[ Info: cliq=1 adding factor that is no in separator, x2
[ Info: cliq=1 adding factor that is no in separator, x1
[ Info: cliq=1 adding factor that is no in separator, x2
Test Summary: | Pass Total
basic Bayes tree construction | 1 1
Test Summary: | Pass Total
Ensure converter types can be run from extending namespaces... | 1 1
┌ Warning: Setting serialization module from AbstractDFG - override this in the 'GraphsDFG{SolverParams} structure! This is being ignored.
└ @ DistributedFactorGraphs ~/.julia/packages/DistributedFactorGraphs/NMxiR/src/services/AbstractDFG.jl:21
[ Info: try doautoinit! of x1
[ Info: try doautoinit! of x1
[ Info: init with useinitfct Symbol[:x1f1]
[ Info: do init of x1
[ Info: try doautoinit! of x2
┌ Warning: Retrieving serialization module from AbstractDFG - override this in the 'GraphsDFG{SolverParams} structure! This is returning Main
└ @ DistributedFactorGraphs ~/.julia/packages/DistributedFactorGraphs/NMxiR/src/services/AbstractDFG.jl:25
Test Summary: | Pass Total
packing converters work... | 8 8
Test Summary: | Pass Total
Ensure lambda's work with NLsolve | 1 1
Test Summary: |
minimalistic pattern on how NLsolve is used in IIF. | No tests
Test Summary: | Pass Total
generic root finding by numeric solve of residual functions... | 1 1
a1 = [-1.0 0.38408955307526993 0.8550473142468196; 0.6434826931742785 0.11268376773137656 0.12925560900438193]
0.236235 seconds (182.53 k allocations: 9.342 MiB, 7.65% gc time)
0.131451 seconds (64.82 k allocations: 3.234 MiB)
0.010096 seconds (16.69 k allocations: 1.157 MiB)
zDim = size(measurement[1], 1) = 1
ccw.varidx = solvefor = 2
1.477642 seconds (1.08 M allocations: 53.549 MiB, 2.12% gc time)
and in the reverse direction, achieved by simply changing CommonConvWrapper.varidx to 1...
ccw.varidx = solvefor = 1
0.005191 seconds (7.72 k allocations: 1.017 MiB)
┌ Warning: test not implemented yet
└ @ Main ~/.julia/packages/IncrementalInference/FweX2/test/testCommonConvWrapper.jl:255
[ Info: try doautoinit! of x1
[ Info: try doautoinit! of x1
[ Info: init with useinitfct Symbol[:x1f1]
[ Info: do init of x1
[ Info: try doautoinit! of x2
Building Bayes net...
[ Info:
[ Info: Eliminating x1
[ Info: ===============
[ Info:
[ Info: - Removing x1
Si = Symbol[:x2]
[ Info:
[ Info: Eliminating x2
[ Info: ===============
[ Info:
[ Info: - Removing x2
[ Info: Looking at x2f1
[ Info: - Breaking link x2f1->x2...
[ Info: - Original links: Symbol[:x2]
[ Info: - New links: Symbol[]
[ Info: x2f1 doesn't have any other links, not adding it back...
Find potential functions for each clique
[ Info: Get potentials x2,x1,:
[ Info: using all factors among cliq variables
[ Info: finding all frontals for down WIP
Bayes Tree
[ Info: Solving over the Bayes (Junction) tree.
Building Bayes net...
[ Info:
[ Info: Eliminating x1
[ Info: ===============
[ Info:
[ Info: - Removing x1
Si = Symbol[:x2]
[ Info:
[ Info: Eliminating x2
[ Info: ===============
[ Info:
[ Info: - Removing x2
[ Info: Looking at x2f1
[ Info: - Breaking link x2f1->x2...
[ Info: - Original links: Symbol[:x2]
[ Info: - New links: Symbol[]
[ Info: x2f1 doesn't have any other links, not adding it back...
Find potential functions for each clique
[ Info: Get potentials x2,x1,:
[ Info: using all factors among cliq variables
[ Info: finding all frontals for down WIP
Bayes Tree
[ Info: Do tree based init-inference on tree
State machine iter=1
State machine iter=2
State machine iter=3
State machine iter=4
State machine iter=5
State machine iter=6
[ Info: up w 0 msgs
[ Info: ---------- successive fnc approx ------------x2,x1,:
[ Info: #1 --
[ Info: ---------- successive fnc approx ------------x2,x1,:
[ Info: #1 --
[ Info: [2x0p,d1,N100],
[ Info: #2 --
[ Info: [2x0p,d1,N100],
[ Info: #3 --
[ Info: [2x0p,d1,N100],
[ Info: fmcmc! -- solverData(vert=x2).inferdim=1.0
[ Info: fmcmc! -- solverData(vert=x1).inferdim=2.0
[ Info: Outgoing msg density on:
[ Info: prepCliqInitMsgsUp, seps=Symbol[]
State machine iter=7
State machine iter=8
[ Info: transferUpdateSubGraph! -- syms=Symbol[:x2, :x1]
[ Info: sym=x2, mem size of val=(1, 100) and (1, 100)
┌ Warning: Deprecated
└ @ IncrementalInference ~/.julia/packages/IncrementalInference/FweX2/src/FactorGraphTypes.jl:362
[ Info: sym=x1, mem size of val=(1, 100) and (1, 100)
┌ Warning: Deprecated
└ @ IncrementalInference ~/.julia/packages/IncrementalInference/FweX2/src/FactorGraphTypes.jl:362
State machine iter=9
[ Info: Finished tree based init-inference
Test Summary: | Pass Total
GenericWrapParam functors... | 114 114
[ Info: try doautoinit! of x1
[ Info: try doautoinit! of x1
[ Info: init with useinitfct Symbol[:x1f1]
[ Info: do init of x1
[ Info: try doautoinit! of x2
Statistics.mean(pts, dims=2) = [50.26956397996111]
[ Info: Solving over the Bayes (Junction) tree.
Building Bayes net...
[ Info:
[ Info: Eliminating x1
[ Info: ===============
[ Info:
[ Info: - Removing x1
Si = Symbol[:x2]
[ Info:
[ Info: Eliminating x2
[ Info: ===============
[ Info:
[ Info: - Removing x2
[ Info: Looking at x2f1
[ Info: - Breaking link x2f1->x2...
[ Info: - Original links: Symbol[:x2]
[ Info: - New links: Symbol[]
[ Info: x2f1 doesn't have any other links, not adding it back...
Find potential functions for each clique
[ Info: Get potentials x2,x1,:
[ Info: using all factors among cliq variables
[ Info: finding all frontals for down WIP
Bayes Tree
[ Info: Do tree based init-inference on tree
State machine iter=1
State machine iter=2
State machine iter=3
State machine iter=4
State machine iter=5
State machine iter=6
[ Info: up w 0 msgs
[ Info: ---------- successive fnc approx ------------x2,x1,:
[ Info: #1 --
[ Info: ---------- successive fnc approx ------------x2,x1,:
[ Info: #1 --
[ Info: [2x0p,d1,N100],
[ Info: #2 --
[ Info: [2x0p,d1,N100],
[ Info: #3 --
[ Info: [2x0p,d1,N100],
[ Info: fmcmc! -- solverData(vert=x2).inferdim=1.0
[ Info: fmcmc! -- solverData(vert=x1).inferdim=2.0
[ Info: Outgoing msg density on:
[ Info: prepCliqInitMsgsUp, seps=Symbol[]
State machine iter=7
State machine iter=8
[ Info: transferUpdateSubGraph! -- syms=Symbol[:x2, :x1]
[ Info: sym=x2, mem size of val=(1, 100) and (1, 100)
┌ Warning: Deprecated
└ @ IncrementalInference ~/.julia/packages/IncrementalInference/FweX2/src/FactorGraphTypes.jl:362
[ Info: sym=x1, mem size of val=(1, 100) and (1, 100)
┌ Warning: Deprecated
└ @ IncrementalInference ~/.julia/packages/IncrementalInference/FweX2/src/FactorGraphTypes.jl:362
State machine iter=9
[ Info: Finished tree based init-inference
Test Summary: | Pass Total
with simple local constraint examples Odo, Obsv2... | 2 2
[ Info: try doautoinit! of x1
[ Info: try doautoinit! of x1
[ Info: init with useinitfct Symbol[:x1f1]
[ Info: do init of x1
[ Info: try doautoinit! of x2
Test Summary: | Pass Total
test default userdata::FactorMetadata... | 2 2
Test Summary: | Pass Total
test IncrementalInference.assembleHypothesesElements! without multihypothesis... | 16 16
Test Summary: | Pass Total
test IncrementalInference.assembleHypothesesElements! with bi-modality... | 48 48
┌ Warning: only partially testing tri-modality
└ @ Main ~/.julia/packages/IncrementalInference/FweX2/test/testExplicitMultihypo.jl:321
Test Summary: | Pass Total
test IncrementalInference.assembleHypothesesElements! with tri-modality... | 84 84
[ Info: try doautoinit! of l1
[ Info: try doautoinit! of l2
[ Info: try doautoinit! of x1
[ Info: try doautoinit! of l1
[ Info: init with useinitfct Symbol[:l1f1]
[ Info: do init of l1
[ Info: try doautoinit! of l1_0
[ Info: try doautoinit! of x1
[ Info: allowing init from incomplete set of previously initialized hypotheses, fct=x1l1l1_0f1
[ Info: init with useinitfct Symbol[:x1l1l1_0f1]
[ Info: do init of x1
[ Info: not all hypotheses initialized, but at least one available -- see #427
[ Info: try doautoinit! of x2
[ Info: try doautoinit! of x2
[ Info: init with useinitfct Symbol[:x1x2f1]
[ Info: do init of x2
[ Info: try doautoinit! of l2
[ Info: allowing init from incomplete set of previously initialized hypotheses, fct=x2l2l2_0f1
[ Info: init with useinitfct Symbol[:x2l2l2_0f1, :l2f1]
[ Info: do init of l2
[ Info: not all hypotheses initialized, but at least one available -- see #427
[ Info: [2x0p,d1,N100],
[ Info: try doautoinit! of l2_0
Building Bayes net...
Si = Symbol[:x2, :l1, :l1_0]
Si = Symbol[:x2, :l2_0]
Si = Symbol[:x2, :l1_0]
[ Info: Solving over the Bayes (Junction) tree.
[ Info:
[ Info: Eliminating x1
[ Info: ===============
[ Info:
[ Info: - Removing x1
[ Info:
[ Info: Eliminating l2
[ Info: ===============
[ Info:
[ Info: - Removing l2
[ Info:
[ Info: Eliminating l1
[ Info: ===============
[ Info:
[ Info: - Removing l1
[ Info: Looking at x2l1l1_0f1
[ Info: - Breaking link x2l1l1_0f1->l1...
[ Info: - Original links: Symbol[:x2, :l1, :l1_0]
[ Info: - New links: Symbol[:x2, :l1_0]
[ Info: x2l1l1_0f1 still has links to other variables, readding it back...
[ Info:
[ Info: Eliminating x2
[ Info: ===============
[ Info:
[ Info: - Removing x2
[ Info: Looking at x2l2_0f1
[ Info: - Breaking link x2l2_0f1->x2...
[ Info: - Original links: Symbol[:x2, :l2_0]
[ Info: - New links: Symbol[:l2_0]
[ Info: x2l2_0f1 still has links to other variables, readding it back...
[ Info: Looking at x2l1_0f1
[ Info: - Breaking link x2l1_0f1->x2...
[ Info: - Original links: Symbol[:x2, :l1_0]
[ Info: - New links: Symbol[:l1_0]
[ Info: x2l1_0f1 still has links to other variables, readding it back...
[ Info: Looking at x2l1_0f2
[ Info: - Breaking link x2l1_0f2->x2...
[ Info: - Original links: Symbol[:x2, :l1_0]
[ Info: - New links: Symbol[:l1_0]
[ Info: x2l1_0f2 still has links to other variables, readding it back...
Si = Symbol[:l2_0, :l1_0]
[ Info:
[ Info: Eliminating l2_0
[ Info: ===============
[ Info:
[ Info: - Removing l2_0
[ Info: Looking at l2_0f1
[ Info: - Breaking link l2_0f1->l2_0...
[ Info: - Original links: Symbol[:l2_0]
[ Info: - New links: Symbol[]
[ Info: l2_0f1 doesn't have any other links, not adding it back...
[ Info: Looking at l2_0l1_0f1
[ Info: - Breaking link l2_0l1_0f1->l2_0...
[ Info: - Original links: Symbol[:l2_0, :l1_0]
[ Info: - New links: Symbol[:l1_0]
[ Info: l2_0l1_0f1 still has links to other variables, readding it back...
Si = Symbol[:l1_0]
[ Info:
[ Info: Eliminating l1_0
[ Info: ===============
[ Info:
[ Info: - Removing l1_0
[ Info: Looking at l1_0f2
[ Info: - Breaking link l1_0f2->l1_0...
[ Info: - Original links: Symbol[:l1_0]
[ Info: - New links: Symbol[]
[ Info: l1_0f2 doesn't have any other links, not adding it back...
[ Info: Looking at l1_0f4
[ Info: - Breaking link l1_0f4->l1_0...
[ Info: - Original links: Symbol[:l1_0]
[ Info: - New links: Symbol[]
[ Info: l1_0f4 doesn't have any other links, not adding it back...
[ Info: Looking at l1_0f1
[ Info: - Breaking link l1_0f1->l1_0...
[ Info: - Original links: Symbol[:l1_0]
[ Info: - New links: Symbol[]
[ Info: l1_0f1 doesn't have any other links, not adding it back...
[ Info: Looking at l1_0f3
[ Info: - Breaking link l1_0f3->l1_0...
[ Info: - Original links: Symbol[:l1_0]
[ Info: - New links: Symbol[]
[ Info: l1_0f3 doesn't have any other links, not adding it back...
[ Info: Get potentials l1,x1,: x2,l1_0,
[ Info: using all factors among cliq variables
[ Info: finding all frontals for down WIP
[ Info: Get potentials l2,: x2,l2_0,
[ Info: using all factors among cliq variables
Find potential functions for each clique
[ Info: finding all frontals for down WIP
[ Info: Get potentials l1_0,l2_0,x2,:
[ Info: using all factors among cliq variables
[ Info: finding all frontals for down WIP
[ Info: cliq=1 adding factor that is no in separator, x1
[ Info: cliq=1 adding factor that is no in separator, l1
[ Info: cliq=1 adding factor that is no in separator, l2
[ Info: cliq=1 adding factor that is no in separator, l2
[ Info: cliq=1 adding factor that is no in separator, x1
[ Info: Do tree based init-inference on tree
Bayes Tree
State machine iter=1
State machine iter=2
State machine iter=3
State machine iter=4
State machine iter=1
State machine iter=2
State machine iter=3
State machine iter=4
State machine iter=5
State machine iter=6
State machine iter=7
State machine iter=8
[ Info: up w 0 msgs
State machine iter=1
State machine iter=2
[ Info: ---------- successive fnc approx ------------l1,x1,: x2,l1_0,
[ Info: #1 --
[ Info: ---------- successive fnc approx ------------l1,x1,: x2,l1_0,
[ Info: #1 --
State machine iter=3[ Info: [2x0p,d1,N100],
[ Info: [2x0p,d1,N100],
State machine iter=4[ Info: #2 --
[ Info: [2x0p,d1,N100],
State machine iter=5[ Info: [2x0p,d1,N100],
[ Info: #3 --
State machine iter=6
[ Info: [2x0p,d1,N100],
[ Info: [2x0p,d1,N100],
State machine iter=7
State machine iter=8[ Info: fmcmc! -- solverData(vert=x2).inferdim=0.0
[ Info: fmcmc! -- solverData(vert=l1_0).inferdim=0.0
[ Info: fmcmc! -- solverData(vert=l1).inferdim=1.0
[ Info: fmcmc! -- solverData(vert=x1).inferdim=0.0
[ Info: up w 0 msgs
[ Info: Outgoing msg density on:
[ Info: ---------- successive fnc approx ------------l2,: x2,l2_0,
[ Info: prepCliqInitMsgsUp, seps=Symbol[:x2, :l1_0]
[ Info: #1 --
[ Info: ---------- successive fnc approx ------------l2,: x2,l2_0,
[ Info: #1 --
[ Info: [2x0p,d1,N100],
[ Info: #2 --
State machine iter=9[ Info: [2x0p,d1,N100],
[ Info: #3 --
[ Info: [2x0p,d1,N100],
State machine iter=10[ Info: fmcmc! -- solverData(vert=x2).inferdim=0.0
[ Info: fmcmc! -- solverData(vert=l2_0).inferdim=0.0
[ Info: fmcmc! -- solverData(vert=l2).inferdim=1.0
[ Info: Outgoing msg density on:
[ Info: prepCliqInitMsgsUp, seps=Symbol[:x2, :l2_0]
State machine iter=5
State machine iter=6
[ Info: up w 2 msgs
[ Info: inp.sendmsgs[x2].inferdim=0.0
[ Info: inp.sendmsgs[l1_0].inferdim=0.0
State machine iter=9
State machine iter=10[ Info: inp.sendmsgs[l2_0].inferdim=0.0
[ Info: inp.sendmsgs[x2].inferdim=0.0
[ Info: ---------- successive fnc approx ------------l1_0,l2_0,x2,:
[ Info: #1 --
[ Info: fmcmc! -- solverData(vert=l1_0).inferdim=0.0
[ Info: fmcmc! -- solverData(vert=l2_0).inferdim=0.0
[ Info: ---------- successive fnc approx ------------l1_0,l2_0,x2,:
[ Info: #1 --
[ Info: [2x0p,d1,N100],
[ Info: fmcmc! -- solverData(vert=l1_0).inferdim=0.0
[ Info: fmcmc! -- solverData(vert=l2_0).inferdim=0.0
[ Info: fmcmc! -- solverData(vert=x2).inferdim=0.0
[ Info: Outgoing msg density on:
[ Info: prepCliqInitMsgsUp, seps=Symbol[]
State machine iter=7
State machine iter=8
[ Info: transferUpdateSubGraph! -- syms=Symbol[:l1_0, :l2_0, :x2]
[ Info: sym=l1_0, mem size of val=(1, 100) and (1, 100)
┌ Warning: Deprecated
└ @ IncrementalInference ~/.julia/packages/IncrementalInference/FweX2/src/FactorGraphTypes.jl:362
[ Info: sym=l2_0, mem size of val=(1, 100) and (1, 100)
┌ Warning: Deprecated
└ @ IncrementalInference ~/.julia/packages/IncrementalInference/FweX2/src/FactorGraphTypes.jl:362
[ Info: sym=x2, mem size of val=(1, 100) and (1, 100)
┌ Warning: Deprecated
└ @ IncrementalInference ~/.julia/packages/IncrementalInference/FweX2/src/FactorGraphTypes.jl:362
State machine iter=11
[ Info: [2x0p,d1,N100],
State machine iter=11
[ Info: [2x0p,d1,N100],
[ Info: [2x0p,d1,N100],
[ Info: [2x0p,d1,N100],
State machine iter=9[ Info: [2x0p,d1,N100],
[ Info: [2x0p,d1,N100],
[ Info: [2x0p,d1,N100],
State machine iter=12
State machine iter=12
[ Info: Finished tree based init-inference
Test Summary: |
test CSM runaway on upsolve, (issue 427) | No tests
[ Info: try doautoinit! of l0
[ Info: try doautoinit! of l1
[ Info: try doautoinit! of x0
[ Info: try doautoinit! of l0
[ Info: init with useinitfct Symbol[:l0f1]
[ Info: do init of l0
[ Info: try doautoinit! of l1
[ Info: init with useinitfct Symbol[:l1f1]
[ Info: do init of l1
[ Info: try doautoinit! of x0
[ Info: init with useinitfct Symbol[:x0l0l1f1]
[ Info: do init of x0
[ Info: try doautoinit! of x1
[ Info: try doautoinit! of x1
[ Info: init with useinitfct Symbol[:x1l0l1f1, :x0x1f1]
[ Info: do init of x1
[ Info: [2x0p,d1,N200],
[ Info: try doautoinit! of x2
[ Info: Solving over the Bayes (Junction) tree.
Building Bayes net...
[ Info:
[ Info: Eliminating x1
[ Info: ===============
[ Info:
[ Info: - Removing x1
Si = Symbol[:x2, :l0, :l1, :x0]
[ Info:
[ Info: Eliminating l1
[ Info: ===============
[ Info:
[ Info: - Removing l1
[ Info: Looking at x2l0l1x0f1
[ Info: - Breaking link x2l0l1x0f1->l1...
[ Info: - Original links: Symbol[:x2, :l0, :l1, :x0]
[ Info: - New links: Symbol[:x2, :l0, :x0]
[ Info: x2l0l1x0f1 still has links to other variables, readding it back...
Si = Symbol[:x0, :l0, :x2]
[ Info:
[ Info: Eliminating l0
[ Info: ===============
[ Info:
[ Info: - Removing l0
[ Info: Looking at x2l0x0f1
[ Info: - Breaking link x2l0x0f1->l0...
[ Info: - Original links: Symbol[:x2, :l0, :x0]
[ Info: - New links: Symbol[:x2, :x0]
[ Info: x2l0x0f1 still has links to other variables, readding it back...
[ Info: Looking at x0l0x2f1
[ Info: - Breaking link x0l0x2f1->l0...
[ Info: - Original links: Symbol[:x0, :l0, :x2]
[ Info: - New links: Symbol[:x0, :x2]
[ Info: x0l0x2f1 still has links to other variables, readding it back...
Si = Symbol[:x2, :x0]
[ Info:
[ Info: Eliminating x0
[ Info: ===============
[ Info:
[ Info: - Removing x0
[ Info: Looking at x0x2f1
[ Info: - Breaking link x0x2f1->x0...
[ Info: - Original links: Symbol[:x0, :x2]
[ Info: - New links: Symbol[:x2]
[ Info: x0x2f1 still has links to other variables, readding it back...
[ Info: Looking at x2x0f2
[ Info: - Breaking link x2x0f2->x0...
[ Info: - Original links: Symbol[:x2, :x0]
[ Info: - New links: Symbol[:x2]
[ Info: x2x0f2 still has links to other variables, readding it back...
[ Info: Looking at x2x0f1
[ Info: - Breaking link x2x0f1->x0...
[ Info: - Original links: Symbol[:x2, :x0]
[ Info: - New links: Symbol[:x2]
[ Info: x2x0f1 still has links to other variables, readding it back...
Si = Symbol[:x2]
[ Info:
[ Info: Eliminating x2
[ Info: ===============
[ Info:
[ Info: - Removing x2
[ Info: Looking at x2f1
[ Info: - Breaking link x2f1->x2...
[ Info: - Original links: Symbol[:x2]
[ Info: - New links: Symbol[]
[ Info: x2f1 doesn't have any other links, not adding it back...
[ Info: Looking at x2f4
[ Info: - Breaking link x2f4->x2...
[ Info: - Original links: Symbol[:x2]
[ Info: - New links: Symbol[]
[ Info: x2f4 doesn't have any other links, not adding it back...
[ Info: Looking at x2f2
[ Info: - Breaking link x2f2->x2...
[ Info: - Original links: Symbol[:x2]
[ Info: - New links: Symbol[]
[ Info: x2f2 doesn't have any other links, not adding it back...
[ Info: Looking at x2f3
[ Info: - Breaking link x2f3->x2...
[ Info: - Original links: Symbol[:x2]
[ Info: - New links: Symbol[]
[ Info: x2f3 doesn't have any other links, not adding it back...
Find potential functions for each clique
[ Info: Get potentials x2,x0,l0,l1,x1,:
[ Info: using all factors among cliq variables
[ Info: finding all frontals for down WIP
Bayes Tree
[ Info: Do tree based init-inference on tree
State machine iter=1
State machine iter=2
State machine iter=3
State machine iter=4
State machine iter=5
State machine iter=6
[ Info: up w 0 msgs
[ Info: ---------- successive fnc approx ------------x2,x0,l0,l1,x1,:
[ Info: #1 --
[ Info: ---------- successive fnc approx ------------x2,x0,l0,l1,x1,:
[ Info: #1 --
[ Info: [2x0p,d1,N200],
[ Info: [3x0p,d1,N200],
[ Info: [3x0p,d1,N200],
[ Info: [3x0p,d1,N200],
[ Info: #2 --
[ Info: [2x0p,d1,N200],
[ Info: [3x0p,d1,N200],
[ Info: [3x0p,d1,N200],
[ Info: [3x0p,d1,N200],
[ Info: #3 --
[ Info: [2x0p,d1,N200],
[ Info: [3x0p,d1,N200],
[ Info: [3x0p,d1,N200],
[ Info: [3x0p,d1,N200],
[ Info: fmcmc! -- solverData(vert=x2).inferdim=1.0
[ Info: fmcmc! -- solverData(vert=x0).inferdim=2.0
[ Info: fmcmc! -- solverData(vert=l0).inferdim=3.0
[ Info: fmcmc! -- solverData(vert=l1).inferdim=3.0
[ Info: fmcmc! -- solverData(vert=x1).inferdim=3.0
[ Info: Outgoing msg density on:
[ Info: prepCliqInitMsgsUp, seps=Symbol[]
State machine iter=7
State machine iter=8
[ Info: transferUpdateSubGraph! -- syms=Symbol[:x2, :x0, :l0, :l1, :x1]
[ Info: sym=x2, mem size of val=(1, 200) and (1, 200)
┌ Warning: Deprecated
└ @ IncrementalInference ~/.julia/packages/IncrementalInference/FweX2/src/FactorGraphTypes.jl:362
[ Info: sym=x0, mem size of val=(1, 200) and (1, 200)
┌ Warning: Deprecated
└ @ IncrementalInference ~/.julia/packages/IncrementalInference/FweX2/src/FactorGraphTypes.jl:362
[ Info: sym=l0, mem size of val=(1, 200) and (1, 200)
┌ Warning: Deprecated
└ @ IncrementalInference ~/.julia/packages/IncrementalInference/FweX2/src/FactorGraphTypes.jl:362
[ Info: sym=l1, mem size of val=(1, 200) and (1, 200)
┌ Warning: Deprecated
└ @ IncrementalInference ~/.julia/packages/IncrementalInference/FweX2/src/FactorGraphTypes.jl:362
[ Info: sym=x1, mem size of val=(1, 200) and (1, 200)
┌ Warning: Deprecated
└ @ IncrementalInference ~/.julia/packages/IncrementalInference/FweX2/src/FactorGraphTypes.jl:362
[ Info: Finished tree based init-inference
State machine iter=9
Test Summary: | Pass Total
2door basic binary multihypothesis tests... | 5 5
[ Info: try doautoinit! of x0
Threads.nthreads() = 1
[ Info: try doautoinit! of x0
[ Info: init with useinitfct Symbol[:x0f1]
[ Info: do init of x0
[ Info: try doautoinit! of x1
Test Summary: | Pass Total
Basic ContinuousScalar example to ensure multithreaded convolutions work... | 1 1
maniT = if length(manifolds) < x
([manifolds[1] for i = 1:x]...,)
else
manifolds
end = (:Euclid, :Euclid)
[ Info: try doautoinit! of x1
[ Info: try doautoinit! of x1
[ Info: init with useinitfct Symbol[:x1f1, :x1f2]
[ Info: do init of x1
[ Info: [1x1p,d2,N100],
[ Info:
[ Info: Eliminating x1
[ Info: ===============
[ Info:
Building Bayes net...
[ Info: - Removing x1
[ Info: Get potentials x1,:
[ Info: using all factors among cliq variables
Find potential functions for each clique
[ Info: finding all frontals for down WIP
Bayes Tree
[ Info: Solving over the Bayes (Junction) tree.
[ Info: Do tree based init-inference on tree
State machine iter=1
State machine iter=2
State machine iter=3
State machine iter=4
State machine iter=5
State machine iter=6
[ Info: up w 0 msgs
[ Info: ---------- successive fnc approx ------------x1,:
[ Info: #1 --
[ Info: ---------- successive fnc approx ------------x1,:
[ Info: #1 --
[ Info: [1x1p,d2,N100],
[ Info: fmcmc! -- solverData(vert=x1).inferdim=2.0
[ Info: Outgoing msg density on:
[ Info: prepCliqInitMsgsUp, seps=Symbol[]
State machine iter=7
State machine iter=8
[ Info: transferUpdateSubGraph! -- syms=Symbol[:x1]
[ Info: sym=x1, mem size of val=(2, 100) and (2, 100)
┌ Warning: Deprecated
└ @ IncrementalInference ~/.julia/packages/IncrementalInference/FweX2/src/FactorGraphTypes.jl:362
State machine iter=9
[ Info: Finished tree based init-inference
maniT = if length(manifolds) < x
([manifolds[1] for i = 1:x]...,)
else
manifolds
end = (:Euclid, :Euclid)
[ Info: try doautoinit! of x2
[ Info: try doautoinit! of x2
[ Info: init with useinitfct Symbol[:x1x2f1, :x2f1]
[ Info: do init of x2
[ Info: [0x2p,d2,N100],
┌ Warning: restore findRelatedFromPotential as testset!
└ @ Main ~/.julia/packages/IncrementalInference/FweX2/test/testpartialconstraint.jl:122
X2lpts[2, 95:100] = [9.845242360920562, 10.488279629580699, 10.758407099371729, 11.168307524380921, 8.19032242226386, 10.400374681197865]
lpts[2, 95:100] = [10.035704027110397, 10.887440839480634, 12.082561944336666, 10.400642883262275, 9.337871135095558, 10.308163334739803]
getPoints(keepaside) = [-19.484167047449894 -21.301145872246288 -19.944566364995 -18.974640319152314 -20.909027042808926 -19.22272429367541 -19.768448166904427 -20.21348029640657 -19.403142131019482 -19.302444174409853 -19.830658533125085 -21.435884412059007 -19.088200234982356 -20.627751690807305 -20.02095311406328 -20.389163778823214 -22.529382759759454 -20.519134715175863 -19.93920799600292 -19.987153366040577 -19.75502638776285 -21.723619890303652 -18.570178799174183 -18.831425889138533 -19.25041593261168 -18.79355562008251 -18.574663368578427 -19.007505435057876 -20.500725308175962 -20.879928951129592 -19.92983797011541 -21.18458694363224 -19.55926876773039 -17.791879370785306 -19.99066703089185 -18.559227557534463 -20.250046369504112 -20.0624759390246 -18.9957846228495 -19.688867087139563 -18.766922926797697 -21.05779225462947 -21.098651336848306 -21.114123728296043 -19.667258963922997 -20.1292267578145 -18.82731892395407 -20.78203520717638 -20.59270604887889 -18.798440677472 -21.098340880109973 -21.54801104201737 -20.984703441532154 -20.382387395911863 -19.2744805130706 -22.138174383999218 -19.844612766753194 -20.23994802103907 -20.066457738344955 -20.329222844543022 -18.200933595337418 -19.57830908554987 -21.243787204605546 -21.519084390131315 -20.691460635583535 -20.965019057704534 -20.159911926286863 -19.039014909466193 -19.54259613343325 -18.340010512385682 -19.82964670364655 -17.77966601719047 -20.398238988366117 -21.5467576734666 -21.033016284341173 -19.92650602310254 -20.63482432907297 -21.24418981495919 -17.60364636982379 -21.14167484907366 -18.95931511689184 -20.63518246282854 -18.917724785286147 -20.244919157163288 -20.10280085992641 -19.036081872795236 -19.99840467253509 -21.3378275855383 -20.371449720576283 -18.410676869572647 -18.77273428873714 -18.088832310452563 -20.392808205523025 -20.95481450524649 -19.683147975126477 -20.90594762436456 -21.130742590816723 -19.573626199455326 -20.43727846699015 -19.663873327167757; 10.453980341711024 10.055946544966034 11.059599758042294 10.467650630502606 12.52305792226474 9.144871192475065 7.842814628947928 10.196611719496694 9.956421897184859 9.453113619361014 11.862758803355323 10.30922214541266 10.561924476862618 10.188768475778573 9.282490005364496 11.145403180125584 11.031440386673557 11.105698549129457 11.26238761265668 10.606279849137588 8.645372291409783 8.83993575837186 10.936619844735914 8.749369483655045 12.07550464034078 9.842340769628784 10.73453284837104 10.640452440703228 10.296794806215045 10.529097660456111 10.60179153723803 8.611511694246145 7.34606080481307 10.41792928389846 11.240360781106048 10.975903951864282 9.789772016611167 8.721937676864414 10.203988740990374 10.387310389097514 10.60348038207802 10.465023911911256 8.535227417115166 11.21890614806298 9.691905987803658 10.552725904389975 9.367126406845772 9.9541087002758 9.807444952510918 9.049878576737598 9.680102013501203 9.983045723345068 7.890459450743401 11.083631931612135 9.050060675098235 10.398862840737845 10.972280006311442 9.258216012744157 10.365222843357055 8.566935246529557 9.99087475466527 8.644183961263655 9.435526339304854 12.3095559717482 10.982165092896485 9.637987788837059 10.718094629548661 10.17137547672796 10.918422352565129 11.646846473151758 9.727169620725249 9.171489348635768 10.842739933890304 7.755508427192934 11.095949200265375 10.534041126751978 10.439638160171222 10.959301175796062 10.946677857501921 9.491472218282157 9.085690484389692 8.761827689734051 11.242331698929389 9.062733414729385 10.300396404044408 9.682985928920544 8.709118357974551 9.822247591466105 10.152279641967503 9.879124630479783 10.250807786444021 12.090075776328677 11.78390643424078 10.829751055925895 10.035704027110397 10.887440839480634 12.082561944336666 10.400642883262275 9.337871135095558 10.308163334739803]
[ Info: [0x1p,d2,N100],
[ Info: [0x1p,d2,N100],
[ Info: [0x2p,d2,N100],
[ Info:
[ Info: Eliminating x1
[ Info: ===============
[ Info:
Building Bayes net...
[ Info: - Removing x1
[ Info:
Si = Symbol[:x2]
Find potential functions for each clique
[ Info: Eliminating x2
[ Info: ===============
[ Info:
[ Info: - Removing x2
[ Info: Looking at x2f2
[ Info: - Breaking link x2f2->x2...
[ Info: - Original links: Symbol[:x2]
[ Info: - New links: Symbol[]
[ Info: x2f2 doesn't have any other links, not adding it back...
[ Info: Get potentials x2,x1,:
[ Info: using all factors among cliq variables
[ Info: finding all frontals for down WIP
Bayes Tree
State machine iter=1
[ Info: Solving over the Bayes (Junction) tree.
[ Info: Do tree based init-inference on tree
State machine iter=2
State machine iter=3
[ Info: up w 0 msgs
[ Info: ---------- successive fnc approx ------------x2,x1,:
[ Info: #1 --
[ Info: ---------- successive fnc approx ------------x2,x1,:
[ Info: #1 --
State machine iter=4
State machine iter=5
State machine iter=6
[ Info: [0x2p,d2,N100],
[ Info: [1x2p,d2,N100],
[ Info: #2 --
[ Info: [0x2p,d2,N100],
[ Info: [1x2p,d2,N100],
[ Info: #3 --
[ Info: [0x2p,d2,N100],
[ Info: [1x2p,d2,N100],
[ Info: fmcmc! -- solverData(vert=x2).inferdim=0.0
[ Info: fmcmc! -- solverData(vert=x1).inferdim=2.0
[ Info: Outgoing msg density on:
[ Info: prepCliqInitMsgsUp, seps=Symbol[]
State machine iter=7
State machine iter=8
[ Info: transferUpdateSubGraph! -- syms=Symbol[:x2, :x1]
[ Info: sym=x2, mem size of val=(2, 100) and (2, 100)
┌ Warning: Deprecated
└ @ IncrementalInference ~/.julia/packages/IncrementalInference/FweX2/src/FactorGraphTypes.jl:362
[ Info: sym=x1, mem size of val=(2, 100) and (2, 100)
┌ Warning: Deprecated
└ @ IncrementalInference ~/.julia/packages/IncrementalInference/FweX2/src/FactorGraphTypes.jl:362
State machine iter=9
[ Info: Finished tree based init-inference
Test Summary: | Pass Total
partial constraints... | 42 42
[ Info: try doautoinit! of x1
┌ Warning: FunctorSingletonNH will be deprecated in favor of common `nullhypo=` interface.
└ @ IncrementalInference ~/.julia/packages/IncrementalInference/FweX2/src/ApproxConv.jl:273
Test Summary: | Pass Total
null hypothesis... | 2 2
[ Info: try doautoinit! of x1
[ Info: x1 is not initialized, and will do so now...
[ Info: try doautoinit! of x1
[ Info: init with useinitfct Symbol[:x1f1]
[ Info: do init of x1
[ Info: try doautoinit! of x2
[ Info: x2 is not initialized, and will do so now...
[ Info: try doautoinit! of x2
[ Info: init with useinitfct Symbol[:x1x2f1]
[ Info: do init of x2
[ Info: try doautoinit! of x3
[ Info: try doautoinit! of x4
Packing converters
[ Info: try doautoinit! of x1
[ Info: x1 is not initialized, and will do so now...
[ Info: try doautoinit! of x1
[ Info: init with useinitfct Symbol[:x1f1]
[ Info: do init of x1
[ Info: try doautoinit! of x2
[ Info: x2 is not initialized, and will do so now...
[ Info: try doautoinit! of x2
[ Info: init with useinitfct Symbol[:x1x2f1]
[ Info: do init of x2
[ Info: try doautoinit! of x3
[ Info: try doautoinit! of x4
[ Info: try doautoinit! of x5
Test Summary: | Pass Total
standardized multihypothesis... | 32 32
[ Info: try doautoinit! of x0
[ Info: try doautoinit! of x0
[ Info: init with useinitfct Symbol[:x0f1]
[ Info: do init of x0
[ Info: try doautoinit! of x2
[ Info: try doautoinit! of x2
[ Info: init with useinitfct Symbol[:x0x2f1]
[ Info: do init of x2
[ Info: try doautoinit! of x3
[ Info: try doautoinit! of x3
[ Info: init with useinitfct Symbol[:x3f1, :x2x3f1]
[ Info: do init of x3
[ Info: [2x0p,d1,N100],
[ Info: try doautoinit! of x4
[ Info: try doautoinit! of l1
[ Info: try doautoinit! of x4
[ Info: init with useinitfct Symbol[:x3x4f1]
[ Info: do init of x4
[ Info: try doautoinit! of l1
[ Info: init with useinitfct Symbol[:x3l1f1, :x4l1f1]
[ Info: do init of l1
[ Info: [2x0p,d1,N100],
[ Info: try doautoinit! of x5
[ Info: try doautoinit! of x5
[ Info: init with useinitfct Symbol[:x4x5f1]
[ Info: do init of x5
[ Info: try doautoinit! of x6
[ Info: try doautoinit! of x6
[ Info: init with useinitfct Symbol[:x5x6f1]
[ Info: do init of x6
[ Info: try doautoinit! of x7
[ Info: try doautoinit! of x7
[ Info: init with useinitfct Symbol[:x6x7f1, :x7f1]
[ Info: do init of x7
[ Info: [2x0p,d1,N100],
[ Info: Solving over the Bayes (Junction) tree.
[ Info:
[ Info: Eliminating x3
[ Info: ===============
[ Info:
Building Bayes net...
[ Info: - Removing x3
[ Info:
[ Info: Eliminating x4
[ Info: ===============
[ Info:
[ Info: - Removing x4
[ Info: Looking at l1x4x2f1
[ Info: - Breaking link l1x4x2f1->x4...
[ Info: - Original links: Symbol[:l1, :x4, :x2]
[ Info: - New links: Symbol[:l1, :x2]
[ Info: l1x4x2f1 still has links to other variables, readding it back...
[ Info:
[ Info: Eliminating x7
[ Info: ===============
[ Info:
Si = Symbol[:l1, :x4, :x2]
Si = Symbol[:l1, :x2, :x5]
Si = Symbol[:x6]
[ Info: - Removing x7
[ Info:
[ Info: Eliminating x0
[ Info: ===============
[ Info:
[ Info: - Removing x0
[ Info:
[ Info: Eliminating x5
[ Info: ===============
[ Info:
[ Info: - Removing x5
[ Info: Looking at l1x2x5f1
[ Info: - Breaking link l1x2x5f1->x5...
[ Info: - Original links: Symbol[:l1, :x2, :x5]
[ Info: - New links: Symbol[:l1, :x2]
[ Info: l1x2x5f1 still has links to other variables, readding it back...
[ Info:
[ Info: Eliminating l1
[ Info: ===============
[ Info:
[ Info: - Removing l1
[ Info: Looking at l1x2f1
[ Info: - Breaking link l1x2f1->l1...
[ Info: - Original links: Symbol[:l1, :x2]
[ Info: - New links: Symbol[:x2]
[ Info: l1x2f1 still has links to other variables, readding it back...
[ Info: Looking at l1x2f2
[ Info: - Breaking link l1x2f2->l1...
[ Info: - Original links: Symbol[:l1, :x2]
[ Info: - New links: Symbol[:x2]
[ Info: l1x2f2 still has links to other variables, readding it back...
[ Info: Looking at x6l1x2f1
[ Info: - Breaking link x6l1x2f1->l1...
[ Info: - Original links: Symbol[:x6, :l1, :x2]
[ Info: - New links: Symbol[:x6, :x2]
[ Info: x6l1x2f1 still has links to other variables, readding it back...
[ Info:
[ Info: Eliminating x2
[ Info: ===============
[ Info:
[ Info: - Removing x2
[ Info: Looking at x2x6f1
[ Info: - Breaking link x2x6f1->x2...
[ Info: - Original links: Symbol[:x2, :x6]
[ Info: - New links: Symbol[:x6]
[ Info: x2x6f1 still has links to other variables, readding it back...
[ Info: Looking at x6x2f1
[ Info: - Breaking link x6x2f1->x2...
[ Info: - Original links: Symbol[:x6, :x2]
[ Info: - New links: Symbol[:x6]
[ Info: x6x2f1 still has links to other variables, readding it back...
[ Info: Looking at x2f1
Si = Symbol[:x2]
Si = Symbol[:x6, :l1, :x2]
Si = Symbol[:x2, :x6]
[ Info: - Breaking link x2f1->x2...
[ Info: - Original links: Symbol[:x2]
[ Info: - New links: Symbol[]
[ Info: x2f1 doesn't have any other links, not adding it back...
[ Info: Looking at x2f3
[ Info: - Breaking link x2f3->x2...
[ Info: - Original links: Symbol[:x2]
[ Info: - New links: Symbol[]
[ Info: x2f3 doesn't have any other links, not adding it back...
[ Info: Looking at x2f2
[ Info: - Breaking link x2f2->x2...
[ Info: - Original links: Symbol[:x2]
[ Info: - New links: Symbol[]
[ Info: x2f2 doesn't have any other links, not adding it back...
Si = Symbol[:x6]
[ Info:
[ Info: Eliminating x6
[ Info: ===============
[ Info:
[ Info: - Removing x6
[ Info: Looking at x6f4
[ Info: - Breaking link x6f4->x6...
[ Info: - Original links: Symbol[:x6]
[ Info: - New links: Symbol[]
[ Info: x6f4 doesn't have any other links, not adding it back...
[ Info: Looking at x6f3
[ Info: - Breaking link x6f3->x6...
[ Info: - Original links: Symbol[:x6]
[ Info: - New links: Symbol[]
[ Info: x6f3 doesn't have any other links, not adding it back...
[ Info: Looking at x6f1
[ Info: - Breaking link x6f1->x6...
[ Info: - Original links: Symbol[:x6]
[ Info: - New links: Symbol[]
[ Info: x6f1 doesn't have any other links, not adding it back...
[ Info: Looking at x6f2
[ Info: - Breaking link x6f2->x6...
[ Info: - Original links: Symbol[:x6]
[ Info: - New links: Symbol[]
[ Info: x6f2 doesn't have any other links, not adding it back...
[ Info: Get potentials x0,: x2,
[ Info: using all factors among cliq variables
Find potential functions for each clique
[ Info: finding all frontals for down WIP
[ Info: Get potentials x7,: x6,
[ Info: using all factors among cliq variables
[ Info: finding all frontals for down WIP
[ Info: Get potentials x3,: l1,x4,x2,
[ Info: using all factors among cliq variables
[ Info: finding all frontals for down WIP
[ Info: Get potentials x4,: l1,x2,x5,
[ Info: using all factors among cliq variables
[ Info: finding all frontals for down WIP
[ Info: cliq=4 adding factor that is no in separator, x3
[ Info: Get potentials x6,x2,l1,x5,:
[ Info: using all factors among cliq variables
[ Info: finding all frontals for down WIP
[ Info: cliq=1 adding factor that is no in separator, x7
[ Info: cliq=1 adding factor that is no in separator, x3
[ Info: cliq=1 adding factor that is no in separator, x0
[ Info: cliq=1 adding factor that is no in separator, x3
[ Info: cliq=1 adding factor that is no in separator, x4
[ Info: cliq=1 adding factor that is no in separator, x4
Bayes Tree
[ Info: Do tree based init-inference on tree
State machine iter=1
State machine iter=2
State machine iter=3
State machine iter=4
State machine iter=1
State machine iter=2
State machine iter=3
State machine iter=4
State machine iter=5
State machine iter=6
State machine iter=7
State machine iter=8
State machine iter=1[ Info: up w 0 msgs
State machine iter=2
State machine iter=3[ Info: ---------- successive fnc approx ------------x0,: x2,
[ Info: #1 --
[ Info: ---------- successive fnc approx ------------x0,: x2,
[ Info: #1 --
[ Info: [2x0p,d1,N100],
[ Info: #2 --
State machine iter=4[ Info: [2x0p,d1,N100],
[ Info: #3 --
State machine iter=5
[ Info: [2x0p,d1,N100],
[ Info: fmcmc! -- solverData(vert=x2).inferdim=1.0
State machine iter=6
[ Info: fmcmc! -- solverData(vert=x0).inferdim=2.0
[ Info: Outgoing msg density on:
State machine iter=7
[ Info: prepCliqInitMsgsUp, seps=Symbol[:x2]
State machine iter=8
State machine iter=1[ Info: up w 0 msgs
[ Info: ---------- successive fnc approx ------------x7,: x6,
[ Info: #1 --
State machine iter=2
[ Info: ---------- successive fnc approx ------------x7,: x6,
[ Info: #1 --
State machine iter=3
[ Info: [2x0p,d1,N100],
[ Info: #2 --
State machine iter=4
[ Info: [2x0p,d1,N100],
[ Info: #3 --
State machine iter=9
[ Info: [2x0p,d1,N100],
State machine iter=10
[ Info: fmcmc! -- solverData(vert=x6).inferdim=1.0
[ Info: fmcmc! -- solverData(vert=x7).inferdim=2.0
[ Info: Outgoing msg density on:
State machine iter=1
State machine iter=2
State machine iter=3
State machine iter=4
State machine iter=5
State machine iter=6
[ Info: prepCliqInitMsgsUp, seps=Symbol[:x6]
[ Info: up w 0 msgs
[ Info: ---------- successive fnc approx ------------x3,: l1,x4,x2,
[ Info: #1 --
[ Info: ---------- successive fnc approx ------------x3,: l1,x4,x2,
[ Info: #1 --
State machine iter=7
State machine iter=8
[ Info: [2x0p,d1,N100],
[ Info: [2x0p,d1,N100],
[ Info: [4x0p,d1,N100],
State machine iter=9[ Info: #2 --
[ Info: [2x0p,d1,N100],
State machine iter=10[ Info: [2x0p,d1,N100],
[ Info: [4x0p,d1,N100],
[ Info: #3 --
[ Info: [2x0p,d1,N100],
[ Info: [2x0p,d1,N100],
[ Info: [4x0p,d1,N100],
[ Info: fmcmc! -- solverData(vert=x2).inferdim=1.0
[ Info: fmcmc! -- solverData(vert=l1).inferdim=2.0
[ Info: fmcmc! -- solverData(vert=x4).inferdim=2.0
[ Info: fmcmc! -- solverData(vert=x3).inferdim=4.0
[ Info: Outgoing msg density on:
[ Info: prepCliqInitMsgsUp, seps=Symbol[:l1, :x4, :x2]
State machine iter=5
State machine iter=6
State machine iter=7
State machine iter=8
[ Info: up w 1 msgs
State machine iter=9[ Info: inp.sendmsgs[x2].inferdim=1.0
[ Info: inp.sendmsgs[x4].inferdim=2.0
State machine iter=10[ Info: inp.sendmsgs[l1].inferdim=2.0
[ Info: ---------- successive fnc approx ------------x4,: l1,x2,x5,
[ Info: #1 --
[ Info: ---------- successive fnc approx ------------x4,: l1,x2,x5,
[ Info: #1 --
[ Info: fmcmc! -- solverData(vert=l1).inferdim=2.0
[ Info: fmcmc! -- solverData(vert=x2).inferdim=1.0
[ Info: ---------- successive fnc approx ------------x4,: l1,x2,x5,
[ Info: #1 --
[ Info: [2x0p,d1,N100],
[ Info: #2 --
[ Info: [2x0p,d1,N100],
[ Info: #3 --
[ Info: [2x0p,d1,N100],
[ Info: fmcmc! -- solverData(vert=x5).inferdim=1.0
[ Info: fmcmc! -- solverData(vert=x4).inferdim=3.0
[ Info: ---------- successive fnc approx ------------x4,: l1,x2,x5,
[ Info: #1 --
[ Info: Outgoing msg density on:
[ Info: prepCliqInitMsgsUp, seps=Symbol[:l1, :x2, :x5]
State machine iter=5
State machine iter=6
State machine iter=9
State machine iter=10[ Info: up w 3 msgs
[ Info: inp.sendmsgs[x2].inferdim=1.0
[ Info: inp.sendmsgs[x6].inferdim=1.0
[ Info: inp.sendmsgs[x2].inferdim=1.0
[ Info: inp.sendmsgs[x5].inferdim=1.0
[ Info: inp.sendmsgs[l1].inferdim=2.0
[ Info: ---------- successive fnc approx ------------x6,x2,l1,x5,:
[ Info: #1 --
[ Info: fmcmc! -- solverData(vert=l1).inferdim=2.0
[ Info: ---------- successive fnc approx ------------x6,x2,l1,x5,:
[ Info: #1 --
[ Info: [2x0p,d1,N100],
[ Info: [2x0p,d1,N100],
[ Info: #2 --
[ Info: [2x0p,d1,N100],
[ Info: [2x0p,d1,N100],
[ Info: #3 --
[ Info: [2x0p,d1,N100],
[ Info: [2x0p,d1,N100],
[ Info: fmcmc! -- solverData(vert=x6).inferdim=2.0
[ Info: fmcmc! -- solverData(vert=x5).inferdim=2.0
[ Info: ---------- successive fnc approx ------------x6,x2,l1,x5,:
[ Info: #1 --
[ Info: [2x0p,d1,N100],
[ Info: fmcmc! -- solverData(vert=x2).inferdim=2.0
[ Info: fmcmc! -- solverData(vert=l1).inferdim=2.0
[ Info: Outgoing msg density on:
[ Info: prepCliqInitMsgsUp, seps=Symbol[]
State machine iter=7
State machine iter=8
[ Info: transferUpdateSubGraph! -- syms=Symbol[:x6, :x2, :l1, :x5]
[ Info: sym=x6, mem size of val=(1, 100) and (1, 100)
┌ Warning: Deprecated
└ @ IncrementalInference ~/.julia/packages/IncrementalInference/FweX2/src/FactorGraphTypes.jl:362
[ Info: sym=x2, mem size of val=(1, 100) and (1, 100)
┌ Warning: Deprecated
└ @ IncrementalInference ~/.julia/packages/IncrementalInference/FweX2/src/FactorGraphTypes.jl:362
[ Info: sym=l1, mem size of val=(1, 100) and (1, 100)
┌ Warning: Deprecated
└ @ IncrementalInference ~/.julia/packages/IncrementalInference/FweX2/src/FactorGraphTypes.jl:362
State machine iter=11
State machine iter=11[ Info: sym=x5, mem size of val=(1, 100) and (1, 100)
┌ Warning: Deprecated
└ @ IncrementalInference ~/.julia/packages/IncrementalInference/FweX2/src/FactorGraphTypes.jl:362
[ Info: [2x0p,d1,N100],
State machine iter=9[ Info: [2x0p,d1,N100],
State machine iter=11
State machine iter=12[ Info: [3x0p,d1,N100],
State machine iter=12
State machine iter=11
State machine iter=12[ Info: [4x0p,d1,N100],
State machine iter=12
Test Summary: |
with local Graphs.jl dictionary and arrays only (multicore)... | No tests
[ Info: Finished tree based init-inference
[ Info: Folder '/tmp/dfg_test' doesn't exist, creating...
┌ Warning: Retrieving serialization module from AbstractDFG - override this in the 'GraphsDFG{SolverParams} structure! This is returning Main
└ @ DistributedFactorGraphs ~/.julia/packages/DistributedFactorGraphs/NMxiR/src/services/AbstractDFG.jl:25
┌ Warning: Retrieving serialization module from AbstractDFG - override this in the 'GraphsDFG{SolverParams} structure! This is returning Main
└ @ DistributedFactorGraphs ~/.julia/packages/DistributedFactorGraphs/NMxiR/src/services/AbstractDFG.jl:25
┌ Warning: Retrieving serialization module from AbstractDFG - override this in the 'GraphsDFG{SolverParams} structure! This is returning Main
└ @ DistributedFactorGraphs ~/.julia/packages/DistributedFactorGraphs/NMxiR/src/services/AbstractDFG.jl:25
┌ Warning: Retrieving serialization module from AbstractDFG - override this in the 'GraphsDFG{SolverParams} structure! This is returning Main
└ @ DistributedFactorGraphs ~/.julia/packages/DistributedFactorGraphs/NMxiR/src/services/AbstractDFG.jl:25
┌ Warning: Retrieving serialization module from AbstractDFG - override this in the 'GraphsDFG{SolverParams} structure! This is returning Main
└ @ DistributedFactorGraphs ~/.julia/packages/DistributedFactorGraphs/NMxiR/src/services/AbstractDFG.jl:25
┌ Warning: Retrieving serialization module from AbstractDFG - override this in the 'GraphsDFG{SolverParams} structure! This is returning Main
└ @ DistributedFactorGraphs ~/.julia/packages/DistributedFactorGraphs/NMxiR/src/services/AbstractDFG.jl:25
┌ Warning: Retrieving serialization module from AbstractDFG - override this in the 'GraphsDFG{SolverParams} structure! This is returning Main
└ @ DistributedFactorGraphs ~/.julia/packages/DistributedFactorGraphs/NMxiR/src/services/AbstractDFG.jl:25
┌ Warning: Retrieving serialization module from AbstractDFG - override this in the 'GraphsDFG{SolverParams} structure! This is returning Main
└ @ DistributedFactorGraphs ~/.julia/packages/DistributedFactorGraphs/NMxiR/src/services/AbstractDFG.jl:25
[ Info: Loaded 8 variables - Symbol[:l1, :x0, :x2, :x3, :x4, :x5, :x6, :x7]
[ Info: Inserting variables into graph...
[ Info: Loaded 8 factors - Symbol[:x0f1, :x0x2f1, :x2x3f1, :x3f1, :x3l1f1, :x3x4f1, :x4l1f1, :x4x5f1, :x5x6f1, :x6x7f1, :x7f1]
[ Info: Inserting factors into graph...
[ Info: Rebuilding CCW's for the factors...
Test Summary: | Pass Total
saving to and loading from FileDFG | 2 2
┌ Warning: must return testExpandedJLD.jl to testing -- currently skipped since jld2 files cannot be loaded.
└ @ Main ~/.julia/packages/IncrementalInference/FweX2/test/runtests.jl:75
[ Info: try doautoinit! of x1
[ Info: try doautoinit! of x1
[ Info: init with useinitfct Symbol[:x1f1]
[ Info: do init of x1
[ Info: try doautoinit! of x2
[ Info: try doautoinit! of x2
[ Info: init with useinitfct Symbol[:x1x2f1]
[ Info: do init of x2
[ Info: try doautoinit! of x3
[ Info: try doautoinit! of x3
[ Info: init with useinitfct Symbol[:x2x3f1]
[ Info: do init of x3
[ Info: try doautoinit! of x4
[ Info: try doautoinit! of l1
[ Info: try doautoinit! of l1
[ Info: init with useinitfct Symbol[:x1l1f1, :x2l1f1]
[ Info: do init of l1
[ Info: [2x0p,d1,N100],
[ Info: try doautoinit! of l2
[ Info: try doautoinit! of l2
[ Info: init with useinitfct Symbol[:x2l2f1, :x3l2f1]
[ Info: do init of l2
[ Info: [2x0p,d1,N100],
[ Info: try doautoinit! of x4
[ Info: init with useinitfct Symbol[:x4l2f1, :x3x4f1]
[ Info: do init of x4
[ Info: [2x0p,d1,N100],
Building Bayes net...
[ Info:
[ Info: Eliminating x2
[ Info: ===============
[ Info:
[ Info: - Removing x2
Si = Symbol[:x3, :x1, :l2, :l1]
[ Info:
[ Info: Eliminating x3
[ Info: ===============
[ Info:
[ Info: - Removing x3
[ Info: Looking at x3x1l2l1f1
[ Info: - Breaking link x3x1l2l1f1->x3...
[ Info: - Original links: Symbol[:x3, :x1, :l2, :l1]
[ Info: - New links: Symbol[:x1, :l2, :l1]
[ Info: x3x1l2l1f1 still has links to other variables, readding it back...
Si = Symbol[:x4, :x1, :l2, :l1]
[ Info:
[ Info: Eliminating x1
[ Info: ===============
[ Info:
[ Info: - Removing x1
[ Info: Looking at x1l2l1f1
[ Info: - Breaking link x1l2l1f1->x1...
[ Info: - Original links: Symbol[:x1, :l2, :l1]
[ Info: - New links: Symbol[:l2, :l1]
[ Info: x1l2l1f1 still has links to other variables, readding it back...
[ Info: Looking at x4x1l2l1f1
[ Info: - Breaking link x4x1l2l1f1->x1...
[ Info: - Original links: Symbol[:x4, :x1, :l2, :l1]
[ Info: - New links: Symbol[:x4, :l2, :l1]
[ Info: x4x1l2l1f1 still has links to other variables, readding it back...
Si = Symbol[:l2, :l1, :x4]
[ Info:
[ Info: Eliminating l2
[ Info: ===============
[ Info:
[ Info: - Removing l2
Si = Symbol[:x4, :l1]
Si = Symbol[:x4]
[ Info: Looking at x4l2l1f1
[ Info: - Breaking link x4l2l1f1->l2...
[ Info: - Original links: Symbol[:x4, :l2, :l1]
[ Info: - New links: Symbol[:x4, :l1]
[ Info: x4l2l1f1 still has links to other variables, readding it back...
[ Info: Looking at l2l1x4f1
[ Info: - Breaking link l2l1x4f1->l2...
[ Info: - Original links: Symbol[:l2, :l1, :x4]
[ Info: - New links: Symbol[:l1, :x4]
[ Info: l2l1x4f1 still has links to other variables, readding it back...
[ Info: Looking at l2l1f1
[ Info: - Breaking link l2l1f1->l2...
[ Info: - Original links: Symbol[:l2, :l1]
[ Info: - New links: Symbol[:l1]
[ Info: l2l1f1 still has links to other variables, readding it back...
[ Info:
[ Info: Eliminating l1
[ Info: ===============
[ Info:
[ Info: - Removing l1
[ Info: Looking at l1f1
[ Info: - Breaking link l1f1->l1...
[ Info: - Original links: Symbol[:l1]
[ Info: - New links: Symbol[]
[ Info: l1f1 doesn't have any other links, not adding it back...
[ Info: Looking at x4l1f2
[ Info: - Breaking link x4l1f2->l1...
[ Info: - Original links: Symbol[:x4, :l1]
[ Info: - New links: Symbol[:x4]
[ Info: x4l1f2 still has links to other variables, readding it back...
[ Info: Looking at l1x4f1
[ Info: - Breaking link l1x4f1->l1...
[ Info: - Original links: Symbol[:l1, :x4]
[ Info: - New links: Symbol[:x4]
[ Info: l1x4f1 still has links to other variables, readding it back...
[ Info: Looking at x4l1f1
[ Info: - Breaking link x4l1f1->l1...
[ Info: - Original links: Symbol[:x4, :l1]
[ Info: - New links: Symbol[:x4]
[ Info: x4l1f1 still has links to other variables, readding it back...
[ Info:
[ Info: Eliminating x4
[ Info: ===============
[ Info:
[ Info: - Removing x4
[ Info: Looking at x4f4
[ Info: - Breaking link x4f4->x4...
[ Info: - Original links: Symbol[:x4]
[ Info: - New links: Symbol[]
[ Info: x4f4 doesn't have any other links, not adding it back...
[ Info: Looking at x4f3
[ Info: - Breaking link x4f3->x4...
[ Info: - Original links: Symbol[:x4]
[ Info: - New links: Symbol[]
[ Info: x4f3 doesn't have any other links, not adding it back...
[ Info: Looking at x4f2
[ Info: - Breaking link x4f2->x4...
[ Info: - Original links: Symbol[:x4]
[ Info: - New links: Symbol[]
[ Info: x4f2 doesn't have any other links, not adding it back...
[ Info: Looking at x4f1
[ Info: - Breaking link x4f1->x4...
[ Info: - Original links: Symbol[:x4]
[ Info: - New links: Symbol[]
[ Info: x4f1 doesn't have any other links, not adding it back...
[ Info: Get potentials x2,: x3,x1,l2,l1,
[ Info: using all factors among cliq variables
[ Info: finding all frontals for down WIP
[ Info: Get potentials x4,l1,l2,x1,x3,:
[ Info: using all factors among cliq variables
[ Info: finding all frontals for down WIP
[ Info: cliq=1 adding factor that is no in separator, x2
[ Info: cliq=1 adding factor that is no in separator, x2
[ Info: cliq=1 adding factor that is no in separator, x2
[ Info: cliq=1 adding factor that is no in separator, x2
Find potential functions for each clique
Bayes Tree
┌ Warning: Base.IOError("could not spawn `dot2tex -tmath --preproc /root/.julia/packages/IncrementalInference/FweX2/test/tmp/bt.dot -o /root/.julia/packages/IncrementalInference/FweX2/test/tmp/btproc.dot`: no such file or directory (ENOENT)", -2)
└ @ IncrementalInference ~/.julia/packages/IncrementalInference/FweX2/src/JunctionTree.jl:331
stacktrace() = Base.StackTraces.StackFrame[macro expansion at show.jl:576 [inlined], #generateTexTree#96(::String, ::typeof(generateTexTree), ::BayesTree) at JunctionTree.jl:332, (::getfield(IncrementalInference, Symbol("#kw##generateTexTree")))(::NamedTuple{(:filepath,),Tuple{String}}, ::typeof(generateTexTree), ::BayesTree) at none:0, top-level scope at testTexTreeIllustration.jl:47, top-level scope at Test.jl:1113, top-level scope at testTexTreeIllustration.jl:14, include at boot.jl:328 [inlined], include_relative(::Module, ::String) at loading.jl:1094, include(::Module, ::String) at Base.jl:31, include(::String) at client.jl:431, top-level scope at runtests.jl:79, include at boot.jl:328 [inlined], include_relative(::Module, ::String) at loading.jl:1094, include(::Module, ::String) at Base.jl:31, include(::String) at client.jl:431, top-level scope at none:5, eval(::Module, ::Any) at boot.jl:330, exec_options(::Base.JLOptions) at client.jl:271, _start() at client.jl:464]
Test Summary: | Pass Total
testing generateTexTree | 1 1
Testing IncrementalInference tests passed
Results with Julia v1.3.0
Testing was successful .
Last evaluation was ago and took 11 minutes, 50 seconds.
Click here to download the log file.
Click here to show the log contents.
Resolving package versions...
Installed IniFile ───────────────────── v0.5.0
Installed CoordinateTransformations ─── v0.5.0
Installed URIParser ─────────────────── v0.4.0
Installed SortingAlgorithms ─────────── v0.3.1
Installed DiffResults ───────────────── v0.0.4
Installed Arpack ────────────────────── v0.3.1
Installed DataStructures ────────────── v0.17.6
Installed IncrementalInference ──────── v0.8.2
Installed Rotations ─────────────────── v0.12.0
Installed NLsolve ───────────────────── v4.2.0
Installed LineSearches ──────────────── v7.0.1
Installed StaticArrays ──────────────── v0.12.1
Installed JLD2 ──────────────────────── v0.1.9
Installed QuadGK ────────────────────── v2.1.1
Installed FileIO ────────────────────── v1.1.0
Installed Compose ───────────────────── v0.7.3
Installed CategoricalArrays ─────────── v0.7.3
Installed Compat ────────────────────── v2.2.0
Installed StatsFuns ─────────────────── v0.9.0
Installed NLSolversBase ─────────────── v7.5.0
Installed BinaryProvider ────────────── v0.5.8
Installed DocStringExtensions ───────── v0.8.1
Installed IterTools ─────────────────── v1.3.0
Installed Parsers ───────────────────── v0.3.10
Installed ProgressMeter ─────────────── v1.2.0
Installed InvertedIndices ───────────── v1.0.0
Installed Missings ──────────────────── v0.4.3
Installed MacroTools ────────────────── v0.5.2
Installed Rmath ─────────────────────── v0.5.1
Installed Distributions ─────────────── v0.21.9
Installed Graphs ────────────────────── v0.10.3
Installed Parameters ────────────────── v0.12.0
Installed PositiveFactorizations ────── v0.2.3
Installed TableTraits ───────────────── v1.0.0
Installed KernelDensityEstimate ─────── v0.5.2
Installed FixedPointNumbers ─────────── v0.6.1
Installed JSON ──────────────────────── v0.21.0
Installed OrderedCollections ────────── v1.1.0
Installed SpecialFunctions ──────────── v0.8.0
Installed ApproxManifoldProducts ────── v0.1.2
Installed CommonSubexpressions ──────── v0.2.0
Installed BinDeps ───────────────────── v0.8.10
Installed LightGraphs ───────────────── v1.3.0
Installed ColorTypes ────────────────── v0.8.0
Installed TransformUtils ────────────── v0.2.2
Installed Neo4j ─────────────────────── v2.0.0
Installed DataAPI ───────────────────── v1.1.0
Installed Distances ─────────────────── v0.8.2
Installed Tables ────────────────────── v0.2.11
Installed NaNMath ───────────────────── v0.3.3
Installed ForwardDiff ───────────────── v0.10.7
Installed DiffEqDiffTools ───────────── v1.5.0
Installed DiffRules ─────────────────── v0.1.0
Installed MbedTLS ───────────────────── v0.7.0
Installed Optim ─────────────────────── v0.19.5
Installed DataValueInterfaces ───────── v1.0.0
Installed ArrayInterface ────────────── v2.0.0
Installed Calculus ──────────────────── v0.5.1
Installed ArnoldiMethod ─────────────── v0.0.4
Installed Colors ────────────────────── v0.9.6
Installed Inflate ───────────────────── v0.1.1
Installed Measures ──────────────────── v0.3.0
Installed CodecZlib ─────────────────── v0.6.0
Installed Requires ──────────────────── v0.5.2
Installed FunctionalStateMachine ────── v0.1.3
Installed HTTP ──────────────────────── v0.8.8
Installed IteratorInterfaceExtensions ─ v1.0.0
Installed SimpleTraits ──────────────── v0.9.1
Installed PooledArrays ──────────────── v0.5.2
Installed DistributedFactorGraphs ───── v0.5.1
Installed FillArrays ────────────────── v0.8.2
Installed GraphPlot ─────────────────── v0.3.1
Installed TranscodingStreams ────────── v0.9.5
Installed PDMats ────────────────────── v0.9.10
Installed Reexport ──────────────────── v0.2.0
Installed JSON2 ─────────────────────── v0.3.1
Installed DataFrames ────────────────── v0.19.4
Installed StatsBase ─────────────────── v0.32.0
Updating `~/.julia/environments/v1.3/Project.toml`
[904591bb] + IncrementalInference v0.8.2
Updating `~/.julia/environments/v1.3/Manifest.toml`
[9bbbb610] + ApproxManifoldProducts v0.1.2
[ec485272] + ArnoldiMethod v0.0.4
[7d9fca2a] + Arpack v0.3.1
[4fba245c] + ArrayInterface v2.0.0
[9e28174c] + BinDeps v0.8.10
[b99e7846] + BinaryProvider v0.5.8
[49dc2e85] + Calculus v0.5.1
[324d7699] + CategoricalArrays v0.7.3
[944b1d66] + CodecZlib v0.6.0
[3da002f7] + ColorTypes v0.8.0
[5ae59095] + Colors v0.9.6
[bbf7d656] + CommonSubexpressions v0.2.0
[34da2185] + Compat v2.2.0
[a81c6b42] + Compose v0.7.3
[150eb455] + CoordinateTransformations v0.5.0
[9a962f9c] + DataAPI v1.1.0
[a93c6f00] + DataFrames v0.19.4
[864edb3b] + DataStructures v0.17.6
[e2d170a0] + DataValueInterfaces v1.0.0
[01453d9d] + DiffEqDiffTools v1.5.0
[163ba53b] + DiffResults v0.0.4
[b552c78f] + DiffRules v0.1.0
[b4f34e82] + Distances v0.8.2
[b5cc3c7e] + DistributedFactorGraphs v0.5.1
[31c24e10] + Distributions v0.21.9
[ffbed154] + DocStringExtensions v0.8.1
[5789e2e9] + FileIO v1.1.0
[1a297f60] + FillArrays v0.8.2
[53c48c17] + FixedPointNumbers v0.6.1
[f6369f11] + ForwardDiff v0.10.7
[3e9e306e] + FunctionalStateMachine v0.1.3
[a2cc645c] + GraphPlot v0.3.1
[86223c79] + Graphs v0.10.3
[cd3eb016] + HTTP v0.8.8
[904591bb] + IncrementalInference v0.8.2
[d25df0c9] + Inflate v0.1.1
[83e8ac13] + IniFile v0.5.0
[41ab1584] + InvertedIndices v1.0.0
[c8e1da08] + IterTools v1.3.0
[82899510] + IteratorInterfaceExtensions v1.0.0
[033835bb] + JLD2 v0.1.9
[682c06a0] + JSON v0.21.0
[2535ab7d] + JSON2 v0.3.1
[2472808a] + KernelDensityEstimate v0.5.2
[093fc24a] + LightGraphs v1.3.0
[d3d80556] + LineSearches v7.0.1
[1914dd2f] + MacroTools v0.5.2
[739be429] + MbedTLS v0.7.0
[442fdcdd] + Measures v0.3.0
[e1d29d7a] + Missings v0.4.3
[d41bc354] + NLSolversBase v7.5.0
[2774e3e8] + NLsolve v4.2.0
[77ba4419] + NaNMath v0.3.3
[d2adbeaf] + Neo4j v2.0.0
[429524aa] + Optim v0.19.5
[bac558e1] + OrderedCollections v1.1.0
[90014a1f] + PDMats v0.9.10
[d96e819e] + Parameters v0.12.0
[69de0a69] + Parsers v0.3.10
[2dfb63ee] + PooledArrays v0.5.2
[85a6dd25] + PositiveFactorizations v0.2.3
[92933f4c] + ProgressMeter v1.2.0
[1fd47b50] + QuadGK v2.1.1
[189a3867] + Reexport v0.2.0
[ae029012] + Requires v0.5.2
[79098fc4] + Rmath v0.5.1
[6038ab10] + Rotations v0.12.0
[699a6c99] + SimpleTraits v0.9.1
[a2af1166] + SortingAlgorithms v0.3.1
[276daf66] + SpecialFunctions v0.8.0
[90137ffa] + StaticArrays v0.12.1
[2913bbd2] + StatsBase v0.32.0
[4c63d2b9] + StatsFuns v0.9.0
[3783bdb8] + TableTraits v1.0.0
[bd369af6] + Tables v0.2.11
[3bb67fe8] + TranscodingStreams v0.9.5
[9b8138ad] + TransformUtils v0.2.2
[30578b45] + URIParser v0.4.0
[2a0f44e3] + Base64
[ade2ca70] + Dates
[8bb1440f] + DelimitedFiles
[8ba89e20] + Distributed
[9fa8497b] + Future
[b77e0a4c] + InteractiveUtils
[76f85450] + LibGit2
[8f399da3] + Libdl
[37e2e46d] + LinearAlgebra
[56ddb016] + Logging
[d6f4376e] + Markdown
[a63ad114] + Mmap
[44cfe95a] + Pkg
[de0858da] + Printf
[9abbd945] + Profile
[3fa0cd96] + REPL
[9a3f8284] + Random
[ea8e919c] + SHA
[9e88b42a] + Serialization
[1a1011a3] + SharedArrays
[6462fe0b] + Sockets
[2f01184e] + SparseArrays
[10745b16] + Statistics
[4607b0f0] + SuiteSparse
[8dfed614] + Test
[cf7118a7] + UUIDs
[4ec0a83e] + Unicode
Building Arpack ──────────→ `~/.julia/packages/Arpack/cu5By/deps/build.log`
Building Rmath ───────────→ `~/.julia/packages/Rmath/4wt82/deps/build.log`
Building SpecialFunctions → `~/.julia/packages/SpecialFunctions/ne2iw/deps/build.log`
Building MbedTLS ─────────→ `~/.julia/packages/MbedTLS/a1JFn/deps/build.log`
Building CodecZlib ───────→ `~/.julia/packages/CodecZlib/5t9zO/deps/build.log`
Testing IncrementalInference
Resolving package versions...
Status `/tmp/jl_Uy4600/Manifest.toml`
[9bbbb610] ApproxManifoldProducts v0.1.2
[ec485272] ArnoldiMethod v0.0.4
[7d9fca2a] Arpack v0.3.1
[4fba245c] ArrayInterface v2.0.0
[9e28174c] BinDeps v0.8.10
[b99e7846] BinaryProvider v0.5.8
[49dc2e85] Calculus v0.5.1
[324d7699] CategoricalArrays v0.7.3
[944b1d66] CodecZlib v0.6.0
[3da002f7] ColorTypes v0.8.0
[5ae59095] Colors v0.9.6
[bbf7d656] CommonSubexpressions v0.2.0
[34da2185] Compat v2.2.0
[a81c6b42] Compose v0.7.3
[150eb455] CoordinateTransformations v0.5.0
[9a962f9c] DataAPI v1.1.0
[a93c6f00] DataFrames v0.19.4
[864edb3b] DataStructures v0.17.6
[e2d170a0] DataValueInterfaces v1.0.0
[01453d9d] DiffEqDiffTools v1.5.0
[163ba53b] DiffResults v0.0.4
[b552c78f] DiffRules v0.1.0
[b4f34e82] Distances v0.8.2
[b5cc3c7e] DistributedFactorGraphs v0.5.1
[31c24e10] Distributions v0.21.9
[ffbed154] DocStringExtensions v0.8.1
[5789e2e9] FileIO v1.1.0
[1a297f60] FillArrays v0.8.2
[53c48c17] FixedPointNumbers v0.6.1
[f6369f11] ForwardDiff v0.10.7
[3e9e306e] FunctionalStateMachine v0.1.3
[a2cc645c] GraphPlot v0.3.1
[86223c79] Graphs v0.10.3
[cd3eb016] HTTP v0.8.8
[904591bb] IncrementalInference v0.8.2
[d25df0c9] Inflate v0.1.1
[83e8ac13] IniFile v0.5.0
[41ab1584] InvertedIndices v1.0.0
[c8e1da08] IterTools v1.3.0
[82899510] IteratorInterfaceExtensions v1.0.0
[033835bb] JLD2 v0.1.9
[682c06a0] JSON v0.21.0
[2535ab7d] JSON2 v0.3.1
[2472808a] KernelDensityEstimate v0.5.2
[093fc24a] LightGraphs v1.3.0
[d3d80556] LineSearches v7.0.1
[1914dd2f] MacroTools v0.5.2
[739be429] MbedTLS v0.7.0
[442fdcdd] Measures v0.3.0
[e1d29d7a] Missings v0.4.3
[d41bc354] NLSolversBase v7.5.0
[2774e3e8] NLsolve v4.2.0
[77ba4419] NaNMath v0.3.3
[d2adbeaf] Neo4j v2.0.0
[429524aa] Optim v0.19.5
[bac558e1] OrderedCollections v1.1.0
[90014a1f] PDMats v0.9.10
[d96e819e] Parameters v0.12.0
[69de0a69] Parsers v0.3.10
[2dfb63ee] PooledArrays v0.5.2
[85a6dd25] PositiveFactorizations v0.2.3
[92933f4c] ProgressMeter v1.2.0
[1fd47b50] QuadGK v2.1.1
[189a3867] Reexport v0.2.0
[ae029012] Requires v0.5.2
[79098fc4] Rmath v0.5.1
[6038ab10] Rotations v0.12.0
[699a6c99] SimpleTraits v0.9.1
[a2af1166] SortingAlgorithms v0.3.1
[276daf66] SpecialFunctions v0.8.0
[90137ffa] StaticArrays v0.12.1
[2913bbd2] StatsBase v0.32.0
[4c63d2b9] StatsFuns v0.9.0
[3783bdb8] TableTraits v1.0.0
[bd369af6] Tables v0.2.11
[3bb67fe8] TranscodingStreams v0.9.5
[9b8138ad] TransformUtils v0.2.2
[30578b45] URIParser v0.4.0
[2a0f44e3] Base64 [`@stdlib/Base64`]
[ade2ca70] Dates [`@stdlib/Dates`]
[8bb1440f] DelimitedFiles [`@stdlib/DelimitedFiles`]
[8ba89e20] Distributed [`@stdlib/Distributed`]
[9fa8497b] Future [`@stdlib/Future`]
[b77e0a4c] InteractiveUtils [`@stdlib/InteractiveUtils`]
[76f85450] LibGit2 [`@stdlib/LibGit2`]
[8f399da3] Libdl [`@stdlib/Libdl`]
[37e2e46d] LinearAlgebra [`@stdlib/LinearAlgebra`]
[56ddb016] Logging [`@stdlib/Logging`]
[d6f4376e] Markdown [`@stdlib/Markdown`]
[a63ad114] Mmap [`@stdlib/Mmap`]
[44cfe95a] Pkg [`@stdlib/Pkg`]
[de0858da] Printf [`@stdlib/Printf`]
[9abbd945] Profile [`@stdlib/Profile`]
[3fa0cd96] REPL [`@stdlib/REPL`]
[9a3f8284] Random [`@stdlib/Random`]
[ea8e919c] SHA [`@stdlib/SHA`]
[9e88b42a] Serialization [`@stdlib/Serialization`]
[1a1011a3] SharedArrays [`@stdlib/SharedArrays`]
[6462fe0b] Sockets [`@stdlib/Sockets`]
[2f01184e] SparseArrays [`@stdlib/SparseArrays`]
[10745b16] Statistics [`@stdlib/Statistics`]
[4607b0f0] SuiteSparse [`@stdlib/SuiteSparse`]
[8dfed614] Test [`@stdlib/Test`]
[cf7118a7] UUIDs [`@stdlib/UUIDs`]
[4ec0a83e] Unicode [`@stdlib/Unicode`]
[ Info: Multithreaded convolutions possible, Threads.nthreads()=1. See `addFactor!(.;threadmodel=MultiThreaded)`.
[ Info: KernelDensityEstimate.FORCE_EVAL_DIRECT = true
WARNING: Method definition (::Type{DistributedFactorGraphs.VariableNodeData{T} where T<:DistributedFactorGraphs.InferenceVariable})(Array{Float64, 2}, Array{Float64, 2}, Array{Symbol, 1}, Array{Int64, 1}, Int64, Bool, Symbol, Array{Symbol, 1}, T<:DistributedFactorGraphs.InferenceVariable, Bool, Float64, Bool, Bool, Int64) where {T<:DistributedFactorGraphs.InferenceVariable} in module DistributedFactorGraphs at /root/.julia/packages/DistributedFactorGraphs/NMxiR/src/entities/DFGVariable.jl:11 overwritten at /root/.julia/packages/DistributedFactorGraphs/NMxiR/src/entities/DFGVariable.jl:41.
** incremental compilation may be fatally broken for this module **
WARNING: Method definition (::Type{DistributedFactorGraphs.VariableNodeData{T} where T<:DistributedFactorGraphs.InferenceVariable})(Array{Float64, 2}, Array{Float64, 2}, Array{Symbol, 1}, Array{Int64, 1}, Int64, Bool, Symbol, Array{Symbol, 1}, T<:DistributedFactorGraphs.InferenceVariable, Bool, Float64, Bool, Bool, Int64) where {T<:DistributedFactorGraphs.InferenceVariable} in module DistributedFactorGraphs at /root/.julia/packages/DistributedFactorGraphs/NMxiR/src/entities/DFGVariable.jl:11 overwritten at /root/.julia/packages/DistributedFactorGraphs/NMxiR/src/entities/DFGVariable.jl:41.
** incremental compilation may be fatally broken for this module **
[ Info: KernelDensityEstimate.FORCE_EVAL_DIRECT = true
[ Info: Adding graph visualization tools.
evalPotential sees SecondType(1)
evalPotential also sees SecondAgain(3)
evalPotential sees SecondType(1)
evalPotential sees SecondType(1)
evalPotential also sees SecondAgain(3)
Check the speed is reasonable
Test Summary: | Pass Total
out of module evalPotential... | 3 3
State machine iter=1
do foo!
State machine iter=2
do bar!
State machine iter=3
do foo!
do bar!
do foo!
do foo!
State machine iter=1
do bar!
State machine iter=2
Test Summary: | Pass Total
Test IIF's generic state machine... | 5 5
[ Info: try doautoinit! of x0
[ Info: try doautoinit! of x0
[ Info: init with useinitfct Symbol[:x0f1]
[ Info: do init of x0
[ Info: try doautoinit! of x1
[ Info: x1
[ Info: x0
[ Info: x1
[ Info: x0
┌ Warning: compareFactorGraphs will skip comparisons on: Symbol[:g, :bn, :IDs, :fIDs, :id, :nodeIDs, :factorIDs, :fifo, :solverParams]
└ @ DistributedFactorGraphs ~/.julia/packages/DistributedFactorGraphs/NMxiR/src/services/CompareUtils.jl:317
[ Info: x1
[ Info: x0
┌ Warning: compareFactorGraphs will skip comparisons on: Symbol[:g, :bn, :IDs, :fIDs, :id, :nodeIDs, :factorIDs, :fifo, :solverParams]
└ @ DistributedFactorGraphs ~/.julia/packages/DistributedFactorGraphs/NMxiR/src/services/CompareUtils.jl:317
[ Info: x1
[ Info: x0
[ Info: Solving over the Bayes (Junction) tree.
Building Bayes net...
[ Info:
[ Info: Eliminating x0
[ Info: ===============
[ Info:
[ Info: - Removing x0
Si = Symbol[:x1]
[ Info:
[ Info: Eliminating x1
[ Info: ===============
[ Info:
[ Info: - Removing x1
[ Info: Looking at x1f1
[ Info: - Breaking link x1f1->x1...
[ Info: - Original links: Symbol[:x1]
[ Info: - New links: Symbol[]
[ Info: x1f1 doesn't have any other links, not adding it back...
Find potential functions for each clique
[ Info: Get potentials x1,x0,:
[ Info: using all factors among cliq variables
[ Info: finding all frontals for down WIP
[ Info: Do tree based init-inference on tree
Bayes Tree
State machine iter=1
State machine iter=2
State machine iter=3
State machine iter=4
State machine iter=5
State machine iter=6
[ Info: up w 0 msgs
[ Info: ---------- successive fnc approx ------------x1,x0,:
[ Info: #1 --
[ Info: ---------- successive fnc approx ------------x1,x0,:
[ Info: #1 --
[ Info: [2x0p,d1,N100],
[ Info: #2 --
[ Info: [2x0p,d1,N100],
[ Info: #3 --
[ Info: [2x0p,d1,N100],
[ Info: fmcmc! -- solverData(vert=x1).inferdim=1.0
[ Info: fmcmc! -- solverData(vert=x0).inferdim=2.0
[ Info: Outgoing msg density on:
[ Info: prepCliqInitMsgsUp, seps=Symbol[]
State machine iter=7
State machine iter=8
[ Info: transferUpdateSubGraph! -- syms=Symbol[:x1, :x0]
[ Info: sym=x1, mem size of val=(1, 100) and (1, 100)
┌ Warning: Deprecated
└ @ IncrementalInference ~/.julia/packages/IncrementalInference/FweX2/src/FactorGraphTypes.jl:362
[ Info: sym=x0, mem size of val=(1, 100) and (1, 100)
┌ Warning: Deprecated
└ @ IncrementalInference ~/.julia/packages/IncrementalInference/FweX2/src/FactorGraphTypes.jl:362
State machine iter=9
[ Info: Finished tree based init-inference
[ Info: x1
[ Info: x0
┌ Warning: compareFactorGraphs will skip comparisons on: Symbol[:g, :bn, :IDs, :fIDs, :id, :nodeIDs, :factorIDs, :fifo, :solverParams]
└ @ DistributedFactorGraphs ~/.julia/packages/DistributedFactorGraphs/NMxiR/src/services/CompareUtils.jl:317
[ Info: x1
[ Info: x0
┌ Warning: compareFactorGraphs will skip comparisons on: Symbol[:g, :bn, :IDs, :fIDs, :id, :nodeIDs, :factorIDs, :fifo, :solverParams]
└ @ DistributedFactorGraphs ~/.julia/packages/DistributedFactorGraphs/NMxiR/src/services/CompareUtils.jl:317
[ Info: x1
[ Info: x0
[ Info: x1 is not initialized, and will do so now...
[ Info: try doautoinit! of x1
[ Info: init with useinitfct Symbol[:x0x1f1]
[ Info: do init of x1
[ Info: x1
[ Info: x0
[ Info: x1
[ Info: x0
Building Bayes net...
Si = Symbol[:x1]
Find potential functions for each clique
Bayes Tree
[ Info:
[ Info: Eliminating x0
[ Info: ===============
[ Info:
[ Info: - Removing x0
[ Info:
[ Info: Eliminating x1
[ Info: ===============
[ Info:
[ Info: - Removing x1
[ Info: Looking at x1f1
[ Info: - Breaking link x1f1->x1...
[ Info: - Original links: Symbol[:x1]
[ Info: - New links: Symbol[]
[ Info: x1f1 doesn't have any other links, not adding it back...
[ Info: Get potentials x1,x0,:
[ Info: using all factors among cliq variables
[ Info: finding all frontals for down WIP
┌ Warning: compareFactorGraphs will skip comparisons on: Symbol[:g, :bn, :IDs, :fIDs, :id, :nodeIDs, :factorIDs, :fifo, :solverParams, :initialized, :inferdim, :estimateDict]
└ @ DistributedFactorGraphs ~/.julia/packages/DistributedFactorGraphs/NMxiR/src/services/CompareUtils.jl:317
[ Info: x1
[ Info: x0
Test Summary: | Pass Total
testing compare functions for variables and factors... | 21 21
[ Info: try doautoinit! of x0
[ Info: try doautoinit! of x0
[ Info: init with useinitfct Symbol[:x0f1]
[ Info: do init of x0
[ Info: try doautoinit! of x1
[ Info: try doautoinit! of x1
[ Info: init with useinitfct Symbol[:x0x1f1]
[ Info: do init of x1
[ Info: try doautoinit! of x2
[ Info: try doautoinit! of l1
┌ Warning: compareFactorGraphs will skip comparisons on: Symbol[:g, :bn, :IDs, :fIDs, :id, :nodeIDs, :factorIDs, :fifo, :solverParams, :labelDict, :addHistory, :logpath]
└ @ DistributedFactorGraphs ~/.julia/packages/DistributedFactorGraphs/NMxiR/src/services/CompareUtils.jl:317
[ Info: x1
[ Info: x0
Test Summary: | Pass Total
test subgraph functions... | 1 1
Test Summary: | Pass Total
Ensure memory return is working properly... | 1 1
Test Summary: | Pass Total
test the basics | 2 2
[ Info: try doautoinit! of x0
maniT = if length(manifolds) < x
([manifolds[1] for i = 1:x]...,)
else
manifolds
end = (:Euclid, :Euclid)
[ Info: try doautoinit! of x1
Test Summary: | Pass Total
testing basic partial factor functions... | 2 2
[ Info: try doautoinit! of x1
[ Info: try doautoinit! of x1
[ Info: init with useinitfct Symbol[:x1f1]
[ Info: do init of x1
[ Info: try doautoinit! of x2
[ Info: try doautoinit! of x2
[ Info: init with useinitfct Symbol[:x1x2f1]
[ Info: do init of x2
[ Info: try doautoinit! of x3
[ Info: try doautoinit! of l1
[ Info: try doautoinit! of l1
[ Info: init with useinitfct Symbol[:x2l1f1, :x1l1f1]
[ Info: do init of l1
[ Info: [2x0p,d1,N100],
[ Info: try doautoinit! of x3
[ Info: init with useinitfct Symbol[:x2x3f1]
[ Info: do init of x3
[ Info: try doautoinit! of l2
Building Bayes net...
[ Info:
[ Info: Eliminating l1
[ Info: ===============
[ Info:
[ Info: - Removing l1
[ Info:
[ Info: Eliminating l2
[ Info: ===============
[ Info:
Si = Symbol[:x2, :x1]
[ Info: - Removing l2
[ Info:
[ Info: Eliminating x1
[ Info: ===============
[ Info:
[ Info: - Removing x1
[ Info: Looking at x2x1f1
[ Info: - Breaking link x2x1f1->x1...
[ Info: - Original links: Symbol[:x2, :x1]
[ Info: - New links: Symbol[:x2]
[ Info: x2x1f1 still has links to other variables, readding it back...
Si = Symbol[:x3]
Si = Symbol[:x2]
Si = Symbol[:x3]
[ Info:
[ Info: Eliminating x2
[ Info: ===============
[ Info:
[ Info: - Removing x2
[ Info: Looking at x2f1
[ Info: - Breaking link x2f1->x2...
[ Info: - Original links: Symbol[:x2]
[ Info: - New links: Symbol[]
[ Info: x2f1 doesn't have any other links, not adding it back...
[ Info: Looking at x2f2
[ Info: - Breaking link x2f2->x2...
[ Info: - Original links: Symbol[:x2]
[ Info: - New links: Symbol[]
[ Info: x2f2 doesn't have any other links, not adding it back...
[ Info:
[ Info: Eliminating x3
[ Info: ===============
[ Info:
[ Info: - Removing x3
[ Info: Looking at x3f2
[ Info: - Breaking link x3f2->x3...
[ Info: - Original links: Symbol[:x3]
[ Info: - New links: Symbol[]
[ Info: x3f2 doesn't have any other links, not adding it back...
[ Info: Looking at x3f1
[ Info: - Breaking link x3f1->x3...
[ Info: - Original links: Symbol[:x3]
[ Info: - New links: Symbol[]
[ Info: x3f1 doesn't have any other links, not adding it back...
Find potential functions for each clique
[ Info: Get potentials x1,l1,: x2,
[ Info: using all factors among cliq variables
[ Info: finding all frontals for down WIP
[ Info: Get potentials l2,: x3,
[ Info: using all factors among cliq variables
[ Info: finding all frontals for down WIP
[ Info: Get potentials x3,x2,:
[ Info: using all factors among cliq variables
[ Info: finding all frontals for down WIP
[ Info: cliq=1 adding factor that is no in separator, l2
[ Info: cliq=1 adding factor that is no in separator, l1
[ Info: cliq=1 adding factor that is no in separator, x1
┌ Warning: add test tree verification
└ @ Main ~/.julia/packages/IncrementalInference/FweX2/test/testBayesTreeiSAM2Example.jl:73
Building Bayes net...
[ Info:
[ Info: Eliminating x2
[ Info: ===============
[ Info:
[ Info: - Removing x2
Si = Symbol[:l1, :x3, :x1]
[ Info:
[ Info: Eliminating x1
[ Info: ===============
[ Info:
[ Info: - Removing x1
[ Info: Looking at l1x3x1f1
[ Info: - Breaking link l1x3x1f1->x1...
[ Info: - Original links: Symbol[:l1, :x3, :x1]
[ Info: - New links: Symbol[:l1, :x3]
[ Info: l1x3x1f1 still has links to other variables, readding it back...
Si = Symbol[:l1, :x3]
[ Info:
[ Info: Eliminating x3
[ Info: ===============
[ Info:
[ Info: - Removing x3
[ Info: Looking at l1x3f1
[ Info: - Breaking link l1x3f1->x3...
[ Info: - Original links: Symbol[:l1, :x3]
[ Info: - New links: Symbol[:l1]
[ Info: l1x3f1 still has links to other variables, readding it back...
[ Info: Looking at l1x3f2
[ Info: - Breaking link l1x3f2->x3...
[ Info: - Original links: Symbol[:l1, :x3]
[ Info: - New links: Symbol[:l1]
[ Info: l1x3f2 still has links to other variables, readding it back...
Si = Symbol[:l2, :l1]
[ Info:
[ Info: Eliminating l1
[ Info: ===============
[ Info:
[ Info: - Removing l1
[ Info: Looking at l1f2
[ Info: - Breaking link l1f2->l1...
[ Info: - Original links: Symbol[:l1]
[ Info: - New links: Symbol[]
[ Info: l1f2 doesn't have any other links, not adding it back...
[ Info: Looking at l2l1f1
[ Info: - Breaking link l2l1f1->l1...
[ Info: - Original links: Symbol[:l2, :l1]
[ Info: - New links: Symbol[:l2]
[ Info: l2l1f1 still has links to other variables, readding it back...
[ Info: Looking at l1f1
[ Info: - Breaking link l1f1->l1...
[ Info: - Original links: Symbol[:l1]
[ Info: - New links: Symbol[]
[ Info: l1f1 doesn't have any other links, not adding it back...
Si = Symbol[:l2]
[ Info:
[ Info: Eliminating l2
[ Info: ===============
[ Info:
[ Info: - Removing l2
[ Info: Looking at l2f1
[ Info: - Breaking link l2f1->l2...
[ Info: - Original links: Symbol[:l2]
[ Info: - New links: Symbol[]
[ Info: l2f1 doesn't have any other links, not adding it back...
[ Info: Looking at l2f2
[ Info: - Breaking link l2f2->l2...
[ Info: - Original links: Symbol[:l2]
[ Info: - New links: Symbol[]
[ Info: l2f2 doesn't have any other links, not adding it back...
Find potential functions for each clique
[ Info: Get potentials x1,x2,: l1,x3,
[ Info: using all factors among cliq variables
[ Info: finding all frontals for down WIP
[ Info: Get potentials l2,l1,x3,:
[ Info: using all factors among cliq variables
[ Info: finding all frontals for down WIP
[ Info: cliq=1 adding factor that is no in separator, x2
[ Info: cliq=1 adding factor that is no in separator, x1
[ Info: cliq=1 adding factor that is no in separator, x2
Test Summary: | Pass Total
basic Bayes tree construction | 1 1
Test Summary: | Pass Total
Ensure converter types can be run from extending namespaces... | 1 1
┌ Warning: Setting serialization module from AbstractDFG - override this in the 'GraphsDFG{SolverParams} structure! This is being ignored.
└ @ DistributedFactorGraphs ~/.julia/packages/DistributedFactorGraphs/NMxiR/src/services/AbstractDFG.jl:21
[ Info: try doautoinit! of x1
[ Info: try doautoinit! of x1
[ Info: init with useinitfct Symbol[:x1f1]
[ Info: do init of x1
[ Info: try doautoinit! of x2
┌ Warning: Retrieving serialization module from AbstractDFG - override this in the 'GraphsDFG{SolverParams} structure! This is returning Main
└ @ DistributedFactorGraphs ~/.julia/packages/DistributedFactorGraphs/NMxiR/src/services/AbstractDFG.jl:25
Test Summary: | Pass Total
packing converters work... | 8 8
Test Summary: | Pass Total
Ensure lambda's work with NLsolve | 1 1
Test Summary: |
minimalistic pattern on how NLsolve is used in IIF. | No tests
Test Summary: | Pass Total
generic root finding by numeric solve of residual functions... | 1 1
a1 = [-1.0 0.6120516420902307 0.5400050963334027; 0.5825623625070049 0.5065944337036288 0.06621365059030504]
0.217222 seconds (174.01 k allocations: 8.868 MiB)
0.171516 seconds (59.71 k allocations: 2.931 MiB)
0.045254 seconds (16.27 k allocations: 1.127 MiB)
zDim = size(measurement[1], 1) = 1
ccw.varidx = solvefor = 2
1.240833 seconds (924.56 k allocations: 45.552 MiB)
and in the reverse direction, achieved by simply changing CommonConvWrapper.varidx to 1...
ccw.varidx = solvefor = 1
0.004904 seconds (7.76 k allocations: 1.020 MiB)
┌ Warning: test not implemented yet
└ @ Main ~/.julia/packages/IncrementalInference/FweX2/test/testCommonConvWrapper.jl:255
[ Info: try doautoinit! of x1
[ Info: try doautoinit! of x1
[ Info: init with useinitfct Symbol[:x1f1]
[ Info: do init of x1
[ Info: try doautoinit! of x2
Building Bayes net...
[ Info:
[ Info: Eliminating x1
[ Info: ===============
[ Info:
[ Info: - Removing x1
Si = Symbol[:x2]
[ Info:
[ Info: Eliminating x2
[ Info: ===============
[ Info:
[ Info: - Removing x2
[ Info: Looking at x2f1
[ Info: - Breaking link x2f1->x2...
[ Info: - Original links: Symbol[:x2]
[ Info: - New links: Symbol[]
[ Info: x2f1 doesn't have any other links, not adding it back...
Find potential functions for each clique
[ Info: Get potentials x2,x1,:
[ Info: using all factors among cliq variables
[ Info: finding all frontals for down WIP
Bayes Tree
[ Info: Solving over the Bayes (Junction) tree.
Building Bayes net...
[ Info:
[ Info: Eliminating x1
[ Info: ===============
[ Info:
[ Info: - Removing x1
Si = Symbol[:x2]
[ Info:
[ Info: Eliminating x2
[ Info: ===============
[ Info:
[ Info: - Removing x2
[ Info: Looking at x2f1
[ Info: - Breaking link x2f1->x2...
[ Info: - Original links: Symbol[:x2]
[ Info: - New links: Symbol[]
[ Info: x2f1 doesn't have any other links, not adding it back...
Find potential functions for each clique
[ Info: Get potentials x2,x1,:
[ Info: using all factors among cliq variables
[ Info: finding all frontals for down WIP
Bayes Tree
[ Info: Do tree based init-inference on tree
State machine iter=1
State machine iter=2
State machine iter=3
State machine iter=4
State machine iter=5
State machine iter=6
[ Info: up w 0 msgs
[ Info: ---------- successive fnc approx ------------x2,x1,:
[ Info: #1 --
[ Info: ---------- successive fnc approx ------------x2,x1,:
[ Info: #1 --
[ Info: [2x0p,d1,N100],
[ Info: #2 --
[ Info: [2x0p,d1,N100],
[ Info: #3 --
[ Info: [2x0p,d1,N100],
[ Info: fmcmc! -- solverData(vert=x2).inferdim=1.0
[ Info: fmcmc! -- solverData(vert=x1).inferdim=2.0
[ Info: Outgoing msg density on:
[ Info: prepCliqInitMsgsUp, seps=Symbol[]
State machine iter=7
State machine iter=8
[ Info: transferUpdateSubGraph! -- syms=Symbol[:x2, :x1]
[ Info: sym=x2, mem size of val=(1, 100) and (1, 100)
┌ Warning: Deprecated
└ @ IncrementalInference ~/.julia/packages/IncrementalInference/FweX2/src/FactorGraphTypes.jl:362
[ Info: sym=x1, mem size of val=(1, 100) and (1, 100)
┌ Warning: Deprecated
└ @ IncrementalInference ~/.julia/packages/IncrementalInference/FweX2/src/FactorGraphTypes.jl:362
State machine iter=9
[ Info: Finished tree based init-inference
Test Summary: | Pass Total
GenericWrapParam functors... | 114 114
[ Info: try doautoinit! of x1
[ Info: try doautoinit! of x1
[ Info: init with useinitfct Symbol[:x1f1]
[ Info: do init of x1
[ Info: try doautoinit! of x2
Statistics.mean(pts, dims=2) = [49.42010893283766]
[ Info: Solving over the Bayes (Junction) tree.
Building Bayes net...
[ Info:
[ Info: Eliminating x1
[ Info: ===============
[ Info:
[ Info: - Removing x1
[ Info:
[ Info: Eliminating x2
[ Info: ===============
[ Info:
[ Info: - Removing x2
[ Info: Looking at x2f1
[ Info: - Breaking link x2f1->x2...
[ Info: - Original links: Symbol[:x2]
[ Info: - New links: Symbol[]
[ Info: x2f1 doesn't have any other links, not adding it back...
[ Info: Get potentials x2,x1,:
[ Info: using all factors among cliq variables
Si = Symbol[:x2]
Find potential functions for each clique
[ Info: finding all frontals for down WIP
[ Info: Do tree based init-inference on tree
Bayes Tree
State machine iter=1
State machine iter=2
State machine iter=3
State machine iter=4
State machine iter=5
State machine iter=6
[ Info: up w 0 msgs
[ Info: ---------- successive fnc approx ------------x2,x1,:
[ Info: #1 --
[ Info: ---------- successive fnc approx ------------x2,x1,:
[ Info: #1 --
[ Info: [2x0p,d1,N100],
[ Info: #2 --
[ Info: [2x0p,d1,N100],
[ Info: #3 --
[ Info: [2x0p,d1,N100],
[ Info: fmcmc! -- solverData(vert=x2).inferdim=1.0
[ Info: fmcmc! -- solverData(vert=x1).inferdim=2.0
[ Info: Outgoing msg density on:
[ Info: prepCliqInitMsgsUp, seps=Symbol[]
State machine iter=7
State machine iter=8
[ Info: transferUpdateSubGraph! -- syms=Symbol[:x2, :x1]
[ Info: sym=x2, mem size of val=(1, 100) and (1, 100)
┌ Warning: Deprecated
└ @ IncrementalInference ~/.julia/packages/IncrementalInference/FweX2/src/FactorGraphTypes.jl:362
[ Info: sym=x1, mem size of val=(1, 100) and (1, 100)
┌ Warning: Deprecated
└ @ IncrementalInference ~/.julia/packages/IncrementalInference/FweX2/src/FactorGraphTypes.jl:362
State machine iter=9
[ Info: Finished tree based init-inference
Test Summary: | Pass Total
with simple local constraint examples Odo, Obsv2... | 2 2
[ Info: try doautoinit! of x1
[ Info: try doautoinit! of x1
[ Info: init with useinitfct Symbol[:x1f1]
[ Info: do init of x1
[ Info: try doautoinit! of x2
Test Summary: | Pass Total
test default userdata::FactorMetadata... | 2 2
Test Summary: | Pass Total
test IncrementalInference.assembleHypothesesElements! without multihypothesis... | 16 16
Test Summary: | Pass Total
test IncrementalInference.assembleHypothesesElements! with bi-modality... | 48 48
┌ Warning: only partially testing tri-modality
└ @ Main ~/.julia/packages/IncrementalInference/FweX2/test/testExplicitMultihypo.jl:321
Test Summary: | Pass Total
test IncrementalInference.assembleHypothesesElements! with tri-modality... | 84 84
[ Info: try doautoinit! of l1
[ Info: try doautoinit! of l2
[ Info: try doautoinit! of x1
[ Info: try doautoinit! of l1
[ Info: init with useinitfct Symbol[:l1f1]
[ Info: do init of l1
[ Info: try doautoinit! of l1_0
[ Info: try doautoinit! of x1
[ Info: allowing init from incomplete set of previously initialized hypotheses, fct=x1l1l1_0f1
[ Info: init with useinitfct Symbol[:x1l1l1_0f1]
[ Info: do init of x1
[ Info: not all hypotheses initialized, but at least one available -- see #427
[ Info: try doautoinit! of x2
[ Info: try doautoinit! of x2
[ Info: init with useinitfct Symbol[:x1x2f1]
[ Info: do init of x2
[ Info: try doautoinit! of l2
[ Info: allowing init from incomplete set of previously initialized hypotheses, fct=x2l2l2_0f1
[ Info: init with useinitfct Symbol[:x2l2l2_0f1, :l2f1]
[ Info: do init of l2
[ Info: not all hypotheses initialized, but at least one available -- see #427
[ Info: [2x0p,d1,N100],
[ Info: try doautoinit! of l2_0
[ Info: Solving over the Bayes (Junction) tree.
Building Bayes net...
[ Info:
[ Info: Eliminating x1
[ Info: ===============
[ Info:
[ Info: - Removing x1
[ Info:
[ Info: Eliminating l2
[ Info: ===============
[ Info:
Si = Symbol[:x2, :l1, :l1_0]
[ Info: - Removing l2
Si = Symbol[:x2, :l2_0]
[ Info:
[ Info: Eliminating l1
[ Info: ===============
[ Info:
[ Info: - Removing l1
[ Info: Looking at x2l1l1_0f1
[ Info: - Breaking link x2l1l1_0f1->l1...
[ Info: - Original links: Symbol[:x2, :l1, :l1_0]
[ Info: - New links: Symbol[:x2, :l1_0]
[ Info: x2l1l1_0f1 still has links to other variables, readding it back...
Si = Symbol[:x2, :l1_0]
Si = Symbol[:l2_0, :l1_0]
[ Info:
[ Info: Eliminating x2
[ Info: ===============
[ Info:
[ Info: - Removing x2
[ Info: Looking at x2l2_0f1
[ Info: - Breaking link x2l2_0f1->x2...
[ Info: - Original links: Symbol[:x2, :l2_0]
[ Info: - New links: Symbol[:l2_0]
[ Info: x2l2_0f1 still has links to other variables, readding it back...
[ Info: Looking at x2l1_0f1
[ Info: - Breaking link x2l1_0f1->x2...
[ Info: - Original links: Symbol[:x2, :l1_0]
[ Info: - New links: Symbol[:l1_0]
[ Info: x2l1_0f1 still has links to other variables, readding it back...
[ Info: Looking at x2l1_0f2
[ Info: - Breaking link x2l1_0f2->x2...
[ Info: - Original links: Symbol[:x2, :l1_0]
[ Info: - New links: Symbol[:l1_0]
[ Info: x2l1_0f2 still has links to other variables, readding it back...
[ Info:
[ Info: Eliminating l2_0
[ Info: ===============
[ Info:
[ Info: - Removing l2_0
[ Info: Looking at l2_0f1
[ Info: - Breaking link l2_0f1->l2_0...
[ Info: - Original links: Symbol[:l2_0]
[ Info: - New links: Symbol[]
[ Info: l2_0f1 doesn't have any other links, not adding it back...
[ Info: Looking at l2_0l1_0f1
[ Info: - Breaking link l2_0l1_0f1->l2_0...
[ Info: - Original links: Symbol[:l2_0, :l1_0]
[ Info: - New links: Symbol[:l1_0]
[ Info: l2_0l1_0f1 still has links to other variables, readding it back...
[ Info:
[ Info: Eliminating l1_0
[ Info: ===============
[ Info:
[ Info: - Removing l1_0
[ Info: Looking at l1_0f2
[ Info: - Breaking link l1_0f2->l1_0...
[ Info: - Original links: Symbol[:l1_0]
[ Info: - New links: Symbol[]
[ Info: l1_0f2 doesn't have any other links, not adding it back...
[ Info: Looking at l1_0f4
[ Info: - Breaking link l1_0f4->l1_0...
[ Info: - Original links: Symbol[:l1_0]
[ Info: - New links: Symbol[]
[ Info: l1_0f4 doesn't have any other links, not adding it back...
[ Info: Looking at l1_0f1
[ Info: - Breaking link l1_0f1->l1_0...
[ Info: - Original links: Symbol[:l1_0]
[ Info: - New links: Symbol[]
[ Info: l1_0f1 doesn't have any other links, not adding it back...
[ Info: Looking at l1_0f3
[ Info: - Breaking link l1_0f3->l1_0...
[ Info: - Original links: Symbol[:l1_0]
[ Info: - New links: Symbol[]
[ Info: l1_0f3 doesn't have any other links, not adding it back...
[ Info: Get potentials l1,x1,: x2,l1_0,
[ Info: using all factors among cliq variables
[ Info: finding all frontals for down WIP
[ Info: Get potentials l2,: x2,l2_0,
[ Info: using all factors among cliq variables
[ Info: finding all frontals for down WIP
[ Info: Get potentials l1_0,l2_0,x2,:
[ Info: using all factors among cliq variables
Si = Symbol[:l1_0]
Find potential functions for each clique
[ Info: finding all frontals for down WIP
[ Info: cliq=1 adding factor that is no in separator, x1
[ Info: cliq=1 adding factor that is no in separator, l1
[ Info: cliq=1 adding factor that is no in separator, l2
[ Info: cliq=1 adding factor that is no in separator, l2
[ Info: cliq=1 adding factor that is no in separator, x1
Bayes Tree
[ Info: Do tree based init-inference on tree
State machine iter=1
State machine iter=2
State machine iter=3
State machine iter=4
State machine iter=1
State machine iter=2
State machine iter=3
State machine iter=4
State machine iter=5
State machine iter=6
State machine iter=7
State machine iter=8
[ Info: up w 0 msgs
[ Info: ---------- successive fnc approx ------------l1,x1,: x2,l1_0,
[ Info: #1 --
State machine iter=1
State machine iter=2
State machine iter=3[ Info: ---------- successive fnc approx ------------l1,x1,: x2,l1_0,
[ Info: #1 --
[ Info: [2x0p,d1,N100],
State machine iter=4[ Info: [2x0p,d1,N100],
[ Info: #2 --
[ Info: [2x0p,d1,N100],
State machine iter=5
[ Info: [2x0p,d1,N100],
State machine iter=6[ Info: #3 --
[ Info: [2x0p,d1,N100],
[ Info: [2x0p,d1,N100],
State machine iter=7[ Info: fmcmc! -- solverData(vert=x2).inferdim=0.0
[ Info: fmcmc! -- solverData(vert=l1_0).inferdim=0.0
State machine iter=8
[ Info: fmcmc! -- solverData(vert=l1).inferdim=1.0
[ Info: fmcmc! -- solverData(vert=x1).inferdim=0.0
[ Info: up w 0 msgs
[ Info: Outgoing msg density on:
[ Info: ---------- successive fnc approx ------------l2,: x2,l2_0,
[ Info: prepCliqInitMsgsUp, seps=Symbol[:x2, :l1_0]
[ Info: #1 --
[ Info: ---------- successive fnc approx ------------l2,: x2,l2_0,
[ Info: #1 --
[ Info: [2x0p,d1,N100],
[ Info: #2 --
[ Info: [2x0p,d1,N100],
State machine iter=9[ Info: #3 --
[ Info: [2x0p,d1,N100],
State machine iter=10
[ Info: fmcmc! -- solverData(vert=x2).inferdim=0.0
[ Info: fmcmc! -- solverData(vert=l2_0).inferdim=0.0
[ Info: fmcmc! -- solverData(vert=l2).inferdim=1.0
[ Info: Outgoing msg density on:
[ Info: prepCliqInitMsgsUp, seps=Symbol[:x2, :l2_0]
State machine iter=5
State machine iter=6
[ Info: up w 2 msgs
State machine iter=9
[ Info: inp.sendmsgs[x2].inferdim=0.0
[ Info: inp.sendmsgs[l1_0].inferdim=0.0
State machine iter=10[ Info: inp.sendmsgs[l2_0].inferdim=0.0
[ Info: inp.sendmsgs[x2].inferdim=0.0
[ Info: ---------- successive fnc approx ------------l1_0,l2_0,x2,:
[ Info: #1 --
[ Info: fmcmc! -- solverData(vert=l1_0).inferdim=0.0
[ Info: fmcmc! -- solverData(vert=l2_0).inferdim=0.0
[ Info: ---------- successive fnc approx ------------l1_0,l2_0,x2,:
[ Info: #1 --
[ Info: [2x0p,d1,N100],
[ Info: fmcmc! -- solverData(vert=l1_0).inferdim=0.0
[ Info: fmcmc! -- solverData(vert=l2_0).inferdim=0.0
[ Info: fmcmc! -- solverData(vert=x2).inferdim=0.0
[ Info: Outgoing msg density on:
[ Info: prepCliqInitMsgsUp, seps=Symbol[]
State machine iter=7
State machine iter=8
[ Info: transferUpdateSubGraph! -- syms=Symbol[:l1_0, :l2_0, :x2]
[ Info: sym=l1_0, mem size of val=(1, 100) and (1, 100)
┌ Warning: Deprecated
└ @ IncrementalInference ~/.julia/packages/IncrementalInference/FweX2/src/FactorGraphTypes.jl:362
[ Info: sym=l2_0, mem size of val=(1, 100) and (1, 100)
┌ Warning: Deprecated
└ @ IncrementalInference ~/.julia/packages/IncrementalInference/FweX2/src/FactorGraphTypes.jl:362
[ Info: sym=x2, mem size of val=(1, 100) and (1, 100)
┌ Warning: Deprecated
└ @ IncrementalInference ~/.julia/packages/IncrementalInference/FweX2/src/FactorGraphTypes.jl:362
State machine iter=11
State machine iter=11[ Info: [2x0p,d1,N100],
[ Info: [2x0p,d1,N100],
[ Info: [2x0p,d1,N100],
State machine iter=9[ Info: [2x0p,d1,N100],
[ Info: [2x0p,d1,N100],
[ Info: [2x0p,d1,N100],
[ Info: [2x0p,d1,N100],
State machine iter=12
State machine iter=12
[ Info: Finished tree based init-inference
Test Summary: |
test CSM runaway on upsolve, (issue 427) | No tests
[ Info: try doautoinit! of l0
[ Info: try doautoinit! of l1
[ Info: try doautoinit! of x0
[ Info: try doautoinit! of l0
[ Info: init with useinitfct Symbol[:l0f1]
[ Info: do init of l0
[ Info: try doautoinit! of l1
[ Info: init with useinitfct Symbol[:l1f1]
[ Info: do init of l1
[ Info: try doautoinit! of x0
[ Info: init with useinitfct Symbol[:x0l0l1f1]
[ Info: do init of x0
[ Info: try doautoinit! of x1
[ Info: try doautoinit! of x1
[ Info: init with useinitfct Symbol[:x1l0l1f1, :x0x1f1]
[ Info: do init of x1
[ Info: [2x0p,d1,N200],
[ Info: try doautoinit! of x2
[ Info: Solving over the Bayes (Junction) tree.
Building Bayes net...
[ Info:
[ Info: Eliminating x1
[ Info: ===============
[ Info:
[ Info: - Removing x1
Si = Symbol[:x2, :l0, :l1, :x0]
[ Info:
[ Info: Eliminating l1
[ Info: ===============
[ Info:
[ Info: - Removing l1
[ Info: Looking at x2l0l1x0f1
[ Info: - Breaking link x2l0l1x0f1->l1...
[ Info: - Original links: Symbol[:x2, :l0, :l1, :x0]
[ Info: - New links: Symbol[:x2, :l0, :x0]
[ Info: x2l0l1x0f1 still has links to other variables, readding it back...
Si = Symbol[:x0, :l0, :x2]
[ Info:
[ Info: Eliminating l0
[ Info: ===============
[ Info:
[ Info: - Removing l0
[ Info: Looking at x2l0x0f1
[ Info: - Breaking link x2l0x0f1->l0...
[ Info: - Original links: Symbol[:x2, :l0, :x0]
[ Info: - New links: Symbol[:x2, :x0]
[ Info: x2l0x0f1 still has links to other variables, readding it back...
[ Info: Looking at x0l0x2f1
[ Info: - Breaking link x0l0x2f1->l0...
[ Info: - Original links: Symbol[:x0, :l0, :x2]
[ Info: - New links: Symbol[:x0, :x2]
[ Info: x0l0x2f1 still has links to other variables, readding it back...
Si = Symbol[:x2, :x0]
[ Info:
[ Info: Eliminating x0
[ Info: ===============
[ Info:
[ Info: - Removing x0
[ Info: Looking at x0x2f1
[ Info: - Breaking link x0x2f1->x0...
[ Info: - Original links: Symbol[:x0, :x2]
[ Info: - New links: Symbol[:x2]
[ Info: x0x2f1 still has links to other variables, readding it back...
[ Info: Looking at x2x0f2
[ Info: - Breaking link x2x0f2->x0...
[ Info: - Original links: Symbol[:x2, :x0]
[ Info: - New links: Symbol[:x2]
[ Info: x2x0f2 still has links to other variables, readding it back...
[ Info: Looking at x2x0f1
[ Info: - Breaking link x2x0f1->x0...
[ Info: - Original links: Symbol[:x2, :x0]
[ Info: - New links: Symbol[:x2]
[ Info: x2x0f1 still has links to other variables, readding it back...
Si = Symbol[:x2]
[ Info:
[ Info: Eliminating x2
[ Info: ===============
[ Info:
[ Info: - Removing x2
[ Info: Looking at x2f1
[ Info: - Breaking link x2f1->x2...
[ Info: - Original links: Symbol[:x2]
[ Info: - New links: Symbol[]
[ Info: x2f1 doesn't have any other links, not adding it back...
[ Info: Looking at x2f4
[ Info: - Breaking link x2f4->x2...
[ Info: - Original links: Symbol[:x2]
[ Info: - New links: Symbol[]
[ Info: x2f4 doesn't have any other links, not adding it back...
[ Info: Looking at x2f2
[ Info: - Breaking link x2f2->x2...
[ Info: - Original links: Symbol[:x2]
[ Info: - New links: Symbol[]
[ Info: x2f2 doesn't have any other links, not adding it back...
[ Info: Looking at x2f3
[ Info: - Breaking link x2f3->x2...
[ Info: - Original links: Symbol[:x2]
[ Info: - New links: Symbol[]
[ Info: x2f3 doesn't have any other links, not adding it back...
Find potential functions for each clique
[ Info: Get potentials x2,x0,l0,l1,x1,:
[ Info: using all factors among cliq variables
[ Info: finding all frontals for down WIP
Bayes Tree
[ Info: Do tree based init-inference on tree
State machine iter=1
State machine iter=2
State machine iter=3
State machine iter=4
State machine iter=5
State machine iter=6
[ Info: up w 0 msgs
[ Info: ---------- successive fnc approx ------------x2,x0,l0,l1,x1,:
[ Info: #1 --
[ Info: ---------- successive fnc approx ------------x2,x0,l0,l1,x1,:
[ Info: #1 --
[ Info: [2x0p,d1,N200],
[ Info: [3x0p,d1,N200],
[ Info: [3x0p,d1,N200],
[ Info: [3x0p,d1,N200],
[ Info: #2 --
[ Info: [2x0p,d1,N200],
[ Info: [3x0p,d1,N200],
[ Info: [3x0p,d1,N200],
[ Info: [3x0p,d1,N200],
[ Info: #3 --
[ Info: [2x0p,d1,N200],
[ Info: [3x0p,d1,N200],
[ Info: [3x0p,d1,N200],
[ Info: [3x0p,d1,N200],
[ Info: fmcmc! -- solverData(vert=x2).inferdim=1.0
[ Info: fmcmc! -- solverData(vert=x0).inferdim=2.0
[ Info: fmcmc! -- solverData(vert=l0).inferdim=3.0
[ Info: fmcmc! -- solverData(vert=l1).inferdim=3.0
[ Info: fmcmc! -- solverData(vert=x1).inferdim=3.0
[ Info: Outgoing msg density on:
[ Info: prepCliqInitMsgsUp, seps=Symbol[]
State machine iter=7
State machine iter=8
[ Info: transferUpdateSubGraph! -- syms=Symbol[:x2, :x0, :l0, :l1, :x1]
[ Info: sym=x2, mem size of val=(1, 200) and (1, 200)
┌ Warning: Deprecated
└ @ IncrementalInference ~/.julia/packages/IncrementalInference/FweX2/src/FactorGraphTypes.jl:362
[ Info: sym=x0, mem size of val=(1, 200) and (1, 200)
┌ Warning: Deprecated
└ @ IncrementalInference ~/.julia/packages/IncrementalInference/FweX2/src/FactorGraphTypes.jl:362
[ Info: sym=l0, mem size of val=(1, 200) and (1, 200)
┌ Warning: Deprecated
└ @ IncrementalInference ~/.julia/packages/IncrementalInference/FweX2/src/FactorGraphTypes.jl:362
[ Info: sym=l1, mem size of val=(1, 200) and (1, 200)
┌ Warning: Deprecated
└ @ IncrementalInference ~/.julia/packages/IncrementalInference/FweX2/src/FactorGraphTypes.jl:362
[ Info: sym=x1, mem size of val=(1, 200) and (1, 200)
┌ Warning: Deprecated
└ @ IncrementalInference ~/.julia/packages/IncrementalInference/FweX2/src/FactorGraphTypes.jl:362
State machine iter=9
[ Info: Finished tree based init-inference
Test Summary: | Pass Total
2door basic binary multihypothesis tests... | 5 5
Threads.nthreads() = 1
[ Info: try doautoinit! of x0
[ Info: try doautoinit! of x0
[ Info: init with useinitfct Symbol[:x0f1]
[ Info: do init of x0
[ Info: try doautoinit! of x1
Test Summary: | Pass Total
Basic ContinuousScalar example to ensure multithreaded convolutions work... | 1 1
maniT = if length(manifolds) < x
([manifolds[1] for i = 1:x]...,)
else
manifolds
end = (:Euclid, :Euclid)
[ Info: try doautoinit! of x1
[ Info: try doautoinit! of x1
[ Info: init with useinitfct Symbol[:x1f1, :x1f2]
[ Info: do init of x1
[ Info: [1x1p,d2,N100],
Building Bayes net...
[ Info:
[ Info: Eliminating x1
[ Info: ===============
[ Info:
[ Info: - Removing x1
Find potential functions for each clique
[ Info: Get potentials x1,:
[ Info: using all factors among cliq variables
[ Info: finding all frontals for down WIP
Bayes Tree
[ Info: Solving over the Bayes (Junction) tree.
[ Info: Do tree based init-inference on tree
State machine iter=1
State machine iter=2
State machine iter=3
State machine iter=4
State machine iter=5
State machine iter=6
[ Info: up w 0 msgs
[ Info: ---------- successive fnc approx ------------x1,:
[ Info: #1 --
[ Info: ---------- successive fnc approx ------------x1,:
[ Info: #1 --
[ Info: [1x1p,d2,N100],
[ Info: fmcmc! -- solverData(vert=x1).inferdim=2.0
[ Info: Outgoing msg density on:
[ Info: prepCliqInitMsgsUp, seps=Symbol[]
State machine iter=7
State machine iter=8
[ Info: transferUpdateSubGraph! -- syms=Symbol[:x1]
[ Info: sym=x1, mem size of val=(2, 100) and (2, 100)
┌ Warning: Deprecated
└ @ IncrementalInference ~/.julia/packages/IncrementalInference/FweX2/src/FactorGraphTypes.jl:362
State machine iter=9
[ Info: Finished tree based init-inference
maniT = if length(manifolds) < x
([manifolds[1] for i = 1:x]...,)
else
manifolds
end = (:Euclid, :Euclid)
[ Info: try doautoinit! of x2
[ Info: try doautoinit! of x2
[ Info: init with useinitfct Symbol[:x1x2f1, :x2f1]
[ Info: do init of x2
[ Info: [0x2p,d2,N100],
┌ Warning: restore findRelatedFromPotential as testset!
└ @ Main ~/.julia/packages/IncrementalInference/FweX2/test/testpartialconstraint.jl:122
X2lpts[2, 95:100] = [8.458691957045868, 10.824504774478573, 9.883089427131246, 11.290235333713328, 9.696850821620373, 10.004781980972666]
lpts[2, 95:100] = [11.215056516025854, 10.239486327795605, 8.2886935165211, 11.454175807140377, 9.254992742969256, 9.321708837475814]
getPoints(keepaside) = [-20.738894670691614 -20.14918856834099 -20.553830786793554 -22.129219034712413 -20.448980311733568 -20.78137371780742 -21.380440746689665 -20.28866848587163 -18.619960449047326 -20.129083574458093 -18.305635591886258 -18.575810447695783 -18.562875489606558 -18.746356273365812 -20.25693006091217 -22.130071508197616 -19.701046225073767 -18.727530383238413 -20.269425027872593 -21.14142895131164 -21.011126144104487 -19.49957912107158 -19.524957202119687 -19.924325877849913 -20.367321923257382 -22.35941303538186 -20.400005941557822 -19.627788403705125 -18.574329785885425 -19.68128642316373 -20.710431077634993 -20.16410067322358 -17.27189184777665 -20.214026906680854 -17.62548636235896 -19.664257364554427 -20.825496663711355 -20.58978386166576 -20.37754477468175 -20.19419124518873 -21.374609456053104 -20.04870644029049 -19.979697357550755 -20.31597811564179 -20.291098635022085 -19.11323413085502 -20.539792725015936 -20.001634549702636 -20.344059161201695 -18.586948169394944 -20.877782097025015 -20.61815328642079 -18.497310554001714 -18.844914522213962 -20.339689482779516 -18.866701645180125 -18.47213681157701 -18.875569479774867 -20.024632042568445 -21.581552878963542 -19.847395987723406 -19.73252101822618 -19.703236826151038 -19.237519323555187 -19.06485054152765 -22.055996493218714 -20.15875416496896 -21.132158916452703 -19.89873796375868 -19.21514356707684 -20.82101953858283 -20.05773021904113 -20.38118146724673 -19.13443997887327 -20.321105150139434 -19.059777159839726 -22.33502959372456 -20.95479554224382 -21.32498246320585 -19.68061247859119 -17.256625524045454 -22.189128856760778 -20.722762650456723 -20.613034670279852 -20.904033259181205 -19.165933382394194 -20.70372105752283 -19.046815149222205 -19.568606103388916 -20.014003031388544 -22.176322140304872 -20.97791900892903 -19.353775730156205 -20.904615283841338 -19.881931227846156 -18.241825926708994 -19.60751300338834 -18.534222357326648 -20.175337855506214 -20.676534955219417; 9.74320968065381 9.763052659481751 8.10554535027521 9.83180990075091 10.338541569510044 10.92741105384606 10.32618383489817 11.462985977838171 9.831289603765464 9.847734455970617 9.649680740323788 9.543661570791366 10.240960130633539 9.389849620036413 9.922715301707163 9.483905156308852 11.009697609002671 9.349743501726113 8.231577463605984 9.453138007429477 10.051803362420053 10.481413060270503 10.061349879828105 9.079728828527834 10.537689603666465 10.103038569417542 12.368377339282025 11.102776828288018 10.491007006996888 9.630700020675281 8.843840085899163 8.856015437174436 10.615621330295678 9.666044258654457 8.978115028116271 10.437723101026668 7.899503052862608 11.260833898741582 9.660543835515782 8.885269012249646 10.231889197281916 9.125281530957327 10.439870603002584 10.94158735364399 10.896099490097871 10.004388064665127 9.844393009821696 10.903950260534689 8.692851204320633 9.556231449650149 9.777458975148388 10.836688275334613 10.080929587768868 10.91915811121357 8.918216138524464 9.249093075324433 10.739489520295196 9.377278038957563 9.418729270699199 9.664847154789818 10.896063867721738 10.190283020493682 10.478359834553583 11.04372666004655 10.264189646872985 8.158540451052518 10.204569611888635 9.456117229792712 11.383002771424874 8.236739565339496 10.188043141866915 9.276543385374328 11.214397807561735 9.678387010420339 10.297365515011688 9.817944828943185 10.403810156661784 10.524127962021721 12.283605295064868 10.29943517202448 10.661336051606304 11.826925252722031 8.178919902379128 9.899828632030335 9.535267392393429 10.86016240303858 9.680685106824356 11.086682060071945 11.26685293966454 10.564370628078024 10.87035082315972 10.679634358363225 9.11493046265642 10.74252983456545 11.215056516025854 10.239486327795605 8.2886935165211 11.454175807140377 9.254992742969256 9.321708837475814]
[ Info: [0x1p,d2,N100],
[ Info: [0x1p,d2,N100],
[ Info: [0x2p,d2,N100],
Building Bayes net...
[ Info:
[ Info: Eliminating x1
[ Info: ===============
[ Info:
[ Info: - Removing x1
Si = Symbol[:x2]
[ Info:
[ Info: Eliminating x2
[ Info: ===============
[ Info:
[ Info: - Removing x2
[ Info: Looking at x2f2
[ Info: - Breaking link x2f2->x2...
[ Info: - Original links: Symbol[:x2]
[ Info: - New links: Symbol[]
[ Info: x2f2 doesn't have any other links, not adding it back...
Find potential functions for each clique
[ Info: Get potentials x2,x1,:
[ Info: using all factors among cliq variables
[ Info: finding all frontals for down WIP
Bayes Tree
[ Info: Solving over the Bayes (Junction) tree.
[ Info: Do tree based init-inference on tree
State machine iter=1
State machine iter=2
State machine iter=3
State machine iter=4
State machine iter=5
State machine iter=6
[ Info: up w 0 msgs
[ Info: ---------- successive fnc approx ------------x2,x1,:
[ Info: #1 --
[ Info: ---------- successive fnc approx ------------x2,x1,:
[ Info: #1 --
[ Info: [0x2p,d2,N100],
[ Info: [1x2p,d2,N100],
[ Info: #2 --
[ Info: [0x2p,d2,N100],
[ Info: [1x2p,d2,N100],
[ Info: #3 --
[ Info: [0x2p,d2,N100],
[ Info: [1x2p,d2,N100],
[ Info: fmcmc! -- solverData(vert=x2).inferdim=0.0
[ Info: fmcmc! -- solverData(vert=x1).inferdim=2.0
[ Info: Outgoing msg density on:
[ Info: prepCliqInitMsgsUp, seps=Symbol[]
State machine iter=7
State machine iter=8
[ Info: transferUpdateSubGraph! -- syms=Symbol[:x2, :x1]
[ Info: sym=x2, mem size of val=(2, 100) and (2, 100)
┌ Warning: Deprecated
└ @ IncrementalInference ~/.julia/packages/IncrementalInference/FweX2/src/FactorGraphTypes.jl:362
[ Info: sym=x1, mem size of val=(2, 100) and (2, 100)
┌ Warning: Deprecated
└ @ IncrementalInference ~/.julia/packages/IncrementalInference/FweX2/src/FactorGraphTypes.jl:362
State machine iter=9
[ Info: Finished tree based init-inference
Test Summary: | Pass Total
partial constraints... | 42 42
[ Info: try doautoinit! of x1
┌ Warning: FunctorSingletonNH will be deprecated in favor of common `nullhypo=` interface.
└ @ IncrementalInference ~/.julia/packages/IncrementalInference/FweX2/src/ApproxConv.jl:273
Test Summary: | Pass Total
null hypothesis... | 2 2
[ Info: try doautoinit! of x1
[ Info: x1 is not initialized, and will do so now...
[ Info: try doautoinit! of x1
[ Info: init with useinitfct Symbol[:x1f1]
[ Info: do init of x1
[ Info: try doautoinit! of x2
[ Info: x2 is not initialized, and will do so now...
[ Info: try doautoinit! of x2
[ Info: init with useinitfct Symbol[:x1x2f1]
[ Info: do init of x2
[ Info: try doautoinit! of x3
[ Info: try doautoinit! of x4
Packing converters
[ Info: try doautoinit! of x1
[ Info: x1 is not initialized, and will do so now...
[ Info: try doautoinit! of x1
[ Info: init with useinitfct Symbol[:x1f1]
[ Info: do init of x1
[ Info: try doautoinit! of x2
[ Info: x2 is not initialized, and will do so now...
[ Info: try doautoinit! of x2
[ Info: init with useinitfct Symbol[:x1x2f1]
[ Info: do init of x2
[ Info: try doautoinit! of x3
[ Info: try doautoinit! of x4
[ Info: try doautoinit! of x5
Test Summary: | Pass Total
standardized multihypothesis... | 32 32
[ Info: try doautoinit! of x0
[ Info: try doautoinit! of x0
[ Info: init with useinitfct Symbol[:x0f1]
[ Info: do init of x0
[ Info: try doautoinit! of x2
[ Info: try doautoinit! of x2
[ Info: init with useinitfct Symbol[:x0x2f1]
[ Info: do init of x2
[ Info: try doautoinit! of x3
[ Info: try doautoinit! of x3
[ Info: init with useinitfct Symbol[:x3f1, :x2x3f1]
[ Info: do init of x3
[ Info: [2x0p,d1,N100],
[ Info: try doautoinit! of x4
[ Info: try doautoinit! of l1
[ Info: try doautoinit! of x4
[ Info: init with useinitfct Symbol[:x3x4f1]
[ Info: do init of x4
[ Info: try doautoinit! of l1
[ Info: init with useinitfct Symbol[:x3l1f1, :x4l1f1]
[ Info: do init of l1
[ Info: [2x0p,d1,N100],
[ Info: try doautoinit! of x5
[ Info: try doautoinit! of x5
[ Info: init with useinitfct Symbol[:x4x5f1]
[ Info: do init of x5
[ Info: try doautoinit! of x6
[ Info: try doautoinit! of x6
[ Info: init with useinitfct Symbol[:x5x6f1]
[ Info: do init of x6
[ Info: try doautoinit! of x7
[ Info: try doautoinit! of x7
[ Info: init with useinitfct Symbol[:x6x7f1, :x7f1]
[ Info: do init of x7
[ Info: [2x0p,d1,N100],
[ Info: Solving over the Bayes (Junction) tree.
Building Bayes net...
[ Info:
[ Info: Eliminating x3
[ Info: ===============
[ Info:
Si = Symbol[:l1, :x4, :x2]
[ Info: - Removing x3
[ Info:
[ Info: Eliminating x4
[ Info: ===============
[ Info:
[ Info: - Removing x4
[ Info: Looking at l1x4x2f1
[ Info: - Breaking link l1x4x2f1->x4...
[ Info: - Original links: Symbol[:l1, :x4, :x2]
[ Info: - New links: Symbol[:l1, :x2]
[ Info: l1x4x2f1 still has links to other variables, readding it back...
Si = Symbol[:l1, :x2, :x5]
[ Info:
[ Info: Eliminating x7
[ Info: ===============
[ Info:
[ Info: - Removing x7
Si = Symbol[:x6]
[ Info:
[ Info: Eliminating x0
[ Info: ===============
[ Info:
[ Info: - Removing x0
Si = Symbol[:x2]
[ Info:
[ Info: Eliminating x5
[ Info: ===============
[ Info:
[ Info: - Removing x5
[ Info: Looking at l1x2x5f1
[ Info: - Breaking link l1x2x5f1->x5...
[ Info: - Original links: Symbol[:l1, :x2, :x5]
[ Info: - New links: Symbol[:l1, :x2]
[ Info: l1x2x5f1 still has links to other variables, readding it back...
Si = Symbol[:x6, :l1, :x2]
[ Info:
[ Info: Eliminating l1
[ Info: ===============
[ Info:
[ Info: - Removing l1
[ Info: Looking at l1x2f1
[ Info: - Breaking link l1x2f1->l1...
[ Info: - Original links: Symbol[:l1, :x2]
[ Info: - New links: Symbol[:x2]
[ Info: l1x2f1 still has links to other variables, readding it back...
[ Info: Looking at l1x2f2
[ Info: - Breaking link l1x2f2->l1...
[ Info: - Original links: Symbol[:l1, :x2]
[ Info: - New links: Symbol[:x2]
[ Info: l1x2f2 still has links to other variables, readding it back...
[ Info: Looking at x6l1x2f1
[ Info: - Breaking link x6l1x2f1->l1...
[ Info: - Original links: Symbol[:x6, :l1, :x2]
[ Info: - New links: Symbol[:x6, :x2]
[ Info: x6l1x2f1 still has links to other variables, readding it back...
Si = Symbol[:x2, :x6]
[ Info:
[ Info: Eliminating x2
[ Info: ===============
[ Info:
[ Info: - Removing x2
[ Info: Looking at x2x6f1
[ Info: - Breaking link x2x6f1->x2...
[ Info: - Original links: Symbol[:x2, :x6]
[ Info: - New links: Symbol[:x6]
[ Info: x2x6f1 still has links to other variables, readding it back...
[ Info: Looking at x6x2f1
[ Info: - Breaking link x6x2f1->x2...
[ Info: - Original links: Symbol[:x6, :x2]
[ Info: - New links: Symbol[:x6]
[ Info: x6x2f1 still has links to other variables, readding it back...
[ Info: Looking at x2f1
[ Info: - Breaking link x2f1->x2...
[ Info: - Original links: Symbol[:x2]
[ Info: - New links: Symbol[]
[ Info: x2f1 doesn't have any other links, not adding it back...
[ Info: Looking at x2f3
[ Info: - Breaking link x2f3->x2...
[ Info: - Original links: Symbol[:x2]
[ Info: - New links: Symbol[]
[ Info: x2f3 doesn't have any other links, not adding it back...
[ Info: Looking at x2f2
[ Info: - Breaking link x2f2->x2...
[ Info: - Original links: Symbol[:x2]
[ Info: - New links: Symbol[]
[ Info: x2f2 doesn't have any other links, not adding it back...
Si = Symbol[:x6]
[ Info:
[ Info: Eliminating x6
[ Info: ===============
[ Info:
[ Info: - Removing x6
[ Info: Looking at x6f4
[ Info: - Breaking link x6f4->x6...
[ Info: - Original links: Symbol[:x6]
[ Info: - New links: Symbol[]
[ Info: x6f4 doesn't have any other links, not adding it back...
[ Info: Looking at x6f3
[ Info: - Breaking link x6f3->x6...
[ Info: - Original links: Symbol[:x6]
[ Info: - New links: Symbol[]
[ Info: x6f3 doesn't have any other links, not adding it back...
[ Info: Looking at x6f1
[ Info: - Breaking link x6f1->x6...
[ Info: - Original links: Symbol[:x6]
[ Info: - New links: Symbol[]
[ Info: x6f1 doesn't have any other links, not adding it back...
[ Info: Looking at x6f2
[ Info: - Breaking link x6f2->x6...
[ Info: - Original links: Symbol[:x6]
[ Info: - New links: Symbol[]
[ Info: x6f2 doesn't have any other links, not adding it back...
Find potential functions for each clique
[ Info: Get potentials x0,: x2,
[ Info: using all factors among cliq variables
[ Info: finding all frontals for down WIP
[ Info: Get potentials x7,: x6,
[ Info: using all factors among cliq variables
[ Info: finding all frontals for down WIP
[ Info: Get potentials x3,: l1,x4,x2,
[ Info: using all factors among cliq variables
[ Info: finding all frontals for down WIP
[ Info: Get potentials x4,: l1,x2,x5,
[ Info: using all factors among cliq variables
[ Info: finding all frontals for down WIP
[ Info: cliq=4 adding factor that is no in separator, x3
[ Info: Get potentials x6,x2,l1,x5,:
[ Info: using all factors among cliq variables
[ Info: finding all frontals for down WIP
[ Info: cliq=1 adding factor that is no in separator, x7
[ Info: cliq=1 adding factor that is no in separator, x3
[ Info: cliq=1 adding factor that is no in separator, x0
[ Info: cliq=1 adding factor that is no in separator, x3
[ Info: cliq=1 adding factor that is no in separator, x4
[ Info: cliq=1 adding factor that is no in separator, x4
Bayes Tree
[ Info: Do tree based init-inference on tree
State machine iter=1
State machine iter=2
State machine iter=3
State machine iter=4
State machine iter=1
State machine iter=2
State machine iter=3
State machine iter=4
State machine iter=5
State machine iter=6
State machine iter=7
State machine iter=8
[ Info: up w 0 msgs
State machine iter=1[ Info: ---------- successive fnc approx ------------x0,: x2,
[ Info: #1 --
[ Info: ---------- successive fnc approx ------------x0,: x2,
[ Info: #1 --
State machine iter=2
State machine iter=3
[ Info: [2x0p,d1,N100],
[ Info: #2 --
State machine iter=4
[ Info: [2x0p,d1,N100],
State machine iter=5[ Info: #3 --
[ Info: [2x0p,d1,N100],
[ Info: fmcmc! -- solverData(vert=x2).inferdim=1.0
State machine iter=6
[ Info: fmcmc! -- solverData(vert=x0).inferdim=2.0
[ Info: Outgoing msg density on:
State machine iter=7
[ Info: prepCliqInitMsgsUp, seps=Symbol[:x2]
State machine iter=8
[ Info: up w 0 msgs
State machine iter=1[ Info: ---------- successive fnc approx ------------x7,: x6,
[ Info: #1 --
[ Info: ---------- successive fnc approx ------------x7,: x6,
[ Info: #1 --
State machine iter=2
State machine iter=3
[ Info: [2x0p,d1,N100],
[ Info: #2 --
State machine iter=4
[ Info: [2x0p,d1,N100],
[ Info: #3 --
State machine iter=9[ Info: [2x0p,d1,N100],
[ Info: fmcmc! -- solverData(vert=x6).inferdim=1.0
State machine iter=10[ Info: fmcmc! -- solverData(vert=x7).inferdim=2.0
[ Info: Outgoing msg density on:
[ Info: prepCliqInitMsgsUp, seps=Symbol[:x6]
State machine iter=1
State machine iter=2
State machine iter=3
State machine iter=4
State machine iter=5
State machine iter=6
State machine iter=7
State machine iter=8
[ Info: up w 0 msgs
[ Info: ---------- successive fnc approx ------------x3,: l1,x4,x2,
[ Info: #1 --
[ Info: ---------- successive fnc approx ------------x3,: l1,x4,x2,
[ Info: #1 --
[ Info: [2x0p,d1,N100],
[ Info: [2x0p,d1,N100],
[ Info: [4x0p,d1,N100],
State machine iter=9[ Info: #2 --
[ Info: [2x0p,d1,N100],
State machine iter=10[ Info: [2x0p,d1,N100],
[ Info: [4x0p,d1,N100],
[ Info: #3 --
[ Info: [2x0p,d1,N100],
[ Info: [2x0p,d1,N100],
[ Info: [4x0p,d1,N100],
[ Info: fmcmc! -- solverData(vert=x2).inferdim=1.0
[ Info: fmcmc! -- solverData(vert=l1).inferdim=2.0
[ Info: fmcmc! -- solverData(vert=x4).inferdim=2.0
[ Info: fmcmc! -- solverData(vert=x3).inferdim=4.0
[ Info: Outgoing msg density on:
[ Info: prepCliqInitMsgsUp, seps=Symbol[:l1, :x4, :x2]
State machine iter=5
State machine iter=6
State machine iter=7
State machine iter=8
[ Info: up w 1 msgs
[ Info: inp.sendmsgs[x2].inferdim=1.0
[ Info: inp.sendmsgs[x4].inferdim=2.0
State machine iter=9
State machine iter=10
[ Info: inp.sendmsgs[l1].inferdim=2.0
[ Info: ---------- successive fnc approx ------------x4,: l1,x2,x5,
[ Info: #1 --
[ Info: ---------- successive fnc approx ------------x4,: l1,x2,x5,
[ Info: #1 --
[ Info: fmcmc! -- solverData(vert=l1).inferdim=2.0
[ Info: fmcmc! -- solverData(vert=x2).inferdim=1.0
[ Info: ---------- successive fnc approx ------------x4,: l1,x2,x5,
[ Info: #1 --
[ Info: [2x0p,d1,N100],
[ Info: #2 --
[ Info: [2x0p,d1,N100],
[ Info: #3 --
[ Info: [2x0p,d1,N100],
[ Info: fmcmc! -- solverData(vert=x5).inferdim=1.0
[ Info: fmcmc! -- solverData(vert=x4).inferdim=3.0
[ Info: ---------- successive fnc approx ------------x4,: l1,x2,x5,
[ Info: #1 --
[ Info: Outgoing msg density on:
[ Info: prepCliqInitMsgsUp, seps=Symbol[:l1, :x2, :x5]
State machine iter=5
State machine iter=6
[ Info: up w 3 msgs
[ Info: inp.sendmsgs[x2].inferdim=1.0
[ Info: inp.sendmsgs[x6].inferdim=1.0
[ Info: inp.sendmsgs[x2].inferdim=1.0
[ Info: inp.sendmsgs[x5].inferdim=1.0
[ Info: inp.sendmsgs[l1].inferdim=2.0
[ Info: ---------- successive fnc approx ------------x6,x2,l1,x5,:
[ Info: #1 --
[ Info: fmcmc! -- solverData(vert=l1).inferdim=2.0
[ Info: ---------- successive fnc approx ------------x6,x2,l1,x5,:
[ Info: #1 --
[ Info: [2x0p,d1,N100],
[ Info: [2x0p,d1,N100],
State machine iter=9[ Info: #2 --
[ Info: [2x0p,d1,N100],
State machine iter=10[ Info: [2x0p,d1,N100],
[ Info: #3 --
[ Info: [2x0p,d1,N100],
[ Info: [2x0p,d1,N100],
[ Info: fmcmc! -- solverData(vert=x6).inferdim=2.0
[ Info: fmcmc! -- solverData(vert=x5).inferdim=2.0
[ Info: ---------- successive fnc approx ------------x6,x2,l1,x5,:
[ Info: #1 --
[ Info: [2x0p,d1,N100],
[ Info: fmcmc! -- solverData(vert=x2).inferdim=2.0
[ Info: fmcmc! -- solverData(vert=l1).inferdim=2.0
[ Info: Outgoing msg density on:
[ Info: prepCliqInitMsgsUp, seps=Symbol[]
State machine iter=7
State machine iter=8
[ Info: transferUpdateSubGraph! -- syms=Symbol[:x6, :x2, :l1, :x5]
[ Info: sym=x6, mem size of val=(1, 100) and (1, 100)
┌ Warning: Deprecated
└ @ IncrementalInference ~/.julia/packages/IncrementalInference/FweX2/src/FactorGraphTypes.jl:362
[ Info: sym=x2, mem size of val=(1, 100) and (1, 100)
┌ Warning: Deprecated
└ @ IncrementalInference ~/.julia/packages/IncrementalInference/FweX2/src/FactorGraphTypes.jl:362
[ Info: sym=l1, mem size of val=(1, 100) and (1, 100)
┌ Warning: Deprecated
└ @ IncrementalInference ~/.julia/packages/IncrementalInference/FweX2/src/FactorGraphTypes.jl:362
[ Info: sym=x5, mem size of val=(1, 100) and (1, 100)
┌ Warning: Deprecated
└ @ IncrementalInference ~/.julia/packages/IncrementalInference/FweX2/src/FactorGraphTypes.jl:362
State machine iter=11
State machine iter=11
[ Info: [2x0p,d1,N100],
State machine iter=9
[ Info: [2x0p,d1,N100],
State machine iter=11
[ Info: [3x0p,d1,N100],
State machine iter=12
State machine iter=11
State machine iter=12[ Info: [4x0p,d1,N100],
State machine iter=12
[ Info: Finished tree based init-inference
State machine iter=12
Test Summary: |
with local Graphs.jl dictionary and arrays only (multicore)... | No tests
[ Info: Folder '/tmp/dfg_test' doesn't exist, creating...
┌ Warning: Retrieving serialization module from AbstractDFG - override this in the 'GraphsDFG{SolverParams} structure! This is returning Main
└ @ DistributedFactorGraphs ~/.julia/packages/DistributedFactorGraphs/NMxiR/src/services/AbstractDFG.jl:25
┌ Warning: Retrieving serialization module from AbstractDFG - override this in the 'GraphsDFG{SolverParams} structure! This is returning Main
└ @ DistributedFactorGraphs ~/.julia/packages/DistributedFactorGraphs/NMxiR/src/services/AbstractDFG.jl:25
┌ Warning: Retrieving serialization module from AbstractDFG - override this in the 'GraphsDFG{SolverParams} structure! This is returning Main
└ @ DistributedFactorGraphs ~/.julia/packages/DistributedFactorGraphs/NMxiR/src/services/AbstractDFG.jl:25
┌ Warning: Retrieving serialization module from AbstractDFG - override this in the 'GraphsDFG{SolverParams} structure! This is returning Main
└ @ DistributedFactorGraphs ~/.julia/packages/DistributedFactorGraphs/NMxiR/src/services/AbstractDFG.jl:25
┌ Warning: Retrieving serialization module from AbstractDFG - override this in the 'GraphsDFG{SolverParams} structure! This is returning Main
└ @ DistributedFactorGraphs ~/.julia/packages/DistributedFactorGraphs/NMxiR/src/services/AbstractDFG.jl:25
┌ Warning: Retrieving serialization module from AbstractDFG - override this in the 'GraphsDFG{SolverParams} structure! This is returning Main
└ @ DistributedFactorGraphs ~/.julia/packages/DistributedFactorGraphs/NMxiR/src/services/AbstractDFG.jl:25
┌ Warning: Retrieving serialization module from AbstractDFG - override this in the 'GraphsDFG{SolverParams} structure! This is returning Main
└ @ DistributedFactorGraphs ~/.julia/packages/DistributedFactorGraphs/NMxiR/src/services/AbstractDFG.jl:25
┌ Warning: Retrieving serialization module from AbstractDFG - override this in the 'GraphsDFG{SolverParams} structure! This is returning Main
└ @ DistributedFactorGraphs ~/.julia/packages/DistributedFactorGraphs/NMxiR/src/services/AbstractDFG.jl:25
[ Info: Loaded 8 variables - Symbol[:l1, :x0, :x2, :x3, :x4, :x5, :x6, :x7]
[ Info: Inserting variables into graph...
[ Info: Loaded 8 factors - Symbol[:x0f1, :x0x2f1, :x2x3f1, :x3f1, :x3l1f1, :x3x4f1, :x4l1f1, :x4x5f1, :x5x6f1, :x6x7f1, :x7f1]
[ Info: Inserting factors into graph...
[ Info: Rebuilding CCW's for the factors...
Test Summary: | Pass Total
saving to and loading from FileDFG | 2 2
┌ Warning: must return testExpandedJLD.jl to testing -- currently skipped since jld2 files cannot be loaded.
└ @ Main ~/.julia/packages/IncrementalInference/FweX2/test/runtests.jl:75
[ Info: try doautoinit! of x1
[ Info: try doautoinit! of x1
[ Info: init with useinitfct Symbol[:x1f1]
[ Info: do init of x1
[ Info: try doautoinit! of x2
[ Info: try doautoinit! of x2
[ Info: init with useinitfct Symbol[:x1x2f1]
[ Info: do init of x2
[ Info: try doautoinit! of x3
[ Info: try doautoinit! of x3
[ Info: init with useinitfct Symbol[:x2x3f1]
[ Info: do init of x3
[ Info: try doautoinit! of x4
[ Info: try doautoinit! of l1
[ Info: try doautoinit! of l1
[ Info: init with useinitfct Symbol[:x1l1f1, :x2l1f1]
[ Info: do init of l1
[ Info: [2x0p,d1,N100],
[ Info: try doautoinit! of l2
[ Info: try doautoinit! of l2
[ Info: init with useinitfct Symbol[:x2l2f1, :x3l2f1]
[ Info: do init of l2
[ Info: [2x0p,d1,N100],
[ Info: try doautoinit! of x4
[ Info: init with useinitfct Symbol[:x4l2f1, :x3x4f1]
[ Info: do init of x4
[ Info: [2x0p,d1,N100],
Building Bayes net...
Si = Symbol[:x3, :x1, :l2, :l1]
Si = Symbol[:x4, :x1, :l2, :l1]
[ Info:
[ Info: Eliminating x2
[ Info: ===============
[ Info:
[ Info: - Removing x2
[ Info:
[ Info: Eliminating x3
[ Info: ===============
[ Info:
[ Info: - Removing x3
[ Info: Looking at x3x1l2l1f1
[ Info: - Breaking link x3x1l2l1f1->x3...
[ Info: - Original links: Symbol[:x3, :x1, :l2, :l1]
[ Info: - New links: Symbol[:x1, :l2, :l1]
[ Info: x3x1l2l1f1 still has links to other variables, readding it back...
[ Info:
[ Info: Eliminating x1
[ Info: ===============
[ Info:
[ Info: - Removing x1
[ Info: Looking at x1l2l1f1
[ Info: - Breaking link x1l2l1f1->x1...
[ Info: - Original links: Symbol[:x1, :l2, :l1]
[ Info: - New links: Symbol[:l2, :l1]
[ Info: x1l2l1f1 still has links to other variables, readding it back...
[ Info: Looking at x4x1l2l1f1
[ Info: - Breaking link x4x1l2l1f1->x1...
[ Info: - Original links: Symbol[:x4, :x1, :l2, :l1]
[ Info: - New links: Symbol[:x4, :l2, :l1]
[ Info: x4x1l2l1f1 still has links to other variables, readding it back...
Si = Symbol[:l2, :l1, :x4]
[ Info:
[ Info: Eliminating l2
[ Info: ===============
[ Info:
[ Info: - Removing l2
[ Info: Looking at x4l2l1f1
[ Info: - Breaking link x4l2l1f1->l2...
[ Info: - Original links: Symbol[:x4, :l2, :l1]
[ Info: - New links: Symbol[:x4, :l1]
[ Info: x4l2l1f1 still has links to other variables, readding it back...
[ Info: Looking at l2l1x4f1
[ Info: - Breaking link l2l1x4f1->l2...
[ Info: - Original links: Symbol[:l2, :l1, :x4]
[ Info: - New links: Symbol[:l1, :x4]
[ Info: l2l1x4f1 still has links to other variables, readding it back...
[ Info: Looking at l2l1f1
[ Info: - Breaking link l2l1f1->l2...
[ Info: - Original links: Symbol[:l2, :l1]
[ Info: - New links: Symbol[:l1]
[ Info: l2l1f1 still has links to other variables, readding it back...
[ Info:
[ Info: Eliminating l1
[ Info: ===============
[ Info:
[ Info: - Removing l1
[ Info: Looking at l1f1
[ Info: - Breaking link l1f1->l1...
[ Info: - Original links: Symbol[:l1]
[ Info: - New links: Symbol[]
[ Info: l1f1 doesn't have any other links, not adding it back...
[ Info: Looking at x4l1f2
[ Info: - Breaking link x4l1f2->l1...
[ Info: - Original links: Symbol[:x4, :l1]
[ Info: - New links: Symbol[:x4]
[ Info: x4l1f2 still has links to other variables, readding it back...
[ Info: Looking at l1x4f1
[ Info: - Breaking link l1x4f1->l1...
[ Info: - Original links: Symbol[:l1, :x4]
[ Info: - New links: Symbol[:x4]
[ Info: l1x4f1 still has links to other variables, readding it back...
[ Info: Looking at x4l1f1
[ Info: - Breaking link x4l1f1->l1...
[ Info: - Original links: Symbol[:x4, :l1]
[ Info: - New links: Symbol[:x4]
[ Info: x4l1f1 still has links to other variables, readding it back...
[ Info:
[ Info: Eliminating x4
[ Info: ===============
[ Info:
[ Info: - Removing x4
[ Info: Looking at x4f4
[ Info: - Breaking link x4f4->x4...
[ Info: - Original links: Symbol[:x4]
[ Info: - New links: Symbol[]
[ Info: x4f4 doesn't have any other links, not adding it back...
[ Info: Looking at x4f3
[ Info: - Breaking link x4f3->x4...
[ Info: - Original links: Symbol[:x4]
[ Info: - New links: Symbol[]
[ Info: x4f3 doesn't have any other links, not adding it back...
[ Info: Looking at x4f2
Si = Symbol[:x4, :l1]
Si = Symbol[:x4]
[ Info: - Breaking link x4f2->x4...
[ Info: - Original links: Symbol[:x4]
[ Info: - New links: Symbol[]
[ Info: x4f2 doesn't have any other links, not adding it back...
[ Info: Looking at x4f1
[ Info: - Breaking link x4f1->x4...
[ Info: - Original links: Symbol[:x4]
[ Info: - New links: Symbol[]
[ Info: x4f1 doesn't have any other links, not adding it back...
[ Info: Get potentials x2,: x3,x1,l2,l1,
[ Info: using all factors among cliq variables
[ Info: finding all frontals for down WIP
[ Info: Get potentials x4,l1,l2,x1,x3,:
[ Info: using all factors among cliq variables
[ Info: finding all frontals for down WIP
[ Info: cliq=1 adding factor that is no in separator, x2
[ Info: cliq=1 adding factor that is no in separator, x2
[ Info: cliq=1 adding factor that is no in separator, x2
[ Info: cliq=1 adding factor that is no in separator, x2
Find potential functions for each clique
Bayes Tree
┌ Warning: Base.IOError("could not spawn `dot2tex -tmath --preproc /root/.julia/packages/IncrementalInference/FweX2/test/tmp/bt.dot -o /root/.julia/packages/IncrementalInference/FweX2/test/tmp/btproc.dot`: no such file or directory (ENOENT)", -2)
└ @ IncrementalInference ~/.julia/packages/IncrementalInference/FweX2/src/JunctionTree.jl:331
stacktrace() = Base.StackTraces.StackFrame[macro expansion at show.jl:562 [inlined], #generateTexTree#96(::String, ::typeof(generateTexTree), ::BayesTree) at JunctionTree.jl:332, (::IncrementalInference.var"#kw##generateTexTree")(::NamedTuple{(:filepath,),Tuple{String}}, ::typeof(generateTexTree), ::BayesTree) at none:0, top-level scope at testTexTreeIllustration.jl:47, top-level scope at Test.jl:1107, top-level scope at testTexTreeIllustration.jl:14, include at boot.jl:328 [inlined], include_relative(::Module, ::String) at loading.jl:1105, include(::Module, ::String) at Base.jl:31, include(::String) at client.jl:424, top-level scope at runtests.jl:79, include at boot.jl:328 [inlined], include_relative(::Module, ::String) at loading.jl:1105, include(::Module, ::String) at Base.jl:31, include(::String) at client.jl:424, top-level scope at none:6, eval(::Module, ::Any) at boot.jl:330, exec_options(::Base.JLOptions) at client.jl:263, _start() at client.jl:460]
Test Summary: | Pass Total
testing generateTexTree | 1 1
Testing IncrementalInference tests passed
Results with Julia v1.3.1-pre-7704df0a5a
Testing was successful .
Last evaluation was ago and took 11 minutes, 39 seconds.
Click here to download the log file.
Click here to show the log contents.
Resolving package versions...
Installed CoordinateTransformations ─── v0.5.0
Installed ColorTypes ────────────────── v0.8.0
Installed KernelDensityEstimate ─────── v0.5.2
Installed DataStructures ────────────── v0.17.6
Installed Colors ────────────────────── v0.9.6
Installed IncrementalInference ──────── v0.8.2
Installed Optim ─────────────────────── v0.19.5
Installed LightGraphs ───────────────── v1.3.0
Installed NaNMath ───────────────────── v0.3.3
Installed QuadGK ────────────────────── v2.1.1
Installed SpecialFunctions ──────────── v0.8.0
Installed Tables ────────────────────── v0.2.11
Installed MbedTLS ───────────────────── v0.7.0
Installed Compat ────────────────────── v2.2.0
Installed Compose ───────────────────── v0.7.3
Installed DataFrames ────────────────── v0.19.4
Installed StaticArrays ──────────────── v0.12.1
Installed BinDeps ───────────────────── v0.8.10
Installed Graphs ────────────────────── v0.10.3
Installed IterTools ─────────────────── v1.3.0
Installed DiffResults ───────────────── v0.0.4
Installed FixedPointNumbers ─────────── v0.6.1
Installed MacroTools ────────────────── v0.5.2
Installed GraphPlot ─────────────────── v0.3.1
Installed Inflate ───────────────────── v0.1.1
Installed StatsBase ─────────────────── v0.32.0
Installed ForwardDiff ───────────────── v0.10.7
Installed FillArrays ────────────────── v0.8.2
Installed Arpack ────────────────────── v0.3.1
Installed LineSearches ──────────────── v7.0.1
Installed FileIO ────────────────────── v1.1.0
Installed HTTP ──────────────────────── v0.8.8
Installed CodecZlib ─────────────────── v0.6.0
Installed URIParser ─────────────────── v0.4.0
Installed Calculus ──────────────────── v0.5.1
Installed CommonSubexpressions ──────── v0.2.0
Installed Missings ──────────────────── v0.4.3
Installed TableTraits ───────────────── v1.0.0
Installed PooledArrays ──────────────── v0.5.2
Installed DocStringExtensions ───────── v0.8.1
Installed Neo4j ─────────────────────── v2.0.0
Installed BinaryProvider ────────────── v0.5.8
Installed ProgressMeter ─────────────── v1.2.0
Installed Parameters ────────────────── v0.12.0
Installed StatsFuns ─────────────────── v0.9.0
Installed Rotations ─────────────────── v0.12.0
Installed NLSolversBase ─────────────── v7.5.0
Installed Rmath ─────────────────────── v0.5.1
Installed InvertedIndices ───────────── v1.0.0
Installed TranscodingStreams ────────── v0.9.5
Installed DiffRules ─────────────────── v0.1.0
Installed Measures ──────────────────── v0.3.0
Installed Requires ──────────────────── v0.5.2
Installed ArrayInterface ────────────── v2.0.0
Installed DistributedFactorGraphs ───── v0.5.1
Installed Distances ─────────────────── v0.8.2
Installed IniFile ───────────────────── v0.5.0
Installed SimpleTraits ──────────────── v0.9.1
Installed DataValueInterfaces ───────── v1.0.0
Installed FunctionalStateMachine ────── v0.1.3
Installed PositiveFactorizations ────── v0.2.3
Installed DataAPI ───────────────────── v1.1.0
Installed CategoricalArrays ─────────── v0.7.3
Installed IteratorInterfaceExtensions ─ v1.0.0
Installed Reexport ──────────────────── v0.2.0
Installed Distributions ─────────────── v0.21.9
Installed JSON ──────────────────────── v0.21.0
Installed JLD2 ──────────────────────── v0.1.9
Installed ArnoldiMethod ─────────────── v0.0.4
Installed OrderedCollections ────────── v1.1.0
Installed Parsers ───────────────────── v0.3.10
Installed ApproxManifoldProducts ────── v0.1.2
Installed PDMats ────────────────────── v0.9.10
Installed SortingAlgorithms ─────────── v0.3.1
Installed DiffEqDiffTools ───────────── v1.5.0
Installed JSON2 ─────────────────────── v0.3.1
Installed TransformUtils ────────────── v0.2.2
Installed NLsolve ───────────────────── v4.2.0
Updating `~/.julia/environments/v1.3/Project.toml`
[904591bb] + IncrementalInference v0.8.2
Updating `~/.julia/environments/v1.3/Manifest.toml`
[9bbbb610] + ApproxManifoldProducts v0.1.2
[ec485272] + ArnoldiMethod v0.0.4
[7d9fca2a] + Arpack v0.3.1
[4fba245c] + ArrayInterface v2.0.0
[9e28174c] + BinDeps v0.8.10
[b99e7846] + BinaryProvider v0.5.8
[49dc2e85] + Calculus v0.5.1
[324d7699] + CategoricalArrays v0.7.3
[944b1d66] + CodecZlib v0.6.0
[3da002f7] + ColorTypes v0.8.0
[5ae59095] + Colors v0.9.6
[bbf7d656] + CommonSubexpressions v0.2.0
[34da2185] + Compat v2.2.0
[a81c6b42] + Compose v0.7.3
[150eb455] + CoordinateTransformations v0.5.0
[9a962f9c] + DataAPI v1.1.0
[a93c6f00] + DataFrames v0.19.4
[864edb3b] + DataStructures v0.17.6
[e2d170a0] + DataValueInterfaces v1.0.0
[01453d9d] + DiffEqDiffTools v1.5.0
[163ba53b] + DiffResults v0.0.4
[b552c78f] + DiffRules v0.1.0
[b4f34e82] + Distances v0.8.2
[b5cc3c7e] + DistributedFactorGraphs v0.5.1
[31c24e10] + Distributions v0.21.9
[ffbed154] + DocStringExtensions v0.8.1
[5789e2e9] + FileIO v1.1.0
[1a297f60] + FillArrays v0.8.2
[53c48c17] + FixedPointNumbers v0.6.1
[f6369f11] + ForwardDiff v0.10.7
[3e9e306e] + FunctionalStateMachine v0.1.3
[a2cc645c] + GraphPlot v0.3.1
[86223c79] + Graphs v0.10.3
[cd3eb016] + HTTP v0.8.8
[904591bb] + IncrementalInference v0.8.2
[d25df0c9] + Inflate v0.1.1
[83e8ac13] + IniFile v0.5.0
[41ab1584] + InvertedIndices v1.0.0
[c8e1da08] + IterTools v1.3.0
[82899510] + IteratorInterfaceExtensions v1.0.0
[033835bb] + JLD2 v0.1.9
[682c06a0] + JSON v0.21.0
[2535ab7d] + JSON2 v0.3.1
[2472808a] + KernelDensityEstimate v0.5.2
[093fc24a] + LightGraphs v1.3.0
[d3d80556] + LineSearches v7.0.1
[1914dd2f] + MacroTools v0.5.2
[739be429] + MbedTLS v0.7.0
[442fdcdd] + Measures v0.3.0
[e1d29d7a] + Missings v0.4.3
[d41bc354] + NLSolversBase v7.5.0
[2774e3e8] + NLsolve v4.2.0
[77ba4419] + NaNMath v0.3.3
[d2adbeaf] + Neo4j v2.0.0
[429524aa] + Optim v0.19.5
[bac558e1] + OrderedCollections v1.1.0
[90014a1f] + PDMats v0.9.10
[d96e819e] + Parameters v0.12.0
[69de0a69] + Parsers v0.3.10
[2dfb63ee] + PooledArrays v0.5.2
[85a6dd25] + PositiveFactorizations v0.2.3
[92933f4c] + ProgressMeter v1.2.0
[1fd47b50] + QuadGK v2.1.1
[189a3867] + Reexport v0.2.0
[ae029012] + Requires v0.5.2
[79098fc4] + Rmath v0.5.1
[6038ab10] + Rotations v0.12.0
[699a6c99] + SimpleTraits v0.9.1
[a2af1166] + SortingAlgorithms v0.3.1
[276daf66] + SpecialFunctions v0.8.0
[90137ffa] + StaticArrays v0.12.1
[2913bbd2] + StatsBase v0.32.0
[4c63d2b9] + StatsFuns v0.9.0
[3783bdb8] + TableTraits v1.0.0
[bd369af6] + Tables v0.2.11
[3bb67fe8] + TranscodingStreams v0.9.5
[9b8138ad] + TransformUtils v0.2.2
[30578b45] + URIParser v0.4.0
[2a0f44e3] + Base64
[ade2ca70] + Dates
[8bb1440f] + DelimitedFiles
[8ba89e20] + Distributed
[9fa8497b] + Future
[b77e0a4c] + InteractiveUtils
[76f85450] + LibGit2
[8f399da3] + Libdl
[37e2e46d] + LinearAlgebra
[56ddb016] + Logging
[d6f4376e] + Markdown
[a63ad114] + Mmap
[44cfe95a] + Pkg
[de0858da] + Printf
[9abbd945] + Profile
[3fa0cd96] + REPL
[9a3f8284] + Random
[ea8e919c] + SHA
[9e88b42a] + Serialization
[1a1011a3] + SharedArrays
[6462fe0b] + Sockets
[2f01184e] + SparseArrays
[10745b16] + Statistics
[4607b0f0] + SuiteSparse
[8dfed614] + Test
[cf7118a7] + UUIDs
[4ec0a83e] + Unicode
Building MbedTLS ─────────→ `~/.julia/packages/MbedTLS/a1JFn/deps/build.log`
Building SpecialFunctions → `~/.julia/packages/SpecialFunctions/ne2iw/deps/build.log`
Building Arpack ──────────→ `~/.julia/packages/Arpack/cu5By/deps/build.log`
Building CodecZlib ───────→ `~/.julia/packages/CodecZlib/5t9zO/deps/build.log`
Building Rmath ───────────→ `~/.julia/packages/Rmath/4wt82/deps/build.log`
Testing IncrementalInference
Resolving package versions...
Status `/tmp/jl_HAEDpB/Manifest.toml`
[9bbbb610] ApproxManifoldProducts v0.1.2
[ec485272] ArnoldiMethod v0.0.4
[7d9fca2a] Arpack v0.3.1
[4fba245c] ArrayInterface v2.0.0
[9e28174c] BinDeps v0.8.10
[b99e7846] BinaryProvider v0.5.8
[49dc2e85] Calculus v0.5.1
[324d7699] CategoricalArrays v0.7.3
[944b1d66] CodecZlib v0.6.0
[3da002f7] ColorTypes v0.8.0
[5ae59095] Colors v0.9.6
[bbf7d656] CommonSubexpressions v0.2.0
[34da2185] Compat v2.2.0
[a81c6b42] Compose v0.7.3
[150eb455] CoordinateTransformations v0.5.0
[9a962f9c] DataAPI v1.1.0
[a93c6f00] DataFrames v0.19.4
[864edb3b] DataStructures v0.17.6
[e2d170a0] DataValueInterfaces v1.0.0
[01453d9d] DiffEqDiffTools v1.5.0
[163ba53b] DiffResults v0.0.4
[b552c78f] DiffRules v0.1.0
[b4f34e82] Distances v0.8.2
[b5cc3c7e] DistributedFactorGraphs v0.5.1
[31c24e10] Distributions v0.21.9
[ffbed154] DocStringExtensions v0.8.1
[5789e2e9] FileIO v1.1.0
[1a297f60] FillArrays v0.8.2
[53c48c17] FixedPointNumbers v0.6.1
[f6369f11] ForwardDiff v0.10.7
[3e9e306e] FunctionalStateMachine v0.1.3
[a2cc645c] GraphPlot v0.3.1
[86223c79] Graphs v0.10.3
[cd3eb016] HTTP v0.8.8
[904591bb] IncrementalInference v0.8.2
[d25df0c9] Inflate v0.1.1
[83e8ac13] IniFile v0.5.0
[41ab1584] InvertedIndices v1.0.0
[c8e1da08] IterTools v1.3.0
[82899510] IteratorInterfaceExtensions v1.0.0
[033835bb] JLD2 v0.1.9
[682c06a0] JSON v0.21.0
[2535ab7d] JSON2 v0.3.1
[2472808a] KernelDensityEstimate v0.5.2
[093fc24a] LightGraphs v1.3.0
[d3d80556] LineSearches v7.0.1
[1914dd2f] MacroTools v0.5.2
[739be429] MbedTLS v0.7.0
[442fdcdd] Measures v0.3.0
[e1d29d7a] Missings v0.4.3
[d41bc354] NLSolversBase v7.5.0
[2774e3e8] NLsolve v4.2.0
[77ba4419] NaNMath v0.3.3
[d2adbeaf] Neo4j v2.0.0
[429524aa] Optim v0.19.5
[bac558e1] OrderedCollections v1.1.0
[90014a1f] PDMats v0.9.10
[d96e819e] Parameters v0.12.0
[69de0a69] Parsers v0.3.10
[2dfb63ee] PooledArrays v0.5.2
[85a6dd25] PositiveFactorizations v0.2.3
[92933f4c] ProgressMeter v1.2.0
[1fd47b50] QuadGK v2.1.1
[189a3867] Reexport v0.2.0
[ae029012] Requires v0.5.2
[79098fc4] Rmath v0.5.1
[6038ab10] Rotations v0.12.0
[699a6c99] SimpleTraits v0.9.1
[a2af1166] SortingAlgorithms v0.3.1
[276daf66] SpecialFunctions v0.8.0
[90137ffa] StaticArrays v0.12.1
[2913bbd2] StatsBase v0.32.0
[4c63d2b9] StatsFuns v0.9.0
[3783bdb8] TableTraits v1.0.0
[bd369af6] Tables v0.2.11
[3bb67fe8] TranscodingStreams v0.9.5
[9b8138ad] TransformUtils v0.2.2
[30578b45] URIParser v0.4.0
[2a0f44e3] Base64 [`@stdlib/Base64`]
[ade2ca70] Dates [`@stdlib/Dates`]
[8bb1440f] DelimitedFiles [`@stdlib/DelimitedFiles`]
[8ba89e20] Distributed [`@stdlib/Distributed`]
[9fa8497b] Future [`@stdlib/Future`]
[b77e0a4c] InteractiveUtils [`@stdlib/InteractiveUtils`]
[76f85450] LibGit2 [`@stdlib/LibGit2`]
[8f399da3] Libdl [`@stdlib/Libdl`]
[37e2e46d] LinearAlgebra [`@stdlib/LinearAlgebra`]
[56ddb016] Logging [`@stdlib/Logging`]
[d6f4376e] Markdown [`@stdlib/Markdown`]
[a63ad114] Mmap [`@stdlib/Mmap`]
[44cfe95a] Pkg [`@stdlib/Pkg`]
[de0858da] Printf [`@stdlib/Printf`]
[9abbd945] Profile [`@stdlib/Profile`]
[3fa0cd96] REPL [`@stdlib/REPL`]
[9a3f8284] Random [`@stdlib/Random`]
[ea8e919c] SHA [`@stdlib/SHA`]
[9e88b42a] Serialization [`@stdlib/Serialization`]
[1a1011a3] SharedArrays [`@stdlib/SharedArrays`]
[6462fe0b] Sockets [`@stdlib/Sockets`]
[2f01184e] SparseArrays [`@stdlib/SparseArrays`]
[10745b16] Statistics [`@stdlib/Statistics`]
[4607b0f0] SuiteSparse [`@stdlib/SuiteSparse`]
[8dfed614] Test [`@stdlib/Test`]
[cf7118a7] UUIDs [`@stdlib/UUIDs`]
[4ec0a83e] Unicode [`@stdlib/Unicode`]
[ Info: Multithreaded convolutions possible, Threads.nthreads()=1. See `addFactor!(.;threadmodel=MultiThreaded)`.
[ Info: KernelDensityEstimate.FORCE_EVAL_DIRECT = true
WARNING: Method definition (::Type{DistributedFactorGraphs.VariableNodeData{T} where T<:DistributedFactorGraphs.InferenceVariable})(Array{Float64, 2}, Array{Float64, 2}, Array{Symbol, 1}, Array{Int64, 1}, Int64, Bool, Symbol, Array{Symbol, 1}, T<:DistributedFactorGraphs.InferenceVariable, Bool, Float64, Bool, Bool, Int64) where {T<:DistributedFactorGraphs.InferenceVariable} in module DistributedFactorGraphs at /root/.julia/packages/DistributedFactorGraphs/NMxiR/src/entities/DFGVariable.jl:11 overwritten at /root/.julia/packages/DistributedFactorGraphs/NMxiR/src/entities/DFGVariable.jl:41.
** incremental compilation may be fatally broken for this module **
WARNING: Method definition (::Type{DistributedFactorGraphs.VariableNodeData{T} where T<:DistributedFactorGraphs.InferenceVariable})(Array{Float64, 2}, Array{Float64, 2}, Array{Symbol, 1}, Array{Int64, 1}, Int64, Bool, Symbol, Array{Symbol, 1}, T<:DistributedFactorGraphs.InferenceVariable, Bool, Float64, Bool, Bool, Int64) where {T<:DistributedFactorGraphs.InferenceVariable} in module DistributedFactorGraphs at /root/.julia/packages/DistributedFactorGraphs/NMxiR/src/entities/DFGVariable.jl:11 overwritten at /root/.julia/packages/DistributedFactorGraphs/NMxiR/src/entities/DFGVariable.jl:41.
** incremental compilation may be fatally broken for this module **
[ Info: KernelDensityEstimate.FORCE_EVAL_DIRECT = true
[ Info: Adding graph visualization tools.
evalPotential sees SecondType(1)
evalPotential also sees SecondAgain(3)
evalPotential sees SecondType(1)
evalPotential sees SecondType(1)
evalPotential also sees SecondAgain(3)
Check the speed is reasonable
Test Summary: | Pass Total
out of module evalPotential... | 3 3
State machine iter=1
do foo!
State machine iter=2
do bar!
State machine iter=3
do foo!
do bar!
do foo!
do foo!
State machine iter=1
do bar!
State machine iter=2
Test Summary: | Pass Total
Test IIF's generic state machine... | 5 5
[ Info: try doautoinit! of x0
[ Info: try doautoinit! of x0
[ Info: init with useinitfct Symbol[:x0f1]
[ Info: do init of x0
[ Info: try doautoinit! of x1
[ Info: x1
[ Info: x0
[ Info: x1
[ Info: x0
┌ Warning: compareFactorGraphs will skip comparisons on: Symbol[:g, :bn, :IDs, :fIDs, :id, :nodeIDs, :factorIDs, :fifo, :solverParams]
└ @ DistributedFactorGraphs ~/.julia/packages/DistributedFactorGraphs/NMxiR/src/services/CompareUtils.jl:317
[ Info: x1
[ Info: x0
┌ Warning: compareFactorGraphs will skip comparisons on: Symbol[:g, :bn, :IDs, :fIDs, :id, :nodeIDs, :factorIDs, :fifo, :solverParams]
└ @ DistributedFactorGraphs ~/.julia/packages/DistributedFactorGraphs/NMxiR/src/services/CompareUtils.jl:317
[ Info: x1
[ Info: x0
[ Info: Solving over the Bayes (Junction) tree.
Building Bayes net...
[ Info:
[ Info: Eliminating x0
[ Info: ===============
[ Info:
[ Info: - Removing x0
Si = Symbol[:x1]
[ Info:
[ Info: Eliminating x1
[ Info: ===============
[ Info:
[ Info: - Removing x1
[ Info: Looking at x1f1
[ Info: - Breaking link x1f1->x1...
[ Info: - Original links: Symbol[:x1]
[ Info: - New links: Symbol[]
[ Info: x1f1 doesn't have any other links, not adding it back...
Find potential functions for each clique
[ Info: Get potentials x1,x0,:
[ Info: using all factors among cliq variables
[ Info: finding all frontals for down WIP
Bayes Tree
[ Info: Do tree based init-inference on tree
State machine iter=1
State machine iter=2
State machine iter=3
State machine iter=4
State machine iter=5
State machine iter=6
[ Info: up w 0 msgs
[ Info: ---------- successive fnc approx ------------x1,x0,:
[ Info: #1 --
[ Info: ---------- successive fnc approx ------------x1,x0,:
[ Info: #1 --
[ Info: [2x0p,d1,N100],
[ Info: #2 --
[ Info: [2x0p,d1,N100],
[ Info: #3 --
[ Info: [2x0p,d1,N100],
[ Info: fmcmc! -- solverData(vert=x1).inferdim=1.0
[ Info: fmcmc! -- solverData(vert=x0).inferdim=2.0
[ Info: Outgoing msg density on:
[ Info: prepCliqInitMsgsUp, seps=Symbol[]
State machine iter=7
State machine iter=8
[ Info: transferUpdateSubGraph! -- syms=Symbol[:x1, :x0]
[ Info: sym=x1, mem size of val=(1, 100) and (1, 100)
┌ Warning: Deprecated
└ @ IncrementalInference ~/.julia/packages/IncrementalInference/FweX2/src/FactorGraphTypes.jl:362
[ Info: sym=x0, mem size of val=(1, 100) and (1, 100)
┌ Warning: Deprecated
└ @ IncrementalInference ~/.julia/packages/IncrementalInference/FweX2/src/FactorGraphTypes.jl:362
State machine iter=9
[ Info: Finished tree based init-inference
[ Info: x1
[ Info: x0
┌ Warning: compareFactorGraphs will skip comparisons on: Symbol[:g, :bn, :IDs, :fIDs, :id, :nodeIDs, :factorIDs, :fifo, :solverParams]
└ @ DistributedFactorGraphs ~/.julia/packages/DistributedFactorGraphs/NMxiR/src/services/CompareUtils.jl:317
[ Info: x1
[ Info: x0
┌ Warning: compareFactorGraphs will skip comparisons on: Symbol[:g, :bn, :IDs, :fIDs, :id, :nodeIDs, :factorIDs, :fifo, :solverParams]
└ @ DistributedFactorGraphs ~/.julia/packages/DistributedFactorGraphs/NMxiR/src/services/CompareUtils.jl:317
[ Info: x1
[ Info: x0
[ Info: x1 is not initialized, and will do so now...
[ Info: try doautoinit! of x1
[ Info: init with useinitfct Symbol[:x0x1f1]
[ Info: do init of x1
[ Info: x1
[ Info: x0
[ Info: x1
[ Info: x0
Building Bayes net...
[ Info:
[ Info: Eliminating x0
[ Info: ===============
[ Info:
[ Info: - Removing x0
Si = Symbol[:x1]
[ Info:
[ Info: Eliminating x1
[ Info: ===============
[ Info:
[ Info: - Removing x1
[ Info: Looking at x1f1
[ Info: - Breaking link x1f1->x1...
[ Info: - Original links: Symbol[:x1]
[ Info: - New links: Symbol[]
[ Info: x1f1 doesn't have any other links, not adding it back...
Find potential functions for each clique
[ Info: Get potentials x1,x0,:
[ Info: using all factors among cliq variables
[ Info: finding all frontals for down WIP
Bayes Tree
┌ Warning: compareFactorGraphs will skip comparisons on: Symbol[:g, :bn, :IDs, :fIDs, :id, :nodeIDs, :factorIDs, :fifo, :solverParams, :initialized, :inferdim, :estimateDict]
└ @ DistributedFactorGraphs ~/.julia/packages/DistributedFactorGraphs/NMxiR/src/services/CompareUtils.jl:317
[ Info: x1
[ Info: x0
Test Summary: | Pass Total
testing compare functions for variables and factors... | 21 21
[ Info: try doautoinit! of x0
[ Info: try doautoinit! of x0
[ Info: init with useinitfct Symbol[:x0f1]
[ Info: do init of x0
[ Info: try doautoinit! of x1
[ Info: try doautoinit! of x1
[ Info: init with useinitfct Symbol[:x0x1f1]
[ Info: do init of x1
[ Info: try doautoinit! of x2
[ Info: try doautoinit! of l1
┌ Warning: compareFactorGraphs will skip comparisons on: Symbol[:g, :bn, :IDs, :fIDs, :id, :nodeIDs, :factorIDs, :fifo, :solverParams, :labelDict, :addHistory, :logpath]
└ @ DistributedFactorGraphs ~/.julia/packages/DistributedFactorGraphs/NMxiR/src/services/CompareUtils.jl:317
[ Info: x1
[ Info: x0
Test Summary: | Pass Total
test subgraph functions... | 1 1
Test Summary: | Pass Total
Ensure memory return is working properly... | 1 1
Test Summary: | Pass Total
test the basics | 2 2
[ Info: try doautoinit! of x0
maniT = if length(manifolds) < x
([manifolds[1] for i = 1:x]...,)
else
manifolds
end = (:Euclid, :Euclid)
[ Info: try doautoinit! of x1
Test Summary: | Pass Total
testing basic partial factor functions... | 2 2
[ Info: try doautoinit! of x1
[ Info: try doautoinit! of x1
[ Info: init with useinitfct Symbol[:x1f1]
[ Info: do init of x1
[ Info: try doautoinit! of x2
[ Info: try doautoinit! of x2
[ Info: init with useinitfct Symbol[:x1x2f1]
[ Info: do init of x2
[ Info: try doautoinit! of x3
[ Info: try doautoinit! of l1
[ Info: try doautoinit! of l1
[ Info: init with useinitfct Symbol[:x2l1f1, :x1l1f1]
[ Info: do init of l1
[ Info: [2x0p,d1,N100],
[ Info: try doautoinit! of x3
[ Info: init with useinitfct Symbol[:x2x3f1]
[ Info: do init of x3
[ Info: try doautoinit! of l2
Building Bayes net...
[ Info:
[ Info: Eliminating l1
[ Info: ===============
[ Info:
[ Info: - Removing l1
Si = Symbol[:x2, :x1]
[ Info:
[ Info: Eliminating l2
[ Info: ===============
[ Info:
[ Info: - Removing l2
Si = Symbol[:x3]
[ Info:
[ Info: Eliminating x1
[ Info: ===============
[ Info:
[ Info: - Removing x1
[ Info: Looking at x2x1f1
[ Info: - Breaking link x2x1f1->x1...
[ Info: - Original links: Symbol[:x2, :x1]
[ Info: - New links: Symbol[:x2]
[ Info: x2x1f1 still has links to other variables, readding it back...
Si = Symbol[:x2]
[ Info:
[ Info: Eliminating x2
[ Info: ===============
[ Info:
[ Info: - Removing x2
[ Info: Looking at x2f1
[ Info: - Breaking link x2f1->x2...
[ Info: - Original links: Symbol[:x2]
[ Info: - New links: Symbol[]
[ Info: x2f1 doesn't have any other links, not adding it back...
[ Info: Looking at x2f2
Si = Symbol[:x3]
[ Info: - Breaking link x2f2->x2...
[ Info: - Original links: Symbol[:x2]
[ Info: - New links: Symbol[]
[ Info: x2f2 doesn't have any other links, not adding it back...
[ Info:
[ Info: Eliminating x3
[ Info: ===============
[ Info:
[ Info: - Removing x3
[ Info: Looking at x3f2
[ Info: - Breaking link x3f2->x3...
[ Info: - Original links: Symbol[:x3]
[ Info: - New links: Symbol[]
[ Info: x3f2 doesn't have any other links, not adding it back...
[ Info: Looking at x3f1
[ Info: - Breaking link x3f1->x3...
[ Info: - Original links: Symbol[:x3]
[ Info: - New links: Symbol[]
[ Info: x3f1 doesn't have any other links, not adding it back...
Find potential functions for each clique
[ Info: Get potentials x1,l1,: x2,
[ Info: using all factors among cliq variables
[ Info: finding all frontals for down WIP
[ Info: Get potentials l2,: x3,
[ Info: using all factors among cliq variables
[ Info: finding all frontals for down WIP
[ Info: Get potentials x3,x2,:
[ Info: using all factors among cliq variables
[ Info: finding all frontals for down WIP
[ Info: cliq=1 adding factor that is no in separator, l2
[ Info: cliq=1 adding factor that is no in separator, l1
[ Info: cliq=1 adding factor that is no in separator, x1
┌ Warning: add test tree verification
└ @ Main ~/.julia/packages/IncrementalInference/FweX2/test/testBayesTreeiSAM2Example.jl:73
Building Bayes net...
Si = Symbol[:l1, :x3, :x1]
Si = Symbol[:l1, :x3]
Si = Symbol[:l2, :l1]
[ Info:
[ Info: Eliminating x2
[ Info: ===============
[ Info:
[ Info: - Removing x2
[ Info:
[ Info: Eliminating x1
[ Info: ===============
[ Info:
[ Info: - Removing x1
[ Info: Looking at l1x3x1f1
[ Info: - Breaking link l1x3x1f1->x1...
[ Info: - Original links: Symbol[:l1, :x3, :x1]
[ Info: - New links: Symbol[:l1, :x3]
[ Info: l1x3x1f1 still has links to other variables, readding it back...
[ Info:
[ Info: Eliminating x3
[ Info: ===============
[ Info:
[ Info: - Removing x3
[ Info: Looking at l1x3f1
[ Info: - Breaking link l1x3f1->x3...
[ Info: - Original links: Symbol[:l1, :x3]
[ Info: - New links: Symbol[:l1]
[ Info: l1x3f1 still has links to other variables, readding it back...
[ Info: Looking at l1x3f2
[ Info: - Breaking link l1x3f2->x3...
[ Info: - Original links: Symbol[:l1, :x3]
[ Info: - New links: Symbol[:l1]
[ Info: l1x3f2 still has links to other variables, readding it back...
[ Info:
[ Info: Eliminating l1
[ Info: ===============
[ Info:
[ Info: - Removing l1
[ Info: Looking at l1f2
[ Info: - Breaking link l1f2->l1...
[ Info: - Original links: Symbol[:l1]
[ Info: - New links: Symbol[]
[ Info: l1f2 doesn't have any other links, not adding it back...
[ Info: Looking at l2l1f1
[ Info: - Breaking link l2l1f1->l1...
[ Info: - Original links: Symbol[:l2, :l1]
[ Info: - New links: Symbol[:l2]
[ Info: l2l1f1 still has links to other variables, readding it back...
[ Info: Looking at l1f1
[ Info: - Breaking link l1f1->l1...
[ Info: - Original links: Symbol[:l1]
[ Info: - New links: Symbol[]
[ Info: l1f1 doesn't have any other links, not adding it back...
Si = Symbol[:l2]
[ Info:
[ Info: Eliminating l2
[ Info: ===============
[ Info:
[ Info: - Removing l2
[ Info: Looking at l2f1
[ Info: - Breaking link l2f1->l2...
[ Info: - Original links: Symbol[:l2]
[ Info: - New links: Symbol[]
[ Info: l2f1 doesn't have any other links, not adding it back...
[ Info: Looking at l2f2
[ Info: - Breaking link l2f2->l2...
[ Info: - Original links: Symbol[:l2]
[ Info: - New links: Symbol[]
[ Info: l2f2 doesn't have any other links, not adding it back...
Find potential functions for each clique
[ Info: Get potentials x1,x2,: l1,x3,
[ Info: using all factors among cliq variables
[ Info: finding all frontals for down WIP
[ Info: Get potentials l2,l1,x3,:
[ Info: using all factors among cliq variables
[ Info: finding all frontals for down WIP
[ Info: cliq=1 adding factor that is no in separator, x2
[ Info: cliq=1 adding factor that is no in separator, x1
[ Info: cliq=1 adding factor that is no in separator, x2
Test Summary: | Pass Total
basic Bayes tree construction | 1 1
Test Summary: | Pass Total
Ensure converter types can be run from extending namespaces... | 1 1
┌ Warning: Setting serialization module from AbstractDFG - override this in the 'GraphsDFG{SolverParams} structure! This is being ignored.
└ @ DistributedFactorGraphs ~/.julia/packages/DistributedFactorGraphs/NMxiR/src/services/AbstractDFG.jl:21
[ Info: try doautoinit! of x1
[ Info: try doautoinit! of x1
[ Info: init with useinitfct Symbol[:x1f1]
[ Info: do init of x1
[ Info: try doautoinit! of x2
┌ Warning: Retrieving serialization module from AbstractDFG - override this in the 'GraphsDFG{SolverParams} structure! This is returning Main
└ @ DistributedFactorGraphs ~/.julia/packages/DistributedFactorGraphs/NMxiR/src/services/AbstractDFG.jl:25
Test Summary: | Pass Total
packing converters work... | 8 8
Test Summary: | Pass Total
Ensure lambda's work with NLsolve | 1 1
Test Summary: |
minimalistic pattern on how NLsolve is used in IIF. | No tests
Test Summary: | Pass Total
generic root finding by numeric solve of residual functions... | 1 1
a1 = [-1.0 0.7079313434577381 0.5920086305088557; 0.3334333065579589 0.07025525623502227 0.8514743879321098]
0.258148 seconds (174.02 k allocations: 8.864 MiB)
0.165450 seconds (59.71 k allocations: 2.931 MiB)
0.013723 seconds (16.65 k allocations: 1.154 MiB)
zDim = size(measurement[1], 1) = 1
ccw.varidx = solvefor = 2
1.640492 seconds (924.88 k allocations: 45.574 MiB, 2.33% gc time)
and in the reverse direction, achieved by simply changing CommonConvWrapper.varidx to 1...
ccw.varidx = solvefor = 1
0.005804 seconds (7.64 k allocations: 1.011 MiB)
┌ Warning: test not implemented yet
└ @ Main ~/.julia/packages/IncrementalInference/FweX2/test/testCommonConvWrapper.jl:255
[ Info: try doautoinit! of x1
[ Info: try doautoinit! of x1
[ Info: init with useinitfct Symbol[:x1f1]
[ Info: do init of x1
[ Info: try doautoinit! of x2
Building Bayes net...
[ Info:
[ Info: Eliminating x1
[ Info: ===============
[ Info:
[ Info: - Removing x1
Si = Symbol[:x2]
[ Info:
[ Info: Eliminating x2
[ Info: ===============
[ Info:
[ Info: - Removing x2
[ Info: Looking at x2f1
[ Info: - Breaking link x2f1->x2...
[ Info: - Original links: Symbol[:x2]
[ Info: - New links: Symbol[]
[ Info: x2f1 doesn't have any other links, not adding it back...
[ Info: Get potentials x2,x1,:
Find potential functions for each clique
[ Info: using all factors among cliq variables
[ Info: finding all frontals for down WIP
Bayes Tree
[ Info: Solving over the Bayes (Junction) tree.
Building Bayes net...
[ Info:
[ Info: Eliminating x1
[ Info: ===============
[ Info:
[ Info: - Removing x1
Si = Symbol[:x2]
[ Info:
[ Info: Eliminating x2
[ Info: ===============
[ Info:
[ Info: - Removing x2
[ Info: Looking at x2f1
[ Info: - Breaking link x2f1->x2...
[ Info: - Original links: Symbol[:x2]
[ Info: - New links: Symbol[]
[ Info: x2f1 doesn't have any other links, not adding it back...
Find potential functions for each clique
[ Info: Get potentials x2,x1,:
[ Info: using all factors among cliq variables
[ Info: finding all frontals for down WIP
Bayes Tree
[ Info: Do tree based init-inference on tree
State machine iter=1
State machine iter=2
State machine iter=3
State machine iter=4
State machine iter=5
State machine iter=6
[ Info: up w 0 msgs
[ Info: ---------- successive fnc approx ------------x2,x1,:
[ Info: #1 --
[ Info: ---------- successive fnc approx ------------x2,x1,:
[ Info: #1 --
[ Info: [2x0p,d1,N100],
[ Info: #2 --
[ Info: [2x0p,d1,N100],
[ Info: #3 --
[ Info: [2x0p,d1,N100],
[ Info: fmcmc! -- solverData(vert=x2).inferdim=1.0
[ Info: fmcmc! -- solverData(vert=x1).inferdim=2.0
[ Info: Outgoing msg density on:
[ Info: prepCliqInitMsgsUp, seps=Symbol[]
State machine iter=7
State machine iter=8
[ Info: transferUpdateSubGraph! -- syms=Symbol[:x2, :x1]
[ Info: sym=x2, mem size of val=(1, 100) and (1, 100)
┌ Warning: Deprecated
└ @ IncrementalInference ~/.julia/packages/IncrementalInference/FweX2/src/FactorGraphTypes.jl:362
[ Info: sym=x1, mem size of val=(1, 100) and (1, 100)
┌ Warning: Deprecated
└ @ IncrementalInference ~/.julia/packages/IncrementalInference/FweX2/src/FactorGraphTypes.jl:362
State machine iter=9
[ Info: Finished tree based init-inference
Test Summary: | Pass Total
GenericWrapParam functors... | 114 114
[ Info: try doautoinit! of x1
[ Info: try doautoinit! of x1
[ Info: init with useinitfct Symbol[:x1f1]
[ Info: do init of x1
[ Info: try doautoinit! of x2
Statistics.mean(pts, dims=2) = [49.89886168575248]
[ Info: Solving over the Bayes (Junction) tree.
Building Bayes net...
[ Info:
[ Info: Eliminating x1
[ Info: ===============
[ Info:
[ Info: - Removing x1
Si = Symbol[:x2]
[ Info:
[ Info: Eliminating x2
[ Info: ===============
[ Info:
[ Info: - Removing x2
[ Info: Looking at x2f1
[ Info: - Breaking link x2f1->x2...
[ Info: - Original links: Symbol[:x2]
[ Info: - New links: Symbol[]
[ Info: x2f1 doesn't have any other links, not adding it back...
Find potential functions for each clique
[ Info: Get potentials x2,x1,:
[ Info: using all factors among cliq variables
[ Info: finding all frontals for down WIP
Bayes Tree
[ Info: Do tree based init-inference on tree
State machine iter=1
State machine iter=2
State machine iter=3
State machine iter=4
State machine iter=5
State machine iter=6
[ Info: up w 0 msgs
[ Info: ---------- successive fnc approx ------------x2,x1,:
[ Info: #1 --
[ Info: ---------- successive fnc approx ------------x2,x1,:
[ Info: #1 --
[ Info: [2x0p,d1,N100],
[ Info: #2 --
[ Info: [2x0p,d1,N100],
[ Info: #3 --
[ Info: [2x0p,d1,N100],
[ Info: fmcmc! -- solverData(vert=x2).inferdim=1.0
[ Info: fmcmc! -- solverData(vert=x1).inferdim=2.0
[ Info: Outgoing msg density on:
[ Info: prepCliqInitMsgsUp, seps=Symbol[]
State machine iter=7
State machine iter=8
[ Info: transferUpdateSubGraph! -- syms=Symbol[:x2, :x1]
[ Info: sym=x2, mem size of val=(1, 100) and (1, 100)
┌ Warning: Deprecated
└ @ IncrementalInference ~/.julia/packages/IncrementalInference/FweX2/src/FactorGraphTypes.jl:362
[ Info: sym=x1, mem size of val=(1, 100) and (1, 100)
┌ Warning: Deprecated
└ @ IncrementalInference ~/.julia/packages/IncrementalInference/FweX2/src/FactorGraphTypes.jl:362
State machine iter=9
[ Info: Finished tree based init-inference
Test Summary: | Pass Total
with simple local constraint examples Odo, Obsv2... | 2 2
[ Info: try doautoinit! of x1
[ Info: try doautoinit! of x1
[ Info: init with useinitfct Symbol[:x1f1]
[ Info: do init of x1
[ Info: try doautoinit! of x2
Test Summary: | Pass Total
test default userdata::FactorMetadata... | 2 2
Test Summary: | Pass Total
test IncrementalInference.assembleHypothesesElements! without multihypothesis... | 16 16
Test Summary: | Pass Total
test IncrementalInference.assembleHypothesesElements! with bi-modality... | 48 48
┌ Warning: only partially testing tri-modality
└ @ Main ~/.julia/packages/IncrementalInference/FweX2/test/testExplicitMultihypo.jl:321
Test Summary: | Pass Total
test IncrementalInference.assembleHypothesesElements! with tri-modality... | 84 84
[ Info: try doautoinit! of l1
[ Info: try doautoinit! of l2
[ Info: try doautoinit! of x1
[ Info: try doautoinit! of l1
[ Info: init with useinitfct Symbol[:l1f1]
[ Info: do init of l1
[ Info: try doautoinit! of l1_0
[ Info: try doautoinit! of x1
[ Info: allowing init from incomplete set of previously initialized hypotheses, fct=x1l1l1_0f1
[ Info: init with useinitfct Symbol[:x1l1l1_0f1]
[ Info: do init of x1
[ Info: not all hypotheses initialized, but at least one available -- see #427
[ Info: try doautoinit! of x2
[ Info: try doautoinit! of x2
[ Info: init with useinitfct Symbol[:x1x2f1]
[ Info: do init of x2
[ Info: try doautoinit! of l2
[ Info: allowing init from incomplete set of previously initialized hypotheses, fct=x2l2l2_0f1
[ Info: init with useinitfct Symbol[:x2l2l2_0f1, :l2f1]
[ Info: do init of l2
[ Info: not all hypotheses initialized, but at least one available -- see #427
[ Info: [2x0p,d1,N100],
[ Info: try doautoinit! of l2_0
[ Info: Solving over the Bayes (Junction) tree.
Building Bayes net...
[ Info:
[ Info: Eliminating x1
[ Info: ===============
[ Info:
[ Info: - Removing x1
Si = Symbol[:x2, :l1, :l1_0]
[ Info:
[ Info: Eliminating l2
[ Info: ===============
[ Info:
[ Info: - Removing l2
Si = Symbol[:x2, :l2_0]
[ Info:
[ Info: Eliminating l1
[ Info: ===============
[ Info:
[ Info: - Removing l1
[ Info: Looking at x2l1l1_0f1
[ Info: - Breaking link x2l1l1_0f1->l1...
[ Info: - Original links: Symbol[:x2, :l1, :l1_0]
[ Info: - New links: Symbol[:x2, :l1_0]
[ Info: x2l1l1_0f1 still has links to other variables, readding it back...
Si = Symbol[:x2, :l1_0]
[ Info:
[ Info: Eliminating x2
[ Info: ===============
[ Info:
[ Info: - Removing x2
[ Info: Looking at x2l2_0f1
[ Info: - Breaking link x2l2_0f1->x2...
[ Info: - Original links: Symbol[:x2, :l2_0]
[ Info: - New links: Symbol[:l2_0]
[ Info: x2l2_0f1 still has links to other variables, readding it back...
[ Info: Looking at x2l1_0f1
[ Info: - Breaking link x2l1_0f1->x2...
[ Info: - Original links: Symbol[:x2, :l1_0]
[ Info: - New links: Symbol[:l1_0]
[ Info: x2l1_0f1 still has links to other variables, readding it back...
[ Info: Looking at x2l1_0f2
[ Info: - Breaking link x2l1_0f2->x2...
[ Info: - Original links: Symbol[:x2, :l1_0]
[ Info: - New links: Symbol[:l1_0]
[ Info: x2l1_0f2 still has links to other variables, readding it back...
Si = Symbol[:l2_0, :l1_0]
[ Info:
[ Info: Eliminating l2_0
[ Info: ===============
[ Info:
[ Info: - Removing l2_0
[ Info: Looking at l2_0f1
[ Info: - Breaking link l2_0f1->l2_0...
[ Info: - Original links: Symbol[:l2_0]
[ Info: - New links: Symbol[]
[ Info: l2_0f1 doesn't have any other links, not adding it back...
[ Info: Looking at l2_0l1_0f1
[ Info: - Breaking link l2_0l1_0f1->l2_0...
[ Info: - Original links: Symbol[:l2_0, :l1_0]
[ Info: - New links: Symbol[:l1_0]
[ Info: l2_0l1_0f1 still has links to other variables, readding it back...
Si = Symbol[:l1_0]
[ Info:
[ Info: Eliminating l1_0
[ Info: ===============
[ Info:
[ Info: - Removing l1_0
[ Info: Looking at l1_0f2
[ Info: - Breaking link l1_0f2->l1_0...
[ Info: - Original links: Symbol[:l1_0]
[ Info: - New links: Symbol[]
[ Info: l1_0f2 doesn't have any other links, not adding it back...
[ Info: Looking at l1_0f4
[ Info: - Breaking link l1_0f4->l1_0...
[ Info: - Original links: Symbol[:l1_0]
[ Info: - New links: Symbol[]
[ Info: l1_0f4 doesn't have any other links, not adding it back...
[ Info: Looking at l1_0f1
[ Info: - Breaking link l1_0f1->l1_0...
[ Info: - Original links: Symbol[:l1_0]
[ Info: - New links: Symbol[]
[ Info: l1_0f1 doesn't have any other links, not adding it back...
[ Info: Looking at l1_0f3
[ Info: - Breaking link l1_0f3->l1_0...
[ Info: - Original links: Symbol[:l1_0]
[ Info: - New links: Symbol[]
[ Info: l1_0f3 doesn't have any other links, not adding it back...
Find potential functions for each clique
[ Info: Get potentials l1,x1,: x2,l1_0,
[ Info: using all factors among cliq variables
[ Info: finding all frontals for down WIP
[ Info: Get potentials l2,: x2,l2_0,
[ Info: using all factors among cliq variables
[ Info: finding all frontals for down WIP
[ Info: Get potentials l1_0,l2_0,x2,:
[ Info: using all factors among cliq variables
[ Info: finding all frontals for down WIP
[ Info: cliq=1 adding factor that is no in separator, x1
[ Info: cliq=1 adding factor that is no in separator, l1
[ Info: cliq=1 adding factor that is no in separator, l2
[ Info: cliq=1 adding factor that is no in separator, l2
[ Info: cliq=1 adding factor that is no in separator, x1
Bayes Tree
[ Info: Do tree based init-inference on tree
State machine iter=1
State machine iter=2
State machine iter=3
State machine iter=4
State machine iter=1
State machine iter=2
State machine iter=3
State machine iter=4
State machine iter=5
State machine iter=6
State machine iter=7
State machine iter=8
[ Info: up w 0 msgs
[ Info: ---------- successive fnc approx ------------l1,x1,: x2,l1_0,
[ Info: #1 --
State machine iter=1
State machine iter=2[ Info: ---------- successive fnc approx ------------l1,x1,: x2,l1_0,
[ Info: #1 --
State machine iter=3[ Info: [2x0p,d1,N100],
[ Info: [2x0p,d1,N100],
State machine iter=4
[ Info: #2 --
[ Info: [2x0p,d1,N100],
State machine iter=5
[ Info: [2x0p,d1,N100],
[ Info: #3 --
State machine iter=6[ Info: [2x0p,d1,N100],
[ Info: [2x0p,d1,N100],
State machine iter=7[ Info: fmcmc! -- solverData(vert=x2).inferdim=0.0
[ Info: fmcmc! -- solverData(vert=l1_0).inferdim=0.0
State machine iter=8
[ Info: fmcmc! -- solverData(vert=l1).inferdim=1.0
[ Info: fmcmc! -- solverData(vert=x1).inferdim=0.0
[ Info: up w 0 msgs
[ Info: Outgoing msg density on:
[ Info: ---------- successive fnc approx ------------l2,: x2,l2_0,
[ Info: prepCliqInitMsgsUp, seps=Symbol[:x2, :l1_0]
[ Info: #1 --
[ Info: ---------- successive fnc approx ------------l2,: x2,l2_0,
[ Info: #1 --
[ Info: [2x0p,d1,N100],
[ Info: #2 --
[ Info: [2x0p,d1,N100],
State machine iter=9
[ Info: #3 --
[ Info: [2x0p,d1,N100],
State machine iter=10[ Info: fmcmc! -- solverData(vert=x2).inferdim=0.0
[ Info: fmcmc! -- solverData(vert=l2_0).inferdim=0.0
[ Info: fmcmc! -- solverData(vert=l2).inferdim=1.0
[ Info: Outgoing msg density on:
[ Info: prepCliqInitMsgsUp, seps=Symbol[:x2, :l2_0]
State machine iter=5
State machine iter=6
[ Info: up w 2 msgs
State machine iter=9
[ Info: inp.sendmsgs[x2].inferdim=0.0
[ Info: inp.sendmsgs[l1_0].inferdim=0.0
State machine iter=10
[ Info: inp.sendmsgs[l2_0].inferdim=0.0
[ Info: inp.sendmsgs[x2].inferdim=0.0
[ Info: ---------- successive fnc approx ------------l1_0,l2_0,x2,:
[ Info: #1 --
[ Info: fmcmc! -- solverData(vert=l1_0).inferdim=0.0
[ Info: fmcmc! -- solverData(vert=l2_0).inferdim=0.0
[ Info: ---------- successive fnc approx ------------l1_0,l2_0,x2,:
[ Info: #1 --
[ Info: [2x0p,d1,N100],
[ Info: fmcmc! -- solverData(vert=l1_0).inferdim=0.0
[ Info: fmcmc! -- solverData(vert=l2_0).inferdim=0.0
[ Info: fmcmc! -- solverData(vert=x2).inferdim=0.0
[ Info: Outgoing msg density on:
[ Info: prepCliqInitMsgsUp, seps=Symbol[]
State machine iter=7
State machine iter=8
[ Info: transferUpdateSubGraph! -- syms=Symbol[:l1_0, :l2_0, :x2]
[ Info: sym=l1_0, mem size of val=(1, 100) and (1, 100)
┌ Warning: Deprecated
└ @ IncrementalInference ~/.julia/packages/IncrementalInference/FweX2/src/FactorGraphTypes.jl:362
[ Info: sym=l2_0, mem size of val=(1, 100) and (1, 100)
┌ Warning: Deprecated
└ @ IncrementalInference ~/.julia/packages/IncrementalInference/FweX2/src/FactorGraphTypes.jl:362
[ Info: sym=x2, mem size of val=(1, 100) and (1, 100)
┌ Warning: Deprecated
└ @ IncrementalInference ~/.julia/packages/IncrementalInference/FweX2/src/FactorGraphTypes.jl:362
State machine iter=11
[ Info: [2x0p,d1,N100],
State machine iter=11[ Info: [2x0p,d1,N100],
[ Info: [2x0p,d1,N100],
[ Info: [2x0p,d1,N100],
State machine iter=9[ Info: [2x0p,d1,N100],
[ Info: [2x0p,d1,N100],
[ Info: [2x0p,d1,N100],
State machine iter=12
State machine iter=12
[ Info: Finished tree based init-inference
Test Summary: |
test CSM runaway on upsolve, (issue 427) | No tests
[ Info: try doautoinit! of l0
[ Info: try doautoinit! of l1
[ Info: try doautoinit! of x0
[ Info: try doautoinit! of l0
[ Info: init with useinitfct Symbol[:l0f1]
[ Info: do init of l0
[ Info: try doautoinit! of l1
[ Info: init with useinitfct Symbol[:l1f1]
[ Info: do init of l1
[ Info: try doautoinit! of x0
[ Info: init with useinitfct Symbol[:x0l0l1f1]
[ Info: do init of x0
[ Info: try doautoinit! of x1
[ Info: try doautoinit! of x1
[ Info: init with useinitfct Symbol[:x1l0l1f1, :x0x1f1]
[ Info: do init of x1
[ Info: [2x0p,d1,N200],
[ Info: try doautoinit! of x2
[ Info: Solving over the Bayes (Junction) tree.
Building Bayes net...
[ Info:
[ Info: Eliminating x1
[ Info: ===============
[ Info:
[ Info: - Removing x1
Si = Symbol[:x2, :l0, :l1, :x0]
[ Info:
[ Info: Eliminating l1
[ Info: ===============
[ Info:
[ Info: - Removing l1
[ Info: Looking at x2l0l1x0f1
[ Info: - Breaking link x2l0l1x0f1->l1...
[ Info: - Original links: Symbol[:x2, :l0, :l1, :x0]
[ Info: - New links: Symbol[:x2, :l0, :x0]
[ Info: x2l0l1x0f1 still has links to other variables, readding it back...
Si = Symbol[:x0, :l0, :x2]
[ Info:
[ Info: Eliminating l0
[ Info: ===============
[ Info:
[ Info: - Removing l0
[ Info: Looking at x2l0x0f1
[ Info: - Breaking link x2l0x0f1->l0...
[ Info: - Original links: Symbol[:x2, :l0, :x0]
[ Info: - New links: Symbol[:x2, :x0]
[ Info: x2l0x0f1 still has links to other variables, readding it back...
[ Info: Looking at x0l0x2f1
[ Info: - Breaking link x0l0x2f1->l0...
[ Info: - Original links: Symbol[:x0, :l0, :x2]
[ Info: - New links: Symbol[:x0, :x2]
[ Info: x0l0x2f1 still has links to other variables, readding it back...
Si = Symbol[:x2, :x0]
[ Info:
[ Info: Eliminating x0
[ Info: ===============
[ Info:
[ Info: - Removing x0
[ Info: Looking at x0x2f1
[ Info: - Breaking link x0x2f1->x0...
[ Info: - Original links: Symbol[:x0, :x2]
[ Info: - New links: Symbol[:x2]
[ Info: x0x2f1 still has links to other variables, readding it back...
[ Info: Looking at x2x0f2
[ Info: - Breaking link x2x0f2->x0...
[ Info: - Original links: Symbol[:x2, :x0]
[ Info: - New links: Symbol[:x2]
[ Info: x2x0f2 still has links to other variables, readding it back...
[ Info: Looking at x2x0f1
[ Info: - Breaking link x2x0f1->x0...
[ Info: - Original links: Symbol[:x2, :x0]
[ Info: - New links: Symbol[:x2]
[ Info: x2x0f1 still has links to other variables, readding it back...
Si = Symbol[:x2]
[ Info:
[ Info: Eliminating x2
[ Info: ===============
[ Info:
[ Info: - Removing x2
[ Info: Looking at x2f1
[ Info: - Breaking link x2f1->x2...
[ Info: - Original links: Symbol[:x2]
[ Info: - New links: Symbol[]
[ Info: x2f1 doesn't have any other links, not adding it back...
[ Info: Looking at x2f4
[ Info: - Breaking link x2f4->x2...
[ Info: - Original links: Symbol[:x2]
[ Info: - New links: Symbol[]
[ Info: x2f4 doesn't have any other links, not adding it back...
[ Info: Looking at x2f2
[ Info: - Breaking link x2f2->x2...
[ Info: - Original links: Symbol[:x2]
[ Info: - New links: Symbol[]
[ Info: x2f2 doesn't have any other links, not adding it back...
[ Info: Looking at x2f3
[ Info: - Breaking link x2f3->x2...
[ Info: - Original links: Symbol[:x2]
[ Info: - New links: Symbol[]
[ Info: x2f3 doesn't have any other links, not adding it back...
Find potential functions for each clique
[ Info: Get potentials x2,x0,l0,l1,x1,:
[ Info: using all factors among cliq variables
[ Info: finding all frontals for down WIP
Bayes Tree
[ Info: Do tree based init-inference on tree
State machine iter=1
State machine iter=2
State machine iter=3
State machine iter=4
State machine iter=5
State machine iter=6
[ Info: up w 0 msgs
[ Info: ---------- successive fnc approx ------------x2,x0,l0,l1,x1,:
[ Info: #1 --
[ Info: ---------- successive fnc approx ------------x2,x0,l0,l1,x1,:
[ Info: #1 --
[ Info: [2x0p,d1,N200],
[ Info: [3x0p,d1,N200],
[ Info: [3x0p,d1,N200],
[ Info: [3x0p,d1,N200],
[ Info: #2 --
[ Info: [2x0p,d1,N200],
[ Info: [3x0p,d1,N200],
[ Info: [3x0p,d1,N200],
[ Info: [3x0p,d1,N200],
[ Info: #3 --
[ Info: [2x0p,d1,N200],
[ Info: [3x0p,d1,N200],
[ Info: [3x0p,d1,N200],
[ Info: [3x0p,d1,N200],
[ Info: fmcmc! -- solverData(vert=x2).inferdim=1.0
[ Info: fmcmc! -- solverData(vert=x0).inferdim=2.0
[ Info: fmcmc! -- solverData(vert=l0).inferdim=3.0
[ Info: fmcmc! -- solverData(vert=l1).inferdim=3.0
[ Info: fmcmc! -- solverData(vert=x1).inferdim=3.0
[ Info: Outgoing msg density on:
[ Info: prepCliqInitMsgsUp, seps=Symbol[]
State machine iter=7
State machine iter=8
[ Info: transferUpdateSubGraph! -- syms=Symbol[:x2, :x0, :l0, :l1, :x1]
[ Info: sym=x2, mem size of val=(1, 200) and (1, 200)
┌ Warning: Deprecated
└ @ IncrementalInference ~/.julia/packages/IncrementalInference/FweX2/src/FactorGraphTypes.jl:362
[ Info: sym=x0, mem size of val=(1, 200) and (1, 200)
┌ Warning: Deprecated
└ @ IncrementalInference ~/.julia/packages/IncrementalInference/FweX2/src/FactorGraphTypes.jl:362
[ Info: sym=l0, mem size of val=(1, 200) and (1, 200)
┌ Warning: Deprecated
└ @ IncrementalInference ~/.julia/packages/IncrementalInference/FweX2/src/FactorGraphTypes.jl:362
[ Info: sym=l1, mem size of val=(1, 200) and (1, 200)
┌ Warning: Deprecated
└ @ IncrementalInference ~/.julia/packages/IncrementalInference/FweX2/src/FactorGraphTypes.jl:362
[ Info: sym=x1, mem size of val=(1, 200) and (1, 200)
┌ Warning: Deprecated
└ @ IncrementalInference ~/.julia/packages/IncrementalInference/FweX2/src/FactorGraphTypes.jl:362
State machine iter=9
[ Info: Finished tree based init-inference
Test Summary: | Pass Total
2door basic binary multihypothesis tests... | 5 5
Threads.nthreads() = 1
[ Info: try doautoinit! of x0
[ Info: try doautoinit! of x0
[ Info: init with useinitfct Symbol[:x0f1]
[ Info: do init of x0
[ Info: try doautoinit! of x1
Test Summary: | Pass Total
Basic ContinuousScalar example to ensure multithreaded convolutions work... | 1 1
maniT = if length(manifolds) < x
([manifolds[1] for i = 1:x]...,)
else
manifolds
end = (:Euclid, :Euclid)
[ Info: try doautoinit! of x1
[ Info: try doautoinit! of x1
[ Info: init with useinitfct Symbol[:x1f1, :x1f2]
[ Info: do init of x1
[ Info: [1x1p,d2,N100],
Building Bayes net...
[ Info:
[ Info: Eliminating x1
[ Info: ===============
[ Info:
[ Info: - Removing x1
[ Info: Get potentials x1,:
[ Info: using all factors among cliq variables
Find potential functions for each clique
[ Info: finding all frontals for down WIP
Bayes Tree
[ Info: Solving over the Bayes (Junction) tree.
[ Info: Do tree based init-inference on tree
State machine iter=1
State machine iter=2
State machine iter=3
[ Info: up w 0 msgs
[ Info: ---------- successive fnc approx ------------x1,:
[ Info: #1 --
[ Info: ---------- successive fnc approx ------------x1,:
[ Info: #1 --
State machine iter=4
State machine iter=5
State machine iter=6
[ Info: [1x1p,d2,N100],
[ Info: fmcmc! -- solverData(vert=x1).inferdim=2.0
[ Info: Outgoing msg density on:
[ Info: prepCliqInitMsgsUp, seps=Symbol[]
State machine iter=7
State machine iter=8
[ Info: transferUpdateSubGraph! -- syms=Symbol[:x1]
[ Info: sym=x1, mem size of val=(2, 100) and (2, 100)
┌ Warning: Deprecated
└ @ IncrementalInference ~/.julia/packages/IncrementalInference/FweX2/src/FactorGraphTypes.jl:362
State machine iter=9
[ Info: Finished tree based init-inference
maniT = if length(manifolds) < x
([manifolds[1] for i = 1:x]...,)
else
manifolds
end = (:Euclid, :Euclid)
[ Info: try doautoinit! of x2
[ Info: try doautoinit! of x2
[ Info: init with useinitfct Symbol[:x1x2f1, :x2f1]
[ Info: do init of x2
[ Info: [0x2p,d2,N100],
┌ Warning: restore findRelatedFromPotential as testset!
└ @ Main ~/.julia/packages/IncrementalInference/FweX2/test/testpartialconstraint.jl:122
X2lpts[2, 95:100] = [9.172243309460274, 11.452505880031945, 8.291260559727107, 9.834986622030799, 11.254814628590713, 10.152872152753545]
lpts[2, 95:100] = [9.984652230521458, 10.718722155167894, 9.652376815711072, 8.140964344640278, 10.837215875561228, 8.805611080355355]
getPoints(keepaside) = [-19.19279416231592 -20.509809890168388 -18.874876379133404 -20.2084520781843 -20.147012028144665 -19.680561960950072 -19.98111963885341 -20.09010342014423 -17.257233163293865 -20.974353052306256 -19.1271523935143 -20.23257946753028 -20.077574138400948 -20.370698428838935 -20.984374385079192 -18.748407217211067 -20.091070939923963 -20.827568082455617 -20.706652791154394 -19.39320801662916 -19.52923222620011 -20.114682022195915 -21.01790413466925 -20.0429183723625 -19.25447166247261 -20.37092026199939 -20.223047485092348 -18.54479910044559 -20.1908689132824 -18.684986636402822 -20.937445439697417 -18.12347031274725 -20.925202140736673 -20.933602729332495 -19.77765211939588 -19.885840646368408 -21.941685308749186 -19.98876689129342 -19.762538553078826 -18.996815897068537 -19.95449408246089 -20.538823309896216 -20.02454871448312 -18.840005455074895 -19.608142858983335 -19.22733514386932 -21.62499748154291 -19.37231944467145 -18.7110179734474 -20.446937265949167 -21.39627448323529 -21.214991444840006 -19.719313988138214 -19.23006378704295 -19.903110108748315 -19.025375609413803 -18.978094973414773 -19.406810614941072 -19.739517728463397 -19.740779727527457 -19.864331620150406 -20.079844158063747 -20.71133561829081 -20.659995525279612 -20.729092122097573 -18.360732058822297 -20.751640896295772 -20.08245406442757 -18.910782016403235 -19.85191190775807 -20.895966609033415 -17.43001873379454 -21.18612522031391 -20.93096701649852 -21.123211416789456 -19.57809494543341 -20.002686582373503 -20.127268594932776 -18.114871121191687 -20.454926738147474 -18.259450759811152 -20.49371045171742 -21.188809180846782 -19.479054375249344 -20.837684045750827 -19.294328027576 -19.3224198364716 -19.691628401103017 -20.00726259349803 -19.98714250569567 -18.88138858057191 -21.428468041000166 -21.38584479214771 -19.799968136070106 -19.579378525446728 -20.238137314749423 -19.598565430669005 -21.08627006187524 -21.22880179148038 -19.401395232376498; 9.50574057446152 10.462202473428185 8.92839107845342 12.903001583746317 10.785993141488232 8.554235750893453 9.591997195037427 10.296405596729915 11.740050365618703 10.154353906019452 10.371617433996612 11.478401885079183 9.102127943066797 10.631167412694767 10.625931851746817 9.683506110350866 12.1601265897505 10.59545963083675 9.185116224958541 9.97432468082676 11.58297188349041 10.688329490566055 10.354097623710762 9.729983468390108 9.908119237197429 10.355156791211014 10.469132889368636 9.165761111659862 9.654341079109297 9.91995437607202 10.884093144698097 10.037415445948154 9.878941081195958 11.584662067412571 9.839163110515639 11.101226914445167 11.091655611791898 10.765207107132516 8.438077792971194 9.008596516201088 9.197405131592847 9.71611093985233 10.767710729076681 8.88221381640102 10.59409825517828 10.18658165527664 9.65563598768627 9.174338588078175 7.730346271091823 9.520264305216333 8.881885198886577 9.683374178330348 9.767476740457244 10.4753011908884 9.332777260059444 11.067508021853103 10.618836219777164 9.34831188848554 9.113596906960272 12.866257518917998 9.61228177053782 12.388211839964528 11.632540867788288 10.156792670498948 9.659751249882566 8.436441712627486 11.38680276384771 9.8518567923649 9.486094706857747 10.674821593860017 11.51277289111058 10.433899500850696 10.661581671551918 9.186284723707766 10.133807102489447 10.833264886046239 9.244203283960355 8.111172619843131 10.66115355375445 9.702804535380828 11.134900050623513 11.000582853724316 9.89716299541182 9.61021015535652 8.689307105700468 10.567471827174515 8.485165488227187 10.865950417317608 12.124098738358262 10.37536232532195 11.357748657978911 8.963684273057945 9.613921140142843 10.023664610160687 9.984652230521458 10.718722155167894 9.652376815711072 8.140964344640278 10.837215875561228 8.805611080355355]
[ Info: [0x1p,d2,N100],
[ Info: [0x1p,d2,N100],
[ Info: [0x2p,d2,N100],
Building Bayes net...
[ Info:
[ Info: Eliminating x1
[ Info: ===============
[ Info:
[ Info: - Removing x1
Si = Symbol[:x2]
[ Info:
[ Info: Eliminating x2
[ Info: ===============
[ Info:
[ Info: - Removing x2
[ Info: Looking at x2f2
[ Info: - Breaking link x2f2->x2...
[ Info: - Original links: Symbol[:x2]
[ Info: - New links: Symbol[]
[ Info: x2f2 doesn't have any other links, not adding it back...
Find potential functions for each clique
[ Info: Get potentials x2,x1,:
[ Info: using all factors among cliq variables
[ Info: finding all frontals for down WIP
Bayes Tree
[ Info: Solving over the Bayes (Junction) tree.
[ Info: Do tree based init-inference on tree
State machine iter=1
State machine iter=2
State machine iter=3
[ Info: up w 0 msgs
[ Info: ---------- successive fnc approx ------------x2,x1,:
[ Info: #1 --
[ Info: ---------- successive fnc approx ------------x2,x1,:
[ Info: #1 --
State machine iter=4
State machine iter=5
State machine iter=6
[ Info: [0x2p,d2,N100],
[ Info: [1x2p,d2,N100],
[ Info: #2 --
[ Info: [0x2p,d2,N100],
[ Info: [1x2p,d2,N100],
[ Info: #3 --
[ Info: [0x2p,d2,N100],
[ Info: [1x2p,d2,N100],
[ Info: fmcmc! -- solverData(vert=x2).inferdim=0.0
[ Info: fmcmc! -- solverData(vert=x1).inferdim=2.0
[ Info: Outgoing msg density on:
[ Info: prepCliqInitMsgsUp, seps=Symbol[]
State machine iter=7
State machine iter=8
[ Info: transferUpdateSubGraph! -- syms=Symbol[:x2, :x1]
[ Info: sym=x2, mem size of val=(2, 100) and (2, 100)
┌ Warning: Deprecated
└ @ IncrementalInference ~/.julia/packages/IncrementalInference/FweX2/src/FactorGraphTypes.jl:362
[ Info: sym=x1, mem size of val=(2, 100) and (2, 100)
┌ Warning: Deprecated
└ @ IncrementalInference ~/.julia/packages/IncrementalInference/FweX2/src/FactorGraphTypes.jl:362
State machine iter=9
[ Info: Finished tree based init-inference
Test Summary: | Pass Total
partial constraints... | 42 42
[ Info: try doautoinit! of x1
┌ Warning: FunctorSingletonNH will be deprecated in favor of common `nullhypo=` interface.
└ @ IncrementalInference ~/.julia/packages/IncrementalInference/FweX2/src/ApproxConv.jl:273
Test Summary: | Pass Total
null hypothesis... | 2 2
[ Info: try doautoinit! of x1
[ Info: x1 is not initialized, and will do so now...
[ Info: try doautoinit! of x1
[ Info: init with useinitfct Symbol[:x1f1]
[ Info: do init of x1
[ Info: try doautoinit! of x2
[ Info: x2 is not initialized, and will do so now...
[ Info: try doautoinit! of x2
[ Info: init with useinitfct Symbol[:x1x2f1]
[ Info: do init of x2
[ Info: try doautoinit! of x3
[ Info: try doautoinit! of x4
Packing converters
[ Info: try doautoinit! of x1
[ Info: x1 is not initialized, and will do so now...
[ Info: try doautoinit! of x1
[ Info: init with useinitfct Symbol[:x1f1]
[ Info: do init of x1
[ Info: try doautoinit! of x2
[ Info: x2 is not initialized, and will do so now...
[ Info: try doautoinit! of x2
[ Info: init with useinitfct Symbol[:x1x2f1]
[ Info: do init of x2
[ Info: try doautoinit! of x3
[ Info: try doautoinit! of x4
[ Info: try doautoinit! of x5
Test Summary: | Pass Total
standardized multihypothesis... | 32 32
[ Info: try doautoinit! of x0
[ Info: try doautoinit! of x0
[ Info: init with useinitfct Symbol[:x0f1]
[ Info: do init of x0
[ Info: try doautoinit! of x2
[ Info: try doautoinit! of x2
[ Info: init with useinitfct Symbol[:x0x2f1]
[ Info: do init of x2
[ Info: try doautoinit! of x3
[ Info: try doautoinit! of x3
[ Info: init with useinitfct Symbol[:x3f1, :x2x3f1]
[ Info: do init of x3
[ Info: [2x0p,d1,N100],
[ Info: try doautoinit! of x4
[ Info: try doautoinit! of l1
[ Info: try doautoinit! of x4
[ Info: init with useinitfct Symbol[:x3x4f1]
[ Info: do init of x4
[ Info: try doautoinit! of l1
[ Info: init with useinitfct Symbol[:x3l1f1, :x4l1f1]
[ Info: do init of l1
[ Info: [2x0p,d1,N100],
[ Info: try doautoinit! of x5
[ Info: try doautoinit! of x5
[ Info: init with useinitfct Symbol[:x4x5f1]
[ Info: do init of x5
[ Info: try doautoinit! of x6
[ Info: try doautoinit! of x6
[ Info: init with useinitfct Symbol[:x5x6f1]
[ Info: do init of x6
[ Info: try doautoinit! of x7
[ Info: try doautoinit! of x7
[ Info: init with useinitfct Symbol[:x6x7f1, :x7f1]
[ Info: do init of x7
[ Info: [2x0p,d1,N100],
[ Info: Solving over the Bayes (Junction) tree.
Building Bayes net...
[ Info:
[ Info: Eliminating x3
[ Info: ===============
[ Info:
[ Info: - Removing x3
Si = Symbol[:l1, :x4, :x2]
[ Info:
[ Info: Eliminating x4
[ Info: ===============
[ Info:
[ Info: - Removing x4
[ Info: Looking at l1x4x2f1
[ Info: - Breaking link l1x4x2f1->x4...
[ Info: - Original links: Symbol[:l1, :x4, :x2]
[ Info: - New links: Symbol[:l1, :x2]
[ Info: l1x4x2f1 still has links to other variables, readding it back...
Si = Symbol[:l1, :x2, :x5]
[ Info:
[ Info: Eliminating x7
[ Info: ===============
[ Info:
[ Info: - Removing x7
Si = Symbol[:x6]
[ Info:
[ Info: Eliminating x0
[ Info: ===============
[ Info:
[ Info: - Removing x0
Si = Symbol[:x2]
[ Info:
[ Info: Eliminating x5
[ Info: ===============
[ Info:
[ Info: - Removing x5
[ Info: Looking at l1x2x5f1
[ Info: - Breaking link l1x2x5f1->x5...
[ Info: - Original links: Symbol[:l1, :x2, :x5]
[ Info: - New links: Symbol[:l1, :x2]
[ Info: l1x2x5f1 still has links to other variables, readding it back...
Si = Symbol[:x6, :l1, :x2]
[ Info:
[ Info: Eliminating l1
[ Info: ===============
[ Info:
[ Info: - Removing l1
[ Info: Looking at l1x2f1
[ Info: - Breaking link l1x2f1->l1...
[ Info: - Original links: Symbol[:l1, :x2]
[ Info: - New links: Symbol[:x2]
[ Info: l1x2f1 still has links to other variables, readding it back...
[ Info: Looking at l1x2f2
[ Info: - Breaking link l1x2f2->l1...
[ Info: - Original links: Symbol[:l1, :x2]
[ Info: - New links: Symbol[:x2]
[ Info: l1x2f2 still has links to other variables, readding it back...
[ Info: Looking at x6l1x2f1
[ Info: - Breaking link x6l1x2f1->l1...
[ Info: - Original links: Symbol[:x6, :l1, :x2]
[ Info: - New links: Symbol[:x6, :x2]
[ Info: x6l1x2f1 still has links to other variables, readding it back...
Si = Symbol[:x2, :x6]
[ Info:
[ Info: Eliminating x2
[ Info: ===============
[ Info:
[ Info: - Removing x2
[ Info: Looking at x2x6f1
[ Info: - Breaking link x2x6f1->x2...
[ Info: - Original links: Symbol[:x2, :x6]
[ Info: - New links: Symbol[:x6]
[ Info: x2x6f1 still has links to other variables, readding it back...
[ Info: Looking at x6x2f1
[ Info: - Breaking link x6x2f1->x2...
[ Info: - Original links: Symbol[:x6, :x2]
[ Info: - New links: Symbol[:x6]
[ Info: x6x2f1 still has links to other variables, readding it back...
[ Info: Looking at x2f1
[ Info: - Breaking link x2f1->x2...
[ Info: - Original links: Symbol[:x2]
[ Info: - New links: Symbol[]
[ Info: x2f1 doesn't have any other links, not adding it back...
[ Info: Looking at x2f3
[ Info: - Breaking link x2f3->x2...
[ Info: - Original links: Symbol[:x2]
[ Info: - New links: Symbol[]
[ Info: x2f3 doesn't have any other links, not adding it back...
[ Info: Looking at x2f2
[ Info: - Breaking link x2f2->x2...
[ Info: - Original links: Symbol[:x2]
[ Info: - New links: Symbol[]
[ Info: x2f2 doesn't have any other links, not adding it back...
Si = Symbol[:x6]
[ Info:
[ Info: Eliminating x6
[ Info: ===============
[ Info:
[ Info: - Removing x6
[ Info: Looking at x6f4
[ Info: - Breaking link x6f4->x6...
[ Info: - Original links: Symbol[:x6]
[ Info: - New links: Symbol[]
[ Info: x6f4 doesn't have any other links, not adding it back...
[ Info: Looking at x6f3
[ Info: - Breaking link x6f3->x6...
[ Info: - Original links: Symbol[:x6]
[ Info: - New links: Symbol[]
[ Info: x6f3 doesn't have any other links, not adding it back...
[ Info: Looking at x6f1
[ Info: - Breaking link x6f1->x6...
[ Info: - Original links: Symbol[:x6]
[ Info: - New links: Symbol[]
[ Info: x6f1 doesn't have any other links, not adding it back...
[ Info: Looking at x6f2
[ Info: - Breaking link x6f2->x6...
[ Info: - Original links: Symbol[:x6]
[ Info: - New links: Symbol[]
[ Info: x6f2 doesn't have any other links, not adding it back...
Find potential functions for each clique
[ Info: Get potentials x0,: x2,
[ Info: using all factors among cliq variables
[ Info: finding all frontals for down WIP
[ Info: Get potentials x7,: x6,
[ Info: using all factors among cliq variables
[ Info: finding all frontals for down WIP
[ Info: Get potentials x3,: l1,x4,x2,
[ Info: using all factors among cliq variables
[ Info: finding all frontals for down WIP
[ Info: Get potentials x4,: l1,x2,x5,
[ Info: using all factors among cliq variables
[ Info: finding all frontals for down WIP
[ Info: cliq=4 adding factor that is no in separator, x3
[ Info: Get potentials x6,x2,l1,x5,:
[ Info: using all factors among cliq variables
Bayes Tree
[ Info: finding all frontals for down WIP
[ Info: cliq=1 adding factor that is no in separator, x7
[ Info: cliq=1 adding factor that is no in separator, x3
[ Info: cliq=1 adding factor that is no in separator, x0
[ Info: cliq=1 adding factor that is no in separator, x3
[ Info: cliq=1 adding factor that is no in separator, x4
[ Info: cliq=1 adding factor that is no in separator, x4
[ Info: Do tree based init-inference on tree
State machine iter=1
State machine iter=2
State machine iter=3
State machine iter=4
State machine iter=1
State machine iter=2
State machine iter=3
State machine iter=4
State machine iter=5
State machine iter=6
State machine iter=7
State machine iter=8
State machine iter=1
State machine iter=2
State machine iter=3[ Info: up w 0 msgs
[ Info: ---------- successive fnc approx ------------x0,: x2,
[ Info: #1 --
[ Info: ---------- successive fnc approx ------------x0,: x2,
[ Info: #1 --
[ Info: [2x0p,d1,N100],
[ Info: #2 --
State machine iter=4[ Info: [2x0p,d1,N100],
[ Info: #3 --
State machine iter=5[ Info: [2x0p,d1,N100],
[ Info: fmcmc! -- solverData(vert=x2).inferdim=1.0
State machine iter=6[ Info: fmcmc! -- solverData(vert=x0).inferdim=2.0
[ Info: Outgoing msg density on:
State machine iter=7
[ Info: prepCliqInitMsgsUp, seps=Symbol[:x2]
State machine iter=8
State machine iter=1[ Info: up w 0 msgs
[ Info: ---------- successive fnc approx ------------x7,: x6,
[ Info: #1 --
State machine iter=2[ Info: ---------- successive fnc approx ------------x7,: x6,
[ Info: #1 --
State machine iter=3[ Info: [2x0p,d1,N100],
[ Info: #2 --
State machine iter=4[ Info: [2x0p,d1,N100],
[ Info: #3 --
State machine iter=9[ Info: [2x0p,d1,N100],
[ Info: fmcmc! -- solverData(vert=x6).inferdim=1.0
State machine iter=10[ Info: fmcmc! -- solverData(vert=x7).inferdim=2.0
[ Info: Outgoing msg density on:
[ Info: prepCliqInitMsgsUp, seps=Symbol[:x6]
State machine iter=1
State machine iter=2
State machine iter=3
State machine iter=4
State machine iter=5
State machine iter=6
State machine iter=7
State machine iter=8
[ Info: up w 0 msgs
[ Info: ---------- successive fnc approx ------------x3,: l1,x4,x2,
[ Info: #1 --
[ Info: ---------- successive fnc approx ------------x3,: l1,x4,x2,
[ Info: #1 --
[ Info: [2x0p,d1,N100],
[ Info: [2x0p,d1,N100],
[ Info: [4x0p,d1,N100],
State machine iter=9[ Info: #2 --
[ Info: [2x0p,d1,N100],
State machine iter=10[ Info: [2x0p,d1,N100],
[ Info: [4x0p,d1,N100],
[ Info: #3 --
[ Info: [2x0p,d1,N100],
[ Info: [2x0p,d1,N100],
[ Info: [4x0p,d1,N100],
[ Info: fmcmc! -- solverData(vert=x2).inferdim=1.0
[ Info: fmcmc! -- solverData(vert=l1).inferdim=2.0
[ Info: fmcmc! -- solverData(vert=x4).inferdim=2.0
[ Info: fmcmc! -- solverData(vert=x3).inferdim=4.0
[ Info: Outgoing msg density on:
[ Info: prepCliqInitMsgsUp, seps=Symbol[:l1, :x4, :x2]
State machine iter=5
State machine iter=6
State machine iter=7
State machine iter=8
State machine iter=9
[ Info: up w 1 msgs
[ Info: inp.sendmsgs[x2].inferdim=1.0
[ Info: inp.sendmsgs[x4].inferdim=2.0
State machine iter=10[ Info: inp.sendmsgs[l1].inferdim=2.0
[ Info: ---------- successive fnc approx ------------x4,: l1,x2,x5,
[ Info: #1 --
[ Info: ---------- successive fnc approx ------------x4,: l1,x2,x5,
[ Info: #1 --
[ Info: fmcmc! -- solverData(vert=l1).inferdim=2.0
[ Info: fmcmc! -- solverData(vert=x2).inferdim=1.0
[ Info: ---------- successive fnc approx ------------x4,: l1,x2,x5,
[ Info: #1 --
[ Info: [2x0p,d1,N100],
[ Info: #2 --
[ Info: [2x0p,d1,N100],
[ Info: #3 --
[ Info: [2x0p,d1,N100],
[ Info: fmcmc! -- solverData(vert=x5).inferdim=1.0
[ Info: fmcmc! -- solverData(vert=x4).inferdim=3.0
[ Info: ---------- successive fnc approx ------------x4,: l1,x2,x5,
[ Info: #1 --
[ Info: Outgoing msg density on:
[ Info: prepCliqInitMsgsUp, seps=Symbol[:l1, :x2, :x5]
State machine iter=5
State machine iter=6
[ Info: up w 3 msgs
State machine iter=9
State machine iter=10
[ Info: inp.sendmsgs[x2].inferdim=1.0
[ Info: inp.sendmsgs[x6].inferdim=1.0
[ Info: inp.sendmsgs[x2].inferdim=1.0
[ Info: inp.sendmsgs[x5].inferdim=1.0
[ Info: inp.sendmsgs[l1].inferdim=2.0
[ Info: ---------- successive fnc approx ------------x6,x2,l1,x5,:
[ Info: #1 --
[ Info: fmcmc! -- solverData(vert=l1).inferdim=2.0
[ Info: ---------- successive fnc approx ------------x6,x2,l1,x5,:
[ Info: #1 --
[ Info: [2x0p,d1,N100],
[ Info: [2x0p,d1,N100],
[ Info: #2 --
[ Info: [2x0p,d1,N100],
[ Info: [2x0p,d1,N100],
[ Info: #3 --
[ Info: [2x0p,d1,N100],
[ Info: [2x0p,d1,N100],
[ Info: fmcmc! -- solverData(vert=x6).inferdim=2.0
[ Info: fmcmc! -- solverData(vert=x5).inferdim=2.0
[ Info: ---------- successive fnc approx ------------x6,x2,l1,x5,:
[ Info: #1 --
[ Info: [2x0p,d1,N100],
[ Info: fmcmc! -- solverData(vert=x2).inferdim=2.0
[ Info: fmcmc! -- solverData(vert=l1).inferdim=2.0
[ Info: Outgoing msg density on:
[ Info: prepCliqInitMsgsUp, seps=Symbol[]
State machine iter=7
State machine iter=8
[ Info: transferUpdateSubGraph! -- syms=Symbol[:x6, :x2, :l1, :x5]
[ Info: sym=x6, mem size of val=(1, 100) and (1, 100)
┌ Warning: Deprecated
└ @ IncrementalInference ~/.julia/packages/IncrementalInference/FweX2/src/FactorGraphTypes.jl:362
[ Info: sym=x2, mem size of val=(1, 100) and (1, 100)
┌ Warning: Deprecated
└ @ IncrementalInference ~/.julia/packages/IncrementalInference/FweX2/src/FactorGraphTypes.jl:362
[ Info: sym=l1, mem size of val=(1, 100) and (1, 100)
┌ Warning: Deprecated
└ @ IncrementalInference ~/.julia/packages/IncrementalInference/FweX2/src/FactorGraphTypes.jl:362
[ Info: sym=x5, mem size of val=(1, 100) and (1, 100)
┌ Warning: Deprecated
└ @ IncrementalInference ~/.julia/packages/IncrementalInference/FweX2/src/FactorGraphTypes.jl:362
State machine iter=11
State machine iter=11[ Info: [2x0p,d1,N100],
State machine iter=11
[ Info: [2x0p,d1,N100],
State machine iter=9[ Info: [3x0p,d1,N100],
State machine iter=12
State machine iter=11
State machine iter=12[ Info: [4x0p,d1,N100],
State machine iter=12
State machine iter=12
Test Summary: |
with local Graphs.jl dictionary and arrays only (multicore)... | No tests
[ Info: Finished tree based init-inference
[ Info: Folder '/tmp/dfg_test' doesn't exist, creating...
┌ Warning: Retrieving serialization module from AbstractDFG - override this in the 'GraphsDFG{SolverParams} structure! This is returning Main
└ @ DistributedFactorGraphs ~/.julia/packages/DistributedFactorGraphs/NMxiR/src/services/AbstractDFG.jl:25
┌ Warning: Retrieving serialization module from AbstractDFG - override this in the 'GraphsDFG{SolverParams} structure! This is returning Main
└ @ DistributedFactorGraphs ~/.julia/packages/DistributedFactorGraphs/NMxiR/src/services/AbstractDFG.jl:25
┌ Warning: Retrieving serialization module from AbstractDFG - override this in the 'GraphsDFG{SolverParams} structure! This is returning Main
└ @ DistributedFactorGraphs ~/.julia/packages/DistributedFactorGraphs/NMxiR/src/services/AbstractDFG.jl:25
┌ Warning: Retrieving serialization module from AbstractDFG - override this in the 'GraphsDFG{SolverParams} structure! This is returning Main
└ @ DistributedFactorGraphs ~/.julia/packages/DistributedFactorGraphs/NMxiR/src/services/AbstractDFG.jl:25
┌ Warning: Retrieving serialization module from AbstractDFG - override this in the 'GraphsDFG{SolverParams} structure! This is returning Main
└ @ DistributedFactorGraphs ~/.julia/packages/DistributedFactorGraphs/NMxiR/src/services/AbstractDFG.jl:25
┌ Warning: Retrieving serialization module from AbstractDFG - override this in the 'GraphsDFG{SolverParams} structure! This is returning Main
└ @ DistributedFactorGraphs ~/.julia/packages/DistributedFactorGraphs/NMxiR/src/services/AbstractDFG.jl:25
┌ Warning: Retrieving serialization module from AbstractDFG - override this in the 'GraphsDFG{SolverParams} structure! This is returning Main
└ @ DistributedFactorGraphs ~/.julia/packages/DistributedFactorGraphs/NMxiR/src/services/AbstractDFG.jl:25
┌ Warning: Retrieving serialization module from AbstractDFG - override this in the 'GraphsDFG{SolverParams} structure! This is returning Main
└ @ DistributedFactorGraphs ~/.julia/packages/DistributedFactorGraphs/NMxiR/src/services/AbstractDFG.jl:25
[ Info: Loaded 8 variables - Symbol[:l1, :x0, :x2, :x3, :x4, :x5, :x6, :x7]
[ Info: Inserting variables into graph...
[ Info: Loaded 8 factors - Symbol[:x0f1, :x0x2f1, :x2x3f1, :x3f1, :x3l1f1, :x3x4f1, :x4l1f1, :x4x5f1, :x5x6f1, :x6x7f1, :x7f1]
[ Info: Inserting factors into graph...
[ Info: Rebuilding CCW's for the factors...
Test Summary: | Pass Total
saving to and loading from FileDFG | 2 2
┌ Warning: must return testExpandedJLD.jl to testing -- currently skipped since jld2 files cannot be loaded.
└ @ Main ~/.julia/packages/IncrementalInference/FweX2/test/runtests.jl:75
[ Info: try doautoinit! of x1
[ Info: try doautoinit! of x1
[ Info: init with useinitfct Symbol[:x1f1]
[ Info: do init of x1
[ Info: try doautoinit! of x2
[ Info: try doautoinit! of x2
[ Info: init with useinitfct Symbol[:x1x2f1]
[ Info: do init of x2
[ Info: try doautoinit! of x3
[ Info: try doautoinit! of x3
[ Info: init with useinitfct Symbol[:x2x3f1]
[ Info: do init of x3
[ Info: try doautoinit! of x4
[ Info: try doautoinit! of l1
[ Info: try doautoinit! of l1
[ Info: init with useinitfct Symbol[:x1l1f1, :x2l1f1]
[ Info: do init of l1
[ Info: [2x0p,d1,N100],
[ Info: try doautoinit! of l2
[ Info: try doautoinit! of l2
[ Info: init with useinitfct Symbol[:x2l2f1, :x3l2f1]
[ Info: do init of l2
[ Info: [2x0p,d1,N100],
[ Info: try doautoinit! of x4
[ Info: init with useinitfct Symbol[:x4l2f1, :x3x4f1]
[ Info: do init of x4
[ Info: [2x0p,d1,N100],
[ Info:
[ Info: Eliminating x2
[ Info: ===============
[ Info:
[ Info: - Removing x2
Building Bayes net...
Si = Symbol[:x3, :x1, :l2, :l1]
Si = Symbol[:x4, :x1, :l2, :l1]
[ Info:
[ Info: Eliminating x3
[ Info: ===============
[ Info:
[ Info: - Removing x3
[ Info: Looking at x3x1l2l1f1
[ Info: - Breaking link x3x1l2l1f1->x3...
[ Info: - Original links: Symbol[:x3, :x1, :l2, :l1]
[ Info: - New links: Symbol[:x1, :l2, :l1]
[ Info: x3x1l2l1f1 still has links to other variables, readding it back...
Si = Symbol[:l2, :l1, :x4]
[ Info:
[ Info: Eliminating x1
[ Info: ===============
[ Info:
[ Info: - Removing x1
[ Info: Looking at x1l2l1f1
[ Info: - Breaking link x1l2l1f1->x1...
[ Info: - Original links: Symbol[:x1, :l2, :l1]
[ Info: - New links: Symbol[:l2, :l1]
[ Info: x1l2l1f1 still has links to other variables, readding it back...
[ Info: Looking at x4x1l2l1f1
[ Info: - Breaking link x4x1l2l1f1->x1...
[ Info: - Original links: Symbol[:x4, :x1, :l2, :l1]
[ Info: - New links: Symbol[:x4, :l2, :l1]
[ Info: x4x1l2l1f1 still has links to other variables, readding it back...
Si = Symbol[:x4, :l1]
Si = Symbol[:x4]
[ Info:
[ Info: Eliminating l2
[ Info: ===============
[ Info:
[ Info: - Removing l2
[ Info: Looking at x4l2l1f1
[ Info: - Breaking link x4l2l1f1->l2...
[ Info: - Original links: Symbol[:x4, :l2, :l1]
[ Info: - New links: Symbol[:x4, :l1]
[ Info: x4l2l1f1 still has links to other variables, readding it back...
[ Info: Looking at l2l1x4f1
[ Info: - Breaking link l2l1x4f1->l2...
[ Info: - Original links: Symbol[:l2, :l1, :x4]
[ Info: - New links: Symbol[:l1, :x4]
[ Info: l2l1x4f1 still has links to other variables, readding it back...
[ Info: Looking at l2l1f1
[ Info: - Breaking link l2l1f1->l2...
[ Info: - Original links: Symbol[:l2, :l1]
[ Info: - New links: Symbol[:l1]
[ Info: l2l1f1 still has links to other variables, readding it back...
[ Info:
[ Info: Eliminating l1
[ Info: ===============
[ Info:
[ Info: - Removing l1
[ Info: Looking at l1f1
[ Info: - Breaking link l1f1->l1...
[ Info: - Original links: Symbol[:l1]
[ Info: - New links: Symbol[]
[ Info: l1f1 doesn't have any other links, not adding it back...
[ Info: Looking at x4l1f2
[ Info: - Breaking link x4l1f2->l1...
[ Info: - Original links: Symbol[:x4, :l1]
[ Info: - New links: Symbol[:x4]
[ Info: x4l1f2 still has links to other variables, readding it back...
[ Info: Looking at l1x4f1
[ Info: - Breaking link l1x4f1->l1...
[ Info: - Original links: Symbol[:l1, :x4]
[ Info: - New links: Symbol[:x4]
[ Info: l1x4f1 still has links to other variables, readding it back...
[ Info: Looking at x4l1f1
[ Info: - Breaking link x4l1f1->l1...
[ Info: - Original links: Symbol[:x4, :l1]
[ Info: - New links: Symbol[:x4]
[ Info: x4l1f1 still has links to other variables, readding it back...
Find potential functions for each clique
[ Info:
[ Info: Eliminating x4
[ Info: ===============
[ Info:
[ Info: - Removing x4
[ Info: Looking at x4f4
[ Info: - Breaking link x4f4->x4...
[ Info: - Original links: Symbol[:x4]
[ Info: - New links: Symbol[]
[ Info: x4f4 doesn't have any other links, not adding it back...
[ Info: Looking at x4f3
[ Info: - Breaking link x4f3->x4...
[ Info: - Original links: Symbol[:x4]
[ Info: - New links: Symbol[]
[ Info: x4f3 doesn't have any other links, not adding it back...
[ Info: Looking at x4f2
[ Info: - Breaking link x4f2->x4...
[ Info: - Original links: Symbol[:x4]
[ Info: - New links: Symbol[]
[ Info: x4f2 doesn't have any other links, not adding it back...
[ Info: Looking at x4f1
[ Info: - Breaking link x4f1->x4...
[ Info: - Original links: Symbol[:x4]
[ Info: - New links: Symbol[]
[ Info: x4f1 doesn't have any other links, not adding it back...
[ Info: Get potentials x2,: x3,x1,l2,l1,
[ Info: using all factors among cliq variables
[ Info: finding all frontals for down WIP
[ Info: Get potentials x4,l1,l2,x1,x3,:
[ Info: using all factors among cliq variables
[ Info: finding all frontals for down WIP
[ Info: cliq=1 adding factor that is no in separator, x2
[ Info: cliq=1 adding factor that is no in separator, x2
[ Info: cliq=1 adding factor that is no in separator, x2
[ Info: cliq=1 adding factor that is no in separator, x2
Bayes Tree
┌ Warning: Base.IOError("could not spawn `dot2tex -tmath --preproc /root/.julia/packages/IncrementalInference/FweX2/test/tmp/bt.dot -o /root/.julia/packages/IncrementalInference/FweX2/test/tmp/btproc.dot`: no such file or directory (ENOENT)", -2)
└ @ IncrementalInference ~/.julia/packages/IncrementalInference/FweX2/src/JunctionTree.jl:331
stacktrace() = Base.StackTraces.StackFrame[macro expansion at show.jl:562 [inlined], #generateTexTree#96(::String, ::typeof(generateTexTree), ::BayesTree) at JunctionTree.jl:332, (::IncrementalInference.var"#kw##generateTexTree")(::NamedTuple{(:filepath,),Tuple{String}}, ::typeof(generateTexTree), ::BayesTree) at none:0, top-level scope at testTexTreeIllustration.jl:47, top-level scope at Test.jl:1107, top-level scope at testTexTreeIllustration.jl:14, include at boot.jl:328 [inlined], include_relative(::Module, ::String) at loading.jl:1105, include(::Module, ::String) at Base.jl:31, include(::String) at client.jl:424, top-level scope at runtests.jl:79, include at boot.jl:328 [inlined], include_relative(::Module, ::String) at loading.jl:1105, include(::Module, ::String) at Base.jl:31, include(::String) at client.jl:424, top-level scope at none:6, eval(::Module, ::Any) at boot.jl:330, exec_options(::Base.JLOptions) at client.jl:263, _start() at client.jl:460]
Test Summary: | Pass Total
testing generateTexTree | 1 1
Testing IncrementalInference tests passed