./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-lit/sssc12_variant.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-lit/sssc12_variant.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0ff08c0361e0fdb1af5d85b333c023f31932563eeba591605f3b3b9ddd16afc8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:39:57,668 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:39:57,721 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:39:57,725 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:39:57,725 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:39:57,742 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:39:57,743 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:39:57,743 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:39:57,743 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:39:57,743 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:39:57,744 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:39:57,744 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:39:57,744 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:39:57,745 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:39:57,745 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:39:57,745 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:39:57,745 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:39:57,745 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:39:57,746 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:39:57,746 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:39:57,746 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:39:57,746 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:39:57,746 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:39:57,746 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:39:57,746 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:39:57,746 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:39:57,746 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:39:57,746 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:39:57,746 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:39:57,746 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:39:57,746 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:39:57,747 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:39:57,747 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:39:57,747 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:39:57,747 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:39:57,747 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:39:57,747 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:39:57,747 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:39:57,747 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:39:57,747 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:39:57,747 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:39:57,747 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:39:57,747 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0ff08c0361e0fdb1af5d85b333c023f31932563eeba591605f3b3b9ddd16afc8 [2025-03-04 06:39:57,995 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:39:58,001 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:39:58,002 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:39:58,004 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:39:58,005 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:39:58,005 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-lit/sssc12_variant.i [2025-03-04 06:39:59,251 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3215ee8f5/e34f9868b58a4513ae6ef283e5103936/FLAGac481b052 [2025-03-04 06:39:59,548 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:39:59,548 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-lit/sssc12_variant.i [2025-03-04 06:39:59,561 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3215ee8f5/e34f9868b58a4513ae6ef283e5103936/FLAGac481b052 [2025-03-04 06:39:59,818 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3215ee8f5/e34f9868b58a4513ae6ef283e5103936 [2025-03-04 06:39:59,820 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:39:59,821 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:39:59,822 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:39:59,822 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:39:59,825 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:39:59,825 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:39:59" (1/1) ... [2025-03-04 06:39:59,826 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47b75864 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:39:59, skipping insertion in model container [2025-03-04 06:39:59,826 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:39:59" (1/1) ... [2025-03-04 06:39:59,855 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:40:00,198 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:40:00,209 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:40:00,240 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:40:00,288 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:40:00,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:40:00 WrapperNode [2025-03-04 06:40:00,289 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:40:00,289 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:40:00,290 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:40:00,290 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:40:00,294 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:40:00" (1/1) ... [2025-03-04 06:40:00,306 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:40:00" (1/1) ... [2025-03-04 06:40:00,324 INFO L138 Inliner]: procedures = 272, calls = 22, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 132 [2025-03-04 06:40:00,327 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:40:00,327 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:40:00,328 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:40:00,328 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:40:00,333 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:40:00" (1/1) ... [2025-03-04 06:40:00,333 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:40:00" (1/1) ... [2025-03-04 06:40:00,335 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:40:00" (1/1) ... [2025-03-04 06:40:00,336 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:40:00" (1/1) ... [2025-03-04 06:40:00,351 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:40:00" (1/1) ... [2025-03-04 06:40:00,352 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:40:00" (1/1) ... [2025-03-04 06:40:00,354 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:40:00" (1/1) ... [2025-03-04 06:40:00,354 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:40:00" (1/1) ... [2025-03-04 06:40:00,356 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:40:00,356 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:40:00,356 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:40:00,356 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:40:00,357 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:40:00" (1/1) ... [2025-03-04 06:40:00,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:40:00,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:40:00,384 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 06:40:00,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 06:40:00,404 INFO L130 BoogieDeclarations]: Found specification of procedure thr [2025-03-04 06:40:00,404 INFO L138 BoogieDeclarations]: Found implementation of procedure thr [2025-03-04 06:40:00,404 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 06:40:00,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 06:40:00,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:40:00,404 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 06:40:00,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 06:40:00,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:40:00,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:40:00,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:40:00,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:40:00,405 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:40:00,514 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:40:00,515 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:40:00,797 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:40:00,799 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:40:00,820 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:40:00,822 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:40:00,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:40:00 BoogieIcfgContainer [2025-03-04 06:40:00,823 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:40:00,824 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:40:00,824 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:40:00,829 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:40:00,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:39:59" (1/3) ... [2025-03-04 06:40:00,830 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e00a1e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:40:00, skipping insertion in model container [2025-03-04 06:40:00,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:40:00" (2/3) ... [2025-03-04 06:40:00,830 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e00a1e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:40:00, skipping insertion in model container [2025-03-04 06:40:00,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:40:00" (3/3) ... [2025-03-04 06:40:00,831 INFO L128 eAbstractionObserver]: Analyzing ICFG sssc12_variant.i [2025-03-04 06:40:00,841 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:40:00,842 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sssc12_variant.i that has 2 procedures, 157 locations, 1 initial locations, 2 loop locations, and 17 error locations. [2025-03-04 06:40:00,842 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:40:00,905 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 06:40:00,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 163 transitions, 330 flow [2025-03-04 06:40:00,981 INFO L124 PetriNetUnfolderBase]: 6/172 cut-off events. [2025-03-04 06:40:00,982 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:40:00,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176 conditions, 172 events. 6/172 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 150 event pairs, 0 based on Foata normal form. 0/147 useless extension candidates. Maximal degree in co-relation 95. Up to 2 conditions per place. [2025-03-04 06:40:00,987 INFO L82 GeneralOperation]: Start removeDead. Operand has 160 places, 163 transitions, 330 flow [2025-03-04 06:40:00,992 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 160 places, 163 transitions, 330 flow [2025-03-04 06:40:00,999 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:40:01,006 INFO L333 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, 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;@22e43939, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:40:01,006 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2025-03-04 06:40:01,015 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:40:01,015 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2025-03-04 06:40:01,016 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:40:01,016 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:01,016 INFO L206 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] [2025-03-04 06:40:01,017 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-04 06:40:01,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:01,021 INFO L85 PathProgramCache]: Analyzing trace with hash -663962515, now seen corresponding path program 1 times [2025-03-04 06:40:01,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:01,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538016738] [2025-03-04 06:40:01,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:01,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:01,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 06:40:01,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 06:40:01,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:01,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:01,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:40:01,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:01,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538016738] [2025-03-04 06:40:01,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538016738] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:01,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:01,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:40:01,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082487862] [2025-03-04 06:40:01,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:01,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:40:01,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:01,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:40:01,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:40:01,249 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 163 [2025-03-04 06:40:01,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 163 transitions, 330 flow. Second operand has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 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) [2025-03-04 06:40:01,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:01,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 163 [2025-03-04 06:40:01,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:01,324 INFO L124 PetriNetUnfolderBase]: 3/154 cut-off events. [2025-03-04 06:40:01,325 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:40:01,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171 conditions, 154 events. 3/154 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 104 event pairs, 0 based on Foata normal form. 11/144 useless extension candidates. Maximal degree in co-relation 91. Up to 11 conditions per place. [2025-03-04 06:40:01,326 INFO L140 encePairwiseOnDemand]: 156/163 looper letters, 10 selfloop transitions, 2 changer transitions 1/151 dead transitions. [2025-03-04 06:40:01,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 151 transitions, 330 flow [2025-03-04 06:40:01,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:40:01,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:40:01,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 449 transitions. [2025-03-04 06:40:01,342 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.918200408997955 [2025-03-04 06:40:01,343 INFO L175 Difference]: Start difference. First operand has 160 places, 163 transitions, 330 flow. Second operand 3 states and 449 transitions. [2025-03-04 06:40:01,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 151 transitions, 330 flow [2025-03-04 06:40:01,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 151 transitions, 330 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:40:01,352 INFO L231 Difference]: Finished difference. Result has 153 places, 150 transitions, 308 flow [2025-03-04 06:40:01,354 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=308, PETRI_PLACES=153, PETRI_TRANSITIONS=150} [2025-03-04 06:40:01,357 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, -7 predicate places. [2025-03-04 06:40:01,358 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 150 transitions, 308 flow [2025-03-04 06:40:01,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 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) [2025-03-04 06:40:01,358 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:01,359 INFO L206 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] [2025-03-04 06:40:01,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:40:01,359 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-04 06:40:01,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:01,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1351309583, now seen corresponding path program 1 times [2025-03-04 06:40:01,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:01,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522611476] [2025-03-04 06:40:01,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:01,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:01,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 06:40:01,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 06:40:01,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:01,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:01,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:40:01,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:01,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522611476] [2025-03-04 06:40:01,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522611476] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:01,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:01,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:40:01,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66896742] [2025-03-04 06:40:01,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:01,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:40:01,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:01,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:40:01,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:40:01,468 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 163 [2025-03-04 06:40:01,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 150 transitions, 308 flow. Second operand has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 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) [2025-03-04 06:40:01,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:01,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 163 [2025-03-04 06:40:01,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:01,499 INFO L124 PetriNetUnfolderBase]: 3/152 cut-off events. [2025-03-04 06:40:01,499 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:40:01,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 152 events. 3/152 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 101 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 139. Up to 11 conditions per place. [2025-03-04 06:40:01,500 INFO L140 encePairwiseOnDemand]: 160/163 looper letters, 10 selfloop transitions, 2 changer transitions 0/149 dead transitions. [2025-03-04 06:40:01,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 149 transitions, 330 flow [2025-03-04 06:40:01,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:40:01,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:40:01,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 445 transitions. [2025-03-04 06:40:01,503 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9100204498977505 [2025-03-04 06:40:01,503 INFO L175 Difference]: Start difference. First operand has 153 places, 150 transitions, 308 flow. Second operand 3 states and 445 transitions. [2025-03-04 06:40:01,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 149 transitions, 330 flow [2025-03-04 06:40:01,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 149 transitions, 326 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:40:01,508 INFO L231 Difference]: Finished difference. Result has 151 places, 149 transitions, 306 flow [2025-03-04 06:40:01,508 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=306, PETRI_PLACES=151, PETRI_TRANSITIONS=149} [2025-03-04 06:40:01,509 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, -9 predicate places. [2025-03-04 06:40:01,509 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 149 transitions, 306 flow [2025-03-04 06:40:01,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 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) [2025-03-04 06:40:01,509 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:01,510 INFO L206 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] [2025-03-04 06:40:01,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:40:01,511 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-04 06:40:01,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:01,512 INFO L85 PathProgramCache]: Analyzing trace with hash -93850500, now seen corresponding path program 1 times [2025-03-04 06:40:01,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:01,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182637150] [2025-03-04 06:40:01,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:01,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:01,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 06:40:01,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 06:40:01,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:01,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:01,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:40:01,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:01,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182637150] [2025-03-04 06:40:01,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182637150] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:01,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:01,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:40:01,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284318802] [2025-03-04 06:40:01,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:01,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:40:01,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:01,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:40:01,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:40:01,590 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 163 [2025-03-04 06:40:01,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 149 transitions, 306 flow. Second operand has 3 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 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) [2025-03-04 06:40:01,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:01,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 163 [2025-03-04 06:40:01,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:01,623 INFO L124 PetriNetUnfolderBase]: 3/148 cut-off events. [2025-03-04 06:40:01,623 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 06:40:01,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168 conditions, 148 events. 3/148 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 91 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 127. Up to 11 conditions per place. [2025-03-04 06:40:01,624 INFO L140 encePairwiseOnDemand]: 158/163 looper letters, 11 selfloop transitions, 1 changer transitions 0/145 dead transitions. [2025-03-04 06:40:01,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 145 transitions, 322 flow [2025-03-04 06:40:01,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:40:01,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:40:01,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 442 transitions. [2025-03-04 06:40:01,630 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9038854805725971 [2025-03-04 06:40:01,630 INFO L175 Difference]: Start difference. First operand has 151 places, 149 transitions, 306 flow. Second operand 3 states and 442 transitions. [2025-03-04 06:40:01,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 145 transitions, 322 flow [2025-03-04 06:40:01,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 145 transitions, 318 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:40:01,633 INFO L231 Difference]: Finished difference. Result has 147 places, 145 transitions, 296 flow [2025-03-04 06:40:01,633 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=296, PETRI_PLACES=147, PETRI_TRANSITIONS=145} [2025-03-04 06:40:01,634 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, -13 predicate places. [2025-03-04 06:40:01,634 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 145 transitions, 296 flow [2025-03-04 06:40:01,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 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) [2025-03-04 06:40:01,634 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:01,634 INFO L206 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] [2025-03-04 06:40:01,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:40:01,635 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-04 06:40:01,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:01,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1058076097, now seen corresponding path program 1 times [2025-03-04 06:40:01,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:01,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418833274] [2025-03-04 06:40:01,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:01,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:01,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 06:40:01,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 06:40:01,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:01,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:01,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:40:01,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:01,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418833274] [2025-03-04 06:40:01,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418833274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:01,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:01,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:40:01,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062355960] [2025-03-04 06:40:01,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:01,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:40:01,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:01,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:40:01,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:40:01,756 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 163 [2025-03-04 06:40:01,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 145 transitions, 296 flow. Second operand has 3 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 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) [2025-03-04 06:40:01,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:01,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 163 [2025-03-04 06:40:01,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:01,784 INFO L124 PetriNetUnfolderBase]: 3/147 cut-off events. [2025-03-04 06:40:01,784 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:40:01,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 147 events. 3/147 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 89 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 124. Up to 10 conditions per place. [2025-03-04 06:40:01,785 INFO L140 encePairwiseOnDemand]: 160/163 looper letters, 9 selfloop transitions, 2 changer transitions 0/144 dead transitions. [2025-03-04 06:40:01,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 144 transitions, 316 flow [2025-03-04 06:40:01,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:40:01,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:40:01,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 447 transitions. [2025-03-04 06:40:01,786 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9141104294478528 [2025-03-04 06:40:01,786 INFO L175 Difference]: Start difference. First operand has 147 places, 145 transitions, 296 flow. Second operand 3 states and 447 transitions. [2025-03-04 06:40:01,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 144 transitions, 316 flow [2025-03-04 06:40:01,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 144 transitions, 315 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:40:01,789 INFO L231 Difference]: Finished difference. Result has 147 places, 144 transitions, 297 flow [2025-03-04 06:40:01,789 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=297, PETRI_PLACES=147, PETRI_TRANSITIONS=144} [2025-03-04 06:40:01,791 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, -13 predicate places. [2025-03-04 06:40:01,791 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 144 transitions, 297 flow [2025-03-04 06:40:01,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 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) [2025-03-04 06:40:01,791 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:01,791 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:40:01,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:40:01,792 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-04 06:40:01,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:01,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1940693148, now seen corresponding path program 1 times [2025-03-04 06:40:01,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:01,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084093871] [2025-03-04 06:40:01,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:01,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:01,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-04 06:40:01,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 06:40:01,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:01,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:01,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:40:01,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:01,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084093871] [2025-03-04 06:40:01,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084093871] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:01,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:01,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:40:01,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188465560] [2025-03-04 06:40:01,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:01,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 06:40:01,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:01,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 06:40:01,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:40:01,959 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 163 [2025-03-04 06:40:01,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 144 transitions, 297 flow. Second operand has 5 states, 5 states have (on average 143.2) internal successors, (716), 5 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) [2025-03-04 06:40:01,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:01,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 163 [2025-03-04 06:40:01,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:02,024 INFO L124 PetriNetUnfolderBase]: 2/150 cut-off events. [2025-03-04 06:40:02,025 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:40:02,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177 conditions, 150 events. 2/150 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 91 event pairs, 0 based on Foata normal form. 1/137 useless extension candidates. Maximal degree in co-relation 136. Up to 15 conditions per place. [2025-03-04 06:40:02,025 INFO L140 encePairwiseOnDemand]: 159/163 looper letters, 14 selfloop transitions, 0 changer transitions 4/147 dead transitions. [2025-03-04 06:40:02,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 147 transitions, 339 flow [2025-03-04 06:40:02,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 06:40:02,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 06:40:02,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 724 transitions. [2025-03-04 06:40:02,029 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8883435582822086 [2025-03-04 06:40:02,029 INFO L175 Difference]: Start difference. First operand has 147 places, 144 transitions, 297 flow. Second operand 5 states and 724 transitions. [2025-03-04 06:40:02,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 147 transitions, 339 flow [2025-03-04 06:40:02,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 147 transitions, 335 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:40:02,034 INFO L231 Difference]: Finished difference. Result has 152 places, 143 transitions, 297 flow [2025-03-04 06:40:02,034 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=297, PETRI_PLACES=152, PETRI_TRANSITIONS=143} [2025-03-04 06:40:02,037 INFO L279 CegarLoopForPetriNet]: 160 programPoint places, -8 predicate places. [2025-03-04 06:40:02,037 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 143 transitions, 297 flow [2025-03-04 06:40:02,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 143.2) internal successors, (716), 5 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) [2025-03-04 06:40:02,038 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:02,038 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:40:02,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:40:02,039 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-04 06:40:02,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:02,042 INFO L85 PathProgramCache]: Analyzing trace with hash -696503252, now seen corresponding path program 1 times [2025-03-04 06:40:02,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:02,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582741009] [2025-03-04 06:40:02,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:02,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:02,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 06:40:02,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 06:40:02,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:02,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:40:02,060 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:40:02,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 06:40:02,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 06:40:02,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:02,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:40:02,093 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:40:02,093 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:40:02,094 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 29 remaining) [2025-03-04 06:40:02,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (27 of 29 remaining) [2025-03-04 06:40:02,096 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (26 of 29 remaining) [2025-03-04 06:40:02,096 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (25 of 29 remaining) [2025-03-04 06:40:02,096 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (24 of 29 remaining) [2025-03-04 06:40:02,096 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (23 of 29 remaining) [2025-03-04 06:40:02,096 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (22 of 29 remaining) [2025-03-04 06:40:02,097 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (21 of 29 remaining) [2025-03-04 06:40:02,097 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (20 of 29 remaining) [2025-03-04 06:40:02,097 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (19 of 29 remaining) [2025-03-04 06:40:02,097 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (18 of 29 remaining) [2025-03-04 06:40:02,097 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (17 of 29 remaining) [2025-03-04 06:40:02,097 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (16 of 29 remaining) [2025-03-04 06:40:02,097 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (15 of 29 remaining) [2025-03-04 06:40:02,097 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (14 of 29 remaining) [2025-03-04 06:40:02,097 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (13 of 29 remaining) [2025-03-04 06:40:02,097 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (12 of 29 remaining) [2025-03-04 06:40:02,098 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (11 of 29 remaining) [2025-03-04 06:40:02,098 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (10 of 29 remaining) [2025-03-04 06:40:02,098 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (9 of 29 remaining) [2025-03-04 06:40:02,098 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (8 of 29 remaining) [2025-03-04 06:40:02,098 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (7 of 29 remaining) [2025-03-04 06:40:02,098 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (6 of 29 remaining) [2025-03-04 06:40:02,098 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (5 of 29 remaining) [2025-03-04 06:40:02,098 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (4 of 29 remaining) [2025-03-04 06:40:02,098 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (3 of 29 remaining) [2025-03-04 06:40:02,098 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (2 of 29 remaining) [2025-03-04 06:40:02,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (1 of 29 remaining) [2025-03-04 06:40:02,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (0 of 29 remaining) [2025-03-04 06:40:02,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:40:02,099 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-04 06:40:02,102 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:40:02,102 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 06:40:02,141 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 06:40:02,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 243 places, 248 transitions, 506 flow [2025-03-04 06:40:02,174 INFO L124 PetriNetUnfolderBase]: 10/268 cut-off events. [2025-03-04 06:40:02,174 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 06:40:02,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 276 conditions, 268 events. 10/268 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 535 event pairs, 0 based on Foata normal form. 0/227 useless extension candidates. Maximal degree in co-relation 179. Up to 3 conditions per place. [2025-03-04 06:40:02,179 INFO L82 GeneralOperation]: Start removeDead. Operand has 243 places, 248 transitions, 506 flow [2025-03-04 06:40:02,182 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 243 places, 248 transitions, 506 flow [2025-03-04 06:40:02,184 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:40:02,184 INFO L333 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, 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;@22e43939, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:40:02,184 INFO L334 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2025-03-04 06:40:02,187 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:40:02,188 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2025-03-04 06:40:02,188 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:40:02,188 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:02,188 INFO L206 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] [2025-03-04 06:40:02,188 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2025-03-04 06:40:02,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:02,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1552856731, now seen corresponding path program 1 times [2025-03-04 06:40:02,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:02,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260139292] [2025-03-04 06:40:02,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:02,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:02,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 06:40:02,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 06:40:02,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:02,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:02,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:40:02,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:02,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260139292] [2025-03-04 06:40:02,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260139292] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:02,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:02,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:40:02,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178736020] [2025-03-04 06:40:02,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:02,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:40:02,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:02,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:40:02,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:40:02,261 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 248 [2025-03-04 06:40:02,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 248 transitions, 506 flow. Second operand has 3 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 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) [2025-03-04 06:40:02,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:02,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 248 [2025-03-04 06:40:02,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:02,370 INFO L124 PetriNetUnfolderBase]: 61/807 cut-off events. [2025-03-04 06:40:02,370 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-03-04 06:40:02,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 937 conditions, 807 events. 61/807 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4551 event pairs, 42 based on Foata normal form. 76/750 useless extension candidates. Maximal degree in co-relation 735. Up to 102 conditions per place. [2025-03-04 06:40:02,379 INFO L140 encePairwiseOnDemand]: 239/248 looper letters, 17 selfloop transitions, 2 changer transitions 1/232 dead transitions. [2025-03-04 06:40:02,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 232 transitions, 512 flow [2025-03-04 06:40:02,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:40:02,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:40:02,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 683 transitions. [2025-03-04 06:40:02,381 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.918010752688172 [2025-03-04 06:40:02,381 INFO L175 Difference]: Start difference. First operand has 243 places, 248 transitions, 506 flow. Second operand 3 states and 683 transitions. [2025-03-04 06:40:02,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 232 transitions, 512 flow [2025-03-04 06:40:02,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 232 transitions, 512 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:40:02,385 INFO L231 Difference]: Finished difference. Result has 234 places, 231 transitions, 476 flow [2025-03-04 06:40:02,386 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=476, PETRI_PLACES=234, PETRI_TRANSITIONS=231} [2025-03-04 06:40:02,388 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, -9 predicate places. [2025-03-04 06:40:02,388 INFO L471 AbstractCegarLoop]: Abstraction has has 234 places, 231 transitions, 476 flow [2025-03-04 06:40:02,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 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) [2025-03-04 06:40:02,388 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:02,389 INFO L206 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] [2025-03-04 06:40:02,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:40:02,389 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2025-03-04 06:40:02,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:02,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1811199729, now seen corresponding path program 1 times [2025-03-04 06:40:02,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:02,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245792859] [2025-03-04 06:40:02,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:02,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:02,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 06:40:02,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 06:40:02,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:02,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:02,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:40:02,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:02,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245792859] [2025-03-04 06:40:02,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245792859] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:02,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:02,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:40:02,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444665914] [2025-03-04 06:40:02,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:02,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:40:02,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:02,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:40:02,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:40:02,461 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 248 [2025-03-04 06:40:02,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 231 transitions, 476 flow. Second operand has 3 states, 3 states have (on average 223.33333333333334) internal successors, (670), 3 states have internal predecessors, (670), 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) [2025-03-04 06:40:02,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:02,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 248 [2025-03-04 06:40:02,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:02,531 INFO L124 PetriNetUnfolderBase]: 25/550 cut-off events. [2025-03-04 06:40:02,532 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-04 06:40:02,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 611 conditions, 550 events. 25/550 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2463 event pairs, 12 based on Foata normal form. 0/461 useless extension candidates. Maximal degree in co-relation 577. Up to 39 conditions per place. [2025-03-04 06:40:02,537 INFO L140 encePairwiseOnDemand]: 245/248 looper letters, 14 selfloop transitions, 2 changer transitions 0/230 dead transitions. [2025-03-04 06:40:02,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 230 transitions, 506 flow [2025-03-04 06:40:02,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:40:02,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:40:02,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 683 transitions. [2025-03-04 06:40:02,540 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.918010752688172 [2025-03-04 06:40:02,540 INFO L175 Difference]: Start difference. First operand has 234 places, 231 transitions, 476 flow. Second operand 3 states and 683 transitions. [2025-03-04 06:40:02,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 230 transitions, 506 flow [2025-03-04 06:40:02,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 230 transitions, 502 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:40:02,543 INFO L231 Difference]: Finished difference. Result has 232 places, 230 transitions, 474 flow [2025-03-04 06:40:02,543 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=474, PETRI_PLACES=232, PETRI_TRANSITIONS=230} [2025-03-04 06:40:02,544 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, -11 predicate places. [2025-03-04 06:40:02,544 INFO L471 AbstractCegarLoop]: Abstraction has has 232 places, 230 transitions, 474 flow [2025-03-04 06:40:02,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 223.33333333333334) internal successors, (670), 3 states have internal predecessors, (670), 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) [2025-03-04 06:40:02,545 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:02,545 INFO L206 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] [2025-03-04 06:40:02,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:40:02,545 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2025-03-04 06:40:02,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:02,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1662754180, now seen corresponding path program 1 times [2025-03-04 06:40:02,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:02,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190398807] [2025-03-04 06:40:02,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:02,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:02,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 06:40:02,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 06:40:02,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:02,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:02,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:40:02,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:02,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190398807] [2025-03-04 06:40:02,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190398807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:02,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:02,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:40:02,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863647688] [2025-03-04 06:40:02,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:02,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:40:02,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:02,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:40:02,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:40:02,591 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 248 [2025-03-04 06:40:02,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 230 transitions, 474 flow. Second operand has 3 states, 3 states have (on average 219.0) internal successors, (657), 3 states have internal predecessors, (657), 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) [2025-03-04 06:40:02,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:02,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 248 [2025-03-04 06:40:02,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:02,655 INFO L124 PetriNetUnfolderBase]: 39/747 cut-off events. [2025-03-04 06:40:02,655 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-03-04 06:40:02,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 828 conditions, 747 events. 39/747 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 4164 event pairs, 20 based on Foata normal form. 0/631 useless extension candidates. Maximal degree in co-relation 786. Up to 56 conditions per place. [2025-03-04 06:40:02,662 INFO L140 encePairwiseOnDemand]: 242/248 looper letters, 16 selfloop transitions, 1 changer transitions 0/225 dead transitions. [2025-03-04 06:40:02,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 225 transitions, 498 flow [2025-03-04 06:40:02,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:40:02,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:40:02,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 676 transitions. [2025-03-04 06:40:02,664 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9086021505376344 [2025-03-04 06:40:02,664 INFO L175 Difference]: Start difference. First operand has 232 places, 230 transitions, 474 flow. Second operand 3 states and 676 transitions. [2025-03-04 06:40:02,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 225 transitions, 498 flow [2025-03-04 06:40:02,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 225 transitions, 494 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:40:02,667 INFO L231 Difference]: Finished difference. Result has 227 places, 225 transitions, 462 flow [2025-03-04 06:40:02,668 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=462, PETRI_PLACES=227, PETRI_TRANSITIONS=225} [2025-03-04 06:40:02,668 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, -16 predicate places. [2025-03-04 06:40:02,668 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 225 transitions, 462 flow [2025-03-04 06:40:02,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 219.0) internal successors, (657), 3 states have internal predecessors, (657), 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) [2025-03-04 06:40:02,669 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:02,669 INFO L206 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] [2025-03-04 06:40:02,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:40:02,669 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2025-03-04 06:40:02,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:02,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1747540929, now seen corresponding path program 1 times [2025-03-04 06:40:02,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:02,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812709219] [2025-03-04 06:40:02,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:02,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:02,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 06:40:02,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 06:40:02,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:02,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:02,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:40:02,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:02,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812709219] [2025-03-04 06:40:02,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812709219] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:02,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:02,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:40:02,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882544242] [2025-03-04 06:40:02,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:02,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:40:02,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:02,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:40:02,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:40:02,751 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 248 [2025-03-04 06:40:02,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 225 transitions, 462 flow. Second operand has 3 states, 3 states have (on average 222.33333333333334) internal successors, (667), 3 states have internal predecessors, (667), 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) [2025-03-04 06:40:02,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:02,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 248 [2025-03-04 06:40:02,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:02,833 INFO L124 PetriNetUnfolderBase]: 47/706 cut-off events. [2025-03-04 06:40:02,833 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-04 06:40:02,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 809 conditions, 706 events. 47/706 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3548 event pairs, 30 based on Foata normal form. 0/598 useless extension candidates. Maximal degree in co-relation 767. Up to 76 conditions per place. [2025-03-04 06:40:02,839 INFO L140 encePairwiseOnDemand]: 245/248 looper letters, 15 selfloop transitions, 2 changer transitions 0/224 dead transitions. [2025-03-04 06:40:02,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 224 transitions, 494 flow [2025-03-04 06:40:02,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:40:02,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:40:02,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 681 transitions. [2025-03-04 06:40:02,841 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9153225806451613 [2025-03-04 06:40:02,841 INFO L175 Difference]: Start difference. First operand has 227 places, 225 transitions, 462 flow. Second operand 3 states and 681 transitions. [2025-03-04 06:40:02,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 224 transitions, 494 flow [2025-03-04 06:40:02,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 224 transitions, 493 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:40:02,845 INFO L231 Difference]: Finished difference. Result has 227 places, 224 transitions, 463 flow [2025-03-04 06:40:02,846 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=463, PETRI_PLACES=227, PETRI_TRANSITIONS=224} [2025-03-04 06:40:02,847 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, -16 predicate places. [2025-03-04 06:40:02,847 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 224 transitions, 463 flow [2025-03-04 06:40:02,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 222.33333333333334) internal successors, (667), 3 states have internal predecessors, (667), 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) [2025-03-04 06:40:02,847 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:02,848 INFO L206 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] [2025-03-04 06:40:02,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:40:02,848 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thrErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2025-03-04 06:40:02,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:02,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1319547073, now seen corresponding path program 1 times [2025-03-04 06:40:02,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:02,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547564804] [2025-03-04 06:40:02,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:02,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:02,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 06:40:02,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 06:40:02,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:02,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:02,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:40:02,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:02,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547564804] [2025-03-04 06:40:02,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547564804] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:02,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:02,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:40:02,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222904013] [2025-03-04 06:40:02,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:02,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:40:02,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:02,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:40:02,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:40:02,931 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 248 [2025-03-04 06:40:02,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 224 transitions, 463 flow. Second operand has 3 states, 3 states have (on average 214.66666666666666) internal successors, (644), 3 states have internal predecessors, (644), 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) [2025-03-04 06:40:02,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:02,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 248 [2025-03-04 06:40:02,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:03,120 INFO L124 PetriNetUnfolderBase]: 164/2093 cut-off events. [2025-03-04 06:40:03,121 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-03-04 06:40:03,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2423 conditions, 2093 events. 164/2093 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 17250 event pairs, 57 based on Foata normal form. 0/1789 useless extension candidates. Maximal degree in co-relation 2381. Up to 204 conditions per place. [2025-03-04 06:40:03,134 INFO L140 encePairwiseOnDemand]: 228/248 looper letters, 32 selfloop transitions, 14 changer transitions 0/243 dead transitions. [2025-03-04 06:40:03,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 243 transitions, 598 flow [2025-03-04 06:40:03,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:40:03,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:40:03,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 691 transitions. [2025-03-04 06:40:03,136 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.928763440860215 [2025-03-04 06:40:03,136 INFO L175 Difference]: Start difference. First operand has 227 places, 224 transitions, 463 flow. Second operand 3 states and 691 transitions. [2025-03-04 06:40:03,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 243 transitions, 598 flow [2025-03-04 06:40:03,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 243 transitions, 594 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:40:03,140 INFO L231 Difference]: Finished difference. Result has 229 places, 238 transitions, 583 flow [2025-03-04 06:40:03,141 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=583, PETRI_PLACES=229, PETRI_TRANSITIONS=238} [2025-03-04 06:40:03,142 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, -14 predicate places. [2025-03-04 06:40:03,142 INFO L471 AbstractCegarLoop]: Abstraction has has 229 places, 238 transitions, 583 flow [2025-03-04 06:40:03,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 214.66666666666666) internal successors, (644), 3 states have internal predecessors, (644), 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) [2025-03-04 06:40:03,142 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:03,143 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:40:03,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:40:03,143 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2025-03-04 06:40:03,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:03,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1531235030, now seen corresponding path program 1 times [2025-03-04 06:40:03,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:03,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921790542] [2025-03-04 06:40:03,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:03,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:03,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 06:40:03,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 06:40:03,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:03,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:03,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:40:03,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:03,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921790542] [2025-03-04 06:40:03,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921790542] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:03,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:03,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:40:03,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929864764] [2025-03-04 06:40:03,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:03,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 06:40:03,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:03,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 06:40:03,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:40:03,257 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 248 [2025-03-04 06:40:03,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 238 transitions, 583 flow. Second operand has 5 states, 5 states have (on average 222.4) internal successors, (1112), 5 states have internal predecessors, (1112), 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) [2025-03-04 06:40:03,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:03,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 248 [2025-03-04 06:40:03,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:03,497 INFO L124 PetriNetUnfolderBase]: 99/1990 cut-off events. [2025-03-04 06:40:03,497 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-03-04 06:40:03,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2263 conditions, 1990 events. 99/1990 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 16364 event pairs, 41 based on Foata normal form. 1/1702 useless extension candidates. Maximal degree in co-relation 2220. Up to 120 conditions per place. [2025-03-04 06:40:03,514 INFO L140 encePairwiseOnDemand]: 244/248 looper letters, 17 selfloop transitions, 0 changer transitions 4/241 dead transitions. [2025-03-04 06:40:03,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 241 transitions, 631 flow [2025-03-04 06:40:03,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 06:40:03,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 06:40:03,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1122 transitions. [2025-03-04 06:40:03,517 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9048387096774193 [2025-03-04 06:40:03,517 INFO L175 Difference]: Start difference. First operand has 229 places, 238 transitions, 583 flow. Second operand 5 states and 1122 transitions. [2025-03-04 06:40:03,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 241 transitions, 631 flow [2025-03-04 06:40:03,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 241 transitions, 603 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:40:03,522 INFO L231 Difference]: Finished difference. Result has 234 places, 237 transitions, 559 flow [2025-03-04 06:40:03,522 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=555, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=559, PETRI_PLACES=234, PETRI_TRANSITIONS=237} [2025-03-04 06:40:03,524 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, -9 predicate places. [2025-03-04 06:40:03,524 INFO L471 AbstractCegarLoop]: Abstraction has has 234 places, 237 transitions, 559 flow [2025-03-04 06:40:03,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 222.4) internal successors, (1112), 5 states have internal predecessors, (1112), 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) [2025-03-04 06:40:03,524 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:03,525 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:40:03,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:40:03,525 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2025-03-04 06:40:03,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:03,525 INFO L85 PathProgramCache]: Analyzing trace with hash -2079423310, now seen corresponding path program 1 times [2025-03-04 06:40:03,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:03,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180789332] [2025-03-04 06:40:03,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:03,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:03,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-04 06:40:03,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 06:40:03,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:03,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:40:03,539 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:40:03,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-04 06:40:03,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 06:40:03,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:03,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:40:03,559 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:40:03,559 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:40:03,559 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (39 of 40 remaining) [2025-03-04 06:40:03,560 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (38 of 40 remaining) [2025-03-04 06:40:03,560 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (37 of 40 remaining) [2025-03-04 06:40:03,560 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (36 of 40 remaining) [2025-03-04 06:40:03,560 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (35 of 40 remaining) [2025-03-04 06:40:03,560 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (34 of 40 remaining) [2025-03-04 06:40:03,560 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (33 of 40 remaining) [2025-03-04 06:40:03,560 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (32 of 40 remaining) [2025-03-04 06:40:03,560 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (31 of 40 remaining) [2025-03-04 06:40:03,560 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (30 of 40 remaining) [2025-03-04 06:40:03,560 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (29 of 40 remaining) [2025-03-04 06:40:03,560 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (28 of 40 remaining) [2025-03-04 06:40:03,560 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (27 of 40 remaining) [2025-03-04 06:40:03,561 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (26 of 40 remaining) [2025-03-04 06:40:03,561 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (25 of 40 remaining) [2025-03-04 06:40:03,561 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (24 of 40 remaining) [2025-03-04 06:40:03,561 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (23 of 40 remaining) [2025-03-04 06:40:03,561 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (22 of 40 remaining) [2025-03-04 06:40:03,561 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (21 of 40 remaining) [2025-03-04 06:40:03,561 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (20 of 40 remaining) [2025-03-04 06:40:03,561 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (19 of 40 remaining) [2025-03-04 06:40:03,561 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (18 of 40 remaining) [2025-03-04 06:40:03,561 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (17 of 40 remaining) [2025-03-04 06:40:03,561 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (16 of 40 remaining) [2025-03-04 06:40:03,561 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (15 of 40 remaining) [2025-03-04 06:40:03,561 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (14 of 40 remaining) [2025-03-04 06:40:03,562 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (13 of 40 remaining) [2025-03-04 06:40:03,562 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (12 of 40 remaining) [2025-03-04 06:40:03,562 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (11 of 40 remaining) [2025-03-04 06:40:03,562 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (10 of 40 remaining) [2025-03-04 06:40:03,562 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (9 of 40 remaining) [2025-03-04 06:40:03,562 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (8 of 40 remaining) [2025-03-04 06:40:03,562 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (7 of 40 remaining) [2025-03-04 06:40:03,562 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (6 of 40 remaining) [2025-03-04 06:40:03,562 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (5 of 40 remaining) [2025-03-04 06:40:03,562 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (4 of 40 remaining) [2025-03-04 06:40:03,562 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (3 of 40 remaining) [2025-03-04 06:40:03,562 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (2 of 40 remaining) [2025-03-04 06:40:03,562 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (1 of 40 remaining) [2025-03-04 06:40:03,563 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (0 of 40 remaining) [2025-03-04 06:40:03,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 06:40:03,563 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:40:03,563 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:40:03,563 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-04 06:40:03,612 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 06:40:03,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 326 places, 333 transitions, 684 flow [2025-03-04 06:40:03,686 INFO L124 PetriNetUnfolderBase]: 14/364 cut-off events. [2025-03-04 06:40:03,686 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-04 06:40:03,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 377 conditions, 364 events. 14/364 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1042 event pairs, 0 based on Foata normal form. 0/307 useless extension candidates. Maximal degree in co-relation 272. Up to 4 conditions per place. [2025-03-04 06:40:03,688 INFO L82 GeneralOperation]: Start removeDead. Operand has 326 places, 333 transitions, 684 flow [2025-03-04 06:40:03,691 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 326 places, 333 transitions, 684 flow [2025-03-04 06:40:03,692 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:40:03,692 INFO L333 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, 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;@22e43939, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:40:03,692 INFO L334 AbstractCegarLoop]: Starting to check reachability of 51 error locations. [2025-03-04 06:40:03,694 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:40:03,694 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2025-03-04 06:40:03,694 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:40:03,694 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:03,694 INFO L206 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] [2025-03-04 06:40:03,694 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-03-04 06:40:03,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:03,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1638033614, now seen corresponding path program 1 times [2025-03-04 06:40:03,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:03,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579593013] [2025-03-04 06:40:03,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:03,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:03,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 06:40:03,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 06:40:03,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:03,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:03,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:40:03,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:03,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579593013] [2025-03-04 06:40:03,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579593013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:03,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:03,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:40:03,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222857799] [2025-03-04 06:40:03,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:03,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:40:03,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:03,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:40:03,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:40:03,771 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 333 [2025-03-04 06:40:03,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 333 transitions, 684 flow. Second operand has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 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) [2025-03-04 06:40:03,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:03,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 333 [2025-03-04 06:40:03,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:04,334 INFO L124 PetriNetUnfolderBase]: 763/5681 cut-off events. [2025-03-04 06:40:04,334 INFO L125 PetriNetUnfolderBase]: For 319/319 co-relation queries the response was YES. [2025-03-04 06:40:04,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6939 conditions, 5681 events. 763/5681 cut-off events. For 319/319 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 60128 event pairs, 630 based on Foata normal form. 539/5289 useless extension candidates. Maximal degree in co-relation 5717. Up to 1033 conditions per place. [2025-03-04 06:40:04,381 INFO L140 encePairwiseOnDemand]: 322/333 looper letters, 24 selfloop transitions, 2 changer transitions 1/313 dead transitions. [2025-03-04 06:40:04,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 313 transitions, 696 flow [2025-03-04 06:40:04,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:40:04,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:40:04,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 917 transitions. [2025-03-04 06:40:04,383 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9179179179179179 [2025-03-04 06:40:04,383 INFO L175 Difference]: Start difference. First operand has 326 places, 333 transitions, 684 flow. Second operand 3 states and 917 transitions. [2025-03-04 06:40:04,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 313 transitions, 696 flow [2025-03-04 06:40:04,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 313 transitions, 694 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-04 06:40:04,387 INFO L231 Difference]: Finished difference. Result has 315 places, 312 transitions, 644 flow [2025-03-04 06:40:04,387 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=642, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=644, PETRI_PLACES=315, PETRI_TRANSITIONS=312} [2025-03-04 06:40:04,388 INFO L279 CegarLoopForPetriNet]: 326 programPoint places, -11 predicate places. [2025-03-04 06:40:04,388 INFO L471 AbstractCegarLoop]: Abstraction has has 315 places, 312 transitions, 644 flow [2025-03-04 06:40:04,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 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) [2025-03-04 06:40:04,388 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:04,389 INFO L206 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] [2025-03-04 06:40:04,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 06:40:04,389 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-03-04 06:40:04,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:04,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1139203313, now seen corresponding path program 1 times [2025-03-04 06:40:04,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:04,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026327633] [2025-03-04 06:40:04,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:04,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:04,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 06:40:04,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 06:40:04,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:04,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:04,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:40:04,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:04,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026327633] [2025-03-04 06:40:04,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026327633] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:04,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:04,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:40:04,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418009964] [2025-03-04 06:40:04,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:04,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:40:04,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:04,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:40:04,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:40:04,438 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 300 out of 333 [2025-03-04 06:40:04,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 312 transitions, 644 flow. Second operand has 3 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 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) [2025-03-04 06:40:04,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:04,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 300 of 333 [2025-03-04 06:40:04,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:04,653 INFO L124 PetriNetUnfolderBase]: 163/2232 cut-off events. [2025-03-04 06:40:04,653 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2025-03-04 06:40:04,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2502 conditions, 2232 events. 163/2232 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 18974 event pairs, 108 based on Foata normal form. 0/1849 useless extension candidates. Maximal degree in co-relation 2467. Up to 199 conditions per place. [2025-03-04 06:40:04,673 INFO L140 encePairwiseOnDemand]: 330/333 looper letters, 18 selfloop transitions, 2 changer transitions 0/311 dead transitions. [2025-03-04 06:40:04,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 311 transitions, 682 flow [2025-03-04 06:40:04,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:40:04,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:40:04,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 921 transitions. [2025-03-04 06:40:04,676 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9219219219219219 [2025-03-04 06:40:04,676 INFO L175 Difference]: Start difference. First operand has 315 places, 312 transitions, 644 flow. Second operand 3 states and 921 transitions. [2025-03-04 06:40:04,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 311 transitions, 682 flow [2025-03-04 06:40:04,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 311 transitions, 678 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:40:04,680 INFO L231 Difference]: Finished difference. Result has 313 places, 311 transitions, 642 flow [2025-03-04 06:40:04,681 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=638, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=642, PETRI_PLACES=313, PETRI_TRANSITIONS=311} [2025-03-04 06:40:04,682 INFO L279 CegarLoopForPetriNet]: 326 programPoint places, -13 predicate places. [2025-03-04 06:40:04,682 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 311 transitions, 642 flow [2025-03-04 06:40:04,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 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) [2025-03-04 06:40:04,683 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:04,683 INFO L206 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] [2025-03-04 06:40:04,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 06:40:04,683 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-03-04 06:40:04,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:04,683 INFO L85 PathProgramCache]: Analyzing trace with hash -149837892, now seen corresponding path program 1 times [2025-03-04 06:40:04,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:04,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955060488] [2025-03-04 06:40:04,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:04,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:04,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 06:40:04,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 06:40:04,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:04,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:04,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:40:04,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:04,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955060488] [2025-03-04 06:40:04,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955060488] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:04,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:04,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:40:04,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485140495] [2025-03-04 06:40:04,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:04,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:40:04,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:04,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:40:04,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:40:04,732 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 333 [2025-03-04 06:40:04,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 311 transitions, 642 flow. Second operand has 3 states, 3 states have (on average 295.0) internal successors, (885), 3 states have internal predecessors, (885), 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) [2025-03-04 06:40:04,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:04,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 333 [2025-03-04 06:40:04,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:05,082 INFO L124 PetriNetUnfolderBase]: 325/3996 cut-off events. [2025-03-04 06:40:05,083 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2025-03-04 06:40:05,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4478 conditions, 3996 events. 325/3996 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 40785 event pairs, 220 based on Foata normal form. 0/3339 useless extension candidates. Maximal degree in co-relation 4435. Up to 381 conditions per place. [2025-03-04 06:40:05,119 INFO L140 encePairwiseOnDemand]: 326/333 looper letters, 21 selfloop transitions, 1 changer transitions 0/305 dead transitions. [2025-03-04 06:40:05,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 305 transitions, 674 flow [2025-03-04 06:40:05,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:40:05,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:40:05,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 910 transitions. [2025-03-04 06:40:05,122 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9109109109109109 [2025-03-04 06:40:05,122 INFO L175 Difference]: Start difference. First operand has 313 places, 311 transitions, 642 flow. Second operand 3 states and 910 transitions. [2025-03-04 06:40:05,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 305 transitions, 674 flow [2025-03-04 06:40:05,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 305 transitions, 670 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:40:05,127 INFO L231 Difference]: Finished difference. Result has 307 places, 305 transitions, 628 flow [2025-03-04 06:40:05,127 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=626, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=628, PETRI_PLACES=307, PETRI_TRANSITIONS=305} [2025-03-04 06:40:05,128 INFO L279 CegarLoopForPetriNet]: 326 programPoint places, -19 predicate places. [2025-03-04 06:40:05,128 INFO L471 AbstractCegarLoop]: Abstraction has has 307 places, 305 transitions, 628 flow [2025-03-04 06:40:05,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 295.0) internal successors, (885), 3 states have internal predecessors, (885), 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) [2025-03-04 06:40:05,129 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:05,129 INFO L206 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] [2025-03-04 06:40:05,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 06:40:05,129 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-03-04 06:40:05,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:05,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1587016191, now seen corresponding path program 1 times [2025-03-04 06:40:05,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:05,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424972629] [2025-03-04 06:40:05,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:05,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:05,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 06:40:05,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 06:40:05,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:05,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:05,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:40:05,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:05,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424972629] [2025-03-04 06:40:05,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424972629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:05,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:05,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:40:05,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115631935] [2025-03-04 06:40:05,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:05,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:40:05,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:05,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:40:05,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:40:05,212 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 297 out of 333 [2025-03-04 06:40:05,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 305 transitions, 628 flow. Second operand has 3 states, 3 states have (on average 298.3333333333333) internal successors, (895), 3 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) [2025-03-04 06:40:05,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:05,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 297 of 333 [2025-03-04 06:40:05,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:05,721 INFO L124 PetriNetUnfolderBase]: 493/4259 cut-off events. [2025-03-04 06:40:05,721 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2025-03-04 06:40:05,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5047 conditions, 4259 events. 493/4259 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 40906 event pairs, 390 based on Foata normal form. 0/3568 useless extension candidates. Maximal degree in co-relation 5004. Up to 652 conditions per place. [2025-03-04 06:40:05,770 INFO L140 encePairwiseOnDemand]: 330/333 looper letters, 21 selfloop transitions, 2 changer transitions 0/304 dead transitions. [2025-03-04 06:40:05,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 304 transitions, 672 flow [2025-03-04 06:40:05,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:40:05,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:40:05,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 915 transitions. [2025-03-04 06:40:05,774 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9159159159159159 [2025-03-04 06:40:05,774 INFO L175 Difference]: Start difference. First operand has 307 places, 305 transitions, 628 flow. Second operand 3 states and 915 transitions. [2025-03-04 06:40:05,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 304 transitions, 672 flow [2025-03-04 06:40:05,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 304 transitions, 671 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:40:05,778 INFO L231 Difference]: Finished difference. Result has 307 places, 304 transitions, 629 flow [2025-03-04 06:40:05,779 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=629, PETRI_PLACES=307, PETRI_TRANSITIONS=304} [2025-03-04 06:40:05,779 INFO L279 CegarLoopForPetriNet]: 326 programPoint places, -19 predicate places. [2025-03-04 06:40:05,779 INFO L471 AbstractCegarLoop]: Abstraction has has 307 places, 304 transitions, 629 flow [2025-03-04 06:40:05,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 298.3333333333333) internal successors, (895), 3 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) [2025-03-04 06:40:05,780 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:05,780 INFO L206 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] [2025-03-04 06:40:05,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 06:40:05,781 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thrErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-03-04 06:40:05,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:05,781 INFO L85 PathProgramCache]: Analyzing trace with hash -600412476, now seen corresponding path program 1 times [2025-03-04 06:40:05,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:05,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514965041] [2025-03-04 06:40:05,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:05,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:05,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 06:40:05,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 06:40:05,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:05,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:05,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:40:05,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:05,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514965041] [2025-03-04 06:40:05,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514965041] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:05,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:05,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:40:05,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128096613] [2025-03-04 06:40:05,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:05,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:40:05,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:05,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:40:05,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:40:05,857 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 282 out of 333 [2025-03-04 06:40:05,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 304 transitions, 629 flow. Second operand has 3 states, 3 states have (on average 283.6666666666667) internal successors, (851), 3 states have internal predecessors, (851), 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) [2025-03-04 06:40:05,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:05,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 282 of 333 [2025-03-04 06:40:05,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:08,552 INFO L124 PetriNetUnfolderBase]: 4201/31328 cut-off events. [2025-03-04 06:40:08,553 INFO L125 PetriNetUnfolderBase]: For 466/466 co-relation queries the response was YES. [2025-03-04 06:40:08,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37787 conditions, 31328 events. 4201/31328 cut-off events. For 466/466 co-relation queries the response was YES. Maximal size of possible extension queue 735. Compared 462524 event pairs, 1667 based on Foata normal form. 0/26528 useless extension candidates. Maximal degree in co-relation 37744. Up to 4132 conditions per place. [2025-03-04 06:40:08,833 INFO L140 encePairwiseOnDemand]: 303/333 looper letters, 48 selfloop transitions, 21 changer transitions 0/333 dead transitions. [2025-03-04 06:40:08,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 333 transitions, 835 flow [2025-03-04 06:40:08,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:40:08,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:40:08,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 924 transitions. [2025-03-04 06:40:08,836 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.924924924924925 [2025-03-04 06:40:08,836 INFO L175 Difference]: Start difference. First operand has 307 places, 304 transitions, 629 flow. Second operand 3 states and 924 transitions. [2025-03-04 06:40:08,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 333 transitions, 835 flow [2025-03-04 06:40:08,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 333 transitions, 831 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:40:08,842 INFO L231 Difference]: Finished difference. Result has 309 places, 325 transitions, 811 flow [2025-03-04 06:40:08,843 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=811, PETRI_PLACES=309, PETRI_TRANSITIONS=325} [2025-03-04 06:40:08,844 INFO L279 CegarLoopForPetriNet]: 326 programPoint places, -17 predicate places. [2025-03-04 06:40:08,844 INFO L471 AbstractCegarLoop]: Abstraction has has 309 places, 325 transitions, 811 flow [2025-03-04 06:40:08,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 283.6666666666667) internal successors, (851), 3 states have internal predecessors, (851), 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) [2025-03-04 06:40:08,845 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:08,845 INFO L206 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] [2025-03-04 06:40:08,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 06:40:08,845 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thrErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-03-04 06:40:08,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:08,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1246836883, now seen corresponding path program 1 times [2025-03-04 06:40:08,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:08,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725465854] [2025-03-04 06:40:08,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:08,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:08,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-04 06:40:08,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-04 06:40:08,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:08,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:08,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:40:08,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:08,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725465854] [2025-03-04 06:40:08,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725465854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:08,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:08,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:40:08,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022987895] [2025-03-04 06:40:08,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:08,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:40:08,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:08,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:40:08,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:40:08,983 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 333 [2025-03-04 06:40:08,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 325 transitions, 811 flow. Second operand has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 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) [2025-03-04 06:40:08,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:08,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 333 [2025-03-04 06:40:08,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:10,090 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1015] L1045-3-->L1045: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#lock~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#lock~0.base_15|) |v_~#lock~0.offset_15| 0))) (= |v_thrThread3of3ForFork0_#t~ret6#1_1| 0)) InVars {~#lock~0.base=|v_~#lock~0.base_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#lock~0.offset=|v_~#lock~0.offset_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_17|, ~#lock~0.offset=|v_~#lock~0.offset_15|, ~#lock~0.base=|v_~#lock~0.base_15|, thrThread3of3ForFork0_#t~ret6#1=|v_thrThread3of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread3of3ForFork0_#t~ret6#1][152], [337#(= |#race~len~0| 0), 346#true, 323#true, 200#L1045true, Black: 341#true, 71#L1045true, 325#true, 105#L1061-1true, 343#(= |#race~next~0| 0), 327#true, 89#L1043-7true]) [2025-03-04 06:40:10,090 INFO L294 olderBase$Statistics]: this new event has 122 ancestors and is cut-off event [2025-03-04 06:40:10,091 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2025-03-04 06:40:10,091 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-03-04 06:40:10,091 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-03-04 06:40:10,596 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1015] L1045-3-->L1045: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#lock~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#lock~0.base_15|) |v_~#lock~0.offset_15| 0))) (= |v_thrThread3of3ForFork0_#t~ret6#1_1| 0)) InVars {~#lock~0.base=|v_~#lock~0.base_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#lock~0.offset=|v_~#lock~0.offset_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_17|, ~#lock~0.offset=|v_~#lock~0.offset_15|, ~#lock~0.base=|v_~#lock~0.base_15|, thrThread3of3ForFork0_#t~ret6#1=|v_thrThread3of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread3of3ForFork0_#t~ret6#1][153], [337#(= |#race~len~0| 0), 323#true, 200#L1045true, 143#L1045true, 349#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), Black: 343#(= |#race~next~0| 0), 71#L1045true, 325#true, 105#L1061-1true, 341#true, 327#true]) [2025-03-04 06:40:10,596 INFO L294 olderBase$Statistics]: this new event has 131 ancestors and is cut-off event [2025-03-04 06:40:10,597 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-03-04 06:40:10,597 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-03-04 06:40:10,597 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-03-04 06:40:10,841 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1015] L1045-3-->L1045: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#lock~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#lock~0.base_15|) |v_~#lock~0.offset_15| 0))) (= |v_thrThread3of3ForFork0_#t~ret6#1_1| 0)) InVars {~#lock~0.base=|v_~#lock~0.base_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#lock~0.offset=|v_~#lock~0.offset_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_17|, ~#lock~0.offset=|v_~#lock~0.offset_15|, ~#lock~0.base=|v_~#lock~0.base_15|, thrThread3of3ForFork0_#t~ret6#1=|v_thrThread3of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread3of3ForFork0_#t~ret6#1][152], [337#(= |#race~len~0| 0), 346#true, 323#true, 200#L1045true, Black: 343#(= |#race~next~0| 0), 71#L1045true, 325#true, 105#L1061-1true, 341#true, 327#true, 89#L1043-7true]) [2025-03-04 06:40:10,841 INFO L294 olderBase$Statistics]: this new event has 133 ancestors and is cut-off event [2025-03-04 06:40:10,841 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2025-03-04 06:40:10,841 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2025-03-04 06:40:10,841 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2025-03-04 06:40:10,974 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1015] L1045-3-->L1045: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#lock~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#lock~0.base_15|) |v_~#lock~0.offset_15| 0))) (= |v_thrThread3of3ForFork0_#t~ret6#1_1| 0)) InVars {~#lock~0.base=|v_~#lock~0.base_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#lock~0.offset=|v_~#lock~0.offset_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_17|, ~#lock~0.offset=|v_~#lock~0.offset_15|, ~#lock~0.base=|v_~#lock~0.base_15|, thrThread3of3ForFork0_#t~ret6#1=|v_thrThread3of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread3of3ForFork0_#t~ret6#1][152], [337#(= |#race~len~0| 0), 346#true, 323#true, 200#L1045true, Black: 343#(= |#race~next~0| 0), 71#L1045true, 325#true, 105#L1061-1true, 341#true, 263#L1043-4true, 327#true]) [2025-03-04 06:40:10,974 INFO L294 olderBase$Statistics]: this new event has 136 ancestors and is cut-off event [2025-03-04 06:40:10,974 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-03-04 06:40:10,974 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-03-04 06:40:10,974 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-03-04 06:40:12,097 INFO L124 PetriNetUnfolderBase]: 3148/31373 cut-off events. [2025-03-04 06:40:12,097 INFO L125 PetriNetUnfolderBase]: For 856/864 co-relation queries the response was YES. [2025-03-04 06:40:12,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38075 conditions, 31373 events. 3148/31373 cut-off events. For 856/864 co-relation queries the response was YES. Maximal size of possible extension queue 724. Compared 473988 event pairs, 1451 based on Foata normal form. 59/26880 useless extension candidates. Maximal degree in co-relation 38032. Up to 2767 conditions per place. [2025-03-04 06:40:12,336 INFO L140 encePairwiseOnDemand]: 329/333 looper letters, 27 selfloop transitions, 3 changer transitions 0/338 dead transitions. [2025-03-04 06:40:12,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 338 transitions, 917 flow [2025-03-04 06:40:12,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 06:40:12,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 06:40:12,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1251 transitions. [2025-03-04 06:40:12,343 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9391891891891891 [2025-03-04 06:40:12,343 INFO L175 Difference]: Start difference. First operand has 309 places, 325 transitions, 811 flow. Second operand 4 states and 1251 transitions. [2025-03-04 06:40:12,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 338 transitions, 917 flow [2025-03-04 06:40:12,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 338 transitions, 875 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:40:12,368 INFO L231 Difference]: Finished difference. Result has 311 places, 325 transitions, 779 flow [2025-03-04 06:40:12,368 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=769, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=779, PETRI_PLACES=311, PETRI_TRANSITIONS=325} [2025-03-04 06:40:12,368 INFO L279 CegarLoopForPetriNet]: 326 programPoint places, -15 predicate places. [2025-03-04 06:40:12,368 INFO L471 AbstractCegarLoop]: Abstraction has has 311 places, 325 transitions, 779 flow [2025-03-04 06:40:12,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 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) [2025-03-04 06:40:12,369 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:12,369 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:40:12,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 06:40:12,369 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-03-04 06:40:12,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:12,370 INFO L85 PathProgramCache]: Analyzing trace with hash 724184033, now seen corresponding path program 1 times [2025-03-04 06:40:12,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:12,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505764685] [2025-03-04 06:40:12,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:12,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:12,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-04 06:40:12,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-04 06:40:12,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:12,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:12,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:40:12,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:12,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505764685] [2025-03-04 06:40:12,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505764685] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:12,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:12,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:40:12,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899593059] [2025-03-04 06:40:12,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:12,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 06:40:12,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:12,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 06:40:12,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:40:12,443 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 333 [2025-03-04 06:40:12,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 325 transitions, 779 flow. Second operand has 5 states, 5 states have (on average 301.6) internal successors, (1508), 5 states have internal predecessors, (1508), 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) [2025-03-04 06:40:12,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:12,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 333 [2025-03-04 06:40:12,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:13,675 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1015] L1045-3-->L1045: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#lock~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#lock~0.base_15|) |v_~#lock~0.offset_15| 0))) (= |v_thrThread3of3ForFork0_#t~ret6#1_1| 0)) InVars {~#lock~0.base=|v_~#lock~0.base_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#lock~0.offset=|v_~#lock~0.offset_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_17|, ~#lock~0.offset=|v_~#lock~0.offset_15|, ~#lock~0.base=|v_~#lock~0.base_15|, thrThread3of3ForFork0_#t~ret6#1=|v_thrThread3of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread3of3ForFork0_#t~ret6#1][144], [337#(= |#race~len~0| 0), 346#true, 323#true, 200#L1045true, Black: 341#true, 351#true, 325#true, 71#L1045true, 105#L1061-1true, 327#true, 267#L1043true, Black: 349#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0))]) [2025-03-04 06:40:13,675 INFO L294 olderBase$Statistics]: this new event has 131 ancestors and is cut-off event [2025-03-04 06:40:13,675 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2025-03-04 06:40:13,675 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-03-04 06:40:13,675 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2025-03-04 06:40:13,758 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1099] L1045-3-->L1045: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#lock~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#lock~0.base_15|) |v_~#lock~0.offset_15| 0))) (= |v_thrThread2of3ForFork0_#t~ret6#1_1| 0)) InVars {~#lock~0.base=|v_~#lock~0.base_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#lock~0.offset=|v_~#lock~0.offset_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_17|, ~#lock~0.offset=|v_~#lock~0.offset_15|, ~#lock~0.base=|v_~#lock~0.base_15|, thrThread2of3ForFork0_#t~ret6#1=|v_thrThread2of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread2of3ForFork0_#t~ret6#1][115], [337#(= |#race~len~0| 0), 323#true, 200#L1045true, 143#L1045true, Black: 343#(= |#race~next~0| 0), 349#(and (= |thrThread1of3ForFork0_~end~0#1| 0) (= |thrThread1of3ForFork0_~c~0#1| 0)), 351#true, 325#true, 71#L1045true, 105#L1061-1true, 327#true]) [2025-03-04 06:40:13,759 INFO L294 olderBase$Statistics]: this new event has 134 ancestors and is cut-off event [2025-03-04 06:40:13,759 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2025-03-04 06:40:13,759 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2025-03-04 06:40:13,759 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2025-03-04 06:40:15,201 INFO L124 PetriNetUnfolderBase]: 2233/24088 cut-off events. [2025-03-04 06:40:15,201 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2025-03-04 06:40:15,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28133 conditions, 24088 events. 2233/24088 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 568. Compared 353980 event pairs, 1151 based on Foata normal form. 1/20427 useless extension candidates. Maximal degree in co-relation 28088. Up to 2300 conditions per place. [2025-03-04 06:40:15,396 INFO L140 encePairwiseOnDemand]: 329/333 looper letters, 20 selfloop transitions, 0 changer transitions 4/328 dead transitions. [2025-03-04 06:40:15,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 328 transitions, 833 flow [2025-03-04 06:40:15,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 06:40:15,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 06:40:15,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1520 transitions. [2025-03-04 06:40:15,400 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9129129129129129 [2025-03-04 06:40:15,400 INFO L175 Difference]: Start difference. First operand has 311 places, 325 transitions, 779 flow. Second operand 5 states and 1520 transitions. [2025-03-04 06:40:15,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 328 transitions, 833 flow [2025-03-04 06:40:15,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 328 transitions, 827 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 06:40:15,404 INFO L231 Difference]: Finished difference. Result has 315 places, 324 transitions, 777 flow [2025-03-04 06:40:15,405 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=773, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=777, PETRI_PLACES=315, PETRI_TRANSITIONS=324} [2025-03-04 06:40:15,405 INFO L279 CegarLoopForPetriNet]: 326 programPoint places, -11 predicate places. [2025-03-04 06:40:15,405 INFO L471 AbstractCegarLoop]: Abstraction has has 315 places, 324 transitions, 777 flow [2025-03-04 06:40:15,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 301.6) internal successors, (1508), 5 states have internal predecessors, (1508), 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) [2025-03-04 06:40:15,406 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:15,406 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:40:15,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 06:40:15,406 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-03-04 06:40:15,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:15,407 INFO L85 PathProgramCache]: Analyzing trace with hash 173391254, now seen corresponding path program 1 times [2025-03-04 06:40:15,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:15,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665652297] [2025-03-04 06:40:15,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:15,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:15,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-04 06:40:15,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-04 06:40:15,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:15,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:40:15,427 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:40:15,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-04 06:40:15,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-04 06:40:15,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:15,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:40:15,448 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:40:15,449 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:40:15,449 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (50 of 51 remaining) [2025-03-04 06:40:15,449 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (49 of 51 remaining) [2025-03-04 06:40:15,449 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (48 of 51 remaining) [2025-03-04 06:40:15,449 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (47 of 51 remaining) [2025-03-04 06:40:15,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (46 of 51 remaining) [2025-03-04 06:40:15,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (45 of 51 remaining) [2025-03-04 06:40:15,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (44 of 51 remaining) [2025-03-04 06:40:15,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (43 of 51 remaining) [2025-03-04 06:40:15,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (42 of 51 remaining) [2025-03-04 06:40:15,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (41 of 51 remaining) [2025-03-04 06:40:15,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (40 of 51 remaining) [2025-03-04 06:40:15,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (39 of 51 remaining) [2025-03-04 06:40:15,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (38 of 51 remaining) [2025-03-04 06:40:15,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (37 of 51 remaining) [2025-03-04 06:40:15,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (36 of 51 remaining) [2025-03-04 06:40:15,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (35 of 51 remaining) [2025-03-04 06:40:15,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (34 of 51 remaining) [2025-03-04 06:40:15,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (33 of 51 remaining) [2025-03-04 06:40:15,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (32 of 51 remaining) [2025-03-04 06:40:15,451 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (31 of 51 remaining) [2025-03-04 06:40:15,451 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (30 of 51 remaining) [2025-03-04 06:40:15,451 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (29 of 51 remaining) [2025-03-04 06:40:15,451 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (28 of 51 remaining) [2025-03-04 06:40:15,451 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (27 of 51 remaining) [2025-03-04 06:40:15,451 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (26 of 51 remaining) [2025-03-04 06:40:15,451 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (25 of 51 remaining) [2025-03-04 06:40:15,451 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (24 of 51 remaining) [2025-03-04 06:40:15,451 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (23 of 51 remaining) [2025-03-04 06:40:15,451 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (22 of 51 remaining) [2025-03-04 06:40:15,451 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (21 of 51 remaining) [2025-03-04 06:40:15,451 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (20 of 51 remaining) [2025-03-04 06:40:15,451 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (19 of 51 remaining) [2025-03-04 06:40:15,451 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (18 of 51 remaining) [2025-03-04 06:40:15,451 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (17 of 51 remaining) [2025-03-04 06:40:15,451 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (16 of 51 remaining) [2025-03-04 06:40:15,452 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (15 of 51 remaining) [2025-03-04 06:40:15,452 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (14 of 51 remaining) [2025-03-04 06:40:15,452 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (13 of 51 remaining) [2025-03-04 06:40:15,452 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (12 of 51 remaining) [2025-03-04 06:40:15,452 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (11 of 51 remaining) [2025-03-04 06:40:15,452 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr10ASSERT_VIOLATIONDATA_RACE (10 of 51 remaining) [2025-03-04 06:40:15,452 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr9ASSERT_VIOLATIONDATA_RACE (9 of 51 remaining) [2025-03-04 06:40:15,452 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr8ASSERT_VIOLATIONDATA_RACE (8 of 51 remaining) [2025-03-04 06:40:15,452 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (7 of 51 remaining) [2025-03-04 06:40:15,452 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (6 of 51 remaining) [2025-03-04 06:40:15,452 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (5 of 51 remaining) [2025-03-04 06:40:15,452 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (4 of 51 remaining) [2025-03-04 06:40:15,453 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (3 of 51 remaining) [2025-03-04 06:40:15,453 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (2 of 51 remaining) [2025-03-04 06:40:15,453 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (1 of 51 remaining) [2025-03-04 06:40:15,453 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (0 of 51 remaining) [2025-03-04 06:40:15,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 06:40:15,453 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:40:15,454 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:40:15,454 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-04 06:40:15,516 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 06:40:15,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 409 places, 418 transitions, 864 flow [2025-03-04 06:40:15,558 INFO L124 PetriNetUnfolderBase]: 18/460 cut-off events. [2025-03-04 06:40:15,559 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-04 06:40:15,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 479 conditions, 460 events. 18/460 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1603 event pairs, 0 based on Foata normal form. 0/387 useless extension candidates. Maximal degree in co-relation 372. Up to 5 conditions per place. [2025-03-04 06:40:15,566 INFO L82 GeneralOperation]: Start removeDead. Operand has 409 places, 418 transitions, 864 flow [2025-03-04 06:40:15,569 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 409 places, 418 transitions, 864 flow [2025-03-04 06:40:15,571 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:40:15,572 INFO L333 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, 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;@22e43939, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:40:15,572 INFO L334 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2025-03-04 06:40:15,573 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:40:15,573 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2025-03-04 06:40:15,573 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:40:15,573 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:15,573 INFO L206 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] [2025-03-04 06:40:15,574 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2025-03-04 06:40:15,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:15,574 INFO L85 PathProgramCache]: Analyzing trace with hash -919493164, now seen corresponding path program 1 times [2025-03-04 06:40:15,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:15,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455134844] [2025-03-04 06:40:15,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:15,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:15,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 06:40:15,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 06:40:15,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:15,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:15,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:40:15,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:15,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455134844] [2025-03-04 06:40:15,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455134844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:15,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:15,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:40:15,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899228923] [2025-03-04 06:40:15,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:15,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:40:15,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:15,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:40:15,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:40:15,649 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 369 out of 418 [2025-03-04 06:40:15,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 418 transitions, 864 flow. Second operand has 3 states, 3 states have (on average 370.3333333333333) internal successors, (1111), 3 states have internal predecessors, (1111), 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) [2025-03-04 06:40:15,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:15,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 369 of 418 [2025-03-04 06:40:15,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:20,380 INFO L124 PetriNetUnfolderBase]: 7737/41866 cut-off events. [2025-03-04 06:40:20,381 INFO L125 PetriNetUnfolderBase]: For 3752/3752 co-relation queries the response was YES. [2025-03-04 06:40:20,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53415 conditions, 41866 events. 7737/41866 cut-off events. For 3752/3752 co-relation queries the response was YES. Maximal size of possible extension queue 1152. Compared 611693 event pairs, 6804 based on Foata normal form. 4054/39389 useless extension candidates. Maximal degree in co-relation 44089. Up to 9608 conditions per place. [2025-03-04 06:40:20,946 INFO L140 encePairwiseOnDemand]: 405/418 looper letters, 31 selfloop transitions, 2 changer transitions 1/394 dead transitions. [2025-03-04 06:40:20,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 394 transitions, 882 flow [2025-03-04 06:40:20,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:40:20,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:40:20,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1151 transitions. [2025-03-04 06:40:20,953 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9178628389154705 [2025-03-04 06:40:20,953 INFO L175 Difference]: Start difference. First operand has 409 places, 418 transitions, 864 flow. Second operand 3 states and 1151 transitions. [2025-03-04 06:40:20,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 394 transitions, 882 flow [2025-03-04 06:40:20,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 396 places, 394 transitions, 876 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-04 06:40:20,957 INFO L231 Difference]: Finished difference. Result has 396 places, 393 transitions, 812 flow [2025-03-04 06:40:20,958 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=418, PETRI_DIFFERENCE_MINUEND_FLOW=810, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=392, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=812, PETRI_PLACES=396, PETRI_TRANSITIONS=393} [2025-03-04 06:40:20,958 INFO L279 CegarLoopForPetriNet]: 409 programPoint places, -13 predicate places. [2025-03-04 06:40:20,958 INFO L471 AbstractCegarLoop]: Abstraction has has 396 places, 393 transitions, 812 flow [2025-03-04 06:40:20,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 370.3333333333333) internal successors, (1111), 3 states have internal predecessors, (1111), 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) [2025-03-04 06:40:20,959 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:20,959 INFO L206 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] [2025-03-04 06:40:20,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 06:40:20,959 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2025-03-04 06:40:20,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:20,959 INFO L85 PathProgramCache]: Analyzing trace with hash -927668465, now seen corresponding path program 1 times [2025-03-04 06:40:20,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:20,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240824594] [2025-03-04 06:40:20,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:20,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:20,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 06:40:20,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 06:40:20,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:20,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:20,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:40:20,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:20,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240824594] [2025-03-04 06:40:20,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240824594] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:20,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:20,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:40:20,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980050416] [2025-03-04 06:40:20,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:20,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:40:20,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:20,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:40:20,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:40:21,003 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 378 out of 418 [2025-03-04 06:40:21,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 393 transitions, 812 flow. Second operand has 3 states, 3 states have (on average 379.3333333333333) internal successors, (1138), 3 states have internal predecessors, (1138), 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) [2025-03-04 06:40:21,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:21,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 378 of 418 [2025-03-04 06:40:21,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:22,337 INFO L124 PetriNetUnfolderBase]: 909/9194 cut-off events. [2025-03-04 06:40:22,337 INFO L125 PetriNetUnfolderBase]: For 259/259 co-relation queries the response was YES. [2025-03-04 06:40:22,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10489 conditions, 9194 events. 909/9194 cut-off events. For 259/259 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 110385 event pairs, 684 based on Foata normal form. 0/7621 useless extension candidates. Maximal degree in co-relation 10453. Up to 1031 conditions per place. [2025-03-04 06:40:22,453 INFO L140 encePairwiseOnDemand]: 415/418 looper letters, 22 selfloop transitions, 2 changer transitions 0/392 dead transitions. [2025-03-04 06:40:22,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 392 transitions, 858 flow [2025-03-04 06:40:22,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:40:22,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:40:22,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1159 transitions. [2025-03-04 06:40:22,456 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9242424242424242 [2025-03-04 06:40:22,456 INFO L175 Difference]: Start difference. First operand has 396 places, 393 transitions, 812 flow. Second operand 3 states and 1159 transitions. [2025-03-04 06:40:22,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 392 transitions, 858 flow [2025-03-04 06:40:22,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 394 places, 392 transitions, 854 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:40:22,461 INFO L231 Difference]: Finished difference. Result has 394 places, 392 transitions, 810 flow [2025-03-04 06:40:22,461 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=418, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=392, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=392, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=390, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=810, PETRI_PLACES=394, PETRI_TRANSITIONS=392} [2025-03-04 06:40:22,462 INFO L279 CegarLoopForPetriNet]: 409 programPoint places, -15 predicate places. [2025-03-04 06:40:22,462 INFO L471 AbstractCegarLoop]: Abstraction has has 394 places, 392 transitions, 810 flow [2025-03-04 06:40:22,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 379.3333333333333) internal successors, (1138), 3 states have internal predecessors, (1138), 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) [2025-03-04 06:40:22,462 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:22,462 INFO L206 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] [2025-03-04 06:40:22,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 06:40:22,462 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2025-03-04 06:40:22,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:22,463 INFO L85 PathProgramCache]: Analyzing trace with hash 149931068, now seen corresponding path program 1 times [2025-03-04 06:40:22,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:22,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421569450] [2025-03-04 06:40:22,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:22,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:22,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 06:40:22,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 06:40:22,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:22,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:22,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:40:22,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:22,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421569450] [2025-03-04 06:40:22,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421569450] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:22,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:22,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:40:22,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453591097] [2025-03-04 06:40:22,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:22,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:40:22,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:22,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:40:22,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:40:22,507 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 418 [2025-03-04 06:40:22,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 394 places, 392 transitions, 810 flow. Second operand has 3 states, 3 states have (on average 371.0) internal successors, (1113), 3 states have internal predecessors, (1113), 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) [2025-03-04 06:40:22,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:22,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 418 [2025-03-04 06:40:22,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:25,094 INFO L124 PetriNetUnfolderBase]: 2261/20895 cut-off events. [2025-03-04 06:40:25,094 INFO L125 PetriNetUnfolderBase]: For 473/473 co-relation queries the response was YES. [2025-03-04 06:40:25,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23878 conditions, 20895 events. 2261/20895 cut-off events. For 473/473 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 295762 event pairs, 1720 based on Foata normal form. 0/17497 useless extension candidates. Maximal degree in co-relation 23834. Up to 2506 conditions per place. [2025-03-04 06:40:25,310 INFO L140 encePairwiseOnDemand]: 410/418 looper letters, 26 selfloop transitions, 1 changer transitions 0/385 dead transitions. [2025-03-04 06:40:25,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 385 transitions, 850 flow [2025-03-04 06:40:25,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:40:25,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:40:25,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1144 transitions. [2025-03-04 06:40:25,313 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9122807017543859 [2025-03-04 06:40:25,313 INFO L175 Difference]: Start difference. First operand has 394 places, 392 transitions, 810 flow. Second operand 3 states and 1144 transitions. [2025-03-04 06:40:25,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 385 transitions, 850 flow [2025-03-04 06:40:25,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 387 places, 385 transitions, 846 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:40:25,317 INFO L231 Difference]: Finished difference. Result has 387 places, 385 transitions, 794 flow [2025-03-04 06:40:25,318 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=418, PETRI_DIFFERENCE_MINUEND_FLOW=792, PETRI_DIFFERENCE_MINUEND_PLACES=385, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=385, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=384, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=794, PETRI_PLACES=387, PETRI_TRANSITIONS=385} [2025-03-04 06:40:25,318 INFO L279 CegarLoopForPetriNet]: 409 programPoint places, -22 predicate places. [2025-03-04 06:40:25,318 INFO L471 AbstractCegarLoop]: Abstraction has has 387 places, 385 transitions, 794 flow [2025-03-04 06:40:25,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 371.0) internal successors, (1113), 3 states have internal predecessors, (1113), 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) [2025-03-04 06:40:25,319 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:25,319 INFO L206 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] [2025-03-04 06:40:25,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 06:40:25,319 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2025-03-04 06:40:25,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:25,319 INFO L85 PathProgramCache]: Analyzing trace with hash -355660671, now seen corresponding path program 1 times [2025-03-04 06:40:25,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:25,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355569924] [2025-03-04 06:40:25,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:25,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:25,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 06:40:25,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 06:40:25,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:25,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:25,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:40:25,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:25,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355569924] [2025-03-04 06:40:25,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355569924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:25,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:25,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:40:25,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434224484] [2025-03-04 06:40:25,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:25,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:40:25,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:25,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:40:25,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:40:25,390 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 373 out of 418 [2025-03-04 06:40:25,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 387 places, 385 transitions, 794 flow. Second operand has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 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) [2025-03-04 06:40:25,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:25,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 373 of 418 [2025-03-04 06:40:25,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:28,622 INFO L124 PetriNetUnfolderBase]: 4251/26676 cut-off events. [2025-03-04 06:40:28,622 INFO L125 PetriNetUnfolderBase]: For 781/781 co-relation queries the response was YES. [2025-03-04 06:40:28,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32649 conditions, 26676 events. 4251/26676 cut-off events. For 781/781 co-relation queries the response was YES. Maximal size of possible extension queue 583. Compared 358665 event pairs, 3630 based on Foata normal form. 0/22471 useless extension candidates. Maximal degree in co-relation 32605. Up to 5188 conditions per place. [2025-03-04 06:40:28,930 INFO L140 encePairwiseOnDemand]: 415/418 looper letters, 27 selfloop transitions, 2 changer transitions 0/384 dead transitions. [2025-03-04 06:40:28,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 384 transitions, 850 flow [2025-03-04 06:40:28,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:40:28,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:40:28,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1149 transitions. [2025-03-04 06:40:28,932 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.916267942583732 [2025-03-04 06:40:28,932 INFO L175 Difference]: Start difference. First operand has 387 places, 385 transitions, 794 flow. Second operand 3 states and 1149 transitions. [2025-03-04 06:40:28,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 388 places, 384 transitions, 850 flow [2025-03-04 06:40:28,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 387 places, 384 transitions, 849 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:40:28,937 INFO L231 Difference]: Finished difference. Result has 387 places, 384 transitions, 795 flow [2025-03-04 06:40:28,937 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=418, PETRI_DIFFERENCE_MINUEND_FLOW=791, PETRI_DIFFERENCE_MINUEND_PLACES=385, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=382, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=795, PETRI_PLACES=387, PETRI_TRANSITIONS=384} [2025-03-04 06:40:28,937 INFO L279 CegarLoopForPetriNet]: 409 programPoint places, -22 predicate places. [2025-03-04 06:40:28,937 INFO L471 AbstractCegarLoop]: Abstraction has has 387 places, 384 transitions, 795 flow [2025-03-04 06:40:28,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 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) [2025-03-04 06:40:28,938 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:28,938 INFO L206 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] [2025-03-04 06:40:28,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 06:40:28,938 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thrErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 59 more)] === [2025-03-04 06:40:28,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:28,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1134647890, now seen corresponding path program 1 times [2025-03-04 06:40:28,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:28,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292624474] [2025-03-04 06:40:28,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:28,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:28,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 06:40:28,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 06:40:28,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:28,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:28,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:40:28,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:28,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292624474] [2025-03-04 06:40:28,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292624474] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:28,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:28,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:40:28,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187528997] [2025-03-04 06:40:28,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:28,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:40:28,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:28,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:40:28,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:40:29,012 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 351 out of 418 [2025-03-04 06:40:29,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 387 places, 384 transitions, 795 flow. Second operand has 3 states, 3 states have (on average 352.6666666666667) internal successors, (1058), 3 states have internal predecessors, (1058), 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) [2025-03-04 06:40:29,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:29,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 351 of 418 [2025-03-04 06:40:29,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand