./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 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/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-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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-?-48c9605-m [2025-02-08 05:42:43,853 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:42:43,917 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:42:43,926 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:42:43,926 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:42:43,948 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:42:43,948 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:42:43,949 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:42:43,949 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:42:43,949 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:42:43,949 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:42:43,949 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:42:43,949 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:42:43,949 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:42:43,950 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:42:43,950 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:42:43,950 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:42:43,950 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:42:43,950 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:42:43,950 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:42:43,950 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:42:43,950 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:42:43,950 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:42:43,950 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:42:43,950 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:42:43,951 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:42:43,951 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:42:43,951 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:42:43,951 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:42:43,951 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:42:43,951 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:42:43,951 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:42:43,951 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:42:43,951 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:42:43,951 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:42:43,951 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:42:43,951 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:42:43,952 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:42:43,952 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:42:43,952 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:42:43,952 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:42:43,952 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:42:43,952 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-jdk21/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-02-08 05:42:44,165 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:42:44,170 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:42:44,174 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:42:44,175 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:42:44,175 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:42:44,177 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/per-thread-array-join-counter-race-4.i [2025-02-08 05:42:45,342 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b75fd0fb6/fdccfd9da6e54c61818849cf3978e6c5/FLAG3d3580906 [2025-02-08 05:42:45,632 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:42:45,632 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-array-join-counter-race-4.i [2025-02-08 05:42:45,645 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b75fd0fb6/fdccfd9da6e54c61818849cf3978e6c5/FLAG3d3580906 [2025-02-08 05:42:45,656 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b75fd0fb6/fdccfd9da6e54c61818849cf3978e6c5 [2025-02-08 05:42:45,660 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:42:45,661 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:42:45,662 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:42:45,662 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:42:45,665 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:42:45,665 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:42:45" (1/1) ... [2025-02-08 05:42:45,667 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48d4705a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:42:45, skipping insertion in model container [2025-02-08 05:42:45,667 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:42:45" (1/1) ... [2025-02-08 05:42:45,704 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:42:46,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:42:46,065 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:42:46,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:42:46,152 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:42:46,152 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:42:46 WrapperNode [2025-02-08 05:42:46,153 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:42:46,153 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:42:46,153 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:42:46,153 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:42:46,157 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:42:46" (1/1) ... [2025-02-08 05:42:46,167 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:42:46" (1/1) ... [2025-02-08 05:42:46,188 INFO L138 Inliner]: procedures = 267, calls = 34, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 262 [2025-02-08 05:42:46,192 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:42:46,192 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:42:46,193 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:42:46,193 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:42:46,202 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:42:46" (1/1) ... [2025-02-08 05:42:46,202 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:42:46" (1/1) ... [2025-02-08 05:42:46,209 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:42:46" (1/1) ... [2025-02-08 05:42:46,209 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:42:46" (1/1) ... [2025-02-08 05:42:46,219 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:42:46" (1/1) ... [2025-02-08 05:42:46,220 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:42:46" (1/1) ... [2025-02-08 05:42:46,222 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:42:46" (1/1) ... [2025-02-08 05:42:46,222 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:42:46" (1/1) ... [2025-02-08 05:42:46,225 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:42:46,225 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:42:46,225 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:42:46,225 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:42:46,226 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:42:46" (1/1) ... [2025-02-08 05:42:46,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:42:46,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:42:46,252 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:42:46,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:42:46,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 05:42:46,271 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 05:42:46,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:42:46,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:42:46,271 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 05:42:46,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:42:46,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:42:46,271 INFO L130 BoogieDeclarations]: Found specification of procedure cleaner [2025-02-08 05:42:46,271 INFO L138 BoogieDeclarations]: Found implementation of procedure cleaner [2025-02-08 05:42:46,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:42:46,271 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-02-08 05:42:46,271 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-02-08 05:42:46,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:42:46,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:42:46,273 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:42:46,389 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:42:46,390 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:42:46,786 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1072: havoc main_#t~mem39#1; [2025-02-08 05:42:46,816 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:42:46,816 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:42:46,845 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:42:46,845 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:42:46,846 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:42:46 BoogieIcfgContainer [2025-02-08 05:42:46,846 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:42:46,860 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:42:46,861 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:42:46,864 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:42:46,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:42:45" (1/3) ... [2025-02-08 05:42:46,865 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@899c874 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:42:46, skipping insertion in model container [2025-02-08 05:42:46,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:42:46" (2/3) ... [2025-02-08 05:42:46,866 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@899c874 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:42:46, skipping insertion in model container [2025-02-08 05:42:46,866 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:42:46" (3/3) ... [2025-02-08 05:42:46,868 INFO L128 eAbstractionObserver]: Analyzing ICFG per-thread-array-join-counter-race-4.i [2025-02-08 05:42:46,879 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:42:46,880 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-02-08 05:42:46,881 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:42:46,966 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 05:42:47,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 444 places, 451 transitions, 916 flow [2025-02-08 05:42:47,157 INFO L124 PetriNetUnfolderBase]: 19/567 cut-off events. [2025-02-08 05:42:47,159 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:42:47,168 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 918 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-02-08 05:42:47,168 INFO L82 GeneralOperation]: Start removeDead. Operand has 444 places, 451 transitions, 916 flow [2025-02-08 05:42:47,175 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 375 places, 379 transitions, 768 flow [2025-02-08 05:42:47,180 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:42:47,187 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;@1307f2bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:42:47,187 INFO L334 AbstractCegarLoop]: Starting to check reachability of 51 error locations. [2025-02-08 05:42:47,199 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:42:47,199 INFO L124 PetriNetUnfolderBase]: 0/140 cut-off events. [2025-02-08 05:42:47,200 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:42:47,200 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:42:47,200 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-02-08 05:42:47,201 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-02-08 05:42:47,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:42:47,205 INFO L85 PathProgramCache]: Analyzing trace with hash 520405495, now seen corresponding path program 1 times [2025-02-08 05:42:47,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:42:47,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058668161] [2025-02-08 05:42:47,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:42:47,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:42:47,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-08 05:42:47,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-08 05:42:47,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:42:47,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:42:47,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:42:47,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:42:47,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058668161] [2025-02-08 05:42:47,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058668161] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:42:47,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:42:47,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:42:47,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404602151] [2025-02-08 05:42:47,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:42:47,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:42:47,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:42:47,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:42:47,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:42:47,635 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 451 [2025-02-08 05:42:47,641 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-02-08 05:42:47,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:42:47,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 451 [2025-02-08 05:42:47,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:42:48,197 INFO L124 PetriNetUnfolderBase]: 384/2882 cut-off events. [2025-02-08 05:42:48,198 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-02-08 05:42:48,206 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 20086 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-02-08 05:42:48,218 INFO L140 encePairwiseOnDemand]: 442/451 looper letters, 26 selfloop transitions, 2 changer transitions 1/370 dead transitions. [2025-02-08 05:42:48,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 370 transitions, 806 flow [2025-02-08 05:42:48,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:42:48,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:42:48,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1259 transitions. [2025-02-08 05:42:48,236 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9305247597930525 [2025-02-08 05:42:48,239 INFO L175 Difference]: Start difference. First operand has 375 places, 379 transitions, 768 flow. Second operand 3 states and 1259 transitions. [2025-02-08 05:42:48,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 370 transitions, 806 flow [2025-02-08 05:42:48,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 370 transitions, 805 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:42:48,253 INFO L231 Difference]: Finished difference. Result has 372 places, 369 transitions, 751 flow [2025-02-08 05:42:48,256 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-02-08 05:42:48,260 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -3 predicate places. [2025-02-08 05:42:48,260 INFO L471 AbstractCegarLoop]: Abstraction has has 372 places, 369 transitions, 751 flow [2025-02-08 05:42:48,261 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-02-08 05:42:48,261 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:42:48,261 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-02-08 05:42:48,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:42:48,261 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-02-08 05:42:48,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:42:48,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1420781436, now seen corresponding path program 1 times [2025-02-08 05:42:48,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:42:48,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111948545] [2025-02-08 05:42:48,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:42:48,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:42:48,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-08 05:42:48,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-08 05:42:48,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:42:48,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:42:48,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:42:48,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:42:48,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111948545] [2025-02-08 05:42:48,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111948545] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:42:48,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:42:48,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:42:48,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691456988] [2025-02-08 05:42:48,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:42:48,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:42:48,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:42:48,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:42:48,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:42:48,458 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 398 out of 451 [2025-02-08 05:42:48,460 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-02-08 05:42:48,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:42:48,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 398 of 451 [2025-02-08 05:42:48,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:42:48,893 INFO L124 PetriNetUnfolderBase]: 405/2952 cut-off events. [2025-02-08 05:42:48,893 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2025-02-08 05:42:48,902 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 20611 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-02-08 05:42:48,916 INFO L140 encePairwiseOnDemand]: 443/451 looper letters, 29 selfloop transitions, 1 changer transitions 0/362 dead transitions. [2025-02-08 05:42:48,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 362 transitions, 797 flow [2025-02-08 05:42:48,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:42:48,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:42:48,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1231 transitions. [2025-02-08 05:42:48,920 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.909830007390983 [2025-02-08 05:42:48,920 INFO L175 Difference]: Start difference. First operand has 372 places, 369 transitions, 751 flow. Second operand 3 states and 1231 transitions. [2025-02-08 05:42:48,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 362 transitions, 797 flow [2025-02-08 05:42:48,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 362 transitions, 793 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:42:48,928 INFO L231 Difference]: Finished difference. Result has 364 places, 362 transitions, 735 flow [2025-02-08 05:42:48,929 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-02-08 05:42:48,929 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -11 predicate places. [2025-02-08 05:42:48,929 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 362 transitions, 735 flow [2025-02-08 05:42:48,930 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-02-08 05:42:48,930 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:42:48,930 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 05:42:48,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:42:48,930 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-02-08 05:42:48,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:42:48,931 INFO L85 PathProgramCache]: Analyzing trace with hash 463509185, now seen corresponding path program 1 times [2025-02-08 05:42:48,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:42:48,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262972707] [2025-02-08 05:42:48,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:42:48,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:42:48,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-08 05:42:48,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-08 05:42:48,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:42:48,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:42:49,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:42:49,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:42:49,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262972707] [2025-02-08 05:42:49,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262972707] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:42:49,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:42:49,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:42:49,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822713059] [2025-02-08 05:42:49,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:42:49,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:42:49,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:42:49,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:42:49,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:42:49,091 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 451 [2025-02-08 05:42:49,093 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-02-08 05:42:49,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:42:49,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 451 [2025-02-08 05:42:49,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:42:49,372 INFO L124 PetriNetUnfolderBase]: 416/2832 cut-off events. [2025-02-08 05:42:49,372 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-02-08 05:42:49,380 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 20056 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-02-08 05:42:49,393 INFO L140 encePairwiseOnDemand]: 448/451 looper letters, 22 selfloop transitions, 2 changer transitions 0/361 dead transitions. [2025-02-08 05:42:49,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 361 transitions, 781 flow [2025-02-08 05:42:49,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:42:49,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:42:49,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1261 transitions. [2025-02-08 05:42:49,398 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9320029563932003 [2025-02-08 05:42:49,398 INFO L175 Difference]: Start difference. First operand has 364 places, 362 transitions, 735 flow. Second operand 3 states and 1261 transitions. [2025-02-08 05:42:49,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 361 transitions, 781 flow [2025-02-08 05:42:49,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 361 transitions, 780 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:42:49,404 INFO L231 Difference]: Finished difference. Result has 364 places, 361 transitions, 736 flow [2025-02-08 05:42:49,405 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-02-08 05:42:49,405 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -11 predicate places. [2025-02-08 05:42:49,405 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 361 transitions, 736 flow [2025-02-08 05:42:49,406 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-02-08 05:42:49,406 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:42:49,406 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-02-08 05:42:49,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:42:49,406 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-02-08 05:42:49,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:42:49,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1479206914, now seen corresponding path program 1 times [2025-02-08 05:42:49,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:42:49,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242344404] [2025-02-08 05:42:49,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:42:49,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:42:49,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-08 05:42:49,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-08 05:42:49,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:42:49,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:42:49,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:42:49,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:42:49,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242344404] [2025-02-08 05:42:49,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242344404] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:42:49,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:42:49,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:42:49,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746368710] [2025-02-08 05:42:49,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:42:49,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:42:49,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:42:49,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:42:49,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:42:49,523 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 410 out of 451 [2025-02-08 05:42:49,525 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-02-08 05:42:49,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:42:49,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 410 of 451 [2025-02-08 05:42:49,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:42:49,869 INFO L124 PetriNetUnfolderBase]: 549/3740 cut-off events. [2025-02-08 05:42:49,869 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-02-08 05:42:49,878 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 28685 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-02-08 05:42:49,889 INFO L140 encePairwiseOnDemand]: 448/451 looper letters, 23 selfloop transitions, 2 changer transitions 0/360 dead transitions. [2025-02-08 05:42:49,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 360 transitions, 784 flow [2025-02-08 05:42:49,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:42:49,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:42:49,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1256 transitions. [2025-02-08 05:42:49,892 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9283074648928308 [2025-02-08 05:42:49,892 INFO L175 Difference]: Start difference. First operand has 364 places, 361 transitions, 736 flow. Second operand 3 states and 1256 transitions. [2025-02-08 05:42:49,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 360 transitions, 784 flow [2025-02-08 05:42:49,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 360 transitions, 780 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:42:49,896 INFO L231 Difference]: Finished difference. Result has 363 places, 360 transitions, 734 flow [2025-02-08 05:42:49,896 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-02-08 05:42:49,897 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -12 predicate places. [2025-02-08 05:42:49,897 INFO L471 AbstractCegarLoop]: Abstraction has has 363 places, 360 transitions, 734 flow [2025-02-08 05:42:49,898 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-02-08 05:42:49,898 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:42:49,898 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-02-08 05:42:49,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:42:49,898 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-02-08 05:42:49,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:42:49,899 INFO L85 PathProgramCache]: Analyzing trace with hash 917573223, now seen corresponding path program 1 times [2025-02-08 05:42:49,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:42:49,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587340362] [2025-02-08 05:42:49,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:42:49,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:42:49,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-02-08 05:42:49,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-02-08 05:42:49,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:42:49,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:42:49,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:42:49,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:42:49,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587340362] [2025-02-08 05:42:49,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587340362] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:42:49,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:42:49,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:42:49,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124130086] [2025-02-08 05:42:49,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:42:49,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:42:49,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:42:49,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:42:49,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:42:50,016 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 451 [2025-02-08 05:42:50,018 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-02-08 05:42:50,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:42:50,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 451 [2025-02-08 05:42:50,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:42:50,402 INFO L124 PetriNetUnfolderBase]: 717/3499 cut-off events. [2025-02-08 05:42:50,402 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-02-08 05:42:50,408 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 25726 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-02-08 05:42:50,421 INFO L140 encePairwiseOnDemand]: 448/451 looper letters, 24 selfloop transitions, 2 changer transitions 0/359 dead transitions. [2025-02-08 05:42:50,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 359 transitions, 784 flow [2025-02-08 05:42:50,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:42:50,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:42:50,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1254 transitions. [2025-02-08 05:42:50,424 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.926829268292683 [2025-02-08 05:42:50,425 INFO L175 Difference]: Start difference. First operand has 363 places, 360 transitions, 734 flow. Second operand 3 states and 1254 transitions. [2025-02-08 05:42:50,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 359 transitions, 784 flow [2025-02-08 05:42:50,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 359 transitions, 780 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:42:50,430 INFO L231 Difference]: Finished difference. Result has 362 places, 359 transitions, 732 flow [2025-02-08 05:42:50,431 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-02-08 05:42:50,431 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -13 predicate places. [2025-02-08 05:42:50,431 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 359 transitions, 732 flow [2025-02-08 05:42:50,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-02-08 05:42:50,432 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:42:50,432 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-02-08 05:42:50,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:42:50,432 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-02-08 05:42:50,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:42:50,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1154421998, now seen corresponding path program 1 times [2025-02-08 05:42:50,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:42:50,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796830860] [2025-02-08 05:42:50,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:42:50,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:42:50,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-02-08 05:42:50,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-02-08 05:42:50,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:42:50,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:42:50,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-02-08 05:42:50,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:42:50,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796830860] [2025-02-08 05:42:50,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796830860] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:42:50,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:42:50,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:42:50,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991926234] [2025-02-08 05:42:50,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:42:50,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:42:50,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:42:50,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:42:50,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:42:50,544 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 401 out of 451 [2025-02-08 05:42:50,546 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-02-08 05:42:50,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:42:50,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 401 of 451 [2025-02-08 05:42:50,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:42:51,008 INFO L124 PetriNetUnfolderBase]: 1108/3870 cut-off events. [2025-02-08 05:42:51,008 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2025-02-08 05:42:51,018 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 27510 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-02-08 05:42:51,031 INFO L140 encePairwiseOnDemand]: 443/451 looper letters, 34 selfloop transitions, 3 changer transitions 0/365 dead transitions. [2025-02-08 05:42:51,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 365 transitions, 823 flow [2025-02-08 05:42:51,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:42:51,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:42:51,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1245 transitions. [2025-02-08 05:42:51,033 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9201773835920177 [2025-02-08 05:42:51,033 INFO L175 Difference]: Start difference. First operand has 362 places, 359 transitions, 732 flow. Second operand 3 states and 1245 transitions. [2025-02-08 05:42:51,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 365 transitions, 823 flow [2025-02-08 05:42:51,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 365 transitions, 819 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:42:51,037 INFO L231 Difference]: Finished difference. Result has 358 places, 357 transitions, 739 flow [2025-02-08 05:42:51,038 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-02-08 05:42:51,040 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -17 predicate places. [2025-02-08 05:42:51,040 INFO L471 AbstractCegarLoop]: Abstraction has has 358 places, 357 transitions, 739 flow [2025-02-08 05:42:51,040 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-02-08 05:42:51,040 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:42:51,041 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-02-08 05:42:51,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:42:51,041 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-02-08 05:42:51,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:42:51,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1096759943, now seen corresponding path program 1 times [2025-02-08 05:42:51,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:42:51,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023182438] [2025-02-08 05:42:51,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:42:51,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:42:51,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-02-08 05:42:51,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-02-08 05:42:51,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:42:51,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:42:51,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:42:51,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:42:51,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023182438] [2025-02-08 05:42:51,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023182438] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:42:51,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:42:51,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:42:51,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965950732] [2025-02-08 05:42:51,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:42:51,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:42:51,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:42:51,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:42:51,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:42:51,118 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 410 out of 451 [2025-02-08 05:42:51,119 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-02-08 05:42:51,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:42:51,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 410 of 451 [2025-02-08 05:42:51,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:42:51,462 INFO L124 PetriNetUnfolderBase]: 508/3249 cut-off events. [2025-02-08 05:42:51,462 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-02-08 05:42:51,474 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 24784 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-02-08 05:42:51,483 INFO L140 encePairwiseOnDemand]: 445/451 looper letters, 28 selfloop transitions, 3 changer transitions 0/363 dead transitions. [2025-02-08 05:42:51,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 363 transitions, 813 flow [2025-02-08 05:42:51,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:42:51,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:42:51,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1264 transitions. [2025-02-08 05:42:51,486 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.934220251293422 [2025-02-08 05:42:51,486 INFO L175 Difference]: Start difference. First operand has 358 places, 357 transitions, 739 flow. Second operand 3 states and 1264 transitions. [2025-02-08 05:42:51,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 363 transitions, 813 flow [2025-02-08 05:42:51,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 363 transitions, 813 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:42:51,490 INFO L231 Difference]: Finished difference. Result has 358 places, 357 transitions, 754 flow [2025-02-08 05:42:51,491 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-02-08 05:42:51,491 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -17 predicate places. [2025-02-08 05:42:51,491 INFO L471 AbstractCegarLoop]: Abstraction has has 358 places, 357 transitions, 754 flow [2025-02-08 05:42:51,492 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-02-08 05:42:51,492 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:42:51,492 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-02-08 05:42:51,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:42:51,493 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-02-08 05:42:51,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:42:51,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1404673742, now seen corresponding path program 1 times [2025-02-08 05:42:51,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:42:51,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827926879] [2025-02-08 05:42:51,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:42:51,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:42:51,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-02-08 05:42:51,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-02-08 05:42:51,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:42:51,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:42:51,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:42:51,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:42:51,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827926879] [2025-02-08 05:42:51,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827926879] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:42:51,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:42:51,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:42:51,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977407993] [2025-02-08 05:42:51,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:42:51,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:42:51,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:42:51,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:42:51,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:42:51,578 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 404 out of 451 [2025-02-08 05:42:51,580 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-02-08 05:42:51,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:42:51,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 404 of 451 [2025-02-08 05:42:51,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:42:52,141 INFO L124 PetriNetUnfolderBase]: 1084/5580 cut-off events. [2025-02-08 05:42:52,142 INFO L125 PetriNetUnfolderBase]: For 45/48 co-relation queries the response was YES. [2025-02-08 05:42:52,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7423 conditions, 5580 events. 1084/5580 cut-off events. For 45/48 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 46488 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-02-08 05:42:52,170 INFO L140 encePairwiseOnDemand]: 444/451 looper letters, 33 selfloop transitions, 3 changer transitions 0/365 dead transitions. [2025-02-08 05:42:52,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 365 transitions, 845 flow [2025-02-08 05:42:52,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:42:52,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:42:52,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1252 transitions. [2025-02-08 05:42:52,173 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.925351071692535 [2025-02-08 05:42:52,173 INFO L175 Difference]: Start difference. First operand has 358 places, 357 transitions, 754 flow. Second operand 3 states and 1252 transitions. [2025-02-08 05:42:52,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 365 transitions, 845 flow [2025-02-08 05:42:52,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 365 transitions, 845 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:42:52,177 INFO L231 Difference]: Finished difference. Result has 357 places, 356 transitions, 767 flow [2025-02-08 05:42:52,178 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-02-08 05:42:52,178 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -18 predicate places. [2025-02-08 05:42:52,178 INFO L471 AbstractCegarLoop]: Abstraction has has 357 places, 356 transitions, 767 flow [2025-02-08 05:42:52,179 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-02-08 05:42:52,179 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:42:52,179 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-02-08 05:42:52,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:42:52,179 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-02-08 05:42:52,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:42:52,180 INFO L85 PathProgramCache]: Analyzing trace with hash -257074811, now seen corresponding path program 1 times [2025-02-08 05:42:52,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:42:52,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111238153] [2025-02-08 05:42:52,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:42:52,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:42:52,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-02-08 05:42:52,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-02-08 05:42:52,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:42:52,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:42:52,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:42:52,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:42:52,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111238153] [2025-02-08 05:42:52,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111238153] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:42:52,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:42:52,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:42:52,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476451632] [2025-02-08 05:42:52,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:42:52,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:42:52,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:42:52,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:42:52,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:42:52,282 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 451 [2025-02-08 05:42:52,284 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-02-08 05:42:52,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:42:52,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 451 [2025-02-08 05:42:52,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:42:52,976 INFO L124 PetriNetUnfolderBase]: 1280/6515 cut-off events. [2025-02-08 05:42:52,976 INFO L125 PetriNetUnfolderBase]: For 87/87 co-relation queries the response was YES. [2025-02-08 05:42:52,996 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 56085 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-02-08 05:42:53,015 INFO L140 encePairwiseOnDemand]: 440/451 looper letters, 40 selfloop transitions, 8 changer transitions 0/378 dead transitions. [2025-02-08 05:42:53,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 378 transitions, 913 flow [2025-02-08 05:42:53,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:42:53,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:42:53,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1275 transitions. [2025-02-08 05:42:53,018 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9423503325942351 [2025-02-08 05:42:53,018 INFO L175 Difference]: Start difference. First operand has 357 places, 356 transitions, 767 flow. Second operand 3 states and 1275 transitions. [2025-02-08 05:42:53,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 378 transitions, 913 flow [2025-02-08 05:42:53,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 378 transitions, 913 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:42:53,025 INFO L231 Difference]: Finished difference. Result has 361 places, 364 transitions, 837 flow [2025-02-08 05:42:53,026 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-02-08 05:42:53,026 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -14 predicate places. [2025-02-08 05:42:53,026 INFO L471 AbstractCegarLoop]: Abstraction has has 361 places, 364 transitions, 837 flow [2025-02-08 05:42:53,027 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-02-08 05:42:53,027 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:42:53,027 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-02-08 05:42:53,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:42:53,027 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-02-08 05:42:53,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:42:53,028 INFO L85 PathProgramCache]: Analyzing trace with hash 769873455, now seen corresponding path program 1 times [2025-02-08 05:42:53,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:42:53,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315388387] [2025-02-08 05:42:53,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:42:53,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:42:53,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-02-08 05:42:53,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-02-08 05:42:53,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:42:53,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:42:53,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:42:53,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:42:53,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315388387] [2025-02-08 05:42:53,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315388387] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:42:53,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:42:53,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:42:53,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141263998] [2025-02-08 05:42:53,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:42:53,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:42:53,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:42:53,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:42:53,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:42:53,339 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 451 [2025-02-08 05:42:53,342 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-02-08 05:42:53,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:42:53,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 451 [2025-02-08 05:42:53,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:42:55,078 INFO L124 PetriNetUnfolderBase]: 3184/14712 cut-off events. [2025-02-08 05:42:55,079 INFO L125 PetriNetUnfolderBase]: For 576/602 co-relation queries the response was YES. [2025-02-08 05:42:55,122 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 148630 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-02-08 05:42:55,169 INFO L140 encePairwiseOnDemand]: 441/451 looper letters, 41 selfloop transitions, 9 changer transitions 0/385 dead transitions. [2025-02-08 05:42:55,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 385 transitions, 985 flow [2025-02-08 05:42:55,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:42:55,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:42:55,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1275 transitions. [2025-02-08 05:42:55,172 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9423503325942351 [2025-02-08 05:42:55,172 INFO L175 Difference]: Start difference. First operand has 361 places, 364 transitions, 837 flow. Second operand 3 states and 1275 transitions. [2025-02-08 05:42:55,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 385 transitions, 985 flow [2025-02-08 05:42:55,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 385 transitions, 969 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:42:55,181 INFO L231 Difference]: Finished difference. Result has 363 places, 372 transitions, 891 flow [2025-02-08 05:42:55,182 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-02-08 05:42:55,183 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -12 predicate places. [2025-02-08 05:42:55,183 INFO L471 AbstractCegarLoop]: Abstraction has has 363 places, 372 transitions, 891 flow [2025-02-08 05:42:55,183 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-02-08 05:42:55,184 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:42:55,184 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-02-08 05:42:55,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:42:55,184 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-02-08 05:42:55,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:42:55,185 INFO L85 PathProgramCache]: Analyzing trace with hash -915503323, now seen corresponding path program 1 times [2025-02-08 05:42:55,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:42:55,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203353781] [2025-02-08 05:42:55,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:42:55,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:42:55,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-02-08 05:42:55,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-02-08 05:42:55,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:42:55,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:42:55,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:42:55,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:42:55,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203353781] [2025-02-08 05:42:55,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203353781] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:42:55,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:42:55,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:42:55,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983281265] [2025-02-08 05:42:55,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:42:55,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:42:55,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:42:55,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:42:55,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:42:55,413 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 451 [2025-02-08 05:42:55,415 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-02-08 05:42:55,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:42:55,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 451 [2025-02-08 05:42:55,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:42:56,725 INFO L124 PetriNetUnfolderBase]: 1981/10917 cut-off events. [2025-02-08 05:42:56,725 INFO L125 PetriNetUnfolderBase]: For 429/446 co-relation queries the response was YES. [2025-02-08 05:42:56,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15966 conditions, 10917 events. 1981/10917 cut-off events. For 429/446 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 108694 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-02-08 05:42:56,772 INFO L140 encePairwiseOnDemand]: 442/451 looper letters, 34 selfloop transitions, 8 changer transitions 0/386 dead transitions. [2025-02-08 05:42:56,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 386 transitions, 1002 flow [2025-02-08 05:42:56,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:42:56,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:42:56,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2509 transitions. [2025-02-08 05:42:56,777 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9271988174427199 [2025-02-08 05:42:56,777 INFO L175 Difference]: Start difference. First operand has 363 places, 372 transitions, 891 flow. Second operand 6 states and 2509 transitions. [2025-02-08 05:42:56,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 386 transitions, 1002 flow [2025-02-08 05:42:56,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 386 transitions, 984 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:42:56,786 INFO L231 Difference]: Finished difference. Result has 370 places, 376 transitions, 918 flow [2025-02-08 05:42:56,786 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-02-08 05:42:56,787 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -5 predicate places. [2025-02-08 05:42:56,787 INFO L471 AbstractCegarLoop]: Abstraction has has 370 places, 376 transitions, 918 flow [2025-02-08 05:42:56,788 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-02-08 05:42:56,788 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:42:56,788 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-02-08 05:42:56,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:42:56,789 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-02-08 05:42:56,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:42:56,789 INFO L85 PathProgramCache]: Analyzing trace with hash -322235664, now seen corresponding path program 1 times [2025-02-08 05:42:56,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:42:56,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532935847] [2025-02-08 05:42:56,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:42:56,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:42:56,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-02-08 05:42:56,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-02-08 05:42:56,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:42:56,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:42:56,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:42:56,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:42:56,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532935847] [2025-02-08 05:42:56,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532935847] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:42:56,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:42:56,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:42:56,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920051098] [2025-02-08 05:42:56,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:42:56,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:42:56,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:42:56,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:42:56,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:42:56,987 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 451 [2025-02-08 05:42:56,989 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-02-08 05:42:56,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:42:56,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 451 [2025-02-08 05:42:56,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:42:58,708 INFO L124 PetriNetUnfolderBase]: 2823/13670 cut-off events. [2025-02-08 05:42:58,708 INFO L125 PetriNetUnfolderBase]: For 1076/1122 co-relation queries the response was YES. [2025-02-08 05:42:58,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21044 conditions, 13670 events. 2823/13670 cut-off events. For 1076/1122 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 139222 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-02-08 05:42:58,783 INFO L140 encePairwiseOnDemand]: 446/451 looper letters, 38 selfloop transitions, 6 changer transitions 0/388 dead transitions. [2025-02-08 05:42:58,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 388 transitions, 1041 flow [2025-02-08 05:42:58,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:42:58,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:42:58,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1270 transitions. [2025-02-08 05:42:58,786 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9386548410938654 [2025-02-08 05:42:58,786 INFO L175 Difference]: Start difference. First operand has 370 places, 376 transitions, 918 flow. Second operand 3 states and 1270 transitions. [2025-02-08 05:42:58,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 388 transitions, 1041 flow [2025-02-08 05:42:58,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 388 transitions, 1037 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:42:58,794 INFO L231 Difference]: Finished difference. Result has 373 places, 381 transitions, 968 flow [2025-02-08 05:42:58,794 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-02-08 05:42:58,795 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -2 predicate places. [2025-02-08 05:42:58,795 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 381 transitions, 968 flow [2025-02-08 05:42:58,795 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-02-08 05:42:58,795 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:42:58,796 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-02-08 05:42:58,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:42:58,796 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-02-08 05:42:58,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:42:58,797 INFO L85 PathProgramCache]: Analyzing trace with hash -595084231, now seen corresponding path program 1 times [2025-02-08 05:42:58,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:42:58,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213947082] [2025-02-08 05:42:58,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:42:58,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:42:58,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-02-08 05:42:58,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-02-08 05:42:58,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:42:58,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:42:58,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:42:58,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:42:58,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213947082] [2025-02-08 05:42:58,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213947082] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:42:58,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:42:58,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:42:58,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550052371] [2025-02-08 05:42:58,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:42:58,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:42:58,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:42:58,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:42:58,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:42:59,055 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 451 [2025-02-08 05:42:59,057 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-02-08 05:42:59,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:42:59,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 451 [2025-02-08 05:42:59,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:00,859 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), 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), 244#L1045true, Black: 470#true, 464#(= |#race~datas_mutex~0| 0), 468#(= |#race~tids~0| 0), Black: 474#true]) [2025-02-08 05:43:00,860 INFO L294 olderBase$Statistics]: this new event has 377 ancestors and is cut-off event [2025-02-08 05:43:00,860 INFO L297 olderBase$Statistics]: existing Event has 377 ancestors and is cut-off event [2025-02-08 05:43:00,860 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2025-02-08 05:43:00,860 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2025-02-08 05:43:00,884 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), 161#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-02-08 05:43:00,884 INFO L294 olderBase$Statistics]: this new event has 375 ancestors and is cut-off event [2025-02-08 05:43:00,884 INFO L297 olderBase$Statistics]: existing Event has 292 ancestors and is cut-off event [2025-02-08 05:43:00,884 INFO L297 olderBase$Statistics]: existing Event has 292 ancestors and is cut-off event [2025-02-08 05:43:00,884 INFO L297 olderBase$Statistics]: existing Event has 375 ancestors and is cut-off event [2025-02-08 05:43:00,995 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), 161#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-02-08 05:43:00,995 INFO L294 olderBase$Statistics]: this new event has 396 ancestors and is cut-off event [2025-02-08 05:43:00,995 INFO L297 olderBase$Statistics]: existing Event has 375 ancestors and is cut-off event [2025-02-08 05:43:00,995 INFO L297 olderBase$Statistics]: existing Event has 375 ancestors and is cut-off event [2025-02-08 05:43:00,995 INFO L297 olderBase$Statistics]: existing Event has 375 ancestors and is cut-off event [2025-02-08 05:43:01,002 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), 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, 244#L1045true, 464#(= |#race~datas_mutex~0| 0), 468#(= |#race~tids~0| 0), Black: 476#(= |#race~threads_alive~0| 0)]) [2025-02-08 05:43:01,002 INFO L294 olderBase$Statistics]: this new event has 398 ancestors and is cut-off event [2025-02-08 05:43:01,002 INFO L297 olderBase$Statistics]: existing Event has 377 ancestors and is cut-off event [2025-02-08 05:43:01,002 INFO L297 olderBase$Statistics]: existing Event has 377 ancestors and is cut-off event [2025-02-08 05:43:01,002 INFO L297 olderBase$Statistics]: existing Event has 377 ancestors and is cut-off event [2025-02-08 05:43:01,048 INFO L124 PetriNetUnfolderBase]: 3011/14998 cut-off events. [2025-02-08 05:43:01,048 INFO L125 PetriNetUnfolderBase]: For 1417/1537 co-relation queries the response was YES. [2025-02-08 05:43:01,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23039 conditions, 14998 events. 3011/14998 cut-off events. For 1417/1537 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 155073 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-02-08 05:43:01,124 INFO L140 encePairwiseOnDemand]: 442/451 looper letters, 25 selfloop transitions, 4 changer transitions 17/393 dead transitions. [2025-02-08 05:43:01,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 393 transitions, 1079 flow [2025-02-08 05:43:01,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:43:01,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:43:01,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2510 transitions. [2025-02-08 05:43:01,127 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9275683665927569 [2025-02-08 05:43:01,127 INFO L175 Difference]: Start difference. First operand has 373 places, 381 transitions, 968 flow. Second operand 6 states and 2510 transitions. [2025-02-08 05:43:01,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 393 transitions, 1079 flow [2025-02-08 05:43:01,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 393 transitions, 1067 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:43:01,138 INFO L231 Difference]: Finished difference. Result has 378 places, 376 transitions, 943 flow [2025-02-08 05:43:01,139 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-02-08 05:43:01,139 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, 3 predicate places. [2025-02-08 05:43:01,139 INFO L471 AbstractCegarLoop]: Abstraction has has 378 places, 376 transitions, 943 flow [2025-02-08 05:43:01,140 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-02-08 05:43:01,140 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:01,141 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-02-08 05:43:01,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:43:01,141 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-02-08 05:43:01,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:01,142 INFO L85 PathProgramCache]: Analyzing trace with hash 131619928, now seen corresponding path program 1 times [2025-02-08 05:43:01,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:01,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843967207] [2025-02-08 05:43:01,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:01,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:01,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-02-08 05:43:01,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-02-08 05:43:01,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:01,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:01,851 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 05:43:01,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:43:01,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843967207] [2025-02-08 05:43:01,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843967207] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:01,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:01,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:43:01,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589202971] [2025-02-08 05:43:01,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:01,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:43:01,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:43:01,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:43:01,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:43:02,014 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 451 [2025-02-08 05:43:02,015 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-02-08 05:43:02,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:02,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 451 [2025-02-08 05:43:02,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:05,144 INFO L124 PetriNetUnfolderBase]: 6922/25387 cut-off events. [2025-02-08 05:43:05,144 INFO L125 PetriNetUnfolderBase]: For 5019/5258 co-relation queries the response was YES. [2025-02-08 05:43:05,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43841 conditions, 25387 events. 6922/25387 cut-off events. For 5019/5258 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 275186 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-02-08 05:43:05,311 INFO L140 encePairwiseOnDemand]: 437/451 looper letters, 90 selfloop transitions, 46 changer transitions 0/464 dead transitions. [2025-02-08 05:43:05,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 464 transitions, 1505 flow [2025-02-08 05:43:05,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:43:05,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:43:05,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2480 transitions. [2025-02-08 05:43:05,315 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9164818920916482 [2025-02-08 05:43:05,315 INFO L175 Difference]: Start difference. First operand has 378 places, 376 transitions, 943 flow. Second operand 6 states and 2480 transitions. [2025-02-08 05:43:05,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 464 transitions, 1505 flow [2025-02-08 05:43:05,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 464 transitions, 1477 flow, removed 7 selfloop flow, removed 9 redundant places. [2025-02-08 05:43:05,336 INFO L231 Difference]: Finished difference. Result has 374 places, 421 transitions, 1282 flow [2025-02-08 05:43:05,337 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-02-08 05:43:05,338 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -1 predicate places. [2025-02-08 05:43:05,338 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 421 transitions, 1282 flow [2025-02-08 05:43:05,340 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-02-08 05:43:05,340 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:05,340 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-02-08 05:43:05,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:43:05,340 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-02-08 05:43:05,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:05,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1378891686, now seen corresponding path program 1 times [2025-02-08 05:43:05,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:05,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437620837] [2025-02-08 05:43:05,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:05,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:05,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-02-08 05:43:05,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-02-08 05:43:05,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:05,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:05,659 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 05:43:05,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:43:05,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437620837] [2025-02-08 05:43:05,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437620837] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:05,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:05,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 05:43:05,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789160533] [2025-02-08 05:43:05,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:05,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 05:43:05,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:43:05,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 05:43:05,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 05:43:05,933 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 404 out of 451 [2025-02-08 05:43:05,936 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-02-08 05:43:05,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:05,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 404 of 451 [2025-02-08 05:43:05,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:09,750 INFO L124 PetriNetUnfolderBase]: 7191/30915 cut-off events. [2025-02-08 05:43:09,750 INFO L125 PetriNetUnfolderBase]: For 5018/5628 co-relation queries the response was YES. [2025-02-08 05:43:09,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53626 conditions, 30915 events. 7191/30915 cut-off events. For 5018/5628 co-relation queries the response was YES. Maximal size of possible extension queue 540. Compared 360556 event pairs, 3188 based on Foata normal form. 196/28035 useless extension candidates. Maximal degree in co-relation 53465. Up to 7705 conditions per place. [2025-02-08 05:43:09,953 INFO L140 encePairwiseOnDemand]: 439/451 looper letters, 58 selfloop transitions, 14 changer transitions 10/466 dead transitions. [2025-02-08 05:43:09,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 466 transitions, 1541 flow [2025-02-08 05:43:09,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 05:43:09,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 05:43:09,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4122 transitions. [2025-02-08 05:43:09,957 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9139689578713969 [2025-02-08 05:43:09,957 INFO L175 Difference]: Start difference. First operand has 374 places, 421 transitions, 1282 flow. Second operand 10 states and 4122 transitions. [2025-02-08 05:43:09,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 466 transitions, 1541 flow [2025-02-08 05:43:09,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 466 transitions, 1509 flow, removed 16 selfloop flow, removed 0 redundant places. [2025-02-08 05:43:09,997 INFO L231 Difference]: Finished difference. Result has 387 places, 428 transitions, 1317 flow [2025-02-08 05:43:09,997 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-02-08 05:43:09,998 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, 12 predicate places. [2025-02-08 05:43:09,998 INFO L471 AbstractCegarLoop]: Abstraction has has 387 places, 428 transitions, 1317 flow [2025-02-08 05:43:09,999 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-02-08 05:43:09,999 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:09,999 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:43:09,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:43:09,999 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-02-08 05:43:10,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:10,001 INFO L85 PathProgramCache]: Analyzing trace with hash 2116573703, now seen corresponding path program 1 times [2025-02-08 05:43:10,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:10,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630819716] [2025-02-08 05:43:10,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:10,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:10,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-02-08 05:43:10,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-02-08 05:43:10,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:10,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:10,496 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 05:43:10,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:43:10,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630819716] [2025-02-08 05:43:10,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630819716] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:10,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:10,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 05:43:10,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114872076] [2025-02-08 05:43:10,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:10,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 05:43:10,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:43:10,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 05:43:10,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 05:43:10,988 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 399 out of 451 [2025-02-08 05:43:10,991 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-02-08 05:43:10,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:10,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 399 of 451 [2025-02-08 05:43:10,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:13,079 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|), 161#L1029true, 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|)), 137#L1061-3true, 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), 443#true, 320#L1037true, 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-02-08 05:43:13,080 INFO L294 olderBase$Statistics]: this new event has 296 ancestors and is cut-off event [2025-02-08 05:43:13,080 INFO L297 olderBase$Statistics]: existing Event has 296 ancestors and is cut-off event [2025-02-08 05:43:13,080 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2025-02-08 05:43:13,080 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2025-02-08 05:43:13,109 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|)), 174#ULTIMATE.startFINALtrue, 209#L1036true, 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), 212#L1028-4true]) [2025-02-08 05:43:13,109 INFO L294 olderBase$Statistics]: this new event has 296 ancestors and is cut-off event [2025-02-08 05:43:13,109 INFO L297 olderBase$Statistics]: existing Event has 291 ancestors and is cut-off event [2025-02-08 05:43:13,109 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-02-08 05:43:13,109 INFO L297 olderBase$Statistics]: existing Event has 291 ancestors and is cut-off event [2025-02-08 05:43:13,172 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|)), 161#L1029true, 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|)), 137#L1061-3true, 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, 244#L1045true, 468#(= |#race~tids~0| 0), Black: 476#(= |#race~threads_alive~0| 0), Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 443#true, Black: 486#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 497#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 519#true, 509#true, 464#(= |#race~datas_mutex~0| 0)]) [2025-02-08 05:43:13,173 INFO L294 olderBase$Statistics]: this new event has 301 ancestors and is cut-off event [2025-02-08 05:43:13,173 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-02-08 05:43:13,173 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-02-08 05:43:13,173 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-02-08 05:43:15,667 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, 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)), 272#L1038true, 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), 519#true, Black: 495#true, 509#true, 464#(= |#race~datas_mutex~0| 0)]) [2025-02-08 05:43:15,667 INFO L294 olderBase$Statistics]: this new event has 407 ancestors and is cut-off event [2025-02-08 05:43:15,667 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is cut-off event [2025-02-08 05:43:15,667 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is cut-off event [2025-02-08 05:43:15,667 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is cut-off event [2025-02-08 05:43:15,675 INFO L124 PetriNetUnfolderBase]: 8449/33402 cut-off events. [2025-02-08 05:43:15,675 INFO L125 PetriNetUnfolderBase]: For 15729/17413 co-relation queries the response was YES. [2025-02-08 05:43:15,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66100 conditions, 33402 events. 8449/33402 cut-off events. For 15729/17413 co-relation queries the response was YES. Maximal size of possible extension queue 591. Compared 384215 event pairs, 2672 based on Foata normal form. 66/30544 useless extension candidates. Maximal degree in co-relation 65933. Up to 6265 conditions per place. [2025-02-08 05:43:15,882 INFO L140 encePairwiseOnDemand]: 438/451 looper letters, 95 selfloop transitions, 48 changer transitions 0/494 dead transitions. [2025-02-08 05:43:15,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 494 transitions, 1911 flow [2025-02-08 05:43:15,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 05:43:15,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 05:43:15,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 4477 transitions. [2025-02-08 05:43:15,886 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9024390243902439 [2025-02-08 05:43:15,886 INFO L175 Difference]: Start difference. First operand has 387 places, 428 transitions, 1317 flow. Second operand 11 states and 4477 transitions. [2025-02-08 05:43:15,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 494 transitions, 1911 flow [2025-02-08 05:43:15,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 393 places, 494 transitions, 1903 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 05:43:15,908 INFO L231 Difference]: Finished difference. Result has 397 places, 451 transitions, 1678 flow [2025-02-08 05:43:15,908 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-02-08 05:43:15,909 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, 22 predicate places. [2025-02-08 05:43:15,909 INFO L471 AbstractCegarLoop]: Abstraction has has 397 places, 451 transitions, 1678 flow [2025-02-08 05:43:15,910 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-02-08 05:43:15,910 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:15,910 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-02-08 05:43:15,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:43:15,910 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-02-08 05:43:15,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:15,911 INFO L85 PathProgramCache]: Analyzing trace with hash 929787512, now seen corresponding path program 1 times [2025-02-08 05:43:15,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:15,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599097893] [2025-02-08 05:43:15,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:15,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:15,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-02-08 05:43:15,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-02-08 05:43:15,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:15,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:16,646 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 05:43:16,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:43:16,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599097893] [2025-02-08 05:43:16,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599097893] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:16,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:16,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 05:43:16,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358781533] [2025-02-08 05:43:16,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:16,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 05:43:16,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:43:16,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 05:43:16,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-02-08 05:43:17,207 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 451 [2025-02-08 05:43:17,210 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-02-08 05:43:17,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:17,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 451 [2025-02-08 05:43:17,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:23,226 INFO L124 PetriNetUnfolderBase]: 11100/40058 cut-off events. [2025-02-08 05:43:23,226 INFO L125 PetriNetUnfolderBase]: For 45649/48876 co-relation queries the response was YES. [2025-02-08 05:43:23,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89050 conditions, 40058 events. 11100/40058 cut-off events. For 45649/48876 co-relation queries the response was YES. Maximal size of possible extension queue 641. Compared 466989 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-02-08 05:43:23,502 INFO L140 encePairwiseOnDemand]: 433/451 looper letters, 164 selfloop transitions, 57 changer transitions 0/554 dead transitions. [2025-02-08 05:43:23,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 554 transitions, 2679 flow [2025-02-08 05:43:23,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 05:43:23,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-08 05:43:23,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 5168 transitions. [2025-02-08 05:43:23,508 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8814600034112229 [2025-02-08 05:43:23,508 INFO L175 Difference]: Start difference. First operand has 397 places, 451 transitions, 1678 flow. Second operand 13 states and 5168 transitions. [2025-02-08 05:43:23,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 554 transitions, 2679 flow [2025-02-08 05:43:23,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 403 places, 554 transitions, 2646 flow, removed 11 selfloop flow, removed 6 redundant places. [2025-02-08 05:43:23,634 INFO L231 Difference]: Finished difference. Result has 407 places, 476 transitions, 2006 flow [2025-02-08 05:43:23,634 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-02-08 05:43:23,635 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, 32 predicate places. [2025-02-08 05:43:23,635 INFO L471 AbstractCegarLoop]: Abstraction has has 407 places, 476 transitions, 2006 flow [2025-02-08 05:43:23,636 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-02-08 05:43:23,636 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:23,636 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-02-08 05:43:23,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:43:23,636 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-02-08 05:43:23,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:23,637 INFO L85 PathProgramCache]: Analyzing trace with hash 494156638, now seen corresponding path program 1 times [2025-02-08 05:43:23,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:23,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992821713] [2025-02-08 05:43:23,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:23,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:23,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-02-08 05:43:23,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-02-08 05:43:23,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:23,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:23,688 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 05:43:23,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:43:23,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992821713] [2025-02-08 05:43:23,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992821713] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:23,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:23,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:43:23,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63283295] [2025-02-08 05:43:23,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:23,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:43:23,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:43:23,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:43:23,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:43:23,716 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 410 out of 451 [2025-02-08 05:43:23,717 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-02-08 05:43:23,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:23,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 410 of 451 [2025-02-08 05:43:23,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:43:26,888 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][298], [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#L1029true, 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))), 105#L1061true, 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), 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-02-08 05:43:26,888 INFO L294 olderBase$Statistics]: this new event has 335 ancestors and is cut-off event [2025-02-08 05:43:26,888 INFO L297 olderBase$Statistics]: existing Event has 335 ancestors and is cut-off event [2025-02-08 05:43:26,888 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-02-08 05:43:26,889 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-02-08 05:43:27,352 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|)), 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), 244#L1045true, 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: 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, 76#L1063-1true, 464#(= |#race~datas_mutex~0| 0)]) [2025-02-08 05:43:27,352 INFO L294 olderBase$Statistics]: this new event has 346 ancestors and is cut-off event [2025-02-08 05:43:27,352 INFO L297 olderBase$Statistics]: existing Event has 263 ancestors and is cut-off event [2025-02-08 05:43:27,352 INFO L297 olderBase$Statistics]: existing Event has 263 ancestors and is cut-off event [2025-02-08 05:43:27,352 INFO L297 olderBase$Statistics]: existing Event has 346 ancestors and is cut-off event [2025-02-08 05:43:27,389 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|)), 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, 244#L1045true, 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-02-08 05:43:27,389 INFO L294 olderBase$Statistics]: this new event has 347 ancestors and is cut-off event [2025-02-08 05:43:27,389 INFO L297 olderBase$Statistics]: existing Event has 347 ancestors and is cut-off event [2025-02-08 05:43:27,389 INFO L297 olderBase$Statistics]: existing Event has 264 ancestors and is cut-off event [2025-02-08 05:43:27,389 INFO L297 olderBase$Statistics]: existing Event has 264 ancestors and is cut-off event [2025-02-08 05:43:27,460 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|)), 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), 244#L1045true, 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))), 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, 160#L1065-3true, 576#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 509#true, 464#(= |#race~datas_mutex~0| 0)]) [2025-02-08 05:43:27,460 INFO L294 olderBase$Statistics]: this new event has 349 ancestors and is cut-off event [2025-02-08 05:43:27,460 INFO L297 olderBase$Statistics]: existing Event has 266 ancestors and is cut-off event [2025-02-08 05:43:27,460 INFO L297 olderBase$Statistics]: existing Event has 349 ancestors and is cut-off event [2025-02-08 05:43:27,460 INFO L297 olderBase$Statistics]: existing Event has 266 ancestors and is cut-off event [2025-02-08 05:43:27,498 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|)), 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), 244#L1045true, 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: 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-02-08 05:43:27,498 INFO L294 olderBase$Statistics]: this new event has 350 ancestors and is cut-off event [2025-02-08 05:43:27,498 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2025-02-08 05:43:27,498 INFO L297 olderBase$Statistics]: existing Event has 350 ancestors and is cut-off event [2025-02-08 05:43:27,498 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2025-02-08 05:43:27,849 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|)), 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|)), 213#L1067true, 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), 244#L1045true, 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-02-08 05:43:27,849 INFO L294 olderBase$Statistics]: this new event has 359 ancestors and is cut-off event [2025-02-08 05:43:27,850 INFO L297 olderBase$Statistics]: existing Event has 276 ancestors and is cut-off event [2025-02-08 05:43:27,850 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2025-02-08 05:43:27,850 INFO L297 olderBase$Statistics]: existing Event has 276 ancestors and is cut-off event [2025-02-08 05:43:27,915 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|)), 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), 244#L1045true, 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), 162#L1068-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)), 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-02-08 05:43:27,915 INFO L294 olderBase$Statistics]: this new event has 361 ancestors and is cut-off event [2025-02-08 05:43:27,915 INFO L297 olderBase$Statistics]: existing Event has 278 ancestors and is cut-off event [2025-02-08 05:43:27,915 INFO L297 olderBase$Statistics]: existing Event has 278 ancestors and is cut-off event [2025-02-08 05:43:27,915 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2025-02-08 05:43:27,999 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|)), 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#L1069-2true, 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), 244#L1045true, 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-02-08 05:43:27,999 INFO L294 olderBase$Statistics]: this new event has 364 ancestors and is cut-off event [2025-02-08 05:43:27,999 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-02-08 05:43:27,999 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-02-08 05:43:27,999 INFO L297 olderBase$Statistics]: existing Event has 364 ancestors and is cut-off event [2025-02-08 05:43:28,011 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|)), 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, 277#L1070true, 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), 244#L1045true, 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-02-08 05:43:28,012 INFO L294 olderBase$Statistics]: this new event has 364 ancestors and is cut-off event [2025-02-08 05:43:28,012 INFO L297 olderBase$Statistics]: existing Event has 364 ancestors and is cut-off event [2025-02-08 05:43:28,012 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-02-08 05:43:28,012 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-02-08 05:43:28,030 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|)), 161#L1029true, 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: 466#true, Black: 525#(= |cleanerThread1of1ForFork0_#t~mem7| 0), 398#L1061-7true, 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), 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), 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, 464#(= |#race~datas_mutex~0| 0)]) [2025-02-08 05:43:28,030 INFO L294 olderBase$Statistics]: this new event has 362 ancestors and is cut-off event [2025-02-08 05:43:28,030 INFO L297 olderBase$Statistics]: existing Event has 279 ancestors and is cut-off event [2025-02-08 05:43:28,030 INFO L297 olderBase$Statistics]: existing Event has 362 ancestors and is cut-off event [2025-02-08 05:43:28,030 INFO L297 olderBase$Statistics]: existing Event has 279 ancestors and is cut-off event [2025-02-08 05:43:28,031 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|)), 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), 244#L1045true, 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-02-08 05:43:28,031 INFO L294 olderBase$Statistics]: this new event has 365 ancestors and is cut-off event [2025-02-08 05:43:28,031 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-02-08 05:43:28,031 INFO L297 olderBase$Statistics]: existing Event has 365 ancestors and is cut-off event [2025-02-08 05:43:28,031 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-02-08 05:43:28,060 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|)), 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), 244#L1045true, 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: 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))), 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-02-08 05:43:28,061 INFO L294 olderBase$Statistics]: this new event has 368 ancestors and is cut-off event [2025-02-08 05:43:28,061 INFO L297 olderBase$Statistics]: existing Event has 347 ancestors and is cut-off event [2025-02-08 05:43:28,061 INFO L297 olderBase$Statistics]: existing Event has 264 ancestors and is cut-off event [2025-02-08 05:43:28,061 INFO L297 olderBase$Statistics]: existing Event has 264 ancestors and is cut-off event [2025-02-08 05:43:28,061 INFO L297 olderBase$Statistics]: existing Event has 347 ancestors and is cut-off event [2025-02-08 05:43:28,061 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|)), 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), 244#L1045true, 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: 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))), 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))), 76#L1063-1true, 464#(= |#race~datas_mutex~0| 0)]) [2025-02-08 05:43:28,061 INFO L294 olderBase$Statistics]: this new event has 367 ancestors and is cut-off event [2025-02-08 05:43:28,061 INFO L297 olderBase$Statistics]: existing Event has 346 ancestors and is cut-off event [2025-02-08 05:43:28,061 INFO L297 olderBase$Statistics]: existing Event has 263 ancestors and is cut-off event [2025-02-08 05:43:28,061 INFO L297 olderBase$Statistics]: existing Event has 263 ancestors and is cut-off event [2025-02-08 05:43:28,061 INFO L297 olderBase$Statistics]: existing Event has 346 ancestors and is cut-off event [2025-02-08 05:43:28,148 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|)), 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), 244#L1045true, 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, 160#L1065-3true, 576#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 464#(= |#race~datas_mutex~0| 0)]) [2025-02-08 05:43:28,148 INFO L294 olderBase$Statistics]: this new event has 370 ancestors and is cut-off event [2025-02-08 05:43:28,148 INFO L297 olderBase$Statistics]: existing Event has 266 ancestors and is cut-off event [2025-02-08 05:43:28,148 INFO L297 olderBase$Statistics]: existing Event has 349 ancestors and is cut-off event [2025-02-08 05:43:28,148 INFO L297 olderBase$Statistics]: existing Event has 349 ancestors and is cut-off event [2025-02-08 05:43:28,148 INFO L297 olderBase$Statistics]: existing Event has 266 ancestors and is cut-off event [2025-02-08 05:43:28,172 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|)), 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, 21#L1065true, 244#L1045true, 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-02-08 05:43:28,173 INFO L294 olderBase$Statistics]: this new event has 371 ancestors and is cut-off event [2025-02-08 05:43:28,173 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2025-02-08 05:43:28,173 INFO L297 olderBase$Statistics]: existing Event has 350 ancestors and is cut-off event [2025-02-08 05:43:28,173 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2025-02-08 05:43:28,173 INFO L297 olderBase$Statistics]: existing Event has 350 ancestors and is cut-off event [2025-02-08 05:43:28,358 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|)), 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|)), 213#L1067true, 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), 244#L1045true, 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-02-08 05:43:28,358 INFO L294 olderBase$Statistics]: this new event has 380 ancestors and is cut-off event [2025-02-08 05:43:28,358 INFO L297 olderBase$Statistics]: existing Event has 276 ancestors and is cut-off event [2025-02-08 05:43:28,358 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2025-02-08 05:43:28,358 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2025-02-08 05:43:28,359 INFO L297 olderBase$Statistics]: existing Event has 276 ancestors and is cut-off event [2025-02-08 05:43:28,376 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|)), 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), 244#L1045true, 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), 162#L1068-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)), 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-02-08 05:43:28,376 INFO L294 olderBase$Statistics]: this new event has 382 ancestors and is cut-off event [2025-02-08 05:43:28,376 INFO L297 olderBase$Statistics]: existing Event has 278 ancestors and is cut-off event [2025-02-08 05:43:28,376 INFO L297 olderBase$Statistics]: existing Event has 278 ancestors and is cut-off event [2025-02-08 05:43:28,376 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2025-02-08 05:43:28,376 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2025-02-08 05:43:28,605 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|)), 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#L1069-2true, 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), 244#L1045true, 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: 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-02-08 05:43:28,605 INFO L294 olderBase$Statistics]: this new event has 385 ancestors and is cut-off event [2025-02-08 05:43:28,605 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-02-08 05:43:28,605 INFO L297 olderBase$Statistics]: existing Event has 364 ancestors and is cut-off event [2025-02-08 05:43:28,605 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-02-08 05:43:28,605 INFO L297 olderBase$Statistics]: existing Event has 364 ancestors and is cut-off event [2025-02-08 05:43:28,607 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|)), 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, 277#L1070true, 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), 244#L1045true, 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: 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-02-08 05:43:28,607 INFO L294 olderBase$Statistics]: this new event has 385 ancestors and is cut-off event [2025-02-08 05:43:28,607 INFO L297 olderBase$Statistics]: existing Event has 364 ancestors and is cut-off event [2025-02-08 05:43:28,607 INFO L297 olderBase$Statistics]: existing Event has 364 ancestors and is cut-off event [2025-02-08 05:43:28,607 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-02-08 05:43:28,607 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-02-08 05:43:28,625 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|)), 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), 244#L1045true, 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: 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))), 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-02-08 05:43:28,626 INFO L294 olderBase$Statistics]: this new event has 386 ancestors and is cut-off event [2025-02-08 05:43:28,626 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-02-08 05:43:28,626 INFO L297 olderBase$Statistics]: existing Event has 365 ancestors and is cut-off event [2025-02-08 05:43:28,626 INFO L297 olderBase$Statistics]: existing Event has 365 ancestors and is cut-off event [2025-02-08 05:43:28,626 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-02-08 05:43:28,662 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([564] 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|)), 161#L1029true, 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: 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), 244#L1045true, 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), 73#L1071true, 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, 509#true, 464#(= |#race~datas_mutex~0| 0), 563#(not (= ~datas~0.base ~tids~0.base))]) [2025-02-08 05:43:28,662 INFO L294 olderBase$Statistics]: this new event has 384 ancestors and is cut-off event [2025-02-08 05:43:28,662 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-02-08 05:43:28,662 INFO L297 olderBase$Statistics]: existing Event has 363 ancestors and is cut-off event [2025-02-08 05:43:28,662 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-02-08 05:43:28,833 INFO L124 PetriNetUnfolderBase]: 7066/33169 cut-off events. [2025-02-08 05:43:28,834 INFO L125 PetriNetUnfolderBase]: For 22936/24921 co-relation queries the response was YES. [2025-02-08 05:43:29,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68565 conditions, 33169 events. 7066/33169 cut-off events. For 22936/24921 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 404856 event pairs, 2856 based on Foata normal form. 159/30211 useless extension candidates. Maximal degree in co-relation 68391. Up to 6925 conditions per place. [2025-02-08 05:43:29,090 INFO L140 encePairwiseOnDemand]: 445/451 looper letters, 36 selfloop transitions, 7 changer transitions 0/488 dead transitions. [2025-02-08 05:43:29,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 488 transitions, 2125 flow [2025-02-08 05:43:29,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:43:29,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:43:29,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1268 transitions. [2025-02-08 05:43:29,092 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9371766444937176 [2025-02-08 05:43:29,092 INFO L175 Difference]: Start difference. First operand has 407 places, 476 transitions, 2006 flow. Second operand 3 states and 1268 transitions. [2025-02-08 05:43:29,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 488 transitions, 2125 flow [2025-02-08 05:43:29,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 403 places, 488 transitions, 2104 flow, removed 5 selfloop flow, removed 6 redundant places. [2025-02-08 05:43:29,194 INFO L231 Difference]: Finished difference. Result has 405 places, 481 transitions, 2041 flow [2025-02-08 05:43:29,194 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-02-08 05:43:29,195 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, 30 predicate places. [2025-02-08 05:43:29,195 INFO L471 AbstractCegarLoop]: Abstraction has has 405 places, 481 transitions, 2041 flow [2025-02-08 05:43:29,195 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-02-08 05:43:29,195 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:43:29,196 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-02-08 05:43:29,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 05:43:29,196 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-02-08 05:43:29,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:43:29,196 INFO L85 PathProgramCache]: Analyzing trace with hash -629987368, now seen corresponding path program 1 times [2025-02-08 05:43:29,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:43:29,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117353792] [2025-02-08 05:43:29,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:43:29,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:43:29,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-02-08 05:43:29,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-02-08 05:43:29,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:43:29,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:43:29,290 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 05:43:29,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:43:29,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117353792] [2025-02-08 05:43:29,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117353792] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:43:29,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:43:29,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:43:29,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134214200] [2025-02-08 05:43:29,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:43:29,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:43:29,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:43:29,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:43:29,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:43:29,339 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 398 out of 451 [2025-02-08 05:43:29,340 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-02-08 05:43:29,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:43:29,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 398 of 451 [2025-02-08 05:43:29,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand