./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-lit/sssc12.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.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 94001a9ab0492f7774a7e81f183179cf0060947b701e48f51b2989eec22ae051 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:39:57,083 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:39:57,140 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,144 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:39:57,144 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:39:57,159 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:39:57,161 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:39:57,161 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:39:57,162 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:39:57,162 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:39:57,162 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:39:57,163 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:39:57,163 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:39:57,163 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:39:57,163 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:39:57,163 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:39:57,163 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:39:57,163 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:39:57,163 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:39:57,164 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:39:57,164 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:39:57,164 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:39:57,164 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:39:57,164 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:39:57,164 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:39:57,164 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:39:57,164 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:39:57,164 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:39:57,165 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:39:57,165 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:39:57,165 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:39:57,165 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:39:57,165 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:39:57,166 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:39:57,166 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:39:57,166 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:39:57,166 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:39:57,166 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:39:57,166 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:39:57,166 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:39:57,166 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:39:57,166 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:39:57,166 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 -> 94001a9ab0492f7774a7e81f183179cf0060947b701e48f51b2989eec22ae051 [2025-03-04 06:39:57,411 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:39:57,421 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:39:57,423 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:39:57,424 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:39:57,425 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:39:57,426 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-lit/sssc12.i [2025-03-04 06:39:58,593 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22c624a41/cb49e9a55abc422386ef9bd0613ba640/FLAGd1b24f011 [2025-03-04 06:39:58,913 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:39:58,919 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-lit/sssc12.i [2025-03-04 06:39:58,939 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22c624a41/cb49e9a55abc422386ef9bd0613ba640/FLAGd1b24f011 [2025-03-04 06:39:59,175 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22c624a41/cb49e9a55abc422386ef9bd0613ba640 [2025-03-04 06:39:59,177 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:39:59,178 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:39:59,181 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:39:59,181 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:39:59,184 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:39:59,186 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,187 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@139279b1 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,188 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,223 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:39:59,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:39:59,490 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:39:59,533 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:39:59,574 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:39:59,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:39:59 WrapperNode [2025-03-04 06:39:59,574 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:39:59,575 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:39:59,575 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:39:59,575 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:39:59,580 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:39:59" (1/1) ... [2025-03-04 06:39:59,592 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:39:59" (1/1) ... [2025-03-04 06:39:59,608 INFO L138 Inliner]: procedures = 272, calls = 20, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 118 [2025-03-04 06:39:59,608 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:39:59,608 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:39:59,609 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:39:59,609 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:39:59,614 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:39:59" (1/1) ... [2025-03-04 06:39:59,614 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:39:59" (1/1) ... [2025-03-04 06:39:59,616 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:39:59" (1/1) ... [2025-03-04 06:39:59,616 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:39:59" (1/1) ... [2025-03-04 06:39:59,620 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:39:59" (1/1) ... [2025-03-04 06:39:59,620 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:39:59" (1/1) ... [2025-03-04 06:39:59,621 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:39:59" (1/1) ... [2025-03-04 06:39:59,622 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:39:59" (1/1) ... [2025-03-04 06:39:59,623 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:39:59,624 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:39:59,624 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:39:59,625 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:39:59,625 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:39:59" (1/1) ... [2025-03-04 06:39:59,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:39:59,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:39:59,655 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:39:59,658 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:39:59,674 INFO L130 BoogieDeclarations]: Found specification of procedure thr [2025-03-04 06:39:59,674 INFO L138 BoogieDeclarations]: Found implementation of procedure thr [2025-03-04 06:39:59,674 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 06:39:59,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:39:59,674 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 06:39:59,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 06:39:59,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:39:59,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:39:59,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:39:59,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:39:59,675 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:39:59,771 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:39:59,772 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:39:59,989 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:39:59,990 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:40:00,011 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:40:00,012 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:40:00,013 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,013 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:40:00,015 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:40:00,015 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:40:00,019 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:40:00,019 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,020 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d901ae5 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,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:39:59" (2/3) ... [2025-03-04 06:40:00,021 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d901ae5 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,021 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,022 INFO L128 eAbstractionObserver]: Analyzing ICFG sssc12.i [2025-03-04 06:40:00,034 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:40:00,036 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sssc12.i that has 2 procedures, 138 locations, 1 initial locations, 2 loop locations, and 14 error locations. [2025-03-04 06:40:00,037 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:40:00,125 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 06:40:00,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 145 transitions, 294 flow [2025-03-04 06:40:00,215 INFO L124 PetriNetUnfolderBase]: 7/153 cut-off events. [2025-03-04 06:40:00,217 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:40:00,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 153 events. 7/153 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 159 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2025-03-04 06:40:00,222 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 145 transitions, 294 flow [2025-03-04 06:40:00,226 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 141 places, 145 transitions, 294 flow [2025-03-04 06:40:00,233 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:40:00,245 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;@47adefd7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:40:00,246 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-03-04 06:40:00,251 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:40:00,251 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2025-03-04 06:40:00,251 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:40:00,251 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:00,251 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] [2025-03-04 06:40:00,252 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-04 06:40:00,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:00,256 INFO L85 PathProgramCache]: Analyzing trace with hash -594565006, now seen corresponding path program 1 times [2025-03-04 06:40:00,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:00,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981080209] [2025-03-04 06:40:00,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:00,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:00,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 06:40:00,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 06:40:00,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:00,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:00,412 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:00,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:00,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981080209] [2025-03-04 06:40:00,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981080209] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:00,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:00,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:40:00,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050224267] [2025-03-04 06:40:00,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:00,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:40:00,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:00,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:40:00,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:40:00,465 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 145 [2025-03-04 06:40:00,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 145 transitions, 294 flow. Second operand has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:40:00,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:00,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 145 [2025-03-04 06:40:00,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:00,516 INFO L124 PetriNetUnfolderBase]: 4/137 cut-off events. [2025-03-04 06:40:00,516 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:40:00,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 137 events. 4/137 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 116 event pairs, 0 based on Foata normal form. 11/129 useless extension candidates. Maximal degree in co-relation 76. Up to 11 conditions per place. [2025-03-04 06:40:00,517 INFO L140 encePairwiseOnDemand]: 138/145 looper letters, 10 selfloop transitions, 2 changer transitions 1/134 dead transitions. [2025-03-04 06:40:00,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 134 transitions, 296 flow [2025-03-04 06:40:00,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:40:00,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:40:00,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 395 transitions. [2025-03-04 06:40:00,529 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9080459770114943 [2025-03-04 06:40:00,530 INFO L175 Difference]: Start difference. First operand has 141 places, 145 transitions, 294 flow. Second operand 3 states and 395 transitions. [2025-03-04 06:40:00,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 134 transitions, 296 flow [2025-03-04 06:40:00,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 134 transitions, 296 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:40:00,540 INFO L231 Difference]: Finished difference. Result has 135 places, 133 transitions, 274 flow [2025-03-04 06:40:00,542 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=274, PETRI_PLACES=135, PETRI_TRANSITIONS=133} [2025-03-04 06:40:00,545 INFO L279 CegarLoopForPetriNet]: 141 programPoint places, -6 predicate places. [2025-03-04 06:40:00,546 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 133 transitions, 274 flow [2025-03-04 06:40:00,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:40:00,547 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:00,547 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] [2025-03-04 06:40:00,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:40:00,547 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-04 06:40:00,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:00,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1922132029, now seen corresponding path program 1 times [2025-03-04 06:40:00,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:00,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526923486] [2025-03-04 06:40:00,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:00,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:00,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 06:40:00,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 06:40:00,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:00,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:00,623 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:00,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:00,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526923486] [2025-03-04 06:40:00,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526923486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:00,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:00,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:40:00,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880717709] [2025-03-04 06:40:00,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:00,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:40:00,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:00,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:40:00,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:40:00,666 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 145 [2025-03-04 06:40:00,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 133 transitions, 274 flow. Second operand has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 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:00,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:00,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 145 [2025-03-04 06:40:00,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:00,705 INFO L124 PetriNetUnfolderBase]: 4/135 cut-off events. [2025-03-04 06:40:00,706 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:40:00,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 135 events. 4/135 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 111 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 125. Up to 12 conditions per place. [2025-03-04 06:40:00,706 INFO L140 encePairwiseOnDemand]: 142/145 looper letters, 11 selfloop transitions, 2 changer transitions 0/132 dead transitions. [2025-03-04 06:40:00,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 132 transitions, 298 flow [2025-03-04 06:40:00,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:40:00,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:40:00,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 389 transitions. [2025-03-04 06:40:00,710 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8942528735632184 [2025-03-04 06:40:00,710 INFO L175 Difference]: Start difference. First operand has 135 places, 133 transitions, 274 flow. Second operand 3 states and 389 transitions. [2025-03-04 06:40:00,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 132 transitions, 298 flow [2025-03-04 06:40:00,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 132 transitions, 294 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:40:00,715 INFO L231 Difference]: Finished difference. Result has 133 places, 132 transitions, 272 flow [2025-03-04 06:40:00,715 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=272, PETRI_PLACES=133, PETRI_TRANSITIONS=132} [2025-03-04 06:40:00,716 INFO L279 CegarLoopForPetriNet]: 141 programPoint places, -8 predicate places. [2025-03-04 06:40:00,716 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 132 transitions, 272 flow [2025-03-04 06:40:00,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 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:00,716 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:00,716 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] [2025-03-04 06:40:00,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:40:00,717 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-04 06:40:00,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:00,717 INFO L85 PathProgramCache]: Analyzing trace with hash 2136162261, now seen corresponding path program 1 times [2025-03-04 06:40:00,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:00,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123579044] [2025-03-04 06:40:00,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:00,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:00,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 06:40:00,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 06:40:00,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:00,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:00,775 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:00,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:00,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123579044] [2025-03-04 06:40:00,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123579044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:00,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:00,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:40:00,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353787288] [2025-03-04 06:40:00,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:00,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:40:00,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:00,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:40:00,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:40:00,800 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 145 [2025-03-04 06:40:00,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 132 transitions, 272 flow. Second operand has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:40:00,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:00,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 145 [2025-03-04 06:40:00,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:00,828 INFO L124 PetriNetUnfolderBase]: 4/130 cut-off events. [2025-03-04 06:40:00,828 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 06:40:00,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 130 events. 4/130 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 99 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 113. Up to 13 conditions per place. [2025-03-04 06:40:00,832 INFO L140 encePairwiseOnDemand]: 139/145 looper letters, 13 selfloop transitions, 1 changer transitions 0/127 dead transitions. [2025-03-04 06:40:00,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 127 transitions, 290 flow [2025-03-04 06:40:00,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:40:00,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:40:00,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2025-03-04 06:40:00,834 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8781609195402299 [2025-03-04 06:40:00,834 INFO L175 Difference]: Start difference. First operand has 133 places, 132 transitions, 272 flow. Second operand 3 states and 382 transitions. [2025-03-04 06:40:00,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 127 transitions, 290 flow [2025-03-04 06:40:00,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 127 transitions, 286 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:40:00,838 INFO L231 Difference]: Finished difference. Result has 128 places, 127 transitions, 260 flow [2025-03-04 06:40:00,838 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=260, PETRI_PLACES=128, PETRI_TRANSITIONS=127} [2025-03-04 06:40:00,838 INFO L279 CegarLoopForPetriNet]: 141 programPoint places, -13 predicate places. [2025-03-04 06:40:00,838 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 127 transitions, 260 flow [2025-03-04 06:40:00,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:40:00,839 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:00,839 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] [2025-03-04 06:40:00,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:40:00,839 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-04 06:40:00,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:00,840 INFO L85 PathProgramCache]: Analyzing trace with hash 15897724, now seen corresponding path program 1 times [2025-03-04 06:40:00,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:00,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038618998] [2025-03-04 06:40:00,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:00,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:00,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 06:40:00,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 06:40:00,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:00,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:00,911 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:00,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:00,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038618998] [2025-03-04 06:40:00,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038618998] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:00,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:00,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:40:00,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438184813] [2025-03-04 06:40:00,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:00,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:40:00,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:00,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:40:00,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:40:00,930 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 145 [2025-03-04 06:40:00,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 127 transitions, 260 flow. Second operand has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 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:00,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:00,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 145 [2025-03-04 06:40:00,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:00,952 INFO L124 PetriNetUnfolderBase]: 4/129 cut-off events. [2025-03-04 06:40:00,954 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:40:00,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 129 events. 4/129 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 97 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 106. Up to 8 conditions per place. [2025-03-04 06:40:00,955 INFO L140 encePairwiseOnDemand]: 142/145 looper letters, 7 selfloop transitions, 2 changer transitions 0/126 dead transitions. [2025-03-04 06:40:00,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 126 transitions, 276 flow [2025-03-04 06:40:00,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:40:00,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:40:00,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 397 transitions. [2025-03-04 06:40:00,957 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9126436781609195 [2025-03-04 06:40:00,957 INFO L175 Difference]: Start difference. First operand has 128 places, 127 transitions, 260 flow. Second operand 3 states and 397 transitions. [2025-03-04 06:40:00,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 126 transitions, 276 flow [2025-03-04 06:40:00,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 126 transitions, 275 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:40:00,960 INFO L231 Difference]: Finished difference. Result has 128 places, 126 transitions, 261 flow [2025-03-04 06:40:00,960 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=261, PETRI_PLACES=128, PETRI_TRANSITIONS=126} [2025-03-04 06:40:00,960 INFO L279 CegarLoopForPetriNet]: 141 programPoint places, -13 predicate places. [2025-03-04 06:40:00,961 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 126 transitions, 261 flow [2025-03-04 06:40:00,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 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:00,961 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:00,962 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] [2025-03-04 06:40:00,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:40:00,962 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-04 06:40:00,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:00,963 INFO L85 PathProgramCache]: Analyzing trace with hash 2095279254, now seen corresponding path program 1 times [2025-03-04 06:40:00,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:00,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849792046] [2025-03-04 06:40:00,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:00,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:00,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 06:40:00,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 06:40:00,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:00,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:01,119 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,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:01,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849792046] [2025-03-04 06:40:01,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849792046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:01,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:01,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:40:01,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80037049] [2025-03-04 06:40:01,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:01,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 06:40:01,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:01,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 06:40:01,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:40:01,152 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 145 [2025-03-04 06:40:01,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 126 transitions, 261 flow. Second operand has 5 states, 5 states have (on average 125.2) internal successors, (626), 5 states have internal predecessors, (626), 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,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:01,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 145 [2025-03-04 06:40:01,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:01,195 INFO L124 PetriNetUnfolderBase]: 3/132 cut-off events. [2025-03-04 06:40:01,195 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:40:01,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 132 events. 3/132 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 98 event pairs, 0 based on Foata normal form. 1/122 useless extension candidates. Maximal degree in co-relation 120. Up to 15 conditions per place. [2025-03-04 06:40:01,197 INFO L140 encePairwiseOnDemand]: 141/145 looper letters, 14 selfloop transitions, 0 changer transitions 4/129 dead transitions. [2025-03-04 06:40:01,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 129 transitions, 303 flow [2025-03-04 06:40:01,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 06:40:01,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 06:40:01,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 634 transitions. [2025-03-04 06:40:01,199 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8744827586206897 [2025-03-04 06:40:01,199 INFO L175 Difference]: Start difference. First operand has 128 places, 126 transitions, 261 flow. Second operand 5 states and 634 transitions. [2025-03-04 06:40:01,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 129 transitions, 303 flow [2025-03-04 06:40:01,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 129 transitions, 299 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:40:01,201 INFO L231 Difference]: Finished difference. Result has 133 places, 125 transitions, 261 flow [2025-03-04 06:40:01,202 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=261, PETRI_PLACES=133, PETRI_TRANSITIONS=125} [2025-03-04 06:40:01,202 INFO L279 CegarLoopForPetriNet]: 141 programPoint places, -8 predicate places. [2025-03-04 06:40:01,202 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 125 transitions, 261 flow [2025-03-04 06:40:01,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 125.2) internal successors, (626), 5 states have internal predecessors, (626), 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,203 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:01,203 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] [2025-03-04 06:40:01,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:40:01,203 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-04 06:40:01,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:01,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1504439492, now seen corresponding path program 1 times [2025-03-04 06:40:01,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:01,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965032409] [2025-03-04 06:40:01,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:01,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:01,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-04 06:40:01,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 06:40:01,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:01,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:40:01,236 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:40:01,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-04 06:40:01,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 06:40:01,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:01,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:40:01,268 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:40:01,268 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:40:01,269 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 23 remaining) [2025-03-04 06:40:01,270 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (21 of 23 remaining) [2025-03-04 06:40:01,270 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (20 of 23 remaining) [2025-03-04 06:40:01,270 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (19 of 23 remaining) [2025-03-04 06:40:01,271 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (18 of 23 remaining) [2025-03-04 06:40:01,271 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (17 of 23 remaining) [2025-03-04 06:40:01,271 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 23 remaining) [2025-03-04 06:40:01,271 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (15 of 23 remaining) [2025-03-04 06:40:01,271 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (14 of 23 remaining) [2025-03-04 06:40:01,272 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (13 of 23 remaining) [2025-03-04 06:40:01,272 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (12 of 23 remaining) [2025-03-04 06:40:01,272 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (11 of 23 remaining) [2025-03-04 06:40:01,272 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (10 of 23 remaining) [2025-03-04 06:40:01,272 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (9 of 23 remaining) [2025-03-04 06:40:01,272 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (8 of 23 remaining) [2025-03-04 06:40:01,272 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (7 of 23 remaining) [2025-03-04 06:40:01,272 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (6 of 23 remaining) [2025-03-04 06:40:01,272 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (5 of 23 remaining) [2025-03-04 06:40:01,272 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (4 of 23 remaining) [2025-03-04 06:40:01,272 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (3 of 23 remaining) [2025-03-04 06:40:01,272 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (2 of 23 remaining) [2025-03-04 06:40:01,272 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (1 of 23 remaining) [2025-03-04 06:40:01,272 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (0 of 23 remaining) [2025-03-04 06:40:01,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:40:01,273 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-04 06:40:01,275 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:40:01,275 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 06:40:01,314 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 06:40:01,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 208 places, 215 transitions, 440 flow [2025-03-04 06:40:01,345 INFO L124 PetriNetUnfolderBase]: 12/233 cut-off events. [2025-03-04 06:40:01,345 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 06:40:01,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 241 conditions, 233 events. 12/233 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 509 event pairs, 0 based on Foata normal form. 0/196 useless extension candidates. Maximal degree in co-relation 154. Up to 3 conditions per place. [2025-03-04 06:40:01,349 INFO L82 GeneralOperation]: Start removeDead. Operand has 208 places, 215 transitions, 440 flow [2025-03-04 06:40:01,351 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 208 places, 215 transitions, 440 flow [2025-03-04 06:40:01,351 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:40:01,352 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;@47adefd7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:40:01,352 INFO L334 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2025-03-04 06:40:01,355 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:40:01,355 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2025-03-04 06:40:01,355 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:40:01,355 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:01,355 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] [2025-03-04 06:40:01,355 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-03-04 06:40:01,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:01,355 INFO L85 PathProgramCache]: Analyzing trace with hash 356875689, now seen corresponding path program 1 times [2025-03-04 06:40:01,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:01,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452200728] [2025-03-04 06:40:01,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:01,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:01,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 06:40:01,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 06:40:01,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:01,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:01,378 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,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:01,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452200728] [2025-03-04 06:40:01,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452200728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:01,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:01,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:40:01,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112929095] [2025-03-04 06:40:01,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:01,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:40:01,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:01,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:40:01,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:40:01,419 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 215 [2025-03-04 06:40:01,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 215 transitions, 440 flow. Second operand has 3 states, 3 states have (on average 187.33333333333334) internal successors, (562), 3 states have internal predecessors, (562), 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,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:01,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 215 [2025-03-04 06:40:01,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:01,521 INFO L124 PetriNetUnfolderBase]: 70/670 cut-off events. [2025-03-04 06:40:01,521 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-03-04 06:40:01,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 800 conditions, 670 events. 70/670 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3796 event pairs, 42 based on Foata normal form. 84/639 useless extension candidates. Maximal degree in co-relation 615. Up to 102 conditions per place. [2025-03-04 06:40:01,526 INFO L140 encePairwiseOnDemand]: 206/215 looper letters, 17 selfloop transitions, 2 changer transitions 1/200 dead transitions. [2025-03-04 06:40:01,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 200 transitions, 448 flow [2025-03-04 06:40:01,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:40:01,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:40:01,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 584 transitions. [2025-03-04 06:40:01,528 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9054263565891473 [2025-03-04 06:40:01,528 INFO L175 Difference]: Start difference. First operand has 208 places, 215 transitions, 440 flow. Second operand 3 states and 584 transitions. [2025-03-04 06:40:01,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 200 transitions, 448 flow [2025-03-04 06:40:01,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 200 transitions, 448 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:40:01,530 INFO L231 Difference]: Finished difference. Result has 200 places, 199 transitions, 412 flow [2025-03-04 06:40:01,530 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=412, PETRI_PLACES=200, PETRI_TRANSITIONS=199} [2025-03-04 06:40:01,531 INFO L279 CegarLoopForPetriNet]: 208 programPoint places, -8 predicate places. [2025-03-04 06:40:01,531 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 199 transitions, 412 flow [2025-03-04 06:40:01,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 187.33333333333334) internal successors, (562), 3 states have internal predecessors, (562), 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,531 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:01,531 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] [2025-03-04 06:40:01,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:40:01,532 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-03-04 06:40:01,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:01,532 INFO L85 PathProgramCache]: Analyzing trace with hash -2006252707, now seen corresponding path program 1 times [2025-03-04 06:40:01,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:01,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428168890] [2025-03-04 06:40:01,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:01,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:01,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 06:40:01,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 06:40:01,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:01,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:01,552 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,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:01,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428168890] [2025-03-04 06:40:01,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428168890] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:01,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:01,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:40:01,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645474257] [2025-03-04 06:40:01,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:01,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:40:01,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:01,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:40:01,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:40:01,596 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 215 [2025-03-04 06:40:01,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 199 transitions, 412 flow. Second operand has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 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,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:01,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 215 [2025-03-04 06:40:01,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:01,651 INFO L124 PetriNetUnfolderBase]: 42/526 cut-off events. [2025-03-04 06:40:01,652 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-03-04 06:40:01,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 608 conditions, 526 events. 42/526 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2575 event pairs, 20 based on Foata normal form. 0/437 useless extension candidates. Maximal degree in co-relation 576. Up to 57 conditions per place. [2025-03-04 06:40:01,656 INFO L140 encePairwiseOnDemand]: 212/215 looper letters, 16 selfloop transitions, 2 changer transitions 0/198 dead transitions. [2025-03-04 06:40:01,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 198 transitions, 446 flow [2025-03-04 06:40:01,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:40:01,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:40:01,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 580 transitions. [2025-03-04 06:40:01,658 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8992248062015504 [2025-03-04 06:40:01,658 INFO L175 Difference]: Start difference. First operand has 200 places, 199 transitions, 412 flow. Second operand 3 states and 580 transitions. [2025-03-04 06:40:01,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 198 transitions, 446 flow [2025-03-04 06:40:01,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 198 transitions, 442 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:40:01,661 INFO L231 Difference]: Finished difference. Result has 198 places, 198 transitions, 410 flow [2025-03-04 06:40:01,661 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=410, PETRI_PLACES=198, PETRI_TRANSITIONS=198} [2025-03-04 06:40:01,661 INFO L279 CegarLoopForPetriNet]: 208 programPoint places, -10 predicate places. [2025-03-04 06:40:01,662 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 198 transitions, 410 flow [2025-03-04 06:40:01,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 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,662 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:01,662 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] [2025-03-04 06:40:01,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:40:01,662 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-03-04 06:40:01,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:01,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1961932619, now seen corresponding path program 1 times [2025-03-04 06:40:01,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:01,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406490952] [2025-03-04 06:40:01,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:01,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:01,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 06:40:01,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 06:40:01,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:01,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:01,682 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,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:01,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406490952] [2025-03-04 06:40:01,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406490952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:01,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:01,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:40:01,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362427900] [2025-03-04 06:40:01,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:01,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:40:01,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:01,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:40:01,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:40:01,706 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 215 [2025-03-04 06:40:01,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 198 transitions, 410 flow. Second operand has 3 states, 3 states have (on average 180.0) internal successors, (540), 3 states have internal predecessors, (540), 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,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:01,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 215 [2025-03-04 06:40:01,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:01,804 INFO L124 PetriNetUnfolderBase]: 82/808 cut-off events. [2025-03-04 06:40:01,804 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-04 06:40:01,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 948 conditions, 808 events. 82/808 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 4765 event pairs, 42 based on Foata normal form. 0/686 useless extension candidates. Maximal degree in co-relation 908. Up to 109 conditions per place. [2025-03-04 06:40:01,813 INFO L140 encePairwiseOnDemand]: 207/215 looper letters, 20 selfloop transitions, 1 changer transitions 0/191 dead transitions. [2025-03-04 06:40:01,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 191 transitions, 438 flow [2025-03-04 06:40:01,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:40:01,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:40:01,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 565 transitions. [2025-03-04 06:40:01,815 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.875968992248062 [2025-03-04 06:40:01,815 INFO L175 Difference]: Start difference. First operand has 198 places, 198 transitions, 410 flow. Second operand 3 states and 565 transitions. [2025-03-04 06:40:01,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 191 transitions, 438 flow [2025-03-04 06:40:01,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 191 transitions, 434 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:40:01,817 INFO L231 Difference]: Finished difference. Result has 191 places, 191 transitions, 394 flow [2025-03-04 06:40:01,818 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=394, PETRI_PLACES=191, PETRI_TRANSITIONS=191} [2025-03-04 06:40:01,819 INFO L279 CegarLoopForPetriNet]: 208 programPoint places, -17 predicate places. [2025-03-04 06:40:01,820 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 191 transitions, 394 flow [2025-03-04 06:40:01,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 180.0) internal successors, (540), 3 states have internal predecessors, (540), 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,820 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:01,820 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] [2025-03-04 06:40:01,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:40:01,820 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-03-04 06:40:01,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:01,821 INFO L85 PathProgramCache]: Analyzing trace with hash 978818140, now seen corresponding path program 1 times [2025-03-04 06:40:01,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:01,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762076163] [2025-03-04 06:40:01,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:01,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:01,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 06:40:01,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 06:40:01,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:01,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:01,857 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,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:01,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762076163] [2025-03-04 06:40:01,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762076163] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:01,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:01,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:40:01,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384588570] [2025-03-04 06:40:01,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:01,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:40:01,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:01,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:40:01,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:40:01,878 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 215 [2025-03-04 06:40:01,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 191 transitions, 394 flow. Second operand has 3 states, 3 states have (on average 193.33333333333334) internal successors, (580), 3 states have internal predecessors, (580), 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,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:01,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 215 [2025-03-04 06:40:01,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:01,919 INFO L124 PetriNetUnfolderBase]: 31/442 cut-off events. [2025-03-04 06:40:01,919 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-04 06:40:01,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 499 conditions, 442 events. 31/442 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1851 event pairs, 12 based on Foata normal form. 0/379 useless extension candidates. Maximal degree in co-relation 459. Up to 36 conditions per place. [2025-03-04 06:40:01,922 INFO L140 encePairwiseOnDemand]: 212/215 looper letters, 11 selfloop transitions, 2 changer transitions 0/190 dead transitions. [2025-03-04 06:40:01,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 190 transitions, 418 flow [2025-03-04 06:40:01,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:40:01,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:40:01,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 590 transitions. [2025-03-04 06:40:01,925 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9147286821705426 [2025-03-04 06:40:01,925 INFO L175 Difference]: Start difference. First operand has 191 places, 191 transitions, 394 flow. Second operand 3 states and 590 transitions. [2025-03-04 06:40:01,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 190 transitions, 418 flow [2025-03-04 06:40:01,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 190 transitions, 417 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:40:01,928 INFO L231 Difference]: Finished difference. Result has 191 places, 190 transitions, 395 flow [2025-03-04 06:40:01,928 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=395, PETRI_PLACES=191, PETRI_TRANSITIONS=190} [2025-03-04 06:40:01,928 INFO L279 CegarLoopForPetriNet]: 208 programPoint places, -17 predicate places. [2025-03-04 06:40:01,929 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 190 transitions, 395 flow [2025-03-04 06:40:01,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 193.33333333333334) internal successors, (580), 3 states have internal predecessors, (580), 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,930 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:01,930 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] [2025-03-04 06:40:01,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:40:01,930 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thrErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-03-04 06:40:01,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:01,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1859491102, now seen corresponding path program 1 times [2025-03-04 06:40:01,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:01,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184514898] [2025-03-04 06:40:01,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:01,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:01,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-04 06:40:01,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 06:40:01,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:01,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:01,983 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,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:01,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184514898] [2025-03-04 06:40:01,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184514898] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:01,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:01,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:40:01,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60779270] [2025-03-04 06:40:01,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:01,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:40:01,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:01,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:40:01,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:40:02,008 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 215 [2025-03-04 06:40:02,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 190 transitions, 395 flow. Second operand has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 3 states have internal predecessors, (545), 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,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:02,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 215 [2025-03-04 06:40:02,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:02,151 INFO L124 PetriNetUnfolderBase]: 195/1595 cut-off events. [2025-03-04 06:40:02,152 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-03-04 06:40:02,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1925 conditions, 1595 events. 195/1595 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 12504 event pairs, 57 based on Foata normal form. 0/1384 useless extension candidates. Maximal degree in co-relation 1885. Up to 204 conditions per place. [2025-03-04 06:40:02,163 INFO L140 encePairwiseOnDemand]: 195/215 looper letters, 32 selfloop transitions, 14 changer transitions 0/209 dead transitions. [2025-03-04 06:40:02,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 209 transitions, 530 flow [2025-03-04 06:40:02,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:40:02,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:40:02,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 592 transitions. [2025-03-04 06:40:02,165 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9178294573643411 [2025-03-04 06:40:02,165 INFO L175 Difference]: Start difference. First operand has 191 places, 190 transitions, 395 flow. Second operand 3 states and 592 transitions. [2025-03-04 06:40:02,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 209 transitions, 530 flow [2025-03-04 06:40:02,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 209 transitions, 526 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:40:02,170 INFO L231 Difference]: Finished difference. Result has 193 places, 204 transitions, 515 flow [2025-03-04 06:40:02,170 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=515, PETRI_PLACES=193, PETRI_TRANSITIONS=204} [2025-03-04 06:40:02,172 INFO L279 CegarLoopForPetriNet]: 208 programPoint places, -15 predicate places. [2025-03-04 06:40:02,172 INFO L471 AbstractCegarLoop]: Abstraction has has 193 places, 204 transitions, 515 flow [2025-03-04 06:40:02,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 3 states have internal predecessors, (545), 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,172 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:02,172 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] [2025-03-04 06:40:02,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:40:02,173 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-03-04 06:40:02,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:02,173 INFO L85 PathProgramCache]: Analyzing trace with hash -182745099, now seen corresponding path program 1 times [2025-03-04 06:40:02,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:02,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902886044] [2025-03-04 06:40:02,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:02,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:02,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-04 06:40:02,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-04 06:40:02,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:02,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:02,269 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,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:02,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902886044] [2025-03-04 06:40:02,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902886044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:02,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:02,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:40:02,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570706930] [2025-03-04 06:40:02,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:02,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 06:40:02,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:02,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 06:40:02,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:40:02,290 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 215 [2025-03-04 06:40:02,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 204 transitions, 515 flow. Second operand has 5 states, 5 states have (on average 189.4) internal successors, (947), 5 states have internal predecessors, (947), 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,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:02,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 215 [2025-03-04 06:40:02,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:02,433 INFO L124 PetriNetUnfolderBase]: 130/1492 cut-off events. [2025-03-04 06:40:02,433 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-03-04 06:40:02,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1765 conditions, 1492 events. 130/1492 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 11585 event pairs, 41 based on Foata normal form. 1/1297 useless extension candidates. Maximal degree in co-relation 1724. Up to 120 conditions per place. [2025-03-04 06:40:02,441 INFO L140 encePairwiseOnDemand]: 211/215 looper letters, 17 selfloop transitions, 0 changer transitions 4/207 dead transitions. [2025-03-04 06:40:02,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 207 transitions, 563 flow [2025-03-04 06:40:02,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 06:40:02,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 06:40:02,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 957 transitions. [2025-03-04 06:40:02,443 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8902325581395348 [2025-03-04 06:40:02,443 INFO L175 Difference]: Start difference. First operand has 193 places, 204 transitions, 515 flow. Second operand 5 states and 957 transitions. [2025-03-04 06:40:02,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 207 transitions, 563 flow [2025-03-04 06:40:02,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 207 transitions, 535 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:40:02,447 INFO L231 Difference]: Finished difference. Result has 198 places, 203 transitions, 491 flow [2025-03-04 06:40:02,447 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=487, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=491, PETRI_PLACES=198, PETRI_TRANSITIONS=203} [2025-03-04 06:40:02,448 INFO L279 CegarLoopForPetriNet]: 208 programPoint places, -10 predicate places. [2025-03-04 06:40:02,448 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 203 transitions, 491 flow [2025-03-04 06:40:02,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 189.4) internal successors, (947), 5 states have internal predecessors, (947), 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,449 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:02,449 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] [2025-03-04 06:40:02,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:40:02,449 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-03-04 06:40:02,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:02,449 INFO L85 PathProgramCache]: Analyzing trace with hash 468078738, now seen corresponding path program 1 times [2025-03-04 06:40:02,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:02,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166232221] [2025-03-04 06:40:02,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:02,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:02,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 06:40:02,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 06:40:02,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:02,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:40:02,461 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:40:02,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 06:40:02,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 06:40:02,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:02,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:40:02,471 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:40:02,471 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:40:02,472 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 31 remaining) [2025-03-04 06:40:02,472 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (29 of 31 remaining) [2025-03-04 06:40:02,472 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (28 of 31 remaining) [2025-03-04 06:40:02,472 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (27 of 31 remaining) [2025-03-04 06:40:02,472 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (26 of 31 remaining) [2025-03-04 06:40:02,472 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (25 of 31 remaining) [2025-03-04 06:40:02,472 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (24 of 31 remaining) [2025-03-04 06:40:02,472 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (23 of 31 remaining) [2025-03-04 06:40:02,472 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (22 of 31 remaining) [2025-03-04 06:40:02,472 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (21 of 31 remaining) [2025-03-04 06:40:02,472 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (20 of 31 remaining) [2025-03-04 06:40:02,472 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (19 of 31 remaining) [2025-03-04 06:40:02,472 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (18 of 31 remaining) [2025-03-04 06:40:02,472 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (17 of 31 remaining) [2025-03-04 06:40:02,472 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (16 of 31 remaining) [2025-03-04 06:40:02,472 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (15 of 31 remaining) [2025-03-04 06:40:02,472 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (14 of 31 remaining) [2025-03-04 06:40:02,472 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (13 of 31 remaining) [2025-03-04 06:40:02,472 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (12 of 31 remaining) [2025-03-04 06:40:02,472 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (11 of 31 remaining) [2025-03-04 06:40:02,472 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (10 of 31 remaining) [2025-03-04 06:40:02,472 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (9 of 31 remaining) [2025-03-04 06:40:02,472 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (8 of 31 remaining) [2025-03-04 06:40:02,472 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (7 of 31 remaining) [2025-03-04 06:40:02,473 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (6 of 31 remaining) [2025-03-04 06:40:02,473 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (5 of 31 remaining) [2025-03-04 06:40:02,473 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (4 of 31 remaining) [2025-03-04 06:40:02,473 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (3 of 31 remaining) [2025-03-04 06:40:02,473 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (2 of 31 remaining) [2025-03-04 06:40:02,473 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (1 of 31 remaining) [2025-03-04 06:40:02,473 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (0 of 31 remaining) [2025-03-04 06:40:02,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 06:40:02,473 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:40:02,473 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:40:02,473 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-04 06:40:02,513 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 06:40:02,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 275 places, 285 transitions, 588 flow [2025-03-04 06:40:02,541 INFO L124 PetriNetUnfolderBase]: 17/313 cut-off events. [2025-03-04 06:40:02,541 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-04 06:40:02,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 326 conditions, 313 events. 17/313 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 961 event pairs, 0 based on Foata normal form. 0/262 useless extension candidates. Maximal degree in co-relation 237. Up to 4 conditions per place. [2025-03-04 06:40:02,543 INFO L82 GeneralOperation]: Start removeDead. Operand has 275 places, 285 transitions, 588 flow [2025-03-04 06:40:02,545 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 275 places, 285 transitions, 588 flow [2025-03-04 06:40:02,546 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:40:02,546 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;@47adefd7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:40:02,546 INFO L334 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2025-03-04 06:40:02,549 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:40:02,549 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2025-03-04 06:40:02,549 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:40:02,549 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:02,549 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] [2025-03-04 06:40:02,549 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-04 06:40:02,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:02,549 INFO L85 PathProgramCache]: Analyzing trace with hash -279688474, now seen corresponding path program 1 times [2025-03-04 06:40:02,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:02,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169925182] [2025-03-04 06:40:02,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:02,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:02,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 06:40:02,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 06:40:02,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:02,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:02,571 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,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:02,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169925182] [2025-03-04 06:40:02,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169925182] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:02,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:02,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:40:02,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704404200] [2025-03-04 06:40:02,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:02,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:40:02,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:02,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:40:02,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:40:02,621 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 285 [2025-03-04 06:40:02,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 285 transitions, 588 flow. Second operand has 3 states, 3 states have (on average 247.33333333333334) internal successors, (742), 3 states have internal predecessors, (742), 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,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:02,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 285 [2025-03-04 06:40:02,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:03,033 INFO L124 PetriNetUnfolderBase]: 829/4689 cut-off events. [2025-03-04 06:40:03,033 INFO L125 PetriNetUnfolderBase]: For 319/319 co-relation queries the response was YES. [2025-03-04 06:40:03,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5947 conditions, 4689 events. 829/4689 cut-off events. For 319/319 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 48233 event pairs, 630 based on Foata normal form. 685/4575 useless extension candidates. Maximal degree in co-relation 4862. Up to 1033 conditions per place. [2025-03-04 06:40:03,070 INFO L140 encePairwiseOnDemand]: 274/285 looper letters, 24 selfloop transitions, 2 changer transitions 1/266 dead transitions. [2025-03-04 06:40:03,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 266 transitions, 602 flow [2025-03-04 06:40:03,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:40:03,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:40:03,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 773 transitions. [2025-03-04 06:40:03,073 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.904093567251462 [2025-03-04 06:40:03,073 INFO L175 Difference]: Start difference. First operand has 275 places, 285 transitions, 588 flow. Second operand 3 states and 773 transitions. [2025-03-04 06:40:03,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 266 transitions, 602 flow [2025-03-04 06:40:03,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 266 transitions, 600 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-04 06:40:03,076 INFO L231 Difference]: Finished difference. Result has 265 places, 265 transitions, 550 flow [2025-03-04 06:40:03,077 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=550, PETRI_PLACES=265, PETRI_TRANSITIONS=265} [2025-03-04 06:40:03,078 INFO L279 CegarLoopForPetriNet]: 275 programPoint places, -10 predicate places. [2025-03-04 06:40:03,078 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 265 transitions, 550 flow [2025-03-04 06:40:03,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 247.33333333333334) internal successors, (742), 3 states have internal predecessors, (742), 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,078 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:03,078 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] [2025-03-04 06:40:03,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 06:40:03,079 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-04 06:40:03,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:03,079 INFO L85 PathProgramCache]: Analyzing trace with hash -821136963, now seen corresponding path program 1 times [2025-03-04 06:40:03,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:03,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825914070] [2025-03-04 06:40:03,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:03,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:03,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 06:40:03,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 06:40:03,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:03,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:03,105 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,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:03,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825914070] [2025-03-04 06:40:03,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825914070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:03,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:03,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:40:03,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4301212] [2025-03-04 06:40:03,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:03,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:40:03,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:03,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:40:03,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:40:03,145 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 285 [2025-03-04 06:40:03,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 265 transitions, 550 flow. Second operand has 3 states, 3 states have (on average 250.33333333333334) internal successors, (751), 3 states have internal predecessors, (751), 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,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:03,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 285 [2025-03-04 06:40:03,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:03,396 INFO L124 PetriNetUnfolderBase]: 335/2597 cut-off events. [2025-03-04 06:40:03,397 INFO L125 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2025-03-04 06:40:03,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3080 conditions, 2597 events. 335/2597 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 23496 event pairs, 220 based on Foata normal form. 0/2136 useless extension candidates. Maximal degree in co-relation 3047. Up to 382 conditions per place. [2025-03-04 06:40:03,421 INFO L140 encePairwiseOnDemand]: 282/285 looper letters, 21 selfloop transitions, 2 changer transitions 0/264 dead transitions. [2025-03-04 06:40:03,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 264 transitions, 594 flow [2025-03-04 06:40:03,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:40:03,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:40:03,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 771 transitions. [2025-03-04 06:40:03,434 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9017543859649123 [2025-03-04 06:40:03,434 INFO L175 Difference]: Start difference. First operand has 265 places, 265 transitions, 550 flow. Second operand 3 states and 771 transitions. [2025-03-04 06:40:03,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 264 transitions, 594 flow [2025-03-04 06:40:03,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 264 transitions, 590 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:40:03,439 INFO L231 Difference]: Finished difference. Result has 263 places, 264 transitions, 548 flow [2025-03-04 06:40:03,439 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=548, PETRI_PLACES=263, PETRI_TRANSITIONS=264} [2025-03-04 06:40:03,440 INFO L279 CegarLoopForPetriNet]: 275 programPoint places, -12 predicate places. [2025-03-04 06:40:03,440 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 264 transitions, 548 flow [2025-03-04 06:40:03,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 250.33333333333334) internal successors, (751), 3 states have internal predecessors, (751), 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,441 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:03,441 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] [2025-03-04 06:40:03,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 06:40:03,441 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-04 06:40:03,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:03,442 INFO L85 PathProgramCache]: Analyzing trace with hash -602249643, now seen corresponding path program 1 times [2025-03-04 06:40:03,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:03,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657022904] [2025-03-04 06:40:03,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:03,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:03,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 06:40:03,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 06:40:03,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:03,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:03,469 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,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:03,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657022904] [2025-03-04 06:40:03,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657022904] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:03,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:03,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:40:03,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46840809] [2025-03-04 06:40:03,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:03,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:40:03,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:03,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:40:03,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:40:03,501 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 285 [2025-03-04 06:40:03,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 264 transitions, 548 flow. Second operand has 3 states, 3 states have (on average 238.0) internal successors, (714), 3 states have internal predecessors, (714), 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,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:03,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 285 [2025-03-04 06:40:03,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:04,098 INFO L124 PetriNetUnfolderBase]: 985/6367 cut-off events. [2025-03-04 06:40:04,098 INFO L125 PetriNetUnfolderBase]: For 173/173 co-relation queries the response was YES. [2025-03-04 06:40:04,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7666 conditions, 6367 events. 985/6367 cut-off events. For 173/173 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 69337 event pairs, 630 based on Foata normal form. 0/5355 useless extension candidates. Maximal degree in co-relation 7625. Up to 1120 conditions per place. [2025-03-04 06:40:04,141 INFO L140 encePairwiseOnDemand]: 275/285 looper letters, 27 selfloop transitions, 1 changer transitions 0/255 dead transitions. [2025-03-04 06:40:04,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 255 transitions, 586 flow [2025-03-04 06:40:04,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:40:04,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:40:04,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 748 transitions. [2025-03-04 06:40:04,144 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8748538011695907 [2025-03-04 06:40:04,144 INFO L175 Difference]: Start difference. First operand has 263 places, 264 transitions, 548 flow. Second operand 3 states and 748 transitions. [2025-03-04 06:40:04,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 255 transitions, 586 flow [2025-03-04 06:40:04,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 255 transitions, 582 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:40:04,147 INFO L231 Difference]: Finished difference. Result has 254 places, 255 transitions, 528 flow [2025-03-04 06:40:04,147 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=528, PETRI_PLACES=254, PETRI_TRANSITIONS=255} [2025-03-04 06:40:04,148 INFO L279 CegarLoopForPetriNet]: 275 programPoint places, -21 predicate places. [2025-03-04 06:40:04,148 INFO L471 AbstractCegarLoop]: Abstraction has has 254 places, 255 transitions, 528 flow [2025-03-04 06:40:04,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.0) internal successors, (714), 3 states have internal predecessors, (714), 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,148 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:04,148 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] [2025-03-04 06:40:04,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 06:40:04,149 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-04 06:40:04,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:04,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1140773124, now seen corresponding path program 1 times [2025-03-04 06:40:04,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:04,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629086106] [2025-03-04 06:40:04,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:04,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:04,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 06:40:04,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 06:40:04,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:04,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:04,177 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,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:04,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629086106] [2025-03-04 06:40:04,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629086106] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:04,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:04,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:40:04,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763566007] [2025-03-04 06:40:04,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:04,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:40:04,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:04,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:40:04,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:40:04,193 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 255 out of 285 [2025-03-04 06:40:04,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 255 transitions, 528 flow. Second operand has 3 states, 3 states have (on average 256.3333333333333) internal successors, (769), 3 states have internal predecessors, (769), 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,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:04,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 255 of 285 [2025-03-04 06:40:04,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:04,317 INFO L124 PetriNetUnfolderBase]: 190/1767 cut-off events. [2025-03-04 06:40:04,317 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2025-03-04 06:40:04,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2033 conditions, 1767 events. 190/1767 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 13830 event pairs, 108 based on Foata normal form. 0/1482 useless extension candidates. Maximal degree in co-relation 1992. Up to 196 conditions per place. [2025-03-04 06:40:04,332 INFO L140 encePairwiseOnDemand]: 282/285 looper letters, 15 selfloop transitions, 2 changer transitions 0/254 dead transitions. [2025-03-04 06:40:04,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 254 transitions, 560 flow [2025-03-04 06:40:04,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:40:04,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:40:04,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 783 transitions. [2025-03-04 06:40:04,335 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9157894736842105 [2025-03-04 06:40:04,335 INFO L175 Difference]: Start difference. First operand has 254 places, 255 transitions, 528 flow. Second operand 3 states and 783 transitions. [2025-03-04 06:40:04,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 254 transitions, 560 flow [2025-03-04 06:40:04,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 254 transitions, 559 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:40:04,339 INFO L231 Difference]: Finished difference. Result has 254 places, 254 transitions, 529 flow [2025-03-04 06:40:04,340 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=525, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=529, PETRI_PLACES=254, PETRI_TRANSITIONS=254} [2025-03-04 06:40:04,340 INFO L279 CegarLoopForPetriNet]: 275 programPoint places, -21 predicate places. [2025-03-04 06:40:04,341 INFO L471 AbstractCegarLoop]: Abstraction has has 254 places, 254 transitions, 529 flow [2025-03-04 06:40:04,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 256.3333333333333) internal successors, (769), 3 states have internal predecessors, (769), 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,341 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:04,341 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] [2025-03-04 06:40:04,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 06:40:04,342 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thrErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-04 06:40:04,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:04,342 INFO L85 PathProgramCache]: Analyzing trace with hash 92832209, now seen corresponding path program 1 times [2025-03-04 06:40:04,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:04,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560553147] [2025-03-04 06:40:04,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:04,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:04,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-04 06:40:04,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 06:40:04,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:04,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:04,371 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,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:04,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560553147] [2025-03-04 06:40:04,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560553147] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:04,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:04,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:40:04,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917476783] [2025-03-04 06:40:04,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:04,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:40:04,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:04,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:40:04,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:40:04,405 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 285 [2025-03-04 06:40:04,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 254 transitions, 529 flow. Second operand has 3 states, 3 states have (on average 235.66666666666666) internal successors, (707), 3 states have internal predecessors, (707), 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,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:04,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 285 [2025-03-04 06:40:04,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:06,288 INFO L124 PetriNetUnfolderBase]: 4660/23982 cut-off events. [2025-03-04 06:40:06,289 INFO L125 PetriNetUnfolderBase]: For 466/466 co-relation queries the response was YES. [2025-03-04 06:40:06,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30441 conditions, 23982 events. 4660/23982 cut-off events. For 466/466 co-relation queries the response was YES. Maximal size of possible extension queue 725. Compared 330653 event pairs, 1667 based on Foata normal form. 0/20559 useless extension candidates. Maximal degree in co-relation 30400. Up to 4132 conditions per place. [2025-03-04 06:40:06,464 INFO L140 encePairwiseOnDemand]: 255/285 looper letters, 48 selfloop transitions, 21 changer transitions 0/283 dead transitions. [2025-03-04 06:40:06,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 283 transitions, 735 flow [2025-03-04 06:40:06,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:40:06,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:40:06,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 780 transitions. [2025-03-04 06:40:06,466 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9122807017543859 [2025-03-04 06:40:06,466 INFO L175 Difference]: Start difference. First operand has 254 places, 254 transitions, 529 flow. Second operand 3 states and 780 transitions. [2025-03-04 06:40:06,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 283 transitions, 735 flow [2025-03-04 06:40:06,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 283 transitions, 731 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:40:06,470 INFO L231 Difference]: Finished difference. Result has 256 places, 275 transitions, 711 flow [2025-03-04 06:40:06,470 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=525, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=711, PETRI_PLACES=256, PETRI_TRANSITIONS=275} [2025-03-04 06:40:06,471 INFO L279 CegarLoopForPetriNet]: 275 programPoint places, -19 predicate places. [2025-03-04 06:40:06,471 INFO L471 AbstractCegarLoop]: Abstraction has has 256 places, 275 transitions, 711 flow [2025-03-04 06:40:06,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.66666666666666) internal successors, (707), 3 states have internal predecessors, (707), 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:06,471 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:06,472 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] [2025-03-04 06:40:06,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 06:40:06,472 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-04 06:40:06,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:06,472 INFO L85 PathProgramCache]: Analyzing trace with hash -355772001, now seen corresponding path program 1 times [2025-03-04 06:40:06,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:06,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036216619] [2025-03-04 06:40:06,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:06,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:06,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-04 06:40:06,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-04 06:40:06,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:06,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:06,523 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:06,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:06,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036216619] [2025-03-04 06:40:06,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036216619] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:06,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:06,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:40:06,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580534678] [2025-03-04 06:40:06,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:06,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 06:40:06,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:06,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 06:40:06,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:40:06,538 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 285 [2025-03-04 06:40:06,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 275 transitions, 711 flow. Second operand has 5 states, 5 states have (on average 253.6) internal successors, (1268), 5 states have internal predecessors, (1268), 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:06,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:06,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 285 [2025-03-04 06:40:06,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:07,180 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([814] 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_thrThread1of3ForFork0_#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{thrThread1of3ForFork0_#t~ret6#1=|v_thrThread1of3ForFork0_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#lock~0.offset=|v_~#lock~0.offset_15|, ~#lock~0.base=|v_~#lock~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread1of3ForFork0_#t~ret6#1][89], [171#L1045true, 124#L1045true, Black: 292#(= |#race~next~0| 0), 241#thrENTRYtrue, 286#(= |#race~len~0| 0), 276#true, 274#true, 290#true, 272#true, 295#true, 119#L1060-1true]) [2025-03-04 06:40:07,181 INFO L294 olderBase$Statistics]: this new event has 119 ancestors and is cut-off event [2025-03-04 06:40:07,181 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2025-03-04 06:40:07,181 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2025-03-04 06:40:07,181 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2025-03-04 06:40:07,463 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([814] 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_thrThread1of3ForFork0_#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{thrThread1of3ForFork0_#t~ret6#1=|v_thrThread1of3ForFork0_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#lock~0.offset=|v_~#lock~0.offset_15|, ~#lock~0.base=|v_~#lock~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread1of3ForFork0_#t~ret6#1][89], [171#L1045true, 124#L1045true, Black: 292#(= |#race~next~0| 0), 286#(= |#race~len~0| 0), 276#true, 274#true, 259#L1040true, 290#true, 272#true, 295#true, 119#L1060-1true]) [2025-03-04 06:40:07,463 INFO L294 olderBase$Statistics]: this new event has 125 ancestors and is cut-off event [2025-03-04 06:40:07,463 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-03-04 06:40:07,463 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2025-03-04 06:40:07,463 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2025-03-04 06:40:07,766 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([883] 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][161], [171#L1045true, 225#L1043true, Black: 290#true, 292#(= |#race~next~0| 0), 286#(= |#race~len~0| 0), 276#true, 274#true, 272#true, 68#L1045true, 295#true, 119#L1060-1true]) [2025-03-04 06:40:07,766 INFO L294 olderBase$Statistics]: this new event has 129 ancestors and is cut-off event [2025-03-04 06:40:07,766 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2025-03-04 06:40:07,766 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2025-03-04 06:40:07,766 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2025-03-04 06:40:07,803 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([952] 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][119], [171#L1045true, 124#L1045true, Black: 292#(= |#race~next~0| 0), 276#true, 274#true, 286#(= |#race~len~0| 0), 290#true, 272#true, 68#L1045true, 295#true, 119#L1060-1true]) [2025-03-04 06:40:07,804 INFO L294 olderBase$Statistics]: this new event has 132 ancestors and is cut-off event [2025-03-04 06:40:07,804 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-03-04 06:40:07,804 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-03-04 06:40:07,804 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-03-04 06:40:08,233 INFO L124 PetriNetUnfolderBase]: 2516/17384 cut-off events. [2025-03-04 06:40:08,233 INFO L125 PetriNetUnfolderBase]: For 565/565 co-relation queries the response was YES. [2025-03-04 06:40:08,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21905 conditions, 17384 events. 2516/17384 cut-off events. For 565/565 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 237586 event pairs, 1056 based on Foata normal form. 1/15063 useless extension candidates. Maximal degree in co-relation 21863. Up to 2203 conditions per place. [2025-03-04 06:40:08,412 INFO L140 encePairwiseOnDemand]: 281/285 looper letters, 20 selfloop transitions, 0 changer transitions 4/278 dead transitions. [2025-03-04 06:40:08,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 278 transitions, 765 flow [2025-03-04 06:40:08,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 06:40:08,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 06:40:08,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1280 transitions. [2025-03-04 06:40:08,418 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8982456140350877 [2025-03-04 06:40:08,418 INFO L175 Difference]: Start difference. First operand has 256 places, 275 transitions, 711 flow. Second operand 5 states and 1280 transitions. [2025-03-04 06:40:08,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 278 transitions, 765 flow [2025-03-04 06:40:08,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 278 transitions, 723 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:40:08,445 INFO L231 Difference]: Finished difference. Result has 261 places, 274 transitions, 673 flow [2025-03-04 06:40:08,446 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=669, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=673, PETRI_PLACES=261, PETRI_TRANSITIONS=274} [2025-03-04 06:40:08,446 INFO L279 CegarLoopForPetriNet]: 275 programPoint places, -14 predicate places. [2025-03-04 06:40:08,446 INFO L471 AbstractCegarLoop]: Abstraction has has 261 places, 274 transitions, 673 flow [2025-03-04 06:40:08,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 253.6) internal successors, (1268), 5 states have internal predecessors, (1268), 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,447 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:08,447 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] [2025-03-04 06:40:08,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 06:40:08,447 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-04 06:40:08,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:08,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1540855367, now seen corresponding path program 1 times [2025-03-04 06:40:08,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:08,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410434281] [2025-03-04 06:40:08,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:08,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:08,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 06:40:08,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 06:40:08,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:08,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:40:08,462 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:40:08,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 06:40:08,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 06:40:08,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:08,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:40:08,477 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:40:08,478 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:40:08,478 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 39 remaining) [2025-03-04 06:40:08,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (37 of 39 remaining) [2025-03-04 06:40:08,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (36 of 39 remaining) [2025-03-04 06:40:08,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (35 of 39 remaining) [2025-03-04 06:40:08,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (34 of 39 remaining) [2025-03-04 06:40:08,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (33 of 39 remaining) [2025-03-04 06:40:08,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (32 of 39 remaining) [2025-03-04 06:40:08,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (31 of 39 remaining) [2025-03-04 06:40:08,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (30 of 39 remaining) [2025-03-04 06:40:08,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (29 of 39 remaining) [2025-03-04 06:40:08,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (28 of 39 remaining) [2025-03-04 06:40:08,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (27 of 39 remaining) [2025-03-04 06:40:08,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (26 of 39 remaining) [2025-03-04 06:40:08,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (25 of 39 remaining) [2025-03-04 06:40:08,480 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (24 of 39 remaining) [2025-03-04 06:40:08,480 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (23 of 39 remaining) [2025-03-04 06:40:08,480 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (22 of 39 remaining) [2025-03-04 06:40:08,480 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (21 of 39 remaining) [2025-03-04 06:40:08,480 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (20 of 39 remaining) [2025-03-04 06:40:08,480 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (19 of 39 remaining) [2025-03-04 06:40:08,480 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (18 of 39 remaining) [2025-03-04 06:40:08,480 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (17 of 39 remaining) [2025-03-04 06:40:08,480 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (16 of 39 remaining) [2025-03-04 06:40:08,480 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (15 of 39 remaining) [2025-03-04 06:40:08,480 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (14 of 39 remaining) [2025-03-04 06:40:08,480 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (13 of 39 remaining) [2025-03-04 06:40:08,480 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (12 of 39 remaining) [2025-03-04 06:40:08,480 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (11 of 39 remaining) [2025-03-04 06:40:08,481 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (10 of 39 remaining) [2025-03-04 06:40:08,481 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (9 of 39 remaining) [2025-03-04 06:40:08,481 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (8 of 39 remaining) [2025-03-04 06:40:08,481 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr7ASSERT_VIOLATIONDATA_RACE (7 of 39 remaining) [2025-03-04 06:40:08,481 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr6ASSERT_VIOLATIONDATA_RACE (6 of 39 remaining) [2025-03-04 06:40:08,481 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (5 of 39 remaining) [2025-03-04 06:40:08,481 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (4 of 39 remaining) [2025-03-04 06:40:08,481 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (3 of 39 remaining) [2025-03-04 06:40:08,481 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (2 of 39 remaining) [2025-03-04 06:40:08,481 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (1 of 39 remaining) [2025-03-04 06:40:08,481 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (0 of 39 remaining) [2025-03-04 06:40:08,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 06:40:08,481 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:40:08,482 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:40:08,482 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-04 06:40:08,525 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 06:40:08,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 342 places, 355 transitions, 738 flow [2025-03-04 06:40:08,572 INFO L124 PetriNetUnfolderBase]: 22/393 cut-off events. [2025-03-04 06:40:08,572 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-04 06:40:08,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 412 conditions, 393 events. 22/393 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1429 event pairs, 0 based on Foata normal form. 0/328 useless extension candidates. Maximal degree in co-relation 321. Up to 5 conditions per place. [2025-03-04 06:40:08,577 INFO L82 GeneralOperation]: Start removeDead. Operand has 342 places, 355 transitions, 738 flow [2025-03-04 06:40:08,580 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 342 places, 355 transitions, 738 flow [2025-03-04 06:40:08,581 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:40:08,582 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;@47adefd7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:40:08,582 INFO L334 AbstractCegarLoop]: Starting to check reachability of 47 error locations. [2025-03-04 06:40:08,584 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:40:08,584 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2025-03-04 06:40:08,584 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:40:08,584 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:08,584 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] [2025-03-04 06:40:08,584 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-03-04 06:40:08,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:08,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1790709801, now seen corresponding path program 1 times [2025-03-04 06:40:08,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:08,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456724902] [2025-03-04 06:40:08,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:08,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:08,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 06:40:08,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 06:40:08,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:08,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:08,602 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,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:08,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456724902] [2025-03-04 06:40:08,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456724902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:08,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:08,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:40:08,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961421627] [2025-03-04 06:40:08,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:08,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:40:08,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:08,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:40:08,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:40:08,662 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 355 [2025-03-04 06:40:08,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 355 transitions, 738 flow. Second operand has 3 states, 3 states have (on average 307.3333333333333) internal successors, (922), 3 states have internal predecessors, (922), 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,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:08,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 355 [2025-03-04 06:40:08,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:11,959 INFO L124 PetriNetUnfolderBase]: 8203/34874 cut-off events. [2025-03-04 06:40:11,959 INFO L125 PetriNetUnfolderBase]: For 3752/3752 co-relation queries the response was YES. [2025-03-04 06:40:12,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46423 conditions, 34874 events. 8203/34874 cut-off events. For 3752/3752 co-relation queries the response was YES. Maximal size of possible extension queue 1148. Compared 484657 event pairs, 6804 based on Foata normal form. 5566/34841 useless extension candidates. Maximal degree in co-relation 38089. Up to 9608 conditions per place. [2025-03-04 06:40:12,355 INFO L140 encePairwiseOnDemand]: 342/355 looper letters, 31 selfloop transitions, 2 changer transitions 1/332 dead transitions. [2025-03-04 06:40:12,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 332 transitions, 758 flow [2025-03-04 06:40:12,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:40:12,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:40:12,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 962 transitions. [2025-03-04 06:40:12,358 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9032863849765258 [2025-03-04 06:40:12,358 INFO L175 Difference]: Start difference. First operand has 342 places, 355 transitions, 738 flow. Second operand 3 states and 962 transitions. [2025-03-04 06:40:12,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 332 transitions, 758 flow [2025-03-04 06:40:12,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 332 transitions, 752 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-04 06:40:12,363 INFO L231 Difference]: Finished difference. Result has 330 places, 331 transitions, 688 flow [2025-03-04 06:40:12,363 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=328, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=688, PETRI_PLACES=330, PETRI_TRANSITIONS=331} [2025-03-04 06:40:12,363 INFO L279 CegarLoopForPetriNet]: 342 programPoint places, -12 predicate places. [2025-03-04 06:40:12,363 INFO L471 AbstractCegarLoop]: Abstraction has has 330 places, 331 transitions, 688 flow [2025-03-04 06:40:12,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 307.3333333333333) internal successors, (922), 3 states have internal predecessors, (922), 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,364 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:12,364 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] [2025-03-04 06:40:12,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 06:40:12,364 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-03-04 06:40:12,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:12,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1182511965, now seen corresponding path program 1 times [2025-03-04 06:40:12,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:12,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572298585] [2025-03-04 06:40:12,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:12,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:12,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 06:40:12,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 06:40:12,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:12,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:12,381 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,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:12,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572298585] [2025-03-04 06:40:12,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572298585] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:12,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:12,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:40:12,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587885377] [2025-03-04 06:40:12,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:12,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:40:12,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:12,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:40:12,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:40:12,420 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 311 out of 355 [2025-03-04 06:40:12,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 331 transitions, 688 flow. Second operand has 3 states, 3 states have (on average 312.3333333333333) internal successors, (937), 3 states have internal predecessors, (937), 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,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:12,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 311 of 355 [2025-03-04 06:40:12,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:13,954 INFO L124 PetriNetUnfolderBase]: 2303/13468 cut-off events. [2025-03-04 06:40:13,955 INFO L125 PetriNetUnfolderBase]: For 472/472 co-relation queries the response was YES. [2025-03-04 06:40:14,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16452 conditions, 13468 events. 2303/13468 cut-off events. For 472/472 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 168630 event pairs, 1720 based on Foata normal form. 0/11135 useless extension candidates. Maximal degree in co-relation 16418. Up to 2507 conditions per place. [2025-03-04 06:40:14,101 INFO L140 encePairwiseOnDemand]: 352/355 looper letters, 26 selfloop transitions, 2 changer transitions 0/330 dead transitions. [2025-03-04 06:40:14,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 330 transitions, 742 flow [2025-03-04 06:40:14,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:40:14,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:40:14,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 962 transitions. [2025-03-04 06:40:14,104 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9032863849765258 [2025-03-04 06:40:14,104 INFO L175 Difference]: Start difference. First operand has 330 places, 331 transitions, 688 flow. Second operand 3 states and 962 transitions. [2025-03-04 06:40:14,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 330 transitions, 742 flow [2025-03-04 06:40:14,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 330 transitions, 738 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:40:14,107 INFO L231 Difference]: Finished difference. Result has 328 places, 330 transitions, 686 flow [2025-03-04 06:40:14,108 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=686, PETRI_PLACES=328, PETRI_TRANSITIONS=330} [2025-03-04 06:40:14,108 INFO L279 CegarLoopForPetriNet]: 342 programPoint places, -14 predicate places. [2025-03-04 06:40:14,108 INFO L471 AbstractCegarLoop]: Abstraction has has 328 places, 330 transitions, 686 flow [2025-03-04 06:40:14,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 312.3333333333333) internal successors, (937), 3 states have internal predecessors, (937), 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:14,109 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:14,109 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] [2025-03-04 06:40:14,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 06:40:14,109 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-03-04 06:40:14,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:14,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1920243893, now seen corresponding path program 1 times [2025-03-04 06:40:14,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:14,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53091607] [2025-03-04 06:40:14,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:14,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:14,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 06:40:14,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 06:40:14,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:14,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:14,124 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:14,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:14,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53091607] [2025-03-04 06:40:14,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53091607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:14,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:14,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:40:14,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621402548] [2025-03-04 06:40:14,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:14,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:40:14,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:14,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:40:14,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:40:14,155 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 355 [2025-03-04 06:40:14,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 330 transitions, 686 flow. Second operand has 3 states, 3 states have (on average 296.0) internal successors, (888), 3 states have internal predecessors, (888), 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:14,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:14,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 355 [2025-03-04 06:40:14,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:19,388 INFO L124 PetriNetUnfolderBase]: 9761/49199 cut-off events. [2025-03-04 06:40:19,389 INFO L125 PetriNetUnfolderBase]: For 1205/1205 co-relation queries the response was YES. [2025-03-04 06:40:19,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61006 conditions, 49199 events. 9761/49199 cut-off events. For 1205/1205 co-relation queries the response was YES. Maximal size of possible extension queue 1284. Compared 737369 event pairs, 6804 based on Foata normal form. 0/41396 useless extension candidates. Maximal degree in co-relation 60964. Up to 10598 conditions per place. [2025-03-04 06:40:20,090 INFO L140 encePairwiseOnDemand]: 343/355 looper letters, 34 selfloop transitions, 1 changer transitions 0/319 dead transitions. [2025-03-04 06:40:20,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 319 transitions, 734 flow [2025-03-04 06:40:20,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:40:20,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:40:20,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 931 transitions. [2025-03-04 06:40:20,093 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8741784037558685 [2025-03-04 06:40:20,093 INFO L175 Difference]: Start difference. First operand has 328 places, 330 transitions, 686 flow. Second operand 3 states and 931 transitions. [2025-03-04 06:40:20,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 319 transitions, 734 flow [2025-03-04 06:40:20,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 319 transitions, 730 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:40:20,097 INFO L231 Difference]: Finished difference. Result has 317 places, 319 transitions, 662 flow [2025-03-04 06:40:20,097 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=660, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=662, PETRI_PLACES=317, PETRI_TRANSITIONS=319} [2025-03-04 06:40:20,098 INFO L279 CegarLoopForPetriNet]: 342 programPoint places, -25 predicate places. [2025-03-04 06:40:20,098 INFO L471 AbstractCegarLoop]: Abstraction has has 317 places, 319 transitions, 662 flow [2025-03-04 06:40:20,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 296.0) internal successors, (888), 3 states have internal predecessors, (888), 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,098 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:20,098 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] [2025-03-04 06:40:20,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 06:40:20,098 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-03-04 06:40:20,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:20,099 INFO L85 PathProgramCache]: Analyzing trace with hash -2047908772, now seen corresponding path program 1 times [2025-03-04 06:40:20,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:20,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087659013] [2025-03-04 06:40:20,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:20,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:20,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 06:40:20,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 06:40:20,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:20,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:20,123 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,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:20,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087659013] [2025-03-04 06:40:20,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087659013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:20,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:20,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:40:20,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87483218] [2025-03-04 06:40:20,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:20,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:40:20,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:20,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:40:20,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:40:20,144 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 355 [2025-03-04 06:40:20,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 319 transitions, 662 flow. Second operand has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 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,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:20,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 355 [2025-03-04 06:40:20,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:40:20,750 INFO L124 PetriNetUnfolderBase]: 1021/7284 cut-off events. [2025-03-04 06:40:20,750 INFO L125 PetriNetUnfolderBase]: For 259/259 co-relation queries the response was YES. [2025-03-04 06:40:20,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8575 conditions, 7284 events. 1021/7284 cut-off events. For 259/259 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 80143 event pairs, 684 based on Foata normal form. 0/6099 useless extension candidates. Maximal degree in co-relation 8533. Up to 1028 conditions per place. [2025-03-04 06:40:20,861 INFO L140 encePairwiseOnDemand]: 352/355 looper letters, 19 selfloop transitions, 2 changer transitions 0/318 dead transitions. [2025-03-04 06:40:20,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 318 transitions, 702 flow [2025-03-04 06:40:20,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:40:20,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:40:20,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 976 transitions. [2025-03-04 06:40:20,864 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9164319248826291 [2025-03-04 06:40:20,864 INFO L175 Difference]: Start difference. First operand has 317 places, 319 transitions, 662 flow. Second operand 3 states and 976 transitions. [2025-03-04 06:40:20,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 318 transitions, 702 flow [2025-03-04 06:40:20,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 318 transitions, 701 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:40:20,868 INFO L231 Difference]: Finished difference. Result has 317 places, 318 transitions, 663 flow [2025-03-04 06:40:20,868 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=659, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=663, PETRI_PLACES=317, PETRI_TRANSITIONS=318} [2025-03-04 06:40:20,869 INFO L279 CegarLoopForPetriNet]: 342 programPoint places, -25 predicate places. [2025-03-04 06:40:20,869 INFO L471 AbstractCegarLoop]: Abstraction has has 317 places, 318 transitions, 663 flow [2025-03-04 06:40:20,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 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,869 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:40:20,869 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] [2025-03-04 06:40:20,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 06:40:20,870 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thrErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 44 more)] === [2025-03-04 06:40:20,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:40:20,870 INFO L85 PathProgramCache]: Analyzing trace with hash -259623793, now seen corresponding path program 1 times [2025-03-04 06:40:20,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:40:20,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775391210] [2025-03-04 06:40:20,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:40:20,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:40:20,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-04 06:40:20,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 06:40:20,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:40:20,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:40:20,894 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,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:40:20,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775391210] [2025-03-04 06:40:20,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775391210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:40:20,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:40:20,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:40:20,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280206811] [2025-03-04 06:40:20,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:40:20,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:40:20,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:40:20,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:40:20,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:40:20,942 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 288 out of 355 [2025-03-04 06:40:20,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 318 transitions, 663 flow. Second operand has 3 states, 3 states have (on average 289.6666666666667) internal successors, (869), 3 states have internal predecessors, (869), 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,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:40:20,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 288 of 355 [2025-03-04 06:40:20,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand