  0 SNES Function norm 5.83179 
    0 KSP Residual norm 5.0581 
    1 KSP Residual norm 0.0106943 
    2 KSP Residual norm 7.46624e-07 
    3 KSP Residual norm < 1.e-11
  Linear solve converged due to CONVERGED_RTOL iterations 3
  1 SNES Function norm < 1.e-11
L_2 Error: 0.00527027
Nonlinear solve converged due to CONVERGED_FNORM_RELATIVE iterations 1
SNES Object: 4 MPI processes
  type: newtonls
  maximum iterations=50, maximum function evaluations=10000
  tolerances: relative=1e-08, absolute=1e-50, solution=1e-08
  total number of linear solver iterations=3
  total number of function evaluations=2
  norm schedule ALWAYS
  SNESLineSearch Object: 4 MPI processes
    type: bt
      interpolation: cubic
      alpha=1.000000e-04
    maxstep=1.000000e+08, minlambda=1.000000e-12
    tolerances: relative=1.000000e-08, absolute=1.000000e-15, lambda=1.000000e-08
    maximum iterations=40
  KSP Object: 4 MPI processes
    type: gmres
      restart=100, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement
      happy breakdown tolerance 1e-30
    maximum iterations=10000, initial guess is zero
    tolerances:  relative=1e-09, absolute=1e-50, divergence=10000.
    left preconditioning
    using PRECONDITIONED norm type for convergence test
  PC Object: 4 MPI processes
    type: bddc
      Use verbose output: 0
      Use user-defined CSR: 0
      Use local mat graph: 1
      Connectivity graph topological dimension: 2
      Corner selection: 0 (selected 0)
      Use vertices: 1 (vertex size 1)
      Use edges: 1
      Use faces: 0
      Use true near null space: 0
      Use QR for single constraints on cc: 0
      Use change of basis on local edge nodes: 0
      Use change of basis on local face nodes: 0
      User defined change of basis matrix: 0
      Has change of basis matrix: 0
      Eliminate dirichlet boundary dofs: 0
      Switch on static condensation ops around the interface preconditioner: 0
      Use exact dirichlet trick: 0
      Interface extension: DIRICHLET
      Multilevel max levels: 0
      Multilevel coarsening ratio: 8
      Use estimated eigs for coarse problem: 0
      Use deluxe scaling: 0
      Use deluxe zerorows: 0
      Use deluxe singlemat: 0
      Rebuild interface graph for Schur principal minors: 0
      Number of dofs' layers for the computation of principal minors: -1
      Use user CSR graph to compute successive layers: 0
      Adaptive constraint selection threshold (active 0, userdefined 0): 0.
      Min constraints / connected component: 0
      Max constraints / connected component: 0
      Invert exact Schur complement for adaptive selection: 0
      Symmetric computation of primal basis functions: 1
      Num. Procs. to map coarse adjacency list: 0
      Coarse eqs per proc (significant at the coarsest level): 1
      Detect disconnected: 0 (filter 0)
      Benign subspace trick: 0 (change explicit 0)
      Benign subspace trick is active: 0
      Algebraic computation of no-net-flux: 0
    ********************************** STATISTICS AT LEVEL 0 **********************************
      Global dofs sizes: all 49 interface 13 coarse 5
      Coarsening ratios: all/coarse 9 interface/coarse 2
      Active processes : 4
      Total subdomains : 4
      Dofs type        :	MIN	MAX	MEAN
      Interior  dofs   :	9	9	9
      Interface dofs   :	7	7	7
      Primal    dofs   :	3	3	3
      Local     dofs   :	16	16	16
      Local     subs   :	1	1
    --- Interior solver (rank 0)
      KSP Object: (pc_bddc_dirichlet_) 1 MPI processes
        type: preonly
        maximum iterations=10000, initial guess is zero
        tolerances:  relative=1e-05, absolute=1e-50, divergence=10000.
        left preconditioning
        using NONE norm type for convergence test
      PC Object: (pc_bddc_dirichlet_) 1 MPI processes
        type: lu
          out-of-place factorization
          tolerance for zero pivot 2.22045e-14
          matrix ordering: nd
          factor fill ratio given 5., needed 1.43902
            Factored matrix follows:
              Mat Object: 1 MPI processes
                type: seqaij
                rows=9, cols=9
                package used to perform factorization: petsc
                total: nonzeros=59, allocated nonzeros=59
                  using I-node routines: found 7 nodes, limit used is 5
        linear system matrix = precond matrix:
        Mat Object: (pc_bddc_dirichlet_) 1 MPI processes
          type: seqaij
          rows=9, cols=9
          total: nonzeros=41, allocated nonzeros=41
          total number of mallocs used during MatSetValues calls=0
            not using I-node routines
    --- Correction solver (rank 0)
      KSP Object: (pc_bddc_neumann_) 1 MPI processes
        type: preonly
        maximum iterations=10000, initial guess is zero
        tolerances:  relative=1e-05, absolute=1e-50, divergence=10000.
        left preconditioning
        using NONE norm type for convergence test
      PC Object: (pc_bddc_neumann_) 1 MPI processes
        type: lu
          out-of-place factorization
          tolerance for zero pivot 2.22045e-14
          matrix ordering: nd
          factor fill ratio given 5., needed 1.29333
            Factored matrix follows:
              Mat Object: 1 MPI processes
                type: seqaij
                rows=15, cols=15
                package used to perform factorization: petsc
                total: nonzeros=97, allocated nonzeros=97
                  not using I-node routines
        linear system matrix = precond matrix:
        Mat Object: (pc_bddc_neumann_) 1 MPI processes
          type: seqaij
          rows=15, cols=15
          total: nonzeros=75, allocated nonzeros=75
          total number of mallocs used during MatSetValues calls=0
            not using I-node routines
    --- Coarse solver
      KSP Object: (pc_bddc_coarse_) 4 MPI processes
        type: preonly
        maximum iterations=1, initial guess is zero
        tolerances:  relative=1e-05, absolute=1e-50, divergence=10000.
        left preconditioning
        using NONE norm type for convergence test
      PC Object: (pc_bddc_coarse_) 4 MPI processes
        type: redundant
          First (color=0) of 4 PCs follows
        linear system matrix = precond matrix:
        Mat Object: (pc_bddc_coarse_) 4 MPI processes
          type: mpiaij
          rows=5, cols=5
          total: nonzeros=21, allocated nonzeros=25
          total number of mallocs used during MatSetValues calls=0
            using I-node (on process 0) routines: found 1 nodes, limit used is 5
              KSP Object:     (pc_bddc_coarse_redundant_)     1 MPI processes
                type: preonly
                maximum iterations=10000, initial guess is zero
                tolerances:  relative=1e-05, absolute=1e-50, divergence=10000.
                left preconditioning
                using NONE norm type for convergence test
              PC Object:     (pc_bddc_coarse_redundant_)     1 MPI processes
                type: lu
                  out-of-place factorization
                  tolerance for zero pivot 2.22045e-14
                  matrix ordering: nd
                  factor fill ratio given 5., needed 1.09524
                    Factored matrix follows:
                      Mat Object:     1 MPI processes
                        type: seqaij
                        rows=5, cols=5
                        package used to perform factorization: petsc
                        total: nonzeros=23, allocated nonzeros=23
                          using I-node routines: found 3 nodes, limit used is 5
                linear system matrix = precond matrix:
                Mat Object:     1 MPI processes
                  type: seqaij
                  rows=5, cols=5
                  total: nonzeros=21, allocated nonzeros=21
                  total number of mallocs used during MatSetValues calls=0
                    not using I-node routines
    linear system matrix = precond matrix:
    Mat Object: 4 MPI processes
      type: is
      rows=49, cols=49
      total: nonzeros=328, allocated nonzeros=386
      total number of mallocs used during MatSetValues calls=0
