/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-wmm/rfi006_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 04:46:43,667 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 04:46:43,708 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-11-30 04:46:43,724 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 04:46:43,724 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 04:46:43,725 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 04:46:43,726 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 04:46:43,726 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 04:46:43,726 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 04:46:43,729 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 04:46:43,729 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 04:46:43,729 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 04:46:43,729 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 04:46:43,730 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 04:46:43,730 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 04:46:43,730 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 04:46:43,730 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 04:46:43,730 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 04:46:43,730 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 04:46:43,730 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 04:46:43,731 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 04:46:43,732 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 04:46:43,732 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 04:46:43,733 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 04:46:43,733 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 04:46:43,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:46:43,734 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 04:46:43,734 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 04:46:43,734 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 04:46:43,735 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 04:46:43,735 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 04:46:43,735 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 04:46:43,735 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 04:46:43,735 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-11-30 04:46:43,890 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 04:46:43,902 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 04:46:43,903 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 04:46:43,904 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 04:46:43,904 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 04:46:43,905 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi006_power.oepc.i [2023-11-30 04:46:45,012 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 04:46:45,252 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 04:46:45,252 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi006_power.oepc.i [2023-11-30 04:46:45,279 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c105de03a/54674680cb5a47dd9503070cb5ef2bd8/FLAG61ff3d3f1 [2023-11-30 04:46:45,293 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c105de03a/54674680cb5a47dd9503070cb5ef2bd8 [2023-11-30 04:46:45,295 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 04:46:45,296 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 04:46:45,299 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 04:46:45,299 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 04:46:45,302 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 04:46:45,303 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:46:45" (1/1) ... [2023-11-30 04:46:45,304 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b838c79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:46:45, skipping insertion in model container [2023-11-30 04:46:45,304 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:46:45" (1/1) ... [2023-11-30 04:46:45,353 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 04:46:45,666 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:46:45,677 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 04:46:45,724 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:46:45,751 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 04:46:45,751 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 04:46:45,757 INFO L206 MainTranslator]: Completed translation [2023-11-30 04:46:45,758 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:46:45 WrapperNode [2023-11-30 04:46:45,758 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 04:46:45,759 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 04:46:45,759 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 04:46:45,760 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 04:46:45,764 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:46:45" (1/1) ... [2023-11-30 04:46:45,789 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:46:45" (1/1) ... [2023-11-30 04:46:45,820 INFO L138 Inliner]: procedures = 176, calls = 76, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 139 [2023-11-30 04:46:45,821 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 04:46:45,821 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 04:46:45,822 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 04:46:45,822 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 04:46:45,828 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:46:45" (1/1) ... [2023-11-30 04:46:45,828 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:46:45" (1/1) ... [2023-11-30 04:46:45,832 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:46:45" (1/1) ... [2023-11-30 04:46:45,832 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:46:45" (1/1) ... [2023-11-30 04:46:45,838 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:46:45" (1/1) ... [2023-11-30 04:46:45,840 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:46:45" (1/1) ... [2023-11-30 04:46:45,842 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:46:45" (1/1) ... [2023-11-30 04:46:45,843 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:46:45" (1/1) ... [2023-11-30 04:46:45,846 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 04:46:45,847 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 04:46:45,847 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 04:46:45,847 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 04:46:45,848 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:46:45" (1/1) ... [2023-11-30 04:46:45,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:46:45,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 04:46:45,874 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-30 04:46:45,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-30 04:46:45,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 04:46:45,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 04:46:45,924 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-30 04:46:45,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 04:46:45,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 04:46:45,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 04:46:45,925 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-30 04:46:45,925 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-30 04:46:45,925 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-30 04:46:45,925 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-30 04:46:45,925 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-30 04:46:45,925 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-30 04:46:45,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 04:46:45,925 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-30 04:46:45,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 04:46:45,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 04:46:45,926 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-30 04:46:46,057 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 04:46:46,058 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 04:46:46,452 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 04:46:46,821 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 04:46:46,821 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-30 04:46:46,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:46:46 BoogieIcfgContainer [2023-11-30 04:46:46,822 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 04:46:46,823 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 04:46:46,823 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 04:46:46,825 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 04:46:46,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 04:46:45" (1/3) ... [2023-11-30 04:46:46,826 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21b90c86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:46:46, skipping insertion in model container [2023-11-30 04:46:46,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:46:45" (2/3) ... [2023-11-30 04:46:46,826 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21b90c86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:46:46, skipping insertion in model container [2023-11-30 04:46:46,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:46:46" (3/3) ... [2023-11-30 04:46:46,827 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi006_power.oepc.i [2023-11-30 04:46:46,842 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 04:46:46,842 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 46 error locations. [2023-11-30 04:46:46,842 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 04:46:46,927 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:46:46,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 186 places, 179 transitions, 370 flow [2023-11-30 04:46:47,030 INFO L124 PetriNetUnfolderBase]: 3/176 cut-off events. [2023-11-30 04:46:47,030 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:46:47,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 176 events. 3/176 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 286 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 120. Up to 2 conditions per place. [2023-11-30 04:46:47,034 INFO L82 GeneralOperation]: Start removeDead. Operand has 186 places, 179 transitions, 370 flow [2023-11-30 04:46:47,040 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 183 places, 176 transitions, 361 flow [2023-11-30 04:46:47,050 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:46:47,055 INFO L362 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6d0adaf6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:46:47,055 INFO L363 AbstractCegarLoop]: Starting to check reachability of 83 error locations. [2023-11-30 04:46:47,065 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:46:47,065 INFO L124 PetriNetUnfolderBase]: 0/57 cut-off events. [2023-11-30 04:46:47,065 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:46:47,065 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:46:47,065 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:46:47,065 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-11-30 04:46:47,068 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:46:47,069 INFO L85 PathProgramCache]: Analyzing trace with hash 798965458, now seen corresponding path program 1 times [2023-11-30 04:46:47,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:46:47,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865034068] [2023-11-30 04:46:47,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:46:47,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:46:47,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:46:47,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:46:47,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:46:47,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865034068] [2023-11-30 04:46:47,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865034068] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:46:47,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:46:47,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:46:47,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371705971] [2023-11-30 04:46:47,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:46:47,350 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:46:47,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:46:47,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:46:47,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:46:47,371 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 179 [2023-11-30 04:46:47,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 176 transitions, 361 flow. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:47,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:46:47,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 179 [2023-11-30 04:46:47,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:46:49,018 INFO L124 PetriNetUnfolderBase]: 4781/9525 cut-off events. [2023-11-30 04:46:49,019 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-30 04:46:49,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16457 conditions, 9525 events. 4781/9525 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 858. Compared 84135 event pairs, 3061 based on Foata normal form. 304/5218 useless extension candidates. Maximal degree in co-relation 16382. Up to 4440 conditions per place. [2023-11-30 04:46:49,083 INFO L140 encePairwiseOnDemand]: 149/179 looper letters, 56 selfloop transitions, 2 changer transitions 0/159 dead transitions. [2023-11-30 04:46:49,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 159 transitions, 443 flow [2023-11-30 04:46:49,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:46:49,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:46:49,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 428 transitions. [2023-11-30 04:46:49,093 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7970204841713222 [2023-11-30 04:46:49,093 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 428 transitions. [2023-11-30 04:46:49,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 428 transitions. [2023-11-30 04:46:49,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:46:49,096 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 428 transitions. [2023-11-30 04:46:49,098 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:49,101 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:49,101 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:49,104 INFO L307 CegarLoopForPetriNet]: 183 programPoint places, -26 predicate places. [2023-11-30 04:46:49,104 INFO L500 AbstractCegarLoop]: Abstraction has has 157 places, 159 transitions, 443 flow [2023-11-30 04:46:49,104 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:49,104 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:46:49,104 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:46:49,105 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 04:46:49,105 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-11-30 04:46:49,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:46:49,105 INFO L85 PathProgramCache]: Analyzing trace with hash 798965459, now seen corresponding path program 1 times [2023-11-30 04:46:49,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:46:49,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917435593] [2023-11-30 04:46:49,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:46:49,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:46:49,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:46:49,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:46:49,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:46:49,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917435593] [2023-11-30 04:46:49,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917435593] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:46:49,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:46:49,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:46:49,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391202348] [2023-11-30 04:46:49,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:46:49,200 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:46:49,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:46:49,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:46:49,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:46:49,201 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 179 [2023-11-30 04:46:49,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 159 transitions, 443 flow. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:49,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:46:49,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 179 [2023-11-30 04:46:49,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:46:50,555 INFO L124 PetriNetUnfolderBase]: 4808/9559 cut-off events. [2023-11-30 04:46:50,556 INFO L125 PetriNetUnfolderBase]: For 715/1891 co-relation queries the response was YES. [2023-11-30 04:46:50,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23140 conditions, 9559 events. 4808/9559 cut-off events. For 715/1891 co-relation queries the response was YES. Maximal size of possible extension queue 858. Compared 84448 event pairs, 3088 based on Foata normal form. 0/4945 useless extension candidates. Maximal degree in co-relation 23059. Up to 4954 conditions per place. [2023-11-30 04:46:50,606 INFO L140 encePairwiseOnDemand]: 176/179 looper letters, 66 selfloop transitions, 2 changer transitions 0/172 dead transitions. [2023-11-30 04:46:50,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 172 transitions, 631 flow [2023-11-30 04:46:50,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:46:50,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:46:50,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2023-11-30 04:46:50,609 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7113594040968343 [2023-11-30 04:46:50,609 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 382 transitions. [2023-11-30 04:46:50,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 382 transitions. [2023-11-30 04:46:50,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:46:50,609 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 382 transitions. [2023-11-30 04:46:50,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:50,613 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:50,614 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:50,614 INFO L307 CegarLoopForPetriNet]: 183 programPoint places, -25 predicate places. [2023-11-30 04:46:50,614 INFO L500 AbstractCegarLoop]: Abstraction has has 158 places, 172 transitions, 631 flow [2023-11-30 04:46:50,615 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:50,615 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:46:50,615 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:46:50,615 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 04:46:50,616 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-11-30 04:46:50,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:46:50,616 INFO L85 PathProgramCache]: Analyzing trace with hash -727907282, now seen corresponding path program 1 times [2023-11-30 04:46:50,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:46:50,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461623654] [2023-11-30 04:46:50,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:46:50,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:46:50,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:46:50,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:46:50,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:46:50,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461623654] [2023-11-30 04:46:50,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461623654] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:46:50,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:46:50,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 04:46:50,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616007086] [2023-11-30 04:46:50,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:46:50,745 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 04:46:50,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:46:50,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 04:46:50,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-30 04:46:50,747 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 179 [2023-11-30 04:46:50,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 172 transitions, 631 flow. Second operand has 6 states, 6 states have (on average 105.83333333333333) internal successors, (635), 6 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:50,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:46:50,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 179 [2023-11-30 04:46:50,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:46:51,809 INFO L124 PetriNetUnfolderBase]: 3097/7145 cut-off events. [2023-11-30 04:46:51,809 INFO L125 PetriNetUnfolderBase]: For 1399/2169 co-relation queries the response was YES. [2023-11-30 04:46:51,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20928 conditions, 7145 events. 3097/7145 cut-off events. For 1399/2169 co-relation queries the response was YES. Maximal size of possible extension queue 551. Compared 66538 event pairs, 866 based on Foata normal form. 0/4729 useless extension candidates. Maximal degree in co-relation 20836. Up to 3482 conditions per place. [2023-11-30 04:46:51,852 INFO L140 encePairwiseOnDemand]: 162/179 looper letters, 73 selfloop transitions, 15 changer transitions 0/187 dead transitions. [2023-11-30 04:46:51,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 187 transitions, 893 flow [2023-11-30 04:46:51,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-30 04:46:51,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-30 04:46:51,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 833 transitions. [2023-11-30 04:46:51,854 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.664804469273743 [2023-11-30 04:46:51,854 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 833 transitions. [2023-11-30 04:46:51,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 833 transitions. [2023-11-30 04:46:51,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:46:51,855 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 833 transitions. [2023-11-30 04:46:51,856 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:51,858 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 179.0) internal successors, (1432), 8 states have internal predecessors, (1432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:51,858 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 179.0) internal successors, (1432), 8 states have internal predecessors, (1432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:51,859 INFO L307 CegarLoopForPetriNet]: 183 programPoint places, -21 predicate places. [2023-11-30 04:46:51,859 INFO L500 AbstractCegarLoop]: Abstraction has has 162 places, 187 transitions, 893 flow [2023-11-30 04:46:51,859 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.83333333333333) internal successors, (635), 6 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:51,859 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:46:51,859 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:46:51,860 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 04:46:51,860 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-11-30 04:46:51,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:46:51,860 INFO L85 PathProgramCache]: Analyzing trace with hash -727907281, now seen corresponding path program 1 times [2023-11-30 04:46:51,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:46:51,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370891829] [2023-11-30 04:46:51,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:46:51,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:46:51,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:46:52,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:46:52,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:46:52,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370891829] [2023-11-30 04:46:52,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370891829] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:46:52,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:46:52,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 04:46:52,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799006652] [2023-11-30 04:46:52,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:46:52,022 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 04:46:52,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:46:52,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 04:46:52,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-30 04:46:52,026 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 179 [2023-11-30 04:46:52,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 187 transitions, 893 flow. Second operand has 6 states, 6 states have (on average 103.83333333333333) internal successors, (623), 6 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:52,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:46:52,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 179 [2023-11-30 04:46:52,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:46:52,352 INFO L124 PetriNetUnfolderBase]: 561/1709 cut-off events. [2023-11-30 04:46:52,352 INFO L125 PetriNetUnfolderBase]: For 631/1057 co-relation queries the response was YES. [2023-11-30 04:46:52,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5521 conditions, 1709 events. 561/1709 cut-off events. For 631/1057 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 12354 event pairs, 261 based on Foata normal form. 0/1449 useless extension candidates. Maximal degree in co-relation 5418. Up to 775 conditions per place. [2023-11-30 04:46:52,361 INFO L140 encePairwiseOnDemand]: 162/179 looper letters, 59 selfloop transitions, 7 changer transitions 0/163 dead transitions. [2023-11-30 04:46:52,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 163 transitions, 833 flow [2023-11-30 04:46:52,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 04:46:52,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 04:46:52,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 685 transitions. [2023-11-30 04:46:52,363 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6378026070763501 [2023-11-30 04:46:52,363 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 685 transitions. [2023-11-30 04:46:52,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 685 transitions. [2023-11-30 04:46:52,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:46:52,363 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 685 transitions. [2023-11-30 04:46:52,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 114.16666666666667) internal successors, (685), 6 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:52,366 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 179.0) internal successors, (1253), 7 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:52,367 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 179.0) internal successors, (1253), 7 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:52,367 INFO L307 CegarLoopForPetriNet]: 183 programPoint places, -23 predicate places. [2023-11-30 04:46:52,367 INFO L500 AbstractCegarLoop]: Abstraction has has 160 places, 163 transitions, 833 flow [2023-11-30 04:46:52,368 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 103.83333333333333) internal successors, (623), 6 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:52,368 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:46:52,368 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:46:52,368 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 04:46:52,368 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-11-30 04:46:52,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:46:52,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1323695021, now seen corresponding path program 1 times [2023-11-30 04:46:52,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:46:52,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622383936] [2023-11-30 04:46:52,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:46:52,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:46:52,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:46:52,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:46:52,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:46:52,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622383936] [2023-11-30 04:46:52,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622383936] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:46:52,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:46:52,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:46:52,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934541880] [2023-11-30 04:46:52,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:46:52,445 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:46:52,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:46:52,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:46:52,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:46:52,446 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 179 [2023-11-30 04:46:52,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 163 transitions, 833 flow. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:52,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:46:52,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 179 [2023-11-30 04:46:52,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:46:52,886 INFO L124 PetriNetUnfolderBase]: 711/2053 cut-off events. [2023-11-30 04:46:52,886 INFO L125 PetriNetUnfolderBase]: For 2707/3091 co-relation queries the response was YES. [2023-11-30 04:46:52,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7550 conditions, 2053 events. 711/2053 cut-off events. For 2707/3091 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 16004 event pairs, 91 based on Foata normal form. 2/1752 useless extension candidates. Maximal degree in co-relation 7439. Up to 926 conditions per place. [2023-11-30 04:46:52,898 INFO L140 encePairwiseOnDemand]: 176/179 looper letters, 69 selfloop transitions, 2 changer transitions 0/176 dead transitions. [2023-11-30 04:46:52,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 176 transitions, 1109 flow [2023-11-30 04:46:52,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:46:52,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:46:52,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2023-11-30 04:46:52,900 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6852886405959032 [2023-11-30 04:46:52,900 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 368 transitions. [2023-11-30 04:46:52,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 368 transitions. [2023-11-30 04:46:52,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:46:52,900 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 368 transitions. [2023-11-30 04:46:52,901 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:52,902 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:52,902 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:52,904 INFO L307 CegarLoopForPetriNet]: 183 programPoint places, -22 predicate places. [2023-11-30 04:46:52,904 INFO L500 AbstractCegarLoop]: Abstraction has has 161 places, 176 transitions, 1109 flow [2023-11-30 04:46:52,904 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:52,904 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:46:52,904 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:46:52,905 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 04:46:52,905 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-11-30 04:46:52,906 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:46:52,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1323695020, now seen corresponding path program 1 times [2023-11-30 04:46:52,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:46:52,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089424364] [2023-11-30 04:46:52,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:46:52,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:46:52,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:46:52,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:46:52,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:46:52,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089424364] [2023-11-30 04:46:52,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089424364] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:46:52,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:46:52,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:46:52,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959475831] [2023-11-30 04:46:52,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:46:52,963 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:46:52,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:46:52,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:46:52,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:46:52,964 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 179 [2023-11-30 04:46:52,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 176 transitions, 1109 flow. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:52,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:46:52,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 179 [2023-11-30 04:46:52,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:46:53,363 INFO L124 PetriNetUnfolderBase]: 710/1973 cut-off events. [2023-11-30 04:46:53,363 INFO L125 PetriNetUnfolderBase]: For 3502/4024 co-relation queries the response was YES. [2023-11-30 04:46:53,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8648 conditions, 1973 events. 710/1973 cut-off events. For 3502/4024 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 15141 event pairs, 91 based on Foata normal form. 2/1672 useless extension candidates. Maximal degree in co-relation 8528. Up to 999 conditions per place. [2023-11-30 04:46:53,377 INFO L140 encePairwiseOnDemand]: 176/179 looper letters, 72 selfloop transitions, 2 changer transitions 0/175 dead transitions. [2023-11-30 04:46:53,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 175 transitions, 1247 flow [2023-11-30 04:46:53,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:46:53,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:46:53,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2023-11-30 04:46:53,378 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6629422718808193 [2023-11-30 04:46:53,378 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 356 transitions. [2023-11-30 04:46:53,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 356 transitions. [2023-11-30 04:46:53,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:46:53,379 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 356 transitions. [2023-11-30 04:46:53,380 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:53,380 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:53,381 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:53,381 INFO L307 CegarLoopForPetriNet]: 183 programPoint places, -21 predicate places. [2023-11-30 04:46:53,381 INFO L500 AbstractCegarLoop]: Abstraction has has 162 places, 175 transitions, 1247 flow [2023-11-30 04:46:53,381 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:53,381 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:46:53,382 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:46:53,382 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 04:46:53,382 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-11-30 04:46:53,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:46:53,382 INFO L85 PathProgramCache]: Analyzing trace with hash 24924151, now seen corresponding path program 1 times [2023-11-30 04:46:53,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:46:53,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3296471] [2023-11-30 04:46:53,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:46:53,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:46:53,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:46:53,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:46:53,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:46:53,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3296471] [2023-11-30 04:46:53,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3296471] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:46:53,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:46:53,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:46:53,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166212644] [2023-11-30 04:46:53,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:46:53,422 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:46:53,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:46:53,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:46:53,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:46:53,423 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 179 [2023-11-30 04:46:53,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 175 transitions, 1247 flow. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:53,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:46:53,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 179 [2023-11-30 04:46:53,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:46:53,884 INFO L124 PetriNetUnfolderBase]: 857/2282 cut-off events. [2023-11-30 04:46:53,884 INFO L125 PetriNetUnfolderBase]: For 6989/7307 co-relation queries the response was YES. [2023-11-30 04:46:53,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11161 conditions, 2282 events. 857/2282 cut-off events. For 6989/7307 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 17789 event pairs, 91 based on Foata normal form. 4/1922 useless extension candidates. Maximal degree in co-relation 11032. Up to 1162 conditions per place. [2023-11-30 04:46:53,901 INFO L140 encePairwiseOnDemand]: 176/179 looper letters, 74 selfloop transitions, 2 changer transitions 0/176 dead transitions. [2023-11-30 04:46:53,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 176 transitions, 1417 flow [2023-11-30 04:46:53,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:46:53,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:46:53,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2023-11-30 04:46:53,903 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6629422718808193 [2023-11-30 04:46:53,903 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 356 transitions. [2023-11-30 04:46:53,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 356 transitions. [2023-11-30 04:46:53,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:46:53,903 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 356 transitions. [2023-11-30 04:46:53,904 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:53,905 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:53,905 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:53,905 INFO L307 CegarLoopForPetriNet]: 183 programPoint places, -20 predicate places. [2023-11-30 04:46:53,906 INFO L500 AbstractCegarLoop]: Abstraction has has 163 places, 176 transitions, 1417 flow [2023-11-30 04:46:53,906 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:53,906 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:46:53,906 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:46:53,906 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 04:46:53,906 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-11-30 04:46:53,906 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:46:53,906 INFO L85 PathProgramCache]: Analyzing trace with hash 24924152, now seen corresponding path program 1 times [2023-11-30 04:46:53,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:46:53,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657682734] [2023-11-30 04:46:53,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:46:53,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:46:53,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:46:53,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:46:53,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:46:53,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657682734] [2023-11-30 04:46:53,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657682734] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:46:53,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:46:53,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:46:53,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944562983] [2023-11-30 04:46:53,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:46:53,964 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:46:53,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:46:53,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:46:53,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:46:53,964 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 179 [2023-11-30 04:46:53,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 176 transitions, 1417 flow. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:53,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:46:53,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 179 [2023-11-30 04:46:53,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:46:54,396 INFO L124 PetriNetUnfolderBase]: 853/2184 cut-off events. [2023-11-30 04:46:54,396 INFO L125 PetriNetUnfolderBase]: For 8882/9064 co-relation queries the response was YES. [2023-11-30 04:46:54,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12313 conditions, 2184 events. 853/2184 cut-off events. For 8882/9064 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 16618 event pairs, 53 based on Foata normal form. 4/1824 useless extension candidates. Maximal degree in co-relation 12176. Up to 1162 conditions per place. [2023-11-30 04:46:54,411 INFO L140 encePairwiseOnDemand]: 176/179 looper letters, 82 selfloop transitions, 2 changer transitions 0/188 dead transitions. [2023-11-30 04:46:54,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 188 transitions, 1783 flow [2023-11-30 04:46:54,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:46:54,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:46:54,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2023-11-30 04:46:54,412 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6815642458100558 [2023-11-30 04:46:54,413 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 366 transitions. [2023-11-30 04:46:54,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 366 transitions. [2023-11-30 04:46:54,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:46:54,413 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 366 transitions. [2023-11-30 04:46:54,414 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:54,414 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:54,414 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:54,415 INFO L307 CegarLoopForPetriNet]: 183 programPoint places, -19 predicate places. [2023-11-30 04:46:54,415 INFO L500 AbstractCegarLoop]: Abstraction has has 164 places, 188 transitions, 1783 flow [2023-11-30 04:46:54,415 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:54,415 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:46:54,415 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:46:54,415 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 04:46:54,415 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-11-30 04:46:54,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:46:54,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1364112072, now seen corresponding path program 1 times [2023-11-30 04:46:54,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:46:54,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293676131] [2023-11-30 04:46:54,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:46:54,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:46:54,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:46:54,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:46:54,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:46:54,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293676131] [2023-11-30 04:46:54,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293676131] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:46:54,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:46:54,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:46:54,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43811228] [2023-11-30 04:46:54,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:46:54,490 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:46:54,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:46:54,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:46:54,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:46:54,491 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 179 [2023-11-30 04:46:54,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 188 transitions, 1783 flow. Second operand has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:54,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:46:54,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 179 [2023-11-30 04:46:54,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:46:54,831 INFO L124 PetriNetUnfolderBase]: 827/2152 cut-off events. [2023-11-30 04:46:54,832 INFO L125 PetriNetUnfolderBase]: For 10712/10918 co-relation queries the response was YES. [2023-11-30 04:46:54,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12940 conditions, 2152 events. 827/2152 cut-off events. For 10712/10918 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 16620 event pairs, 45 based on Foata normal form. 0/1800 useless extension candidates. Maximal degree in co-relation 12800. Up to 1162 conditions per place. [2023-11-30 04:46:54,847 INFO L140 encePairwiseOnDemand]: 175/179 looper letters, 106 selfloop transitions, 14 changer transitions 0/238 dead transitions. [2023-11-30 04:46:54,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 238 transitions, 2929 flow [2023-11-30 04:46:54,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:46:54,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:46:54,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 405 transitions. [2023-11-30 04:46:54,848 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7541899441340782 [2023-11-30 04:46:54,848 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 405 transitions. [2023-11-30 04:46:54,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 405 transitions. [2023-11-30 04:46:54,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:46:54,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 405 transitions. [2023-11-30 04:46:54,849 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:54,850 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:54,850 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:54,850 INFO L307 CegarLoopForPetriNet]: 183 programPoint places, -17 predicate places. [2023-11-30 04:46:54,850 INFO L500 AbstractCegarLoop]: Abstraction has has 166 places, 238 transitions, 2929 flow [2023-11-30 04:46:54,851 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:54,851 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:46:54,851 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:46:54,851 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 04:46:54,851 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-11-30 04:46:54,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:46:54,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1025742231, now seen corresponding path program 1 times [2023-11-30 04:46:54,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:46:54,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206624391] [2023-11-30 04:46:54,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:46:54,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:46:54,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:46:54,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:46:54,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:46:54,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206624391] [2023-11-30 04:46:54,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206624391] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:46:54,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:46:54,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-30 04:46:54,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340433184] [2023-11-30 04:46:54,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:46:54,923 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-30 04:46:54,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:46:54,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-30 04:46:54,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-30 04:46:54,925 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 179 [2023-11-30 04:46:54,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 238 transitions, 2929 flow. Second operand has 5 states, 5 states have (on average 110.8) internal successors, (554), 5 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:54,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:46:54,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 179 [2023-11-30 04:46:54,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:46:55,397 INFO L124 PetriNetUnfolderBase]: 820/2139 cut-off events. [2023-11-30 04:46:55,397 INFO L125 PetriNetUnfolderBase]: For 13265/13497 co-relation queries the response was YES. [2023-11-30 04:46:55,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13907 conditions, 2139 events. 820/2139 cut-off events. For 13265/13497 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 16455 event pairs, 41 based on Foata normal form. 0/1794 useless extension candidates. Maximal degree in co-relation 13756. Up to 1162 conditions per place. [2023-11-30 04:46:55,415 INFO L140 encePairwiseOnDemand]: 171/179 looper letters, 114 selfloop transitions, 31 changer transitions 0/246 dead transitions. [2023-11-30 04:46:55,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 246 transitions, 3341 flow [2023-11-30 04:46:55,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 04:46:55,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 04:46:55,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 483 transitions. [2023-11-30 04:46:55,417 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6745810055865922 [2023-11-30 04:46:55,417 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 483 transitions. [2023-11-30 04:46:55,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 483 transitions. [2023-11-30 04:46:55,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:46:55,417 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 483 transitions. [2023-11-30 04:46:55,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.75) internal successors, (483), 4 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:55,419 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 179.0) internal successors, (895), 5 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:55,419 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 179.0) internal successors, (895), 5 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:55,419 INFO L307 CegarLoopForPetriNet]: 183 programPoint places, -15 predicate places. [2023-11-30 04:46:55,420 INFO L500 AbstractCegarLoop]: Abstraction has has 168 places, 246 transitions, 3341 flow [2023-11-30 04:46:55,420 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.8) internal successors, (554), 5 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:55,420 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:46:55,420 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:46:55,420 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-30 04:46:55,420 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-11-30 04:46:55,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:46:55,421 INFO L85 PathProgramCache]: Analyzing trace with hash -620152168, now seen corresponding path program 1 times [2023-11-30 04:46:55,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:46:55,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810639529] [2023-11-30 04:46:55,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:46:55,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:46:55,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:46:55,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:46:55,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:46:55,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810639529] [2023-11-30 04:46:55,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810639529] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:46:55,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:46:55,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 04:46:55,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675694038] [2023-11-30 04:46:55,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:46:55,584 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 04:46:55,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:46:55,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 04:46:55,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-30 04:46:55,585 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 179 [2023-11-30 04:46:55,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 246 transitions, 3341 flow. Second operand has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:55,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:46:55,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 179 [2023-11-30 04:46:55,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:46:56,078 INFO L124 PetriNetUnfolderBase]: 813/2126 cut-off events. [2023-11-30 04:46:56,078 INFO L125 PetriNetUnfolderBase]: For 15944/16202 co-relation queries the response was YES. [2023-11-30 04:46:56,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14720 conditions, 2126 events. 813/2126 cut-off events. For 15944/16202 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 16291 event pairs, 37 based on Foata normal form. 2/1789 useless extension candidates. Maximal degree in co-relation 14559. Up to 1162 conditions per place. [2023-11-30 04:46:56,097 INFO L140 encePairwiseOnDemand]: 176/179 looper letters, 119 selfloop transitions, 14 changer transitions 0/245 dead transitions. [2023-11-30 04:46:56,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 245 transitions, 3585 flow [2023-11-30 04:46:56,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 04:46:56,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 04:46:56,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 486 transitions. [2023-11-30 04:46:56,099 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6787709497206704 [2023-11-30 04:46:56,099 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 486 transitions. [2023-11-30 04:46:56,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 486 transitions. [2023-11-30 04:46:56,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:46:56,099 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 486 transitions. [2023-11-30 04:46:56,100 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:56,101 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 179.0) internal successors, (895), 5 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:56,101 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 179.0) internal successors, (895), 5 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:56,101 INFO L307 CegarLoopForPetriNet]: 183 programPoint places, -13 predicate places. [2023-11-30 04:46:56,101 INFO L500 AbstractCegarLoop]: Abstraction has has 170 places, 245 transitions, 3585 flow [2023-11-30 04:46:56,102 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:56,102 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:46:56,102 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:46:56,102 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-30 04:46:56,102 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-11-30 04:46:56,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:46:56,102 INFO L85 PathProgramCache]: Analyzing trace with hash -811460927, now seen corresponding path program 1 times [2023-11-30 04:46:56,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:46:56,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267938557] [2023-11-30 04:46:56,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:46:56,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:46:56,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:46:56,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:46:56,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:46:56,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267938557] [2023-11-30 04:46:56,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267938557] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:46:56,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:46:56,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-30 04:46:56,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669401262] [2023-11-30 04:46:56,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:46:56,302 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-30 04:46:56,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:46:56,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-30 04:46:56,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-11-30 04:46:56,303 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 179 [2023-11-30 04:46:56,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 245 transitions, 3585 flow. Second operand has 9 states, 9 states have (on average 104.44444444444444) internal successors, (940), 9 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:56,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:46:56,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 179 [2023-11-30 04:46:56,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:46:56,753 INFO L124 PetriNetUnfolderBase]: 585/1665 cut-off events. [2023-11-30 04:46:56,753 INFO L125 PetriNetUnfolderBase]: For 14545/14827 co-relation queries the response was YES. [2023-11-30 04:46:56,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12055 conditions, 1665 events. 585/1665 cut-off events. For 14545/14827 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 11995 event pairs, 37 based on Foata normal form. 0/1452 useless extension candidates. Maximal degree in co-relation 11883. Up to 865 conditions per place. [2023-11-30 04:46:56,764 INFO L140 encePairwiseOnDemand]: 163/179 looper letters, 128 selfloop transitions, 26 changer transitions 0/250 dead transitions. [2023-11-30 04:46:56,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 250 transitions, 4013 flow [2023-11-30 04:46:56,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-30 04:46:56,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-30 04:46:56,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 877 transitions. [2023-11-30 04:46:56,766 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6124301675977654 [2023-11-30 04:46:56,766 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 877 transitions. [2023-11-30 04:46:56,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 877 transitions. [2023-11-30 04:46:56,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:46:56,767 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 877 transitions. [2023-11-30 04:46:56,768 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 109.625) internal successors, (877), 8 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:56,770 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 179.0) internal successors, (1611), 9 states have internal predecessors, (1611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:56,770 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 179.0) internal successors, (1611), 9 states have internal predecessors, (1611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:56,771 INFO L307 CegarLoopForPetriNet]: 183 programPoint places, -6 predicate places. [2023-11-30 04:46:56,771 INFO L500 AbstractCegarLoop]: Abstraction has has 177 places, 250 transitions, 4013 flow [2023-11-30 04:46:56,771 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 104.44444444444444) internal successors, (940), 9 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:56,771 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:46:56,771 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:46:56,771 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-30 04:46:56,771 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-11-30 04:46:56,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:46:56,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1867004435, now seen corresponding path program 1 times [2023-11-30 04:46:56,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:46:56,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879118405] [2023-11-30 04:46:56,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:46:56,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:46:56,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:46:57,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:46:57,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:46:57,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879118405] [2023-11-30 04:46:57,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879118405] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:46:57,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:46:57,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-30 04:46:57,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165048262] [2023-11-30 04:46:57,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:46:57,302 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-30 04:46:57,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:46:57,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-30 04:46:57,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2023-11-30 04:46:57,304 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 179 [2023-11-30 04:46:57,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 250 transitions, 4013 flow. Second operand has 14 states, 14 states have (on average 99.85714285714286) internal successors, (1398), 14 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:57,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:46:57,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 179 [2023-11-30 04:46:57,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:46:57,757 INFO L124 PetriNetUnfolderBase]: 449/1496 cut-off events. [2023-11-30 04:46:57,757 INFO L125 PetriNetUnfolderBase]: For 12797/13715 co-relation queries the response was YES. [2023-11-30 04:46:57,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10528 conditions, 1496 events. 449/1496 cut-off events. For 12797/13715 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 10319 event pairs, 19 based on Foata normal form. 10/1427 useless extension candidates. Maximal degree in co-relation 10343. Up to 601 conditions per place. [2023-11-30 04:46:57,766 INFO L140 encePairwiseOnDemand]: 157/179 looper letters, 53 selfloop transitions, 30 changer transitions 122/298 dead transitions. [2023-11-30 04:46:57,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 298 transitions, 5444 flow [2023-11-30 04:46:57,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-30 04:46:57,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-11-30 04:46:57,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1584 transitions. [2023-11-30 04:46:57,770 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5899441340782123 [2023-11-30 04:46:57,770 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1584 transitions. [2023-11-30 04:46:57,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1584 transitions. [2023-11-30 04:46:57,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:46:57,770 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1584 transitions. [2023-11-30 04:46:57,773 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 105.6) internal successors, (1584), 15 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:57,775 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 179.0) internal successors, (2864), 16 states have internal predecessors, (2864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:57,776 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 179.0) internal successors, (2864), 16 states have internal predecessors, (2864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:57,776 INFO L307 CegarLoopForPetriNet]: 183 programPoint places, 7 predicate places. [2023-11-30 04:46:57,776 INFO L500 AbstractCegarLoop]: Abstraction has has 190 places, 298 transitions, 5444 flow [2023-11-30 04:46:57,777 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 99.85714285714286) internal successors, (1398), 14 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:57,777 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:46:57,777 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:46:57,777 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-30 04:46:57,777 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-11-30 04:46:57,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:46:57,777 INFO L85 PathProgramCache]: Analyzing trace with hash -923438846, now seen corresponding path program 1 times [2023-11-30 04:46:57,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:46:57,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001682149] [2023-11-30 04:46:57,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:46:57,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:46:57,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:46:58,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:46:58,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:46:58,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001682149] [2023-11-30 04:46:58,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001682149] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:46:58,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:46:58,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-30 04:46:58,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731477037] [2023-11-30 04:46:58,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:46:58,057 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-30 04:46:58,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:46:58,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-30 04:46:58,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-11-30 04:46:58,058 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 179 [2023-11-30 04:46:58,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 298 transitions, 5444 flow. Second operand has 12 states, 12 states have (on average 102.08333333333333) internal successors, (1225), 12 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:58,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:46:58,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 179 [2023-11-30 04:46:58,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:46:58,412 INFO L124 PetriNetUnfolderBase]: 403/1314 cut-off events. [2023-11-30 04:46:58,412 INFO L125 PetriNetUnfolderBase]: For 12927/13455 co-relation queries the response was YES. [2023-11-30 04:46:58,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10023 conditions, 1314 events. 403/1314 cut-off events. For 12927/13455 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 8586 event pairs, 24 based on Foata normal form. 0/1278 useless extension candidates. Maximal degree in co-relation 9827. Up to 504 conditions per place. [2023-11-30 04:46:58,418 INFO L140 encePairwiseOnDemand]: 167/179 looper letters, 0 selfloop transitions, 0 changer transitions 290/290 dead transitions. [2023-11-30 04:46:58,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 290 transitions, 5610 flow [2023-11-30 04:46:58,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-30 04:46:58,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-30 04:46:58,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 952 transitions. [2023-11-30 04:46:58,421 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.590937306021105 [2023-11-30 04:46:58,421 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 952 transitions. [2023-11-30 04:46:58,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 952 transitions. [2023-11-30 04:46:58,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:46:58,421 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 952 transitions. [2023-11-30 04:46:58,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 105.77777777777777) internal successors, (952), 9 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:58,424 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 179.0) internal successors, (1790), 10 states have internal predecessors, (1790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:58,424 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 179.0) internal successors, (1790), 10 states have internal predecessors, (1790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:58,424 INFO L307 CegarLoopForPetriNet]: 183 programPoint places, 11 predicate places. [2023-11-30 04:46:58,425 INFO L500 AbstractCegarLoop]: Abstraction has has 194 places, 290 transitions, 5610 flow [2023-11-30 04:46:58,425 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 102.08333333333333) internal successors, (1225), 12 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:46:58,435 INFO L143 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/rfi006_power.oepc.i_BEv2_AllErrorsAtOnce [2023-11-30 04:46:58,479 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 83 remaining) [2023-11-30 04:46:58,489 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 83 remaining) [2023-11-30 04:46:58,489 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 83 remaining) [2023-11-30 04:46:58,490 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 83 remaining) [2023-11-30 04:46:58,490 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 83 remaining) [2023-11-30 04:46:58,490 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 83 remaining) [2023-11-30 04:46:58,490 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 83 remaining) [2023-11-30 04:46:58,490 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 83 remaining) [2023-11-30 04:46:58,490 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 83 remaining) [2023-11-30 04:46:58,490 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 83 remaining) [2023-11-30 04:46:58,490 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 83 remaining) [2023-11-30 04:46:58,490 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 83 remaining) [2023-11-30 04:46:58,490 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 83 remaining) [2023-11-30 04:46:58,490 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 83 remaining) [2023-11-30 04:46:58,490 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 83 remaining) [2023-11-30 04:46:58,490 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 83 remaining) [2023-11-30 04:46:58,490 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 83 remaining) [2023-11-30 04:46:58,490 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 83 remaining) [2023-11-30 04:46:58,490 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 83 remaining) [2023-11-30 04:46:58,490 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 83 remaining) [2023-11-30 04:46:58,490 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 83 remaining) [2023-11-30 04:46:58,491 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 83 remaining) [2023-11-30 04:46:58,491 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 83 remaining) [2023-11-30 04:46:58,491 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 83 remaining) [2023-11-30 04:46:58,491 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 83 remaining) [2023-11-30 04:46:58,491 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 83 remaining) [2023-11-30 04:46:58,491 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 83 remaining) [2023-11-30 04:46:58,491 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 83 remaining) [2023-11-30 04:46:58,491 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 83 remaining) [2023-11-30 04:46:58,491 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 83 remaining) [2023-11-30 04:46:58,491 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 83 remaining) [2023-11-30 04:46:58,491 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 83 remaining) [2023-11-30 04:46:58,491 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 83 remaining) [2023-11-30 04:46:58,491 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 83 remaining) [2023-11-30 04:46:58,491 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 83 remaining) [2023-11-30 04:46:58,491 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 83 remaining) [2023-11-30 04:46:58,491 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 83 remaining) [2023-11-30 04:46:58,491 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 83 remaining) [2023-11-30 04:46:58,491 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 83 remaining) [2023-11-30 04:46:58,492 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 83 remaining) [2023-11-30 04:46:58,492 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 83 remaining) [2023-11-30 04:46:58,492 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 83 remaining) [2023-11-30 04:46:58,492 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 83 remaining) [2023-11-30 04:46:58,492 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 83 remaining) [2023-11-30 04:46:58,492 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 83 remaining) [2023-11-30 04:46:58,492 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 83 remaining) [2023-11-30 04:46:58,492 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 83 remaining) [2023-11-30 04:46:58,492 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 83 remaining) [2023-11-30 04:46:58,492 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 83 remaining) [2023-11-30 04:46:58,492 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 83 remaining) [2023-11-30 04:46:58,492 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 83 remaining) [2023-11-30 04:46:58,492 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 83 remaining) [2023-11-30 04:46:58,492 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 83 remaining) [2023-11-30 04:46:58,492 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 83 remaining) [2023-11-30 04:46:58,492 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 83 remaining) [2023-11-30 04:46:58,492 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 83 remaining) [2023-11-30 04:46:58,492 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 83 remaining) [2023-11-30 04:46:58,492 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 83 remaining) [2023-11-30 04:46:58,492 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 83 remaining) [2023-11-30 04:46:58,493 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 83 remaining) [2023-11-30 04:46:58,493 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 83 remaining) [2023-11-30 04:46:58,493 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 83 remaining) [2023-11-30 04:46:58,493 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 83 remaining) [2023-11-30 04:46:58,493 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 83 remaining) [2023-11-30 04:46:58,493 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 83 remaining) [2023-11-30 04:46:58,493 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 83 remaining) [2023-11-30 04:46:58,493 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 83 remaining) [2023-11-30 04:46:58,493 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 83 remaining) [2023-11-30 04:46:58,493 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 83 remaining) [2023-11-30 04:46:58,493 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 83 remaining) [2023-11-30 04:46:58,493 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 83 remaining) [2023-11-30 04:46:58,493 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 83 remaining) [2023-11-30 04:46:58,493 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 83 remaining) [2023-11-30 04:46:58,493 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 83 remaining) [2023-11-30 04:46:58,493 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 83 remaining) [2023-11-30 04:46:58,493 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 83 remaining) [2023-11-30 04:46:58,493 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 83 remaining) [2023-11-30 04:46:58,493 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 83 remaining) [2023-11-30 04:46:58,493 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 83 remaining) [2023-11-30 04:46:58,494 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 83 remaining) [2023-11-30 04:46:58,494 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 83 remaining) [2023-11-30 04:46:58,494 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 83 remaining) [2023-11-30 04:46:58,494 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 83 remaining) [2023-11-30 04:46:58,494 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-30 04:46:58,494 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:46:58,498 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 04:46:58,498 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 04:46:58,518 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 04:46:58 BasicIcfg [2023-11-30 04:46:58,518 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 04:46:58,518 INFO L158 Benchmark]: Toolchain (without parser) took 13222.07ms. Allocated memory was 652.2MB in the beginning and 3.1GB in the end (delta: 2.4GB). Free memory was 597.6MB in the beginning and 1.9GB in the end (delta: -1.3GB). Peak memory consumption was 1.1GB. Max. memory is 16.0GB. [2023-11-30 04:46:58,518 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 377.5MB. Free memory is still 325.1MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 04:46:58,519 INFO L158 Benchmark]: CACSL2BoogieTranslator took 459.30ms. Allocated memory is still 652.2MB. Free memory was 597.3MB in the beginning and 572.4MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-11-30 04:46:58,519 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.63ms. Allocated memory is still 652.2MB. Free memory was 572.4MB in the beginning and 570.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 04:46:58,519 INFO L158 Benchmark]: Boogie Preprocessor took 24.94ms. Allocated memory is still 652.2MB. Free memory was 570.0MB in the beginning and 567.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 04:46:58,519 INFO L158 Benchmark]: RCFGBuilder took 975.33ms. Allocated memory is still 652.2MB. Free memory was 567.6MB in the beginning and 609.7MB in the end (delta: -42.1MB). Peak memory consumption was 90.6MB. Max. memory is 16.0GB. [2023-11-30 04:46:58,519 INFO L158 Benchmark]: TraceAbstraction took 11694.59ms. Allocated memory was 652.2MB in the beginning and 3.1GB in the end (delta: 2.4GB). Free memory was 608.6MB in the beginning and 1.9GB in the end (delta: -1.3GB). Peak memory consumption was 1.1GB. Max. memory is 16.0GB. [2023-11-30 04:46:58,520 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 377.5MB. Free memory is still 325.1MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 459.30ms. Allocated memory is still 652.2MB. Free memory was 597.3MB in the beginning and 572.4MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 61.63ms. Allocated memory is still 652.2MB. Free memory was 572.4MB in the beginning and 570.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 24.94ms. Allocated memory is still 652.2MB. Free memory was 570.0MB in the beginning and 567.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 975.33ms. Allocated memory is still 652.2MB. Free memory was 567.6MB in the beginning and 609.7MB in the end (delta: -42.1MB). Peak memory consumption was 90.6MB. Max. memory is 16.0GB. * TraceAbstraction took 11694.59ms. Allocated memory was 652.2MB in the beginning and 3.1GB in the end (delta: 2.4GB). Free memory was 608.6MB in the beginning and 1.9GB in the end (delta: -1.3GB). Peak memory consumption was 1.1GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 238 locations, 83 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.5s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 679 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 679 mSDsluCounter, 214 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 68 mSDsCounter, 204 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1079 IncrementalHoareTripleChecker+Invalid, 1283 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 204 mSolverCounterUnsat, 146 mSDtfsCounter, 1079 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 80 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5610occurred in iteration=14, InterpolantAutomatonStates: 74, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1048 NumberOfCodeBlocks, 1048 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1034 ConstructedInterpolants, 0 QuantifiedInterpolants, 5107 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 46 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-30 04:46:58,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...