svf-lib 1.0.798 → 1.0.802

package/SVF-linux/include/Graphs/CHG.h

@@ -238,18 +238,18 @@ public:
     void view();
     void printCH();
 
-    inline s32_t getVirtualFunctionID(const SVFFunction* vfn) const
+    inline s64_t getVirtualFunctionID(const SVFFunction* vfn) const
     {
-        Map<const SVFFunction*, s32_t>::const_iterator it =
+        Map<const SVFFunction*, s64_t>::const_iterator it =
             virtualFunctionToIDMap.find(vfn);
         if (it != virtualFunctionToIDMap.end())
             return it->second;
         else
             return -1;
     }
-    inline const SVFFunction* getVirtualFunctionBasedonID(s32_t id) const
+    inline const SVFFunction* getVirtualFunctionBasedonID(s64_t id) const
     {
-        Map<const SVFFunction*, s32_t>::const_iterator it, eit;
+        Map<const SVFFunction*, s64_t>::const_iterator it, eit;
         for (it = virtualFunctionToIDMap.begin(), eit =
                     virtualFunctionToIDMap.end(); it != eit; ++it)
         {
@@ -309,7 +309,7 @@ public:
 private:
     SVFModule* svfMod;
     u32_t classNum;
-    s32_t vfID;
+    s64_t vfID;
     double buildingCHGTime;
     Map<std::string, CHNode *> classNameToNodeMap;
     NameToCHNodesMap classNameToDescendantsMap;
@@ -318,7 +318,7 @@ private:
     NameToCHNodesMap templateNameToInstancesMap;
     CallSiteToCHNodesMap csToClassesMap;
 
-    Map<const SVFFunction*, s32_t> virtualFunctionToIDMap;
+    Map<const SVFFunction*, s64_t> virtualFunctionToIDMap;
     CallSiteToVTableSetMap csToCHAVtblsMap;
     CallSiteToVFunSetMap csToCHAVFnsMap;
 };

package/SVF-linux/include/Graphs/ConsGEdge.h

@@ -304,7 +304,7 @@ public:
     }
 
     /// Get location set of the gep edge
-    inline Size_t getFieldOffset() const
+    inline s64_t getFieldOffset() const
     {
         return ls.accumulateConstantFieldIdx();
     }

package/SVF-linux/include/Graphs/ConsGNode.h

@@ -364,15 +364,15 @@ public:
     //{@
     inline void removeOutgoingAddrEdge(AddrCGEdge* outEdge)
     {
-        Size_t num1 = addressOutEdges.erase(outEdge);
-        Size_t num2 = removeOutgoingEdge(outEdge);
+        u32_t num1 = addressOutEdges.erase(outEdge);
+        u32_t num2 = removeOutgoingEdge(outEdge);
         assert((num1 && num2) && "edge not in the set, can not remove!!!");
     }
 
     inline void removeIncomingAddrEdge(AddrCGEdge* inEdge)
     {
-        Size_t num1 = addressInEdges.erase(inEdge);
-        Size_t num2 = removeIncomingEdge(inEdge);
+        u32_t num1 = addressInEdges.erase(inEdge);
+        u32_t num2 = removeIncomingEdge(inEdge);
         assert((num1 && num2) && "edge not in the set, can not remove!!!");
     }
 
@@ -382,8 +382,8 @@ public:
             gepOutEdges.erase(outEdge);
         else
             copyOutEdges.erase(outEdge);
-        Size_t num1 = directOutEdges.erase(outEdge);
-        Size_t num2 = removeOutgoingEdge(outEdge);
+        u32_t num1 = directOutEdges.erase(outEdge);
+        u32_t num2 = removeOutgoingEdge(outEdge);
         assert((num1 && num2) && "edge not in the set, can not remove!!!");
     }
 
@@ -393,36 +393,36 @@ public:
             gepInEdges.erase(inEdge);
         else
             copyInEdges.erase(inEdge);
