lid velocity = 0.0625, prandtl # = 1., grashof # = 1.
  0 SNES Function norm 2.391552133017e-01
    0 KSP Residual norm 2.487202582099e-01
    1 KSP Residual norm 2.061836020657e-02
    2 KSP Residual norm 5.209414702046e-03
    3 KSP Residual norm 1.568272395677e-03
    4 KSP Residual norm 3.295627866513e-04
    5 KSP Residual norm 9.155694279372e-05
    6 KSP Residual norm 3.446349799027e-05
    7 KSP Residual norm 7.611368243653e-06
    8 KSP Residual norm 2.122390430419e-06
  1 SNES Function norm 6.848107477293e-05
    0 KSP Residual norm 2.038292834185e-05
    1 KSP Residual norm 5.930353180150e-06
    2 KSP Residual norm 9.461586866971e-07
    3 KSP Residual norm 3.023548973492e-07
    4 KSP Residual norm 8.500626673260e-08
    5 KSP Residual norm 1.686734638740e-08
    6 KSP Residual norm 4.802448278829e-09
    7 KSP Residual norm 1.753962559544e-09
    8 KSP Residual norm 3.745101287855e-10
    9 KSP Residual norm 1.072508427565e-10
  2 SNES Function norm 2.138743891290e-10
SNES Object: 2 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=17
  total number of function evaluations=3
  norm schedule ALWAYS
  Jacobian is built using colored finite differences on a DMDA
  SNESLineSearch Object: 2 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: 2 MPI processes
    type: gmres
      restart=30, 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-05, absolute=1e-50, divergence=10000.
    left preconditioning
    using PRECONDITIONED norm type for convergence test
  PC Object: 2 MPI processes
    type: bjacobi
      number of blocks = 2
      Local solver information for first block is in the following KSP and PC objects on rank 0:
      Use -ksp_view ::ascii_info_detail to display information for all blocks
    KSP Object: (sub_) 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: (sub_) 1 MPI process
      type: ilu
        out-of-place factorization
        0 levels of fill
        tolerance for zero pivot 2.22045e-14
        matrix ordering: natural
        factor fill ratio given 1., needed 1.
          Factored matrix follows:
            Mat Object: (sub_) 1 MPI process
              type: seqbaij
              rows=32, cols=32, bs=4
              package used to perform factorization: petsc
              total: nonzeros=448, allocated nonzeros=448
                  block size is 4
      linear system matrix = precond matrix:
      Mat Object: (sub_) 1 MPI process
        type: seqbaij
        rows=32, cols=32, bs=4
        total: nonzeros=448, allocated nonzeros=448
        total number of mallocs used during MatSetValues calls=0
            block size is 4
    linear system matrix = precond matrix:
    Mat Object: 2 MPI processes
      type: mpibaij
      rows=64, cols=64, bs=4
      total: nonzeros=1024, allocated nonzeros=1024
      total number of mallocs used during MatSetValues calls=0
Number of SNES iterations = 2
