Fix indentation in arg/

Author: sim642

src/arg/argConstraints.ml

@@ -7,7 +7,7 @@ open Analyses
 (** Add path sensitivity to a analysis *)
 module PathSensitive3 (Spec:Spec)
   : Spec
-    (* with type D.t = SetDomain.ToppedSet(Spec.D)(N).t
+  (* with type D.t = SetDomain.ToppedSet(Spec.D)(N).t
      and module G = Spec.G
      and module C = Spec.C *)
 =
@@ -266,7 +266,7 @@ struct
 
   let should_inline f =
     (* (* inline __VERIFIER_error because Control requires the corresponding FunctionEntry node *)
-    not (Svcomp.is_special_function f) || Svcomp.is_error_function f *)
+       not (Svcomp.is_special_function f) || Svcomp.is_error_function f *)
     (* TODO: don't inline __VERIFIER functions for CPAchecker, but inlining needed for WP *)
     true
 

src/arg/argTools.ml

@@ -199,11 +199,11 @@ struct
     struct
       module Node: MyARG.Node with type t = Node.t =
         (val match GobConfig.get_string "exp.arg.id" with
-          | "node" ->
-            (module Node: MyARG.Node with type t = Node.t)
-          | "enumerate" ->
-            (module EnumerateNode (Node): MyARG.Node with type t = Node.t)
-          | _ -> failwith "exp.arg.id: illegal value"
+           | "node" ->
+             (module Node: MyARG.Node with type t = Node.t)
+           | "enumerate" ->
+             (module EnumerateNode (Node): MyARG.Node with type t = Node.t)
+           | _ -> failwith "exp.arg.id: illegal value"
         )
 
       module Edge = MyARG.InlineEdge

src/arg/observerAnalysis.ml

@@ -94,18 +94,18 @@ struct
       type t = Node.t * Node.t [@@deriving eq]
       let pattern = Array.of_list Arg.path
     end
-  )
+    )
 
   include MakeSpec (KMP)
 
   (* let () = Arg.path
-    |> List.map (fun (p, n) -> Printf.sprintf "(%d, %d)" p n)
-    |> String.concat "; "
-    |> Printf.printf "observer path: [%s]\n" *)
+     |> List.map (fun (p, n) -> Printf.sprintf "(%d, %d)" p n)
+     |> String.concat "; "
+     |> Printf.printf "observer path: [%s]\n" *)
 end
 
 (* let _ =
-  let module Spec = MakeSpec (
+   let module Spec = MakeSpec (
     struct
       (* let path = [(23, 24); (24, 25)] *)
       (* let path = [(30, 32); (32, 34); (34, 26); (26, 29)] *)
@@ -126,6 +126,6 @@ end
       (* let path = [(20, 21); (21, 25); (25, 27)] *)
       let path = [(23, 24); (24, 25); (25, 27)]
     end
-  )
-  in
-  MCP.register_analysis (module Spec) *)
+   )
+   in
+   MCP.register_analysis (module Spec) *)

src/arg/observerAutomaton.ml

@@ -30,14 +30,14 @@ struct
   let accepting q = q = m
 
   (* let next_inner prefix q x =
-    let q' = ref q in
-    while !q' > 0 && not (equal pattern.(!q') x) do
+     let q' = ref q in
+     while !q' > 0 && not (equal pattern.(!q') x) do
       q' := prefix.(!q' - 1)
-    done;
-    if equal pattern.(!q') x then begin
+     done;
+     if equal pattern.(!q') x then begin
       q' := !q' + 1
-    end;
-    !q' *)
+     end;
+     !q' *)
   let rec next_inner prefix q x =
     if q > 0 && not (equal pattern.(q) x) then
       next_inner prefix prefix.(q - 1) x

src/arg/violation.ml

@@ -124,35 +124,35 @@ let find_path (type node) (module Arg:ViolationArg with type Node.t = node) (mod
     | Some path ->
       print_path path;
       begin match Feasibility.check_path path with
-      | Feasibility.Feasible ->
-        Logs.debug "feasible";
-
-        let module PathArg =
-        struct
-          module Node = Arg.Node
-          module Edge = Arg.Edge
-
-          let main_entry = BatTuple.Tuple3.first (List.hd path)
-
-          let next =
-            let module NHT = BatHashtbl.Make (Node) in
-            let next = NHT.create (List.length path) in
-            List.iter (fun (n1, e, n2) ->
-                NHT.modify_def [] n1 (fun nexts -> (e, n2) :: nexts) next
-              ) path;
-
-            (fun n -> NHT.find_default next n [])
-        end
-        in
-        Feasible (module PathArg)
-      | Feasibility.Infeasible subpath ->
-        Logs.debug "infeasible";
-        print_path subpath;
-
-        Infeasible subpath
-      | Feasibility.Unknown ->
-        Logs.debug "unknown";
-        Unknown
+        | Feasibility.Feasible ->
+          Logs.debug "feasible";
+
+          let module PathArg =
+          struct
+            module Node = Arg.Node
+            module Edge = Arg.Edge
+
+            let main_entry = BatTuple.Tuple3.first (List.hd path)
+
+            let next =
+              let module NHT = BatHashtbl.Make (Node) in
+              let next = NHT.create (List.length path) in
+              List.iter (fun (n1, e, n2) ->
+                  NHT.modify_def [] n1 (fun nexts -> (e, n2) :: nexts) next
+                ) path;
+
+              (fun n -> NHT.find_default next n [])
+          end
+          in
+          Feasible (module PathArg)
+        | Feasibility.Infeasible subpath ->
+          Logs.debug "infeasible";
+          print_path subpath;
+
+          Infeasible subpath
+        | Feasibility.Unknown ->
+          Logs.debug "unknown";
+          Unknown
       end
     | None ->
       Unknown