lid velocity = 0.0204082, prandtl # = 1., grashof # = 1.
  0 SNES Function norm 0.146194 
    0 KSP Residual norm 0.146194 
    1 KSP Residual norm < 1.e-11
  1 SNES Function norm 2.50702e-05 
    0 KSP Residual norm 2.50702e-05 
    1 KSP Residual norm < 1.e-11
  2 SNES Function norm < 1.e-11
SNES Object: 1 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=2
  total number of function evaluations=3
  norm schedule ALWAYS
  Jacobian is built using colored finite differences on a DMDA
  SNESLineSearch Object: 1 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: 1 MPI processes
    type: fgmres
      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.
    right preconditioning
    using UNPRECONDITIONED norm type for convergence test
  PC Object: 1 MPI processes
    type: fieldsplit
      FieldSplit with MULTIPLICATIVE composition: total splits = 2, blocksize = 2
      Solver info for each split is in the following KSP objects:
    Split number 0 Fields  0, 1
    KSP Object: (fieldsplit_0_) 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: (fieldsplit_0_) 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 2.5576
          Factored matrix follows:
            Mat Object: 1 MPI processes
              type: seqaij
              rows=196, cols=196, bs=2
              package used to perform factorization: petsc
              total: nonzeros=8880, allocated nonzeros=8880
                using I-node routines: found 49 nodes, limit used is 5
      linear system matrix = precond matrix:
      Mat Object: (fieldsplit_0_) 1 MPI processes
        type: seqaij
        rows=196, cols=196, bs=2
        total: nonzeros=3472, allocated nonzeros=3472
        total number of mallocs used during MatSetValues calls=0
          using I-node routines: found 49 nodes, limit used is 5
    Split number 1 Fields  0, 1
    KSP Object: (fieldsplit_1_) 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: (fieldsplit_1_) 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 2.5576
          Factored matrix follows:
            Mat Object: 1 MPI processes
              type: seqaij
              rows=196, cols=196, bs=2
              package used to perform factorization: petsc
              total: nonzeros=8880, allocated nonzeros=8880
                using I-node routines: found 49 nodes, limit used is 5
      linear system matrix = precond matrix:
      Mat Object: (fieldsplit_1_) 1 MPI processes
        type: seqaij
        rows=196, cols=196, bs=2
        total: nonzeros=3472, allocated nonzeros=3472
        total number of mallocs used during MatSetValues calls=0
          using I-node routines: found 49 nodes, limit used is 5
    linear system matrix = precond matrix:
    Mat Object: 1 MPI processes
      type: seqaij
      rows=196, cols=196, bs=4
      total: nonzeros=3472, allocated nonzeros=3472
      total number of mallocs used during MatSetValues calls=0
        using I-node routines: found 49 nodes, limit used is 5
Number of SNES iterations = 2