-        Size_t num1 = directInEdges.erase(inEdge);
-        Size_t num2 = removeIncomingEdge(inEdge);
+        u32_t num1 = directInEdges.erase(inEdge);
+        u32_t num2 = removeIncomingEdge(inEdge);
         assert((num1 && num2) && "edge not in the set, can not remove!!!");
     }
 
     inline void removeOutgoingLoadEdge(LoadCGEdge* outEdge)
     {
-        Size_t num1 = loadOutEdges.erase(outEdge);
-        Size_t num2 = removeOutgoingEdge(outEdge);
+        u32_t num1 = loadOutEdges.erase(outEdge);
+        u32_t num2 = removeOutgoingEdge(outEdge);
         assert((num1 && num2) && "edge not in the set, can not remove!!!");
     }
 
     inline void removeIncomingLoadEdge(LoadCGEdge* inEdge)
     {
-        Size_t num1 = loadInEdges.erase(inEdge);
-        Size_t num2 = removeIncomingEdge(inEdge);
+        u32_t num1 = loadInEdges.erase(inEdge);
+        u32_t num2 = removeIncomingEdge(inEdge);
         assert((num1 && num2) && "edge not in the set, can not remove!!!");
     }
 
     inline void removeOutgoingStoreEdge(StoreCGEdge* outEdge)
     {
-        Size_t num1 = storeOutEdges.erase(outEdge);
-        Size_t num2 = removeOutgoingEdge(outEdge);
+        u32_t num1 = storeOutEdges.erase(outEdge);
+        u32_t num2 = removeOutgoingEdge(outEdge);
         assert((num1 && num2) && "edge not in the set, can not remove!!!");
     }
 
     inline void removeIncomingStoreEdge(StoreCGEdge* inEdge)
     {
-        Size_t num1 = storeInEdges.erase(inEdge);
-        Size_t num2 = removeIncomingEdge(inEdge);
+        u32_t num1 = storeInEdges.erase(inEdge);
+        u32_t num2 = removeIncomingEdge(inEdge);
         assert((num1 && num2) && "edge not in the set, can not remove!!!");
     }
     //@}

package/SVF-linux/include/Graphs/GenericGraph.h

@@ -50,7 +50,7 @@ public:
     ///	(1) 0-7 bits encode an edge kind (allow maximum 16 kinds)
     /// (2) 8-63 bits encode a callsite instruction
     typedef u64_t GEdgeFlag;
-    typedef s32_t GEdgeKind;
+    typedef s64_t GEdgeKind;
 private:
     NodeTy* src;		///< source node
     NodeTy* dst;		///< destination node
@@ -132,7 +132,7 @@ public:
     typedef NodeTy NodeType;
     typedef EdgeTy EdgeType;
     /// Edge kind
-    typedef s32_t GNodeK;
+    typedef s64_t GNodeK;
     typedef OrderedSet<EdgeType*, typename EdgeType::equalGEdge> GEdgeSetTy;
     /// Edge iterator
     ///@{
@@ -284,13 +284,13 @@ public:
 
     /// Remove incoming and outgoing edges
     ///@{
-    inline Size_t removeIncomingEdge(EdgeType* edge)
+    inline u32_t removeIncomingEdge(EdgeType* edge)
     {
         iterator it = InEdges.find(edge);
         assert(it != InEdges.end() && "can not find in edge in SVFG node");
         return InEdges.erase(edge);
     }
-    inline Size_t removeOutgoingEdge(EdgeType* edge)
+    inline u32_t removeOutgoingEdge(EdgeType* edge)
     {
         iterator it = OutEdges.find(edge);
         assert(it != OutEdges.end() && "can not find out edge in SVFG node");

package/SVF-linux/include/Graphs/IRGraph.h

@@ -166,11 +166,11 @@ public:
         return symInfo->getConstantObj();
     }
 
-    inline Size_t getValueNodeNum() const
+    inline u32_t getValueNodeNum() const
     {
         return symInfo->valSyms().size();
     }
-    inline Size_t getObjectNodeNum() const
+    inline u32_t getObjectNodeNum() const
     {
         return symInfo->idToObjMap().size();
     }
@@ -183,15 +183,15 @@ public:
         nodeNumAfterPAGBuild = num;
     }
 
-    inline Size_t getPAGNodeNum() const
+    inline u32_t getPAGNodeNum() const
     {
         return nodeNum;
     }
-    inline Size_t getPAGEdgeNum() const
+    inline u32_t getPAGEdgeNum() const
     {
         return edgeNum;
     }
-    inline Size_t getPTAPAGEdgeNum() const
+    inline u32_t getPTAPAGEdgeNum() const
     {
         return totalPTAPAGEdge;
     }

package/SVF-linux/include/Graphs/PTACallGraph.h

