./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/per-thread-array-join-counter-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8fc3dc66 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/per-thread-array-join-counter-2.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 678d0822783009bcb35d951b8e726d754b85c570b149dafb90ced3b5185856fb --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:16:34,775 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:16:34,836 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 11:16:34,841 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:16:34,842 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:16:34,863 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:16:34,864 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:16:34,864 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:16:34,865 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:16:34,865 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:16:34,865 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:16:34,866 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:16:34,866 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:16:34,866 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:16:34,866 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 11:16:34,866 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:16:34,866 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:16:34,866 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:16:34,866 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:16:34,866 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 11:16:34,867 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:16:34,867 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 11:16:34,867 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 11:16:34,867 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:16:34,867 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:16:34,867 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 11:16:34,867 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:16:34,867 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:16:34,867 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:16:34,867 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:16:34,867 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:16:34,867 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:16:34,867 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:16:34,867 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:16:34,867 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 11:16:34,867 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 11:16:34,867 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:16:34,867 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:16:34,867 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:16:34,867 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:16:34,867 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:16:34,867 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:16:34,867 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 -> 678d0822783009bcb35d951b8e726d754b85c570b149dafb90ced3b5185856fb [2025-03-17 11:16:35,086 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:16:35,091 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:16:35,093 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:16:35,093 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:16:35,094 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:16:35,094 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/per-thread-array-join-counter-2.i [2025-03-17 11:16:36,301 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/071fa399e/988b544b0ed64472a967aed437bdebb3/FLAGcbb924cde [2025-03-17 11:16:36,602 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:16:36,604 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-array-join-counter-2.i [2025-03-17 11:16:36,619 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/071fa399e/988b544b0ed64472a967aed437bdebb3/FLAGcbb924cde [2025-03-17 11:16:36,887 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/071fa399e/988b544b0ed64472a967aed437bdebb3 [2025-03-17 11:16:36,889 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:16:36,890 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:16:36,891 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:16:36,891 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:16:36,894 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:16:36,894 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:16:36" (1/1) ... [2025-03-17 11:16:36,895 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@113cd9f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:16:36, skipping insertion in model container [2025-03-17 11:16:36,895 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:16:36" (1/1) ... [2025-03-17 11:16:36,922 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:16:37,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:16:37,198 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:16:37,259 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:16:37,314 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:16:37,315 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:16:37 WrapperNode [2025-03-17 11:16:37,316 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:16:37,317 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:16:37,317 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:16:37,317 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:16:37,322 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:16:37" (1/1) ... [2025-03-17 11:16:37,343 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:16:37" (1/1) ... [2025-03-17 11:16:37,370 INFO L138 Inliner]: procedures = 267, calls = 34, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 262 [2025-03-17 11:16:37,371 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:16:37,372 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:16:37,372 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:16:37,373 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:16:37,377 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:16:37" (1/1) ... [2025-03-17 11:16:37,378 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:16:37" (1/1) ... [2025-03-17 11:16:37,381 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:16:37" (1/1) ... [2025-03-17 11:16:37,382 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:16:37" (1/1) ... [2025-03-17 11:16:37,402 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:16:37" (1/1) ... [2025-03-17 11:16:37,403 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:16:37" (1/1) ... [2025-03-17 11:16:37,408 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:16:37" (1/1) ... [2025-03-17 11:16:37,409 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:16:37" (1/1) ... [2025-03-17 11:16:37,411 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:16:37,412 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:16:37,412 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:16:37,414 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:16:37,415 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:16:37" (1/1) ... [2025-03-17 11:16:37,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:16:37,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:16:37,443 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-17 11:16:37,449 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-17 11:16:37,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 11:16:37,469 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-17 11:16:37,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 11:16:37,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 11:16:37,469 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-17 11:16:37,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 11:16:37,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:16:37,469 INFO L130 BoogieDeclarations]: Found specification of procedure cleaner [2025-03-17 11:16:37,469 INFO L138 BoogieDeclarations]: Found implementation of procedure cleaner [2025-03-17 11:16:37,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 11:16:37,470 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-03-17 11:16:37,470 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-03-17 11:16:37,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:16:37,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:16:37,471 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 11:16:37,604 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:16:37,605 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:16:37,958 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1072: havoc main_#t~mem39#1; [2025-03-17 11:16:37,982 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 11:16:37,982 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:16:38,008 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:16:38,008 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:16:38,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:16:38 BoogieIcfgContainer [2025-03-17 11:16:38,008 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:16:38,010 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:16:38,010 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:16:38,013 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:16:38,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:16:36" (1/3) ... [2025-03-17 11:16:38,014 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b8c0046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:16:38, skipping insertion in model container [2025-03-17 11:16:38,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:16:37" (2/3) ... [2025-03-17 11:16:38,014 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b8c0046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:16:38, skipping insertion in model container [2025-03-17 11:16:38,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:16:38" (3/3) ... [2025-03-17 11:16:38,015 INFO L128 eAbstractionObserver]: Analyzing ICFG per-thread-array-join-counter-2.i [2025-03-17 11:16:38,028 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:16:38,029 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG per-thread-array-join-counter-2.i that has 3 procedures, 370 locations, 1 initial locations, 5 loop locations, and 34 error locations. [2025-03-17 11:16:38,030 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 11:16:38,104 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-17 11:16:38,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 444 places, 451 transitions, 916 flow [2025-03-17 11:16:38,320 INFO L124 PetriNetUnfolderBase]: 19/576 cut-off events. [2025-03-17 11:16:38,322 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 11:16:38,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 587 conditions, 576 events. 19/576 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 961 event pairs, 0 based on Foata normal form. 0/490 useless extension candidates. Maximal degree in co-relation 372. Up to 6 conditions per place. [2025-03-17 11:16:38,338 INFO L82 GeneralOperation]: Start removeDead. Operand has 444 places, 451 transitions, 916 flow [2025-03-17 11:16:38,347 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 375 places, 379 transitions, 768 flow [2025-03-17 11:16:38,356 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:16:38,368 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;@8684eba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:16:38,369 INFO L334 AbstractCegarLoop]: Starting to check reachability of 51 error locations. [2025-03-17 11:16:38,390 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:16:38,393 INFO L124 PetriNetUnfolderBase]: 0/140 cut-off events. [2025-03-17 11:16:38,393 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:16:38,393 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:16:38,395 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] [2025-03-17 11:16:38,395 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-17 11:16:38,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:16:38,402 INFO L85 PathProgramCache]: Analyzing trace with hash -774118442, now seen corresponding path program 1 times [2025-03-17 11:16:38,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:16:38,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870510537] [2025-03-17 11:16:38,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:16:38,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:16:38,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 11:16:38,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 11:16:38,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:16:38,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:16:38,757 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-17 11:16:38,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:16:38,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870510537] [2025-03-17 11:16:38,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870510537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:16:38,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:16:38,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:16:38,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718096336] [2025-03-17 11:16:38,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:16:38,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:16:38,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:16:38,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:16:38,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:16:38,860 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 451 [2025-03-17 11:16:38,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 379 transitions, 768 flow. Second operand has 3 states, 3 states have (on average 409.3333333333333) internal successors, (1228), 3 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:16:38,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:16:38,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 451 [2025-03-17 11:16:38,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:16:39,324 INFO L124 PetriNetUnfolderBase]: 384/3026 cut-off events. [2025-03-17 11:16:39,324 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-03-17 11:16:39,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3659 conditions, 3026 events. 384/3026 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 21525 event pairs, 264 based on Foata normal form. 97/2607 useless extension candidates. Maximal degree in co-relation 3435. Up to 604 conditions per place. [2025-03-17 11:16:39,345 INFO L140 encePairwiseOnDemand]: 442/451 looper letters, 26 selfloop transitions, 2 changer transitions 1/370 dead transitions. [2025-03-17 11:16:39,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 370 transitions, 806 flow [2025-03-17 11:16:39,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:16:39,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:16:39,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1259 transitions. [2025-03-17 11:16:39,363 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9305247597930525 [2025-03-17 11:16:39,365 INFO L175 Difference]: Start difference. First operand has 375 places, 379 transitions, 768 flow. Second operand 3 states and 1259 transitions. [2025-03-17 11:16:39,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 370 transitions, 806 flow [2025-03-17 11:16:39,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 370 transitions, 805 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:16:39,378 INFO L231 Difference]: Finished difference. Result has 372 places, 369 transitions, 751 flow [2025-03-17 11:16:39,381 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=451, PETRI_DIFFERENCE_MINUEND_FLOW=749, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=751, PETRI_PLACES=372, PETRI_TRANSITIONS=369} [2025-03-17 11:16:39,385 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -3 predicate places. [2025-03-17 11:16:39,385 INFO L471 AbstractCegarLoop]: Abstraction has has 372 places, 369 transitions, 751 flow [2025-03-17 11:16:39,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 409.3333333333333) internal successors, (1228), 3 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:16:39,386 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:16:39,386 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] [2025-03-17 11:16:39,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:16:39,386 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-17 11:16:39,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:16:39,388 INFO L85 PathProgramCache]: Analyzing trace with hash -134924606, now seen corresponding path program 1 times [2025-03-17 11:16:39,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:16:39,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210579484] [2025-03-17 11:16:39,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:16:39,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:16:39,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-17 11:16:39,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-17 11:16:39,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:16:39,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:16:39,536 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-17 11:16:39,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:16:39,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210579484] [2025-03-17 11:16:39,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210579484] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:16:39,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:16:39,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:16:39,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425384237] [2025-03-17 11:16:39,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:16:39,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:16:39,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:16:39,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:16:39,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:16:39,578 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 398 out of 451 [2025-03-17 11:16:39,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 369 transitions, 751 flow. Second operand has 3 states, 3 states have (on average 399.0) internal successors, (1197), 3 states have internal predecessors, (1197), 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-17 11:16:39,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:16:39,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 398 of 451 [2025-03-17 11:16:39,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:16:39,978 INFO L124 PetriNetUnfolderBase]: 405/2970 cut-off events. [2025-03-17 11:16:39,978 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2025-03-17 11:16:39,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3670 conditions, 2970 events. 405/2970 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 20691 event pairs, 305 based on Foata normal form. 0/2558 useless extension candidates. Maximal degree in co-relation 3521. Up to 667 conditions per place. [2025-03-17 11:16:40,001 INFO L140 encePairwiseOnDemand]: 443/451 looper letters, 29 selfloop transitions, 1 changer transitions 0/362 dead transitions. [2025-03-17 11:16:40,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 362 transitions, 797 flow [2025-03-17 11:16:40,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:16:40,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:16:40,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1231 transitions. [2025-03-17 11:16:40,007 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.909830007390983 [2025-03-17 11:16:40,007 INFO L175 Difference]: Start difference. First operand has 372 places, 369 transitions, 751 flow. Second operand 3 states and 1231 transitions. [2025-03-17 11:16:40,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 362 transitions, 797 flow [2025-03-17 11:16:40,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 362 transitions, 793 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:16:40,017 INFO L231 Difference]: Finished difference. Result has 364 places, 362 transitions, 735 flow [2025-03-17 11:16:40,018 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=451, PETRI_DIFFERENCE_MINUEND_FLOW=733, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=735, PETRI_PLACES=364, PETRI_TRANSITIONS=362} [2025-03-17 11:16:40,019 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -11 predicate places. [2025-03-17 11:16:40,019 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 362 transitions, 735 flow [2025-03-17 11:16:40,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 399.0) internal successors, (1197), 3 states have internal predecessors, (1197), 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-17 11:16:40,020 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:16:40,020 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] [2025-03-17 11:16:40,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:16:40,020 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-17 11:16:40,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:16:40,022 INFO L85 PathProgramCache]: Analyzing trace with hash 964499010, now seen corresponding path program 1 times [2025-03-17 11:16:40,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:16:40,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125137624] [2025-03-17 11:16:40,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:16:40,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:16:40,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-17 11:16:40,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-17 11:16:40,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:16:40,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:16:40,140 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-17 11:16:40,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:16:40,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125137624] [2025-03-17 11:16:40,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125137624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:16:40,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:16:40,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:16:40,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124634192] [2025-03-17 11:16:40,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:16:40,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:16:40,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:16:40,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:16:40,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:16:40,171 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 451 [2025-03-17 11:16:40,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 362 transitions, 735 flow. Second operand has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 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-17 11:16:40,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:16:40,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 451 [2025-03-17 11:16:40,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:16:40,493 INFO L124 PetriNetUnfolderBase]: 416/2949 cut-off events. [2025-03-17 11:16:40,493 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-03-17 11:16:40,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3639 conditions, 2949 events. 416/2949 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 21208 event pairs, 297 based on Foata normal form. 0/2506 useless extension candidates. Maximal degree in co-relation 3490. Up to 659 conditions per place. [2025-03-17 11:16:40,513 INFO L140 encePairwiseOnDemand]: 448/451 looper letters, 22 selfloop transitions, 2 changer transitions 0/361 dead transitions. [2025-03-17 11:16:40,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 361 transitions, 781 flow [2025-03-17 11:16:40,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:16:40,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:16:40,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1261 transitions. [2025-03-17 11:16:40,516 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9320029563932003 [2025-03-17 11:16:40,516 INFO L175 Difference]: Start difference. First operand has 364 places, 362 transitions, 735 flow. Second operand 3 states and 1261 transitions. [2025-03-17 11:16:40,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 361 transitions, 781 flow [2025-03-17 11:16:40,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 361 transitions, 780 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:16:40,520 INFO L231 Difference]: Finished difference. Result has 364 places, 361 transitions, 736 flow [2025-03-17 11:16:40,521 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=451, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=736, PETRI_PLACES=364, PETRI_TRANSITIONS=361} [2025-03-17 11:16:40,521 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -11 predicate places. [2025-03-17 11:16:40,522 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 361 transitions, 736 flow [2025-03-17 11:16:40,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 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-17 11:16:40,522 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:16:40,523 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] [2025-03-17 11:16:40,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:16:40,523 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-17 11:16:40,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:16:40,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1077377378, now seen corresponding path program 1 times [2025-03-17 11:16:40,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:16:40,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943209124] [2025-03-17 11:16:40,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:16:40,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:16:40,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-17 11:16:40,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-17 11:16:40,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:16:40,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:16:40,626 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-17 11:16:40,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:16:40,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943209124] [2025-03-17 11:16:40,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943209124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:16:40,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:16:40,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:16:40,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214903979] [2025-03-17 11:16:40,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:16:40,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:16:40,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:16:40,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:16:40,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:16:40,662 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 410 out of 451 [2025-03-17 11:16:40,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 361 transitions, 736 flow. Second operand has 3 states, 3 states have (on average 411.3333333333333) internal successors, (1234), 3 states have internal predecessors, (1234), 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-17 11:16:40,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:16:40,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 410 of 451 [2025-03-17 11:16:40,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:16:41,057 INFO L124 PetriNetUnfolderBase]: 554/3769 cut-off events. [2025-03-17 11:16:41,057 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-03-17 11:16:41,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4679 conditions, 3769 events. 554/3769 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 29295 event pairs, 412 based on Foata normal form. 0/3220 useless extension candidates. Maximal degree in co-relation 4530. Up to 868 conditions per place. [2025-03-17 11:16:41,073 INFO L140 encePairwiseOnDemand]: 448/451 looper letters, 23 selfloop transitions, 2 changer transitions 0/360 dead transitions. [2025-03-17 11:16:41,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 360 transitions, 784 flow [2025-03-17 11:16:41,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:16:41,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:16:41,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1256 transitions. [2025-03-17 11:16:41,076 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9283074648928308 [2025-03-17 11:16:41,077 INFO L175 Difference]: Start difference. First operand has 364 places, 361 transitions, 736 flow. Second operand 3 states and 1256 transitions. [2025-03-17 11:16:41,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 360 transitions, 784 flow [2025-03-17 11:16:41,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 360 transitions, 780 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:16:41,081 INFO L231 Difference]: Finished difference. Result has 363 places, 360 transitions, 734 flow [2025-03-17 11:16:41,081 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=451, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=734, PETRI_PLACES=363, PETRI_TRANSITIONS=360} [2025-03-17 11:16:41,082 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -12 predicate places. [2025-03-17 11:16:41,082 INFO L471 AbstractCegarLoop]: Abstraction has has 363 places, 360 transitions, 734 flow [2025-03-17 11:16:41,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 411.3333333333333) internal successors, (1234), 3 states have internal predecessors, (1234), 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-17 11:16:41,083 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:16:41,083 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] [2025-03-17 11:16:41,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:16:41,083 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-17 11:16:41,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:16:41,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1720838417, now seen corresponding path program 1 times [2025-03-17 11:16:41,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:16:41,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973460496] [2025-03-17 11:16:41,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:16:41,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:16:41,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-17 11:16:41,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-17 11:16:41,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:16:41,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:16:41,161 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-17 11:16:41,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:16:41,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973460496] [2025-03-17 11:16:41,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973460496] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:16:41,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:16:41,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:16:41,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237619044] [2025-03-17 11:16:41,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:16:41,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:16:41,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:16:41,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:16:41,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:16:41,191 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 451 [2025-03-17 11:16:41,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 360 transitions, 734 flow. Second operand has 3 states, 3 states have (on average 410.3333333333333) internal successors, (1231), 3 states have internal predecessors, (1231), 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-17 11:16:41,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:16:41,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 451 [2025-03-17 11:16:41,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:16:41,616 INFO L124 PetriNetUnfolderBase]: 717/3598 cut-off events. [2025-03-17 11:16:41,616 INFO L125 PetriNetUnfolderBase]: For 63/101 co-relation queries the response was YES. [2025-03-17 11:16:41,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4715 conditions, 3598 events. 717/3598 cut-off events. For 63/101 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 26772 event pairs, 505 based on Foata normal form. 0/2973 useless extension candidates. Maximal degree in co-relation 4566. Up to 1075 conditions per place. [2025-03-17 11:16:41,639 INFO L140 encePairwiseOnDemand]: 448/451 looper letters, 24 selfloop transitions, 2 changer transitions 0/359 dead transitions. [2025-03-17 11:16:41,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 359 transitions, 784 flow [2025-03-17 11:16:41,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:16:41,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:16:41,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1254 transitions. [2025-03-17 11:16:41,642 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.926829268292683 [2025-03-17 11:16:41,645 INFO L175 Difference]: Start difference. First operand has 363 places, 360 transitions, 734 flow. Second operand 3 states and 1254 transitions. [2025-03-17 11:16:41,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 359 transitions, 784 flow [2025-03-17 11:16:41,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 359 transitions, 780 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:16:41,651 INFO L231 Difference]: Finished difference. Result has 362 places, 359 transitions, 732 flow [2025-03-17 11:16:41,651 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=451, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=732, PETRI_PLACES=362, PETRI_TRANSITIONS=359} [2025-03-17 11:16:41,652 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -13 predicate places. [2025-03-17 11:16:41,652 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 359 transitions, 732 flow [2025-03-17 11:16:41,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 410.3333333333333) internal successors, (1231), 3 states have internal predecessors, (1231), 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-17 11:16:41,654 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:16:41,654 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] [2025-03-17 11:16:41,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:16:41,655 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-17 11:16:41,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:16:41,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1819534778, now seen corresponding path program 1 times [2025-03-17 11:16:41,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:16:41,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498972060] [2025-03-17 11:16:41,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:16:41,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:16:41,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-17 11:16:41,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-17 11:16:41,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:16:41,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:16:41,749 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-17 11:16:41,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:16:41,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498972060] [2025-03-17 11:16:41,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498972060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:16:41,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:16:41,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:16:41,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130739877] [2025-03-17 11:16:41,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:16:41,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:16:41,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:16:41,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:16:41,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:16:41,775 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 401 out of 451 [2025-03-17 11:16:41,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 359 transitions, 732 flow. Second operand has 3 states, 3 states have (on average 402.0) internal successors, (1206), 3 states have internal predecessors, (1206), 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-17 11:16:41,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:16:41,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 401 of 451 [2025-03-17 11:16:41,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:16:42,190 INFO L124 PetriNetUnfolderBase]: 1108/3933 cut-off events. [2025-03-17 11:16:42,190 INFO L125 PetriNetUnfolderBase]: For 79/134 co-relation queries the response was YES. [2025-03-17 11:16:42,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5643 conditions, 3933 events. 1108/3933 cut-off events. For 79/134 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 28194 event pairs, 465 based on Foata normal form. 0/3464 useless extension candidates. Maximal degree in co-relation 5495. Up to 1645 conditions per place. [2025-03-17 11:16:42,209 INFO L140 encePairwiseOnDemand]: 443/451 looper letters, 34 selfloop transitions, 3 changer transitions 0/365 dead transitions. [2025-03-17 11:16:42,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 365 transitions, 823 flow [2025-03-17 11:16:42,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:16:42,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:16:42,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1245 transitions. [2025-03-17 11:16:42,212 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9201773835920177 [2025-03-17 11:16:42,212 INFO L175 Difference]: Start difference. First operand has 362 places, 359 transitions, 732 flow. Second operand 3 states and 1245 transitions. [2025-03-17 11:16:42,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 365 transitions, 823 flow [2025-03-17 11:16:42,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 365 transitions, 819 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:16:42,217 INFO L231 Difference]: Finished difference. Result has 358 places, 357 transitions, 739 flow [2025-03-17 11:16:42,218 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=451, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=739, PETRI_PLACES=358, PETRI_TRANSITIONS=357} [2025-03-17 11:16:42,218 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -17 predicate places. [2025-03-17 11:16:42,219 INFO L471 AbstractCegarLoop]: Abstraction has has 358 places, 357 transitions, 739 flow [2025-03-17 11:16:42,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 402.0) internal successors, (1206), 3 states have internal predecessors, (1206), 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-17 11:16:42,219 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:16:42,220 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, 1, 1, 1, 1, 1] [2025-03-17 11:16:42,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:16:42,220 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-17 11:16:42,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:16:42,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1137939981, now seen corresponding path program 1 times [2025-03-17 11:16:42,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:16:42,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557754766] [2025-03-17 11:16:42,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:16:42,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:16:42,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-17 11:16:42,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-17 11:16:42,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:16:42,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:16:42,297 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-17 11:16:42,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:16:42,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557754766] [2025-03-17 11:16:42,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557754766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:16:42,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:16:42,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:16:42,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64309079] [2025-03-17 11:16:42,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:16:42,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:16:42,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:16:42,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:16:42,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:16:42,313 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 410 out of 451 [2025-03-17 11:16:42,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 357 transitions, 739 flow. Second operand has 3 states, 3 states have (on average 411.3333333333333) internal successors, (1234), 3 states have internal predecessors, (1234), 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-17 11:16:42,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:16:42,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 410 of 451 [2025-03-17 11:16:42,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:16:42,713 INFO L124 PetriNetUnfolderBase]: 532/3413 cut-off events. [2025-03-17 11:16:42,714 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2025-03-17 11:16:42,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4364 conditions, 3413 events. 532/3413 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 26073 event pairs, 341 based on Foata normal form. 0/2995 useless extension candidates. Maximal degree in co-relation 4216. Up to 863 conditions per place. [2025-03-17 11:16:42,728 INFO L140 encePairwiseOnDemand]: 445/451 looper letters, 28 selfloop transitions, 3 changer transitions 0/363 dead transitions. [2025-03-17 11:16:42,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 363 transitions, 813 flow [2025-03-17 11:16:42,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:16:42,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:16:42,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1264 transitions. [2025-03-17 11:16:42,731 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.934220251293422 [2025-03-17 11:16:42,731 INFO L175 Difference]: Start difference. First operand has 358 places, 357 transitions, 739 flow. Second operand 3 states and 1264 transitions. [2025-03-17 11:16:42,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 363 transitions, 813 flow [2025-03-17 11:16:42,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 363 transitions, 813 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:16:42,741 INFO L231 Difference]: Finished difference. Result has 358 places, 357 transitions, 754 flow [2025-03-17 11:16:42,741 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=451, PETRI_DIFFERENCE_MINUEND_FLOW=733, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=754, PETRI_PLACES=358, PETRI_TRANSITIONS=357} [2025-03-17 11:16:42,742 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -17 predicate places. [2025-03-17 11:16:42,742 INFO L471 AbstractCegarLoop]: Abstraction has has 358 places, 357 transitions, 754 flow [2025-03-17 11:16:42,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 411.3333333333333) internal successors, (1234), 3 states have internal predecessors, (1234), 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-17 11:16:42,744 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:16:42,744 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, 1, 1, 1, 1, 1, 1] [2025-03-17 11:16:42,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:16:42,744 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting cleanerErr8ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-17 11:16:42,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:16:42,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1128751062, now seen corresponding path program 1 times [2025-03-17 11:16:42,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:16:42,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269366301] [2025-03-17 11:16:42,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:16:42,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:16:42,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-17 11:16:42,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-17 11:16:42,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:16:42,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:16:42,838 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-17 11:16:42,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:16:42,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269366301] [2025-03-17 11:16:42,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269366301] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:16:42,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:16:42,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:16:42,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334019747] [2025-03-17 11:16:42,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:16:42,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:16:42,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:16:42,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:16:42,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:16:42,862 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 404 out of 451 [2025-03-17 11:16:42,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 357 transitions, 754 flow. Second operand has 3 states, 3 states have (on average 405.6666666666667) internal successors, (1217), 3 states have internal predecessors, (1217), 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-17 11:16:42,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:16:42,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 404 of 451 [2025-03-17 11:16:42,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:16:43,436 INFO L124 PetriNetUnfolderBase]: 1145/5436 cut-off events. [2025-03-17 11:16:43,436 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-03-17 11:16:43,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7325 conditions, 5436 events. 1145/5436 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 45066 event pairs, 423 based on Foata normal form. 0/4800 useless extension candidates. Maximal degree in co-relation 7176. Up to 1616 conditions per place. [2025-03-17 11:16:43,459 INFO L140 encePairwiseOnDemand]: 444/451 looper letters, 33 selfloop transitions, 3 changer transitions 0/365 dead transitions. [2025-03-17 11:16:43,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 365 transitions, 845 flow [2025-03-17 11:16:43,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:16:43,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:16:43,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1252 transitions. [2025-03-17 11:16:43,462 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.925351071692535 [2025-03-17 11:16:43,462 INFO L175 Difference]: Start difference. First operand has 358 places, 357 transitions, 754 flow. Second operand 3 states and 1252 transitions. [2025-03-17 11:16:43,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 365 transitions, 845 flow [2025-03-17 11:16:43,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 365 transitions, 845 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:16:43,466 INFO L231 Difference]: Finished difference. Result has 357 places, 356 transitions, 767 flow [2025-03-17 11:16:43,467 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=451, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=767, PETRI_PLACES=357, PETRI_TRANSITIONS=356} [2025-03-17 11:16:43,469 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -18 predicate places. [2025-03-17 11:16:43,470 INFO L471 AbstractCegarLoop]: Abstraction has has 357 places, 356 transitions, 767 flow [2025-03-17 11:16:43,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 405.6666666666667) internal successors, (1217), 3 states have internal predecessors, (1217), 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-17 11:16:43,470 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:16:43,471 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, 1, 1, 1, 1, 1, 1] [2025-03-17 11:16:43,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:16:43,471 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-17 11:16:43,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:16:43,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1020458717, now seen corresponding path program 1 times [2025-03-17 11:16:43,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:16:43,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531445828] [2025-03-17 11:16:43,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:16:43,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:16:43,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-17 11:16:43,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-17 11:16:43,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:16:43,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:16:43,540 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-17 11:16:43,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:16:43,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531445828] [2025-03-17 11:16:43,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531445828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:16:43,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:16:43,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:16:43,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470883325] [2025-03-17 11:16:43,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:16:43,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:16:43,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:16:43,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:16:43,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:16:43,559 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 451 [2025-03-17 11:16:43,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 356 transitions, 767 flow. Second operand has 3 states, 3 states have (on average 409.3333333333333) internal successors, (1228), 3 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:16:43,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:16:43,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 451 [2025-03-17 11:16:43,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:16:44,380 INFO L124 PetriNetUnfolderBase]: 1273/6599 cut-off events. [2025-03-17 11:16:44,380 INFO L125 PetriNetUnfolderBase]: For 98/108 co-relation queries the response was YES. [2025-03-17 11:16:44,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8998 conditions, 6599 events. 1273/6599 cut-off events. For 98/108 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 56464 event pairs, 460 based on Foata normal form. 0/5833 useless extension candidates. Maximal degree in co-relation 8848. Up to 1018 conditions per place. [2025-03-17 11:16:44,419 INFO L140 encePairwiseOnDemand]: 440/451 looper letters, 40 selfloop transitions, 8 changer transitions 0/378 dead transitions. [2025-03-17 11:16:44,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 378 transitions, 913 flow [2025-03-17 11:16:44,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:16:44,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:16:44,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1275 transitions. [2025-03-17 11:16:44,422 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9423503325942351 [2025-03-17 11:16:44,422 INFO L175 Difference]: Start difference. First operand has 357 places, 356 transitions, 767 flow. Second operand 3 states and 1275 transitions. [2025-03-17 11:16:44,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 378 transitions, 913 flow [2025-03-17 11:16:44,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 378 transitions, 913 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:16:44,428 INFO L231 Difference]: Finished difference. Result has 361 places, 364 transitions, 837 flow [2025-03-17 11:16:44,428 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=451, PETRI_DIFFERENCE_MINUEND_FLOW=767, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=837, PETRI_PLACES=361, PETRI_TRANSITIONS=364} [2025-03-17 11:16:44,429 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -14 predicate places. [2025-03-17 11:16:44,429 INFO L471 AbstractCegarLoop]: Abstraction has has 361 places, 364 transitions, 837 flow [2025-03-17 11:16:44,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 409.3333333333333) internal successors, (1228), 3 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:16:44,430 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:16:44,430 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:16:44,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 11:16:44,430 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting cleanerErr7ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-17 11:16:44,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:16:44,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1323137197, now seen corresponding path program 1 times [2025-03-17 11:16:44,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:16:44,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802384992] [2025-03-17 11:16:44,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:16:44,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:16:44,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-17 11:16:44,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-17 11:16:44,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:16:44,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:16:44,678 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-17 11:16:44,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:16:44,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802384992] [2025-03-17 11:16:44,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802384992] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:16:44,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:16:44,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:16:44,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359678013] [2025-03-17 11:16:44,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:16:44,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:16:44,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:16:44,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:16:44,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:16:44,762 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 451 [2025-03-17 11:16:44,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 364 transitions, 837 flow. Second operand has 3 states, 3 states have (on average 410.3333333333333) internal successors, (1231), 3 states have internal predecessors, (1231), 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-17 11:16:44,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:16:44,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 451 [2025-03-17 11:16:44,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:16:46,033 INFO L124 PetriNetUnfolderBase]: 2962/12841 cut-off events. [2025-03-17 11:16:46,033 INFO L125 PetriNetUnfolderBase]: For 405/423 co-relation queries the response was YES. [2025-03-17 11:16:46,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19069 conditions, 12841 events. 2962/12841 cut-off events. For 405/423 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 123395 event pairs, 1539 based on Foata normal form. 0/11549 useless extension candidates. Maximal degree in co-relation 18916. Up to 3590 conditions per place. [2025-03-17 11:16:46,086 INFO L140 encePairwiseOnDemand]: 441/451 looper letters, 38 selfloop transitions, 9 changer transitions 0/382 dead transitions. [2025-03-17 11:16:46,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 382 transitions, 970 flow [2025-03-17 11:16:46,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:16:46,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:16:46,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1272 transitions. [2025-03-17 11:16:46,089 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9401330376940134 [2025-03-17 11:16:46,089 INFO L175 Difference]: Start difference. First operand has 361 places, 364 transitions, 837 flow. Second operand 3 states and 1272 transitions. [2025-03-17 11:16:46,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 382 transitions, 970 flow [2025-03-17 11:16:46,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 382 transitions, 954 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:16:46,096 INFO L231 Difference]: Finished difference. Result has 363 places, 372 transitions, 891 flow [2025-03-17 11:16:46,097 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=451, PETRI_DIFFERENCE_MINUEND_FLOW=821, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=891, PETRI_PLACES=363, PETRI_TRANSITIONS=372} [2025-03-17 11:16:46,097 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -12 predicate places. [2025-03-17 11:16:46,097 INFO L471 AbstractCegarLoop]: Abstraction has has 363 places, 372 transitions, 891 flow [2025-03-17 11:16:46,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 410.3333333333333) internal successors, (1231), 3 states have internal predecessors, (1231), 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-17 11:16:46,098 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:16:46,098 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:16:46,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 11:16:46,098 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-17 11:16:46,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:16:46,099 INFO L85 PathProgramCache]: Analyzing trace with hash -635250938, now seen corresponding path program 1 times [2025-03-17 11:16:46,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:16:46,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837224229] [2025-03-17 11:16:46,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:16:46,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:16:46,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-17 11:16:46,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-17 11:16:46,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:16:46,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:16:46,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-17 11:16:46,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:16:46,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837224229] [2025-03-17 11:16:46,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837224229] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:16:46,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:16:46,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:16:46,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256785667] [2025-03-17 11:16:46,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:16:46,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:16:46,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:16:46,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:16:46,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:16:46,359 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 451 [2025-03-17 11:16:46,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 372 transitions, 891 flow. Second operand has 5 states, 5 states have (on average 412.8) internal successors, (2064), 5 states have internal predecessors, (2064), 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-17 11:16:46,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:16:46,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 451 [2025-03-17 11:16:46,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:16:47,418 INFO L124 PetriNetUnfolderBase]: 1605/8889 cut-off events. [2025-03-17 11:16:47,418 INFO L125 PetriNetUnfolderBase]: For 340/354 co-relation queries the response was YES. [2025-03-17 11:16:47,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13010 conditions, 8889 events. 1605/8889 cut-off events. For 340/354 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 84192 event pairs, 1094 based on Foata normal form. 4/7970 useless extension candidates. Maximal degree in co-relation 12854. Up to 1805 conditions per place. [2025-03-17 11:16:47,458 INFO L140 encePairwiseOnDemand]: 442/451 looper letters, 34 selfloop transitions, 8 changer transitions 0/386 dead transitions. [2025-03-17 11:16:47,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 386 transitions, 1002 flow [2025-03-17 11:16:47,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:16:47,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:16:47,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2509 transitions. [2025-03-17 11:16:47,463 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9271988174427199 [2025-03-17 11:16:47,463 INFO L175 Difference]: Start difference. First operand has 363 places, 372 transitions, 891 flow. Second operand 6 states and 2509 transitions. [2025-03-17 11:16:47,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 386 transitions, 1002 flow [2025-03-17 11:16:47,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 386 transitions, 984 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:16:47,474 INFO L231 Difference]: Finished difference. Result has 370 places, 376 transitions, 918 flow [2025-03-17 11:16:47,474 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=451, PETRI_DIFFERENCE_MINUEND_FLOW=868, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=918, PETRI_PLACES=370, PETRI_TRANSITIONS=376} [2025-03-17 11:16:47,475 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -5 predicate places. [2025-03-17 11:16:47,475 INFO L471 AbstractCegarLoop]: Abstraction has has 370 places, 376 transitions, 918 flow [2025-03-17 11:16:47,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 412.8) internal successors, (2064), 5 states have internal predecessors, (2064), 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-17 11:16:47,476 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:16:47,476 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:16:47,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 11:16:47,476 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting cleanerErr5ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-17 11:16:47,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:16:47,477 INFO L85 PathProgramCache]: Analyzing trace with hash 2057319643, now seen corresponding path program 1 times [2025-03-17 11:16:47,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:16:47,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807202531] [2025-03-17 11:16:47,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:16:47,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:16:47,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-17 11:16:47,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-17 11:16:47,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:16:47,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:16:47,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:16:47,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:16:47,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807202531] [2025-03-17 11:16:47,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807202531] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:16:47,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:16:47,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:16:47,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881884728] [2025-03-17 11:16:47,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:16:47,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:16:47,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:16:47,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:16:47,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:16:47,661 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 396 out of 451 [2025-03-17 11:16:47,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 376 transitions, 918 flow. Second operand has 3 states, 3 states have (on average 399.0) internal successors, (1197), 3 states have internal predecessors, (1197), 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-17 11:16:47,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:16:47,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 396 of 451 [2025-03-17 11:16:47,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:16:50,232 INFO L124 PetriNetUnfolderBase]: 4837/17593 cut-off events. [2025-03-17 11:16:50,233 INFO L125 PetriNetUnfolderBase]: For 1337/1450 co-relation queries the response was YES. [2025-03-17 11:16:50,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29070 conditions, 17593 events. 4837/17593 cut-off events. For 1337/1450 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 176184 event pairs, 3137 based on Foata normal form. 13/15854 useless extension candidates. Maximal degree in co-relation 28909. Up to 6610 conditions per place. [2025-03-17 11:16:50,308 INFO L140 encePairwiseOnDemand]: 441/451 looper letters, 50 selfloop transitions, 10 changer transitions 0/393 dead transitions. [2025-03-17 11:16:50,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 393 transitions, 1085 flow [2025-03-17 11:16:50,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:16:50,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:16:50,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1242 transitions. [2025-03-17 11:16:50,310 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.917960088691796 [2025-03-17 11:16:50,310 INFO L175 Difference]: Start difference. First operand has 370 places, 376 transitions, 918 flow. Second operand 3 states and 1242 transitions. [2025-03-17 11:16:50,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 393 transitions, 1085 flow [2025-03-17 11:16:50,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 393 transitions, 1081 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:16:50,320 INFO L231 Difference]: Finished difference. Result has 373 places, 384 transitions, 998 flow [2025-03-17 11:16:50,321 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=451, PETRI_DIFFERENCE_MINUEND_FLOW=914, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=998, PETRI_PLACES=373, PETRI_TRANSITIONS=384} [2025-03-17 11:16:50,321 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -2 predicate places. [2025-03-17 11:16:50,321 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 384 transitions, 998 flow [2025-03-17 11:16:50,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 399.0) internal successors, (1197), 3 states have internal predecessors, (1197), 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-17 11:16:50,322 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:16:50,322 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:16:50,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 11:16:50,323 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-17 11:16:50,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:16:50,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1012223426, now seen corresponding path program 1 times [2025-03-17 11:16:50,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:16:50,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727207320] [2025-03-17 11:16:50,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:16:50,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:16:50,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-17 11:16:50,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-17 11:16:50,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:16:50,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:16:50,450 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-17 11:16:50,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:16:50,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727207320] [2025-03-17 11:16:50,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727207320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:16:50,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:16:50,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:16:50,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179959801] [2025-03-17 11:16:50,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:16:50,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:16:50,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:16:50,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:16:50,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:16:50,512 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 451 [2025-03-17 11:16:50,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 384 transitions, 998 flow. Second operand has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 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-17 11:16:50,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:16:50,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 451 [2025-03-17 11:16:50,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:16:51,906 INFO L124 PetriNetUnfolderBase]: 2784/13269 cut-off events. [2025-03-17 11:16:51,906 INFO L125 PetriNetUnfolderBase]: For 3901/4237 co-relation queries the response was YES. [2025-03-17 11:16:51,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22500 conditions, 13269 events. 2784/13269 cut-off events. For 3901/4237 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 133009 event pairs, 1455 based on Foata normal form. 33/11987 useless extension candidates. Maximal degree in co-relation 22339. Up to 3418 conditions per place. [2025-03-17 11:16:51,978 INFO L140 encePairwiseOnDemand]: 446/451 looper letters, 43 selfloop transitions, 8 changer transitions 0/397 dead transitions. [2025-03-17 11:16:51,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 397 transitions, 1153 flow [2025-03-17 11:16:51,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:16:51,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:16:51,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1270 transitions. [2025-03-17 11:16:51,980 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9386548410938654 [2025-03-17 11:16:51,980 INFO L175 Difference]: Start difference. First operand has 373 places, 384 transitions, 998 flow. Second operand 3 states and 1270 transitions. [2025-03-17 11:16:51,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 397 transitions, 1153 flow [2025-03-17 11:16:51,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 397 transitions, 1115 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-03-17 11:16:51,997 INFO L231 Difference]: Finished difference. Result has 375 places, 390 transitions, 1042 flow [2025-03-17 11:16:51,997 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=451, PETRI_DIFFERENCE_MINUEND_FLOW=968, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1042, PETRI_PLACES=375, PETRI_TRANSITIONS=390} [2025-03-17 11:16:51,998 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, 0 predicate places. [2025-03-17 11:16:51,998 INFO L471 AbstractCegarLoop]: Abstraction has has 375 places, 390 transitions, 1042 flow [2025-03-17 11:16:51,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 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-17 11:16:51,999 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:16:51,999 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:16:51,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 11:16:51,999 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-17 11:16:52,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:16:52,000 INFO L85 PathProgramCache]: Analyzing trace with hash 188053632, now seen corresponding path program 1 times [2025-03-17 11:16:52,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:16:52,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738370785] [2025-03-17 11:16:52,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:16:52,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:16:52,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-17 11:16:52,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-17 11:16:52,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:16:52,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:16:52,698 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:16:52,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:16:52,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738370785] [2025-03-17 11:16:52,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738370785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:16:52,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:16:52,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:16:52,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111406349] [2025-03-17 11:16:52,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:16:52,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:16:52,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:16:52,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:16:52,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:16:52,892 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 451 [2025-03-17 11:16:52,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 390 transitions, 1042 flow. Second operand has 6 states, 6 states have (on average 395.8333333333333) internal successors, (2375), 6 states have internal predecessors, (2375), 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-17 11:16:52,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:16:52,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 451 [2025-03-17 11:16:52,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:16:56,013 INFO L124 PetriNetUnfolderBase]: 6462/22936 cut-off events. [2025-03-17 11:16:56,013 INFO L125 PetriNetUnfolderBase]: For 10989/11460 co-relation queries the response was YES. [2025-03-17 11:16:56,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43356 conditions, 22936 events. 6462/22936 cut-off events. For 10989/11460 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 242138 event pairs, 3403 based on Foata normal form. 33/20783 useless extension candidates. Maximal degree in co-relation 43193. Up to 7809 conditions per place. [2025-03-17 11:16:56,125 INFO L140 encePairwiseOnDemand]: 437/451 looper letters, 98 selfloop transitions, 54 changer transitions 0/485 dead transitions. [2025-03-17 11:16:56,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 485 transitions, 1708 flow [2025-03-17 11:16:56,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:16:56,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:16:56,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2480 transitions. [2025-03-17 11:16:56,128 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9164818920916482 [2025-03-17 11:16:56,128 INFO L175 Difference]: Start difference. First operand has 375 places, 390 transitions, 1042 flow. Second operand 6 states and 2480 transitions. [2025-03-17 11:16:56,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 485 transitions, 1708 flow [2025-03-17 11:16:56,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 485 transitions, 1692 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:16:56,150 INFO L231 Difference]: Finished difference. Result has 382 places, 442 transitions, 1494 flow [2025-03-17 11:16:56,150 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=451, PETRI_DIFFERENCE_MINUEND_FLOW=1026, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1494, PETRI_PLACES=382, PETRI_TRANSITIONS=442} [2025-03-17 11:16:56,150 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, 7 predicate places. [2025-03-17 11:16:56,151 INFO L471 AbstractCegarLoop]: Abstraction has has 382 places, 442 transitions, 1494 flow [2025-03-17 11:16:56,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 395.8333333333333) internal successors, (2375), 6 states have internal predecessors, (2375), 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-17 11:16:56,152 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:16:56,152 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, 1, 1, 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-17 11:16:56,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 11:16:56,152 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting cleanerErr3ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-17 11:16:56,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:16:56,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1670077596, now seen corresponding path program 1 times [2025-03-17 11:16:56,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:16:56,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475150900] [2025-03-17 11:16:56,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:16:56,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:16:56,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-17 11:16:56,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-17 11:16:56,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:16:56,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:16:56,272 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-17 11:16:56,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:16:56,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475150900] [2025-03-17 11:16:56,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475150900] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:16:56,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:16:56,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:16:56,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016092927] [2025-03-17 11:16:56,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:16:56,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:16:56,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:16:56,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:16:56,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:16:56,373 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 451 [2025-03-17 11:16:56,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 442 transitions, 1494 flow. Second operand has 5 states, 5 states have (on average 413.0) internal successors, (2065), 5 states have internal predecessors, (2065), 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-17 11:16:56,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:16:56,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 451 [2025-03-17 11:16:56,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:16:58,821 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([890] L1029-2-->L1029: Formula: (= (store |v_#race_36| v_~datas~0.base_17 (store (select |v_#race_36| v_~datas~0.base_17) (+ v_threadThread1of1ForFork1_~i~0_7 v_~datas~0.offset_17) |v_threadThread1of1ForFork1_#t~nondet4_3|)) |v_#race_35|) InVars {#race=|v_#race_36|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet4=|v_threadThread1of1ForFork1_#t~nondet4_3|, ~datas~0.base=v_~datas~0.base_17, ~datas~0.offset=v_~datas~0.offset_17} OutVars{#race=|v_#race_35|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet4=|v_threadThread1of1ForFork1_#t~nondet4_3|, ~datas~0.base=v_~datas~0.base_17, ~datas~0.offset=v_~datas~0.offset_17} AuxVars[] AssignedVars[#race][344], [Black: 509#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 508#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), 452#(= |#race~threads_total~0| 0), 161#L1029true, Black: 462#true, Black: 466#true, 515#true, 505#true, 445#true, 472#(= |#race~datas~0| 0), Black: 470#true, 98#L1039-9true, 468#(= |#race~tids~0| 0), Black: 476#(= |#race~threads_alive~0| 0), Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 443#true, Black: 486#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 488#(and (<= ~threads_total~0 0) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 487#(<= ~threads_total~0 0), Black: 490#(and (= |ULTIMATE.start_main_~i~2#1| 0) (<= ~threads_total~0 0)), 136#L1061-3true, Black: 497#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) |cleanerThread1of1ForFork0_#t~nondet8|), Black: 502#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 464#(= |#race~datas_mutex~0| 0), Black: 507#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)]) [2025-03-17 11:16:58,822 INFO L294 olderBase$Statistics]: this new event has 388 ancestors and is cut-off event [2025-03-17 11:16:58,822 INFO L297 olderBase$Statistics]: existing Event has 388 ancestors and is cut-off event [2025-03-17 11:16:58,822 INFO L297 olderBase$Statistics]: existing Event has 284 ancestors and is cut-off event [2025-03-17 11:16:58,822 INFO L297 olderBase$Statistics]: existing Event has 284 ancestors and is cut-off event [2025-03-17 11:16:58,885 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([890] L1029-2-->L1029: Formula: (= (store |v_#race_36| v_~datas~0.base_17 (store (select |v_#race_36| v_~datas~0.base_17) (+ v_threadThread1of1ForFork1_~i~0_7 v_~datas~0.offset_17) |v_threadThread1of1ForFork1_#t~nondet4_3|)) |v_#race_35|) InVars {#race=|v_#race_36|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet4=|v_threadThread1of1ForFork1_#t~nondet4_3|, ~datas~0.base=v_~datas~0.base_17, ~datas~0.offset=v_~datas~0.offset_17} OutVars{#race=|v_#race_35|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet4=|v_threadThread1of1ForFork1_#t~nondet4_3|, ~datas~0.base=v_~datas~0.base_17, ~datas~0.offset=v_~datas~0.offset_17} AuxVars[] AssignedVars[#race][444], [Black: 509#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 452#(= |#race~threads_total~0| 0), Black: 508#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), 161#L1029true, 302#L1038-1true, Black: 462#true, Black: 466#true, 515#true, 445#true, 505#true, 472#(= |#race~datas~0| 0), Black: 470#true, 468#(= |#race~tids~0| 0), Black: 474#true, Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 443#true, Black: 486#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 488#(and (<= ~threads_total~0 0) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 487#(<= ~threads_total~0 0), Black: 490#(and (= |ULTIMATE.start_main_~i~2#1| 0) (<= ~threads_total~0 0)), Black: 497#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) |cleanerThread1of1ForFork0_#t~nondet8|), 241#L1072-4true, Black: 502#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 464#(= |#race~datas_mutex~0| 0), Black: 507#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)]) [2025-03-17 11:16:58,886 INFO L294 olderBase$Statistics]: this new event has 392 ancestors and is cut-off event [2025-03-17 11:16:58,886 INFO L297 olderBase$Statistics]: existing Event has 392 ancestors and is cut-off event [2025-03-17 11:16:58,886 INFO L297 olderBase$Statistics]: existing Event has 288 ancestors and is cut-off event [2025-03-17 11:16:58,886 INFO L297 olderBase$Statistics]: existing Event has 288 ancestors and is cut-off event [2025-03-17 11:16:58,931 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([890] L1029-2-->L1029: Formula: (= (store |v_#race_36| v_~datas~0.base_17 (store (select |v_#race_36| v_~datas~0.base_17) (+ v_threadThread1of1ForFork1_~i~0_7 v_~datas~0.offset_17) |v_threadThread1of1ForFork1_#t~nondet4_3|)) |v_#race_35|) InVars {#race=|v_#race_36|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet4=|v_threadThread1of1ForFork1_#t~nondet4_3|, ~datas~0.base=v_~datas~0.base_17, ~datas~0.offset=v_~datas~0.offset_17} OutVars{#race=|v_#race_35|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet4=|v_threadThread1of1ForFork1_#t~nondet4_3|, ~datas~0.base=v_~datas~0.base_17, ~datas~0.offset=v_~datas~0.offset_17} AuxVars[] AssignedVars[#race][419], [Black: 509#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 452#(= |#race~threads_total~0| 0), Black: 508#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), 161#L1029true, Black: 462#true, Black: 466#true, 515#true, 445#true, 505#true, 472#(= |#race~datas~0| 0), Black: 470#true, 98#L1039-9true, 468#(= |#race~tids~0| 0), Black: 474#true, Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 443#true, Black: 486#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 488#(and (<= ~threads_total~0 0) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 487#(<= ~threads_total~0 0), Black: 490#(and (= |ULTIMATE.start_main_~i~2#1| 0) (<= ~threads_total~0 0)), Black: 497#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) |cleanerThread1of1ForFork0_#t~nondet8|), 241#L1072-4true, Black: 502#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 464#(= |#race~datas_mutex~0| 0), Black: 507#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)]) [2025-03-17 11:16:58,931 INFO L294 olderBase$Statistics]: this new event has 393 ancestors and is cut-off event [2025-03-17 11:16:58,931 INFO L297 olderBase$Statistics]: existing Event has 393 ancestors and is cut-off event [2025-03-17 11:16:58,931 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2025-03-17 11:16:58,931 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2025-03-17 11:16:59,079 INFO L124 PetriNetUnfolderBase]: 4005/19654 cut-off events. [2025-03-17 11:16:59,080 INFO L125 PetriNetUnfolderBase]: For 6760/7165 co-relation queries the response was YES. [2025-03-17 11:16:59,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35703 conditions, 19654 events. 4005/19654 cut-off events. For 6760/7165 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 212484 event pairs, 1727 based on Foata normal form. 16/17897 useless extension candidates. Maximal degree in co-relation 35535. Up to 4020 conditions per place. [2025-03-17 11:16:59,191 INFO L140 encePairwiseOnDemand]: 442/451 looper letters, 25 selfloop transitions, 4 changer transitions 17/454 dead transitions. [2025-03-17 11:16:59,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 454 transitions, 1605 flow [2025-03-17 11:16:59,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:16:59,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:16:59,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2510 transitions. [2025-03-17 11:16:59,195 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9275683665927569 [2025-03-17 11:16:59,195 INFO L175 Difference]: Start difference. First operand has 382 places, 442 transitions, 1494 flow. Second operand 6 states and 2510 transitions. [2025-03-17 11:16:59,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 387 places, 454 transitions, 1605 flow [2025-03-17 11:16:59,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 387 places, 454 transitions, 1565 flow, removed 20 selfloop flow, removed 0 redundant places. [2025-03-17 11:16:59,221 INFO L231 Difference]: Finished difference. Result has 389 places, 437 transitions, 1441 flow [2025-03-17 11:16:59,222 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=451, PETRI_DIFFERENCE_MINUEND_FLOW=1449, PETRI_DIFFERENCE_MINUEND_PLACES=382, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=441, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=437, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1441, PETRI_PLACES=389, PETRI_TRANSITIONS=437} [2025-03-17 11:16:59,222 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, 14 predicate places. [2025-03-17 11:16:59,222 INFO L471 AbstractCegarLoop]: Abstraction has has 389 places, 437 transitions, 1441 flow [2025-03-17 11:16:59,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 413.0) internal successors, (2065), 5 states have internal predecessors, (2065), 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-17 11:16:59,223 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:16:59,224 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 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-17 11:16:59,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 11:16:59,224 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting cleanerErr7ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-17 11:16:59,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:16:59,225 INFO L85 PathProgramCache]: Analyzing trace with hash 589501517, now seen corresponding path program 1 times [2025-03-17 11:16:59,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:16:59,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389617044] [2025-03-17 11:16:59,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:16:59,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:16:59,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-17 11:16:59,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-17 11:16:59,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:16:59,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:16:59,555 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:16:59,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:16:59,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389617044] [2025-03-17 11:16:59,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389617044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:16:59,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:16:59,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 11:16:59,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210020881] [2025-03-17 11:16:59,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:16:59,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 11:16:59,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:16:59,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 11:16:59,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:16:59,962 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 399 out of 451 [2025-03-17 11:16:59,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 437 transitions, 1441 flow. Second operand has 8 states, 8 states have (on average 400.875) internal successors, (3207), 8 states have internal predecessors, (3207), 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-17 11:16:59,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:16:59,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 399 of 451 [2025-03-17 11:16:59,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:17:03,063 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([890] L1029-2-->L1029: Formula: (= (store |v_#race_36| v_~datas~0.base_17 (store (select |v_#race_36| v_~datas~0.base_17) (+ v_threadThread1of1ForFork1_~i~0_7 v_~datas~0.offset_17) |v_threadThread1of1ForFork1_#t~nondet4_3|)) |v_#race_35|) InVars {#race=|v_#race_36|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet4=|v_threadThread1of1ForFork1_#t~nondet4_3|, ~datas~0.base=v_~datas~0.base_17, ~datas~0.offset=v_~datas~0.offset_17} OutVars{#race=|v_#race_35|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet4=|v_threadThread1of1ForFork1_#t~nondet4_3|, ~datas~0.base=v_~datas~0.base_17, ~datas~0.offset=v_~datas~0.offset_17} AuxVars[] AssignedVars[#race][337], [Black: 509#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 508#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), 452#(= |#race~threads_total~0| 0), 161#L1029true, Black: 519#(and (<= ~threads_total~0 0) (= cleanerThread1of1ForFork0_~i~1 0)), Black: 518#(<= ~threads_total~0 0), Black: 462#true, Black: 466#true, 515#true, 505#true, 445#true, 472#(= |#race~datas~0| 0), Black: 470#true, 539#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 98#L1039-9true, 468#(= |#race~tids~0| 0), Black: 476#(= |#race~threads_alive~0| 0), Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 443#true, Black: 486#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 488#(and (<= ~threads_total~0 0) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 487#(<= ~threads_total~0 0), Black: 490#(and (= |ULTIMATE.start_main_~i~2#1| 0) (<= ~threads_total~0 0)), 136#L1061-3true, Black: 497#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) |cleanerThread1of1ForFork0_#t~nondet8|), Black: 502#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 464#(= |#race~datas_mutex~0| 0), Black: 507#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)]) [2025-03-17 11:17:03,063 INFO L294 olderBase$Statistics]: this new event has 388 ancestors and is cut-off event [2025-03-17 11:17:03,063 INFO L297 olderBase$Statistics]: existing Event has 284 ancestors and is cut-off event [2025-03-17 11:17:03,063 INFO L297 olderBase$Statistics]: existing Event has 388 ancestors and is cut-off event [2025-03-17 11:17:03,064 INFO L297 olderBase$Statistics]: existing Event has 284 ancestors and is cut-off event [2025-03-17 11:17:03,132 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([890] L1029-2-->L1029: Formula: (= (store |v_#race_36| v_~datas~0.base_17 (store (select |v_#race_36| v_~datas~0.base_17) (+ v_threadThread1of1ForFork1_~i~0_7 v_~datas~0.offset_17) |v_threadThread1of1ForFork1_#t~nondet4_3|)) |v_#race_35|) InVars {#race=|v_#race_36|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet4=|v_threadThread1of1ForFork1_#t~nondet4_3|, ~datas~0.base=v_~datas~0.base_17, ~datas~0.offset=v_~datas~0.offset_17} OutVars{#race=|v_#race_35|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet4=|v_threadThread1of1ForFork1_#t~nondet4_3|, ~datas~0.base=v_~datas~0.base_17, ~datas~0.offset=v_~datas~0.offset_17} AuxVars[] AssignedVars[#race][337], [Black: 509#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 508#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), 452#(= |#race~threads_total~0| 0), 161#L1029true, Black: 519#(and (<= ~threads_total~0 0) (= cleanerThread1of1ForFork0_~i~1 0)), Black: 518#(<= ~threads_total~0 0), Black: 462#true, 271#L1034true, Black: 466#true, 515#true, 505#true, 445#true, 472#(= |#race~datas~0| 0), Black: 470#true, 539#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 468#(= |#race~tids~0| 0), Black: 476#(= |#race~threads_alive~0| 0), Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 443#true, Black: 486#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 488#(and (<= ~threads_total~0 0) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 487#(<= ~threads_total~0 0), Black: 490#(and (= |ULTIMATE.start_main_~i~2#1| 0) (<= ~threads_total~0 0)), 136#L1061-3true, Black: 497#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) |cleanerThread1of1ForFork0_#t~nondet8|), Black: 502#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 464#(= |#race~datas_mutex~0| 0), Black: 507#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)]) [2025-03-17 11:17:03,132 INFO L294 olderBase$Statistics]: this new event has 392 ancestors and is cut-off event [2025-03-17 11:17:03,132 INFO L297 olderBase$Statistics]: existing Event has 288 ancestors and is cut-off event [2025-03-17 11:17:03,132 INFO L297 olderBase$Statistics]: existing Event has 288 ancestors and is cut-off event [2025-03-17 11:17:03,132 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2025-03-17 11:17:03,326 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([890] L1029-2-->L1029: Formula: (= (store |v_#race_36| v_~datas~0.base_17 (store (select |v_#race_36| v_~datas~0.base_17) (+ v_threadThread1of1ForFork1_~i~0_7 v_~datas~0.offset_17) |v_threadThread1of1ForFork1_#t~nondet4_3|)) |v_#race_35|) InVars {#race=|v_#race_36|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet4=|v_threadThread1of1ForFork1_#t~nondet4_3|, ~datas~0.base=v_~datas~0.base_17, ~datas~0.offset=v_~datas~0.offset_17} OutVars{#race=|v_#race_35|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet4=|v_threadThread1of1ForFork1_#t~nondet4_3|, ~datas~0.base=v_~datas~0.base_17, ~datas~0.offset=v_~datas~0.offset_17} AuxVars[] AssignedVars[#race][337], [Black: 509#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 508#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), 452#(= |#race~threads_total~0| 0), 161#L1029true, Black: 519#(and (<= ~threads_total~0 0) (= cleanerThread1of1ForFork0_~i~1 0)), Black: 518#(<= ~threads_total~0 0), 211#L1036true, Black: 462#true, 515#true, Black: 466#true, 505#true, 445#true, 472#(= |#race~datas~0| 0), Black: 470#true, 539#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 468#(= |#race~tids~0| 0), Black: 476#(= |#race~threads_alive~0| 0), Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 443#true, Black: 486#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 488#(and (<= ~threads_total~0 0) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 487#(<= ~threads_total~0 0), Black: 490#(and (= |ULTIMATE.start_main_~i~2#1| 0) (<= ~threads_total~0 0)), 136#L1061-3true, Black: 497#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) |cleanerThread1of1ForFork0_#t~nondet8|), Black: 502#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 464#(= |#race~datas_mutex~0| 0), Black: 507#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)]) [2025-03-17 11:17:03,326 INFO L294 olderBase$Statistics]: this new event has 394 ancestors and is cut-off event [2025-03-17 11:17:03,326 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2025-03-17 11:17:03,326 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2025-03-17 11:17:03,326 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2025-03-17 11:17:03,408 INFO L124 PetriNetUnfolderBase]: 6188/23800 cut-off events. [2025-03-17 11:17:03,409 INFO L125 PetriNetUnfolderBase]: For 17047/17953 co-relation queries the response was YES. [2025-03-17 11:17:03,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49266 conditions, 23800 events. 6188/23800 cut-off events. For 17047/17953 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 255113 event pairs, 2177 based on Foata normal form. 38/21869 useless extension candidates. Maximal degree in co-relation 49092. Up to 5452 conditions per place. [2025-03-17 11:17:03,515 INFO L140 encePairwiseOnDemand]: 438/451 looper letters, 100 selfloop transitions, 48 changer transitions 0/496 dead transitions. [2025-03-17 11:17:03,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 496 transitions, 2066 flow [2025-03-17 11:17:03,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 11:17:03,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-17 11:17:03,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 4471 transitions. [2025-03-17 11:17:03,519 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9012295908083048 [2025-03-17 11:17:03,519 INFO L175 Difference]: Start difference. First operand has 389 places, 437 transitions, 1441 flow. Second operand 11 states and 4471 transitions. [2025-03-17 11:17:03,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 496 transitions, 2066 flow [2025-03-17 11:17:03,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 386 places, 496 transitions, 2034 flow, removed 9 selfloop flow, removed 9 redundant places. [2025-03-17 11:17:03,544 INFO L231 Difference]: Finished difference. Result has 390 places, 460 transitions, 1808 flow [2025-03-17 11:17:03,544 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=451, PETRI_DIFFERENCE_MINUEND_FLOW=1413, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=437, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=398, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1808, PETRI_PLACES=390, PETRI_TRANSITIONS=460} [2025-03-17 11:17:03,545 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, 15 predicate places. [2025-03-17 11:17:03,545 INFO L471 AbstractCegarLoop]: Abstraction has has 390 places, 460 transitions, 1808 flow [2025-03-17 11:17:03,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 400.875) internal successors, (3207), 8 states have internal predecessors, (3207), 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-17 11:17:03,546 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:17:03,546 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:17:03,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 11:17:03,546 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-17 11:17:03,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:17:03,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1352526538, now seen corresponding path program 1 times [2025-03-17 11:17:03,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:17:03,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206666522] [2025-03-17 11:17:03,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:17:03,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:17:03,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-17 11:17:03,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-17 11:17:03,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:17:03,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:17:04,043 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:17:04,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:17:04,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206666522] [2025-03-17 11:17:04,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206666522] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:17:04,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:17:04,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 11:17:04,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259765925] [2025-03-17 11:17:04,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:17:04,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 11:17:04,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:17:04,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 11:17:04,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-17 11:17:04,512 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 451 [2025-03-17 11:17:04,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 460 transitions, 1808 flow. Second operand has 11 states, 11 states have (on average 388.72727272727275) internal successors, (4276), 11 states have internal predecessors, (4276), 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-17 11:17:04,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:17:04,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 451 [2025-03-17 11:17:04,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:17:08,946 INFO L124 PetriNetUnfolderBase]: 7445/26662 cut-off events. [2025-03-17 11:17:08,947 INFO L125 PetriNetUnfolderBase]: For 35394/36410 co-relation queries the response was YES. [2025-03-17 11:17:09,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59433 conditions, 26662 events. 7445/26662 cut-off events. For 35394/36410 co-relation queries the response was YES. Maximal size of possible extension queue 488. Compared 288087 event pairs, 2358 based on Foata normal form. 277/24667 useless extension candidates. Maximal degree in co-relation 59265. Up to 4934 conditions per place. [2025-03-17 11:17:09,067 INFO L140 encePairwiseOnDemand]: 433/451 looper letters, 190 selfloop transitions, 64 changer transitions 0/582 dead transitions. [2025-03-17 11:17:09,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 582 transitions, 3101 flow [2025-03-17 11:17:09,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 11:17:09,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-17 11:17:09,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 5168 transitions. [2025-03-17 11:17:09,072 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8814600034112229 [2025-03-17 11:17:09,072 INFO L175 Difference]: Start difference. First operand has 390 places, 460 transitions, 1808 flow. Second operand 13 states and 5168 transitions. [2025-03-17 11:17:09,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 582 transitions, 3101 flow [2025-03-17 11:17:09,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 396 places, 582 transitions, 3044 flow, removed 23 selfloop flow, removed 6 redundant places. [2025-03-17 11:17:09,130 INFO L231 Difference]: Finished difference. Result has 400 places, 488 transitions, 2185 flow [2025-03-17 11:17:09,130 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=451, PETRI_DIFFERENCE_MINUEND_FLOW=1781, PETRI_DIFFERENCE_MINUEND_PLACES=384, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=460, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2185, PETRI_PLACES=400, PETRI_TRANSITIONS=488} [2025-03-17 11:17:09,130 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, 25 predicate places. [2025-03-17 11:17:09,130 INFO L471 AbstractCegarLoop]: Abstraction has has 400 places, 488 transitions, 2185 flow [2025-03-17 11:17:09,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 388.72727272727275) internal successors, (4276), 11 states have internal predecessors, (4276), 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-17 11:17:09,132 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:17:09,132 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:17:09,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 11:17:09,132 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-17 11:17:09,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:17:09,133 INFO L85 PathProgramCache]: Analyzing trace with hash -473833688, now seen corresponding path program 1 times [2025-03-17 11:17:09,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:17:09,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318827036] [2025-03-17 11:17:09,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:17:09,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:17:09,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-17 11:17:09,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-17 11:17:09,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:17:09,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:17:09,183 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:17:09,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:17:09,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318827036] [2025-03-17 11:17:09,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318827036] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:17:09,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:17:09,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:17:09,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239649357] [2025-03-17 11:17:09,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:17:09,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:17:09,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:17:09,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:17:09,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:17:09,204 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 410 out of 451 [2025-03-17 11:17:09,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 488 transitions, 2185 flow. Second operand has 3 states, 3 states have (on average 412.6666666666667) internal successors, (1238), 3 states have internal predecessors, (1238), 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-17 11:17:09,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:17:09,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 410 of 451 [2025-03-17 11:17:09,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:17:10,246 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([821] L1036-3-->L1036: Formula: (let ((.cse0 (select |v_#pthreadsMutex_48| v_~datas_mutex~0.base_10)) (.cse1 (+ (* v_cleanerThread1of1ForFork0_~i~1_9 24) v_~datas_mutex~0.offset_10))) (and (= (store |v_#pthreadsMutex_48| v_~datas_mutex~0.base_10 (store .cse0 .cse1 1)) |v_#pthreadsMutex_47|) (= |v_cleanerThread1of1ForFork0_#t~ret6_1| 0) (= (select .cse0 .cse1) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_48|, cleanerThread1of1ForFork0_~i~1=v_cleanerThread1of1ForFork0_~i~1_9, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_10, ~datas_mutex~0.base=v_~datas_mutex~0.base_10} OutVars{cleanerThread1of1ForFork0_#t~ret6=|v_cleanerThread1of1ForFork0_#t~ret6_1|, #pthreadsMutex=|v_#pthreadsMutex_47|, cleanerThread1of1ForFork0_~i~1=v_cleanerThread1of1ForFork0_~i~1_9, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_10, ~datas_mutex~0.base=v_~datas_mutex~0.base_10} AuxVars[] AssignedVars[cleanerThread1of1ForFork0_#t~ret6, #pthreadsMutex][217], [Black: 566#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 509#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 452#(= |#race~threads_total~0| 0), Black: 508#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), 161#L1029true, 211#L1036true, Black: 462#true, 551#(not (= ~datas~0.base ~tids~0.base)), Black: 466#true, 505#true, 445#true, 472#(= |#race~datas~0| 0), Black: 470#true, 468#(= |#race~tids~0| 0), Black: 474#true, Black: 539#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 530#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base))), Black: 541#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 529#(not (= ~datas~0.base ~tids~0.base)), 577#true, 443#true, Black: 486#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 497#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) |cleanerThread1of1ForFork0_#t~nondet8|), Black: 500#true, 464#(= |#race~datas_mutex~0| 0), 176#ULTIMATE.startFINALtrue, Black: 570#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 572#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 507#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 568#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base)))]) [2025-03-17 11:17:10,246 INFO L294 olderBase$Statistics]: this new event has 299 ancestors and is cut-off event [2025-03-17 11:17:10,246 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-03-17 11:17:10,246 INFO L297 olderBase$Statistics]: existing Event has 278 ancestors and is cut-off event [2025-03-17 11:17:10,246 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-03-17 11:17:10,467 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([821] L1036-3-->L1036: Formula: (let ((.cse0 (select |v_#pthreadsMutex_48| v_~datas_mutex~0.base_10)) (.cse1 (+ (* v_cleanerThread1of1ForFork0_~i~1_9 24) v_~datas_mutex~0.offset_10))) (and (= (store |v_#pthreadsMutex_48| v_~datas_mutex~0.base_10 (store .cse0 .cse1 1)) |v_#pthreadsMutex_47|) (= |v_cleanerThread1of1ForFork0_#t~ret6_1| 0) (= (select .cse0 .cse1) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_48|, cleanerThread1of1ForFork0_~i~1=v_cleanerThread1of1ForFork0_~i~1_9, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_10, ~datas_mutex~0.base=v_~datas_mutex~0.base_10} OutVars{cleanerThread1of1ForFork0_#t~ret6=|v_cleanerThread1of1ForFork0_#t~ret6_1|, #pthreadsMutex=|v_#pthreadsMutex_47|, cleanerThread1of1ForFork0_~i~1=v_cleanerThread1of1ForFork0_~i~1_9, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_10, ~datas_mutex~0.base=v_~datas_mutex~0.base_10} AuxVars[] AssignedVars[cleanerThread1of1ForFork0_#t~ret6, #pthreadsMutex][217], [Black: 566#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 509#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 452#(= |#race~threads_total~0| 0), Black: 508#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), 211#L1036true, Black: 462#true, 551#(not (= ~datas~0.base ~tids~0.base)), Black: 466#true, 505#true, 445#true, 472#(= |#race~datas~0| 0), Black: 470#true, 468#(= |#race~tids~0| 0), Black: 474#true, Black: 539#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 530#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base))), 424#L1030true, Black: 541#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 529#(not (= ~datas~0.base ~tids~0.base)), Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 577#true, 443#true, Black: 486#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 497#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) |cleanerThread1of1ForFork0_#t~nondet8|), Black: 500#true, 464#(= |#race~datas_mutex~0| 0), 176#ULTIMATE.startFINALtrue, Black: 570#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 572#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 507#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 568#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base)))]) [2025-03-17 11:17:10,468 INFO L294 olderBase$Statistics]: this new event has 304 ancestors and is cut-off event [2025-03-17 11:17:10,468 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is cut-off event [2025-03-17 11:17:10,468 INFO L297 olderBase$Statistics]: existing Event has 304 ancestors and is cut-off event [2025-03-17 11:17:10,468 INFO L297 olderBase$Statistics]: existing Event has 304 ancestors and is cut-off event [2025-03-17 11:17:11,936 INFO L124 PetriNetUnfolderBase]: 4265/20967 cut-off events. [2025-03-17 11:17:11,936 INFO L125 PetriNetUnfolderBase]: For 17755/18640 co-relation queries the response was YES. [2025-03-17 11:17:12,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43651 conditions, 20967 events. 4265/20967 cut-off events. For 17755/18640 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 235373 event pairs, 1782 based on Foata normal form. 68/19004 useless extension candidates. Maximal degree in co-relation 43481. Up to 3967 conditions per place. [2025-03-17 11:17:12,055 INFO L140 encePairwiseOnDemand]: 445/451 looper letters, 36 selfloop transitions, 7 changer transitions 0/500 dead transitions. [2025-03-17 11:17:12,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 500 transitions, 2304 flow [2025-03-17 11:17:12,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:17:12,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:17:12,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1268 transitions. [2025-03-17 11:17:12,057 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9371766444937176 [2025-03-17 11:17:12,057 INFO L175 Difference]: Start difference. First operand has 400 places, 488 transitions, 2185 flow. Second operand 3 states and 1268 transitions. [2025-03-17 11:17:12,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 500 transitions, 2304 flow [2025-03-17 11:17:12,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 396 places, 500 transitions, 2279 flow, removed 7 selfloop flow, removed 6 redundant places. [2025-03-17 11:17:12,108 INFO L231 Difference]: Finished difference. Result has 398 places, 493 transitions, 2216 flow [2025-03-17 11:17:12,109 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=451, PETRI_DIFFERENCE_MINUEND_FLOW=2160, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=488, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=481, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2216, PETRI_PLACES=398, PETRI_TRANSITIONS=493} [2025-03-17 11:17:12,109 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, 23 predicate places. [2025-03-17 11:17:12,109 INFO L471 AbstractCegarLoop]: Abstraction has has 398 places, 493 transitions, 2216 flow [2025-03-17 11:17:12,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 412.6666666666667) internal successors, (1238), 3 states have internal predecessors, (1238), 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-17 11:17:12,110 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:17:12,110 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:17:12,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 11:17:12,110 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-17 11:17:12,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:17:12,111 INFO L85 PathProgramCache]: Analyzing trace with hash -2098525008, now seen corresponding path program 1 times [2025-03-17 11:17:12,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:17:12,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897032168] [2025-03-17 11:17:12,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:17:12,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:17:12,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-17 11:17:12,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-17 11:17:12,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:17:12,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:17:12,196 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:17:12,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:17:12,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897032168] [2025-03-17 11:17:12,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897032168] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:17:12,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:17:12,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:17:12,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098078479] [2025-03-17 11:17:12,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:17:12,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:17:12,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:17:12,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:17:12,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:17:12,259 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 398 out of 451 [2025-03-17 11:17:12,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 493 transitions, 2216 flow. Second operand has 3 states, 3 states have (on average 402.3333333333333) internal successors, (1207), 3 states have internal predecessors, (1207), 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-17 11:17:12,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:17:12,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 398 of 451 [2025-03-17 11:17:12,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:17:14,621 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([574] L1072-5-->L1072-3: Formula: (= (store |v_#race_22| v_~datas~0.base_11 (store (select |v_#race_22| v_~datas~0.base_11) v_~datas~0.offset_11 0)) |v_#race_21|) InVars {#race=|v_#race_22|, ~datas~0.base=v_~datas~0.base_11, ~datas~0.offset=v_~datas~0.offset_11} OutVars{#race=|v_#race_21|, ~datas~0.base=v_~datas~0.base_11, ~datas~0.offset=v_~datas~0.offset_11} AuxVars[] AssignedVars[#race][520], [Black: 566#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 509#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 508#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), 452#(= |#race~threads_total~0| 0), Black: 579#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet32#1|), 302#L1038-1true, Black: 462#true, 551#(not (= ~datas~0.base ~tids~0.base)), Black: 466#true, 445#true, 505#true, 472#(= |#race~datas~0| 0), Black: 470#true, 468#(= |#race~tids~0| 0), 327#L1072-3true, Black: 474#true, Black: 539#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 530#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base))), Black: 541#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 582#true, 529#(not (= ~datas~0.base ~tids~0.base)), Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 577#true, 443#true, Black: 486#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 497#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) |cleanerThread1of1ForFork0_#t~nondet8|), Black: 500#true, 464#(= |#race~datas_mutex~0| 0), 127#L1029-1true, Black: 570#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 572#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 507#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 568#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base)))]) [2025-03-17 11:17:14,621 INFO L294 olderBase$Statistics]: this new event has 288 ancestors and is cut-off event [2025-03-17 11:17:14,621 INFO L297 olderBase$Statistics]: existing Event has 288 ancestors and is cut-off event [2025-03-17 11:17:14,621 INFO L297 olderBase$Statistics]: existing Event has 288 ancestors and is cut-off event [2025-03-17 11:17:14,621 INFO L297 olderBase$Statistics]: existing Event has 288 ancestors and is cut-off event [2025-03-17 11:17:14,675 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([574] L1072-5-->L1072-3: Formula: (= (store |v_#race_22| v_~datas~0.base_11 (store (select |v_#race_22| v_~datas~0.base_11) v_~datas~0.offset_11 0)) |v_#race_21|) InVars {#race=|v_#race_22|, ~datas~0.base=v_~datas~0.base_11, ~datas~0.offset=v_~datas~0.offset_11} OutVars{#race=|v_#race_21|, ~datas~0.base=v_~datas~0.base_11, ~datas~0.offset=v_~datas~0.offset_11} AuxVars[] AssignedVars[#race][520], [Black: 566#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 509#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 452#(= |#race~threads_total~0| 0), Black: 508#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 579#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet32#1|), 302#L1038-1true, Black: 462#true, 551#(not (= ~datas~0.base ~tids~0.base)), Black: 466#true, 505#true, 445#true, 472#(= |#race~datas~0| 0), Black: 470#true, 468#(= |#race~tids~0| 0), 327#L1072-3true, Black: 474#true, Black: 539#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 530#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base))), Black: 541#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 529#(not (= ~datas~0.base ~tids~0.base)), Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 582#true, 577#true, 443#true, Black: 486#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 497#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) |cleanerThread1of1ForFork0_#t~nondet8|), Black: 500#true, 464#(= |#race~datas_mutex~0| 0), 127#L1029-1true, Black: 570#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 572#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 507#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 568#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base)))]) [2025-03-17 11:17:14,675 INFO L294 olderBase$Statistics]: this new event has 288 ancestors and is cut-off event [2025-03-17 11:17:14,675 INFO L297 olderBase$Statistics]: existing Event has 288 ancestors and is cut-off event [2025-03-17 11:17:14,676 INFO L297 olderBase$Statistics]: existing Event has 288 ancestors and is cut-off event [2025-03-17 11:17:14,676 INFO L297 olderBase$Statistics]: existing Event has 288 ancestors and is cut-off event [2025-03-17 11:17:14,676 INFO L297 olderBase$Statistics]: existing Event has 288 ancestors and is cut-off event [2025-03-17 11:17:14,676 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([574] L1072-5-->L1072-3: Formula: (= (store |v_#race_22| v_~datas~0.base_11 (store (select |v_#race_22| v_~datas~0.base_11) v_~datas~0.offset_11 0)) |v_#race_21|) InVars {#race=|v_#race_22|, ~datas~0.base=v_~datas~0.base_11, ~datas~0.offset=v_~datas~0.offset_11} OutVars{#race=|v_#race_21|, ~datas~0.base=v_~datas~0.base_11, ~datas~0.offset=v_~datas~0.offset_11} AuxVars[] AssignedVars[#race][520], [Black: 566#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 509#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 452#(= |#race~threads_total~0| 0), Black: 508#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 579#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet32#1|), 302#L1038-1true, Black: 462#true, 551#(not (= ~datas~0.base ~tids~0.base)), Black: 466#true, 505#true, 445#true, 472#(= |#race~datas~0| 0), Black: 470#true, 468#(= |#race~tids~0| 0), 327#L1072-3true, Black: 474#true, Black: 539#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 530#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base))), Black: 541#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 529#(not (= ~datas~0.base ~tids~0.base)), Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 582#true, 577#true, 443#true, Black: 486#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 497#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) |cleanerThread1of1ForFork0_#t~nondet8|), Black: 500#true, 464#(= |#race~datas_mutex~0| 0), 127#L1029-1true, Black: 570#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 572#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 507#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 568#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base)))]) [2025-03-17 11:17:14,676 INFO L294 olderBase$Statistics]: this new event has 288 ancestors and is cut-off event [2025-03-17 11:17:14,676 INFO L297 olderBase$Statistics]: existing Event has 288 ancestors and is cut-off event [2025-03-17 11:17:14,676 INFO L297 olderBase$Statistics]: existing Event has 288 ancestors and is cut-off event [2025-03-17 11:17:14,676 INFO L297 olderBase$Statistics]: existing Event has 288 ancestors and is cut-off event [2025-03-17 11:17:14,676 INFO L297 olderBase$Statistics]: existing Event has 288 ancestors and is cut-off event [2025-03-17 11:17:14,677 INFO L297 olderBase$Statistics]: existing Event has 288 ancestors and is cut-off event [2025-03-17 11:17:14,728 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([844] L1038-2-->L1038: Formula: (= (store |v_#race_14| v_~datas~0.base_3 (store (select |v_#race_14| v_~datas~0.base_3) (+ v_cleanerThread1of1ForFork0_~i~1_23 v_~datas~0.offset_3) |v_cleanerThread1of1ForFork0_#t~nondet8_3|)) |v_#race_13|) InVars {#race=|v_#race_14|, cleanerThread1of1ForFork0_~i~1=v_cleanerThread1of1ForFork0_~i~1_23, ~datas~0.base=v_~datas~0.base_3, cleanerThread1of1ForFork0_#t~nondet8=|v_cleanerThread1of1ForFork0_#t~nondet8_3|, ~datas~0.offset=v_~datas~0.offset_3} OutVars{#race=|v_#race_13|, cleanerThread1of1ForFork0_~i~1=v_cleanerThread1of1ForFork0_~i~1_23, ~datas~0.base=v_~datas~0.base_3, cleanerThread1of1ForFork0_#t~nondet8=|v_cleanerThread1of1ForFork0_#t~nondet8_3|, ~datas~0.offset=v_~datas~0.offset_3} AuxVars[] AssignedVars[#race][532], [Black: 566#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 509#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 508#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), 452#(= |#race~threads_total~0| 0), Black: 579#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet32#1|), Black: 462#true, 551#(not (= ~datas~0.base ~tids~0.base)), Black: 466#true, 505#true, 445#true, 472#(= |#race~datas~0| 0), Black: 470#true, 468#(= |#race~tids~0| 0), Black: 474#true, 272#L1038true, Black: 539#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 530#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base))), Black: 541#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 529#(not (= ~datas~0.base ~tids~0.base)), Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 582#true, 577#true, 443#true, Black: 486#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 495#true, 241#L1072-4true, Black: 502#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 464#(= |#race~datas_mutex~0| 0), 127#L1029-1true, Black: 570#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 572#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 507#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 568#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base)))]) [2025-03-17 11:17:14,729 INFO L294 olderBase$Statistics]: this new event has 288 ancestors and is cut-off event [2025-03-17 11:17:14,729 INFO L297 olderBase$Statistics]: existing Event has 288 ancestors and is cut-off event [2025-03-17 11:17:14,729 INFO L297 olderBase$Statistics]: existing Event has 288 ancestors and is cut-off event [2025-03-17 11:17:14,729 INFO L297 olderBase$Statistics]: existing Event has 288 ancestors and is cut-off event [2025-03-17 11:17:14,729 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([574] L1072-5-->L1072-3: Formula: (= (store |v_#race_22| v_~datas~0.base_11 (store (select |v_#race_22| v_~datas~0.base_11) v_~datas~0.offset_11 0)) |v_#race_21|) InVars {#race=|v_#race_22|, ~datas~0.base=v_~datas~0.base_11, ~datas~0.offset=v_~datas~0.offset_11} OutVars{#race=|v_#race_21|, ~datas~0.base=v_~datas~0.base_11, ~datas~0.offset=v_~datas~0.offset_11} AuxVars[] AssignedVars[#race][454], [Black: 566#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 509#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 452#(= |#race~threads_total~0| 0), Black: 508#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 579#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet32#1|), Black: 462#true, 551#(not (= ~datas~0.base ~tids~0.base)), Black: 466#true, 505#true, 445#true, 472#(= |#race~datas~0| 0), Black: 470#true, 98#L1039-9true, 468#(= |#race~tids~0| 0), 327#L1072-3true, Black: 474#true, Black: 539#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 530#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base))), Black: 541#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 529#(not (= ~datas~0.base ~tids~0.base)), Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 582#true, 577#true, 443#true, Black: 486#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 497#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) |cleanerThread1of1ForFork0_#t~nondet8|), Black: 500#true, 464#(= |#race~datas_mutex~0| 0), 127#L1029-1true, Black: 570#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 572#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 507#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 568#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base)))]) [2025-03-17 11:17:14,730 INFO L294 olderBase$Statistics]: this new event has 289 ancestors and is cut-off event [2025-03-17 11:17:14,730 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2025-03-17 11:17:14,730 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2025-03-17 11:17:14,730 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2025-03-17 11:17:14,737 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([821] L1036-3-->L1036: Formula: (let ((.cse0 (select |v_#pthreadsMutex_48| v_~datas_mutex~0.base_10)) (.cse1 (+ (* v_cleanerThread1of1ForFork0_~i~1_9 24) v_~datas_mutex~0.offset_10))) (and (= (store |v_#pthreadsMutex_48| v_~datas_mutex~0.base_10 (store .cse0 .cse1 1)) |v_#pthreadsMutex_47|) (= |v_cleanerThread1of1ForFork0_#t~ret6_1| 0) (= (select .cse0 .cse1) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_48|, cleanerThread1of1ForFork0_~i~1=v_cleanerThread1of1ForFork0_~i~1_9, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_10, ~datas_mutex~0.base=v_~datas_mutex~0.base_10} OutVars{cleanerThread1of1ForFork0_#t~ret6=|v_cleanerThread1of1ForFork0_#t~ret6_1|, #pthreadsMutex=|v_#pthreadsMutex_47|, cleanerThread1of1ForFork0_~i~1=v_cleanerThread1of1ForFork0_~i~1_9, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_10, ~datas_mutex~0.base=v_~datas_mutex~0.base_10} AuxVars[] AssignedVars[cleanerThread1of1ForFork0_#t~ret6, #pthreadsMutex][335], [Black: 509#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 566#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 452#(= |#race~threads_total~0| 0), Black: 508#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 579#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet32#1|), 568#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base))), 584#(= |threadThread1of1ForFork1_#t~nondet4| (select (select |#race| ~datas~0.base) (+ threadThread1of1ForFork1_~i~0 ~datas~0.offset))), 211#L1036true, Black: 462#true, Black: 466#true, 505#true, 445#true, 472#(= |#race~datas~0| 0), Black: 470#true, 539#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 468#(= |#race~tids~0| 0), Black: 529#(not (= ~datas~0.base ~tids~0.base)), Black: 476#(= |#race~threads_alive~0| 0), Black: 530#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base))), Black: 541#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 577#true, 443#true, Black: 486#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 497#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) |cleanerThread1of1ForFork0_#t~nondet8|), Black: 502#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 31#L1061-6true, 464#(= |#race~datas_mutex~0| 0), 127#L1029-1true, Black: 570#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 572#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 507#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)]) [2025-03-17 11:17:14,737 INFO L294 olderBase$Statistics]: this new event has 288 ancestors and is cut-off event [2025-03-17 11:17:14,737 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2025-03-17 11:17:14,737 INFO L297 olderBase$Statistics]: existing Event has 288 ancestors and is cut-off event [2025-03-17 11:17:14,737 INFO L297 olderBase$Statistics]: existing Event has 288 ancestors and is cut-off event [2025-03-17 11:17:14,782 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([574] L1072-5-->L1072-3: Formula: (= (store |v_#race_22| v_~datas~0.base_11 (store (select |v_#race_22| v_~datas~0.base_11) v_~datas~0.offset_11 0)) |v_#race_21|) InVars {#race=|v_#race_22|, ~datas~0.base=v_~datas~0.base_11, ~datas~0.offset=v_~datas~0.offset_11} OutVars{#race=|v_#race_21|, ~datas~0.base=v_~datas~0.base_11, ~datas~0.offset=v_~datas~0.offset_11} AuxVars[] AssignedVars[#race][454], [Black: 566#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 509#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 508#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), 452#(= |#race~threads_total~0| 0), Black: 579#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet32#1|), Black: 462#true, 551#(not (= ~datas~0.base ~tids~0.base)), Black: 466#true, 505#true, 445#true, 472#(= |#race~datas~0| 0), Black: 470#true, 98#L1039-9true, 468#(= |#race~tids~0| 0), 327#L1072-3true, Black: 474#true, Black: 539#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 530#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base))), Black: 541#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 582#true, Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 529#(not (= ~datas~0.base ~tids~0.base)), 577#true, 443#true, Black: 486#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 497#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) |cleanerThread1of1ForFork0_#t~nondet8|), Black: 500#true, 464#(= |#race~datas_mutex~0| 0), 127#L1029-1true, Black: 570#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 572#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 507#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 568#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base)))]) [2025-03-17 11:17:14,782 INFO L294 olderBase$Statistics]: this new event has 289 ancestors and is cut-off event [2025-03-17 11:17:14,782 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2025-03-17 11:17:14,782 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2025-03-17 11:17:14,782 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2025-03-17 11:17:14,782 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2025-03-17 11:17:14,788 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([821] L1036-3-->L1036: Formula: (let ((.cse0 (select |v_#pthreadsMutex_48| v_~datas_mutex~0.base_10)) (.cse1 (+ (* v_cleanerThread1of1ForFork0_~i~1_9 24) v_~datas_mutex~0.offset_10))) (and (= (store |v_#pthreadsMutex_48| v_~datas_mutex~0.base_10 (store .cse0 .cse1 1)) |v_#pthreadsMutex_47|) (= |v_cleanerThread1of1ForFork0_#t~ret6_1| 0) (= (select .cse0 .cse1) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_48|, cleanerThread1of1ForFork0_~i~1=v_cleanerThread1of1ForFork0_~i~1_9, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_10, ~datas_mutex~0.base=v_~datas_mutex~0.base_10} OutVars{cleanerThread1of1ForFork0_#t~ret6=|v_cleanerThread1of1ForFork0_#t~ret6_1|, #pthreadsMutex=|v_#pthreadsMutex_47|, cleanerThread1of1ForFork0_~i~1=v_cleanerThread1of1ForFork0_~i~1_9, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_10, ~datas_mutex~0.base=v_~datas_mutex~0.base_10} AuxVars[] AssignedVars[cleanerThread1of1ForFork0_#t~ret6, #pthreadsMutex][335], [Black: 566#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 509#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 452#(= |#race~threads_total~0| 0), Black: 508#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 579#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet32#1|), 584#(= |threadThread1of1ForFork1_#t~nondet4| (select (select |#race| ~datas~0.base) (+ threadThread1of1ForFork1_~i~0 ~datas~0.offset))), 211#L1036true, 265#L1061-5true, Black: 462#true, Black: 466#true, 445#true, 505#true, 472#(= |#race~datas~0| 0), Black: 470#true, 539#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 468#(= |#race~tids~0| 0), Black: 529#(not (= ~datas~0.base ~tids~0.base)), Black: 476#(= |#race~threads_alive~0| 0), Black: 530#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base))), 570#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 541#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 577#true, 443#true, Black: 486#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 497#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) |cleanerThread1of1ForFork0_#t~nondet8|), Black: 502#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 464#(= |#race~datas_mutex~0| 0), 127#L1029-1true, Black: 572#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 507#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 568#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base)))]) [2025-03-17 11:17:14,788 INFO L294 olderBase$Statistics]: this new event has 289 ancestors and is cut-off event [2025-03-17 11:17:14,791 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2025-03-17 11:17:14,791 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2025-03-17 11:17:14,791 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2025-03-17 11:17:14,835 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([574] L1072-5-->L1072-3: Formula: (= (store |v_#race_22| v_~datas~0.base_11 (store (select |v_#race_22| v_~datas~0.base_11) v_~datas~0.offset_11 0)) |v_#race_21|) InVars {#race=|v_#race_22|, ~datas~0.base=v_~datas~0.base_11, ~datas~0.offset=v_~datas~0.offset_11} OutVars{#race=|v_#race_21|, ~datas~0.base=v_~datas~0.base_11, ~datas~0.offset=v_~datas~0.offset_11} AuxVars[] AssignedVars[#race][392], [Black: 566#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 509#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 452#(= |#race~threads_total~0| 0), Black: 508#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 579#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet32#1|), 302#L1038-1true, 134#L1030-5true, Black: 462#true, 551#(not (= ~datas~0.base ~tids~0.base)), Black: 466#true, 505#true, 445#true, 472#(= |#race~datas~0| 0), Black: 470#true, 468#(= |#race~tids~0| 0), Black: 474#true, 327#L1072-3true, Black: 539#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 530#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base))), Black: 541#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 529#(not (= ~datas~0.base ~tids~0.base)), Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 582#true, 577#true, 443#true, Black: 486#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 497#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) |cleanerThread1of1ForFork0_#t~nondet8|), Black: 500#true, 464#(= |#race~datas_mutex~0| 0), Black: 570#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 572#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 507#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 568#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base)))]) [2025-03-17 11:17:14,835 INFO L294 olderBase$Statistics]: this new event has 289 ancestors and is cut-off event [2025-03-17 11:17:14,835 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2025-03-17 11:17:14,835 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2025-03-17 11:17:14,835 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2025-03-17 11:17:14,846 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([844] L1038-2-->L1038: Formula: (= (store |v_#race_14| v_~datas~0.base_3 (store (select |v_#race_14| v_~datas~0.base_3) (+ v_cleanerThread1of1ForFork0_~i~1_23 v_~datas~0.offset_3) |v_cleanerThread1of1ForFork0_#t~nondet8_3|)) |v_#race_13|) InVars {#race=|v_#race_14|, cleanerThread1of1ForFork0_~i~1=v_cleanerThread1of1ForFork0_~i~1_23, ~datas~0.base=v_~datas~0.base_3, cleanerThread1of1ForFork0_#t~nondet8=|v_cleanerThread1of1ForFork0_#t~nondet8_3|, ~datas~0.offset=v_~datas~0.offset_3} OutVars{#race=|v_#race_13|, cleanerThread1of1ForFork0_~i~1=v_cleanerThread1of1ForFork0_~i~1_23, ~datas~0.base=v_~datas~0.base_3, cleanerThread1of1ForFork0_#t~nondet8=|v_cleanerThread1of1ForFork0_#t~nondet8_3|, ~datas~0.offset=v_~datas~0.offset_3} AuxVars[] AssignedVars[#race][358], [Black: 566#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 509#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 508#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), 452#(= |#race~threads_total~0| 0), Black: 579#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet32#1|), 134#L1030-5true, Black: 462#true, 551#(not (= ~datas~0.base ~tids~0.base)), Black: 466#true, 505#true, 445#true, 472#(= |#race~datas~0| 0), Black: 470#true, 468#(= |#race~tids~0| 0), 272#L1038true, Black: 474#true, Black: 539#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 530#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base))), Black: 541#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 529#(not (= ~datas~0.base ~tids~0.base)), Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 582#true, 577#true, 443#true, Black: 486#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 495#true, 241#L1072-4true, Black: 502#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 464#(= |#race~datas_mutex~0| 0), Black: 570#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 572#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 507#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 568#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base)))]) [2025-03-17 11:17:14,846 INFO L294 olderBase$Statistics]: this new event has 289 ancestors and is cut-off event [2025-03-17 11:17:14,846 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2025-03-17 11:17:14,846 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2025-03-17 11:17:14,846 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is cut-off event [2025-03-17 11:17:14,852 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([821] L1036-3-->L1036: Formula: (let ((.cse0 (select |v_#pthreadsMutex_48| v_~datas_mutex~0.base_10)) (.cse1 (+ (* v_cleanerThread1of1ForFork0_~i~1_9 24) v_~datas_mutex~0.offset_10))) (and (= (store |v_#pthreadsMutex_48| v_~datas_mutex~0.base_10 (store .cse0 .cse1 1)) |v_#pthreadsMutex_47|) (= |v_cleanerThread1of1ForFork0_#t~ret6_1| 0) (= (select .cse0 .cse1) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_48|, cleanerThread1of1ForFork0_~i~1=v_cleanerThread1of1ForFork0_~i~1_9, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_10, ~datas_mutex~0.base=v_~datas_mutex~0.base_10} OutVars{cleanerThread1of1ForFork0_#t~ret6=|v_cleanerThread1of1ForFork0_#t~ret6_1|, #pthreadsMutex=|v_#pthreadsMutex_47|, cleanerThread1of1ForFork0_~i~1=v_cleanerThread1of1ForFork0_~i~1_9, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_10, ~datas_mutex~0.base=v_~datas_mutex~0.base_10} AuxVars[] AssignedVars[cleanerThread1of1ForFork0_#t~ret6, #pthreadsMutex][335], [Black: 509#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 566#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 572#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 452#(= |#race~threads_total~0| 0), Black: 508#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 579#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet32#1|), 584#(= |threadThread1of1ForFork1_#t~nondet4| (select (select |#race| ~datas~0.base) (+ threadThread1of1ForFork1_~i~0 ~datas~0.offset))), 211#L1036true, Black: 462#true, Black: 466#true, 505#true, 445#true, 472#(= |#race~datas~0| 0), Black: 470#true, 539#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 468#(= |#race~tids~0| 0), Black: 529#(not (= ~datas~0.base ~tids~0.base)), Black: 476#(= |#race~threads_alive~0| 0), Black: 530#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base))), Black: 541#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 577#true, 443#true, Black: 486#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 497#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) |cleanerThread1of1ForFork0_#t~nondet8|), Black: 502#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 76#L1061-4true, 464#(= |#race~datas_mutex~0| 0), 127#L1029-1true, Black: 570#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 507#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 568#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base)))]) [2025-03-17 11:17:14,852 INFO L294 olderBase$Statistics]: this new event has 290 ancestors and is cut-off event [2025-03-17 11:17:14,852 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2025-03-17 11:17:14,852 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2025-03-17 11:17:14,852 INFO L297 olderBase$Statistics]: existing Event has 290 ancestors and is cut-off event [2025-03-17 11:17:14,954 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([574] L1072-5-->L1072-3: Formula: (= (store |v_#race_22| v_~datas~0.base_11 (store (select |v_#race_22| v_~datas~0.base_11) v_~datas~0.offset_11 0)) |v_#race_21|) InVars {#race=|v_#race_22|, ~datas~0.base=v_~datas~0.base_11, ~datas~0.offset=v_~datas~0.offset_11} OutVars{#race=|v_#race_21|, ~datas~0.base=v_~datas~0.base_11, ~datas~0.offset=v_~datas~0.offset_11} AuxVars[] AssignedVars[#race][454], [Black: 566#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 509#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 452#(= |#race~threads_total~0| 0), Black: 508#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 579#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet32#1|), Black: 462#true, 551#(not (= ~datas~0.base ~tids~0.base)), Black: 466#true, 505#true, 445#true, 472#(= |#race~datas~0| 0), Black: 470#true, 98#L1039-9true, 468#(= |#race~tids~0| 0), Black: 474#true, 327#L1072-3true, Black: 539#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 530#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base))), Black: 541#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 529#(not (= ~datas~0.base ~tids~0.base)), Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 582#true, 577#true, 443#true, Black: 486#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 497#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) |cleanerThread1of1ForFork0_#t~nondet8|), Black: 500#true, 464#(= |#race~datas_mutex~0| 0), 127#L1029-1true, Black: 570#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 572#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 507#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 568#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base)))]) [2025-03-17 11:17:14,954 INFO L294 olderBase$Statistics]: this new event has 289 ancestors and is not cut-off event [2025-03-17 11:17:14,954 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is not cut-off event [2025-03-17 11:17:14,954 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is not cut-off event [2025-03-17 11:17:14,954 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is not cut-off event [2025-03-17 11:17:14,954 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is not cut-off event [2025-03-17 11:17:14,954 INFO L297 olderBase$Statistics]: existing Event has 289 ancestors and is not cut-off event [2025-03-17 11:17:15,011 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([574] L1072-5-->L1072-3: Formula: (= (store |v_#race_22| v_~datas~0.base_11 (store (select |v_#race_22| v_~datas~0.base_11) v_~datas~0.offset_11 0)) |v_#race_21|) InVars {#race=|v_#race_22|, ~datas~0.base=v_~datas~0.base_11, ~datas~0.offset=v_~datas~0.offset_11} OutVars{#race=|v_#race_21|, ~datas~0.base=v_~datas~0.base_11, ~datas~0.offset=v_~datas~0.offset_11} AuxVars[] AssignedVars[#race][392], [Black: 566#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 509#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 452#(= |#race~threads_total~0| 0), Black: 508#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 579#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet32#1|), 302#L1038-1true, Black: 462#true, 551#(not (= ~datas~0.base ~tids~0.base)), Black: 466#true, 505#true, 445#true, 472#(= |#race~datas~0| 0), Black: 470#true, 468#(= |#race~tids~0| 0), 327#L1072-3true, Black: 474#true, Black: 539#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 530#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base))), Black: 541#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 424#L1030true, 582#true, Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 529#(not (= ~datas~0.base ~tids~0.base)), 577#true, 443#true, Black: 486#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 497#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) |cleanerThread1of1ForFork0_#t~nondet8|), Black: 500#true, 464#(= |#race~datas_mutex~0| 0), Black: 570#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 572#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 507#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 568#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base)))]) [2025-03-17 11:17:15,012 INFO L294 olderBase$Statistics]: this new event has 292 ancestors and is cut-off event [2025-03-17 11:17:15,012 INFO L297 olderBase$Statistics]: existing Event has 292 ancestors and is cut-off event [2025-03-17 11:17:15,012 INFO L297 olderBase$Statistics]: existing Event has 292 ancestors and is cut-off event [2025-03-17 11:17:15,012 INFO L297 olderBase$Statistics]: existing Event has 292 ancestors and is cut-off event [2025-03-17 11:17:15,018 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([844] L1038-2-->L1038: Formula: (= (store |v_#race_14| v_~datas~0.base_3 (store (select |v_#race_14| v_~datas~0.base_3) (+ v_cleanerThread1of1ForFork0_~i~1_23 v_~datas~0.offset_3) |v_cleanerThread1of1ForFork0_#t~nondet8_3|)) |v_#race_13|) InVars {#race=|v_#race_14|, cleanerThread1of1ForFork0_~i~1=v_cleanerThread1of1ForFork0_~i~1_23, ~datas~0.base=v_~datas~0.base_3, cleanerThread1of1ForFork0_#t~nondet8=|v_cleanerThread1of1ForFork0_#t~nondet8_3|, ~datas~0.offset=v_~datas~0.offset_3} OutVars{#race=|v_#race_13|, cleanerThread1of1ForFork0_~i~1=v_cleanerThread1of1ForFork0_~i~1_23, ~datas~0.base=v_~datas~0.base_3, cleanerThread1of1ForFork0_#t~nondet8=|v_cleanerThread1of1ForFork0_#t~nondet8_3|, ~datas~0.offset=v_~datas~0.offset_3} AuxVars[] AssignedVars[#race][358], [Black: 566#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 509#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 508#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), 452#(= |#race~threads_total~0| 0), Black: 579#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet32#1|), Black: 462#true, 551#(not (= ~datas~0.base ~tids~0.base)), Black: 466#true, 505#true, 445#true, 472#(= |#race~datas~0| 0), Black: 470#true, 468#(= |#race~tids~0| 0), Black: 474#true, 272#L1038true, Black: 539#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 530#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base))), Black: 541#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 424#L1030true, 529#(not (= ~datas~0.base ~tids~0.base)), Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 582#true, 577#true, 443#true, Black: 486#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 495#true, 241#L1072-4true, Black: 502#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 464#(= |#race~datas_mutex~0| 0), Black: 570#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 572#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 507#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 568#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base)))]) [2025-03-17 11:17:15,018 INFO L294 olderBase$Statistics]: this new event has 292 ancestors and is cut-off event [2025-03-17 11:17:15,019 INFO L297 olderBase$Statistics]: existing Event has 292 ancestors and is cut-off event [2025-03-17 11:17:15,019 INFO L297 olderBase$Statistics]: existing Event has 292 ancestors and is cut-off event [2025-03-17 11:17:15,019 INFO L297 olderBase$Statistics]: existing Event has 292 ancestors and is cut-off event [2025-03-17 11:17:17,735 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([574] L1072-5-->L1072-3: Formula: (= (store |v_#race_22| v_~datas~0.base_11 (store (select |v_#race_22| v_~datas~0.base_11) v_~datas~0.offset_11 0)) |v_#race_21|) InVars {#race=|v_#race_22|, ~datas~0.base=v_~datas~0.base_11, ~datas~0.offset=v_~datas~0.offset_11} OutVars{#race=|v_#race_21|, ~datas~0.base=v_~datas~0.base_11, ~datas~0.offset=v_~datas~0.offset_11} AuxVars[] AssignedVars[#race][520], [Black: 566#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 509#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 452#(= |#race~threads_total~0| 0), Black: 508#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 579#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet32#1|), 302#L1038-1true, Black: 462#true, 551#(not (= ~datas~0.base ~tids~0.base)), Black: 466#true, 505#true, 445#true, 472#(= |#race~datas~0| 0), Black: 470#true, 468#(= |#race~tids~0| 0), 327#L1072-3true, Black: 476#(= |#race~threads_alive~0| 0), Black: 539#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 530#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base))), Black: 541#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 529#(not (= ~datas~0.base ~tids~0.base)), Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 582#true, 577#true, 443#true, Black: 486#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 497#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) |cleanerThread1of1ForFork0_#t~nondet8|), Black: 500#true, 464#(= |#race~datas_mutex~0| 0), 127#L1029-1true, Black: 570#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 572#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 568#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base))), Black: 507#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)]) [2025-03-17 11:17:17,736 INFO L294 olderBase$Statistics]: this new event has 392 ancestors and is cut-off event [2025-03-17 11:17:17,736 INFO L297 olderBase$Statistics]: existing Event has 392 ancestors and is cut-off event [2025-03-17 11:17:17,736 INFO L297 olderBase$Statistics]: existing Event has 392 ancestors and is cut-off event [2025-03-17 11:17:17,736 INFO L297 olderBase$Statistics]: existing Event has 392 ancestors and is cut-off event [2025-03-17 11:17:17,737 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([574] L1072-5-->L1072-3: Formula: (= (store |v_#race_22| v_~datas~0.base_11 (store (select |v_#race_22| v_~datas~0.base_11) v_~datas~0.offset_11 0)) |v_#race_21|) InVars {#race=|v_#race_22|, ~datas~0.base=v_~datas~0.base_11, ~datas~0.offset=v_~datas~0.offset_11} OutVars{#race=|v_#race_21|, ~datas~0.base=v_~datas~0.base_11, ~datas~0.offset=v_~datas~0.offset_11} AuxVars[] AssignedVars[#race][520], [Black: 566#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 509#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 452#(= |#race~threads_total~0| 0), Black: 508#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 579#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet32#1|), 302#L1038-1true, Black: 462#true, 551#(not (= ~datas~0.base ~tids~0.base)), Black: 466#true, 505#true, 445#true, 472#(= |#race~datas~0| 0), Black: 470#true, 468#(= |#race~tids~0| 0), 327#L1072-3true, Black: 476#(= |#race~threads_alive~0| 0), Black: 539#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 530#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base))), Black: 541#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 529#(not (= ~datas~0.base ~tids~0.base)), Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 582#true, 577#true, 443#true, Black: 486#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 497#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) |cleanerThread1of1ForFork0_#t~nondet8|), Black: 500#true, 464#(= |#race~datas_mutex~0| 0), 127#L1029-1true, Black: 570#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 572#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 568#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base))), Black: 507#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)]) [2025-03-17 11:17:17,737 INFO L294 olderBase$Statistics]: this new event has 392 ancestors and is cut-off event [2025-03-17 11:17:17,737 INFO L297 olderBase$Statistics]: existing Event has 392 ancestors and is cut-off event [2025-03-17 11:17:17,737 INFO L297 olderBase$Statistics]: existing Event has 392 ancestors and is cut-off event [2025-03-17 11:17:17,737 INFO L297 olderBase$Statistics]: existing Event has 392 ancestors and is cut-off event [2025-03-17 11:17:17,737 INFO L297 olderBase$Statistics]: existing Event has 392 ancestors and is cut-off event [2025-03-17 11:17:17,788 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([844] L1038-2-->L1038: Formula: (= (store |v_#race_14| v_~datas~0.base_3 (store (select |v_#race_14| v_~datas~0.base_3) (+ v_cleanerThread1of1ForFork0_~i~1_23 v_~datas~0.offset_3) |v_cleanerThread1of1ForFork0_#t~nondet8_3|)) |v_#race_13|) InVars {#race=|v_#race_14|, cleanerThread1of1ForFork0_~i~1=v_cleanerThread1of1ForFork0_~i~1_23, ~datas~0.base=v_~datas~0.base_3, cleanerThread1of1ForFork0_#t~nondet8=|v_cleanerThread1of1ForFork0_#t~nondet8_3|, ~datas~0.offset=v_~datas~0.offset_3} OutVars{#race=|v_#race_13|, cleanerThread1of1ForFork0_~i~1=v_cleanerThread1of1ForFork0_~i~1_23, ~datas~0.base=v_~datas~0.base_3, cleanerThread1of1ForFork0_#t~nondet8=|v_cleanerThread1of1ForFork0_#t~nondet8_3|, ~datas~0.offset=v_~datas~0.offset_3} AuxVars[] AssignedVars[#race][532], [Black: 566#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 509#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 508#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), 452#(= |#race~threads_total~0| 0), Black: 579#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet32#1|), Black: 462#true, 551#(not (= ~datas~0.base ~tids~0.base)), Black: 466#true, 505#true, 445#true, 472#(= |#race~datas~0| 0), Black: 470#true, 468#(= |#race~tids~0| 0), 272#L1038true, Black: 476#(= |#race~threads_alive~0| 0), Black: 539#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 530#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base))), Black: 541#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 529#(not (= ~datas~0.base ~tids~0.base)), Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 582#true, 577#true, 443#true, Black: 486#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 495#true, 241#L1072-4true, Black: 502#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 464#(= |#race~datas_mutex~0| 0), 127#L1029-1true, Black: 570#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 572#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 568#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base))), Black: 507#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)]) [2025-03-17 11:17:17,788 INFO L294 olderBase$Statistics]: this new event has 392 ancestors and is cut-off event [2025-03-17 11:17:17,788 INFO L297 olderBase$Statistics]: existing Event has 392 ancestors and is cut-off event [2025-03-17 11:17:17,788 INFO L297 olderBase$Statistics]: existing Event has 392 ancestors and is cut-off event [2025-03-17 11:17:17,788 INFO L297 olderBase$Statistics]: existing Event has 392 ancestors and is cut-off event [2025-03-17 11:17:17,838 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([574] L1072-5-->L1072-3: Formula: (= (store |v_#race_22| v_~datas~0.base_11 (store (select |v_#race_22| v_~datas~0.base_11) v_~datas~0.offset_11 0)) |v_#race_21|) InVars {#race=|v_#race_22|, ~datas~0.base=v_~datas~0.base_11, ~datas~0.offset=v_~datas~0.offset_11} OutVars{#race=|v_#race_21|, ~datas~0.base=v_~datas~0.base_11, ~datas~0.offset=v_~datas~0.offset_11} AuxVars[] AssignedVars[#race][454], [Black: 566#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 509#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 508#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), 452#(= |#race~threads_total~0| 0), Black: 579#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet32#1|), Black: 462#true, 551#(not (= ~datas~0.base ~tids~0.base)), Black: 466#true, 505#true, 445#true, 472#(= |#race~datas~0| 0), Black: 470#true, 98#L1039-9true, 468#(= |#race~tids~0| 0), 327#L1072-3true, Black: 476#(= |#race~threads_alive~0| 0), Black: 539#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 530#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base))), Black: 541#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 529#(not (= ~datas~0.base ~tids~0.base)), 582#true, 577#true, 443#true, Black: 486#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 497#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) |cleanerThread1of1ForFork0_#t~nondet8|), Black: 500#true, 464#(= |#race~datas_mutex~0| 0), 127#L1029-1true, Black: 570#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 572#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 568#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base))), Black: 507#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)]) [2025-03-17 11:17:17,839 INFO L294 olderBase$Statistics]: this new event has 393 ancestors and is cut-off event [2025-03-17 11:17:17,839 INFO L297 olderBase$Statistics]: existing Event has 393 ancestors and is cut-off event [2025-03-17 11:17:17,839 INFO L297 olderBase$Statistics]: existing Event has 393 ancestors and is cut-off event [2025-03-17 11:17:17,839 INFO L297 olderBase$Statistics]: existing Event has 393 ancestors and is cut-off event [2025-03-17 11:17:17,881 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([844] L1038-2-->L1038: Formula: (= (store |v_#race_14| v_~datas~0.base_3 (store (select |v_#race_14| v_~datas~0.base_3) (+ v_cleanerThread1of1ForFork0_~i~1_23 v_~datas~0.offset_3) |v_cleanerThread1of1ForFork0_#t~nondet8_3|)) |v_#race_13|) InVars {#race=|v_#race_14|, cleanerThread1of1ForFork0_~i~1=v_cleanerThread1of1ForFork0_~i~1_23, ~datas~0.base=v_~datas~0.base_3, cleanerThread1of1ForFork0_#t~nondet8=|v_cleanerThread1of1ForFork0_#t~nondet8_3|, ~datas~0.offset=v_~datas~0.offset_3} OutVars{#race=|v_#race_13|, cleanerThread1of1ForFork0_~i~1=v_cleanerThread1of1ForFork0_~i~1_23, ~datas~0.base=v_~datas~0.base_3, cleanerThread1of1ForFork0_#t~nondet8=|v_cleanerThread1of1ForFork0_#t~nondet8_3|, ~datas~0.offset=v_~datas~0.offset_3} AuxVars[] AssignedVars[#race][358], [Black: 566#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 509#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 508#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), 452#(= |#race~threads_total~0| 0), Black: 579#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet32#1|), 134#L1030-5true, Black: 462#true, 551#(not (= ~datas~0.base ~tids~0.base)), Black: 466#true, 505#true, 445#true, 472#(= |#race~datas~0| 0), Black: 470#true, 468#(= |#race~tids~0| 0), 272#L1038true, Black: 476#(= |#race~threads_alive~0| 0), Black: 539#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 530#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base))), Black: 541#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 529#(not (= ~datas~0.base ~tids~0.base)), Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 582#true, 577#true, 443#true, Black: 486#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 495#true, 241#L1072-4true, Black: 502#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 464#(= |#race~datas_mutex~0| 0), Black: 570#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 572#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 568#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base))), Black: 507#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)]) [2025-03-17 11:17:17,881 INFO L294 olderBase$Statistics]: this new event has 393 ancestors and is cut-off event [2025-03-17 11:17:17,881 INFO L297 olderBase$Statistics]: existing Event has 393 ancestors and is cut-off event [2025-03-17 11:17:17,881 INFO L297 olderBase$Statistics]: existing Event has 393 ancestors and is cut-off event [2025-03-17 11:17:17,881 INFO L297 olderBase$Statistics]: existing Event has 393 ancestors and is cut-off event [2025-03-17 11:17:17,933 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([574] L1072-5-->L1072-3: Formula: (= (store |v_#race_22| v_~datas~0.base_11 (store (select |v_#race_22| v_~datas~0.base_11) v_~datas~0.offset_11 0)) |v_#race_21|) InVars {#race=|v_#race_22|, ~datas~0.base=v_~datas~0.base_11, ~datas~0.offset=v_~datas~0.offset_11} OutVars{#race=|v_#race_21|, ~datas~0.base=v_~datas~0.base_11, ~datas~0.offset=v_~datas~0.offset_11} AuxVars[] AssignedVars[#race][454], [Black: 566#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 509#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 452#(= |#race~threads_total~0| 0), Black: 508#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 579#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet32#1|), Black: 462#true, 551#(not (= ~datas~0.base ~tids~0.base)), Black: 466#true, 445#true, 505#true, 472#(= |#race~datas~0| 0), Black: 470#true, 98#L1039-9true, 468#(= |#race~tids~0| 0), 327#L1072-3true, Black: 476#(= |#race~threads_alive~0| 0), Black: 539#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 530#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base))), Black: 541#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 529#(not (= ~datas~0.base ~tids~0.base)), 582#true, Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 577#true, 443#true, Black: 486#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 497#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) |cleanerThread1of1ForFork0_#t~nondet8|), Black: 500#true, 464#(= |#race~datas_mutex~0| 0), 127#L1029-1true, Black: 570#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 572#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 568#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base))), Black: 507#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)]) [2025-03-17 11:17:17,933 INFO L294 olderBase$Statistics]: this new event has 393 ancestors and is not cut-off event [2025-03-17 11:17:17,933 INFO L297 olderBase$Statistics]: existing Event has 393 ancestors and is not cut-off event [2025-03-17 11:17:17,933 INFO L297 olderBase$Statistics]: existing Event has 393 ancestors and is not cut-off event [2025-03-17 11:17:17,933 INFO L297 olderBase$Statistics]: existing Event has 393 ancestors and is not cut-off event [2025-03-17 11:17:17,933 INFO L297 olderBase$Statistics]: existing Event has 393 ancestors and is not cut-off event [2025-03-17 11:17:17,978 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([844] L1038-2-->L1038: Formula: (= (store |v_#race_14| v_~datas~0.base_3 (store (select |v_#race_14| v_~datas~0.base_3) (+ v_cleanerThread1of1ForFork0_~i~1_23 v_~datas~0.offset_3) |v_cleanerThread1of1ForFork0_#t~nondet8_3|)) |v_#race_13|) InVars {#race=|v_#race_14|, cleanerThread1of1ForFork0_~i~1=v_cleanerThread1of1ForFork0_~i~1_23, ~datas~0.base=v_~datas~0.base_3, cleanerThread1of1ForFork0_#t~nondet8=|v_cleanerThread1of1ForFork0_#t~nondet8_3|, ~datas~0.offset=v_~datas~0.offset_3} OutVars{#race=|v_#race_13|, cleanerThread1of1ForFork0_~i~1=v_cleanerThread1of1ForFork0_~i~1_23, ~datas~0.base=v_~datas~0.base_3, cleanerThread1of1ForFork0_#t~nondet8=|v_cleanerThread1of1ForFork0_#t~nondet8_3|, ~datas~0.offset=v_~datas~0.offset_3} AuxVars[] AssignedVars[#race][358], [Black: 566#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 509#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 510#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 508#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), 452#(= |#race~threads_total~0| 0), Black: 579#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet32#1|), Black: 462#true, 551#(not (= ~datas~0.base ~tids~0.base)), Black: 466#true, 505#true, 445#true, 472#(= |#race~datas~0| 0), Black: 470#true, 468#(= |#race~tids~0| 0), 272#L1038true, Black: 476#(= |#race~threads_alive~0| 0), Black: 539#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 530#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base))), 424#L1030true, Black: 541#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 529#(not (= ~datas~0.base ~tids~0.base)), Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 582#true, 577#true, 443#true, Black: 486#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 495#true, 241#L1072-4true, Black: 502#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 464#(= |#race~datas_mutex~0| 0), Black: 570#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 572#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 568#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base))), Black: 507#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)]) [2025-03-17 11:17:17,978 INFO L294 olderBase$Statistics]: this new event has 396 ancestors and is cut-off event [2025-03-17 11:17:17,978 INFO L297 olderBase$Statistics]: existing Event has 396 ancestors and is cut-off event [2025-03-17 11:17:17,978 INFO L297 olderBase$Statistics]: existing Event has 396 ancestors and is cut-off event [2025-03-17 11:17:17,978 INFO L297 olderBase$Statistics]: existing Event has 396 ancestors and is cut-off event [2025-03-17 11:17:18,173 INFO L124 PetriNetUnfolderBase]: 12555/38846 cut-off events. [2025-03-17 11:17:18,173 INFO L125 PetriNetUnfolderBase]: For 74608/76702 co-relation queries the response was YES. [2025-03-17 11:17:18,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100395 conditions, 38846 events. 12555/38846 cut-off events. For 74608/76702 co-relation queries the response was YES. Maximal size of possible extension queue 758. Compared 427000 event pairs, 5004 based on Foata normal form. 99/35061 useless extension candidates. Maximal degree in co-relation 100224. Up to 15864 conditions per place. [2025-03-17 11:17:18,470 INFO L140 encePairwiseOnDemand]: 436/451 looper letters, 116 selfloop transitions, 104 changer transitions 0/581 dead transitions. [2025-03-17 11:17:18,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 581 transitions, 3456 flow [2025-03-17 11:17:18,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:17:18,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:17:18,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1252 transitions. [2025-03-17 11:17:18,472 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.925351071692535 [2025-03-17 11:17:18,472 INFO L175 Difference]: Start difference. First operand has 398 places, 493 transitions, 2216 flow. Second operand 3 states and 1252 transitions. [2025-03-17 11:17:18,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 581 transitions, 3456 flow [2025-03-17 11:17:18,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 398 places, 581 transitions, 3430 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-03-17 11:17:18,599 INFO L231 Difference]: Finished difference. Result has 400 places, 571 transitions, 3544 flow [2025-03-17 11:17:18,599 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=451, PETRI_DIFFERENCE_MINUEND_FLOW=2194, PETRI_DIFFERENCE_MINUEND_PLACES=396, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=493, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=389, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3544, PETRI_PLACES=400, PETRI_TRANSITIONS=571} [2025-03-17 11:17:18,600 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, 25 predicate places. [2025-03-17 11:17:18,600 INFO L471 AbstractCegarLoop]: Abstraction has has 400 places, 571 transitions, 3544 flow [2025-03-17 11:17:18,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 402.3333333333333) internal successors, (1207), 3 states have internal predecessors, (1207), 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-17 11:17:18,601 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:17:18,601 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:17:18,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 11:17:18,601 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting cleanerErr3ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-17 11:17:18,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:17:18,602 INFO L85 PathProgramCache]: Analyzing trace with hash 494985366, now seen corresponding path program 1 times [2025-03-17 11:17:18,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:17:18,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685210784] [2025-03-17 11:17:18,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:17:18,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:17:18,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-17 11:17:18,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-17 11:17:18,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:17:18,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:17:18,881 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:17:18,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:17:18,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685210784] [2025-03-17 11:17:18,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685210784] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:17:18,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:17:18,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 11:17:18,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13342560] [2025-03-17 11:17:18,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:17:18,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 11:17:18,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:17:18,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 11:17:18,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:17:19,137 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 404 out of 451 [2025-03-17 11:17:19,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 571 transitions, 3544 flow. Second operand has 7 states, 7 states have (on average 406.14285714285717) internal successors, (2843), 7 states have internal predecessors, (2843), 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-17 11:17:19,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:17:19,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 404 of 451 [2025-03-17 11:17:19,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand