Fix some spelling errors (mostly in comments).

src/api/api_context.cpp

@@ -219,7 +219,7 @@ namespace api {
         if (m_user_ref_count) {
             // Corner case bug: n may be in m_last_result, and this is the only reference to n.
             // When, we execute reset() it is deleted
-            // To avoid this bug, I bump the reference counter before reseting m_last_result
+            // To avoid this bug, I bump the reference counter before resetting m_last_result
             ast_ref node(n, m());
             m_last_result.reset();
             m_last_result.push_back(std::move(node));

src/api/api_datalog.cpp

@@ -210,7 +210,7 @@ extern "C" {
         if (!out) {
             return Z3_FALSE;
         }
-        // must start loggging here, since function uses Z3_get_sort_kind above
+        // must start logging here, since function uses Z3_get_sort_kind above
         LOG_Z3_get_finite_domain_sort_size(c, s, out);
         RESET_ERROR_CODE();  
         VERIFY(mk_c(c)->datalog_util().try_get_size(to_sort(s), *out));

src/api/dotnet/ArithExpr.cs

@@ -45,7 +45,7 @@ namespace Microsoft.Z3
 
         private static ArithExpr MkNum(ArithExpr e, double d) { return (ArithExpr)e.Context.MkNumeral(d.ToString(), e.Context.MkRealSort()); }        
 
-        /// <summary> Operator overloading for arithmetical divsion operator (over reals) </summary>
+        /// <summary> Operator overloading for arithmetical division operator (over reals) </summary>
         public static ArithExpr operator /(ArithExpr a, ArithExpr b) { return a.Context.MkDiv(a, b); }
 
         /// <summary> Operator overloading for arithmetical operator </summary>

src/api/dotnet/Context.cs

@@ -2459,7 +2459,7 @@ namespace Microsoft.Z3
 
         #endregion
 
-        #region Sequence, string and regular expresions
+        #region Sequence, string and regular expressions
 
         /// <summary>
         /// Create the empty sequence.
@@ -3131,7 +3131,7 @@ namespace Microsoft.Z3
         /// <summary>
         /// Create a bit-vector numeral.
         /// </summary>
-        /// <param name="bits">An array of bits representing the bit-vector. Least signficant bit is at position 0.</param>
+        /// <param name="bits">An array of bits representing the bit-vector. Least significant bit is at position 0.</param>
         public BitVecNum MkBV(bool[] bits)
         {
             Contract.Ensures(Contract.Result<BitVecNum>() != null);

src/api/dotnet/Expr.cs

@@ -842,7 +842,7 @@ namespace Microsoft.Z3
         public string String { get { return Native.Z3_get_string(Context.nCtx, NativeObject); } }
 
         /// <summary>
-        /// Check whether expression is a concatentation.
+        /// Check whether expression is a concatenation.
         /// </summary>
         /// <returns>a Boolean</returns>
         public bool IsConcat { get { return IsApp && FuncDecl.DeclKind == Z3_decl_kind.Z3_OP_SEQ_CONCAT; } }

src/api/python/z3/z3util.py

@@ -199,7 +199,7 @@ def prove(claim,assume=None,verbose=0):
     >>> r,m = prove(True,assume=And(x,Not(x)),verbose=0)
     Traceback (most recent call last):
     ...
-    AssertionError: Assumption is alway False!
+    AssertionError: Assumption is always False!
 
     >>> r,m = prove(Implies(x,x),assume=y,verbose=2); r,model_str(m,as_str=False)
     assume: 
@@ -238,7 +238,7 @@ def prove(claim,assume=None,verbose=0):
             is_proved,_ = prove(Not(assume))
 
             def _f():
-                emsg = "Assumption is alway False!"
+                emsg = "Assumption is always False!"
                 if verbose >= 2:
                     emsg = "{}\n{}".format(assume,emsg)
                 return emsg

src/api/z3_api.h

@@ -3772,7 +3772,7 @@ extern "C" {
         );
 
     /**
-       \brief Create a lambda expression. It taks an expression \c body that contains bound variables 
+       \brief Create a lambda expression. It takes an expression \c body that contains bound variables
        of the same sorts as the sorts listed in the array \c sorts. The bound variables are de-Bruijn indices created
        using #Z3_mk_bound. The array \c decl_names contains the names that the quantified formula uses for the
        bound variables. Z3 applies the convention that the last element in the \c decl_names and \c sorts array
@@ -4609,7 +4609,7 @@ extern "C" {
     Z3_bool Z3_API Z3_is_quantifier_exists(Z3_context c, Z3_ast a);
 
     /**
-       \brief Determine if ast is a lambda expresion.
+       \brief Determine if ast is a lambda expression.
 
        \pre Z3_get_ast_kind(a) == Z3_QUANTIFIER_AST
 
@@ -5996,7 +5996,7 @@ extern "C" {
     Z3_solver Z3_API Z3_solver_translate(Z3_context source, Z3_solver s, Z3_context target);
 
     /**
-       \brief Ad-hoc method for importing model convertion from solver.
+       \brief Ad-hoc method for importing model conversion from solver.
        
        def_API('Z3_solver_import_model_converter', VOID, (_in(CONTEXT), _in(SOLVER), _in(SOLVER)))
      */
@@ -6215,7 +6215,7 @@ extern "C" {
        The third argument is a vector of variables that may be used for cubing.
        The contents of the vector is only used in the first call. The initial list of variables
        is used in subsequent calls until it returns the unsatisfiable cube. 
-       The vector is modified to contain a set of Autarky variables that occor in clauses that
+       The vector is modified to contain a set of Autarky variables that occur in clauses that
        are affected by the (last literal in the) cube. These variables could be used by a different
        cuber (on a different solver object) for further recursive cubing.