@@ -251,7 +251,7 @@ protected:
     CallInstToCallGraphEdgesMap callinstToCallGraphEdgesMap; ///< Map a call instruction to its corresponding call edges
 
     NodeID callGraphNodeNum;
-    Size_t numOfResolvedIndCallEdge;
+    u32_t numOfResolvedIndCallEdge;
 
     /// Clean up memory
     void destroy();
@@ -297,7 +297,7 @@ public:
         return totalCallSiteNum;
     }
 
-    inline Size_t getNumOfResolvedIndCallEdge() const
+    inline u32_t getNumOfResolvedIndCallEdge() const
     {
         return numOfResolvedIndCallEdge;
     }

package/SVF-linux/include/MSSA/MSSAMuChi.h

@@ -47,7 +47,7 @@ public:
     typedef MSSADEF MSSADef;
 private:
     /// ver ID 0 is reserved
-    static Size_t totalVERNum;
+    static u32_t totalVERNum;
     const MemRegion* mr;
     MRVERSION version;
     MRVERID vid;

package/SVF-linux/include/MSSA/MemRegion.h

@@ -55,7 +55,7 @@ public:
     typedef bool Condition;
 private:
     /// region ID 0 is reserved
-    static Size_t totalMRNum;
+    static u32_t totalMRNum;
     MRID rid;
     const NodeBS cptsSet;
 
@@ -413,7 +413,7 @@ protected:
     //@}
 
 public:
-    inline Size_t getMRNum() const
+    inline u32_t getMRNum() const
     {
         return memRegSet.size();
     }

package/SVF-linux/include/MemoryModel/LocationSet.h

@@ -78,10 +78,10 @@ public:
         NonOverlap, Overlap, Subset, Superset, Same
     };
 
-    typedef std::vector<const Value* > OffsetValueVec;
+    typedef std::vector<std::pair<const Value*, const Type*> > OffsetValueVec;
 
     /// Constructor
-    LocationSet(Size_t o = 0) : fldIdx(o)
+    LocationSet(s64_t o = 0) : fldIdx(o)
     {}
 
     /// Copy Constructor
@@ -98,50 +98,16 @@ public:
 
     ~LocationSet() {}
 
-
     /// Overload operators
     //@{
-    inline LocationSet operator+ (const LocationSet& rhs) const
-    {
-        LocationSet ls(rhs);
-        ls.fldIdx += accumulateConstantFieldIdx();
-        OffsetValueVec::const_iterator it = getOffsetValueVec().begin();
-        OffsetValueVec::const_iterator eit = getOffsetValueVec().end();
-        for (; it != eit; ++it)
-            ls.addOffsetValue(*it);
-
-        return ls;
-    }
+    LocationSet operator+ (const LocationSet& rhs) const;
+    bool operator< (const LocationSet& rhs) const;
     inline const LocationSet& operator= (const LocationSet& rhs)
     {
         fldIdx = rhs.fldIdx;
         offsetValues = rhs.getOffsetValueVec();
         return *this;
     }
-    inline bool operator< (const LocationSet& rhs) const
-    {
-        if (fldIdx != rhs.fldIdx)
-            return (fldIdx < rhs.fldIdx);
-        else
-        {
-            const OffsetValueVec& pairVec = getOffsetValueVec();
-            const OffsetValueVec& rhsPairVec = rhs.getOffsetValueVec();
-            if (pairVec.size() != rhsPairVec.size())
-                return (pairVec.size() < rhsPairVec.size());
-            else
-            {
-                OffsetValueVec::const_iterator it = pairVec.begin();
-                OffsetValueVec::const_iterator rhsIt = rhsPairVec.begin();
-                for (; it != pairVec.end() && rhsIt != rhsPairVec.end(); ++it, ++rhsIt)
-                {
-                    return (*it) < (*rhsIt);
-                }
-
-                return false;
-            }
-        }
-    }
-
     inline bool operator==(const LocationSet& rhs) const
     {
         return this->fldIdx == rhs.fldIdx
@@ -151,11 +117,11 @@ public:
 
     /// Get methods
     //@{
-    inline Size_t accumulateConstantFieldIdx() const
+    inline s64_t accumulateConstantFieldIdx() const
     {
         return fldIdx;
     }
-    inline void setFldIdx(Size_t idx)
+    inline void setFldIdx(s64_t idx)
     {
         fldIdx = idx;
     }
@@ -165,7 +131,9 @@ public:
     }
     //@}
 
