./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race-4.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-race-challenges/thread-join-counter-outer-race-4.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 cc2bc8e2b738274330116922d0213f314e2f92c105156edd0131038d71009ecb --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:00:54,137 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:00:54,191 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 07:00:54,196 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:00:54,198 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:00:54,219 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:00:54,220 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:00:54,220 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:00:54,220 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:00:54,220 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:00:54,221 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:00:54,221 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:00:54,221 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:00:54,221 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:00:54,221 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 07:00:54,221 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:00:54,221 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:00:54,221 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:00:54,221 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:00:54,222 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 07:00:54,222 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:00:54,222 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 07:00:54,222 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 07:00:54,222 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:00:54,222 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:00:54,222 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 07:00:54,222 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:00:54,222 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:00:54,222 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:00:54,222 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:00:54,223 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:00:54,223 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:00:54,223 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:00:54,223 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:00:54,223 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 07:00:54,223 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 07:00:54,223 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:00:54,223 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:00:54,223 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:00:54,223 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:00:54,224 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:00:54,224 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:00:54,224 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 -> cc2bc8e2b738274330116922d0213f314e2f92c105156edd0131038d71009ecb [2025-03-04 07:00:54,484 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:00:54,490 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:00:54,491 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:00:54,492 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:00:54,493 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:00:54,494 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race-4.i [2025-03-04 07:00:55,619 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f36819c98/3cf735c9d42d4cc79813b66dc3da4c0e/FLAG9846af2b4 [2025-03-04 07:00:55,900 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:00:55,901 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race-4.i [2025-03-04 07:00:55,913 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f36819c98/3cf735c9d42d4cc79813b66dc3da4c0e/FLAG9846af2b4 [2025-03-04 07:00:56,182 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f36819c98/3cf735c9d42d4cc79813b66dc3da4c0e [2025-03-04 07:00:56,184 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:00:56,185 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:00:56,186 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:00:56,186 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:00:56,189 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:00:56,189 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:00:56" (1/1) ... [2025-03-04 07:00:56,190 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@413dff3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:00:56, skipping insertion in model container [2025-03-04 07:00:56,190 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:00:56" (1/1) ... [2025-03-04 07:00:56,208 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:00:56,409 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:00:56,427 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:00:56,466 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:00:56,501 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:00:56,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:00:56 WrapperNode [2025-03-04 07:00:56,501 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:00:56,502 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:00:56,502 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:00:56,502 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:00:56,507 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:00:56" (1/1) ... [2025-03-04 07:00:56,515 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:00:56" (1/1) ... [2025-03-04 07:00:56,531 INFO L138 Inliner]: procedures = 159, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 194 [2025-03-04 07:00:56,532 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:00:56,532 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:00:56,532 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:00:56,532 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:00:56,537 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:00:56" (1/1) ... [2025-03-04 07:00:56,537 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:00:56" (1/1) ... [2025-03-04 07:00:56,539 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:00:56" (1/1) ... [2025-03-04 07:00:56,539 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:00:56" (1/1) ... [2025-03-04 07:00:56,547 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:00:56" (1/1) ... [2025-03-04 07:00:56,550 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:00:56" (1/1) ... [2025-03-04 07:00:56,551 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:00:56" (1/1) ... [2025-03-04 07:00:56,551 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:00:56" (1/1) ... [2025-03-04 07:00:56,554 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:00:56,555 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:00:56,555 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:00:56,555 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:00:56,556 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:00:56" (1/1) ... [2025-03-04 07:00:56,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:00:56,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:00:56,578 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 07:00:56,579 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 07:00:56,594 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 07:00:56,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 07:00:56,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 07:00:56,594 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-03-04 07:00:56,595 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-03-04 07:00:56,595 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 07:00:56,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:00:56,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:00:56,596 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 07:00:56,698 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:00:56,700 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:00:56,953 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 07:00:56,954 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:00:56,978 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:00:56,979 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:00:56,979 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:00:56 BoogieIcfgContainer [2025-03-04 07:00:56,979 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:00:56,981 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:00:56,981 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:00:56,984 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:00:56,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:00:56" (1/3) ... [2025-03-04 07:00:56,985 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dc72153 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:00:56, skipping insertion in model container [2025-03-04 07:00:56,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:00:56" (2/3) ... [2025-03-04 07:00:56,985 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dc72153 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:00:56, skipping insertion in model container [2025-03-04 07:00:56,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:00:56" (3/3) ... [2025-03-04 07:00:56,986 INFO L128 eAbstractionObserver]: Analyzing ICFG thread-join-counter-outer-race-4.i [2025-03-04 07:00:56,999 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:00:57,000 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG thread-join-counter-outer-race-4.i that has 2 procedures, 228 locations, 1 initial locations, 2 loop locations, and 7 error locations. [2025-03-04 07:00:57,000 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 07:00:57,059 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 07:00:57,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 231 places, 231 transitions, 466 flow [2025-03-04 07:00:57,167 INFO L124 PetriNetUnfolderBase]: 5/272 cut-off events. [2025-03-04 07:00:57,169 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 07:00:57,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 276 conditions, 272 events. 5/272 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 239 event pairs, 0 based on Foata normal form. 0/254 useless extension candidates. Maximal degree in co-relation 192. Up to 4 conditions per place. [2025-03-04 07:00:57,172 INFO L82 GeneralOperation]: Start removeDead. Operand has 231 places, 231 transitions, 466 flow [2025-03-04 07:00:57,178 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 231 places, 231 transitions, 466 flow [2025-03-04 07:00:57,183 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:00:57,192 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;@2b379585, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:00:57,193 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-03-04 07:00:57,247 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 07:00:57,247 INFO L124 PetriNetUnfolderBase]: 1/160 cut-off events. [2025-03-04 07:00:57,247 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 07:00:57,248 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:00:57,248 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:00:57,248 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-04 07:00:57,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:00:57,256 INFO L85 PathProgramCache]: Analyzing trace with hash 2002374581, now seen corresponding path program 1 times [2025-03-04 07:00:57,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:00:57,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036929080] [2025-03-04 07:00:57,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:00:57,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:00:57,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-04 07:00:57,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-04 07:00:57,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:00:57,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:00:57,589 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 07:00:57,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:00:57,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036929080] [2025-03-04 07:00:57,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036929080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:00:57,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:00:57,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:00:57,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018613414] [2025-03-04 07:00:57,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:00:57,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:00:57,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:00:57,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:00:57,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:00:57,640 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 231 [2025-03-04 07:00:57,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 231 transitions, 466 flow. Second operand has 3 states, 3 states have (on average 208.0) internal successors, (624), 3 states have internal predecessors, (624), 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 07:00:57,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 07:00:57,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 231 [2025-03-04 07:00:57,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 07:00:57,793 INFO L124 PetriNetUnfolderBase]: 98/684 cut-off events. [2025-03-04 07:00:57,793 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 07:00:57,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 918 conditions, 684 events. 98/684 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3145 event pairs, 33 based on Foata normal form. 1/629 useless extension candidates. Maximal degree in co-relation 707. Up to 138 conditions per place. [2025-03-04 07:00:57,822 INFO L140 encePairwiseOnDemand]: 218/231 looper letters, 32 selfloop transitions, 8 changer transitions 1/247 dead transitions. [2025-03-04 07:00:57,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 247 transitions, 578 flow [2025-03-04 07:00:57,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:00:57,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 07:00:57,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 667 transitions. [2025-03-04 07:00:57,840 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9624819624819625 [2025-03-04 07:00:57,843 INFO L175 Difference]: Start difference. First operand has 231 places, 231 transitions, 466 flow. Second operand 3 states and 667 transitions. [2025-03-04 07:00:57,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 247 transitions, 578 flow [2025-03-04 07:00:57,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 247 transitions, 578 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 07:00:57,855 INFO L231 Difference]: Finished difference. Result has 235 places, 236 transitions, 530 flow [2025-03-04 07:00:57,857 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=530, PETRI_PLACES=235, PETRI_TRANSITIONS=236} [2025-03-04 07:00:57,862 INFO L279 CegarLoopForPetriNet]: 231 programPoint places, 4 predicate places. [2025-03-04 07:00:57,862 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 236 transitions, 530 flow [2025-03-04 07:00:57,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 208.0) internal successors, (624), 3 states have internal predecessors, (624), 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 07:00:57,863 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:00:57,863 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:00:57,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 07:00:57,864 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-04 07:00:57,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:00:57,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1075873601, now seen corresponding path program 1 times [2025-03-04 07:00:57,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:00:57,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707301618] [2025-03-04 07:00:57,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:00:57,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:00:57,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-04 07:00:57,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-04 07:00:57,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:00:57,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:00:58,021 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 07:00:58,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:00:58,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707301618] [2025-03-04 07:00:58,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707301618] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:00:58,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:00:58,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:00:58,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530510317] [2025-03-04 07:00:58,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:00:58,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:00:58,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:00:58,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:00:58,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:00:58,045 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 231 [2025-03-04 07:00:58,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 236 transitions, 530 flow. Second operand has 3 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 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 07:00:58,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 07:00:58,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 231 [2025-03-04 07:00:58,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 07:00:58,177 INFO L124 PetriNetUnfolderBase]: 114/812 cut-off events. [2025-03-04 07:00:58,177 INFO L125 PetriNetUnfolderBase]: For 164/171 co-relation queries the response was YES. [2025-03-04 07:00:58,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1248 conditions, 812 events. 114/812 cut-off events. For 164/171 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 4228 event pairs, 72 based on Foata normal form. 5/762 useless extension candidates. Maximal degree in co-relation 1025. Up to 226 conditions per place. [2025-03-04 07:00:58,183 INFO L140 encePairwiseOnDemand]: 225/231 looper letters, 29 selfloop transitions, 7 changer transitions 0/245 dead transitions. [2025-03-04 07:00:58,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 245 transitions, 630 flow [2025-03-04 07:00:58,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:00:58,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 07:00:58,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 652 transitions. [2025-03-04 07:00:58,186 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9408369408369408 [2025-03-04 07:00:58,186 INFO L175 Difference]: Start difference. First operand has 235 places, 236 transitions, 530 flow. Second operand 3 states and 652 transitions. [2025-03-04 07:00:58,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 245 transitions, 630 flow [2025-03-04 07:00:58,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 245 transitions, 610 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 07:00:58,193 INFO L231 Difference]: Finished difference. Result has 236 places, 241 transitions, 570 flow [2025-03-04 07:00:58,195 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=570, PETRI_PLACES=236, PETRI_TRANSITIONS=241} [2025-03-04 07:00:58,197 INFO L279 CegarLoopForPetriNet]: 231 programPoint places, 5 predicate places. [2025-03-04 07:00:58,198 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 241 transitions, 570 flow [2025-03-04 07:00:58,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 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 07:00:58,199 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:00:58,199 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:00:58,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 07:00:58,199 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-04 07:00:58,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:00:58,200 INFO L85 PathProgramCache]: Analyzing trace with hash 2033324350, now seen corresponding path program 1 times [2025-03-04 07:00:58,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:00:58,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001110482] [2025-03-04 07:00:58,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:00:58,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:00:58,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-04 07:00:58,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-04 07:00:58,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:00:58,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:00:58,295 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 07:00:58,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:00:58,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001110482] [2025-03-04 07:00:58,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001110482] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:00:58,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:00:58,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:00:58,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332954633] [2025-03-04 07:00:58,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:00:58,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:00:58,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:00:58,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:00:58,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:00:58,311 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 231 [2025-03-04 07:00:58,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 241 transitions, 570 flow. Second operand has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 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 07:00:58,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 07:00:58,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 231 [2025-03-04 07:00:58,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 07:00:58,423 INFO L124 PetriNetUnfolderBase]: 83/734 cut-off events. [2025-03-04 07:00:58,423 INFO L125 PetriNetUnfolderBase]: For 64/67 co-relation queries the response was YES. [2025-03-04 07:00:58,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1056 conditions, 734 events. 83/734 cut-off events. For 64/67 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3732 event pairs, 45 based on Foata normal form. 0/674 useless extension candidates. Maximal degree in co-relation 838. Up to 114 conditions per place. [2025-03-04 07:00:58,426 INFO L140 encePairwiseOnDemand]: 227/231 looper letters, 17 selfloop transitions, 3 changer transitions 1/247 dead transitions. [2025-03-04 07:00:58,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 247 transitions, 624 flow [2025-03-04 07:00:58,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:00:58,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 07:00:58,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 664 transitions. [2025-03-04 07:00:58,428 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9581529581529582 [2025-03-04 07:00:58,428 INFO L175 Difference]: Start difference. First operand has 236 places, 241 transitions, 570 flow. Second operand 3 states and 664 transitions. [2025-03-04 07:00:58,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 247 transitions, 624 flow [2025-03-04 07:00:58,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 247 transitions, 610 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 07:00:58,433 INFO L231 Difference]: Finished difference. Result has 238 places, 243 transitions, 578 flow [2025-03-04 07:00:58,433 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=578, PETRI_PLACES=238, PETRI_TRANSITIONS=243} [2025-03-04 07:00:58,433 INFO L279 CegarLoopForPetriNet]: 231 programPoint places, 7 predicate places. [2025-03-04 07:00:58,433 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 243 transitions, 578 flow [2025-03-04 07:00:58,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 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 07:00:58,434 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:00:58,434 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:00:58,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 07:00:58,434 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-04 07:00:58,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:00:58,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1645553511, now seen corresponding path program 1 times [2025-03-04 07:00:58,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:00:58,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558589416] [2025-03-04 07:00:58,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:00:58,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:00:58,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-04 07:00:58,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-04 07:00:58,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:00:58,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:00:58,531 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 07:00:58,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:00:58,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558589416] [2025-03-04 07:00:58,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558589416] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:00:58,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:00:58,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:00:58,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931755977] [2025-03-04 07:00:58,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:00:58,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:00:58,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:00:58,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:00:58,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:00:58,544 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 231 [2025-03-04 07:00:58,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 243 transitions, 578 flow. Second operand has 3 states, 3 states have (on average 214.33333333333334) internal successors, (643), 3 states have internal predecessors, (643), 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 07:00:58,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 07:00:58,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 231 [2025-03-04 07:00:58,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 07:00:58,670 INFO L124 PetriNetUnfolderBase]: 92/747 cut-off events. [2025-03-04 07:00:58,670 INFO L125 PetriNetUnfolderBase]: For 73/77 co-relation queries the response was YES. [2025-03-04 07:00:58,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1123 conditions, 747 events. 92/747 cut-off events. For 73/77 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3937 event pairs, 54 based on Foata normal form. 0/698 useless extension candidates. Maximal degree in co-relation 914. Up to 141 conditions per place. [2025-03-04 07:00:58,673 INFO L140 encePairwiseOnDemand]: 226/231 looper letters, 22 selfloop transitions, 5 changer transitions 0/252 dead transitions. [2025-03-04 07:00:58,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 252 transitions, 654 flow [2025-03-04 07:00:58,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:00:58,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 07:00:58,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 663 transitions. [2025-03-04 07:00:58,678 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9567099567099567 [2025-03-04 07:00:58,678 INFO L175 Difference]: Start difference. First operand has 238 places, 243 transitions, 578 flow. Second operand 3 states and 663 transitions. [2025-03-04 07:00:58,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 252 transitions, 654 flow [2025-03-04 07:00:58,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 252 transitions, 646 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 07:00:58,684 INFO L231 Difference]: Finished difference. Result has 240 places, 246 transitions, 608 flow [2025-03-04 07:00:58,685 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=608, PETRI_PLACES=240, PETRI_TRANSITIONS=246} [2025-03-04 07:00:58,685 INFO L279 CegarLoopForPetriNet]: 231 programPoint places, 9 predicate places. [2025-03-04 07:00:58,686 INFO L471 AbstractCegarLoop]: Abstraction has has 240 places, 246 transitions, 608 flow [2025-03-04 07:00:58,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 214.33333333333334) internal successors, (643), 3 states have internal predecessors, (643), 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 07:00:58,687 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:00:58,687 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:00:58,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 07:00:58,687 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-04 07:00:58,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:00:58,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1880517101, now seen corresponding path program 1 times [2025-03-04 07:00:58,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:00:58,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435663101] [2025-03-04 07:00:58,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:00:58,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:00:58,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-04 07:00:58,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-04 07:00:58,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:00:58,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:00:58,798 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 07:00:58,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:00:58,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435663101] [2025-03-04 07:00:58,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435663101] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:00:58,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:00:58,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:00:58,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990477056] [2025-03-04 07:00:58,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:00:58,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:00:58,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:00:58,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:00:58,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:00:58,827 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 231 [2025-03-04 07:00:58,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 246 transitions, 608 flow. Second operand has 3 states, 3 states have (on average 213.0) internal successors, (639), 3 states have internal predecessors, (639), 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 07:00:58,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 07:00:58,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 231 [2025-03-04 07:00:58,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 07:00:58,937 INFO L124 PetriNetUnfolderBase]: 159/927 cut-off events. [2025-03-04 07:00:58,938 INFO L125 PetriNetUnfolderBase]: For 211/217 co-relation queries the response was YES. [2025-03-04 07:00:58,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1610 conditions, 927 events. 159/927 cut-off events. For 211/217 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 5130 event pairs, 73 based on Foata normal form. 0/881 useless extension candidates. Maximal degree in co-relation 1385. Up to 275 conditions per place. [2025-03-04 07:00:58,942 INFO L140 encePairwiseOnDemand]: 224/231 looper letters, 29 selfloop transitions, 11 changer transitions 4/259 dead transitions. [2025-03-04 07:00:58,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 259 transitions, 730 flow [2025-03-04 07:00:58,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:00:58,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 07:00:58,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 659 transitions. [2025-03-04 07:00:58,944 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.950937950937951 [2025-03-04 07:00:58,944 INFO L175 Difference]: Start difference. First operand has 240 places, 246 transitions, 608 flow. Second operand 3 states and 659 transitions. [2025-03-04 07:00:58,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 259 transitions, 730 flow [2025-03-04 07:00:58,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 259 transitions, 720 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 07:00:58,949 INFO L231 Difference]: Finished difference. Result has 242 places, 250 transitions, 674 flow [2025-03-04 07:00:58,950 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=674, PETRI_PLACES=242, PETRI_TRANSITIONS=250} [2025-03-04 07:00:58,950 INFO L279 CegarLoopForPetriNet]: 231 programPoint places, 11 predicate places. [2025-03-04 07:00:58,951 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 250 transitions, 674 flow [2025-03-04 07:00:58,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.0) internal successors, (639), 3 states have internal predecessors, (639), 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 07:00:58,953 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:00:58,953 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:00:58,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 07:00:58,953 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-04 07:00:58,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:00:58,954 INFO L85 PathProgramCache]: Analyzing trace with hash 2131184810, now seen corresponding path program 1 times [2025-03-04 07:00:58,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:00:58,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8888826] [2025-03-04 07:00:58,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:00:58,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:00:58,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-04 07:00:58,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-04 07:00:58,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:00:58,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 07:00:58,994 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 07:00:59,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-04 07:00:59,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-04 07:00:59,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:00:59,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 07:00:59,092 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 07:00:59,092 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 07:00:59,093 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-03-04 07:00:59,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2025-03-04 07:00:59,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2025-03-04 07:00:59,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2025-03-04 07:00:59,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2025-03-04 07:00:59,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2025-03-04 07:00:59,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2025-03-04 07:00:59,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2025-03-04 07:00:59,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2025-03-04 07:00:59,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2025-03-04 07:00:59,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2025-03-04 07:00:59,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 07:00:59,095 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-04 07:00:59,098 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 07:00:59,098 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 07:00:59,125 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 07:00:59,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 263 places, 261 transitions, 532 flow [2025-03-04 07:00:59,158 INFO L124 PetriNetUnfolderBase]: 7/351 cut-off events. [2025-03-04 07:00:59,158 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 07:00:59,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 359 conditions, 351 events. 7/351 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 410 event pairs, 0 based on Foata normal form. 0/323 useless extension candidates. Maximal degree in co-relation 273. Up to 6 conditions per place. [2025-03-04 07:00:59,159 INFO L82 GeneralOperation]: Start removeDead. Operand has 263 places, 261 transitions, 532 flow [2025-03-04 07:00:59,161 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 263 places, 261 transitions, 532 flow [2025-03-04 07:00:59,161 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:00:59,162 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;@2b379585, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:00:59,162 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-03-04 07:00:59,175 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 07:00:59,178 INFO L124 PetriNetUnfolderBase]: 1/160 cut-off events. [2025-03-04 07:00:59,178 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 07:00:59,178 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:00:59,178 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:00:59,178 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-04 07:00:59,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:00:59,179 INFO L85 PathProgramCache]: Analyzing trace with hash -970362923, now seen corresponding path program 1 times [2025-03-04 07:00:59,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:00:59,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370677687] [2025-03-04 07:00:59,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:00:59,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:00:59,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-04 07:00:59,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-04 07:00:59,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:00:59,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:00:59,236 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 07:00:59,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:00:59,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370677687] [2025-03-04 07:00:59,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370677687] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:00:59,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:00:59,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:00:59,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275719804] [2025-03-04 07:00:59,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:00:59,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:00:59,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:00:59,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:00:59,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:00:59,258 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 261 [2025-03-04 07:00:59,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 261 transitions, 532 flow. Second operand has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 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 07:00:59,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 07:00:59,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 261 [2025-03-04 07:00:59,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 07:00:59,992 INFO L124 PetriNetUnfolderBase]: 2216/6761 cut-off events. [2025-03-04 07:00:59,993 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-03-04 07:01:00,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10465 conditions, 6761 events. 2216/6761 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 63719 event pairs, 879 based on Foata normal form. 1/6057 useless extension candidates. Maximal degree in co-relation 8872. Up to 2089 conditions per place. [2025-03-04 07:01:00,031 INFO L140 encePairwiseOnDemand]: 244/261 looper letters, 46 selfloop transitions, 11 changer transitions 1/285 dead transitions. [2025-03-04 07:01:00,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 285 transitions, 699 flow [2025-03-04 07:01:00,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:01:00,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 07:01:00,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 748 transitions. [2025-03-04 07:01:00,033 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9553001277139208 [2025-03-04 07:01:00,033 INFO L175 Difference]: Start difference. First operand has 263 places, 261 transitions, 532 flow. Second operand 3 states and 748 transitions. [2025-03-04 07:01:00,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 285 transitions, 699 flow [2025-03-04 07:01:00,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 285 transitions, 699 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 07:01:00,036 INFO L231 Difference]: Finished difference. Result has 267 places, 269 transitions, 622 flow [2025-03-04 07:01:00,037 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=622, PETRI_PLACES=267, PETRI_TRANSITIONS=269} [2025-03-04 07:01:00,039 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 4 predicate places. [2025-03-04 07:01:00,039 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 269 transitions, 622 flow [2025-03-04 07:01:00,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 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 07:01:00,039 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:01:00,040 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:01:00,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 07:01:00,040 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-04 07:01:00,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:01:00,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1488487324, now seen corresponding path program 1 times [2025-03-04 07:01:00,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:01:00,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834931282] [2025-03-04 07:01:00,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:01:00,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:01:00,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-04 07:01:00,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-04 07:01:00,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:01:00,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:01:00,098 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 07:01:00,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:01:00,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834931282] [2025-03-04 07:01:00,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834931282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:01:00,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:01:00,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:01:00,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750720164] [2025-03-04 07:01:00,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:01:00,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:01:00,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:01:00,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:01:00,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:01:00,131 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 261 [2025-03-04 07:01:00,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 269 transitions, 622 flow. Second operand has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 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 07:01:00,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 07:01:00,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 261 [2025-03-04 07:01:00,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 07:01:01,194 INFO L124 PetriNetUnfolderBase]: 2480/8562 cut-off events. [2025-03-04 07:01:01,195 INFO L125 PetriNetUnfolderBase]: For 2802/2998 co-relation queries the response was YES. [2025-03-04 07:01:01,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15328 conditions, 8562 events. 2480/8562 cut-off events. For 2802/2998 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 87738 event pairs, 1597 based on Foata normal form. 70/7873 useless extension candidates. Maximal degree in co-relation 13171. Up to 3442 conditions per place. [2025-03-04 07:01:01,241 INFO L140 encePairwiseOnDemand]: 253/261 looper letters, 42 selfloop transitions, 12 changer transitions 0/287 dead transitions. [2025-03-04 07:01:01,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 287 transitions, 790 flow [2025-03-04 07:01:01,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:01:01,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 07:01:01,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 734 transitions. [2025-03-04 07:01:01,243 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9374201787994891 [2025-03-04 07:01:01,247 INFO L175 Difference]: Start difference. First operand has 267 places, 269 transitions, 622 flow. Second operand 3 states and 734 transitions. [2025-03-04 07:01:01,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 287 transitions, 790 flow [2025-03-04 07:01:01,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 287 transitions, 760 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 07:01:01,258 INFO L231 Difference]: Finished difference. Result has 268 places, 279 transitions, 706 flow [2025-03-04 07:01:01,258 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=600, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=706, PETRI_PLACES=268, PETRI_TRANSITIONS=279} [2025-03-04 07:01:01,259 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 5 predicate places. [2025-03-04 07:01:01,259 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 279 transitions, 706 flow [2025-03-04 07:01:01,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 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 07:01:01,259 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:01:01,259 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:01:01,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 07:01:01,260 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-04 07:01:01,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:01:01,261 INFO L85 PathProgramCache]: Analyzing trace with hash 2127201086, now seen corresponding path program 1 times [2025-03-04 07:01:01,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:01:01,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313546508] [2025-03-04 07:01:01,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:01:01,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:01:01,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-04 07:01:01,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-04 07:01:01,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:01:01,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:01:01,327 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 07:01:01,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:01:01,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313546508] [2025-03-04 07:01:01,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313546508] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:01:01,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:01:01,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:01:01,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692814438] [2025-03-04 07:01:01,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:01:01,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:01:01,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:01:01,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:01:01,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:01:01,337 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 261 [2025-03-04 07:01:01,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 279 transitions, 706 flow. Second operand has 3 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 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 07:01:01,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 07:01:01,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 261 [2025-03-04 07:01:01,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 07:01:02,154 INFO L124 PetriNetUnfolderBase]: 1878/7688 cut-off events. [2025-03-04 07:01:02,154 INFO L125 PetriNetUnfolderBase]: For 1100/1917 co-relation queries the response was YES. [2025-03-04 07:01:02,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12618 conditions, 7688 events. 1878/7688 cut-off events. For 1100/1917 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 82677 event pairs, 1092 based on Foata normal form. 7/6759 useless extension candidates. Maximal degree in co-relation 10919. Up to 1725 conditions per place. [2025-03-04 07:01:02,190 INFO L140 encePairwiseOnDemand]: 256/261 looper letters, 28 selfloop transitions, 4 changer transitions 0/290 dead transitions. [2025-03-04 07:01:02,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 290 transitions, 792 flow [2025-03-04 07:01:02,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:01:02,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 07:01:02,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 747 transitions. [2025-03-04 07:01:02,192 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9540229885057471 [2025-03-04 07:01:02,193 INFO L175 Difference]: Start difference. First operand has 268 places, 279 transitions, 706 flow. Second operand 3 states and 747 transitions. [2025-03-04 07:01:02,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 290 transitions, 792 flow [2025-03-04 07:01:02,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 290 transitions, 768 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 07:01:02,205 INFO L231 Difference]: Finished difference. Result has 270 places, 282 transitions, 712 flow [2025-03-04 07:01:02,206 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=712, PETRI_PLACES=270, PETRI_TRANSITIONS=282} [2025-03-04 07:01:02,206 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 7 predicate places. [2025-03-04 07:01:02,207 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 282 transitions, 712 flow [2025-03-04 07:01:02,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 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 07:01:02,207 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:01:02,207 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:01:02,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 07:01:02,208 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-04 07:01:02,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:01:02,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1438465553, now seen corresponding path program 1 times [2025-03-04 07:01:02,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:01:02,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718914069] [2025-03-04 07:01:02,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:01:02,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:01:02,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-04 07:01:02,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-04 07:01:02,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:01:02,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:01:02,277 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 07:01:02,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:01:02,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718914069] [2025-03-04 07:01:02,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718914069] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:01:02,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:01:02,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:01:02,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509987182] [2025-03-04 07:01:02,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:01:02,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:01:02,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:01:02,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:01:02,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:01:02,292 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 261 [2025-03-04 07:01:02,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 282 transitions, 712 flow. Second operand has 3 states, 3 states have (on average 238.33333333333334) internal successors, (715), 3 states have internal predecessors, (715), 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 07:01:02,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 07:01:02,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 261 [2025-03-04 07:01:02,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 07:01:03,572 INFO L124 PetriNetUnfolderBase]: 2430/9836 cut-off events. [2025-03-04 07:01:03,573 INFO L125 PetriNetUnfolderBase]: For 1611/2578 co-relation queries the response was YES. [2025-03-04 07:01:03,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16531 conditions, 9836 events. 2430/9836 cut-off events. For 1611/2578 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 113054 event pairs, 1418 based on Foata normal form. 11/8675 useless extension candidates. Maximal degree in co-relation 14739. Up to 2447 conditions per place. [2025-03-04 07:01:03,611 INFO L140 encePairwiseOnDemand]: 255/261 looper letters, 34 selfloop transitions, 7 changer transitions 0/298 dead transitions. [2025-03-04 07:01:03,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 298 transitions, 841 flow [2025-03-04 07:01:03,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:01:03,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 07:01:03,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 747 transitions. [2025-03-04 07:01:03,613 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9540229885057471 [2025-03-04 07:01:03,613 INFO L175 Difference]: Start difference. First operand has 270 places, 282 transitions, 712 flow. Second operand 3 states and 747 transitions. [2025-03-04 07:01:03,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 298 transitions, 841 flow [2025-03-04 07:01:03,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 298 transitions, 829 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 07:01:03,621 INFO L231 Difference]: Finished difference. Result has 272 places, 287 transitions, 760 flow [2025-03-04 07:01:03,621 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=760, PETRI_PLACES=272, PETRI_TRANSITIONS=287} [2025-03-04 07:01:03,622 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 9 predicate places. [2025-03-04 07:01:03,622 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 287 transitions, 760 flow [2025-03-04 07:01:03,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.33333333333334) internal successors, (715), 3 states have internal predecessors, (715), 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 07:01:03,623 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:01:03,623 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:01:03,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 07:01:03,623 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-04 07:01:03,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:01:03,624 INFO L85 PathProgramCache]: Analyzing trace with hash -440638411, now seen corresponding path program 1 times [2025-03-04 07:01:03,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:01:03,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234628593] [2025-03-04 07:01:03,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:01:03,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:01:03,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-04 07:01:03,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-04 07:01:03,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:01:03,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:01:03,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 07:01:03,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:01:03,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234628593] [2025-03-04 07:01:03,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234628593] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:01:03,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:01:03,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:01:03,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600388560] [2025-03-04 07:01:03,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:01:03,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:01:03,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:01:03,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:01:03,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:01:03,705 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 261 [2025-03-04 07:01:03,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 287 transitions, 760 flow. Second operand has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 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 07:01:03,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 07:01:03,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 261 [2025-03-04 07:01:03,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 07:01:04,649 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([697] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][270], [281#true, 116#L695-1true, Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 61#L712-2true, 262#true, 224#L695-5true, Black: 278#(= |#race~data~0| 0), 286#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 264#true, Black: 266#true]) [2025-03-04 07:01:04,649 INFO L294 olderBase$Statistics]: this new event has 251 ancestors and is cut-off event [2025-03-04 07:01:04,649 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2025-03-04 07:01:04,650 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2025-03-04 07:01:04,650 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2025-03-04 07:01:04,744 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([697] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][171], [281#true, 260#L697-3true, Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 61#L712-2true, 262#true, 224#L695-5true, Black: 278#(= |#race~data~0| 0), 286#true, 264#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 266#true]) [2025-03-04 07:01:04,744 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event [2025-03-04 07:01:04,744 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2025-03-04 07:01:04,745 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2025-03-04 07:01:04,745 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-03-04 07:01:04,915 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([697] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][171], [281#true, 40#L697true, Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 61#L712-2true, 262#true, 224#L695-5true, Black: 278#(= |#race~data~0| 0), 286#true, 264#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 266#true]) [2025-03-04 07:01:04,915 INFO L294 olderBase$Statistics]: this new event has 253 ancestors and is cut-off event [2025-03-04 07:01:04,915 INFO L297 olderBase$Statistics]: existing Event has 248 ancestors and is cut-off event [2025-03-04 07:01:04,915 INFO L297 olderBase$Statistics]: existing Event has 248 ancestors and is cut-off event [2025-03-04 07:01:04,915 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-03-04 07:01:05,016 INFO L124 PetriNetUnfolderBase]: 4089/13244 cut-off events. [2025-03-04 07:01:05,016 INFO L125 PetriNetUnfolderBase]: For 5487/5811 co-relation queries the response was YES. [2025-03-04 07:01:05,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25628 conditions, 13244 events. 4089/13244 cut-off events. For 5487/5811 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 146268 event pairs, 2075 based on Foata normal form. 79/11927 useless extension candidates. Maximal degree in co-relation 21564. Up to 5204 conditions per place. [2025-03-04 07:01:05,065 INFO L140 encePairwiseOnDemand]: 252/261 looper letters, 49 selfloop transitions, 19 changer transitions 0/313 dead transitions. [2025-03-04 07:01:05,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 313 transitions, 997 flow [2025-03-04 07:01:05,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:01:05,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 07:01:05,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 742 transitions. [2025-03-04 07:01:05,067 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9476372924648787 [2025-03-04 07:01:05,067 INFO L175 Difference]: Start difference. First operand has 272 places, 287 transitions, 760 flow. Second operand 3 states and 742 transitions. [2025-03-04 07:01:05,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 313 transitions, 997 flow [2025-03-04 07:01:05,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 313 transitions, 983 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 07:01:05,072 INFO L231 Difference]: Finished difference. Result has 274 places, 302 transitions, 928 flow [2025-03-04 07:01:05,073 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=928, PETRI_PLACES=274, PETRI_TRANSITIONS=302} [2025-03-04 07:01:05,074 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 11 predicate places. [2025-03-04 07:01:05,074 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 302 transitions, 928 flow [2025-03-04 07:01:05,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 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 07:01:05,074 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:01:05,075 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:01:05,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 07:01:05,075 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-04 07:01:05,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:01:05,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1266672474, now seen corresponding path program 1 times [2025-03-04 07:01:05,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:01:05,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542211194] [2025-03-04 07:01:05,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:01:05,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:01:05,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-04 07:01:05,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-04 07:01:05,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:01:05,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:01:05,312 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 07:01:05,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:01:05,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542211194] [2025-03-04 07:01:05,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542211194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:01:05,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:01:05,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:01:05,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481796691] [2025-03-04 07:01:05,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:01:05,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:01:05,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:01:05,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:01:05,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:01:05,336 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 261 [2025-03-04 07:01:05,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 302 transitions, 928 flow. Second operand has 5 states, 5 states have (on average 235.4) internal successors, (1177), 5 states have internal predecessors, (1177), 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 07:01:05,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 07:01:05,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 261 [2025-03-04 07:01:05,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 07:01:06,457 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([759] L705-3-->L705-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet10#1_5| |v_#race~threads_alive~0_6|) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_5|} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_5|, #race~threads_alive~0=|v_#race~threads_alive~0_6|} AuxVars[] AssignedVars[#race~threads_alive~0][273], [60#L705-1true, 116#L695-1true, Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 271#true, 291#true, 224#L695-5true, 262#true, Black: 278#(= |#race~data~0| 0), 286#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 268#(= |#race~threads_alive~0| 0), 264#true]) [2025-03-04 07:01:06,458 INFO L294 olderBase$Statistics]: this new event has 250 ancestors and is cut-off event [2025-03-04 07:01:06,458 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-03-04 07:01:06,458 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-03-04 07:01:06,458 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-03-04 07:01:06,487 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([697] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][276], [116#L695-1true, Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 61#L712-2true, 291#true, 262#true, 224#L695-5true, Black: 278#(= |#race~data~0| 0), 286#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 264#true, Black: 266#true]) [2025-03-04 07:01:06,487 INFO L294 olderBase$Statistics]: this new event has 251 ancestors and is cut-off event [2025-03-04 07:01:06,487 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2025-03-04 07:01:06,487 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2025-03-04 07:01:06,487 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2025-03-04 07:01:06,555 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([697] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][276], [Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), 116#L695-1true, Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 291#true, 61#L712-2true, 224#L695-5true, 262#true, Black: 278#(= |#race~data~0| 0), 286#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 264#true, Black: 266#true]) [2025-03-04 07:01:06,555 INFO L294 olderBase$Statistics]: this new event has 251 ancestors and is cut-off event [2025-03-04 07:01:06,555 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2025-03-04 07:01:06,556 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2025-03-04 07:01:06,556 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2025-03-04 07:01:06,556 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2025-03-04 07:01:06,562 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([697] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][276], [116#L695-1true, Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 61#L712-2true, 291#true, 224#L695-5true, 262#true, Black: 278#(= |#race~data~0| 0), 286#true, 264#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 266#true]) [2025-03-04 07:01:06,563 INFO L294 olderBase$Statistics]: this new event has 251 ancestors and is cut-off event [2025-03-04 07:01:06,563 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2025-03-04 07:01:06,563 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2025-03-04 07:01:06,563 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2025-03-04 07:01:06,563 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2025-03-04 07:01:06,563 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2025-03-04 07:01:06,621 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([697] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][216], [260#L697-3true, Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 291#true, 61#L712-2true, 224#L695-5true, 262#true, Black: 278#(= |#race~data~0| 0), 286#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 264#true, Black: 266#true]) [2025-03-04 07:01:06,621 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event [2025-03-04 07:01:06,621 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-03-04 07:01:06,621 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2025-03-04 07:01:06,621 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2025-03-04 07:01:06,632 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([697] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][276], [116#L695-1true, Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 291#true, 61#L712-2true, 262#true, Black: 278#(= |#race~data~0| 0), 286#true, 6#L695-4true, 264#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 266#true]) [2025-03-04 07:01:06,632 INFO L294 olderBase$Statistics]: this new event has 250 ancestors and is cut-off event [2025-03-04 07:01:06,632 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-03-04 07:01:06,632 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is cut-off event [2025-03-04 07:01:06,632 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2025-03-04 07:01:06,756 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([697] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][216], [260#L697-3true, Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 291#true, 61#L712-2true, 262#true, 224#L695-5true, Black: 278#(= |#race~data~0| 0), 286#true, 264#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 266#true]) [2025-03-04 07:01:06,756 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event [2025-03-04 07:01:06,756 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-03-04 07:01:06,756 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2025-03-04 07:01:06,756 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2025-03-04 07:01:06,756 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-03-04 07:01:06,770 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([697] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][216], [Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 61#L712-2true, 291#true, 262#true, 224#L695-5true, Black: 278#(= |#race~data~0| 0), 286#true, 257#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, 264#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 266#true]) [2025-03-04 07:01:06,770 INFO L294 olderBase$Statistics]: this new event has 251 ancestors and is cut-off event [2025-03-04 07:01:06,770 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2025-03-04 07:01:06,770 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2025-03-04 07:01:06,770 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2025-03-04 07:01:06,776 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([810] L695-5-->L695-3: Formula: (= v_~threads_alive~0_7 (+ v_~threads_alive~0_6 2)) InVars {~threads_alive~0=v_~threads_alive~0_7} OutVars{~threads_alive~0=v_~threads_alive~0_6} AuxVars[] AssignedVars[~threads_alive~0][290], [Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 291#true, 262#true, Black: 278#(= |#race~data~0| 0), 28#L695-3true, 286#true, 234#L706true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 264#true, 219#L695-3true, Black: 266#true]) [2025-03-04 07:01:06,776 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event [2025-03-04 07:01:06,777 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-03-04 07:01:06,777 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-03-04 07:01:06,777 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-03-04 07:01:06,829 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([697] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][216], [40#L697true, Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 61#L712-2true, 291#true, 262#true, 224#L695-5true, Black: 278#(= |#race~data~0| 0), 286#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 264#true, Black: 266#true]) [2025-03-04 07:01:06,829 INFO L294 olderBase$Statistics]: this new event has 253 ancestors and is cut-off event [2025-03-04 07:01:06,829 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-03-04 07:01:06,829 INFO L297 olderBase$Statistics]: existing Event has 248 ancestors and is cut-off event [2025-03-04 07:01:06,829 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2025-03-04 07:01:06,841 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([783] L695-2-->L695: Formula: (= |v_#race~threads_alive~0_12| |v_threadThread1of2ForFork0_#t~nondet5_3|) InVars {threadThread1of2ForFork0_#t~nondet5=|v_threadThread1of2ForFork0_#t~nondet5_3|} OutVars{threadThread1of2ForFork0_#t~nondet5=|v_threadThread1of2ForFork0_#t~nondet5_3|, #race~threads_alive~0=|v_#race~threads_alive~0_12|} AuxVars[] AssignedVars[#race~threads_alive~0][222], [Black: 286#true, Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), 291#true, 262#true, 224#L695-5true, Black: 278#(= |#race~data~0| 0), 238#L706-3true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 264#true, Black: 268#(= |#race~threads_alive~0| 0), 217#L695true]) [2025-03-04 07:01:06,841 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is not cut-off event [2025-03-04 07:01:06,841 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is not cut-off event [2025-03-04 07:01:06,841 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is not cut-off event [2025-03-04 07:01:06,841 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is not cut-off event [2025-03-04 07:01:07,293 INFO L124 PetriNetUnfolderBase]: 4737/15801 cut-off events. [2025-03-04 07:01:07,293 INFO L125 PetriNetUnfolderBase]: For 6550/7131 co-relation queries the response was YES. [2025-03-04 07:01:07,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31067 conditions, 15801 events. 4737/15801 cut-off events. For 6550/7131 co-relation queries the response was YES. Maximal size of possible extension queue 629. Compared 184732 event pairs, 1712 based on Foata normal form. 71/14046 useless extension candidates. Maximal degree in co-relation 16596. Up to 4209 conditions per place. [2025-03-04 07:01:07,391 INFO L140 encePairwiseOnDemand]: 253/261 looper letters, 45 selfloop transitions, 9 changer transitions 2/332 dead transitions. [2025-03-04 07:01:07,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 332 transitions, 1100 flow [2025-03-04 07:01:07,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:01:07,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 07:01:07,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1456 transitions. [2025-03-04 07:01:07,402 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.929757343550447 [2025-03-04 07:01:07,402 INFO L175 Difference]: Start difference. First operand has 274 places, 302 transitions, 928 flow. Second operand 6 states and 1456 transitions. [2025-03-04 07:01:07,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 332 transitions, 1100 flow [2025-03-04 07:01:07,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 332 transitions, 1062 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 07:01:07,448 INFO L231 Difference]: Finished difference. Result has 279 places, 309 transitions, 941 flow [2025-03-04 07:01:07,448 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=890, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=941, PETRI_PLACES=279, PETRI_TRANSITIONS=309} [2025-03-04 07:01:07,449 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 16 predicate places. [2025-03-04 07:01:07,450 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 309 transitions, 941 flow [2025-03-04 07:01:07,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 235.4) internal successors, (1177), 5 states have internal predecessors, (1177), 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 07:01:07,451 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:01:07,451 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:01:07,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 07:01:07,451 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-04 07:01:07,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:01:07,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1080948329, now seen corresponding path program 1 times [2025-03-04 07:01:07,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:01:07,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811888453] [2025-03-04 07:01:07,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:01:07,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:01:07,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-04 07:01:07,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-04 07:01:07,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:01:07,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:01:07,806 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 07:01:07,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:01:07,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811888453] [2025-03-04 07:01:07,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811888453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:01:07,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:01:07,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:01:07,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612759210] [2025-03-04 07:01:07,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:01:07,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:01:07,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:01:07,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:01:07,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:01:07,875 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 261 [2025-03-04 07:01:07,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 309 transitions, 941 flow. Second operand has 6 states, 6 states have (on average 242.5) internal successors, (1455), 6 states have internal predecessors, (1455), 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 07:01:07,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 07:01:07,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 261 [2025-03-04 07:01:07,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 07:01:08,251 INFO L124 PetriNetUnfolderBase]: 321/2651 cut-off events. [2025-03-04 07:01:08,251 INFO L125 PetriNetUnfolderBase]: For 665/701 co-relation queries the response was YES. [2025-03-04 07:01:08,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4680 conditions, 2651 events. 321/2651 cut-off events. For 665/701 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 22715 event pairs, 119 based on Foata normal form. 86/2586 useless extension candidates. Maximal degree in co-relation 4104. Up to 283 conditions per place. [2025-03-04 07:01:08,263 INFO L140 encePairwiseOnDemand]: 249/261 looper letters, 11 selfloop transitions, 12 changer transitions 0/275 dead transitions. [2025-03-04 07:01:08,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 275 transitions, 762 flow [2025-03-04 07:01:08,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:01:08,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 07:01:08,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1233 transitions. [2025-03-04 07:01:08,266 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9448275862068966 [2025-03-04 07:01:08,266 INFO L175 Difference]: Start difference. First operand has 279 places, 309 transitions, 941 flow. Second operand 5 states and 1233 transitions. [2025-03-04 07:01:08,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 275 transitions, 762 flow [2025-03-04 07:01:08,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 275 transitions, 716 flow, removed 19 selfloop flow, removed 4 redundant places. [2025-03-04 07:01:08,274 INFO L231 Difference]: Finished difference. Result has 273 places, 270 transitions, 679 flow [2025-03-04 07:01:08,274 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=655, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=679, PETRI_PLACES=273, PETRI_TRANSITIONS=270} [2025-03-04 07:01:08,275 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 10 predicate places. [2025-03-04 07:01:08,275 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 270 transitions, 679 flow [2025-03-04 07:01:08,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 242.5) internal successors, (1455), 6 states have internal predecessors, (1455), 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 07:01:08,276 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:01:08,276 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:01:08,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 07:01:08,276 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-04 07:01:08,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:01:08,278 INFO L85 PathProgramCache]: Analyzing trace with hash 2088305739, now seen corresponding path program 1 times [2025-03-04 07:01:08,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:01:08,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451753981] [2025-03-04 07:01:08,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:01:08,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:01:08,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-04 07:01:08,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-04 07:01:08,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:01:08,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:01:08,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:01:08,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:01:08,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451753981] [2025-03-04 07:01:08,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451753981] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:01:08,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:01:08,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:01:08,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069031479] [2025-03-04 07:01:08,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:01:08,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:01:08,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:01:08,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:01:08,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:01:08,355 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 261 [2025-03-04 07:01:08,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 270 transitions, 679 flow. Second operand has 3 states, 3 states have (on average 238.66666666666666) internal successors, (716), 3 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:01:08,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 07:01:08,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 261 [2025-03-04 07:01:08,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 07:01:08,759 INFO L124 PetriNetUnfolderBase]: 1083/4561 cut-off events. [2025-03-04 07:01:08,760 INFO L125 PetriNetUnfolderBase]: For 1586/1598 co-relation queries the response was YES. [2025-03-04 07:01:08,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8766 conditions, 4561 events. 1083/4561 cut-off events. For 1586/1598 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 43897 event pairs, 573 based on Foata normal form. 0/4268 useless extension candidates. Maximal degree in co-relation 8187. Up to 1492 conditions per place. [2025-03-04 07:01:08,783 INFO L140 encePairwiseOnDemand]: 255/261 looper letters, 34 selfloop transitions, 10 changer transitions 0/286 dead transitions. [2025-03-04 07:01:08,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 286 transitions, 831 flow [2025-03-04 07:01:08,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:01:08,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 07:01:08,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 746 transitions. [2025-03-04 07:01:08,785 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9527458492975734 [2025-03-04 07:01:08,785 INFO L175 Difference]: Start difference. First operand has 273 places, 270 transitions, 679 flow. Second operand 3 states and 746 transitions. [2025-03-04 07:01:08,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 286 transitions, 831 flow [2025-03-04 07:01:08,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 286 transitions, 810 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 07:01:08,791 INFO L231 Difference]: Finished difference. Result has 274 places, 276 transitions, 748 flow [2025-03-04 07:01:08,791 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=666, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=748, PETRI_PLACES=274, PETRI_TRANSITIONS=276} [2025-03-04 07:01:08,792 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 11 predicate places. [2025-03-04 07:01:08,792 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 276 transitions, 748 flow [2025-03-04 07:01:08,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.66666666666666) internal successors, (716), 3 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:01:08,792 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:01:08,792 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:01:08,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 07:01:08,793 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-04 07:01:08,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:01:08,793 INFO L85 PathProgramCache]: Analyzing trace with hash 197914418, now seen corresponding path program 1 times [2025-03-04 07:01:08,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:01:08,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237745667] [2025-03-04 07:01:08,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:01:08,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:01:08,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-04 07:01:08,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-04 07:01:08,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:01:08,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:01:08,933 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 07:01:08,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:01:08,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237745667] [2025-03-04 07:01:08,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237745667] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:01:08,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:01:08,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:01:08,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632749331] [2025-03-04 07:01:08,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:01:08,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:01:08,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:01:08,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:01:08,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:01:08,942 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 261 [2025-03-04 07:01:08,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 276 transitions, 748 flow. Second operand has 3 states, 3 states have (on average 244.33333333333334) internal successors, (733), 3 states have internal predecessors, (733), 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 07:01:08,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 07:01:08,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 261 [2025-03-04 07:01:08,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 07:01:09,379 INFO L124 PetriNetUnfolderBase]: 646/4598 cut-off events. [2025-03-04 07:01:09,379 INFO L125 PetriNetUnfolderBase]: For 1815/1986 co-relation queries the response was YES. [2025-03-04 07:01:09,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8372 conditions, 4598 events. 646/4598 cut-off events. For 1815/1986 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 48718 event pairs, 112 based on Foata normal form. 15/4399 useless extension candidates. Maximal degree in co-relation 7189. Up to 698 conditions per place. [2025-03-04 07:01:09,402 INFO L140 encePairwiseOnDemand]: 252/261 looper letters, 21 selfloop transitions, 9 changer transitions 0/289 dead transitions. [2025-03-04 07:01:09,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 289 transitions, 849 flow [2025-03-04 07:01:09,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:01:09,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 07:01:09,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 758 transitions. [2025-03-04 07:01:09,404 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9680715197956578 [2025-03-04 07:01:09,404 INFO L175 Difference]: Start difference. First operand has 274 places, 276 transitions, 748 flow. Second operand 3 states and 758 transitions. [2025-03-04 07:01:09,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 289 transitions, 849 flow [2025-03-04 07:01:09,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 289 transitions, 829 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 07:01:09,411 INFO L231 Difference]: Finished difference. Result has 275 places, 283 transitions, 788 flow [2025-03-04 07:01:09,412 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=788, PETRI_PLACES=275, PETRI_TRANSITIONS=283} [2025-03-04 07:01:09,413 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 12 predicate places. [2025-03-04 07:01:09,413 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 283 transitions, 788 flow [2025-03-04 07:01:09,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 244.33333333333334) internal successors, (733), 3 states have internal predecessors, (733), 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 07:01:09,414 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:01:09,414 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:01:09,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 07:01:09,414 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-04 07:01:09,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:01:09,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1671340082, now seen corresponding path program 2 times [2025-03-04 07:01:09,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:01:09,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029613039] [2025-03-04 07:01:09,415 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:01:09,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:01:09,433 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 212 statements into 1 equivalence classes. [2025-03-04 07:01:09,448 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-04 07:01:09,448 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 07:01:09,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:01:09,718 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 07:01:09,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:01:09,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029613039] [2025-03-04 07:01:09,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029613039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:01:09,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:01:09,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:01:09,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209661508] [2025-03-04 07:01:09,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:01:09,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:01:09,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:01:09,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:01:09,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:01:09,766 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 261 [2025-03-04 07:01:09,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 283 transitions, 788 flow. Second operand has 6 states, 6 states have (on average 242.5) internal successors, (1455), 6 states have internal predecessors, (1455), 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 07:01:09,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 07:01:09,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 261 [2025-03-04 07:01:09,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 07:01:10,058 INFO L124 PetriNetUnfolderBase]: 302/2783 cut-off events. [2025-03-04 07:01:10,058 INFO L125 PetriNetUnfolderBase]: For 987/1190 co-relation queries the response was YES. [2025-03-04 07:01:10,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5096 conditions, 2783 events. 302/2783 cut-off events. For 987/1190 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 24945 event pairs, 83 based on Foata normal form. 61/2744 useless extension candidates. Maximal degree in co-relation 4430. Up to 326 conditions per place. [2025-03-04 07:01:10,070 INFO L140 encePairwiseOnDemand]: 255/261 looper letters, 28 selfloop transitions, 8 changer transitions 0/289 dead transitions. [2025-03-04 07:01:10,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 289 transitions, 867 flow [2025-03-04 07:01:10,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:01:10,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 07:01:10,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1236 transitions. [2025-03-04 07:01:10,072 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9471264367816092 [2025-03-04 07:01:10,072 INFO L175 Difference]: Start difference. First operand has 275 places, 283 transitions, 788 flow. Second operand 5 states and 1236 transitions. [2025-03-04 07:01:10,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 289 transitions, 867 flow [2025-03-04 07:01:10,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 289 transitions, 854 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-04 07:01:10,077 INFO L231 Difference]: Finished difference. Result has 278 places, 278 transitions, 751 flow [2025-03-04 07:01:10,077 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=735, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=751, PETRI_PLACES=278, PETRI_TRANSITIONS=278} [2025-03-04 07:01:10,078 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 15 predicate places. [2025-03-04 07:01:10,078 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 278 transitions, 751 flow [2025-03-04 07:01:10,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 242.5) internal successors, (1455), 6 states have internal predecessors, (1455), 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 07:01:10,079 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:01:10,079 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:01:10,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 07:01:10,079 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-04 07:01:10,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:01:10,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1064699311, now seen corresponding path program 1 times [2025-03-04 07:01:10,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:01:10,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948593999] [2025-03-04 07:01:10,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:01:10,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:01:10,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-04 07:01:10,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-04 07:01:10,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:01:10,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:01:10,131 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 07:01:10,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:01:10,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948593999] [2025-03-04 07:01:10,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948593999] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:01:10,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:01:10,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:01:10,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461970021] [2025-03-04 07:01:10,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:01:10,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:01:10,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:01:10,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:01:10,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:01:10,160 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 261 [2025-03-04 07:01:10,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 278 transitions, 751 flow. Second operand has 3 states, 3 states have (on average 236.33333333333334) internal successors, (709), 3 states have internal predecessors, (709), 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 07:01:10,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 07:01:10,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 261 [2025-03-04 07:01:10,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 07:01:10,497 INFO L124 PetriNetUnfolderBase]: 503/3564 cut-off events. [2025-03-04 07:01:10,497 INFO L125 PetriNetUnfolderBase]: For 2170/2436 co-relation queries the response was YES. [2025-03-04 07:01:10,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7138 conditions, 3564 events. 503/3564 cut-off events. For 2170/2436 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 34354 event pairs, 226 based on Foata normal form. 6/3415 useless extension candidates. Maximal degree in co-relation 6345. Up to 891 conditions per place. [2025-03-04 07:01:10,511 INFO L140 encePairwiseOnDemand]: 258/261 looper letters, 37 selfloop transitions, 2 changer transitions 0/280 dead transitions. [2025-03-04 07:01:10,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 280 transitions, 845 flow [2025-03-04 07:01:10,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:01:10,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 07:01:10,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 725 transitions. [2025-03-04 07:01:10,512 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9259259259259259 [2025-03-04 07:01:10,512 INFO L175 Difference]: Start difference. First operand has 278 places, 278 transitions, 751 flow. Second operand 3 states and 725 transitions. [2025-03-04 07:01:10,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 280 transitions, 845 flow [2025-03-04 07:01:10,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 280 transitions, 833 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 07:01:10,517 INFO L231 Difference]: Finished difference. Result has 276 places, 277 transitions, 744 flow [2025-03-04 07:01:10,518 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=740, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=744, PETRI_PLACES=276, PETRI_TRANSITIONS=277} [2025-03-04 07:01:10,518 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 13 predicate places. [2025-03-04 07:01:10,518 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 277 transitions, 744 flow [2025-03-04 07:01:10,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.33333333333334) internal successors, (709), 3 states have internal predecessors, (709), 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 07:01:10,518 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:01:10,518 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:01:10,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 07:01:10,519 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-04 07:01:10,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:01:10,519 INFO L85 PathProgramCache]: Analyzing trace with hash -642065938, now seen corresponding path program 1 times [2025-03-04 07:01:10,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:01:10,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481701417] [2025-03-04 07:01:10,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:01:10,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:01:10,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-03-04 07:01:10,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-03-04 07:01:10,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:01:10,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 07:01:10,545 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 07:01:10,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-03-04 07:01:10,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-03-04 07:01:10,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:01:10,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 07:01:10,583 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 07:01:10,584 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 07:01:10,584 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2025-03-04 07:01:10,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2025-03-04 07:01:10,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2025-03-04 07:01:10,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2025-03-04 07:01:10,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2025-03-04 07:01:10,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2025-03-04 07:01:10,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2025-03-04 07:01:10,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2025-03-04 07:01:10,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2025-03-04 07:01:10,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2025-03-04 07:01:10,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2025-03-04 07:01:10,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2025-03-04 07:01:10,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2025-03-04 07:01:10,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2025-03-04 07:01:10,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 07:01:10,585 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:01:10,586 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 07:01:10,586 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-04 07:01:10,608 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 07:01:10,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 295 places, 291 transitions, 600 flow [2025-03-04 07:01:10,635 INFO L124 PetriNetUnfolderBase]: 9/430 cut-off events. [2025-03-04 07:01:10,635 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-04 07:01:10,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 443 conditions, 430 events. 9/430 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 586 event pairs, 0 based on Foata normal form. 0/392 useless extension candidates. Maximal degree in co-relation 355. Up to 8 conditions per place. [2025-03-04 07:01:10,636 INFO L82 GeneralOperation]: Start removeDead. Operand has 295 places, 291 transitions, 600 flow [2025-03-04 07:01:10,637 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 295 places, 291 transitions, 600 flow [2025-03-04 07:01:10,637 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:01:10,637 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;@2b379585, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:01:10,637 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-03-04 07:01:10,642 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 07:01:10,642 INFO L124 PetriNetUnfolderBase]: 1/160 cut-off events. [2025-03-04 07:01:10,642 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 07:01:10,642 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:01:10,643 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:01:10,643 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-04 07:01:10,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:01:10,643 INFO L85 PathProgramCache]: Analyzing trace with hash -532868939, now seen corresponding path program 1 times [2025-03-04 07:01:10,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:01:10,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707810334] [2025-03-04 07:01:10,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:01:10,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:01:10,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-04 07:01:10,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-04 07:01:10,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:01:10,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:01:10,677 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 07:01:10,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:01:10,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707810334] [2025-03-04 07:01:10,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707810334] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:01:10,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:01:10,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:01:10,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715356183] [2025-03-04 07:01:10,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:01:10,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:01:10,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:01:10,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:01:10,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:01:10,701 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 291 [2025-03-04 07:01:10,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 291 transitions, 600 flow. Second operand has 3 states, 3 states have (on average 250.0) internal successors, (750), 3 states have internal predecessors, (750), 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 07:01:10,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 07:01:10,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 291 [2025-03-04 07:01:10,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 07:01:20,037 INFO L124 PetriNetUnfolderBase]: 35239/79075 cut-off events. [2025-03-04 07:01:20,037 INFO L125 PetriNetUnfolderBase]: For 973/973 co-relation queries the response was YES. [2025-03-04 07:01:20,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129887 conditions, 79075 events. 35239/79075 cut-off events. For 973/973 co-relation queries the response was YES. Maximal size of possible extension queue 2923. Compared 957737 event pairs, 14941 based on Foata normal form. 1/71001 useless extension candidates. Maximal degree in co-relation 109153. Up to 27933 conditions per place. [2025-03-04 07:01:20,442 INFO L140 encePairwiseOnDemand]: 270/291 looper letters, 60 selfloop transitions, 14 changer transitions 1/323 dead transitions. [2025-03-04 07:01:20,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 323 transitions, 824 flow [2025-03-04 07:01:20,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:01:20,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 07:01:20,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 829 transitions. [2025-03-04 07:01:20,444 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9495990836197021 [2025-03-04 07:01:20,444 INFO L175 Difference]: Start difference. First operand has 295 places, 291 transitions, 600 flow. Second operand 3 states and 829 transitions. [2025-03-04 07:01:20,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 323 transitions, 824 flow [2025-03-04 07:01:20,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 323 transitions, 820 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-03-04 07:01:20,450 INFO L231 Difference]: Finished difference. Result has 299 places, 302 transitions, 714 flow [2025-03-04 07:01:20,450 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=714, PETRI_PLACES=299, PETRI_TRANSITIONS=302} [2025-03-04 07:01:20,451 INFO L279 CegarLoopForPetriNet]: 295 programPoint places, 4 predicate places. [2025-03-04 07:01:20,451 INFO L471 AbstractCegarLoop]: Abstraction has has 299 places, 302 transitions, 714 flow [2025-03-04 07:01:20,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 250.0) internal successors, (750), 3 states have internal predecessors, (750), 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 07:01:20,451 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 07:01:20,451 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:01:20,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 07:01:20,452 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-04 07:01:20,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:01:20,452 INFO L85 PathProgramCache]: Analyzing trace with hash 2000867303, now seen corresponding path program 1 times [2025-03-04 07:01:20,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:01:20,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955605913] [2025-03-04 07:01:20,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:01:20,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:01:20,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-04 07:01:20,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-04 07:01:20,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:01:20,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:01:20,490 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 07:01:20,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:01:20,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955605913] [2025-03-04 07:01:20,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955605913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:01:20,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:01:20,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:01:20,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206226636] [2025-03-04 07:01:20,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:01:20,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:01:20,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:01:20,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:01:20,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:01:20,530 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 253 out of 291 [2025-03-04 07:01:20,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 302 transitions, 714 flow. Second operand has 3 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 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 07:01:20,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 07:01:20,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 253 of 291 [2025-03-04 07:01:20,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 07:01:24,537 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][171], [61#L691true, 303#true, 292#true, 104#L695-5true, 73#L712-2true, 294#true, 300#(= |#race~threads_alive~0| 0), 149#L695-4true, 296#true, Black: 298#true]) [2025-03-04 07:01:24,537 INFO L294 olderBase$Statistics]: this new event has 275 ancestors and is cut-off event [2025-03-04 07:01:24,537 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-03-04 07:01:24,537 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-03-04 07:01:24,537 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-03-04 07:01:24,537 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][171], [61#L691true, 303#true, 292#true, 104#L695-5true, 73#L712-2true, 294#true, 46#L695-5true, 300#(= |#race~threads_alive~0| 0), 296#true, Black: 298#true]) [2025-03-04 07:01:24,537 INFO L294 olderBase$Statistics]: this new event has 276 ancestors and is cut-off event [2025-03-04 07:01:24,537 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2025-03-04 07:01:24,537 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2025-03-04 07:01:24,537 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2025-03-04 07:01:24,538 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][171], [61#L691true, 303#true, 292#true, 73#L712-2true, 294#true, 46#L695-5true, 300#(= |#race~threads_alive~0| 0), 296#true, Black: 298#true, 158#L695-4true]) [2025-03-04 07:01:24,538 INFO L294 olderBase$Statistics]: this new event has 275 ancestors and is cut-off event [2025-03-04 07:01:24,538 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-03-04 07:01:24,538 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-03-04 07:01:24,538 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-03-04 07:01:24,920 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([988] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][171], [61#L691true, 303#true, 292#true, 104#L695-5true, 73#L712-2true, 294#true, 300#(= |#race~threads_alive~0| 0), 149#L695-4true, 296#true, Black: 298#true]) [2025-03-04 07:01:24,920 INFO L294 olderBase$Statistics]: this new event has 275 ancestors and is cut-off event [2025-03-04 07:01:24,920 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-03-04 07:01:24,920 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-03-04 07:01:24,920 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2025-03-04 07:01:24,920 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-03-04 07:01:24,921 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([988] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][171], [61#L691true, 303#true, 292#true, 73#L712-2true, 294#true, 300#(= |#race~threads_alive~0| 0), 46#L695-5true, 296#true, Black: 298#true, 158#L695-4true]) [2025-03-04 07:01:24,921 INFO L294 olderBase$Statistics]: this new event has 275 ancestors and is cut-off event [2025-03-04 07:01:24,921 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2025-03-04 07:01:24,921 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-03-04 07:01:24,921 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-03-04 07:01:24,921 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-03-04 07:01:25,131 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([988] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][171], [61#L691true, 303#true, 292#true, 73#L712-2true, 104#L695-5true, 294#true, 300#(= |#race~threads_alive~0| 0), 46#L695-5true, 296#true, Black: 298#true]) [2025-03-04 07:01:25,131 INFO L294 olderBase$Statistics]: this new event has 276 ancestors and is cut-off event [2025-03-04 07:01:25,131 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2025-03-04 07:01:25,131 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2025-03-04 07:01:25,131 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2025-03-04 07:01:25,131 INFO L297 olderBase$Statistics]: existing Event has 276 ancestors and is cut-off event [2025-03-04 07:01:25,132 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][171], [61#L691true, 303#true, 292#true, 104#L695-5true, 73#L712-2true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 218#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 298#true]) [2025-03-04 07:01:25,132 INFO L294 olderBase$Statistics]: this new event has 276 ancestors and is cut-off event [2025-03-04 07:01:25,132 INFO L297 olderBase$Statistics]: existing Event has 276 ancestors and is cut-off event [2025-03-04 07:01:25,132 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2025-03-04 07:01:25,132 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2025-03-04 07:01:26,026 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [115#L695true, 61#L691true, 303#true, 292#true, 73#L712-2true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 218#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 298#true]) [2025-03-04 07:01:26,026 INFO L294 olderBase$Statistics]: this new event has 279 ancestors and is cut-off event [2025-03-04 07:01:26,026 INFO L297 olderBase$Statistics]: existing Event has 279 ancestors and is cut-off event [2025-03-04 07:01:26,026 INFO L297 olderBase$Statistics]: existing Event has 274 ancestors and is cut-off event [2025-03-04 07:01:26,026 INFO L297 olderBase$Statistics]: existing Event has 274 ancestors and is cut-off event [2025-03-04 07:01:26,028 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [61#L691true, 303#true, 292#true, 73#L712-2true, 145#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 159#L695true, Black: 298#true]) [2025-03-04 07:01:26,028 INFO L294 olderBase$Statistics]: this new event has 279 ancestors and is cut-off event [2025-03-04 07:01:26,028 INFO L297 olderBase$Statistics]: existing Event has 274 ancestors and is cut-off event [2025-03-04 07:01:26,028 INFO L297 olderBase$Statistics]: existing Event has 274 ancestors and is cut-off event [2025-03-04 07:01:26,029 INFO L297 olderBase$Statistics]: existing Event has 279 ancestors and is cut-off event [2025-03-04 07:01:26,940 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [17#L697true, 61#L691true, 303#true, 292#true, 73#L712-2true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 218#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 298#true]) [2025-03-04 07:01:26,940 INFO L294 olderBase$Statistics]: this new event has 282 ancestors and is cut-off event [2025-03-04 07:01:26,940 INFO L297 olderBase$Statistics]: existing Event has 277 ancestors and is cut-off event [2025-03-04 07:01:26,940 INFO L297 olderBase$Statistics]: existing Event has 277 ancestors and is cut-off event [2025-03-04 07:01:26,940 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-03-04 07:01:26,943 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [61#L691true, 303#true, 292#true, 73#L712-2true, 145#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 294#true, 276#L697true, 300#(= |#race~threads_alive~0| 0), 296#true, Black: 298#true]) [2025-03-04 07:01:26,943 INFO L294 olderBase$Statistics]: this new event has 282 ancestors and is cut-off event [2025-03-04 07:01:26,943 INFO L297 olderBase$Statistics]: existing Event has 277 ancestors and is cut-off event [2025-03-04 07:01:26,943 INFO L297 olderBase$Statistics]: existing Event has 277 ancestors and is cut-off event [2025-03-04 07:01:26,943 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-03-04 07:01:27,651 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][171], [303#true, 292#true, 104#L695-5true, 73#L712-2true, 294#true, 243#L693true, 300#(= |#race~threads_alive~0| 0), 149#L695-4true, 296#true, Black: 298#true]) [2025-03-04 07:01:27,651 INFO L294 olderBase$Statistics]: this new event has 285 ancestors and is cut-off event [2025-03-04 07:01:27,651 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-03-04 07:01:27,651 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-03-04 07:01:27,651 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-03-04 07:01:27,651 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][171], [303#true, 292#true, 104#L695-5true, 73#L712-2true, 294#true, 243#L693true, 46#L695-5true, 300#(= |#race~threads_alive~0| 0), 296#true, Black: 298#true]) [2025-03-04 07:01:27,651 INFO L294 olderBase$Statistics]: this new event has 286 ancestors and is cut-off event [2025-03-04 07:01:27,651 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-03-04 07:01:27,651 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-03-04 07:01:27,651 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-03-04 07:01:27,651 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][171], [303#true, 292#true, 73#L712-2true, 294#true, 243#L693true, 46#L695-5true, 300#(= |#race~threads_alive~0| 0), 296#true, Black: 298#true, 158#L695-4true]) [2025-03-04 07:01:27,651 INFO L294 olderBase$Statistics]: this new event has 285 ancestors and is cut-off event [2025-03-04 07:01:27,651 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-03-04 07:01:27,651 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-03-04 07:01:27,651 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-03-04 07:01:27,871 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([988] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][171], [303#true, 292#true, 73#L712-2true, 104#L695-5true, 294#true, 243#L693true, 300#(= |#race~threads_alive~0| 0), 296#true, 149#L695-4true, Black: 298#true]) [2025-03-04 07:01:27,871 INFO L294 olderBase$Statistics]: this new event has 285 ancestors and is cut-off event [2025-03-04 07:01:27,872 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-03-04 07:01:27,872 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-03-04 07:01:27,872 INFO L297 olderBase$Statistics]: existing Event has 285 ancestors and is cut-off event [2025-03-04 07:01:27,872 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-03-04 07:01:27,873 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([988] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][171], [303#true, 292#true, 73#L712-2true, 243#L693true, 294#true, 300#(= |#race~threads_alive~0| 0), 46#L695-5true, 296#true, Black: 298#true, 158#L695-4true]) [2025-03-04 07:01:27,873 INFO L294 olderBase$Statistics]: this new event has 285 ancestors and is cut-off event [2025-03-04 07:01:27,873 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-03-04 07:01:27,873 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-03-04 07:01:27,873 INFO L297 olderBase$Statistics]: existing Event has 285 ancestors and is cut-off event [2025-03-04 07:01:27,873 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-03-04 07:01:28,103 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([988] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][171], [303#true, 292#true, 73#L712-2true, 104#L695-5true, 294#true, 243#L693true, 300#(= |#race~threads_alive~0| 0), 46#L695-5true, 296#true, Black: 298#true]) [2025-03-04 07:01:28,103 INFO L294 olderBase$Statistics]: this new event has 286 ancestors and is cut-off event [2025-03-04 07:01:28,103 INFO L297 olderBase$Statistics]: existing Event has 286 ancestors and is cut-off event [2025-03-04 07:01:28,103 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-03-04 07:01:28,103 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-03-04 07:01:28,103 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-03-04 07:01:28,104 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][171], [303#true, 292#true, 104#L695-5true, 73#L712-2true, 294#true, 243#L693true, 300#(= |#race~threads_alive~0| 0), 296#true, 218#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 298#true]) [2025-03-04 07:01:28,104 INFO L294 olderBase$Statistics]: this new event has 286 ancestors and is cut-off event [2025-03-04 07:01:28,104 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-03-04 07:01:28,104 INFO L297 olderBase$Statistics]: existing Event has 286 ancestors and is cut-off event [2025-03-04 07:01:28,104 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-03-04 07:01:28,105 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][171], [303#true, 292#true, 104#L695-5true, 73#L712-2true, 294#true, 198#L694true, 300#(= |#race~threads_alive~0| 0), 149#L695-4true, 296#true, Black: 298#true]) [2025-03-04 07:01:28,105 INFO L294 olderBase$Statistics]: this new event has 287 ancestors and is cut-off event [2025-03-04 07:01:28,105 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-03-04 07:01:28,105 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-03-04 07:01:28,105 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-03-04 07:01:28,105 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][171], [303#true, 292#true, 104#L695-5true, 73#L712-2true, 294#true, 198#L694true, 46#L695-5true, 300#(= |#race~threads_alive~0| 0), 296#true, Black: 298#true]) [2025-03-04 07:01:28,105 INFO L294 olderBase$Statistics]: this new event has 288 ancestors and is cut-off event [2025-03-04 07:01:28,105 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2025-03-04 07:01:28,106 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2025-03-04 07:01:28,106 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2025-03-04 07:01:28,106 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][171], [303#true, 292#true, 73#L712-2true, 294#true, 198#L694true, 46#L695-5true, 300#(= |#race~threads_alive~0| 0), 296#true, Black: 298#true, 158#L695-4true]) [2025-03-04 07:01:28,106 INFO L294 olderBase$Statistics]: this new event has 287 ancestors and is cut-off event [2025-03-04 07:01:28,106 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-03-04 07:01:28,106 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-03-04 07:01:28,106 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-03-04 07:01:28,329 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([988] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][171], [303#true, 292#true, 73#L712-2true, 104#L695-5true, 294#true, 300#(= |#race~threads_alive~0| 0), 198#L694true, 296#true, 149#L695-4true, Black: 298#true]) [2025-03-04 07:01:28,330 INFO L294 olderBase$Statistics]: this new event has 287 ancestors and is cut-off event [2025-03-04 07:01:28,330 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-03-04 07:01:28,330 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-03-04 07:01:28,330 INFO L297 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2025-03-04 07:01:28,330 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-03-04 07:01:28,331 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([988] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][171], [303#true, 292#true, 73#L712-2true, 294#true, 198#L694true, 300#(= |#race~threads_alive~0| 0), 46#L695-5true, 296#true, Black: 298#true, 158#L695-4true]) [2025-03-04 07:01:28,331 INFO L294 olderBase$Statistics]: this new event has 287 ancestors and is cut-off event [2025-03-04 07:01:28,331 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-03-04 07:01:28,331 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-03-04 07:01:28,331 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-03-04 07:01:28,331 INFO L297 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2025-03-04 07:01:28,748 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([988] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][171], [303#true, 292#true, 73#L712-2true, 104#L695-5true, 294#true, 46#L695-5true, 300#(= |#race~threads_alive~0| 0), 198#L694true, 296#true, Black: 298#true]) [2025-03-04 07:01:28,748 INFO L294 olderBase$Statistics]: this new event has 288 ancestors and is cut-off event [2025-03-04 07:01:28,749 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2025-03-04 07:01:28,749 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2025-03-04 07:01:28,749 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2025-03-04 07:01:28,749 INFO L297 olderBase$Statistics]: existing Event has 288 ancestors and is cut-off event [2025-03-04 07:01:28,749 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][171], [303#true, 292#true, 73#L712-2true, 104#L695-5true, 294#true, 198#L694true, 300#(= |#race~threads_alive~0| 0), 296#true, 218#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 298#true]) [2025-03-04 07:01:28,749 INFO L294 olderBase$Statistics]: this new event has 288 ancestors and is cut-off event [2025-03-04 07:01:28,749 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2025-03-04 07:01:28,749 INFO L297 olderBase$Statistics]: existing Event has 288 ancestors and is cut-off event [2025-03-04 07:01:28,749 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2025-03-04 07:01:28,988 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [115#L695true, 303#true, 292#true, 73#L712-2true, 294#true, 243#L693true, 300#(= |#race~threads_alive~0| 0), 296#true, 218#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 298#true]) [2025-03-04 07:01:28,988 INFO L294 olderBase$Statistics]: this new event has 289 ancestors and is cut-off event [2025-03-04 07:01:28,988 INFO L297 olderBase$Statistics]: existing Event has 284 ancestors and is cut-off event [2025-03-04 07:01:28,988 INFO L297 olderBase$Statistics]: existing Event has 284 ancestors and is cut-off event [2025-03-04 07:01:28,988 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2025-03-04 07:01:28,990 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [303#true, 292#true, 73#L712-2true, 145#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 243#L693true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 159#L695true, Black: 298#true]) [2025-03-04 07:01:28,990 INFO L294 olderBase$Statistics]: this new event has 289 ancestors and is cut-off event [2025-03-04 07:01:28,990 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2025-03-04 07:01:28,990 INFO L297 olderBase$Statistics]: existing Event has 284 ancestors and is cut-off event [2025-03-04 07:01:28,990 INFO L297 olderBase$Statistics]: existing Event has 284 ancestors and is cut-off event [2025-03-04 07:01:29,456 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [115#L695true, 303#true, 292#true, 73#L712-2true, 294#true, 300#(= |#race~threads_alive~0| 0), 198#L694true, 296#true, 218#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 298#true]) [2025-03-04 07:01:29,456 INFO L294 olderBase$Statistics]: this new event has 291 ancestors and is cut-off event [2025-03-04 07:01:29,456 INFO L297 olderBase$Statistics]: existing Event has 291 ancestors and is cut-off event [2025-03-04 07:01:29,456 INFO L297 olderBase$Statistics]: existing Event has 286 ancestors and is cut-off event [2025-03-04 07:01:29,456 INFO L297 olderBase$Statistics]: existing Event has 286 ancestors and is cut-off event [2025-03-04 07:01:29,459 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [303#true, 292#true, 73#L712-2true, 145#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 294#true, 300#(= |#race~threads_alive~0| 0), 198#L694true, 296#true, 159#L695true, Black: 298#true]) [2025-03-04 07:01:29,459 INFO L294 olderBase$Statistics]: this new event has 291 ancestors and is cut-off event [2025-03-04 07:01:29,459 INFO L297 olderBase$Statistics]: existing Event has 286 ancestors and is cut-off event [2025-03-04 07:01:29,459 INFO L297 olderBase$Statistics]: existing Event has 291 ancestors and is cut-off event [2025-03-04 07:01:29,459 INFO L297 olderBase$Statistics]: existing Event has 286 ancestors and is cut-off event [2025-03-04 07:01:29,863 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [17#L697true, 303#true, 292#true, 73#L712-2true, 294#true, 243#L693true, 300#(= |#race~threads_alive~0| 0), 296#true, 218#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 298#true]) [2025-03-04 07:01:29,863 INFO L294 olderBase$Statistics]: this new event has 292 ancestors and is cut-off event [2025-03-04 07:01:29,863 INFO L297 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2025-03-04 07:01:29,863 INFO L297 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2025-03-04 07:01:29,863 INFO L297 olderBase$Statistics]: existing Event has 292 ancestors and is cut-off event [2025-03-04 07:01:29,866 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [303#true, 292#true, 145#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 73#L712-2true, 243#L693true, 294#true, 276#L697true, 300#(= |#race~threads_alive~0| 0), 296#true, Black: 298#true]) [2025-03-04 07:01:29,866 INFO L294 olderBase$Statistics]: this new event has 292 ancestors and is cut-off event [2025-03-04 07:01:29,866 INFO L297 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2025-03-04 07:01:29,866 INFO L297 olderBase$Statistics]: existing Event has 287 ancestors and is cut-off event [2025-03-04 07:01:29,866 INFO L297 olderBase$Statistics]: existing Event has 292 ancestors and is cut-off event [2025-03-04 07:01:30,284 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [17#L697true, 303#true, 292#true, 73#L712-2true, 294#true, 198#L694true, 300#(= |#race~threads_alive~0| 0), 296#true, 218#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 298#true]) [2025-03-04 07:01:30,284 INFO L294 olderBase$Statistics]: this new event has 294 ancestors and is cut-off event [2025-03-04 07:01:30,284 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2025-03-04 07:01:30,284 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2025-03-04 07:01:30,284 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2025-03-04 07:01:30,288 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([988] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][158], [303#true, 292#true, 145#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 73#L712-2true, 294#true, 276#L697true, 300#(= |#race~threads_alive~0| 0), 198#L694true, 296#true, Black: 298#true]) [2025-03-04 07:01:30,288 INFO L294 olderBase$Statistics]: this new event has 294 ancestors and is cut-off event [2025-03-04 07:01:30,288 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2025-03-04 07:01:30,288 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2025-03-04 07:01:30,288 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event