./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/per-thread-array-join-counter-race-4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-race-challenges/per-thread-array-join-counter-race-4.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 12fde76b4484c87975ec3c2c6c513458a595d4b258864aadbba7a9ba15d60c4e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:57:56,474 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:57:56,529 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:57:56,533 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:57:56,536 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:57:56,549 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:57:56,550 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:57:56,550 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:57:56,550 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:57:56,551 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:57:56,551 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:57:56,551 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:57:56,552 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:57:56,552 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:57:56,552 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:57:56,552 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:57:56,552 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:57:56,552 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:57:56,553 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:57:56,553 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:57:56,553 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:57:56,553 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:57:56,553 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:57:56,553 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:57:56,553 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:57:56,553 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:57:56,553 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:57:56,553 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:57:56,553 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:57:56,553 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:57:56,553 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:57:56,554 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:57:56,554 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:57:56,554 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:57:56,554 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:57:56,554 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:57:56,554 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:57:56,555 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:57:56,555 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:57:56,555 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:57:56,555 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:57:56,555 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:57:56,555 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 -> 12fde76b4484c87975ec3c2c6c513458a595d4b258864aadbba7a9ba15d60c4e [2025-03-04 06:57:56,776 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:57:56,783 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:57:56,785 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:57:56,786 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:57:56,786 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:57:56,787 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-race-4.i [2025-03-04 06:57:57,972 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8f24cce2/f016cea87b0048ea81063622f4427777/FLAG5cbcfb136 [2025-03-04 06:57:58,291 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:57:58,293 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-array-join-counter-race-4.i [2025-03-04 06:57:58,312 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8f24cce2/f016cea87b0048ea81063622f4427777/FLAG5cbcfb136 [2025-03-04 06:57:58,550 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8f24cce2/f016cea87b0048ea81063622f4427777 [2025-03-04 06:57:58,552 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:57:58,553 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:57:58,554 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:57:58,555 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:57:58,558 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:57:58,559 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:57:58" (1/1) ... [2025-03-04 06:57:58,559 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c5870fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:58, skipping insertion in model container [2025-03-04 06:57:58,560 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:57:58" (1/1) ... [2025-03-04 06:57:58,598 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:57:58,980 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:57:59,004 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:57:59,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:57:59,112 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:57:59,113 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:59 WrapperNode [2025-03-04 06:57:59,113 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:57:59,114 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:57:59,114 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:57:59,114 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:57:59,119 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:59" (1/1) ... [2025-03-04 06:57:59,138 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:59" (1/1) ... [2025-03-04 06:57:59,164 INFO L138 Inliner]: procedures = 267, calls = 34, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 262 [2025-03-04 06:57:59,164 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:57:59,164 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:57:59,165 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:57:59,165 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:57:59,170 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:59" (1/1) ... [2025-03-04 06:57:59,171 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:59" (1/1) ... [2025-03-04 06:57:59,178 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:59" (1/1) ... [2025-03-04 06:57:59,178 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:59" (1/1) ... [2025-03-04 06:57:59,186 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:59" (1/1) ... [2025-03-04 06:57:59,187 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:59" (1/1) ... [2025-03-04 06:57:59,188 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:59" (1/1) ... [2025-03-04 06:57:59,189 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:59" (1/1) ... [2025-03-04 06:57:59,191 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:57:59,193 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:57:59,193 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:57:59,194 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:57:59,194 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:59" (1/1) ... [2025-03-04 06:57:59,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:57:59,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:57:59,220 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 06:57:59,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 06:57:59,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 06:57:59,235 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 06:57:59,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 06:57:59,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:57:59,236 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 06:57:59,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 06:57:59,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:57:59,236 INFO L130 BoogieDeclarations]: Found specification of procedure cleaner [2025-03-04 06:57:59,237 INFO L138 BoogieDeclarations]: Found implementation of procedure cleaner [2025-03-04 06:57:59,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:57:59,237 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-03-04 06:57:59,237 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-03-04 06:57:59,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:57:59,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:57:59,238 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:57:59,350 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:57:59,351 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:57:59,717 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1072: havoc main_#t~mem39#1; [2025-03-04 06:57:59,736 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:57:59,737 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:57:59,770 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:57:59,775 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:57:59,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:57:59 BoogieIcfgContainer [2025-03-04 06:57:59,776 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:57:59,778 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:57:59,779 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:57:59,782 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:57:59,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:57:58" (1/3) ... [2025-03-04 06:57:59,783 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d80f999 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:57:59, skipping insertion in model container [2025-03-04 06:57:59,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:57:59" (2/3) ... [2025-03-04 06:57:59,783 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d80f999 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:57:59, skipping insertion in model container [2025-03-04 06:57:59,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:57:59" (3/3) ... [2025-03-04 06:57:59,784 INFO L128 eAbstractionObserver]: Analyzing ICFG per-thread-array-join-counter-race-4.i [2025-03-04 06:57:59,795 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:57:59,797 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG per-thread-array-join-counter-race-4.i that has 3 procedures, 370 locations, 1 initial locations, 5 loop locations, and 34 error locations. [2025-03-04 06:57:59,798 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:57:59,867 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 06:57:59,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 444 places, 451 transitions, 916 flow [2025-03-04 06:58:00,047 INFO L124 PetriNetUnfolderBase]: 19/567 cut-off events. [2025-03-04 06:58:00,049 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 06:58:00,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 578 conditions, 567 events. 19/567 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 915 event pairs, 0 based on Foata normal form. 0/483 useless extension candidates. Maximal degree in co-relation 363. Up to 6 conditions per place. [2025-03-04 06:58:00,063 INFO L82 GeneralOperation]: Start removeDead. Operand has 444 places, 451 transitions, 916 flow [2025-03-04 06:58:00,072 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 375 places, 379 transitions, 768 flow [2025-03-04 06:58:00,081 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:58:00,091 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;@5f34e669, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:58:00,091 INFO L334 AbstractCegarLoop]: Starting to check reachability of 51 error locations. [2025-03-04 06:58:00,109 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:58:00,109 INFO L124 PetriNetUnfolderBase]: 0/140 cut-off events. [2025-03-04 06:58:00,110 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:58:00,110 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:00,111 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-04 06:58:00,111 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-04 06:58:00,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:00,116 INFO L85 PathProgramCache]: Analyzing trace with hash -2013997046, now seen corresponding path program 1 times [2025-03-04 06:58:00,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:00,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211536497] [2025-03-04 06:58:00,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:00,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:00,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-04 06:58:00,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-04 06:58:00,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:00,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:00,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:58:00,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:00,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211536497] [2025-03-04 06:58:00,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211536497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:00,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:00,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:58:00,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073641184] [2025-03-04 06:58:00,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:00,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:58:00,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:00,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:58:00,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:58:00,551 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 451 [2025-03-04 06:58:00,554 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-04 06:58:00,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:00,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 451 [2025-03-04 06:58:00,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:01,083 INFO L124 PetriNetUnfolderBase]: 384/2882 cut-off events. [2025-03-04 06:58:01,083 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-03-04 06:58:01,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3515 conditions, 2882 events. 384/2882 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 20117 event pairs, 264 based on Foata normal form. 97/2495 useless extension candidates. Maximal degree in co-relation 3291. Up to 604 conditions per place. [2025-03-04 06:58:01,103 INFO L140 encePairwiseOnDemand]: 442/451 looper letters, 26 selfloop transitions, 2 changer transitions 1/370 dead transitions. [2025-03-04 06:58:01,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 370 transitions, 806 flow [2025-03-04 06:58:01,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:58:01,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:58:01,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1259 transitions. [2025-03-04 06:58:01,122 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9305247597930525 [2025-03-04 06:58:01,123 INFO L175 Difference]: Start difference. First operand has 375 places, 379 transitions, 768 flow. Second operand 3 states and 1259 transitions. [2025-03-04 06:58:01,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 370 transitions, 806 flow [2025-03-04 06:58:01,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 370 transitions, 805 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:58:01,135 INFO L231 Difference]: Finished difference. Result has 372 places, 369 transitions, 751 flow [2025-03-04 06:58:01,138 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-04 06:58:01,142 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -3 predicate places. [2025-03-04 06:58:01,143 INFO L471 AbstractCegarLoop]: Abstraction has has 372 places, 369 transitions, 751 flow [2025-03-04 06:58:01,143 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-04 06:58:01,143 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:01,144 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-04 06:58:01,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:58:01,144 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-04 06:58:01,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:01,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1397868406, now seen corresponding path program 1 times [2025-03-04 06:58:01,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:01,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701496605] [2025-03-04 06:58:01,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:01,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:01,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-04 06:58:01,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-04 06:58:01,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:01,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:01,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:58:01,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:01,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701496605] [2025-03-04 06:58:01,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701496605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:01,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:01,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:58:01,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843744561] [2025-03-04 06:58:01,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:01,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:58:01,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:01,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:58:01,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:58:01,299 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 398 out of 451 [2025-03-04 06:58:01,301 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-04 06:58:01,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:01,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 398 of 451 [2025-03-04 06:58:01,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:01,740 INFO L124 PetriNetUnfolderBase]: 405/2952 cut-off events. [2025-03-04 06:58:01,740 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2025-03-04 06:58:01,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3652 conditions, 2952 events. 405/2952 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 20617 event pairs, 305 based on Foata normal form. 0/2543 useless extension candidates. Maximal degree in co-relation 3503. Up to 667 conditions per place. [2025-03-04 06:58:01,755 INFO L140 encePairwiseOnDemand]: 443/451 looper letters, 29 selfloop transitions, 1 changer transitions 0/362 dead transitions. [2025-03-04 06:58:01,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 362 transitions, 797 flow [2025-03-04 06:58:01,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:58:01,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:58:01,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1231 transitions. [2025-03-04 06:58:01,760 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.909830007390983 [2025-03-04 06:58:01,760 INFO L175 Difference]: Start difference. First operand has 372 places, 369 transitions, 751 flow. Second operand 3 states and 1231 transitions. [2025-03-04 06:58:01,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 362 transitions, 797 flow [2025-03-04 06:58:01,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 362 transitions, 793 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:58:01,767 INFO L231 Difference]: Finished difference. Result has 364 places, 362 transitions, 735 flow [2025-03-04 06:58:01,768 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-04 06:58:01,768 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -11 predicate places. [2025-03-04 06:58:01,769 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 362 transitions, 735 flow [2025-03-04 06:58:01,769 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-04 06:58:01,769 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:01,770 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-04 06:58:01,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:58:01,770 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-04 06:58:01,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:01,771 INFO L85 PathProgramCache]: Analyzing trace with hash -2031788827, now seen corresponding path program 1 times [2025-03-04 06:58:01,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:01,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295313748] [2025-03-04 06:58:01,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:01,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:01,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-04 06:58:01,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-04 06:58:01,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:01,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:01,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:58:01,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:01,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295313748] [2025-03-04 06:58:01,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295313748] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:01,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:01,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:58:01,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503613622] [2025-03-04 06:58:01,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:01,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:58:01,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:01,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:58:01,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:58:01,911 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 451 [2025-03-04 06:58:01,913 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-04 06:58:01,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:01,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 451 [2025-03-04 06:58:01,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:02,238 INFO L124 PetriNetUnfolderBase]: 416/2832 cut-off events. [2025-03-04 06:58:02,238 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-03-04 06:58:02,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3522 conditions, 2832 events. 416/2832 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 20114 event pairs, 297 based on Foata normal form. 0/2417 useless extension candidates. Maximal degree in co-relation 3373. Up to 659 conditions per place. [2025-03-04 06:58:02,254 INFO L140 encePairwiseOnDemand]: 448/451 looper letters, 22 selfloop transitions, 2 changer transitions 0/361 dead transitions. [2025-03-04 06:58:02,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 361 transitions, 781 flow [2025-03-04 06:58:02,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:58:02,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:58:02,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1261 transitions. [2025-03-04 06:58:02,256 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9320029563932003 [2025-03-04 06:58:02,256 INFO L175 Difference]: Start difference. First operand has 364 places, 362 transitions, 735 flow. Second operand 3 states and 1261 transitions. [2025-03-04 06:58:02,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 361 transitions, 781 flow [2025-03-04 06:58:02,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 361 transitions, 780 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:58:02,263 INFO L231 Difference]: Finished difference. Result has 364 places, 361 transitions, 736 flow [2025-03-04 06:58:02,263 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-04 06:58:02,264 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -11 predicate places. [2025-03-04 06:58:02,264 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 361 transitions, 736 flow [2025-03-04 06:58:02,265 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-04 06:58:02,265 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:02,265 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-04 06:58:02,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:58:02,265 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-04 06:58:02,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:02,266 INFO L85 PathProgramCache]: Analyzing trace with hash 404919504, now seen corresponding path program 1 times [2025-03-04 06:58:02,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:02,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007714326] [2025-03-04 06:58:02,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:02,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:02,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-04 06:58:02,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-04 06:58:02,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:02,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:02,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:58:02,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:02,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007714326] [2025-03-04 06:58:02,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007714326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:02,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:02,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:58:02,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877641435] [2025-03-04 06:58:02,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:02,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:58:02,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:02,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:58:02,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:58:02,414 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 410 out of 451 [2025-03-04 06:58:02,416 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-04 06:58:02,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:02,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 410 of 451 [2025-03-04 06:58:02,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:02,887 INFO L124 PetriNetUnfolderBase]: 549/3740 cut-off events. [2025-03-04 06:58:02,888 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-03-04 06:58:02,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4641 conditions, 3740 events. 549/3740 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 28714 event pairs, 411 based on Foata normal form. 0/3206 useless extension candidates. Maximal degree in co-relation 4492. Up to 861 conditions per place. [2025-03-04 06:58:02,912 INFO L140 encePairwiseOnDemand]: 448/451 looper letters, 23 selfloop transitions, 2 changer transitions 0/360 dead transitions. [2025-03-04 06:58:02,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 360 transitions, 784 flow [2025-03-04 06:58:02,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:58:02,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:58:02,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1256 transitions. [2025-03-04 06:58:02,915 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9283074648928308 [2025-03-04 06:58:02,916 INFO L175 Difference]: Start difference. First operand has 364 places, 361 transitions, 736 flow. Second operand 3 states and 1256 transitions. [2025-03-04 06:58:02,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 360 transitions, 784 flow [2025-03-04 06:58:02,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 360 transitions, 780 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:58:02,920 INFO L231 Difference]: Finished difference. Result has 363 places, 360 transitions, 734 flow [2025-03-04 06:58:02,921 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-04 06:58:02,921 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -12 predicate places. [2025-03-04 06:58:02,921 INFO L471 AbstractCegarLoop]: Abstraction has has 363 places, 360 transitions, 734 flow [2025-03-04 06:58:02,922 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-04 06:58:02,922 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:02,922 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-04 06:58:02,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:58:02,922 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-04 06:58:02,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:02,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1012156685, now seen corresponding path program 1 times [2025-03-04 06:58:02,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:02,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447526007] [2025-03-04 06:58:02,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:02,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:02,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-04 06:58:02,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-04 06:58:02,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:02,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:03,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:58:03,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:03,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447526007] [2025-03-04 06:58:03,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447526007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:03,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:03,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:58:03,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407299791] [2025-03-04 06:58:03,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:03,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:58:03,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:03,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:58:03,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:58:03,063 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 451 [2025-03-04 06:58:03,064 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-04 06:58:03,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:03,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 451 [2025-03-04 06:58:03,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:03,395 INFO L124 PetriNetUnfolderBase]: 717/3499 cut-off events. [2025-03-04 06:58:03,395 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-03-04 06:58:03,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4616 conditions, 3499 events. 717/3499 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 25786 event pairs, 505 based on Foata normal form. 0/2897 useless extension candidates. Maximal degree in co-relation 4467. Up to 1075 conditions per place. [2025-03-04 06:58:03,420 INFO L140 encePairwiseOnDemand]: 448/451 looper letters, 24 selfloop transitions, 2 changer transitions 0/359 dead transitions. [2025-03-04 06:58:03,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 359 transitions, 784 flow [2025-03-04 06:58:03,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:58:03,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:58:03,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1254 transitions. [2025-03-04 06:58:03,423 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.926829268292683 [2025-03-04 06:58:03,423 INFO L175 Difference]: Start difference. First operand has 363 places, 360 transitions, 734 flow. Second operand 3 states and 1254 transitions. [2025-03-04 06:58:03,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 359 transitions, 784 flow [2025-03-04 06:58:03,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 359 transitions, 780 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:58:03,429 INFO L231 Difference]: Finished difference. Result has 362 places, 359 transitions, 732 flow [2025-03-04 06:58:03,430 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-04 06:58:03,431 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -13 predicate places. [2025-03-04 06:58:03,431 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 359 transitions, 732 flow [2025-03-04 06:58:03,432 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-04 06:58:03,432 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:03,433 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-04 06:58:03,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:58:03,433 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-04 06:58:03,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:03,436 INFO L85 PathProgramCache]: Analyzing trace with hash 2006520894, now seen corresponding path program 1 times [2025-03-04 06:58:03,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:03,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106655257] [2025-03-04 06:58:03,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:03,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:03,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-04 06:58:03,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-04 06:58:03,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:03,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:03,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:58:03,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:03,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106655257] [2025-03-04 06:58:03,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106655257] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:03,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:03,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:58:03,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124634192] [2025-03-04 06:58:03,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:03,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:58:03,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:03,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:58:03,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:58:03,548 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 401 out of 451 [2025-03-04 06:58:03,550 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-04 06:58:03,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:03,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 401 of 451 [2025-03-04 06:58:03,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:03,886 INFO L124 PetriNetUnfolderBase]: 1108/3870 cut-off events. [2025-03-04 06:58:03,886 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2025-03-04 06:58:03,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5580 conditions, 3870 events. 1108/3870 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 27587 event pairs, 465 based on Foata normal form. 0/3416 useless extension candidates. Maximal degree in co-relation 5432. Up to 1645 conditions per place. [2025-03-04 06:58:03,907 INFO L140 encePairwiseOnDemand]: 443/451 looper letters, 34 selfloop transitions, 3 changer transitions 0/365 dead transitions. [2025-03-04 06:58:03,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 365 transitions, 823 flow [2025-03-04 06:58:03,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:58:03,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:58:03,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1245 transitions. [2025-03-04 06:58:03,910 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9201773835920177 [2025-03-04 06:58:03,910 INFO L175 Difference]: Start difference. First operand has 362 places, 359 transitions, 732 flow. Second operand 3 states and 1245 transitions. [2025-03-04 06:58:03,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 365 transitions, 823 flow [2025-03-04 06:58:03,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 365 transitions, 819 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:58:03,915 INFO L231 Difference]: Finished difference. Result has 358 places, 357 transitions, 739 flow [2025-03-04 06:58:03,915 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-04 06:58:03,916 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -17 predicate places. [2025-03-04 06:58:03,916 INFO L471 AbstractCegarLoop]: Abstraction has has 358 places, 357 transitions, 739 flow [2025-03-04 06:58:03,917 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-04 06:58:03,917 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:03,917 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-04 06:58:03,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:58:03,918 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-04 06:58:03,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:03,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1526172523, now seen corresponding path program 1 times [2025-03-04 06:58:03,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:03,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370054272] [2025-03-04 06:58:03,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:03,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:03,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-04 06:58:03,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-04 06:58:03,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:03,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:04,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:58:04,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:04,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370054272] [2025-03-04 06:58:04,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370054272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:04,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:04,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:58:04,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214903979] [2025-03-04 06:58:04,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:04,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:58:04,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:04,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:58:04,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:58:04,025 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 410 out of 451 [2025-03-04 06:58:04,026 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-04 06:58:04,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:04,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 410 of 451 [2025-03-04 06:58:04,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:04,396 INFO L124 PetriNetUnfolderBase]: 508/3249 cut-off events. [2025-03-04 06:58:04,396 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-03-04 06:58:04,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4173 conditions, 3249 events. 508/3249 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 24760 event pairs, 334 based on Foata normal form. 0/2877 useless extension candidates. Maximal degree in co-relation 4025. Up to 842 conditions per place. [2025-03-04 06:58:04,418 INFO L140 encePairwiseOnDemand]: 445/451 looper letters, 28 selfloop transitions, 3 changer transitions 0/363 dead transitions. [2025-03-04 06:58:04,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 363 transitions, 813 flow [2025-03-04 06:58:04,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:58:04,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:58:04,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1264 transitions. [2025-03-04 06:58:04,422 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.934220251293422 [2025-03-04 06:58:04,422 INFO L175 Difference]: Start difference. First operand has 358 places, 357 transitions, 739 flow. Second operand 3 states and 1264 transitions. [2025-03-04 06:58:04,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 363 transitions, 813 flow [2025-03-04 06:58:04,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 363 transitions, 813 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:58:04,427 INFO L231 Difference]: Finished difference. Result has 358 places, 357 transitions, 754 flow [2025-03-04 06:58:04,428 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-04 06:58:04,428 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -17 predicate places. [2025-03-04 06:58:04,428 INFO L471 AbstractCegarLoop]: Abstraction has has 358 places, 357 transitions, 754 flow [2025-03-04 06:58:04,429 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-04 06:58:04,429 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:04,429 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-04 06:58:04,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:58:04,430 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-04 06:58:04,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:04,430 INFO L85 PathProgramCache]: Analyzing trace with hash 386970209, now seen corresponding path program 1 times [2025-03-04 06:58:04,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:04,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583005368] [2025-03-04 06:58:04,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:04,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:04,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-04 06:58:04,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-04 06:58:04,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:04,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:04,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:58:04,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:04,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583005368] [2025-03-04 06:58:04,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583005368] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:04,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:04,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:58:04,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349238043] [2025-03-04 06:58:04,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:04,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:58:04,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:04,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:58:04,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:58:04,544 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 404 out of 451 [2025-03-04 06:58:04,545 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-04 06:58:04,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:04,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 404 of 451 [2025-03-04 06:58:04,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:05,130 INFO L124 PetriNetUnfolderBase]: 1084/5580 cut-off events. [2025-03-04 06:58:05,130 INFO L125 PetriNetUnfolderBase]: For 48/51 co-relation queries the response was YES. [2025-03-04 06:58:05,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7423 conditions, 5580 events. 1084/5580 cut-off events. For 48/51 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 46553 event pairs, 469 based on Foata normal form. 0/4950 useless extension candidates. Maximal degree in co-relation 7274. Up to 1535 conditions per place. [2025-03-04 06:58:05,155 INFO L140 encePairwiseOnDemand]: 444/451 looper letters, 33 selfloop transitions, 3 changer transitions 0/365 dead transitions. [2025-03-04 06:58:05,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 365 transitions, 845 flow [2025-03-04 06:58:05,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:58:05,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:58:05,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1252 transitions. [2025-03-04 06:58:05,158 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.925351071692535 [2025-03-04 06:58:05,159 INFO L175 Difference]: Start difference. First operand has 358 places, 357 transitions, 754 flow. Second operand 3 states and 1252 transitions. [2025-03-04 06:58:05,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 365 transitions, 845 flow [2025-03-04 06:58:05,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 365 transitions, 845 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:58:05,163 INFO L231 Difference]: Finished difference. Result has 357 places, 356 transitions, 767 flow [2025-03-04 06:58:05,164 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-04 06:58:05,164 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -18 predicate places. [2025-03-04 06:58:05,165 INFO L471 AbstractCegarLoop]: Abstraction has has 357 places, 356 transitions, 767 flow [2025-03-04 06:58:05,166 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-04 06:58:05,166 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:05,166 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-04 06:58:05,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:58:05,166 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-04 06:58:05,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:05,167 INFO L85 PathProgramCache]: Analyzing trace with hash 35472856, now seen corresponding path program 1 times [2025-03-04 06:58:05,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:05,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894530140] [2025-03-04 06:58:05,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:05,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:05,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-04 06:58:05,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-04 06:58:05,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:05,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:05,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:58:05,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:05,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894530140] [2025-03-04 06:58:05,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894530140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:05,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:05,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:58:05,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893315784] [2025-03-04 06:58:05,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:05,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:58:05,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:05,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:58:05,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:58:05,263 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 451 [2025-03-04 06:58:05,264 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-04 06:58:05,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:05,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 451 [2025-03-04 06:58:05,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:05,946 INFO L124 PetriNetUnfolderBase]: 1280/6515 cut-off events. [2025-03-04 06:58:05,946 INFO L125 PetriNetUnfolderBase]: For 87/87 co-relation queries the response was YES. [2025-03-04 06:58:05,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8923 conditions, 6515 events. 1280/6515 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 56065 event pairs, 465 based on Foata normal form. 0/5761 useless extension candidates. Maximal degree in co-relation 8773. Up to 1020 conditions per place. [2025-03-04 06:58:05,981 INFO L140 encePairwiseOnDemand]: 440/451 looper letters, 40 selfloop transitions, 8 changer transitions 0/378 dead transitions. [2025-03-04 06:58:05,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 378 transitions, 913 flow [2025-03-04 06:58:05,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:58:05,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:58:05,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1275 transitions. [2025-03-04 06:58:05,983 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9423503325942351 [2025-03-04 06:58:05,983 INFO L175 Difference]: Start difference. First operand has 357 places, 356 transitions, 767 flow. Second operand 3 states and 1275 transitions. [2025-03-04 06:58:05,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 378 transitions, 913 flow [2025-03-04 06:58:05,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 378 transitions, 913 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:58:05,989 INFO L231 Difference]: Finished difference. Result has 361 places, 364 transitions, 837 flow [2025-03-04 06:58:05,990 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-04 06:58:05,991 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -14 predicate places. [2025-03-04 06:58:05,991 INFO L471 AbstractCegarLoop]: Abstraction has has 361 places, 364 transitions, 837 flow [2025-03-04 06:58:05,992 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-04 06:58:05,992 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:05,992 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-04 06:58:05,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:58:05,992 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-04 06:58:05,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:05,993 INFO L85 PathProgramCache]: Analyzing trace with hash 538064316, now seen corresponding path program 1 times [2025-03-04 06:58:05,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:05,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199479063] [2025-03-04 06:58:05,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:05,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:06,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-04 06:58:06,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-04 06:58:06,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:06,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:06,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:58:06,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:06,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199479063] [2025-03-04 06:58:06,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199479063] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:06,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:06,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:58:06,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399002736] [2025-03-04 06:58:06,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:06,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:58:06,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:06,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:58:06,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:58:06,282 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 451 [2025-03-04 06:58:06,284 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-04 06:58:06,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:06,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 451 [2025-03-04 06:58:06,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:07,995 INFO L124 PetriNetUnfolderBase]: 3184/14712 cut-off events. [2025-03-04 06:58:07,995 INFO L125 PetriNetUnfolderBase]: For 576/602 co-relation queries the response was YES. [2025-03-04 06:58:08,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21740 conditions, 14712 events. 3184/14712 cut-off events. For 576/602 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 148641 event pairs, 1587 based on Foata normal form. 0/13211 useless extension candidates. Maximal degree in co-relation 21587. Up to 3612 conditions per place. [2025-03-04 06:58:08,087 INFO L140 encePairwiseOnDemand]: 441/451 looper letters, 41 selfloop transitions, 9 changer transitions 0/385 dead transitions. [2025-03-04 06:58:08,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 385 transitions, 985 flow [2025-03-04 06:58:08,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:58:08,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:58:08,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1275 transitions. [2025-03-04 06:58:08,090 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9423503325942351 [2025-03-04 06:58:08,090 INFO L175 Difference]: Start difference. First operand has 361 places, 364 transitions, 837 flow. Second operand 3 states and 1275 transitions. [2025-03-04 06:58:08,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 385 transitions, 985 flow [2025-03-04 06:58:08,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 385 transitions, 969 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:58:08,100 INFO L231 Difference]: Finished difference. Result has 363 places, 372 transitions, 891 flow [2025-03-04 06:58:08,101 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-04 06:58:08,102 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -12 predicate places. [2025-03-04 06:58:08,102 INFO L471 AbstractCegarLoop]: Abstraction has has 363 places, 372 transitions, 891 flow [2025-03-04 06:58:08,103 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-04 06:58:08,103 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:08,103 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-04 06:58:08,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:58:08,103 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-04 06:58:08,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:08,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1900309161, now seen corresponding path program 1 times [2025-03-04 06:58:08,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:08,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063786686] [2025-03-04 06:58:08,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:08,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:08,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-04 06:58:08,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-04 06:58:08,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:08,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:08,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:58:08,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:08,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063786686] [2025-03-04 06:58:08,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063786686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:08,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:08,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:58:08,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576895651] [2025-03-04 06:58:08,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:08,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 06:58:08,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:08,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 06:58:08,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:58:08,352 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 451 [2025-03-04 06:58:08,354 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-04 06:58:08,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:08,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 451 [2025-03-04 06:58:08,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:09,630 INFO L124 PetriNetUnfolderBase]: 1981/10917 cut-off events. [2025-03-04 06:58:09,630 INFO L125 PetriNetUnfolderBase]: For 437/454 co-relation queries the response was YES. [2025-03-04 06:58:09,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15966 conditions, 10917 events. 1981/10917 cut-off events. For 437/454 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 108743 event pairs, 1301 based on Foata normal form. 4/9766 useless extension candidates. Maximal degree in co-relation 15810. Up to 2288 conditions per place. [2025-03-04 06:58:09,678 INFO L140 encePairwiseOnDemand]: 442/451 looper letters, 34 selfloop transitions, 8 changer transitions 0/386 dead transitions. [2025-03-04 06:58:09,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 386 transitions, 1002 flow [2025-03-04 06:58:09,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:58:09,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:58:09,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2509 transitions. [2025-03-04 06:58:09,682 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9271988174427199 [2025-03-04 06:58:09,682 INFO L175 Difference]: Start difference. First operand has 363 places, 372 transitions, 891 flow. Second operand 6 states and 2509 transitions. [2025-03-04 06:58:09,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 386 transitions, 1002 flow [2025-03-04 06:58:09,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 386 transitions, 984 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:58:09,691 INFO L231 Difference]: Finished difference. Result has 370 places, 376 transitions, 918 flow [2025-03-04 06:58:09,691 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-04 06:58:09,692 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -5 predicate places. [2025-03-04 06:58:09,692 INFO L471 AbstractCegarLoop]: Abstraction has has 370 places, 376 transitions, 918 flow [2025-03-04 06:58:09,693 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-04 06:58:09,693 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:09,693 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-04 06:58:09,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:58:09,693 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-04 06:58:09,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:09,694 INFO L85 PathProgramCache]: Analyzing trace with hash 2070830332, now seen corresponding path program 1 times [2025-03-04 06:58:09,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:09,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071192822] [2025-03-04 06:58:09,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:09,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:09,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-04 06:58:09,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-04 06:58:09,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:09,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:09,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:58:09,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:09,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071192822] [2025-03-04 06:58:09,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071192822] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:09,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:09,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:58:09,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17981050] [2025-03-04 06:58:09,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:09,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:58:09,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:09,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:58:09,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:58:09,905 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 451 [2025-03-04 06:58:09,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 376 transitions, 918 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-04 06:58:09,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:09,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 451 [2025-03-04 06:58:09,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:11,793 INFO L124 PetriNetUnfolderBase]: 2823/13670 cut-off events. [2025-03-04 06:58:11,793 INFO L125 PetriNetUnfolderBase]: For 1099/1145 co-relation queries the response was YES. [2025-03-04 06:58:11,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21044 conditions, 13670 events. 2823/13670 cut-off events. For 1099/1145 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 139010 event pairs, 1522 based on Foata normal form. 0/12285 useless extension candidates. Maximal degree in co-relation 20883. Up to 3416 conditions per place. [2025-03-04 06:58:11,866 INFO L140 encePairwiseOnDemand]: 446/451 looper letters, 38 selfloop transitions, 6 changer transitions 0/388 dead transitions. [2025-03-04 06:58:11,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 388 transitions, 1041 flow [2025-03-04 06:58:11,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:58:11,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:58:11,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1270 transitions. [2025-03-04 06:58:11,869 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9386548410938654 [2025-03-04 06:58:11,869 INFO L175 Difference]: Start difference. First operand has 370 places, 376 transitions, 918 flow. Second operand 3 states and 1270 transitions. [2025-03-04 06:58:11,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 388 transitions, 1041 flow [2025-03-04 06:58:11,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 388 transitions, 1037 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:58:11,875 INFO L231 Difference]: Finished difference. Result has 373 places, 381 transitions, 968 flow [2025-03-04 06:58:11,876 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=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=968, PETRI_PLACES=373, PETRI_TRANSITIONS=381} [2025-03-04 06:58:11,876 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -2 predicate places. [2025-03-04 06:58:11,876 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 381 transitions, 968 flow [2025-03-04 06:58:11,877 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-04 06:58:11,877 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:11,877 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] [2025-03-04 06:58:11,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:58:11,878 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting cleanerErr5ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-04 06:58:11,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:11,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1495117946, now seen corresponding path program 1 times [2025-03-04 06:58:11,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:11,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388901946] [2025-03-04 06:58:11,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:11,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:11,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-04 06:58:11,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-04 06:58:11,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:11,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:12,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:58:12,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:12,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388901946] [2025-03-04 06:58:12,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388901946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:12,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:12,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:58:12,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194696863] [2025-03-04 06:58:12,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:12,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 06:58:12,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:12,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 06:58:12,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:58:12,109 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 451 [2025-03-04 06:58:12,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 381 transitions, 968 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-04 06:58:12,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:12,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 451 [2025-03-04 06:58:12,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:13,695 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([897] L1030-3-->L1030: Formula: (and (= |v_threadThread1of1ForFork1_#t~ret5_1| 0) (= (store |v_#pthreadsMutex_112| v_~datas_mutex~0.base_18 (store (select |v_#pthreadsMutex_112| v_~datas_mutex~0.base_18) (+ (* v_threadThread1of1ForFork1_~i~0_13 24) v_~datas_mutex~0.offset_18) 0)) |v_#pthreadsMutex_111|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_112|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_18, ~datas_mutex~0.base=v_~datas_mutex~0.base_18} OutVars{#pthreadsMutex=|v_#pthreadsMutex_111|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_18, threadThread1of1ForFork1_#t~ret5=|v_threadThread1of1ForFork1_#t~ret5_1|, ~datas_mutex~0.base=v_~datas_mutex~0.base_18} AuxVars[] AssignedVars[#pthreadsMutex, threadThread1of1ForFork1_#t~ret5][343], [452#(= |#race~threads_total~0| 0), Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 243#L1045true, 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)), 422#L1030true, 174#ULTIMATE.startFINALtrue, Black: 487#(<= ~threads_total~0 0), Black: 490#(and (= |ULTIMATE.start_main_~i~2#1| 0) (<= ~threads_total~0 0)), Black: 462#true, Black: 497#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 500#true, Black: 466#true, 495#true, 445#true, 472#(= |#race~datas~0| 0), Black: 470#true, 464#(= |#race~datas_mutex~0| 0), 468#(= |#race~tids~0| 0), Black: 474#true]) [2025-03-04 06:58:13,695 INFO L294 olderBase$Statistics]: this new event has 377 ancestors and is cut-off event [2025-03-04 06:58:13,695 INFO L297 olderBase$Statistics]: existing Event has 377 ancestors and is cut-off event [2025-03-04 06:58:13,695 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2025-03-04 06:58:13,696 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2025-03-04 06:58:13,720 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([847] L1035-3-->L1035-2: Formula: (= v_cleanerThread1of1ForFork0_~i~1_31 (+ |v_cleanerThread1of1ForFork0_#t~post15_3| 1)) InVars {cleanerThread1of1ForFork0_#t~post15=|v_cleanerThread1of1ForFork0_#t~post15_3|} OutVars{cleanerThread1of1ForFork0_#t~post15=|v_cleanerThread1of1ForFork0_#t~post15_3|, cleanerThread1of1ForFork0_~i~1=v_cleanerThread1of1ForFork0_~i~1_31} AuxVars[] AssignedVars[cleanerThread1of1ForFork0_~i~1][324], [452#(= |#race~threads_total~0| 0), Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 162#L1029true, 29#L1035-2true, 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), 174#ULTIMATE.startFINALtrue, Black: 490#(and (= |ULTIMATE.start_main_~i~2#1| 0) (<= ~threads_total~0 0)), Black: 462#true, Black: 497#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 500#true, Black: 466#true, 495#true, 445#true, 472#(= |#race~datas~0| 0), Black: 470#true, 464#(= |#race~datas_mutex~0| 0), 468#(= |#race~tids~0| 0), Black: 474#true]) [2025-03-04 06:58:13,720 INFO L294 olderBase$Statistics]: this new event has 375 ancestors and is cut-off event [2025-03-04 06:58:13,720 INFO L297 olderBase$Statistics]: existing Event has 292 ancestors and is cut-off event [2025-03-04 06:58:13,720 INFO L297 olderBase$Statistics]: existing Event has 292 ancestors and is cut-off event [2025-03-04 06:58:13,720 INFO L297 olderBase$Statistics]: existing Event has 375 ancestors and is cut-off event [2025-03-04 06:58:13,826 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([847] L1035-3-->L1035-2: Formula: (= v_cleanerThread1of1ForFork0_~i~1_31 (+ |v_cleanerThread1of1ForFork0_#t~post15_3| 1)) InVars {cleanerThread1of1ForFork0_#t~post15=|v_cleanerThread1of1ForFork0_#t~post15_3|} OutVars{cleanerThread1of1ForFork0_#t~post15=|v_cleanerThread1of1ForFork0_#t~post15_3|, cleanerThread1of1ForFork0_~i~1=v_cleanerThread1of1ForFork0_~i~1_31} AuxVars[] AssignedVars[cleanerThread1of1ForFork0_~i~1][324], [452#(= |#race~threads_total~0| 0), Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 162#L1029true, 29#L1035-2true, 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)), 174#ULTIMATE.startFINALtrue, Black: 487#(<= ~threads_total~0 0), Black: 490#(and (= |ULTIMATE.start_main_~i~2#1| 0) (<= ~threads_total~0 0)), Black: 462#true, Black: 497#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 500#true, Black: 466#true, 495#true, 445#true, 472#(= |#race~datas~0| 0), Black: 470#true, 464#(= |#race~datas_mutex~0| 0), 468#(= |#race~tids~0| 0), Black: 476#(= |#race~threads_alive~0| 0)]) [2025-03-04 06:58:13,826 INFO L294 olderBase$Statistics]: this new event has 396 ancestors and is cut-off event [2025-03-04 06:58:13,826 INFO L297 olderBase$Statistics]: existing Event has 375 ancestors and is cut-off event [2025-03-04 06:58:13,826 INFO L297 olderBase$Statistics]: existing Event has 375 ancestors and is cut-off event [2025-03-04 06:58:13,826 INFO L297 olderBase$Statistics]: existing Event has 375 ancestors and is cut-off event [2025-03-04 06:58:13,833 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([897] L1030-3-->L1030: Formula: (and (= |v_threadThread1of1ForFork1_#t~ret5_1| 0) (= (store |v_#pthreadsMutex_112| v_~datas_mutex~0.base_18 (store (select |v_#pthreadsMutex_112| v_~datas_mutex~0.base_18) (+ (* v_threadThread1of1ForFork1_~i~0_13 24) v_~datas_mutex~0.offset_18) 0)) |v_#pthreadsMutex_111|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_112|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_18, ~datas_mutex~0.base=v_~datas_mutex~0.base_18} OutVars{#pthreadsMutex=|v_#pthreadsMutex_111|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_18, threadThread1of1ForFork1_#t~ret5=|v_threadThread1of1ForFork1_#t~ret5_1|, ~datas_mutex~0.base=v_~datas_mutex~0.base_18} AuxVars[] AssignedVars[#pthreadsMutex, threadThread1of1ForFork1_#t~ret5][343], [452#(= |#race~threads_total~0| 0), Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 243#L1045true, 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)), 422#L1030true, 174#ULTIMATE.startFINALtrue, Black: 487#(<= ~threads_total~0 0), Black: 490#(and (= |ULTIMATE.start_main_~i~2#1| 0) (<= ~threads_total~0 0)), Black: 462#true, Black: 497#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 500#true, Black: 466#true, 495#true, 445#true, 472#(= |#race~datas~0| 0), Black: 470#true, 464#(= |#race~datas_mutex~0| 0), 468#(= |#race~tids~0| 0), Black: 476#(= |#race~threads_alive~0| 0)]) [2025-03-04 06:58:13,833 INFO L294 olderBase$Statistics]: this new event has 398 ancestors and is cut-off event [2025-03-04 06:58:13,833 INFO L297 olderBase$Statistics]: existing Event has 377 ancestors and is cut-off event [2025-03-04 06:58:13,833 INFO L297 olderBase$Statistics]: existing Event has 377 ancestors and is cut-off event [2025-03-04 06:58:13,833 INFO L297 olderBase$Statistics]: existing Event has 377 ancestors and is cut-off event [2025-03-04 06:58:13,880 INFO L124 PetriNetUnfolderBase]: 3011/14998 cut-off events. [2025-03-04 06:58:13,880 INFO L125 PetriNetUnfolderBase]: For 1435/1555 co-relation queries the response was YES. [2025-03-04 06:58:13,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23039 conditions, 14998 events. 3011/14998 cut-off events. For 1435/1555 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 154921 event pairs, 1719 based on Foata normal form. 7/13449 useless extension candidates. Maximal degree in co-relation 22876. Up to 3616 conditions per place. [2025-03-04 06:58:13,943 INFO L140 encePairwiseOnDemand]: 442/451 looper letters, 25 selfloop transitions, 4 changer transitions 17/393 dead transitions. [2025-03-04 06:58:13,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 393 transitions, 1079 flow [2025-03-04 06:58:13,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:58:13,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:58:13,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2510 transitions. [2025-03-04 06:58:13,946 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9275683665927569 [2025-03-04 06:58:13,947 INFO L175 Difference]: Start difference. First operand has 373 places, 381 transitions, 968 flow. Second operand 6 states and 2510 transitions. [2025-03-04 06:58:13,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 393 transitions, 1079 flow [2025-03-04 06:58:13,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 393 transitions, 1067 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:58:13,960 INFO L231 Difference]: Finished difference. Result has 378 places, 376 transitions, 943 flow [2025-03-04 06:58:13,960 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=451, PETRI_DIFFERENCE_MINUEND_FLOW=951, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=943, PETRI_PLACES=378, PETRI_TRANSITIONS=376} [2025-03-04 06:58:13,961 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, 3 predicate places. [2025-03-04 06:58:13,961 INFO L471 AbstractCegarLoop]: Abstraction has has 378 places, 376 transitions, 943 flow [2025-03-04 06:58:13,962 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-04 06:58:13,962 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:13,962 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-04 06:58:13,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 06:58:13,962 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-04 06:58:13,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:13,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1148198014, now seen corresponding path program 1 times [2025-03-04 06:58:13,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:13,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060582778] [2025-03-04 06:58:13,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:13,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:13,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-04 06:58:13,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-04 06:58:13,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:13,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:14,543 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-04 06:58:14,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:14,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060582778] [2025-03-04 06:58:14,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060582778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:14,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:14,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:58:14,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629310063] [2025-03-04 06:58:14,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:14,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:58:14,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:14,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:58:14,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:58:14,701 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 451 [2025-03-04 06:58:14,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 376 transitions, 943 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-04 06:58:14,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:14,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 451 [2025-03-04 06:58:14,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:18,301 INFO L124 PetriNetUnfolderBase]: 6922/25387 cut-off events. [2025-03-04 06:58:18,302 INFO L125 PetriNetUnfolderBase]: For 5024/5263 co-relation queries the response was YES. [2025-03-04 06:58:18,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43841 conditions, 25387 events. 6922/25387 cut-off events. For 5024/5263 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 275113 event pairs, 3758 based on Foata normal form. 0/23000 useless extension candidates. Maximal degree in co-relation 43674. Up to 8733 conditions per place. [2025-03-04 06:58:18,428 INFO L140 encePairwiseOnDemand]: 437/451 looper letters, 90 selfloop transitions, 46 changer transitions 0/464 dead transitions. [2025-03-04 06:58:18,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 464 transitions, 1505 flow [2025-03-04 06:58:18,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:58:18,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:58:18,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2480 transitions. [2025-03-04 06:58:18,431 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9164818920916482 [2025-03-04 06:58:18,431 INFO L175 Difference]: Start difference. First operand has 378 places, 376 transitions, 943 flow. Second operand 6 states and 2480 transitions. [2025-03-04 06:58:18,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 464 transitions, 1505 flow [2025-03-04 06:58:18,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 464 transitions, 1477 flow, removed 7 selfloop flow, removed 9 redundant places. [2025-03-04 06:58:18,445 INFO L231 Difference]: Finished difference. Result has 374 places, 421 transitions, 1282 flow [2025-03-04 06:58:18,446 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=451, PETRI_DIFFERENCE_MINUEND_FLOW=915, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1282, PETRI_PLACES=374, PETRI_TRANSITIONS=421} [2025-03-04 06:58:18,446 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -1 predicate places. [2025-03-04 06:58:18,446 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 421 transitions, 1282 flow [2025-03-04 06:58:18,447 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-04 06:58:18,447 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:18,448 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] [2025-03-04 06:58:18,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 06:58:18,448 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting cleanerErr5ASSERT_VIOLATIONDATA_RACE === [cleanerErr10ASSERT_VIOLATIONDATA_RACE, cleanerErr9ASSERT_VIOLATIONDATA_RACE, cleanerErr8ASSERT_VIOLATIONDATA_RACE, cleanerErr7ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-03-04 06:58:18,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:18,448 INFO L85 PathProgramCache]: Analyzing trace with hash 839699195, now seen corresponding path program 1 times [2025-03-04 06:58:18,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:18,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416228861] [2025-03-04 06:58:18,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:18,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:18,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-03-04 06:58:18,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-03-04 06:58:18,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:18,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:18,694 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-04 06:58:18,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:18,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416228861] [2025-03-04 06:58:18,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416228861] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:18,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:18,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 06:58:18,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040735167] [2025-03-04 06:58:18,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:18,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 06:58:18,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:18,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 06:58:18,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 06:58:18,939 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 404 out of 451 [2025-03-04 06:58:18,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 421 transitions, 1282 flow. Second operand has 7 states, 7 states have (on average 406.0) internal successors, (2842), 7 states have internal predecessors, (2842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:58:18,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:18,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 404 of 451 [2025-03-04 06:58:18,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:23,093 INFO L124 PetriNetUnfolderBase]: 7192/30913 cut-off events. [2025-03-04 06:58:23,093 INFO L125 PetriNetUnfolderBase]: For 5037/5654 co-relation queries the response was YES. [2025-03-04 06:58:23,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53629 conditions, 30913 events. 7192/30913 cut-off events. For 5037/5654 co-relation queries the response was YES. Maximal size of possible extension queue 540. Compared 360518 event pairs, 3191 based on Foata normal form. 196/28034 useless extension candidates. Maximal degree in co-relation 53468. Up to 7704 conditions per place. [2025-03-04 06:58:23,309 INFO L140 encePairwiseOnDemand]: 439/451 looper letters, 58 selfloop transitions, 14 changer transitions 10/466 dead transitions. [2025-03-04 06:58:23,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 466 transitions, 1541 flow [2025-03-04 06:58:23,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 06:58:23,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 06:58:23,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4122 transitions. [2025-03-04 06:58:23,316 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9139689578713969 [2025-03-04 06:58:23,316 INFO L175 Difference]: Start difference. First operand has 374 places, 421 transitions, 1282 flow. Second operand 10 states and 4122 transitions. [2025-03-04 06:58:23,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 466 transitions, 1541 flow [2025-03-04 06:58:23,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 466 transitions, 1509 flow, removed 16 selfloop flow, removed 0 redundant places. [2025-03-04 06:58:23,362 INFO L231 Difference]: Finished difference. Result has 387 places, 428 transitions, 1317 flow [2025-03-04 06:58:23,362 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=451, PETRI_DIFFERENCE_MINUEND_FLOW=1245, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=420, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1317, PETRI_PLACES=387, PETRI_TRANSITIONS=428} [2025-03-04 06:58:23,363 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, 12 predicate places. [2025-03-04 06:58:23,363 INFO L471 AbstractCegarLoop]: Abstraction has has 387 places, 428 transitions, 1317 flow [2025-03-04 06:58:23,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 406.0) internal successors, (2842), 7 states have internal predecessors, (2842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:58:23,364 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:23,364 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-04 06:58:23,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 06:58:23,364 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-04 06:58:23,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:23,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1301139917, now seen corresponding path program 1 times [2025-03-04 06:58:23,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:23,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389617044] [2025-03-04 06:58:23,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:23,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:23,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-04 06:58:23,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-04 06:58:23,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:23,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:23,676 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-04 06:58:23,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:23,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389617044] [2025-03-04 06:58:23,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389617044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:23,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:23,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 06:58:23,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406867737] [2025-03-04 06:58:23,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:23,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 06:58:23,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:23,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 06:58:23,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 06:58:24,164 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 399 out of 451 [2025-03-04 06:58:24,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 387 places, 428 transitions, 1317 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-04 06:58:24,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:24,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 399 of 451 [2025-03-04 06:58:24,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:26,220 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][365], [452#(= |#race~threads_total~0| 0), Black: 511#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), 319#L1037true, Black: 513#(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: 512#(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: 514#(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: 462#true, 551#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 523#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base)), Black: 525#(= |cleanerThread1of1ForFork0_#t~mem7| 0), Black: 466#true, Black: 531#(and (= |cleanerThread1of1ForFork0_#t~mem7| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base))), 445#true, Black: 524#(= (select (select |#memory_int| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 472#(= |#race~datas~0| 0), 138#L1061-3true, Black: 470#true, 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), 162#L1029true, 443#true, Black: 486#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 497#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 519#true, 509#true, 464#(= |#race~datas_mutex~0| 0)]) [2025-03-04 06:58:26,220 INFO L294 olderBase$Statistics]: this new event has 296 ancestors and is cut-off event [2025-03-04 06:58:26,220 INFO L297 olderBase$Statistics]: existing Event has 296 ancestors and is cut-off event [2025-03-04 06:58:26,220 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2025-03-04 06:58:26,220 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2025-03-04 06:58:26,254 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([821] L1036-3-->L1036: Formula: (let ((.cse0 (select |v_#pthreadsMutex_40| v_~datas_mutex~0.base_10)) (.cse1 (+ (* v_cleanerThread1of1ForFork0_~i~1_9 24) v_~datas_mutex~0.offset_10))) (and (= |v_#pthreadsMutex_39| (store |v_#pthreadsMutex_40| v_~datas_mutex~0.base_10 (store .cse0 .cse1 1))) (= (select .cse0 .cse1) 0) (= |v_cleanerThread1of1ForFork0_#t~ret6_1| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_40|, 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_39|, 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][390], [452#(= |#race~threads_total~0| 0), Black: 511#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 513#(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: 512#(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: 514#(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|)), 210#L1028-4true, 174#ULTIMATE.startFINALtrue, Black: 462#true, Black: 523#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base)), Black: 525#(= |cleanerThread1of1ForFork0_#t~mem7| 0), Black: 466#true, Black: 531#(and (= |cleanerThread1of1ForFork0_#t~mem7| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base))), Black: 524#(= (select (select |#memory_int| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 445#true, 472#(= |#race~datas~0| 0), Black: 470#true, 468#(= |#race~tids~0| 0), 541#(not (= ~datas~0.base ~tids~0.base)), 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: 495#true, 519#true, 509#true, 464#(= |#race~datas_mutex~0| 0), 207#L1036true]) [2025-03-04 06:58:26,254 INFO L294 olderBase$Statistics]: this new event has 296 ancestors and is cut-off event [2025-03-04 06:58:26,254 INFO L297 olderBase$Statistics]: existing Event has 291 ancestors and is cut-off event [2025-03-04 06:58:26,254 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-03-04 06:58:26,254 INFO L297 olderBase$Statistics]: existing Event has 291 ancestors and is cut-off event [2025-03-04 06:58:26,308 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][365], [452#(= |#race~threads_total~0| 0), Black: 511#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 513#(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: 512#(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: 514#(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|)), 243#L1045true, Black: 462#true, 551#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 523#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base)), Black: 525#(= |cleanerThread1of1ForFork0_#t~mem7| 0), Black: 466#true, Black: 531#(and (= |cleanerThread1of1ForFork0_#t~mem7| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base))), 445#true, Black: 524#(= (select (select |#memory_int| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 472#(= |#race~datas~0| 0), 138#L1061-3true, Black: 470#true, 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), 162#L1029true, 443#true, Black: 486#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 497#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 519#true, 509#true, 464#(= |#race~datas_mutex~0| 0)]) [2025-03-04 06:58:26,308 INFO L294 olderBase$Statistics]: this new event has 301 ancestors and is cut-off event [2025-03-04 06:58:26,308 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-03-04 06:58:26,308 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-03-04 06:58:26,308 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-03-04 06:58:28,727 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([906] threadEXIT-->L1038: Formula: (= v_threadThread1of1ForFork1_thidvar0_6 |v_cleanerThread1of1ForFork0_#t~mem8_8|) InVars {threadThread1of1ForFork1_thidvar0=v_threadThread1of1ForFork1_thidvar0_6, cleanerThread1of1ForFork0_#t~mem8=|v_cleanerThread1of1ForFork0_#t~mem8_8|} OutVars{threadThread1of1ForFork1_thidvar0=v_threadThread1of1ForFork1_thidvar0_6, cleanerThread1of1ForFork0_#t~mem8=|v_cleanerThread1of1ForFork0_#t~mem8_8|} AuxVars[] AssignedVars[][463], [452#(= |#race~threads_total~0| 0), Black: 511#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 513#(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: 512#(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: 514#(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|)), 174#ULTIMATE.startFINALtrue, Black: 462#true, 271#L1038true, Black: 523#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base)), Black: 466#true, Black: 525#(= |cleanerThread1of1ForFork0_#t~mem7| 0), Black: 531#(and (= |cleanerThread1of1ForFork0_#t~mem7| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base))), Black: 524#(= (select (select |#memory_int| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 445#true, 472#(= |#race~datas~0| 0), Black: 470#true, 468#(= |#race~tids~0| 0), 541#(not (= ~datas~0.base ~tids~0.base)), Black: 474#true, 442#true, Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 486#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 495#true, 519#true, 509#true, 464#(= |#race~datas_mutex~0| 0)]) [2025-03-04 06:58:28,727 INFO L294 olderBase$Statistics]: this new event has 407 ancestors and is cut-off event [2025-03-04 06:58:28,727 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is cut-off event [2025-03-04 06:58:28,727 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is cut-off event [2025-03-04 06:58:28,727 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is cut-off event [2025-03-04 06:58:28,737 INFO L124 PetriNetUnfolderBase]: 8449/33404 cut-off events. [2025-03-04 06:58:28,737 INFO L125 PetriNetUnfolderBase]: For 15697/17388 co-relation queries the response was YES. [2025-03-04 06:58:28,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66102 conditions, 33404 events. 8449/33404 cut-off events. For 15697/17388 co-relation queries the response was YES. Maximal size of possible extension queue 591. Compared 384596 event pairs, 2672 based on Foata normal form. 66/30547 useless extension candidates. Maximal degree in co-relation 65935. Up to 6265 conditions per place. [2025-03-04 06:58:28,998 INFO L140 encePairwiseOnDemand]: 438/451 looper letters, 95 selfloop transitions, 48 changer transitions 0/494 dead transitions. [2025-03-04 06:58:28,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 494 transitions, 1911 flow [2025-03-04 06:58:28,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 06:58:28,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 06:58:29,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 4477 transitions. [2025-03-04 06:58:29,005 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9024390243902439 [2025-03-04 06:58:29,005 INFO L175 Difference]: Start difference. First operand has 387 places, 428 transitions, 1317 flow. Second operand 11 states and 4477 transitions. [2025-03-04 06:58:29,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 494 transitions, 1911 flow [2025-03-04 06:58:29,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 393 places, 494 transitions, 1903 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 06:58:29,032 INFO L231 Difference]: Finished difference. Result has 397 places, 451 transitions, 1678 flow [2025-03-04 06:58:29,032 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=451, PETRI_DIFFERENCE_MINUEND_FLOW=1309, PETRI_DIFFERENCE_MINUEND_PLACES=383, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=428, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=389, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1678, PETRI_PLACES=397, PETRI_TRANSITIONS=451} [2025-03-04 06:58:29,032 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, 22 predicate places. [2025-03-04 06:58:29,033 INFO L471 AbstractCegarLoop]: Abstraction has has 397 places, 451 transitions, 1678 flow [2025-03-04 06:58:29,034 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-04 06:58:29,034 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:29,034 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-04 06:58:29,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 06:58:29,034 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-04 06:58:29,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:29,035 INFO L85 PathProgramCache]: Analyzing trace with hash -175887658, now seen corresponding path program 1 times [2025-03-04 06:58:29,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:29,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967716701] [2025-03-04 06:58:29,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:29,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:29,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-04 06:58:29,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-04 06:58:29,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:29,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:29,742 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-04 06:58:29,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:29,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967716701] [2025-03-04 06:58:29,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967716701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:29,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:29,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 06:58:29,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744417168] [2025-03-04 06:58:29,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:29,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 06:58:29,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:29,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 06:58:29,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-04 06:58:30,289 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 451 [2025-03-04 06:58:30,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 451 transitions, 1678 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-04 06:58:30,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:30,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 451 [2025-03-04 06:58:30,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:36,331 INFO L124 PetriNetUnfolderBase]: 11100/40058 cut-off events. [2025-03-04 06:58:36,331 INFO L125 PetriNetUnfolderBase]: For 45395/48616 co-relation queries the response was YES. [2025-03-04 06:58:36,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89050 conditions, 40058 events. 11100/40058 cut-off events. For 45395/48616 co-relation queries the response was YES. Maximal size of possible extension queue 641. Compared 466960 event pairs, 3864 based on Foata normal form. 569/37424 useless extension candidates. Maximal degree in co-relation 88878. Up to 7853 conditions per place. [2025-03-04 06:58:36,635 INFO L140 encePairwiseOnDemand]: 433/451 looper letters, 164 selfloop transitions, 57 changer transitions 0/554 dead transitions. [2025-03-04 06:58:36,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 554 transitions, 2679 flow [2025-03-04 06:58:36,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 06:58:36,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 06:58:36,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 5168 transitions. [2025-03-04 06:58:36,771 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8814600034112229 [2025-03-04 06:58:36,771 INFO L175 Difference]: Start difference. First operand has 397 places, 451 transitions, 1678 flow. Second operand 13 states and 5168 transitions. [2025-03-04 06:58:36,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 554 transitions, 2679 flow [2025-03-04 06:58:36,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 403 places, 554 transitions, 2646 flow, removed 11 selfloop flow, removed 6 redundant places. [2025-03-04 06:58:36,897 INFO L231 Difference]: Finished difference. Result has 407 places, 476 transitions, 2006 flow [2025-03-04 06:58:36,897 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=451, PETRI_DIFFERENCE_MINUEND_FLOW=1659, PETRI_DIFFERENCE_MINUEND_PLACES=391, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=451, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2006, PETRI_PLACES=407, PETRI_TRANSITIONS=476} [2025-03-04 06:58:36,897 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, 32 predicate places. [2025-03-04 06:58:36,897 INFO L471 AbstractCegarLoop]: Abstraction has has 407 places, 476 transitions, 2006 flow [2025-03-04 06:58:36,898 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-04 06:58:36,898 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:36,899 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-04 06:58:36,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 06:58:36,899 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-04 06:58:36,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:36,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1733217290, now seen corresponding path program 1 times [2025-03-04 06:58:36,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:36,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348518452] [2025-03-04 06:58:36,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:36,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:36,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-04 06:58:36,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-04 06:58:36,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:36,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:36,975 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-04 06:58:36,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:36,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348518452] [2025-03-04 06:58:36,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348518452] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:36,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:36,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:58:36,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055983299] [2025-03-04 06:58:36,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:36,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:58:36,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:36,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:58:36,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:58:37,002 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 410 out of 451 [2025-03-04 06:58:37,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 407 places, 476 transitions, 2006 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-04 06:58:37,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:37,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 410 of 451 [2025-03-04 06:58:37,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:40,390 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][297], [452#(= |#race~threads_total~0| 0), Black: 511#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 513#(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: 512#(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: 514#(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: 582#(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: 584#(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: 578#(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: 580#(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: 462#true, 106#L1061true, 551#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 523#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base)), Black: 466#true, Black: 525#(= |cleanerThread1of1ForFork0_#t~mem7| 0), Black: 531#(and (= |cleanerThread1of1ForFork0_#t~mem7| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base))), Black: 524#(= (select (select |#memory_int| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 445#true, 472#(= |#race~datas~0| 0), Black: 470#true, 468#(= |#race~tids~0| 0), 589#true, Black: 476#(= |#race~threads_alive~0| 0), Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 162#L1029true, 29#L1035-2true, 443#true, Black: 486#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 553#(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: 541#(not (= ~datas~0.base ~tids~0.base)), Black: 542#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base))), Black: 497#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 519#true, 509#true, 576#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 464#(= |#race~datas_mutex~0| 0)]) [2025-03-04 06:58:40,391 INFO L294 olderBase$Statistics]: this new event has 335 ancestors and is cut-off event [2025-03-04 06:58:40,391 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-03-04 06:58:40,391 INFO L297 olderBase$Statistics]: existing Event has 335 ancestors and is cut-off event [2025-03-04 06:58:40,391 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-03-04 06:58:40,643 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([897] L1030-3-->L1030: Formula: (and (= |v_threadThread1of1ForFork1_#t~ret5_1| 0) (= (store |v_#pthreadsMutex_112| v_~datas_mutex~0.base_18 (store (select |v_#pthreadsMutex_112| v_~datas_mutex~0.base_18) (+ (* v_threadThread1of1ForFork1_~i~0_13 24) v_~datas_mutex~0.offset_18) 0)) |v_#pthreadsMutex_111|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_112|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_18, ~datas_mutex~0.base=v_~datas_mutex~0.base_18} OutVars{#pthreadsMutex=|v_#pthreadsMutex_111|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_18, threadThread1of1ForFork1_#t~ret5=|v_threadThread1of1ForFork1_#t~ret5_1|, ~datas_mutex~0.base=v_~datas_mutex~0.base_18} AuxVars[] AssignedVars[#pthreadsMutex, threadThread1of1ForFork1_#t~ret5][345], [452#(= |#race~threads_total~0| 0), Black: 511#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 513#(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: 512#(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: 514#(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|)), 243#L1045true, Black: 582#(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: 584#(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: 578#(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: 580#(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))), 591#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet32#1|), Black: 462#true, 551#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 523#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base)), Black: 525#(= |cleanerThread1of1ForFork0_#t~mem7| 0), Black: 466#true, Black: 531#(and (= |cleanerThread1of1ForFork0_#t~mem7| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base))), Black: 524#(= (select (select |#memory_int| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 445#true, 472#(= |#race~datas~0| 0), Black: 470#true, 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), 77#L1063-1true, 443#true, Black: 486#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 553#(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: 541#(not (= ~datas~0.base ~tids~0.base)), 422#L1030true, Black: 542#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base))), Black: 497#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 519#true, 576#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 509#true, 464#(= |#race~datas_mutex~0| 0)]) [2025-03-04 06:58:40,643 INFO L294 olderBase$Statistics]: this new event has 346 ancestors and is cut-off event [2025-03-04 06:58:40,643 INFO L297 olderBase$Statistics]: existing Event has 263 ancestors and is cut-off event [2025-03-04 06:58:40,643 INFO L297 olderBase$Statistics]: existing Event has 346 ancestors and is cut-off event [2025-03-04 06:58:40,643 INFO L297 olderBase$Statistics]: existing Event has 263 ancestors and is cut-off event [2025-03-04 06:58:40,680 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([897] L1030-3-->L1030: Formula: (and (= |v_threadThread1of1ForFork1_#t~ret5_1| 0) (= (store |v_#pthreadsMutex_112| v_~datas_mutex~0.base_18 (store (select |v_#pthreadsMutex_112| v_~datas_mutex~0.base_18) (+ (* v_threadThread1of1ForFork1_~i~0_13 24) v_~datas_mutex~0.offset_18) 0)) |v_#pthreadsMutex_111|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_112|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_18, ~datas_mutex~0.base=v_~datas_mutex~0.base_18} OutVars{#pthreadsMutex=|v_#pthreadsMutex_111|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_18, threadThread1of1ForFork1_#t~ret5=|v_threadThread1of1ForFork1_#t~ret5_1|, ~datas_mutex~0.base=v_~datas_mutex~0.base_18} AuxVars[] AssignedVars[#pthreadsMutex, threadThread1of1ForFork1_#t~ret5][345], [452#(= |#race~threads_total~0| 0), Black: 511#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 513#(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: 512#(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: 514#(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|)), 243#L1045true, Black: 582#(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: 584#(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: 578#(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: 580#(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))), 591#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet32#1|), Black: 462#true, 551#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 523#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base)), Black: 466#true, Black: 525#(= |cleanerThread1of1ForFork0_#t~mem7| 0), Black: 531#(and (= |cleanerThread1of1ForFork0_#t~mem7| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base))), Black: 524#(= (select (select |#memory_int| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 445#true, 472#(= |#race~datas~0| 0), Black: 470#true, 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: 553#(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: 486#(= |ULTIMATE.start_main_~i~2#1| 0), 422#L1030true, Black: 541#(not (= ~datas~0.base ~tids~0.base)), Black: 542#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base))), Black: 497#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 519#true, 509#true, 576#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 464#(= |#race~datas_mutex~0| 0), 367#L1063-2true]) [2025-03-04 06:58:40,680 INFO L294 olderBase$Statistics]: this new event has 347 ancestors and is cut-off event [2025-03-04 06:58:40,680 INFO L297 olderBase$Statistics]: existing Event has 347 ancestors and is cut-off event [2025-03-04 06:58:40,680 INFO L297 olderBase$Statistics]: existing Event has 264 ancestors and is cut-off event [2025-03-04 06:58:40,680 INFO L297 olderBase$Statistics]: existing Event has 264 ancestors and is cut-off event [2025-03-04 06:58:40,753 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([897] L1030-3-->L1030: Formula: (and (= |v_threadThread1of1ForFork1_#t~ret5_1| 0) (= (store |v_#pthreadsMutex_112| v_~datas_mutex~0.base_18 (store (select |v_#pthreadsMutex_112| v_~datas_mutex~0.base_18) (+ (* v_threadThread1of1ForFork1_~i~0_13 24) v_~datas_mutex~0.offset_18) 0)) |v_#pthreadsMutex_111|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_112|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_18, ~datas_mutex~0.base=v_~datas_mutex~0.base_18} OutVars{#pthreadsMutex=|v_#pthreadsMutex_111|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_18, threadThread1of1ForFork1_#t~ret5=|v_threadThread1of1ForFork1_#t~ret5_1|, ~datas_mutex~0.base=v_~datas_mutex~0.base_18} AuxVars[] AssignedVars[#pthreadsMutex, threadThread1of1ForFork1_#t~ret5][332], [452#(= |#race~threads_total~0| 0), Black: 511#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 513#(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|)), 161#L1065-3true, Black: 512#(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: 514#(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|)), 243#L1045true, Black: 582#(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: 584#(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: 578#(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: 580#(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: 462#true, 551#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 523#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base)), Black: 466#true, Black: 525#(= |cleanerThread1of1ForFork0_#t~mem7| 0), Black: 531#(and (= |cleanerThread1of1ForFork0_#t~mem7| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base))), Black: 524#(= (select (select |#memory_int| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 445#true, 472#(= |#race~datas~0| 0), Black: 470#true, 468#(= |#race~tids~0| 0), 589#true, 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: 553#(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: 486#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 541#(not (= ~datas~0.base ~tids~0.base)), 422#L1030true, Black: 542#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base))), Black: 497#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 519#true, 509#true, 576#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 464#(= |#race~datas_mutex~0| 0)]) [2025-03-04 06:58:40,754 INFO L294 olderBase$Statistics]: this new event has 349 ancestors and is cut-off event [2025-03-04 06:58:40,754 INFO L297 olderBase$Statistics]: existing Event has 266 ancestors and is cut-off event [2025-03-04 06:58:40,754 INFO L297 olderBase$Statistics]: existing Event has 349 ancestors and is cut-off event [2025-03-04 06:58:40,754 INFO L297 olderBase$Statistics]: existing Event has 266 ancestors and is cut-off event [2025-03-04 06:58:40,791 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([897] L1030-3-->L1030: Formula: (and (= |v_threadThread1of1ForFork1_#t~ret5_1| 0) (= (store |v_#pthreadsMutex_112| v_~datas_mutex~0.base_18 (store (select |v_#pthreadsMutex_112| v_~datas_mutex~0.base_18) (+ (* v_threadThread1of1ForFork1_~i~0_13 24) v_~datas_mutex~0.offset_18) 0)) |v_#pthreadsMutex_111|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_112|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_18, ~datas_mutex~0.base=v_~datas_mutex~0.base_18} OutVars{#pthreadsMutex=|v_#pthreadsMutex_111|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_18, threadThread1of1ForFork1_#t~ret5=|v_threadThread1of1ForFork1_#t~ret5_1|, ~datas_mutex~0.base=v_~datas_mutex~0.base_18} AuxVars[] AssignedVars[#pthreadsMutex, threadThread1of1ForFork1_#t~ret5][332], [452#(= |#race~threads_total~0| 0), Black: 511#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 513#(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: 512#(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: 514#(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|)), 243#L1045true, Black: 582#(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: 584#(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: 578#(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: 580#(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: 462#true, 551#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 523#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base)), Black: 466#true, Black: 525#(= |cleanerThread1of1ForFork0_#t~mem7| 0), Black: 531#(and (= |cleanerThread1of1ForFork0_#t~mem7| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base))), Black: 524#(= (select (select |#memory_int| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 445#true, 472#(= |#race~datas~0| 0), 21#L1065true, Black: 470#true, 468#(= |#race~tids~0| 0), 589#true, 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: 553#(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: 486#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 541#(not (= ~datas~0.base ~tids~0.base)), 422#L1030true, Black: 542#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base))), Black: 497#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 519#true, 509#true, 576#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 464#(= |#race~datas_mutex~0| 0)]) [2025-03-04 06:58:40,792 INFO L294 olderBase$Statistics]: this new event has 350 ancestors and is cut-off event [2025-03-04 06:58:40,792 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2025-03-04 06:58:40,792 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2025-03-04 06:58:40,792 INFO L297 olderBase$Statistics]: existing Event has 350 ancestors and is cut-off event [2025-03-04 06:58:41,114 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([897] L1030-3-->L1030: Formula: (and (= |v_threadThread1of1ForFork1_#t~ret5_1| 0) (= (store |v_#pthreadsMutex_112| v_~datas_mutex~0.base_18 (store (select |v_#pthreadsMutex_112| v_~datas_mutex~0.base_18) (+ (* v_threadThread1of1ForFork1_~i~0_13 24) v_~datas_mutex~0.offset_18) 0)) |v_#pthreadsMutex_111|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_112|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_18, ~datas_mutex~0.base=v_~datas_mutex~0.base_18} OutVars{#pthreadsMutex=|v_#pthreadsMutex_111|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_18, threadThread1of1ForFork1_#t~ret5=|v_threadThread1of1ForFork1_#t~ret5_1|, ~datas_mutex~0.base=v_~datas_mutex~0.base_18} AuxVars[] AssignedVars[#pthreadsMutex, threadThread1of1ForFork1_#t~ret5][332], [452#(= |#race~threads_total~0| 0), Black: 511#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 513#(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: 512#(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: 514#(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|)), 243#L1045true, Black: 582#(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: 584#(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: 578#(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: 580#(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: 462#true, 551#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 523#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base)), Black: 466#true, Black: 525#(= |cleanerThread1of1ForFork0_#t~mem7| 0), Black: 531#(and (= |cleanerThread1of1ForFork0_#t~mem7| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base))), Black: 524#(= (select (select |#memory_int| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 445#true, 472#(= |#race~datas~0| 0), Black: 470#true, 468#(= |#race~tids~0| 0), 589#true, 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: 553#(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: 486#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 541#(not (= ~datas~0.base ~tids~0.base)), 422#L1030true, Black: 542#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base))), Black: 497#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 519#true, 509#true, 576#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 464#(= |#race~datas_mutex~0| 0), 212#L1067true]) [2025-03-04 06:58:41,115 INFO L294 olderBase$Statistics]: this new event has 359 ancestors and is cut-off event [2025-03-04 06:58:41,115 INFO L297 olderBase$Statistics]: existing Event has 276 ancestors and is cut-off event [2025-03-04 06:58:41,115 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2025-03-04 06:58:41,115 INFO L297 olderBase$Statistics]: existing Event has 276 ancestors and is cut-off event [2025-03-04 06:58:41,183 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([897] L1030-3-->L1030: Formula: (and (= |v_threadThread1of1ForFork1_#t~ret5_1| 0) (= (store |v_#pthreadsMutex_112| v_~datas_mutex~0.base_18 (store (select |v_#pthreadsMutex_112| v_~datas_mutex~0.base_18) (+ (* v_threadThread1of1ForFork1_~i~0_13 24) v_~datas_mutex~0.offset_18) 0)) |v_#pthreadsMutex_111|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_112|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_18, ~datas_mutex~0.base=v_~datas_mutex~0.base_18} OutVars{#pthreadsMutex=|v_#pthreadsMutex_111|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_18, threadThread1of1ForFork1_#t~ret5=|v_threadThread1of1ForFork1_#t~ret5_1|, ~datas_mutex~0.base=v_~datas_mutex~0.base_18} AuxVars[] AssignedVars[#pthreadsMutex, threadThread1of1ForFork1_#t~ret5][332], [452#(= |#race~threads_total~0| 0), Black: 511#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 513#(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: 512#(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: 514#(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|)), 243#L1045true, Black: 582#(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: 584#(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: 578#(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: 580#(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: 462#true, 551#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 523#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base)), Black: 466#true, Black: 525#(= |cleanerThread1of1ForFork0_#t~mem7| 0), Black: 531#(and (= |cleanerThread1of1ForFork0_#t~mem7| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base))), Black: 524#(= (select (select |#memory_int| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 445#true, 472#(= |#race~datas~0| 0), Black: 470#true, 468#(= |#race~tids~0| 0), 589#true, Black: 474#true, Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 443#true, Black: 553#(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: 486#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 541#(not (= ~datas~0.base ~tids~0.base)), 422#L1030true, Black: 542#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base))), Black: 497#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 519#true, 509#true, 576#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 464#(= |#race~datas_mutex~0| 0), 163#L1068-2true]) [2025-03-04 06:58:41,183 INFO L294 olderBase$Statistics]: this new event has 361 ancestors and is cut-off event [2025-03-04 06:58:41,183 INFO L297 olderBase$Statistics]: existing Event has 278 ancestors and is cut-off event [2025-03-04 06:58:41,183 INFO L297 olderBase$Statistics]: existing Event has 278 ancestors and is cut-off event [2025-03-04 06:58:41,183 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2025-03-04 06:58:41,273 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([897] L1030-3-->L1030: Formula: (and (= |v_threadThread1of1ForFork1_#t~ret5_1| 0) (= (store |v_#pthreadsMutex_112| v_~datas_mutex~0.base_18 (store (select |v_#pthreadsMutex_112| v_~datas_mutex~0.base_18) (+ (* v_threadThread1of1ForFork1_~i~0_13 24) v_~datas_mutex~0.offset_18) 0)) |v_#pthreadsMutex_111|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_112|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_18, ~datas_mutex~0.base=v_~datas_mutex~0.base_18} OutVars{#pthreadsMutex=|v_#pthreadsMutex_111|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_18, threadThread1of1ForFork1_#t~ret5=|v_threadThread1of1ForFork1_#t~ret5_1|, ~datas_mutex~0.base=v_~datas_mutex~0.base_18} AuxVars[] AssignedVars[#pthreadsMutex, threadThread1of1ForFork1_#t~ret5][332], [452#(= |#race~threads_total~0| 0), Black: 511#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 513#(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: 512#(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: 514#(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|)), 243#L1045true, Black: 582#(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: 584#(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: 578#(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))), 275#L1069-2true, Black: 580#(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: 462#true, 551#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 523#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base)), Black: 466#true, Black: 525#(= |cleanerThread1of1ForFork0_#t~mem7| 0), Black: 531#(and (= |cleanerThread1of1ForFork0_#t~mem7| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base))), Black: 524#(= (select (select |#memory_int| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 445#true, 472#(= |#race~datas~0| 0), Black: 470#true, 468#(= |#race~tids~0| 0), 589#true, Black: 474#true, Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 443#true, Black: 553#(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: 486#(= |ULTIMATE.start_main_~i~2#1| 0), 422#L1030true, Black: 541#(not (= ~datas~0.base ~tids~0.base)), Black: 542#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base))), Black: 497#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 519#true, 509#true, 576#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 464#(= |#race~datas_mutex~0| 0)]) [2025-03-04 06:58:41,273 INFO L294 olderBase$Statistics]: this new event has 364 ancestors and is cut-off event [2025-03-04 06:58:41,273 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-03-04 06:58:41,273 INFO L297 olderBase$Statistics]: existing Event has 364 ancestors and is cut-off event [2025-03-04 06:58:41,273 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-03-04 06:58:41,284 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([897] L1030-3-->L1030: Formula: (and (= |v_threadThread1of1ForFork1_#t~ret5_1| 0) (= (store |v_#pthreadsMutex_112| v_~datas_mutex~0.base_18 (store (select |v_#pthreadsMutex_112| v_~datas_mutex~0.base_18) (+ (* v_threadThread1of1ForFork1_~i~0_13 24) v_~datas_mutex~0.offset_18) 0)) |v_#pthreadsMutex_111|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_112|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_18, ~datas_mutex~0.base=v_~datas_mutex~0.base_18} OutVars{#pthreadsMutex=|v_#pthreadsMutex_111|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_18, threadThread1of1ForFork1_#t~ret5=|v_threadThread1of1ForFork1_#t~ret5_1|, ~datas_mutex~0.base=v_~datas_mutex~0.base_18} AuxVars[] AssignedVars[#pthreadsMutex, threadThread1of1ForFork1_#t~ret5][332], [452#(= |#race~threads_total~0| 0), Black: 511#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 513#(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: 512#(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: 514#(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|)), 243#L1045true, Black: 582#(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|)), 276#L1070true, Black: 584#(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: 578#(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: 580#(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: 462#true, 551#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 523#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base)), Black: 466#true, Black: 525#(= |cleanerThread1of1ForFork0_#t~mem7| 0), Black: 531#(and (= |cleanerThread1of1ForFork0_#t~mem7| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base))), Black: 524#(= (select (select |#memory_int| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 445#true, 472#(= |#race~datas~0| 0), Black: 470#true, 468#(= |#race~tids~0| 0), Black: 474#true, 589#true, Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 443#true, Black: 553#(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: 486#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 541#(not (= ~datas~0.base ~tids~0.base)), 422#L1030true, Black: 542#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base))), Black: 497#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 519#true, 509#true, 576#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 464#(= |#race~datas_mutex~0| 0)]) [2025-03-04 06:58:41,285 INFO L294 olderBase$Statistics]: this new event has 364 ancestors and is cut-off event [2025-03-04 06:58:41,285 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-03-04 06:58:41,285 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-03-04 06:58:41,285 INFO L297 olderBase$Statistics]: existing Event has 364 ancestors and is cut-off event [2025-03-04 06:58:41,302 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([430] L1061-8-->L1061-7: Formula: (= (store |v_#race_32| v_~tids~0.base_14 (store (select |v_#race_32| v_~tids~0.base_14) (+ (* |v_ULTIMATE.start_main_~i~3#1_10| 4) v_~tids~0.offset_14) |v_ULTIMATE.start_main_#t~nondet28#1_8|)) |v_#race_31|) InVars {#race=|v_#race_32|, ~tids~0.offset=v_~tids~0.offset_14, ~tids~0.base=v_~tids~0.base_14, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_10|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_8|} OutVars{#race=|v_#race_31|, ~tids~0.offset=v_~tids~0.offset_14, ~tids~0.base=v_~tids~0.base_14, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_10|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_8|} AuxVars[] AssignedVars[#race][236], [452#(= |#race~threads_total~0| 0), Black: 513#(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: 512#(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: 514#(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: 582#(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: 584#(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: 580#(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: 462#true, 551#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 523#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base)), Black: 525#(= |cleanerThread1of1ForFork0_#t~mem7| 0), Black: 466#true, Black: 531#(and (= |cleanerThread1of1ForFork0_#t~mem7| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base))), 398#L1061-7true, Black: 524#(= (select (select |#memory_int| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 445#true, 472#(= |#race~datas~0| 0), Black: 470#true, 468#(= |#race~tids~0| 0), 578#(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))), 589#true, Black: 476#(= |#race~threads_alive~0| 0), 511#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 162#L1029true, 29#L1035-2true, 443#true, Black: 553#(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: 486#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 541#(not (= ~datas~0.base ~tids~0.base)), Black: 542#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base))), Black: 497#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 519#true, 464#(= |#race~datas_mutex~0| 0)]) [2025-03-04 06:58:41,302 INFO L294 olderBase$Statistics]: this new event has 362 ancestors and is cut-off event [2025-03-04 06:58:41,302 INFO L297 olderBase$Statistics]: existing Event has 279 ancestors and is cut-off event [2025-03-04 06:58:41,302 INFO L297 olderBase$Statistics]: existing Event has 362 ancestors and is cut-off event [2025-03-04 06:58:41,302 INFO L297 olderBase$Statistics]: existing Event has 279 ancestors and is cut-off event [2025-03-04 06:58:41,303 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([897] L1030-3-->L1030: Formula: (and (= |v_threadThread1of1ForFork1_#t~ret5_1| 0) (= (store |v_#pthreadsMutex_112| v_~datas_mutex~0.base_18 (store (select |v_#pthreadsMutex_112| v_~datas_mutex~0.base_18) (+ (* v_threadThread1of1ForFork1_~i~0_13 24) v_~datas_mutex~0.offset_18) 0)) |v_#pthreadsMutex_111|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_112|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_18, ~datas_mutex~0.base=v_~datas_mutex~0.base_18} OutVars{#pthreadsMutex=|v_#pthreadsMutex_111|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_18, threadThread1of1ForFork1_#t~ret5=|v_threadThread1of1ForFork1_#t~ret5_1|, ~datas_mutex~0.base=v_~datas_mutex~0.base_18} AuxVars[] AssignedVars[#pthreadsMutex, threadThread1of1ForFork1_#t~ret5][332], [452#(= |#race~threads_total~0| 0), Black: 511#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 513#(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: 512#(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: 514#(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|)), 243#L1045true, Black: 582#(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: 584#(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: 578#(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: 580#(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: 462#true, 551#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 523#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base)), Black: 466#true, Black: 525#(= |cleanerThread1of1ForFork0_#t~mem7| 0), Black: 531#(and (= |cleanerThread1of1ForFork0_#t~mem7| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base))), Black: 524#(= (select (select |#memory_int| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 445#true, 472#(= |#race~datas~0| 0), Black: 470#true, 468#(= |#race~tids~0| 0), Black: 474#true, 589#true, Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 443#true, Black: 553#(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: 486#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 541#(not (= ~datas~0.base ~tids~0.base)), 422#L1030true, Black: 542#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base))), 182#L1068true, Black: 497#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 519#true, 509#true, 576#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 464#(= |#race~datas_mutex~0| 0)]) [2025-03-04 06:58:41,303 INFO L294 olderBase$Statistics]: this new event has 365 ancestors and is cut-off event [2025-03-04 06:58:41,303 INFO L297 olderBase$Statistics]: existing Event has 365 ancestors and is cut-off event [2025-03-04 06:58:41,303 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-03-04 06:58:41,303 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-03-04 06:58:41,332 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([897] L1030-3-->L1030: Formula: (and (= |v_threadThread1of1ForFork1_#t~ret5_1| 0) (= (store |v_#pthreadsMutex_112| v_~datas_mutex~0.base_18 (store (select |v_#pthreadsMutex_112| v_~datas_mutex~0.base_18) (+ (* v_threadThread1of1ForFork1_~i~0_13 24) v_~datas_mutex~0.offset_18) 0)) |v_#pthreadsMutex_111|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_112|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_18, ~datas_mutex~0.base=v_~datas_mutex~0.base_18} OutVars{#pthreadsMutex=|v_#pthreadsMutex_111|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_18, threadThread1of1ForFork1_#t~ret5=|v_threadThread1of1ForFork1_#t~ret5_1|, ~datas_mutex~0.base=v_~datas_mutex~0.base_18} AuxVars[] AssignedVars[#pthreadsMutex, threadThread1of1ForFork1_#t~ret5][345], [452#(= |#race~threads_total~0| 0), Black: 511#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 513#(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: 512#(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: 514#(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|)), 243#L1045true, Black: 582#(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: 584#(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: 578#(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: 580#(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))), 591#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet32#1|), Black: 462#true, 551#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 523#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base)), Black: 466#true, Black: 525#(= |cleanerThread1of1ForFork0_#t~mem7| 0), Black: 531#(and (= |cleanerThread1of1ForFork0_#t~mem7| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base))), Black: 524#(= (select (select |#memory_int| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 445#true, 472#(= |#race~datas~0| 0), Black: 470#true, 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: 553#(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: 486#(= |ULTIMATE.start_main_~i~2#1| 0), 422#L1030true, Black: 541#(not (= ~datas~0.base ~tids~0.base)), Black: 542#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base))), Black: 497#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 519#true, 509#true, 576#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 464#(= |#race~datas_mutex~0| 0), 367#L1063-2true]) [2025-03-04 06:58:41,332 INFO L294 olderBase$Statistics]: this new event has 368 ancestors and is cut-off event [2025-03-04 06:58:41,332 INFO L297 olderBase$Statistics]: existing Event has 347 ancestors and is cut-off event [2025-03-04 06:58:41,332 INFO L297 olderBase$Statistics]: existing Event has 264 ancestors and is cut-off event [2025-03-04 06:58:41,332 INFO L297 olderBase$Statistics]: existing Event has 347 ancestors and is cut-off event [2025-03-04 06:58:41,332 INFO L297 olderBase$Statistics]: existing Event has 264 ancestors and is cut-off event [2025-03-04 06:58:41,332 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([897] L1030-3-->L1030: Formula: (and (= |v_threadThread1of1ForFork1_#t~ret5_1| 0) (= (store |v_#pthreadsMutex_112| v_~datas_mutex~0.base_18 (store (select |v_#pthreadsMutex_112| v_~datas_mutex~0.base_18) (+ (* v_threadThread1of1ForFork1_~i~0_13 24) v_~datas_mutex~0.offset_18) 0)) |v_#pthreadsMutex_111|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_112|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_18, ~datas_mutex~0.base=v_~datas_mutex~0.base_18} OutVars{#pthreadsMutex=|v_#pthreadsMutex_111|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_18, threadThread1of1ForFork1_#t~ret5=|v_threadThread1of1ForFork1_#t~ret5_1|, ~datas_mutex~0.base=v_~datas_mutex~0.base_18} AuxVars[] AssignedVars[#pthreadsMutex, threadThread1of1ForFork1_#t~ret5][345], [452#(= |#race~threads_total~0| 0), Black: 511#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 513#(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: 512#(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: 514#(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|)), 243#L1045true, Black: 582#(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: 584#(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: 578#(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: 580#(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))), 591#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet32#1|), Black: 462#true, 551#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 523#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base)), Black: 466#true, Black: 525#(= |cleanerThread1of1ForFork0_#t~mem7| 0), Black: 531#(and (= |cleanerThread1of1ForFork0_#t~mem7| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base))), Black: 524#(= (select (select |#memory_int| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 445#true, 472#(= |#race~datas~0| 0), Black: 470#true, 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), 77#L1063-1true, 443#true, Black: 553#(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: 486#(= |ULTIMATE.start_main_~i~2#1| 0), 422#L1030true, Black: 541#(not (= ~datas~0.base ~tids~0.base)), Black: 542#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base))), Black: 497#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 519#true, 509#true, 576#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 464#(= |#race~datas_mutex~0| 0)]) [2025-03-04 06:58:41,332 INFO L294 olderBase$Statistics]: this new event has 367 ancestors and is cut-off event [2025-03-04 06:58:41,332 INFO L297 olderBase$Statistics]: existing Event has 263 ancestors and is cut-off event [2025-03-04 06:58:41,332 INFO L297 olderBase$Statistics]: existing Event has 346 ancestors and is cut-off event [2025-03-04 06:58:41,332 INFO L297 olderBase$Statistics]: existing Event has 346 ancestors and is cut-off event [2025-03-04 06:58:41,332 INFO L297 olderBase$Statistics]: existing Event has 263 ancestors and is cut-off event [2025-03-04 06:58:41,423 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([897] L1030-3-->L1030: Formula: (and (= |v_threadThread1of1ForFork1_#t~ret5_1| 0) (= (store |v_#pthreadsMutex_112| v_~datas_mutex~0.base_18 (store (select |v_#pthreadsMutex_112| v_~datas_mutex~0.base_18) (+ (* v_threadThread1of1ForFork1_~i~0_13 24) v_~datas_mutex~0.offset_18) 0)) |v_#pthreadsMutex_111|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_112|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_18, ~datas_mutex~0.base=v_~datas_mutex~0.base_18} OutVars{#pthreadsMutex=|v_#pthreadsMutex_111|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_18, threadThread1of1ForFork1_#t~ret5=|v_threadThread1of1ForFork1_#t~ret5_1|, ~datas_mutex~0.base=v_~datas_mutex~0.base_18} AuxVars[] AssignedVars[#pthreadsMutex, threadThread1of1ForFork1_#t~ret5][332], [452#(= |#race~threads_total~0| 0), Black: 511#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 513#(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|)), 161#L1065-3true, Black: 512#(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: 514#(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|)), 243#L1045true, Black: 582#(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: 584#(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: 578#(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: 580#(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: 462#true, 551#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 523#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base)), Black: 466#true, Black: 525#(= |cleanerThread1of1ForFork0_#t~mem7| 0), Black: 531#(and (= |cleanerThread1of1ForFork0_#t~mem7| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base))), Black: 524#(= (select (select |#memory_int| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 445#true, 472#(= |#race~datas~0| 0), Black: 470#true, 468#(= |#race~tids~0| 0), 589#true, 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: 553#(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: 541#(not (= ~datas~0.base ~tids~0.base)), 422#L1030true, Black: 542#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base))), Black: 497#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 519#true, 509#true, 576#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 464#(= |#race~datas_mutex~0| 0)]) [2025-03-04 06:58:41,423 INFO L294 olderBase$Statistics]: this new event has 370 ancestors and is cut-off event [2025-03-04 06:58:41,423 INFO L297 olderBase$Statistics]: existing Event has 266 ancestors and is cut-off event [2025-03-04 06:58:41,423 INFO L297 olderBase$Statistics]: existing Event has 349 ancestors and is cut-off event [2025-03-04 06:58:41,423 INFO L297 olderBase$Statistics]: existing Event has 349 ancestors and is cut-off event [2025-03-04 06:58:41,423 INFO L297 olderBase$Statistics]: existing Event has 266 ancestors and is cut-off event [2025-03-04 06:58:41,610 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([897] L1030-3-->L1030: Formula: (and (= |v_threadThread1of1ForFork1_#t~ret5_1| 0) (= (store |v_#pthreadsMutex_112| v_~datas_mutex~0.base_18 (store (select |v_#pthreadsMutex_112| v_~datas_mutex~0.base_18) (+ (* v_threadThread1of1ForFork1_~i~0_13 24) v_~datas_mutex~0.offset_18) 0)) |v_#pthreadsMutex_111|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_112|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_18, ~datas_mutex~0.base=v_~datas_mutex~0.base_18} OutVars{#pthreadsMutex=|v_#pthreadsMutex_111|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_18, threadThread1of1ForFork1_#t~ret5=|v_threadThread1of1ForFork1_#t~ret5_1|, ~datas_mutex~0.base=v_~datas_mutex~0.base_18} AuxVars[] AssignedVars[#pthreadsMutex, threadThread1of1ForFork1_#t~ret5][332], [452#(= |#race~threads_total~0| 0), Black: 511#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 513#(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: 512#(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: 514#(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|)), 243#L1045true, Black: 582#(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: 584#(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: 578#(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: 580#(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: 462#true, 551#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 523#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base)), Black: 466#true, Black: 525#(= |cleanerThread1of1ForFork0_#t~mem7| 0), Black: 531#(and (= |cleanerThread1of1ForFork0_#t~mem7| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base))), Black: 524#(= (select (select |#memory_int| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 445#true, 472#(= |#race~datas~0| 0), 21#L1065true, Black: 470#true, 468#(= |#race~tids~0| 0), 589#true, 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: 553#(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: 486#(= |ULTIMATE.start_main_~i~2#1| 0), 422#L1030true, Black: 541#(not (= ~datas~0.base ~tids~0.base)), Black: 542#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base))), Black: 497#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 519#true, 509#true, 576#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 464#(= |#race~datas_mutex~0| 0)]) [2025-03-04 06:58:41,611 INFO L294 olderBase$Statistics]: this new event has 371 ancestors and is cut-off event [2025-03-04 06:58:41,611 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2025-03-04 06:58:41,611 INFO L297 olderBase$Statistics]: existing Event has 350 ancestors and is cut-off event [2025-03-04 06:58:41,611 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2025-03-04 06:58:41,611 INFO L297 olderBase$Statistics]: existing Event has 350 ancestors and is cut-off event [2025-03-04 06:58:41,789 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([897] L1030-3-->L1030: Formula: (and (= |v_threadThread1of1ForFork1_#t~ret5_1| 0) (= (store |v_#pthreadsMutex_112| v_~datas_mutex~0.base_18 (store (select |v_#pthreadsMutex_112| v_~datas_mutex~0.base_18) (+ (* v_threadThread1of1ForFork1_~i~0_13 24) v_~datas_mutex~0.offset_18) 0)) |v_#pthreadsMutex_111|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_112|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_18, ~datas_mutex~0.base=v_~datas_mutex~0.base_18} OutVars{#pthreadsMutex=|v_#pthreadsMutex_111|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_18, threadThread1of1ForFork1_#t~ret5=|v_threadThread1of1ForFork1_#t~ret5_1|, ~datas_mutex~0.base=v_~datas_mutex~0.base_18} AuxVars[] AssignedVars[#pthreadsMutex, threadThread1of1ForFork1_#t~ret5][332], [452#(= |#race~threads_total~0| 0), Black: 511#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 513#(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: 512#(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: 514#(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|)), 243#L1045true, Black: 582#(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: 584#(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: 578#(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: 580#(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: 462#true, 551#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 523#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base)), Black: 466#true, Black: 525#(= |cleanerThread1of1ForFork0_#t~mem7| 0), Black: 531#(and (= |cleanerThread1of1ForFork0_#t~mem7| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base))), Black: 524#(= (select (select |#memory_int| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 445#true, 472#(= |#race~datas~0| 0), Black: 470#true, 468#(= |#race~tids~0| 0), 589#true, 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: 553#(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: 486#(= |ULTIMATE.start_main_~i~2#1| 0), 422#L1030true, Black: 541#(not (= ~datas~0.base ~tids~0.base)), Black: 542#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base))), Black: 497#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 519#true, 509#true, 576#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 464#(= |#race~datas_mutex~0| 0), 212#L1067true]) [2025-03-04 06:58:41,789 INFO L294 olderBase$Statistics]: this new event has 380 ancestors and is cut-off event [2025-03-04 06:58:41,789 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2025-03-04 06:58:41,789 INFO L297 olderBase$Statistics]: existing Event has 276 ancestors and is cut-off event [2025-03-04 06:58:41,789 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2025-03-04 06:58:41,789 INFO L297 olderBase$Statistics]: existing Event has 276 ancestors and is cut-off event [2025-03-04 06:58:41,804 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([897] L1030-3-->L1030: Formula: (and (= |v_threadThread1of1ForFork1_#t~ret5_1| 0) (= (store |v_#pthreadsMutex_112| v_~datas_mutex~0.base_18 (store (select |v_#pthreadsMutex_112| v_~datas_mutex~0.base_18) (+ (* v_threadThread1of1ForFork1_~i~0_13 24) v_~datas_mutex~0.offset_18) 0)) |v_#pthreadsMutex_111|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_112|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_18, ~datas_mutex~0.base=v_~datas_mutex~0.base_18} OutVars{#pthreadsMutex=|v_#pthreadsMutex_111|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_18, threadThread1of1ForFork1_#t~ret5=|v_threadThread1of1ForFork1_#t~ret5_1|, ~datas_mutex~0.base=v_~datas_mutex~0.base_18} AuxVars[] AssignedVars[#pthreadsMutex, threadThread1of1ForFork1_#t~ret5][332], [452#(= |#race~threads_total~0| 0), Black: 511#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 513#(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: 512#(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: 514#(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|)), 243#L1045true, Black: 582#(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: 584#(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: 578#(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: 580#(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: 462#true, 551#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 523#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base)), Black: 466#true, Black: 525#(= |cleanerThread1of1ForFork0_#t~mem7| 0), Black: 531#(and (= |cleanerThread1of1ForFork0_#t~mem7| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base))), Black: 524#(= (select (select |#memory_int| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 445#true, 472#(= |#race~datas~0| 0), Black: 470#true, 468#(= |#race~tids~0| 0), 589#true, Black: 474#true, Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 443#true, Black: 553#(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: 486#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 541#(not (= ~datas~0.base ~tids~0.base)), 422#L1030true, Black: 542#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base))), Black: 497#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 519#true, 509#true, 576#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 464#(= |#race~datas_mutex~0| 0), 163#L1068-2true]) [2025-03-04 06:58:41,805 INFO L294 olderBase$Statistics]: this new event has 382 ancestors and is cut-off event [2025-03-04 06:58:41,805 INFO L297 olderBase$Statistics]: existing Event has 278 ancestors and is cut-off event [2025-03-04 06:58:41,805 INFO L297 olderBase$Statistics]: existing Event has 278 ancestors and is cut-off event [2025-03-04 06:58:41,805 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2025-03-04 06:58:41,805 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2025-03-04 06:58:41,851 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([897] L1030-3-->L1030: Formula: (and (= |v_threadThread1of1ForFork1_#t~ret5_1| 0) (= (store |v_#pthreadsMutex_112| v_~datas_mutex~0.base_18 (store (select |v_#pthreadsMutex_112| v_~datas_mutex~0.base_18) (+ (* v_threadThread1of1ForFork1_~i~0_13 24) v_~datas_mutex~0.offset_18) 0)) |v_#pthreadsMutex_111|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_112|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_18, ~datas_mutex~0.base=v_~datas_mutex~0.base_18} OutVars{#pthreadsMutex=|v_#pthreadsMutex_111|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_18, threadThread1of1ForFork1_#t~ret5=|v_threadThread1of1ForFork1_#t~ret5_1|, ~datas_mutex~0.base=v_~datas_mutex~0.base_18} AuxVars[] AssignedVars[#pthreadsMutex, threadThread1of1ForFork1_#t~ret5][332], [452#(= |#race~threads_total~0| 0), Black: 511#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 513#(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: 512#(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: 514#(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|)), 243#L1045true, Black: 582#(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: 584#(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: 578#(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))), 275#L1069-2true, Black: 580#(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: 462#true, 551#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 523#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base)), Black: 466#true, Black: 525#(= |cleanerThread1of1ForFork0_#t~mem7| 0), Black: 531#(and (= |cleanerThread1of1ForFork0_#t~mem7| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base))), Black: 524#(= (select (select |#memory_int| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 445#true, 472#(= |#race~datas~0| 0), Black: 470#true, 468#(= |#race~tids~0| 0), 589#true, Black: 474#true, Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 443#true, Black: 553#(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: 486#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 541#(not (= ~datas~0.base ~tids~0.base)), 422#L1030true, Black: 542#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base))), Black: 497#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 519#true, 509#true, 576#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 464#(= |#race~datas_mutex~0| 0)]) [2025-03-04 06:58:41,851 INFO L294 olderBase$Statistics]: this new event has 385 ancestors and is cut-off event [2025-03-04 06:58:41,851 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-03-04 06:58:41,852 INFO L297 olderBase$Statistics]: existing Event has 364 ancestors and is cut-off event [2025-03-04 06:58:41,852 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-03-04 06:58:41,852 INFO L297 olderBase$Statistics]: existing Event has 364 ancestors and is cut-off event [2025-03-04 06:58:41,854 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([897] L1030-3-->L1030: Formula: (and (= |v_threadThread1of1ForFork1_#t~ret5_1| 0) (= (store |v_#pthreadsMutex_112| v_~datas_mutex~0.base_18 (store (select |v_#pthreadsMutex_112| v_~datas_mutex~0.base_18) (+ (* v_threadThread1of1ForFork1_~i~0_13 24) v_~datas_mutex~0.offset_18) 0)) |v_#pthreadsMutex_111|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_112|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_18, ~datas_mutex~0.base=v_~datas_mutex~0.base_18} OutVars{#pthreadsMutex=|v_#pthreadsMutex_111|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_18, threadThread1of1ForFork1_#t~ret5=|v_threadThread1of1ForFork1_#t~ret5_1|, ~datas_mutex~0.base=v_~datas_mutex~0.base_18} AuxVars[] AssignedVars[#pthreadsMutex, threadThread1of1ForFork1_#t~ret5][332], [452#(= |#race~threads_total~0| 0), Black: 511#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 513#(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: 512#(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: 514#(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|)), 243#L1045true, Black: 582#(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|)), 276#L1070true, Black: 584#(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: 578#(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: 580#(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: 462#true, 551#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 523#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base)), Black: 466#true, Black: 525#(= |cleanerThread1of1ForFork0_#t~mem7| 0), Black: 531#(and (= |cleanerThread1of1ForFork0_#t~mem7| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base))), Black: 524#(= (select (select |#memory_int| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 445#true, 472#(= |#race~datas~0| 0), Black: 470#true, 468#(= |#race~tids~0| 0), Black: 474#true, 589#true, Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 443#true, Black: 553#(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: 486#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 541#(not (= ~datas~0.base ~tids~0.base)), 422#L1030true, Black: 542#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base))), Black: 497#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 519#true, 509#true, 576#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 464#(= |#race~datas_mutex~0| 0)]) [2025-03-04 06:58:41,854 INFO L294 olderBase$Statistics]: this new event has 385 ancestors and is cut-off event [2025-03-04 06:58:41,855 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-03-04 06:58:41,855 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-03-04 06:58:41,855 INFO L297 olderBase$Statistics]: existing Event has 364 ancestors and is cut-off event [2025-03-04 06:58:41,855 INFO L297 olderBase$Statistics]: existing Event has 364 ancestors and is cut-off event [2025-03-04 06:58:41,873 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([897] L1030-3-->L1030: Formula: (and (= |v_threadThread1of1ForFork1_#t~ret5_1| 0) (= (store |v_#pthreadsMutex_112| v_~datas_mutex~0.base_18 (store (select |v_#pthreadsMutex_112| v_~datas_mutex~0.base_18) (+ (* v_threadThread1of1ForFork1_~i~0_13 24) v_~datas_mutex~0.offset_18) 0)) |v_#pthreadsMutex_111|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_112|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_18, ~datas_mutex~0.base=v_~datas_mutex~0.base_18} OutVars{#pthreadsMutex=|v_#pthreadsMutex_111|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_18, threadThread1of1ForFork1_#t~ret5=|v_threadThread1of1ForFork1_#t~ret5_1|, ~datas_mutex~0.base=v_~datas_mutex~0.base_18} AuxVars[] AssignedVars[#pthreadsMutex, threadThread1of1ForFork1_#t~ret5][332], [452#(= |#race~threads_total~0| 0), Black: 511#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 513#(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: 512#(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: 514#(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|)), 243#L1045true, Black: 582#(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: 584#(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: 578#(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: 580#(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: 462#true, 551#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 523#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base)), Black: 466#true, Black: 525#(= |cleanerThread1of1ForFork0_#t~mem7| 0), Black: 531#(and (= |cleanerThread1of1ForFork0_#t~mem7| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base))), Black: 524#(= (select (select |#memory_int| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 445#true, 472#(= |#race~datas~0| 0), Black: 470#true, 468#(= |#race~tids~0| 0), 589#true, Black: 474#true, Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 443#true, Black: 553#(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: 486#(= |ULTIMATE.start_main_~i~2#1| 0), 422#L1030true, Black: 541#(not (= ~datas~0.base ~tids~0.base)), Black: 542#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base))), 182#L1068true, Black: 497#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 519#true, 509#true, 576#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 464#(= |#race~datas_mutex~0| 0)]) [2025-03-04 06:58:41,873 INFO L294 olderBase$Statistics]: this new event has 386 ancestors and is cut-off event [2025-03-04 06:58:41,873 INFO L297 olderBase$Statistics]: existing Event has 365 ancestors and is cut-off event [2025-03-04 06:58:41,873 INFO L297 olderBase$Statistics]: existing Event has 365 ancestors and is cut-off event [2025-03-04 06:58:41,873 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-03-04 06:58:41,873 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-03-04 06:58:41,911 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([565] L1071-1-->L1071: Formula: (= (store |v_#valid_2| v_~tids~0.base_8 0) |v_#valid_1|) InVars {~tids~0.base=v_~tids~0.base_8, #valid=|v_#valid_2|} OutVars{~tids~0.base=v_~tids~0.base_8, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid][384], [452#(= |#race~threads_total~0| 0), Black: 511#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 513#(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: 512#(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: 514#(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|)), 243#L1045true, Black: 582#(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: 584#(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: 578#(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: 580#(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: 462#true, Black: 523#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base)), Black: 466#true, Black: 525#(= |cleanerThread1of1ForFork0_#t~mem7| 0), Black: 531#(and (= |cleanerThread1of1ForFork0_#t~mem7| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base))), Black: 524#(= (select (select |#memory_int| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 445#true, 472#(= |#race~datas~0| 0), Black: 470#true, 468#(= |#race~tids~0| 0), 541#(not (= ~datas~0.base ~tids~0.base)), Black: 474#true, 589#true, Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 162#L1029true, 443#true, Black: 551#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 553#(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: 486#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 542#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base))), Black: 497#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 519#true, 74#L1071true, 509#true, 464#(= |#race~datas_mutex~0| 0), 563#(not (= ~datas~0.base ~tids~0.base))]) [2025-03-04 06:58:41,911 INFO L294 olderBase$Statistics]: this new event has 384 ancestors and is cut-off event [2025-03-04 06:58:41,911 INFO L297 olderBase$Statistics]: existing Event has 363 ancestors and is cut-off event [2025-03-04 06:58:41,911 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-03-04 06:58:41,911 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-03-04 06:58:42,093 INFO L124 PetriNetUnfolderBase]: 6892/32697 cut-off events. [2025-03-04 06:58:42,093 INFO L125 PetriNetUnfolderBase]: For 22664/24640 co-relation queries the response was YES. [2025-03-04 06:58:42,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67634 conditions, 32697 events. 6892/32697 cut-off events. For 22664/24640 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 398635 event pairs, 2817 based on Foata normal form. 156/29753 useless extension candidates. Maximal degree in co-relation 67460. Up to 6727 conditions per place. [2025-03-04 06:58:42,363 INFO L140 encePairwiseOnDemand]: 445/451 looper letters, 36 selfloop transitions, 7 changer transitions 0/488 dead transitions. [2025-03-04 06:58:42,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 488 transitions, 2125 flow [2025-03-04 06:58:42,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:58:42,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:58:42,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1268 transitions. [2025-03-04 06:58:42,365 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9371766444937176 [2025-03-04 06:58:42,365 INFO L175 Difference]: Start difference. First operand has 407 places, 476 transitions, 2006 flow. Second operand 3 states and 1268 transitions. [2025-03-04 06:58:42,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 488 transitions, 2125 flow [2025-03-04 06:58:42,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 403 places, 488 transitions, 2104 flow, removed 5 selfloop flow, removed 6 redundant places. [2025-03-04 06:58:42,446 INFO L231 Difference]: Finished difference. Result has 405 places, 481 transitions, 2041 flow [2025-03-04 06:58:42,447 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=451, PETRI_DIFFERENCE_MINUEND_FLOW=1985, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=476, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=469, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2041, PETRI_PLACES=405, PETRI_TRANSITIONS=481} [2025-03-04 06:58:42,447 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, 30 predicate places. [2025-03-04 06:58:42,447 INFO L471 AbstractCegarLoop]: Abstraction has has 405 places, 481 transitions, 2041 flow [2025-03-04 06:58:42,448 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-04 06:58:42,448 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:58:42,448 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-04 06:58:42,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 06:58:42,448 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-04 06:58:42,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:58:42,449 INFO L85 PathProgramCache]: Analyzing trace with hash 735188206, now seen corresponding path program 1 times [2025-03-04 06:58:42,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:58:42,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706288612] [2025-03-04 06:58:42,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:58:42,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:58:42,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-04 06:58:42,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-04 06:58:42,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:58:42,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:58:42,530 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-04 06:58:42,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:58:42,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706288612] [2025-03-04 06:58:42,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706288612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:58:42,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:58:42,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:58:42,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727948750] [2025-03-04 06:58:42,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:58:42,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:58:42,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:58:42,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:58:42,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:58:42,578 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 398 out of 451 [2025-03-04 06:58:42,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 481 transitions, 2041 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-04 06:58:42,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:58:42,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 398 of 451 [2025-03-04 06:58:42,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:58:47,818 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][297], [452#(= |#race~threads_total~0| 0), Black: 511#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 513#(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: 512#(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: 514#(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: 582#(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: 584#(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: 578#(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: 580#(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: 462#true, Black: 591#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet32#1|), 106#L1061true, 551#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 523#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base)), Black: 466#true, Black: 525#(= |cleanerThread1of1ForFork0_#t~mem7| 0), Black: 531#(and (= |cleanerThread1of1ForFork0_#t~mem7| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base))), Black: 524#(= (select (select |#memory_int| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 445#true, 472#(= |#race~datas~0| 0), Black: 470#true, 468#(= |#race~tids~0| 0), 589#true, 596#(= |threadThread1of1ForFork1_#t~nondet4| (select (select |#race| ~datas~0.base) (+ threadThread1of1ForFork1_~i~0 ~datas~0.offset))), Black: 476#(= |#race~threads_alive~0| 0), Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 162#L1029true, 29#L1035-2true, 443#true, Black: 553#(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: 486#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 541#(not (= ~datas~0.base ~tids~0.base)), Black: 542#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base))), Black: 497#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 519#true, 509#true, 576#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 464#(= |#race~datas_mutex~0| 0)]) [2025-03-04 06:58:47,818 INFO L294 olderBase$Statistics]: this new event has 335 ancestors and is cut-off event [2025-03-04 06:58:47,818 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-03-04 06:58:47,818 INFO L297 olderBase$Statistics]: existing Event has 335 ancestors and is cut-off event [2025-03-04 06:58:47,818 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event