-    bool addOffsetValue(const Value* offsetValue);
+    s64_t accumulateConstantOffset() const;
+
+    bool addOffsetValue(const Value* offsetValue, const Type* type);
 
     /// Return TRUE if this is a constant location set.
     bool isConstantOffset() const;
@@ -187,13 +155,7 @@ private:
     /// Compute all possible locations according to offset and number-stride pairs.
     NodeBS computeAllLocations() const;
 
-    /// Return greatest common divisor
-    inline unsigned gcd (unsigned n1, unsigned n2) const
-    {
-        return (n2 == 0) ? n1 : gcd (n2, n1 % n2);
-    }
-
-    Size_t fldIdx;	///< Accumulated Constant Offsets
+    s64_t fldIdx;	///< Accumulated Constant Offsets
     OffsetValueVec offsetValues;	///< a vector of actual offset in the form of Values
 };
 

package/SVF-linux/include/MemoryModel/PAGBuilderFromFile.h

@@ -71,7 +71,7 @@ public:
     SVFIR* build();
 
     // Add edges
-    void addEdge(NodeID nodeSrc, NodeID nodeDst, Size_t offset,
+    void addEdge(NodeID nodeSrc, NodeID nodeDst, s64_t offset,
                  std::string edge);
 };
 

package/SVF-linux/include/MemoryModel/PointerAnalysis.h

@@ -170,7 +170,7 @@ public:
 		return pag->getICFG();
 	}
     /// Return number of resolved indirect call edges
-    inline Size_t getNumOfResolvedIndCallEdge() const
+    inline u32_t getNumOfResolvedIndCallEdge() const
     {
         return getPTACallGraph()->getNumOfResolvedIndCallEdge();
     }

package/SVF-linux/include/MemoryModel/SVFIR.h

@@ -63,7 +63,7 @@ public:
     typedef Map<const SVFFunction*,SVFStmtSet> FunToPAGEdgeSetMap;
     typedef Map<const ICFGNode*,SVFStmtList> ICFGNode2SVFStmtsMap;
     typedef Map<NodeID, NodeID> NodeToNodeMap;
-    typedef std::pair<NodeID, Size_t> NodeOffset;
+    typedef std::pair<NodeID, s64_t> NodeOffset;
     typedef std::pair<NodeID, LocationSet> NodeLocationSet;
     typedef Map<NodeOffset,NodeID> NodeOffsetMap;
     typedef Map<NodeLocationSet,NodeID> NodeLocationSetMap;
@@ -281,11 +281,11 @@ public:
 
     /// Node and edge statistics
     //@{
-    inline Size_t getFieldValNodeNum() const
+    inline u32_t getFieldValNodeNum() const
     {
         return GepValObjMap.size();
     }
-    inline Size_t getFieldObjNodeNum() const
+    inline u32_t getFieldObjNodeNum() const
     {
         return GepObjVarMap.size();
     }

package/SVF-linux/include/MemoryModel/SVFStatements.h

@@ -62,7 +62,7 @@ private:
     ICFGNode *icfgNode;   ///< ICFGNode
     EdgeID edgeId;					///< Edge ID
 public:
-    static Size_t totalEdgeNum;		///< Total edge number
+    static u32_t totalEdgeNum;		///< Total edge number
 
     /// Constructor
     SVFStmt(SVFVar* s, SVFVar* d, GEdgeFlag k);
@@ -489,7 +489,7 @@ public:
     {}
 
     /// offset of the gep edge
-    inline u32_t getFieldOffset() const
+    inline s64_t getFieldOffset() const
     {
         return getLocationSet().accumulateConstantFieldIdx();
     }

package/SVF-linux/include/MemoryModel/SVFVariables.h

@@ -422,7 +422,7 @@ public:
     }
 
     /// offset of the base value variable
-    inline u32_t getFieldOffset() const
+    inline s64_t getFieldOffset() const
     {
         return ls.accumulateConstantFieldIdx();
     }
@@ -497,7 +497,7 @@ public:
     }
 
     /// offset of the mem object
-    inline u32_t getFieldOffset() const
+    inline s64_t getFieldOffset() const
     {
         return ls.accumulateConstantFieldIdx();
     }

package/SVF-linux/include/MemoryModel/SymbolTableInfo.h

