  0 SNES Function norm 18.865
    0 SNES Function norm 18.865
    1 SNES Function norm 8.73683e-07
      0 SNES Function norm 7.9907e-07
      1 SNES Function norm < 1.e-11
        0 SNES Function norm < 1.e-11
        1 SNES Function norm < 1.e-11
      0 SNES Function norm < 1.e-11
      1 SNES Function norm < 1.e-11
    0 SNES Function norm 1.11797e-06
    1 SNES Function norm < 1.e-11
  1 SNES Function norm < 1.e-11
  L_2 Error: < 1.0e-11
  Nonlinear solve converged due to CONVERGED_FNORM_RELATIVE iterations 1
SNES Object: 7 MPI processes
  type: fas
    type is MULTIPLICATIVE, levels=3, cycles=1
    Not using Galerkin computed coarse grid function evaluation
    Coarse grid solver -- level 0 -------------------------------
    SNES Object: (fas_coarse_) 7 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=4
      total number of function evaluations=1
      norm schedule ALWAYS
      SNESLineSearch Object: (fas_coarse_) 7 MPI processes
        type: basic
        maxlambda=1.000000e+00, minlambda=1.000000e-12
        tolerances: relative=1.000000e-08, absolute=1.000000e-15, lambda=1.000000e-08
        maximum iterations=40
      KSP Object: (fas_coarse_) 7 MPI processes
        type: cg
        maximum iterations=10000, initial guess is zero
        tolerances: relative=1e-05, absolute=1e-50, divergence=10000.
        left preconditioning
        using PRECONDITIONED norm type for convergence test
      PC Object: (fas_coarse_) 7 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: 1
          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 213 interface 55 coarse 17
          Coarsening ratios: all/coarse 12 interface/coarse 3
          Active processes : 7
          Total subdomains : 7
          Dofs type        :	MIN	MAX	MEAN
          Interior  dofs   :	18	33	22
          Interface dofs   :	11	20	16
          Primal    dofs   :	3	7	5
          Local     dofs   :	32	52	39
          Local     subs   :	1	1
        --- Interior solver (rank 0)
          KSP Object: (fas_coarse_pc_bddc_dirichlet_) 1 MPI process
            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: (fas_coarse_pc_bddc_dirichlet_) 1 MPI process
            type: lu
              out-of-place factorization
              tolerance for zero pivot 2.22045e-14
              matrix ordering: nd
              factor fill ratio given 5., needed 1.12422
                Factored matrix follows:
                  Mat Object: (fas_coarse_pc_bddc_dirichlet_) 1 MPI process
                    type: seqaij
                    rows=21, cols=21
                    package used to perform factorization: petsc
                    total: nonzeros=181, allocated nonzeros=181
                      not using I-node routines
            linear system matrix = precond matrix:
            Mat Object: (fas_coarse_pc_bddc_dirichlet_) 1 MPI process
              type: seqaij
              rows=21, cols=21
              total: nonzeros=161, allocated nonzeros=161
              total number of mallocs used during MatSetValues calls=0
                not using I-node routines
        --- Correction solver (rank 0)
          KSP Object: (fas_coarse_pc_bddc_neumann_) 1 MPI process
            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: (fas_coarse_pc_bddc_neumann_) 1 MPI process
            type: lu
              out-of-place factorization
              tolerance for zero pivot 2.22045e-14
              matrix ordering: nd
              factor fill ratio given 5., needed 1.12539
                Factored matrix follows:
                  Mat Object: (fas_coarse_pc_bddc_neumann_) 1 MPI process
                    type: seqaij
                    rows=31, cols=31
                    package used to perform factorization: petsc
                    total: nonzeros=359, allocated nonzeros=359
                      using I-node routines: found 22 nodes, limit used is 5
            linear system matrix = precond matrix:
            Mat Object: (fas_coarse_pc_bddc_neumann_) 1 MPI process
              type: seqaij
              rows=31, cols=31
              total: nonzeros=319, allocated nonzeros=319
              total number of mallocs used during MatSetValues calls=0
                not using I-node routines
        --- Coarse solver
          KSP Object: (fas_coarse_pc_bddc_coarse_) 7 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: (fas_coarse_pc_bddc_coarse_) 7 MPI processes
            type: redundant
              First (color=0) of 7 PCs follows
              KSP Object: (fas_coarse_pc_bddc_coarse_redundant_) 1 MPI process
                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: (fas_coarse_pc_bddc_coarse_redundant_) 1 MPI process
                type: lu
                  out-of-place factorization
                  tolerance for zero pivot 2.22045e-14
                  matrix ordering: nd
                  factor fill ratio given 5., needed 1.2246
                    Factored matrix follows:
                      Mat Object: (fas_coarse_pc_bddc_coarse_redundant_) 1 MPI process
                        type: seqaij
                        rows=17, cols=17
                        package used to perform factorization: petsc
                        total: nonzeros=229, allocated nonzeros=229
                          using I-node routines: found 7 nodes, limit used is 5
                linear system matrix = precond matrix:
                Mat Object: 1 MPI process
                  type: seqaij
                  rows=17, cols=17
                  total: nonzeros=187, allocated nonzeros=187
                  total number of mallocs used during MatSetValues calls=0
                    not using I-node routines
            linear system matrix = precond matrix:
            Mat Object: (fas_coarse_pc_bddc_coarse_) 7 MPI processes
              type: mpiaij
              rows=17, cols=17
              total: nonzeros=187, allocated nonzeros=187
              total number of mallocs used during MatSetValues calls=0
                using I-node (on process 0) routines: found 1 nodes, limit used is 5
        linear system matrix = precond matrix:
        Mat Object: 7 MPI processes
          type: is
          rows=213, cols=213
          total: nonzeros=3080, allocated nonzeros=4004
          total number of mallocs used during MatSetValues calls=0
    Down solver (pre-smoother) on level 1 -------------------------------
    SNES Object: (fas_levels_1_) 7 MPI processes
      type: newtonls
      maximum iterations=1, maximum function evaluations=10000
      tolerances: relative=0., absolute=0., solution=0.
      total number of linear solver iterations=6
      total number of function evaluations=2
      norm schedule FINALONLY
      SNESLineSearch Object: (fas_levels_1_) 7 MPI processes
        type: bt
          interpolation: cubic
          alpha=1.000000e-04
        maxlambda=1.000000e+00, minlambda=1.000000e-12
        tolerances: relative=1.000000e-08, absolute=1.000000e-15, lambda=1.000000e-08
        maximum iterations=40
      KSP Object: (fas_levels_1_) 7 MPI processes
        type: cg
        maximum iterations=10000, initial guess is zero
        tolerances: relative=1e-05, absolute=1e-50, divergence=10000.
        left preconditioning
        using PRECONDITIONED norm type for convergence test
      PC Object: (fas_levels_1_) 7 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: 1
          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 513 interface 88 coarse 22
          Coarsening ratios: all/coarse 23 interface/coarse 4
          Active processes : 7
          Total subdomains : 7
          Dofs type        :	MIN	MAX	MEAN
          Interior  dofs   :	48	67	60
          Interface dofs   :	13	36	26
          Primal    dofs   :	3	11	7
          Local     dofs   :	70	98	86
          Local     subs   :	1	1
        --- Interior solver (rank 0)
          KSP Object: (fas_levels_1_pc_bddc_dirichlet_) 1 MPI process
            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: (fas_levels_1_pc_bddc_dirichlet_) 1 MPI process
            type: lu
              out-of-place factorization
              tolerance for zero pivot 2.22045e-14
              matrix ordering: nd
              factor fill ratio given 5., needed 1.40246
                Factored matrix follows:
                  Mat Object: (fas_levels_1_pc_bddc_dirichlet_) 1 MPI process
                    type: seqaij
                    rows=63, cols=63
                    package used to perform factorization: petsc
                    total: nonzeros=913, allocated nonzeros=913
                      not using I-node routines
            linear system matrix = precond matrix:
            Mat Object: (fas_levels_1_pc_bddc_dirichlet_) 1 MPI process
              type: seqaij
              rows=63, cols=63
              total: nonzeros=651, allocated nonzeros=651
              total number of mallocs used during MatSetValues calls=0
                not using I-node routines
        --- Correction solver (rank 0)
          KSP Object: (fas_levels_1_pc_bddc_neumann_) 1 MPI process
            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: (fas_levels_1_pc_bddc_neumann_) 1 MPI process
            type: lu
              out-of-place factorization
              tolerance for zero pivot 2.22045e-14
              matrix ordering: nd
              factor fill ratio given 5., needed 1.26294
                Factored matrix follows:
                  Mat Object: (fas_levels_1_pc_bddc_neumann_) 1 MPI process
                    type: seqaij
                    rows=80, cols=80
                    package used to perform factorization: petsc
                    total: nonzeros=1220, allocated nonzeros=1220
                      not using I-node routines
            linear system matrix = precond matrix:
            Mat Object: (fas_levels_1_pc_bddc_neumann_) 1 MPI process
              type: seqaij
              rows=80, cols=80
              total: nonzeros=966, allocated nonzeros=966
              total number of mallocs used during MatSetValues calls=0
                not using I-node routines
        --- Coarse solver
          KSP Object: (fas_levels_1_pc_bddc_coarse_) 7 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: (fas_levels_1_pc_bddc_coarse_) 7 MPI processes
            type: redundant
              First (color=0) of 7 PCs follows
              KSP Object: (fas_levels_1_pc_bddc_coarse_redundant_) 1 MPI process
                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: (fas_levels_1_pc_bddc_coarse_redundant_) 1 MPI process
                type: lu
                  out-of-place factorization
                  tolerance for zero pivot 2.22045e-14
                  matrix ordering: nd
                  factor fill ratio given 5., needed 1.25455
                    Factored matrix follows:
                      Mat Object: (fas_levels_1_pc_bddc_coarse_redundant_) 1 MPI process
                        type: seqaij
                        rows=22, cols=22
                        package used to perform factorization: petsc
                        total: nonzeros=414, allocated nonzeros=414
                          using I-node routines: found 9 nodes, limit used is 5
                linear system matrix = precond matrix:
                Mat Object: 1 MPI process
                  type: seqaij
                  rows=22, cols=22
                  total: nonzeros=330, allocated nonzeros=330
                  total number of mallocs used during MatSetValues calls=0
                    not using I-node routines
            linear system matrix = precond matrix:
            Mat Object: (fas_levels_1_pc_bddc_coarse_) 7 MPI processes
              type: mpiaij
              rows=22, cols=22
              total: nonzeros=330, allocated nonzeros=330
              total number of mallocs used during MatSetValues calls=0
                using I-node (on process 0) routines: found 1 nodes, limit used is 5
        linear system matrix = precond matrix:
        Mat Object: 7 MPI processes
          type: is
          rows=513, cols=513
          total: nonzeros=7760, allocated nonzeros=9554
          total number of mallocs used during MatSetValues calls=0
    Up solver (post-smoother) same as down solver (pre-smoother)
    Down solver (pre-smoother) on level 2 -------------------------------
    SNES Object: (fas_levels_2_) 7 MPI processes
      type: newtonls
      maximum iterations=1, maximum function evaluations=10000
      tolerances: relative=0., absolute=0., solution=0.
      total number of linear solver iterations=6
      total number of function evaluations=2
      norm schedule FINALONLY
      SNESLineSearch Object: (fas_levels_2_) 7 MPI processes
        type: bt
          interpolation: cubic
          alpha=1.000000e-04
        maxlambda=1.000000e+00, minlambda=1.000000e-12
        tolerances: relative=1.000000e-08, absolute=1.000000e-15, lambda=1.000000e-08
        maximum iterations=40
      KSP Object: (fas_levels_2_) 7 MPI processes
        type: cg
        maximum iterations=10000, initial guess is zero
        tolerances: relative=1e-05, absolute=1e-50, divergence=10000.
        left preconditioning
        using PRECONDITIONED norm type for convergence test
      PC Object: (fas_levels_2_) 7 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: 1
          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 1485 interface 171 coarse 21
          Coarsening ratios: all/coarse 70 interface/coarse 8
          Active processes : 7
          Total subdomains : 7
          Dofs type        :	MIN	MAX	MEAN
          Interior  dofs   :	182	195	187
          Interface dofs   :	29	66	50
          Primal    dofs   :	3	10	7
          Local     dofs   :	216	254	237
          Local     subs   :	1	1
        --- Interior solver (rank 0)
          KSP Object: (fas_levels_2_pc_bddc_dirichlet_) 1 MPI process
            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: (fas_levels_2_pc_bddc_dirichlet_) 1 MPI process
            type: lu
              out-of-place factorization
              tolerance for zero pivot 2.22045e-14
              matrix ordering: nd
              factor fill ratio given 5., needed 1.7887
                Factored matrix follows:
                  Mat Object: (fas_levels_2_pc_bddc_dirichlet_) 1 MPI process
                    type: seqaij
                    rows=195, cols=195
                    package used to perform factorization: petsc
                    total: nonzeros=4495, allocated nonzeros=4495
                      not using I-node routines
            linear system matrix = precond matrix:
            Mat Object: (fas_levels_2_pc_bddc_dirichlet_) 1 MPI process
              type: seqaij
              rows=195, cols=195
              total: nonzeros=2513, allocated nonzeros=2513
              total number of mallocs used during MatSetValues calls=0
                not using I-node routines
        --- Correction solver (rank 0)
          KSP Object: (fas_levels_2_pc_bddc_neumann_) 1 MPI process
            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: (fas_levels_2_pc_bddc_neumann_) 1 MPI process
            type: lu
              out-of-place factorization
              tolerance for zero pivot 2.22045e-14
              matrix ordering: nd
              factor fill ratio given 5., needed 1.77676
                Factored matrix follows:
                  Mat Object: (fas_levels_2_pc_bddc_neumann_) 1 MPI process
                    type: seqaij
                    rows=225, cols=225
                    package used to perform factorization: petsc
                    total: nonzeros=5627, allocated nonzeros=5627
                      not using I-node routines
            linear system matrix = precond matrix:
            Mat Object: (fas_levels_2_pc_bddc_neumann_) 1 MPI process
              type: seqaij
              rows=225, cols=225
              total: nonzeros=3167, allocated nonzeros=3167
              total number of mallocs used during MatSetValues calls=0
                not using I-node routines
        --- Coarse solver
          KSP Object: (fas_levels_2_pc_bddc_coarse_) 7 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: (fas_levels_2_pc_bddc_coarse_) 7 MPI processes
            type: redundant
              First (color=0) of 7 PCs follows
              KSP Object: (fas_levels_2_pc_bddc_coarse_redundant_) 1 MPI process
                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: (fas_levels_2_pc_bddc_coarse_redundant_) 1 MPI process
                type: lu
                  out-of-place factorization
                  tolerance for zero pivot 2.22045e-14
                  matrix ordering: nd
                  factor fill ratio given 5., needed 1.35955
                    Factored matrix follows:
                      Mat Object: (fas_levels_2_pc_bddc_coarse_redundant_) 1 MPI process
                        type: seqaij
                        rows=21, cols=21
                        package used to perform factorization: petsc
                        total: nonzeros=363, allocated nonzeros=363
                          using I-node routines: found 10 nodes, limit used is 5
                linear system matrix = precond matrix:
                Mat Object: 1 MPI process
                  type: seqaij
                  rows=21, cols=21
                  total: nonzeros=267, allocated nonzeros=267
                  total number of mallocs used during MatSetValues calls=0
                    using I-node routines: found 16 nodes, limit used is 5
            linear system matrix = precond matrix:
            Mat Object: (fas_levels_2_pc_bddc_coarse_) 7 MPI processes
              type: mpiaij
              rows=21, cols=21
              total: nonzeros=267, allocated nonzeros=267
              total number of mallocs used during MatSetValues calls=0
                using I-node (on process 0) routines: found 1 nodes, limit used is 5
        linear system matrix = precond matrix:
        Mat Object: 7 MPI processes
          type: is
          rows=1485, cols=1485
          total: nonzeros=23366, allocated nonzeros=26623
          total number of mallocs used during MatSetValues calls=0
    Up solver (post-smoother) same as down solver (pre-smoother)
  maximum iterations=20, maximum function evaluations=30000
  tolerances: relative=1e-08, absolute=1e-50, solution=1e-08
  total number of function evaluations=1
  norm schedule ALWAYS