@@ -302,7 +302,7 @@ public:
  
     /// Statistics
     //@{
-    inline Size_t getTotalSymNum() const
+    inline u32_t getTotalSymNum() const
     {
         return totalSymNum;
     }
@@ -454,7 +454,7 @@ public:
     const Type* getType() const;
 
     /// Get max field offset limit
-    Size_t getMaxFieldOffsetLimit() const;
+    u32_t getMaxFieldOffsetLimit() const;
 
     /// Return true if its field limit is 0
     bool isFieldInsensitive() const;
@@ -601,7 +601,7 @@ private:
     /// LLVM type
     const Type* type;
     /// Type flags
-    Size_t flags;
+    u32_t flags;
     /// Max offset for flexible field sensitive analysis
     /// maximum number of field object can be created
     /// minimum number is 0 (field insensitive analysis)

package/SVF-linux/include/SVF-FE/SVFIRBuilder.h

@@ -73,7 +73,7 @@ public:
     //@{
     void initialiseNodes();
     void addEdge(NodeID src, NodeID dst, PAGEdge::PEDGEK kind,
-                 Size_t offset = 0, Instruction* cs = nullptr);
+                 s64_t offset = 0, Instruction* cs = nullptr);
     // @}
 
     /// Sanity check for SVFIR
@@ -122,7 +122,7 @@ public:
     void processCE(const Value *val);
 
     /// Infer field index from byteoffset.
-    u32_t inferFieldIdxFromByteOffset(const llvm::GEPOperator* gepOp, DataLayout *dl, LocationSet& ls, Size_t idx);
+    u32_t inferFieldIdxFromByteOffset(const llvm::GEPOperator* gepOp, DataLayout *dl, LocationSet& ls, s64_t idx);
 
     /// Compute offset of a gep instruction or gep constant expression
     bool computeGepOffset(const User *V, LocationSet& ls);

package/SVF-linux/include/Util/IRAnnotator.h

@@ -85,7 +85,7 @@ private:
         {
             std::string label = it->getName().str();
             std::string toErase = "gepnode-";
-            SVF::Size_t pos = label.find(toErase);
+            SVF::s64_t pos = label.find(toErase);
             if (pos == std::string::npos)
             {
                 continue;
@@ -96,7 +96,7 @@ private:
             auto mdNode = it->getOperand(0);
 
             SVF::NodeID baseNodeId = std::stoi(llvm::cast<llvm::MDString>(mdNode->getOperand(0))->getString().str());
-            SVF::Size_t locationSetOffset = std::stoi(llvm::cast<llvm::MDString>(mdNode->getOperand(1))->getString().str());
+            SVF::s64_t locationSetOffset = std::stoi(llvm::cast<llvm::MDString>(mdNode->getOperand(1))->getString().str());
 
             LocationSet locationSet = LocationSet(locationSetOffset);
             SVF::NodeID gepnodeId = pag->getGepObjVar(baseNodeId, locationSet);

package/SVF-linux/include/Util/SVFBasicTypes.h

@@ -73,9 +73,9 @@ template <class T> struct Hash {
 };
 
 typedef unsigned u32_t;
-typedef unsigned long long u64_t;
 typedef signed s32_t;
-typedef signed long Size_t;
+typedef unsigned long long u64_t;
+typedef signed s64_t;
 
 typedef u32_t NodeID;
 typedef u32_t EdgeID;
@@ -183,7 +183,7 @@ class SVFValue
 {
 
 public:
-    typedef s32_t GNodeK;
+    typedef s64_t GNodeK;
 
     enum SVFValKind
     {

package/SVF-linux/include/WPA/Andersen.h

@@ -119,20 +119,20 @@ public:
 
     /// Statistics
     //@{
-    static Size_t numOfProcessedAddr;   /// Number of processed Addr edge
-    static Size_t numOfProcessedCopy;   /// Number of processed Copy edge
-    static Size_t numOfProcessedGep;    /// Number of processed Gep edge
-    static Size_t numOfProcessedLoad;   /// Number of processed Load edge
-    static Size_t numOfProcessedStore;  /// Number of processed Store edge
-    static Size_t numOfSfrs;
-    static Size_t numOfFieldExpand;
-
-    static Size_t numOfSCCDetection;
+    static u32_t numOfProcessedAddr;   /// Number of processed Addr edge
+    static u32_t numOfProcessedCopy;   /// Number of processed Copy edge
+    static u32_t numOfProcessedGep;    /// Number of processed Gep edge
+    static u32_t numOfProcessedLoad;   /// Number of processed Load edge
+    static u32_t numOfProcessedStore;  /// Number of processed Store edge
+    static u32_t numOfSfrs;
+    static u32_t numOfFieldExpand;
+
+    static u32_t numOfSCCDetection;
     static double timeOfSCCDetection;
     static double timeOfSCCMerges;
     static double timeOfCollapse;
-    static Size_t AveragePointsToSetSize;
-    static Size_t MaxPointsToSetSize;
+    static u32_t AveragePointsToSetSize;
+    static u32_t MaxPointsToSetSize;
     static double timeOfProcessCopyGep;
     static double timeOfProcessLoadStore;
     static double timeOfUpdateCallGraph;

package/SVF-linux/include/WPA/AndersenSFR.h

@@ -149,7 +149,7 @@ public:
 protected:
     void initialize();
     void PWCDetect();
-    void fieldExpand(NodeSet& initials, Size_t offset, NodeBS& strides, PointsTo& expandPts);
+    void fieldExpand(NodeSet& initials, s64_t offset, NodeBS& strides, PointsTo& expandPts);
     bool processGepPts(PointsTo& pts, const GepCGEdge* edge);
     bool mergeSrcToTgt(NodeID nodeId, NodeID newRepId);
 

package/SVF-linux/include/WPA/CSC.h

@@ -69,7 +69,7 @@ public:
         : _consG(g), _scc(c), _I(0) {}
 
     void find(NodeStack& candidates);
-    void visit(NodeID nodeId, Size_t _w);
+    void visit(NodeID nodeId, s64_t _w);
     void clear();
 
     bool isVisited(NodeID nId)

package/SVF-linux/include/WPA/FlowSensitive.h

@@ -288,19 +288,19 @@ protected:
 
     /// Statistics.
     //@{
-    Size_t numOfProcessedAddr;	/// Number of processed Addr node
-    Size_t numOfProcessedCopy;	/// Number of processed Copy node
-    Size_t numOfProcessedGep;	/// Number of processed Gep node
-    Size_t numOfProcessedPhi;	/// Number of processed Phi node
-    Size_t numOfProcessedLoad;	/// Number of processed Load node
-    Size_t numOfProcessedStore;	/// Number of processed Store node
-    Size_t numOfProcessedActualParam;	/// Number of processed actual param node
-    Size_t numOfProcessedFormalRet;	/// Number of processed formal ret node
-    Size_t numOfProcessedMSSANode;	/// Number of processed mssa node
-
-    Size_t maxSCCSize;
-    Size_t numOfSCC;
-    Size_t numOfNodesInSCC;
+    u32_t numOfProcessedAddr;	/// Number of processed Addr node
+    u32_t numOfProcessedCopy;	/// Number of processed Copy node
+    u32_t numOfProcessedGep;	/// Number of processed Gep node
+    u32_t numOfProcessedPhi;	/// Number of processed Phi node
+    u32_t numOfProcessedLoad;	/// Number of processed Load node
+    u32_t numOfProcessedStore;	/// Number of processed Store node
+    u32_t numOfProcessedActualParam;	/// Number of processed actual param node
+    u32_t numOfProcessedFormalRet;	/// Number of processed formal ret node
+    u32_t numOfProcessedMSSANode;	/// Number of processed mssa node
+
+    u32_t maxSCCSize;
+    u32_t numOfSCC;
+    u32_t numOfNodesInSCC;
 
     double solveTime;	///< time of solve.
     double sccTime;	///< time of SCC detection.

package/SVF-linux/include/WPA/VersionedFlowSensitive.h

@@ -223,8 +223,8 @@ private:
 
     /// Additional statistics.
     //@{
-    Size_t numPrelabeledNodes;  ///< Number of prelabeled nodes.
-    Size_t numPrelabelVersions; ///< Number of versions created during prelabeling.
+    u32_t numPrelabeledNodes;  ///< Number of prelabeled nodes.
+    u32_t numPrelabelVersions; ///< Number of versions created during prelabeling.
 
     double prelabelingTime;  ///< Time to prelabel SVFG.
     double meldLabelingTime; ///< Time to meld label SVFG.