./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 551b0097 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-?-551b009-m [2025-01-09 21:36:08,125 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:36:08,206 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:36:08,217 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:36:08,218 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:36:08,247 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:36:08,248 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:36:08,249 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:36:08,249 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:36:08,250 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:36:08,250 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:36:08,251 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:36:08,251 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:36:08,251 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:36:08,252 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:36:08,252 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:36:08,252 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:36:08,252 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:36:08,252 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:36:08,252 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:36:08,252 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:36:08,252 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:36:08,252 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:36:08,252 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:36:08,253 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:36:08,253 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:36:08,253 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:36:08,253 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:36:08,253 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:36:08,253 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:36:08,253 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:36:08,253 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:36:08,253 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:36:08,254 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:36:08,254 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:36:08,254 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:36:08,254 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:36:08,255 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:36:08,255 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:36:08,255 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:36:08,255 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:36:08,255 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:36:08,255 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:36:08,255 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:36:08,255 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:36:08,255 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:36:08,255 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-01-09 21:36:08,578 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:36:08,588 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:36:08,590 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:36:08,591 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:36:08,592 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:36:08,593 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-01-09 21:36:09,909 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/17af7e666/1757cbd9bb9849b3b1f0999d6cd16d88/FLAGca0199a9d [2025-01-09 21:36:10,307 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:36:10,308 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-01-09 21:36:10,328 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/17af7e666/1757cbd9bb9849b3b1f0999d6cd16d88/FLAGca0199a9d [2025-01-09 21:36:10,346 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/17af7e666/1757cbd9bb9849b3b1f0999d6cd16d88 [2025-01-09 21:36:10,349 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:36:10,351 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:36:10,352 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:36:10,353 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:36:10,356 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:36:10,358 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:36:10" (1/1) ... [2025-01-09 21:36:10,359 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@237cd493 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:10, skipping insertion in model container [2025-01-09 21:36:10,360 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:36:10" (1/1) ... [2025-01-09 21:36:10,399 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:36:10,891 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:36:10,916 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:36:10,963 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:36:11,035 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:36:11,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:11 WrapperNode [2025-01-09 21:36:11,038 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:36:11,039 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:36:11,039 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:36:11,039 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:36:11,043 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:11" (1/1) ... [2025-01-09 21:36:11,063 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:11" (1/1) ... [2025-01-09 21:36:11,092 INFO L138 Inliner]: procedures = 267, calls = 34, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 262 [2025-01-09 21:36:11,093 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:36:11,093 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:36:11,093 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:36:11,093 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:36:11,100 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:11" (1/1) ... [2025-01-09 21:36:11,101 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:11" (1/1) ... [2025-01-09 21:36:11,107 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:11" (1/1) ... [2025-01-09 21:36:11,107 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:11" (1/1) ... [2025-01-09 21:36:11,121 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:11" (1/1) ... [2025-01-09 21:36:11,123 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:11" (1/1) ... [2025-01-09 21:36:11,126 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:11" (1/1) ... [2025-01-09 21:36:11,129 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:11" (1/1) ... [2025-01-09 21:36:11,130 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:11" (1/1) ... [2025-01-09 21:36:11,140 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:36:11,141 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:36:11,141 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:36:11,141 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:36:11,142 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:11" (1/1) ... [2025-01-09 21:36:11,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:36:11,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:36:11,175 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-01-09 21:36:11,177 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-01-09 21:36:11,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 21:36:11,197 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 21:36:11,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:36:11,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:36:11,197 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 21:36:11,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:36:11,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:36:11,198 INFO L130 BoogieDeclarations]: Found specification of procedure cleaner [2025-01-09 21:36:11,198 INFO L138 BoogieDeclarations]: Found implementation of procedure cleaner [2025-01-09 21:36:11,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:36:11,198 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-01-09 21:36:11,199 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-01-09 21:36:11,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:36:11,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:36:11,200 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:36:11,368 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:36:11,370 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:36:11,835 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:36:11,835 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:36:11,875 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:36:11,876 INFO L312 CfgBuilder]: Removed 5 assume(true) statements. [2025-01-09 21:36:11,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:36:11 BoogieIcfgContainer [2025-01-09 21:36:11,876 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:36:11,878 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:36:11,878 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:36:11,882 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:36:11,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:36:10" (1/3) ... [2025-01-09 21:36:11,884 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24b0cbe6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:36:11, skipping insertion in model container [2025-01-09 21:36:11,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:11" (2/3) ... [2025-01-09 21:36:11,885 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24b0cbe6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:36:11, skipping insertion in model container [2025-01-09 21:36:11,885 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:36:11" (3/3) ... [2025-01-09 21:36:11,886 INFO L128 eAbstractionObserver]: Analyzing ICFG per-thread-array-join-counter-race-4.i [2025-01-09 21:36:11,899 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:36:11,900 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-01-09 21:36:11,901 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:36:12,008 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 21:36:12,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 444 places, 451 transitions, 916 flow [2025-01-09 21:36:12,304 INFO L124 PetriNetUnfolderBase]: 19/567 cut-off events. [2025-01-09 21:36:12,307 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:36:12,323 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 865 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-01-09 21:36:12,324 INFO L82 GeneralOperation]: Start removeDead. Operand has 444 places, 451 transitions, 916 flow [2025-01-09 21:36:12,336 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 375 places, 379 transitions, 768 flow [2025-01-09 21:36:12,347 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:36:12,359 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;@2df6e8d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:36:12,359 INFO L334 AbstractCegarLoop]: Starting to check reachability of 51 error locations. [2025-01-09 21:36:12,378 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:36:12,378 INFO L124 PetriNetUnfolderBase]: 0/139 cut-off events. [2025-01-09 21:36:12,378 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:36:12,379 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:12,379 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-01-09 21:36:12,380 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:36:12,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:12,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1822646876, now seen corresponding path program 1 times [2025-01-09 21:36:12,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:12,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239366610] [2025-01-09 21:36:12,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:12,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:12,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 21:36:12,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 21:36:12,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:12,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:12,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:36:12,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:12,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239366610] [2025-01-09 21:36:12,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239366610] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:12,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:12,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:36:12,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257450611] [2025-01-09 21:36:12,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:12,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:36:12,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:12,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:36:12,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:36:12,919 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 451 [2025-01-09 21:36:12,925 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-01-09 21:36:12,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:12,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 451 [2025-01-09 21:36:12,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:13,721 INFO L124 PetriNetUnfolderBase]: 384/2882 cut-off events. [2025-01-09 21:36:13,722 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-01-09 21:36:13,730 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 48. Compared 20132 event pairs, 264 based on Foata normal form. 97/2496 useless extension candidates. Maximal degree in co-relation 3291. Up to 604 conditions per place. [2025-01-09 21:36:13,744 INFO L140 encePairwiseOnDemand]: 442/451 looper letters, 26 selfloop transitions, 2 changer transitions 1/370 dead transitions. [2025-01-09 21:36:13,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 370 transitions, 806 flow [2025-01-09 21:36:13,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:36:13,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:36:13,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1259 transitions. [2025-01-09 21:36:13,765 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9305247597930525 [2025-01-09 21:36:13,766 INFO L175 Difference]: Start difference. First operand has 375 places, 379 transitions, 768 flow. Second operand 3 states and 1259 transitions. [2025-01-09 21:36:13,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 370 transitions, 806 flow [2025-01-09 21:36:13,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 370 transitions, 805 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:36:13,782 INFO L231 Difference]: Finished difference. Result has 372 places, 369 transitions, 751 flow [2025-01-09 21:36:13,787 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-01-09 21:36:13,791 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -3 predicate places. [2025-01-09 21:36:13,791 INFO L471 AbstractCegarLoop]: Abstraction has has 372 places, 369 transitions, 751 flow [2025-01-09 21:36:13,792 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-01-09 21:36:13,793 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:13,793 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-01-09 21:36:13,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:36:13,793 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:36:13,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:13,795 INFO L85 PathProgramCache]: Analyzing trace with hash -828244243, now seen corresponding path program 1 times [2025-01-09 21:36:13,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:13,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369536180] [2025-01-09 21:36:13,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:13,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:13,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 21:36:13,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 21:36:13,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:13,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:13,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:36:13,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:13,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369536180] [2025-01-09 21:36:13,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369536180] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:13,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:13,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:36:13,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999619090] [2025-01-09 21:36:13,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:13,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:36:13,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:13,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:36:13,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:36:14,042 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 398 out of 451 [2025-01-09 21:36:14,044 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-01-09 21:36:14,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:14,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 398 of 451 [2025-01-09 21:36:14,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:14,583 INFO L124 PetriNetUnfolderBase]: 405/2952 cut-off events. [2025-01-09 21:36:14,583 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2025-01-09 21:36:14,595 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 60. Compared 20770 event pairs, 305 based on Foata normal form. 0/2544 useless extension candidates. Maximal degree in co-relation 3503. Up to 667 conditions per place. [2025-01-09 21:36:14,610 INFO L140 encePairwiseOnDemand]: 443/451 looper letters, 29 selfloop transitions, 1 changer transitions 0/362 dead transitions. [2025-01-09 21:36:14,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 362 transitions, 797 flow [2025-01-09 21:36:14,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:36:14,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:36:14,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1231 transitions. [2025-01-09 21:36:14,616 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.909830007390983 [2025-01-09 21:36:14,616 INFO L175 Difference]: Start difference. First operand has 372 places, 369 transitions, 751 flow. Second operand 3 states and 1231 transitions. [2025-01-09 21:36:14,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 362 transitions, 797 flow [2025-01-09 21:36:14,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 362 transitions, 793 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:36:14,625 INFO L231 Difference]: Finished difference. Result has 364 places, 362 transitions, 735 flow [2025-01-09 21:36:14,625 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-01-09 21:36:14,626 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -11 predicate places. [2025-01-09 21:36:14,626 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 362 transitions, 735 flow [2025-01-09 21:36:14,627 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-01-09 21:36:14,627 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:14,627 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-01-09 21:36:14,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:36:14,630 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:36:14,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:14,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1245692653, now seen corresponding path program 1 times [2025-01-09 21:36:14,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:14,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700317704] [2025-01-09 21:36:14,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:14,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:14,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 21:36:14,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 21:36:14,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:14,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:14,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:36:14,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:14,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700317704] [2025-01-09 21:36:14,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700317704] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:14,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:14,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:36:14,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377142935] [2025-01-09 21:36:14,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:14,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:36:14,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:14,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:36:14,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:36:14,862 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 451 [2025-01-09 21:36:14,864 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-01-09 21:36:14,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:14,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 451 [2025-01-09 21:36:14,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:15,284 INFO L124 PetriNetUnfolderBase]: 432/2983 cut-off events. [2025-01-09 21:36:15,285 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-01-09 21:36:15,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3687 conditions, 2983 events. 432/2983 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 21420 event pairs, 299 based on Foata normal form. 0/2536 useless extension candidates. Maximal degree in co-relation 3538. Up to 673 conditions per place. [2025-01-09 21:36:15,316 INFO L140 encePairwiseOnDemand]: 448/451 looper letters, 22 selfloop transitions, 2 changer transitions 0/361 dead transitions. [2025-01-09 21:36:15,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 361 transitions, 781 flow [2025-01-09 21:36:15,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:36:15,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:36:15,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1261 transitions. [2025-01-09 21:36:15,321 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9320029563932003 [2025-01-09 21:36:15,321 INFO L175 Difference]: Start difference. First operand has 364 places, 362 transitions, 735 flow. Second operand 3 states and 1261 transitions. [2025-01-09 21:36:15,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 361 transitions, 781 flow [2025-01-09 21:36:15,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 361 transitions, 780 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:36:15,326 INFO L231 Difference]: Finished difference. Result has 364 places, 361 transitions, 736 flow [2025-01-09 21:36:15,326 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-01-09 21:36:15,327 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -11 predicate places. [2025-01-09 21:36:15,327 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 361 transitions, 736 flow [2025-01-09 21:36:15,328 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-01-09 21:36:15,329 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:15,330 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-01-09 21:36:15,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:36:15,330 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:36:15,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:15,331 INFO L85 PathProgramCache]: Analyzing trace with hash 698338841, now seen corresponding path program 1 times [2025-01-09 21:36:15,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:15,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470079366] [2025-01-09 21:36:15,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:15,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:15,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 21:36:15,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 21:36:15,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:15,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:15,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:36:15,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:15,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470079366] [2025-01-09 21:36:15,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470079366] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:15,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:15,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:36:15,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262972707] [2025-01-09 21:36:15,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:15,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:36:15,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:15,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:36:15,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:36:15,506 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 410 out of 451 [2025-01-09 21:36:15,507 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-01-09 21:36:15,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:15,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 410 of 451 [2025-01-09 21:36:15,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:16,002 INFO L124 PetriNetUnfolderBase]: 565/3891 cut-off events. [2025-01-09 21:36:16,003 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-01-09 21:36:16,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4806 conditions, 3891 events. 565/3891 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 30166 event pairs, 413 based on Foata normal form. 0/3325 useless extension candidates. Maximal degree in co-relation 4657. Up to 875 conditions per place. [2025-01-09 21:36:16,090 INFO L140 encePairwiseOnDemand]: 448/451 looper letters, 23 selfloop transitions, 2 changer transitions 0/360 dead transitions. [2025-01-09 21:36:16,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 360 transitions, 784 flow [2025-01-09 21:36:16,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:36:16,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:36:16,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1256 transitions. [2025-01-09 21:36:16,093 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9283074648928308 [2025-01-09 21:36:16,093 INFO L175 Difference]: Start difference. First operand has 364 places, 361 transitions, 736 flow. Second operand 3 states and 1256 transitions. [2025-01-09 21:36:16,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 360 transitions, 784 flow [2025-01-09 21:36:16,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 360 transitions, 780 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:36:16,099 INFO L231 Difference]: Finished difference. Result has 363 places, 360 transitions, 734 flow [2025-01-09 21:36:16,100 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-01-09 21:36:16,102 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -12 predicate places. [2025-01-09 21:36:16,102 INFO L471 AbstractCegarLoop]: Abstraction has has 363 places, 360 transitions, 734 flow [2025-01-09 21:36:16,103 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-01-09 21:36:16,103 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:16,104 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-01-09 21:36:16,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:36:16,104 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:36:16,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:16,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1671367696, now seen corresponding path program 1 times [2025-01-09 21:36:16,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:16,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546911668] [2025-01-09 21:36:16,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:16,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:16,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-01-09 21:36:16,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-01-09 21:36:16,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:16,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:16,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:36:16,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:16,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546911668] [2025-01-09 21:36:16,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546911668] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:16,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:16,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:36:16,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379557500] [2025-01-09 21:36:16,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:16,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:36:16,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:16,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:36:16,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:36:16,285 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 451 [2025-01-09 21:36:16,287 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-01-09 21:36:16,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:16,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 451 [2025-01-09 21:36:16,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:16,863 INFO L124 PetriNetUnfolderBase]: 717/3499 cut-off events. [2025-01-09 21:36:16,863 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-01-09 21:36:16,873 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 25591 event pairs, 505 based on Foata normal form. 0/2898 useless extension candidates. Maximal degree in co-relation 4467. Up to 1075 conditions per place. [2025-01-09 21:36:16,890 INFO L140 encePairwiseOnDemand]: 448/451 looper letters, 24 selfloop transitions, 2 changer transitions 0/359 dead transitions. [2025-01-09 21:36:16,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 359 transitions, 784 flow [2025-01-09 21:36:16,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:36:16,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:36:16,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1254 transitions. [2025-01-09 21:36:16,897 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.926829268292683 [2025-01-09 21:36:16,897 INFO L175 Difference]: Start difference. First operand has 363 places, 360 transitions, 734 flow. Second operand 3 states and 1254 transitions. [2025-01-09 21:36:16,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 359 transitions, 784 flow [2025-01-09 21:36:16,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 359 transitions, 780 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:36:16,904 INFO L231 Difference]: Finished difference. Result has 362 places, 359 transitions, 732 flow [2025-01-09 21:36:16,905 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-01-09 21:36:16,908 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -13 predicate places. [2025-01-09 21:36:16,908 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 359 transitions, 732 flow [2025-01-09 21:36:16,909 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-01-09 21:36:16,909 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:16,909 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-01-09 21:36:16,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:36:16,909 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:36:16,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:16,912 INFO L85 PathProgramCache]: Analyzing trace with hash -535542056, now seen corresponding path program 1 times [2025-01-09 21:36:16,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:16,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064519575] [2025-01-09 21:36:16,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:16,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:16,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-01-09 21:36:16,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-01-09 21:36:16,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:16,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:17,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:36:17,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:17,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064519575] [2025-01-09 21:36:17,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064519575] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:17,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:17,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:36:17,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269675119] [2025-01-09 21:36:17,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:17,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:36:17,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:17,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:36:17,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:36:17,062 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 401 out of 451 [2025-01-09 21:36:17,063 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-01-09 21:36:17,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:17,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 401 of 451 [2025-01-09 21:36:17,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:17,659 INFO L124 PetriNetUnfolderBase]: 1108/3870 cut-off events. [2025-01-09 21:36:17,659 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2025-01-09 21:36:17,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5580 conditions, 3870 events. 1108/3870 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 27587 event pairs, 465 based on Foata normal form. 0/3418 useless extension candidates. Maximal degree in co-relation 5432. Up to 1645 conditions per place. [2025-01-09 21:36:17,683 INFO L140 encePairwiseOnDemand]: 443/451 looper letters, 34 selfloop transitions, 3 changer transitions 0/365 dead transitions. [2025-01-09 21:36:17,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 365 transitions, 823 flow [2025-01-09 21:36:17,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:36:17,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:36:17,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1245 transitions. [2025-01-09 21:36:17,686 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9201773835920177 [2025-01-09 21:36:17,686 INFO L175 Difference]: Start difference. First operand has 362 places, 359 transitions, 732 flow. Second operand 3 states and 1245 transitions. [2025-01-09 21:36:17,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 365 transitions, 823 flow [2025-01-09 21:36:17,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 365 transitions, 819 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:36:17,692 INFO L231 Difference]: Finished difference. Result has 358 places, 357 transitions, 739 flow [2025-01-09 21:36:17,693 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-01-09 21:36:17,694 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -17 predicate places. [2025-01-09 21:36:17,694 INFO L471 AbstractCegarLoop]: Abstraction has has 358 places, 357 transitions, 739 flow [2025-01-09 21:36:17,695 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-01-09 21:36:17,695 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:17,695 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-01-09 21:36:17,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:36:17,695 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:36:17,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:17,696 INFO L85 PathProgramCache]: Analyzing trace with hash 47590857, now seen corresponding path program 1 times [2025-01-09 21:36:17,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:17,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242344404] [2025-01-09 21:36:17,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:17,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:17,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-01-09 21:36:17,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-01-09 21:36:17,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:17,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:17,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:36:17,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:17,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242344404] [2025-01-09 21:36:17,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242344404] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:17,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:17,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:36:17,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406975010] [2025-01-09 21:36:17,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:17,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:36:17,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:17,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:36:17,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:36:17,821 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 410 out of 451 [2025-01-09 21:36:17,822 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-01-09 21:36:17,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:17,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 410 of 451 [2025-01-09 21:36:17,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:18,297 INFO L124 PetriNetUnfolderBase]: 521/3345 cut-off events. [2025-01-09 21:36:18,298 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-01-09 21:36:18,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4284 conditions, 3345 events. 521/3345 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 25660 event pairs, 334 based on Foata normal form. 0/2959 useless extension candidates. Maximal degree in co-relation 4136. Up to 845 conditions per place. [2025-01-09 21:36:18,311 INFO L140 encePairwiseOnDemand]: 445/451 looper letters, 28 selfloop transitions, 3 changer transitions 0/363 dead transitions. [2025-01-09 21:36:18,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 363 transitions, 813 flow [2025-01-09 21:36:18,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:36:18,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:36:18,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1264 transitions. [2025-01-09 21:36:18,315 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.934220251293422 [2025-01-09 21:36:18,315 INFO L175 Difference]: Start difference. First operand has 358 places, 357 transitions, 739 flow. Second operand 3 states and 1264 transitions. [2025-01-09 21:36:18,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 363 transitions, 813 flow [2025-01-09 21:36:18,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 363 transitions, 813 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:36:18,322 INFO L231 Difference]: Finished difference. Result has 358 places, 357 transitions, 754 flow [2025-01-09 21:36:18,323 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-01-09 21:36:18,323 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -17 predicate places. [2025-01-09 21:36:18,323 INFO L471 AbstractCegarLoop]: Abstraction has has 358 places, 357 transitions, 754 flow [2025-01-09 21:36:18,324 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-01-09 21:36:18,324 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:18,324 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-01-09 21:36:18,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:36:18,324 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:36:18,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:18,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1748024969, now seen corresponding path program 1 times [2025-01-09 21:36:18,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:18,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757485425] [2025-01-09 21:36:18,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:18,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:18,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-01-09 21:36:18,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-01-09 21:36:18,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:18,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:18,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:36:18,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:18,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757485425] [2025-01-09 21:36:18,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757485425] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:18,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:18,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:36:18,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596356272] [2025-01-09 21:36:18,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:18,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:36:18,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:18,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:36:18,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:36:18,450 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 451 [2025-01-09 21:36:18,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 357 transitions, 754 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-01-09 21:36:18,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:18,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 451 [2025-01-09 21:36:18,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:19,297 INFO L124 PetriNetUnfolderBase]: 1096/5873 cut-off events. [2025-01-09 21:36:19,298 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2025-01-09 21:36:19,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7870 conditions, 5873 events. 1096/5873 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 49247 event pairs, 390 based on Foata normal form. 0/5127 useless extension candidates. Maximal degree in co-relation 7721. Up to 908 conditions per place. [2025-01-09 21:36:19,338 INFO L140 encePairwiseOnDemand]: 440/451 looper letters, 40 selfloop transitions, 8 changer transitions 0/379 dead transitions. [2025-01-09 21:36:19,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 379 transitions, 900 flow [2025-01-09 21:36:19,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:36:19,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:36:19,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1275 transitions. [2025-01-09 21:36:19,342 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9423503325942351 [2025-01-09 21:36:19,342 INFO L175 Difference]: Start difference. First operand has 358 places, 357 transitions, 754 flow. Second operand 3 states and 1275 transitions. [2025-01-09 21:36:19,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 379 transitions, 900 flow [2025-01-09 21:36:19,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 379 transitions, 900 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:36:19,349 INFO L231 Difference]: Finished difference. Result has 362 places, 365 transitions, 824 flow [2025-01-09 21:36:19,350 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=451, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=358, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=824, PETRI_PLACES=362, PETRI_TRANSITIONS=365} [2025-01-09 21:36:19,352 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -13 predicate places. [2025-01-09 21:36:19,352 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 365 transitions, 824 flow [2025-01-09 21:36:19,353 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-01-09 21:36:19,353 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:19,353 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-01-09 21:36:19,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:36:19,353 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting cleanerErr2ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:36:19,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:19,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1138431107, now seen corresponding path program 1 times [2025-01-09 21:36:19,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:19,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023182438] [2025-01-09 21:36:19,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:19,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:19,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-01-09 21:36:19,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-01-09 21:36:19,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:19,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:19,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:36:19,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:19,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023182438] [2025-01-09 21:36:19,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023182438] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:19,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:19,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:36:19,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693955301] [2025-01-09 21:36:19,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:19,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:36:19,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:19,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:36:19,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:36:19,469 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 404 out of 451 [2025-01-09 21:36:19,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 365 transitions, 824 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-01-09 21:36:19,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:19,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 404 of 451 [2025-01-09 21:36:19,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:20,991 INFO L124 PetriNetUnfolderBase]: 1951/10352 cut-off events. [2025-01-09 21:36:20,991 INFO L125 PetriNetUnfolderBase]: For 290/331 co-relation queries the response was YES. [2025-01-09 21:36:21,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14152 conditions, 10352 events. 1951/10352 cut-off events. For 290/331 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 99378 event pairs, 1213 based on Foata normal form. 0/9252 useless extension candidates. Maximal degree in co-relation 14001. Up to 2709 conditions per place. [2025-01-09 21:36:21,062 INFO L140 encePairwiseOnDemand]: 444/451 looper letters, 33 selfloop transitions, 3 changer transitions 0/373 dead transitions. [2025-01-09 21:36:21,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 373 transitions, 915 flow [2025-01-09 21:36:21,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:36:21,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:36:21,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1252 transitions. [2025-01-09 21:36:21,066 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.925351071692535 [2025-01-09 21:36:21,066 INFO L175 Difference]: Start difference. First operand has 362 places, 365 transitions, 824 flow. Second operand 3 states and 1252 transitions. [2025-01-09 21:36:21,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 373 transitions, 915 flow [2025-01-09 21:36:21,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 373 transitions, 899 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:36:21,077 INFO L231 Difference]: Finished difference. Result has 359 places, 364 transitions, 821 flow [2025-01-09 21:36:21,078 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=451, PETRI_DIFFERENCE_MINUEND_FLOW=800, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=821, PETRI_PLACES=359, PETRI_TRANSITIONS=364} [2025-01-09 21:36:21,079 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -16 predicate places. [2025-01-09 21:36:21,079 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 364 transitions, 821 flow [2025-01-09 21:36:21,080 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-01-09 21:36:21,080 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:21,080 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-01-09 21:36:21,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:36:21,080 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting cleanerErr3ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:36:21,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:21,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1938440722, now seen corresponding path program 1 times [2025-01-09 21:36:21,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:21,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512782483] [2025-01-09 21:36:21,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:21,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:21,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-01-09 21:36:21,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-01-09 21:36:21,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:21,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:21,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:36:21,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:21,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512782483] [2025-01-09 21:36:21,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512782483] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:21,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:21,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:36:21,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510196302] [2025-01-09 21:36:21,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:21,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:36:21,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:21,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:36:21,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:36:21,451 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 451 [2025-01-09 21:36:21,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 364 transitions, 821 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-01-09 21:36:21,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:21,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 451 [2025-01-09 21:36:21,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:23,033 INFO L124 PetriNetUnfolderBase]: 3184/14712 cut-off events. [2025-01-09 21:36:23,033 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2025-01-09 21:36:23,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21281 conditions, 14712 events. 3184/14712 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 148383 event pairs, 1587 based on Foata normal form. 0/13187 useless extension candidates. Maximal degree in co-relation 21129. Up to 3612 conditions per place. [2025-01-09 21:36:23,104 INFO L140 encePairwiseOnDemand]: 441/451 looper letters, 41 selfloop transitions, 9 changer transitions 0/385 dead transitions. [2025-01-09 21:36:23,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 385 transitions, 969 flow [2025-01-09 21:36:23,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:36:23,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:36:23,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1275 transitions. [2025-01-09 21:36:23,108 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9423503325942351 [2025-01-09 21:36:23,108 INFO L175 Difference]: Start difference. First operand has 359 places, 364 transitions, 821 flow. Second operand 3 states and 1275 transitions. [2025-01-09 21:36:23,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 385 transitions, 969 flow [2025-01-09 21:36:23,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 385 transitions, 969 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:36:23,116 INFO L231 Difference]: Finished difference. Result has 363 places, 372 transitions, 891 flow [2025-01-09 21:36:23,117 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-01-09 21:36:23,117 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -12 predicate places. [2025-01-09 21:36:23,117 INFO L471 AbstractCegarLoop]: Abstraction has has 363 places, 372 transitions, 891 flow [2025-01-09 21:36:23,118 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-01-09 21:36:23,118 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:23,118 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-01-09 21:36:23,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:36:23,119 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:36:23,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:23,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1125013508, now seen corresponding path program 1 times [2025-01-09 21:36:23,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:23,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130008569] [2025-01-09 21:36:23,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:23,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:23,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-01-09 21:36:23,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-01-09 21:36:23,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:23,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:23,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:36:23,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:23,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130008569] [2025-01-09 21:36:23,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130008569] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:23,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:23,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:36:23,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569672991] [2025-01-09 21:36:23,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:23,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:36:23,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:23,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:36:23,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:36:23,390 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 451 [2025-01-09 21:36:23,392 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-01-09 21:36:23,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:23,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 451 [2025-01-09 21:36:23,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:24,948 INFO L124 PetriNetUnfolderBase]: 1993/11005 cut-off events. [2025-01-09 21:36:24,949 INFO L125 PetriNetUnfolderBase]: For 444/461 co-relation queries the response was YES. [2025-01-09 21:36:24,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16086 conditions, 11005 events. 1993/11005 cut-off events. For 444/461 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 109917 event pairs, 1301 based on Foata normal form. 4/9845 useless extension candidates. Maximal degree in co-relation 15930. Up to 2295 conditions per place. [2025-01-09 21:36:24,990 INFO L140 encePairwiseOnDemand]: 442/451 looper letters, 34 selfloop transitions, 8 changer transitions 0/386 dead transitions. [2025-01-09 21:36:24,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 386 transitions, 1002 flow [2025-01-09 21:36:24,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:36:24,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:36:24,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2509 transitions. [2025-01-09 21:36:24,995 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9271988174427199 [2025-01-09 21:36:24,995 INFO L175 Difference]: Start difference. First operand has 363 places, 372 transitions, 891 flow. Second operand 6 states and 2509 transitions. [2025-01-09 21:36:24,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 386 transitions, 1002 flow [2025-01-09 21:36:25,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 386 transitions, 984 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:36:25,008 INFO L231 Difference]: Finished difference. Result has 370 places, 376 transitions, 918 flow [2025-01-09 21:36:25,009 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-01-09 21:36:25,009 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -5 predicate places. [2025-01-09 21:36:25,009 INFO L471 AbstractCegarLoop]: Abstraction has has 370 places, 376 transitions, 918 flow [2025-01-09 21:36:25,010 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-01-09 21:36:25,010 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:25,011 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-01-09 21:36:25,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:36:25,011 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:36:25,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:25,012 INFO L85 PathProgramCache]: Analyzing trace with hash 2051043309, now seen corresponding path program 1 times [2025-01-09 21:36:25,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:25,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393562298] [2025-01-09 21:36:25,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:25,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:25,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-01-09 21:36:25,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-01-09 21:36:25,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:25,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:25,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:36:25,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:25,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393562298] [2025-01-09 21:36:25,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393562298] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:25,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:25,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:36:25,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613883405] [2025-01-09 21:36:25,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:25,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:36:25,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:25,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:36:25,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:36:25,257 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 451 [2025-01-09 21:36:25,259 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-01-09 21:36:25,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:25,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 451 [2025-01-09 21:36:25,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:27,428 INFO L124 PetriNetUnfolderBase]: 2846/13861 cut-off events. [2025-01-09 21:36:27,429 INFO L125 PetriNetUnfolderBase]: For 1099/1145 co-relation queries the response was YES. [2025-01-09 21:36:27,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21286 conditions, 13861 events. 2846/13861 cut-off events. For 1099/1145 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 140679 event pairs, 1522 based on Foata normal form. 0/12455 useless extension candidates. Maximal degree in co-relation 21125. Up to 3428 conditions per place. [2025-01-09 21:36:27,485 INFO L140 encePairwiseOnDemand]: 446/451 looper letters, 38 selfloop transitions, 6 changer transitions 0/388 dead transitions. [2025-01-09 21:36:27,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 388 transitions, 1041 flow [2025-01-09 21:36:27,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:36:27,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:36:27,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1270 transitions. [2025-01-09 21:36:27,488 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9386548410938654 [2025-01-09 21:36:27,488 INFO L175 Difference]: Start difference. First operand has 370 places, 376 transitions, 918 flow. Second operand 3 states and 1270 transitions. [2025-01-09 21:36:27,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 388 transitions, 1041 flow [2025-01-09 21:36:27,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 388 transitions, 1037 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:36:27,497 INFO L231 Difference]: Finished difference. Result has 373 places, 381 transitions, 968 flow [2025-01-09 21:36:27,498 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-01-09 21:36:27,498 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -2 predicate places. [2025-01-09 21:36:27,498 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 381 transitions, 968 flow [2025-01-09 21:36:27,499 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-01-09 21:36:27,499 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:27,499 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-01-09 21:36:27,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:36:27,500 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting cleanerErr5ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:36:27,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:27,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1584385894, now seen corresponding path program 1 times [2025-01-09 21:36:27,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:27,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391911339] [2025-01-09 21:36:27,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:27,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:27,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-01-09 21:36:27,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-01-09 21:36:27,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:27,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:27,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:36:27,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:27,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391911339] [2025-01-09 21:36:27,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391911339] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:27,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:27,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:36:27,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014452485] [2025-01-09 21:36:27,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:27,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:36:27,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:27,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:36:27,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:36:27,794 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 451 [2025-01-09 21:36:27,797 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-01-09 21:36:27,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:27,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 451 [2025-01-09 21:36:27,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:29,398 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([946] L1030-2-->L1030-5: Formula: (and (= |v_#pthreadsMutex_119| (store |v_#pthreadsMutex_120| v_~datas_mutex~0.base_22 (store (select |v_#pthreadsMutex_120| v_~datas_mutex~0.base_22) (+ (* v_threadThread1of1ForFork1_~i~0_13 24) v_~datas_mutex~0.offset_22) 0))) (= |v_threadThread1of1ForFork1_#t~ret5_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_120|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_22, ~datas_mutex~0.base=v_~datas_mutex~0.base_22} OutVars{#pthreadsMutex=|v_#pthreadsMutex_119|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_22, threadThread1of1ForFork1_#t~ret5=|v_threadThread1of1ForFork1_#t~ret5_1|, ~datas_mutex~0.base=v_~datas_mutex~0.base_22} 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), 477#(= |#race~datas~0| 0), 443#true, Black: 486#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 488#(and (<= ~threads_total~0 0) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 487#(<= ~threads_total~0 0), Black: 490#(and (= |ULTIMATE.start_main_~i~2#1| 0) (<= ~threads_total~0 0)), Black: 462#true, Black: 497#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 500#true, 141#L1030-5true, Black: 466#true, 495#true, 445#true, Black: 470#true, 464#(= |#race~datas_mutex~0| 0), 413#L1045-4true, 468#(= |#race~tids~0| 0), Black: 475#true, 178#ULTIMATE.startFINALtrue]) [2025-01-09 21:36:29,398 INFO L294 olderBase$Statistics]: this new event has 377 ancestors and is cut-off event [2025-01-09 21:36:29,399 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2025-01-09 21:36:29,399 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2025-01-09 21:36:29,399 INFO L297 olderBase$Statistics]: existing Event has 377 ancestors and is cut-off event [2025-01-09 21:36:29,431 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([896] L1035-6-->L1035-7: 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), 477#(= |#race~datas~0| 0), 104#L1035-7true, 443#true, Black: 486#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 488#(and (<= ~threads_total~0 0) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 487#(<= ~threads_total~0 0), Black: 490#(and (= |ULTIMATE.start_main_~i~2#1| 0) (<= ~threads_total~0 0)), Black: 462#true, Black: 497#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 400#L1029-5true, 500#true, Black: 466#true, 495#true, 445#true, Black: 470#true, 464#(= |#race~datas_mutex~0| 0), 468#(= |#race~tids~0| 0), Black: 475#true, 178#ULTIMATE.startFINALtrue]) [2025-01-09 21:36:29,431 INFO L294 olderBase$Statistics]: this new event has 375 ancestors and is cut-off event [2025-01-09 21:36:29,431 INFO L297 olderBase$Statistics]: existing Event has 292 ancestors and is cut-off event [2025-01-09 21:36:29,431 INFO L297 olderBase$Statistics]: existing Event has 375 ancestors and is cut-off event [2025-01-09 21:36:29,431 INFO L297 olderBase$Statistics]: existing Event has 292 ancestors and is cut-off event [2025-01-09 21:36:29,553 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([896] L1035-6-->L1035-7: 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), 477#(= |#race~datas~0| 0), Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 104#L1035-7true, 443#true, Black: 486#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 488#(and (<= ~threads_total~0 0) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 487#(<= ~threads_total~0 0), Black: 490#(and (= |ULTIMATE.start_main_~i~2#1| 0) (<= ~threads_total~0 0)), Black: 462#true, Black: 497#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 400#L1029-5true, 500#true, Black: 466#true, 495#true, 445#true, 464#(= |#race~datas_mutex~0| 0), Black: 472#(= |#race~threads_alive~0| 0), 468#(= |#race~tids~0| 0), Black: 475#true, 178#ULTIMATE.startFINALtrue]) [2025-01-09 21:36:29,553 INFO L294 olderBase$Statistics]: this new event has 396 ancestors and is cut-off event [2025-01-09 21:36:29,553 INFO L297 olderBase$Statistics]: existing Event has 375 ancestors and is cut-off event [2025-01-09 21:36:29,553 INFO L297 olderBase$Statistics]: existing Event has 375 ancestors and is cut-off event [2025-01-09 21:36:29,553 INFO L297 olderBase$Statistics]: existing Event has 375 ancestors and is cut-off event [2025-01-09 21:36:29,562 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([946] L1030-2-->L1030-5: Formula: (and (= |v_#pthreadsMutex_119| (store |v_#pthreadsMutex_120| v_~datas_mutex~0.base_22 (store (select |v_#pthreadsMutex_120| v_~datas_mutex~0.base_22) (+ (* v_threadThread1of1ForFork1_~i~0_13 24) v_~datas_mutex~0.offset_22) 0))) (= |v_threadThread1of1ForFork1_#t~ret5_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_120|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_22, ~datas_mutex~0.base=v_~datas_mutex~0.base_22} OutVars{#pthreadsMutex=|v_#pthreadsMutex_119|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_22, threadThread1of1ForFork1_#t~ret5=|v_threadThread1of1ForFork1_#t~ret5_1|, ~datas_mutex~0.base=v_~datas_mutex~0.base_22} 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), 477#(= |#race~datas~0| 0), 443#true, Black: 486#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 488#(and (<= ~threads_total~0 0) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 487#(<= ~threads_total~0 0), Black: 490#(and (= |ULTIMATE.start_main_~i~2#1| 0) (<= ~threads_total~0 0)), Black: 462#true, Black: 497#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 500#true, 141#L1030-5true, Black: 466#true, 495#true, 445#true, 464#(= |#race~datas_mutex~0| 0), Black: 472#(= |#race~threads_alive~0| 0), 413#L1045-4true, 468#(= |#race~tids~0| 0), Black: 475#true, 178#ULTIMATE.startFINALtrue]) [2025-01-09 21:36:29,562 INFO L294 olderBase$Statistics]: this new event has 398 ancestors and is cut-off event [2025-01-09 21:36:29,562 INFO L297 olderBase$Statistics]: existing Event has 377 ancestors and is cut-off event [2025-01-09 21:36:29,562 INFO L297 olderBase$Statistics]: existing Event has 377 ancestors and is cut-off event [2025-01-09 21:36:29,562 INFO L297 olderBase$Statistics]: existing Event has 377 ancestors and is cut-off event [2025-01-09 21:36:29,749 INFO L124 PetriNetUnfolderBase]: 3019/15049 cut-off events. [2025-01-09 21:36:29,749 INFO L125 PetriNetUnfolderBase]: For 1435/1533 co-relation queries the response was YES. [2025-01-09 21:36:29,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23109 conditions, 15049 events. 3019/15049 cut-off events. For 1435/1533 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 155446 event pairs, 1729 based on Foata normal form. 7/13498 useless extension candidates. Maximal degree in co-relation 22946. Up to 3630 conditions per place. [2025-01-09 21:36:29,816 INFO L140 encePairwiseOnDemand]: 442/451 looper letters, 25 selfloop transitions, 4 changer transitions 17/393 dead transitions. [2025-01-09 21:36:29,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 393 transitions, 1079 flow [2025-01-09 21:36:29,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:36:29,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:36:29,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2510 transitions. [2025-01-09 21:36:29,820 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9275683665927569 [2025-01-09 21:36:29,820 INFO L175 Difference]: Start difference. First operand has 373 places, 381 transitions, 968 flow. Second operand 6 states and 2510 transitions. [2025-01-09 21:36:29,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 393 transitions, 1079 flow [2025-01-09 21:36:29,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 393 transitions, 1067 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:36:29,830 INFO L231 Difference]: Finished difference. Result has 378 places, 376 transitions, 943 flow [2025-01-09 21:36:29,831 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-01-09 21:36:29,831 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, 3 predicate places. [2025-01-09 21:36:29,831 INFO L471 AbstractCegarLoop]: Abstraction has has 378 places, 376 transitions, 943 flow [2025-01-09 21:36:29,833 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-01-09 21:36:29,833 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:29,833 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-01-09 21:36:29,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:36:29,833 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:36:29,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:29,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1447569198, now seen corresponding path program 1 times [2025-01-09 21:36:29,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:29,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213947082] [2025-01-09 21:36:29,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:29,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:29,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-01-09 21:36:29,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-01-09 21:36:29,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:29,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:30,717 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:36:30,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:30,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213947082] [2025-01-09 21:36:30,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213947082] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:30,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:30,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:36:30,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053655166] [2025-01-09 21:36:30,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:30,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:36:30,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:30,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:36:30,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:36:30,928 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 451 [2025-01-09 21:36:30,931 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-01-09 21:36:30,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:30,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 451 [2025-01-09 21:36:30,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:34,518 INFO L124 PetriNetUnfolderBase]: 6833/25169 cut-off events. [2025-01-09 21:36:34,518 INFO L125 PetriNetUnfolderBase]: For 4938/5184 co-relation queries the response was YES. [2025-01-09 21:36:34,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43463 conditions, 25169 events. 6833/25169 cut-off events. For 4938/5184 co-relation queries the response was YES. Maximal size of possible extension queue 508. Compared 272323 event pairs, 3718 based on Foata normal form. 0/22776 useless extension candidates. Maximal degree in co-relation 43296. Up to 8661 conditions per place. [2025-01-09 21:36:34,655 INFO L140 encePairwiseOnDemand]: 437/451 looper letters, 90 selfloop transitions, 46 changer transitions 0/464 dead transitions. [2025-01-09 21:36:34,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 464 transitions, 1505 flow [2025-01-09 21:36:34,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:36:34,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:36:34,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2480 transitions. [2025-01-09 21:36:34,659 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9164818920916482 [2025-01-09 21:36:34,659 INFO L175 Difference]: Start difference. First operand has 378 places, 376 transitions, 943 flow. Second operand 6 states and 2480 transitions. [2025-01-09 21:36:34,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 464 transitions, 1505 flow [2025-01-09 21:36:34,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 464 transitions, 1477 flow, removed 7 selfloop flow, removed 9 redundant places. [2025-01-09 21:36:34,677 INFO L231 Difference]: Finished difference. Result has 374 places, 421 transitions, 1282 flow [2025-01-09 21:36:34,677 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-01-09 21:36:34,678 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -1 predicate places. [2025-01-09 21:36:34,678 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 421 transitions, 1282 flow [2025-01-09 21:36:34,679 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-01-09 21:36:34,679 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:34,680 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-01-09 21:36:34,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:36:34,680 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting cleanerErr5ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:36:34,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:34,681 INFO L85 PathProgramCache]: Analyzing trace with hash -88632024, now seen corresponding path program 1 times [2025-01-09 21:36:34,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:34,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049796492] [2025-01-09 21:36:34,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:34,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:34,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-01-09 21:36:34,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-01-09 21:36:34,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:34,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:34,974 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:36:34,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:34,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049796492] [2025-01-09 21:36:34,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049796492] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:34,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:34,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 21:36:34,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457730307] [2025-01-09 21:36:34,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:34,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 21:36:34,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:34,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 21:36:34,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 21:36:35,279 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 404 out of 451 [2025-01-09 21:36:35,282 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-01-09 21:36:35,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:35,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 404 of 451 [2025-01-09 21:36:35,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:40,100 INFO L124 PetriNetUnfolderBase]: 7186/31075 cut-off events. [2025-01-09 21:36:40,101 INFO L125 PetriNetUnfolderBase]: For 5072/5700 co-relation queries the response was YES. [2025-01-09 21:36:40,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53849 conditions, 31075 events. 7186/31075 cut-off events. For 5072/5700 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 363804 event pairs, 3250 based on Foata normal form. 172/28170 useless extension candidates. Maximal degree in co-relation 53688. Up to 7704 conditions per place. [2025-01-09 21:36:40,300 INFO L140 encePairwiseOnDemand]: 439/451 looper letters, 58 selfloop transitions, 14 changer transitions 10/466 dead transitions. [2025-01-09 21:36:40,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 466 transitions, 1541 flow [2025-01-09 21:36:40,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 21:36:40,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-09 21:36:40,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4122 transitions. [2025-01-09 21:36:40,308 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9139689578713969 [2025-01-09 21:36:40,308 INFO L175 Difference]: Start difference. First operand has 374 places, 421 transitions, 1282 flow. Second operand 10 states and 4122 transitions. [2025-01-09 21:36:40,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 466 transitions, 1541 flow [2025-01-09 21:36:40,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 466 transitions, 1509 flow, removed 16 selfloop flow, removed 0 redundant places. [2025-01-09 21:36:40,371 INFO L231 Difference]: Finished difference. Result has 387 places, 428 transitions, 1317 flow [2025-01-09 21:36:40,372 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-01-09 21:36:40,373 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, 12 predicate places. [2025-01-09 21:36:40,373 INFO L471 AbstractCegarLoop]: Abstraction has has 387 places, 428 transitions, 1317 flow [2025-01-09 21:36:40,374 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-01-09 21:36:40,374 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:40,374 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-01-09 21:36:40,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:36:40,375 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting cleanerErr3ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:36:40,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:40,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1010823042, now seen corresponding path program 1 times [2025-01-09 21:36:40,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:40,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911194705] [2025-01-09 21:36:40,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:40,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:40,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-01-09 21:36:40,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-01-09 21:36:40,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:40,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:40,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:36:40,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:40,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911194705] [2025-01-09 21:36:40,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911194705] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:40,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:40,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 21:36:40,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140184021] [2025-01-09 21:36:40,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:40,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 21:36:40,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:40,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 21:36:40,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 21:36:41,425 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 399 out of 451 [2025-01-09 21:36:41,429 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-01-09 21:36:41,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:41,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 399 of 451 [2025-01-09 21:36:41,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:43,851 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([870] L1036-1-->L1036-4: 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][389], [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|)), 366#L1036-4true, 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, 181#L1028-1true, 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, Black: 470#true, 468#(= |#race~tids~0| 0), 541#(not (= ~datas~0.base ~tids~0.base)), Black: 475#true, Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 477#(= |#race~datas~0| 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), 178#ULTIMATE.startFINALtrue]) [2025-01-09 21:36:43,852 INFO L294 olderBase$Statistics]: this new event has 296 ancestors and is cut-off event [2025-01-09 21:36:43,852 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2025-01-09 21:36:43,852 INFO L297 olderBase$Statistics]: existing Event has 291 ancestors and is cut-off event [2025-01-09 21:36:43,852 INFO L297 olderBase$Statistics]: existing Event has 291 ancestors and is cut-off event [2025-01-09 21:36:43,872 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([939] L1029-4-->L1029-5: Formula: (= (store |v_#race_34| v_~datas~0.base_16 (store (select |v_#race_34| v_~datas~0.base_16) (+ v_threadThread1of1ForFork1_~i~0_7 v_~datas~0.offset_16) |v_threadThread1of1ForFork1_#t~nondet4_3|)) |v_#race_33|) InVars {#race=|v_#race_34|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet4=|v_threadThread1of1ForFork1_#t~nondet4_3|, ~datas~0.base=v_~datas~0.base_16, ~datas~0.offset=v_~datas~0.offset_16} OutVars{#race=|v_#race_33|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet4=|v_threadThread1of1ForFork1_#t~nondet4_3|, ~datas~0.base=v_~datas~0.base_16, ~datas~0.offset=v_~datas~0.offset_16} AuxVars[] AssignedVars[#race][366], [395#L1061-7true, 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|)), 305#L1038-4true, Black: 462#true, 551#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 523#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base)), Black: 525#(= |cleanerThread1of1ForFork0_#t~mem7| 0), Black: 466#true, Black: 531#(and (= |cleanerThread1of1ForFork0_#t~mem7| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base))), 445#true, Black: 524#(= (select (select |#memory_int| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 472#(= |#race~threads_alive~0| 0), 468#(= |#race~tids~0| 0), Black: 475#true, Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 477#(= |#race~datas~0| 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, 400#L1029-5true, 509#true, 464#(= |#race~datas_mutex~0| 0)]) [2025-01-09 21:36:43,872 INFO L294 olderBase$Statistics]: this new event has 299 ancestors and is cut-off event [2025-01-09 21:36:43,872 INFO L297 olderBase$Statistics]: existing Event has 278 ancestors and is cut-off event [2025-01-09 21:36:43,872 INFO L297 olderBase$Statistics]: existing Event has 278 ancestors and is cut-off event [2025-01-09 21:36:43,872 INFO L297 olderBase$Statistics]: existing Event has 278 ancestors and is cut-off event [2025-01-09 21:36:43,890 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([939] L1029-4-->L1029-5: Formula: (= (store |v_#race_34| v_~datas~0.base_16 (store (select |v_#race_34| v_~datas~0.base_16) (+ v_threadThread1of1ForFork1_~i~0_7 v_~datas~0.offset_16) |v_threadThread1of1ForFork1_#t~nondet4_3|)) |v_#race_33|) InVars {#race=|v_#race_34|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet4=|v_threadThread1of1ForFork1_#t~nondet4_3|, ~datas~0.base=v_~datas~0.base_16, ~datas~0.offset=v_~datas~0.offset_16} OutVars{#race=|v_#race_33|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet4=|v_threadThread1of1ForFork1_#t~nondet4_3|, ~datas~0.base=v_~datas~0.base_16, ~datas~0.offset=v_~datas~0.offset_16} AuxVars[] AssignedVars[#race][366], [395#L1061-7true, 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: 462#true, 551#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 523#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base)), Black: 525#(= |cleanerThread1of1ForFork0_#t~mem7| 0), Black: 466#true, Black: 531#(and (= |cleanerThread1of1ForFork0_#t~mem7| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base))), 445#true, Black: 524#(= (select (select |#memory_int| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 67#L1038-5true, Black: 472#(= |#race~threads_alive~0| 0), 468#(= |#race~tids~0| 0), Black: 475#true, 477#(= |#race~datas~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, 400#L1029-5true, 509#true, 464#(= |#race~datas_mutex~0| 0)]) [2025-01-09 21:36:43,890 INFO L294 olderBase$Statistics]: this new event has 300 ancestors and is cut-off event [2025-01-09 21:36:43,890 INFO L297 olderBase$Statistics]: existing Event has 279 ancestors and is cut-off event [2025-01-09 21:36:43,890 INFO L297 olderBase$Statistics]: existing Event has 279 ancestors and is cut-off event [2025-01-09 21:36:43,890 INFO L297 olderBase$Statistics]: existing Event has 279 ancestors and is cut-off event [2025-01-09 21:36:43,891 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([939] L1029-4-->L1029-5: Formula: (= (store |v_#race_34| v_~datas~0.base_16 (store (select |v_#race_34| v_~datas~0.base_16) (+ v_threadThread1of1ForFork1_~i~0_7 v_~datas~0.offset_16) |v_threadThread1of1ForFork1_#t~nondet4_3|)) |v_#race_33|) InVars {#race=|v_#race_34|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet4=|v_threadThread1of1ForFork1_#t~nondet4_3|, ~datas~0.base=v_~datas~0.base_16, ~datas~0.offset=v_~datas~0.offset_16} OutVars{#race=|v_#race_33|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet4=|v_threadThread1of1ForFork1_#t~nondet4_3|, ~datas~0.base=v_~datas~0.base_16, ~datas~0.offset=v_~datas~0.offset_16} AuxVars[] AssignedVars[#race][366], [395#L1061-7true, 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|)), 305#L1038-4true, 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))), 445#true, Black: 524#(= (select (select |#memory_int| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 472#(= |#race~threads_alive~0| 0), 468#(= |#race~tids~0| 0), Black: 475#true, 477#(= |#race~datas~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, 400#L1029-5true, 509#true, 464#(= |#race~datas_mutex~0| 0)]) [2025-01-09 21:36:43,891 INFO L294 olderBase$Statistics]: this new event has 299 ancestors and is cut-off event [2025-01-09 21:36:43,891 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-01-09 21:36:43,891 INFO L297 olderBase$Statistics]: existing Event has 278 ancestors and is cut-off event [2025-01-09 21:36:43,891 INFO L297 olderBase$Statistics]: existing Event has 278 ancestors and is cut-off event [2025-01-09 21:36:43,891 INFO L297 olderBase$Statistics]: existing Event has 278 ancestors and is cut-off event [2025-01-09 21:36:43,908 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([939] L1029-4-->L1029-5: Formula: (= (store |v_#race_34| v_~datas~0.base_16 (store (select |v_#race_34| v_~datas~0.base_16) (+ v_threadThread1of1ForFork1_~i~0_7 v_~datas~0.offset_16) |v_threadThread1of1ForFork1_#t~nondet4_3|)) |v_#race_33|) InVars {#race=|v_#race_34|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet4=|v_threadThread1of1ForFork1_#t~nondet4_3|, ~datas~0.base=v_~datas~0.base_16, ~datas~0.offset=v_~datas~0.offset_16} OutVars{#race=|v_#race_33|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet4=|v_threadThread1of1ForFork1_#t~nondet4_3|, ~datas~0.base=v_~datas~0.base_16, ~datas~0.offset=v_~datas~0.offset_16} AuxVars[] AssignedVars[#race][366], [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|)), 305#L1038-4true, 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))), 445#true, Black: 524#(= (select (select |#memory_int| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 472#(= |#race~threads_alive~0| 0), 468#(= |#race~tids~0| 0), Black: 475#true, 477#(= |#race~datas~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), 5#L1061-8true, Black: 497#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 519#true, 400#L1029-5true, 509#true, 464#(= |#race~datas_mutex~0| 0)]) [2025-01-09 21:36:43,908 INFO L294 olderBase$Statistics]: this new event has 300 ancestors and is cut-off event [2025-01-09 21:36:43,908 INFO L297 olderBase$Statistics]: existing Event has 279 ancestors and is cut-off event [2025-01-09 21:36:43,908 INFO L297 olderBase$Statistics]: existing Event has 279 ancestors and is cut-off event [2025-01-09 21:36:43,908 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-01-09 21:36:43,909 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([939] L1029-4-->L1029-5: Formula: (= (store |v_#race_34| v_~datas~0.base_16 (store (select |v_#race_34| v_~datas~0.base_16) (+ v_threadThread1of1ForFork1_~i~0_7 v_~datas~0.offset_16) |v_threadThread1of1ForFork1_#t~nondet4_3|)) |v_#race_33|) InVars {#race=|v_#race_34|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet4=|v_threadThread1of1ForFork1_#t~nondet4_3|, ~datas~0.base=v_~datas~0.base_16, ~datas~0.offset=v_~datas~0.offset_16} OutVars{#race=|v_#race_33|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet4=|v_threadThread1of1ForFork1_#t~nondet4_3|, ~datas~0.base=v_~datas~0.base_16, ~datas~0.offset=v_~datas~0.offset_16} AuxVars[] AssignedVars[#race][366], [395#L1061-7true, 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: 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))), 445#true, Black: 524#(= (select (select |#memory_int| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 67#L1038-5true, Black: 472#(= |#race~threads_alive~0| 0), 468#(= |#race~tids~0| 0), Black: 475#true, 477#(= |#race~datas~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, 400#L1029-5true, 509#true, 464#(= |#race~datas_mutex~0| 0)]) [2025-01-09 21:36:43,909 INFO L294 olderBase$Statistics]: this new event has 300 ancestors and is cut-off event [2025-01-09 21:36:43,909 INFO L297 olderBase$Statistics]: existing Event has 279 ancestors and is cut-off event [2025-01-09 21:36:43,909 INFO L297 olderBase$Statistics]: existing Event has 279 ancestors and is cut-off event [2025-01-09 21:36:43,909 INFO L297 olderBase$Statistics]: existing Event has 279 ancestors and is cut-off event [2025-01-09 21:36:43,909 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-01-09 21:36:43,909 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([939] L1029-4-->L1029-5: Formula: (= (store |v_#race_34| v_~datas~0.base_16 (store (select |v_#race_34| v_~datas~0.base_16) (+ v_threadThread1of1ForFork1_~i~0_7 v_~datas~0.offset_16) |v_threadThread1of1ForFork1_#t~nondet4_3|)) |v_#race_33|) InVars {#race=|v_#race_34|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet4=|v_threadThread1of1ForFork1_#t~nondet4_3|, ~datas~0.base=v_~datas~0.base_16, ~datas~0.offset=v_~datas~0.offset_16} OutVars{#race=|v_#race_33|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet4=|v_threadThread1of1ForFork1_#t~nondet4_3|, ~datas~0.base=v_~datas~0.base_16, ~datas~0.offset=v_~datas~0.offset_16} AuxVars[] AssignedVars[#race][366], [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: 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))), 445#true, Black: 524#(= (select (select |#memory_int| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 67#L1038-5true, Black: 472#(= |#race~threads_alive~0| 0), 468#(= |#race~tids~0| 0), Black: 475#true, 477#(= |#race~datas~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), 5#L1061-8true, Black: 497#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 519#true, 400#L1029-5true, 509#true, 464#(= |#race~datas_mutex~0| 0)]) [2025-01-09 21:36:43,909 INFO L294 olderBase$Statistics]: this new event has 301 ancestors and is cut-off event [2025-01-09 21:36:43,909 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-01-09 21:36:43,909 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-01-09 21:36:43,909 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-01-09 21:36:43,926 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([939] L1029-4-->L1029-5: Formula: (= (store |v_#race_34| v_~datas~0.base_16 (store (select |v_#race_34| v_~datas~0.base_16) (+ v_threadThread1of1ForFork1_~i~0_7 v_~datas~0.offset_16) |v_threadThread1of1ForFork1_#t~nondet4_3|)) |v_#race_33|) InVars {#race=|v_#race_34|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet4=|v_threadThread1of1ForFork1_#t~nondet4_3|, ~datas~0.base=v_~datas~0.base_16, ~datas~0.offset=v_~datas~0.offset_16} OutVars{#race=|v_#race_33|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet4=|v_threadThread1of1ForFork1_#t~nondet4_3|, ~datas~0.base=v_~datas~0.base_16, ~datas~0.offset=v_~datas~0.offset_16} AuxVars[] AssignedVars[#race][366], [452#(= |#race~threads_total~0| 0), 323#L1061-9true, 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: 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))), 445#true, Black: 524#(= (select (select |#memory_int| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 67#L1038-5true, Black: 472#(= |#race~threads_alive~0| 0), 468#(= |#race~tids~0| 0), Black: 475#true, 477#(= |#race~datas~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, 400#L1029-5true, 509#true, 464#(= |#race~datas_mutex~0| 0)]) [2025-01-09 21:36:43,926 INFO L294 olderBase$Statistics]: this new event has 302 ancestors and is cut-off event [2025-01-09 21:36:43,926 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-01-09 21:36:43,926 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2025-01-09 21:36:43,926 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-01-09 21:36:43,926 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([939] L1029-4-->L1029-5: Formula: (= (store |v_#race_34| v_~datas~0.base_16 (store (select |v_#race_34| v_~datas~0.base_16) (+ v_threadThread1of1ForFork1_~i~0_7 v_~datas~0.offset_16) |v_threadThread1of1ForFork1_#t~nondet4_3|)) |v_#race_33|) InVars {#race=|v_#race_34|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet4=|v_threadThread1of1ForFork1_#t~nondet4_3|, ~datas~0.base=v_~datas~0.base_16, ~datas~0.offset=v_~datas~0.offset_16} OutVars{#race=|v_#race_33|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet4=|v_threadThread1of1ForFork1_#t~nondet4_3|, ~datas~0.base=v_~datas~0.base_16, ~datas~0.offset=v_~datas~0.offset_16} AuxVars[] AssignedVars[#race][366], [452#(= |#race~threads_total~0| 0), 323#L1061-9true, 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|)), 305#L1038-4true, 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))), 445#true, Black: 524#(= (select (select |#memory_int| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 472#(= |#race~threads_alive~0| 0), 468#(= |#race~tids~0| 0), Black: 475#true, 477#(= |#race~datas~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, 400#L1029-5true, 509#true, 464#(= |#race~datas_mutex~0| 0)]) [2025-01-09 21:36:43,927 INFO L294 olderBase$Statistics]: this new event has 301 ancestors and is cut-off event [2025-01-09 21:36:43,927 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-01-09 21:36:43,927 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2025-01-09 21:36:43,927 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-01-09 21:36:46,405 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([955] threadEXIT-->L1038-9: 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|)), 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))), 444#true, Black: 524#(= (select (select |#memory_int| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 470#true, 468#(= |#race~tids~0| 0), 541#(not (= ~datas~0.base ~tids~0.base)), Black: 475#true, 205#L1038-9true, 477#(= |#race~datas~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: 495#true, 519#true, 509#true, 464#(= |#race~datas_mutex~0| 0), 178#ULTIMATE.startFINALtrue]) [2025-01-09 21:36:46,406 INFO L294 olderBase$Statistics]: this new event has 407 ancestors and is cut-off event [2025-01-09 21:36:46,406 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is cut-off event [2025-01-09 21:36:46,406 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is cut-off event [2025-01-09 21:36:46,406 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is cut-off event [2025-01-09 21:36:46,413 INFO L124 PetriNetUnfolderBase]: 8532/33584 cut-off events. [2025-01-09 21:36:46,413 INFO L125 PetriNetUnfolderBase]: For 15789/17578 co-relation queries the response was YES. [2025-01-09 21:36:46,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66409 conditions, 33584 events. 8532/33584 cut-off events. For 15789/17578 co-relation queries the response was YES. Maximal size of possible extension queue 603. Compared 386761 event pairs, 2717 based on Foata normal form. 71/30726 useless extension candidates. Maximal degree in co-relation 66242. Up to 6303 conditions per place. [2025-01-09 21:36:46,779 INFO L140 encePairwiseOnDemand]: 438/451 looper letters, 95 selfloop transitions, 48 changer transitions 0/494 dead transitions. [2025-01-09 21:36:46,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 494 transitions, 1911 flow [2025-01-09 21:36:46,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 21:36:46,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 21:36:46,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 4477 transitions. [2025-01-09 21:36:46,786 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9024390243902439 [2025-01-09 21:36:46,786 INFO L175 Difference]: Start difference. First operand has 387 places, 428 transitions, 1317 flow. Second operand 11 states and 4477 transitions. [2025-01-09 21:36:46,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 494 transitions, 1911 flow [2025-01-09 21:36:46,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 393 places, 494 transitions, 1903 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-09 21:36:46,824 INFO L231 Difference]: Finished difference. Result has 397 places, 451 transitions, 1678 flow [2025-01-09 21:36:46,825 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-01-09 21:36:46,825 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, 22 predicate places. [2025-01-09 21:36:46,825 INFO L471 AbstractCegarLoop]: Abstraction has has 397 places, 451 transitions, 1678 flow [2025-01-09 21:36:46,826 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-01-09 21:36:46,826 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:46,827 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-01-09 21:36:46,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:36:46,827 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:36:46,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:46,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1662922281, now seen corresponding path program 1 times [2025-01-09 21:36:46,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:46,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258349871] [2025-01-09 21:36:46,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:46,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:46,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-01-09 21:36:46,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-01-09 21:36:46,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:46,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:47,844 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:36:47,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:47,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258349871] [2025-01-09 21:36:47,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258349871] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:47,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:47,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 21:36:47,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195299120] [2025-01-09 21:36:47,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:47,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 21:36:47,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:47,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 21:36:47,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-01-09 21:36:48,572 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 451 [2025-01-09 21:36:48,576 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-01-09 21:36:48,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:48,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 451 [2025-01-09 21:36:48,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:54,865 INFO L124 PetriNetUnfolderBase]: 11047/39922 cut-off events. [2025-01-09 21:36:54,865 INFO L125 PetriNetUnfolderBase]: For 44599/47781 co-relation queries the response was YES. [2025-01-09 21:36:55,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88711 conditions, 39922 events. 11047/39922 cut-off events. For 44599/47781 co-relation queries the response was YES. Maximal size of possible extension queue 656. Compared 465397 event pairs, 3781 based on Foata normal form. 575/37353 useless extension candidates. Maximal degree in co-relation 88539. Up to 7835 conditions per place. [2025-01-09 21:36:55,217 INFO L140 encePairwiseOnDemand]: 433/451 looper letters, 164 selfloop transitions, 57 changer transitions 0/554 dead transitions. [2025-01-09 21:36:55,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 554 transitions, 2679 flow [2025-01-09 21:36:55,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 21:36:55,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-09 21:36:55,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 5168 transitions. [2025-01-09 21:36:55,223 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8814600034112229 [2025-01-09 21:36:55,224 INFO L175 Difference]: Start difference. First operand has 397 places, 451 transitions, 1678 flow. Second operand 13 states and 5168 transitions. [2025-01-09 21:36:55,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 554 transitions, 2679 flow [2025-01-09 21:36:55,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 403 places, 554 transitions, 2646 flow, removed 11 selfloop flow, removed 6 redundant places. [2025-01-09 21:36:55,365 INFO L231 Difference]: Finished difference. Result has 407 places, 476 transitions, 2006 flow [2025-01-09 21:36:55,366 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-01-09 21:36:55,366 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, 32 predicate places. [2025-01-09 21:36:55,366 INFO L471 AbstractCegarLoop]: Abstraction has has 407 places, 476 transitions, 2006 flow [2025-01-09 21:36:55,368 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-01-09 21:36:55,368 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:55,368 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-01-09 21:36:55,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:36:55,369 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2025-01-09 21:36:55,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:55,370 INFO L85 PathProgramCache]: Analyzing trace with hash -319059140, now seen corresponding path program 1 times [2025-01-09 21:36:55,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:55,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56803689] [2025-01-09 21:36:55,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:55,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:55,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-01-09 21:36:55,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-01-09 21:36:55,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:55,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:55,457 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 21:36:55,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:55,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56803689] [2025-01-09 21:36:55,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56803689] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:55,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:55,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:36:55,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652448782] [2025-01-09 21:36:55,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:55,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:36:55,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:55,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:36:55,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:36:55,495 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 410 out of 451 [2025-01-09 21:36:55,500 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-01-09 21:36:55,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:55,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 410 of 451 [2025-01-09 21:36:55,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:57,184 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([939] L1029-4-->L1029-5: Formula: (= (store |v_#race_34| v_~datas~0.base_16 (store (select |v_#race_34| v_~datas~0.base_16) (+ v_threadThread1of1ForFork1_~i~0_7 v_~datas~0.offset_16) |v_threadThread1of1ForFork1_#t~nondet4_3|)) |v_#race_33|) InVars {#race=|v_#race_34|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet4=|v_threadThread1of1ForFork1_#t~nondet4_3|, ~datas~0.base=v_~datas~0.base_16, ~datas~0.offset=v_~datas~0.offset_16} OutVars{#race=|v_#race_33|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet4=|v_threadThread1of1ForFork1_#t~nondet4_3|, ~datas~0.base=v_~datas~0.base_16, ~datas~0.offset=v_~datas~0.offset_16} 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|)), 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|)), 104#L1035-7true, 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: 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: 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: 525#(= |cleanerThread1of1ForFork0_#t~mem7| 0), Black: 466#true, Black: 531#(and (= |cleanerThread1of1ForFork0_#t~mem7| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base))), 445#true, Black: 524#(= (select (select |#memory_int| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 472#(= |#race~threads_alive~0| 0), 468#(= |#race~tids~0| 0), 589#true, Black: 475#true, 477#(= |#race~datas~0| 0), Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 172#L1061-10true, 443#true, Black: 553#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 486#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 541#(not (= ~datas~0.base ~tids~0.base)), Black: 542#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base))), Black: 497#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 519#true, 400#L1029-5true, 509#true, 464#(= |#race~datas_mutex~0| 0)]) [2025-01-09 21:36:57,184 INFO L294 olderBase$Statistics]: this new event has 283 ancestors and is not cut-off event [2025-01-09 21:36:57,185 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is not cut-off event [2025-01-09 21:36:57,185 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is not cut-off event [2025-01-09 21:36:57,185 INFO L297 olderBase$Statistics]: existing Event has 283 ancestors and is not cut-off event [2025-01-09 21:36:58,674 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([939] L1029-4-->L1029-5: Formula: (= (store |v_#race_34| v_~datas~0.base_16 (store (select |v_#race_34| v_~datas~0.base_16) (+ v_threadThread1of1ForFork1_~i~0_7 v_~datas~0.offset_16) |v_threadThread1of1ForFork1_#t~nondet4_3|)) |v_#race_33|) InVars {#race=|v_#race_34|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet4=|v_threadThread1of1ForFork1_#t~nondet4_3|, ~datas~0.base=v_~datas~0.base_16, ~datas~0.offset=v_~datas~0.offset_16} OutVars{#race=|v_#race_33|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_7, threadThread1of1ForFork1_#t~nondet4=|v_threadThread1of1ForFork1_#t~nondet4_3|, ~datas~0.base=v_~datas~0.base_16, ~datas~0.offset=v_~datas~0.offset_16} AuxVars[] AssignedVars[#race][297], [452#(= |#race~threads_total~0| 0), Black: 511#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 513#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 512#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 514#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 104#L1035-7true, 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: 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, Black: 472#(= |#race~threads_alive~0| 0), 468#(= |#race~tids~0| 0), 589#true, Black: 475#true, 72#L1061-13true, 477#(= |#race~datas~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)), 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), 400#L1029-5true, 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-01-09 21:36:58,674 INFO L294 olderBase$Statistics]: this new event has 335 ancestors and is cut-off event [2025-01-09 21:36:58,674 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-01-09 21:36:58,674 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-01-09 21:36:58,674 INFO L297 olderBase$Statistics]: existing Event has 335 ancestors and is cut-off event [2025-01-09 21:36:59,167 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([946] L1030-2-->L1030-5: Formula: (and (= |v_#pthreadsMutex_119| (store |v_#pthreadsMutex_120| v_~datas_mutex~0.base_22 (store (select |v_#pthreadsMutex_120| v_~datas_mutex~0.base_22) (+ (* v_threadThread1of1ForFork1_~i~0_13 24) v_~datas_mutex~0.offset_22) 0))) (= |v_threadThread1of1ForFork1_#t~ret5_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_120|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_22, ~datas_mutex~0.base=v_~datas_mutex~0.base_22} OutVars{#pthreadsMutex=|v_#pthreadsMutex_119|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_22, threadThread1of1ForFork1_#t~ret5=|v_threadThread1of1ForFork1_#t~ret5_1|, ~datas_mutex~0.base=v_~datas_mutex~0.base_22} 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))), 445#true, Black: 524#(= (select (select |#memory_int| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), Black: 472#(= |#race~threads_alive~0| 0), 468#(= |#race~tids~0| 0), Black: 475#true, 477#(= |#race~datas~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)), Black: 542#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base))), 25#L1063-6true, Black: 497#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 519#true, 141#L1030-5true, 576#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 509#true, 464#(= |#race~datas_mutex~0| 0), 413#L1045-4true]) [2025-01-09 21:36:59,167 INFO L294 olderBase$Statistics]: this new event has 346 ancestors and is cut-off event [2025-01-09 21:36:59,167 INFO L297 olderBase$Statistics]: existing Event has 263 ancestors and is cut-off event [2025-01-09 21:36:59,167 INFO L297 olderBase$Statistics]: existing Event has 346 ancestors and is cut-off event [2025-01-09 21:36:59,167 INFO L297 olderBase$Statistics]: existing Event has 263 ancestors and is cut-off event [2025-01-09 21:36:59,219 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([946] L1030-2-->L1030-5: Formula: (and (= |v_#pthreadsMutex_119| (store |v_#pthreadsMutex_120| v_~datas_mutex~0.base_22 (store (select |v_#pthreadsMutex_120| v_~datas_mutex~0.base_22) (+ (* v_threadThread1of1ForFork1_~i~0_13 24) v_~datas_mutex~0.offset_22) 0))) (= |v_threadThread1of1ForFork1_#t~ret5_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_120|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_22, ~datas_mutex~0.base=v_~datas_mutex~0.base_22} OutVars{#pthreadsMutex=|v_#pthreadsMutex_119|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_22, threadThread1of1ForFork1_#t~ret5=|v_threadThread1of1ForFork1_#t~ret5_1|, ~datas_mutex~0.base=v_~datas_mutex~0.base_22} 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, Black: 472#(= |#race~threads_alive~0| 0), 468#(= |#race~tids~0| 0), Black: 475#true, Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 477#(= |#race~datas~0| 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)), 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, 141#L1030-5true, 282#L1063-7true, 509#true, 576#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 464#(= |#race~datas_mutex~0| 0), 413#L1045-4true]) [2025-01-09 21:36:59,219 INFO L294 olderBase$Statistics]: this new event has 347 ancestors and is cut-off event [2025-01-09 21:36:59,219 INFO L297 olderBase$Statistics]: existing Event has 264 ancestors and is cut-off event [2025-01-09 21:36:59,219 INFO L297 olderBase$Statistics]: existing Event has 264 ancestors and is cut-off event [2025-01-09 21:36:59,219 INFO L297 olderBase$Statistics]: existing Event has 347 ancestors and is cut-off event [2025-01-09 21:36:59,313 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([946] L1030-2-->L1030-5: Formula: (and (= |v_#pthreadsMutex_119| (store |v_#pthreadsMutex_120| v_~datas_mutex~0.base_22 (store (select |v_#pthreadsMutex_120| v_~datas_mutex~0.base_22) (+ (* v_threadThread1of1ForFork1_~i~0_13 24) v_~datas_mutex~0.offset_22) 0))) (= |v_threadThread1of1ForFork1_#t~ret5_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_120|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_22, ~datas_mutex~0.base=v_~datas_mutex~0.base_22} OutVars{#pthreadsMutex=|v_#pthreadsMutex_119|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_22, threadThread1of1ForFork1_#t~ret5=|v_threadThread1of1ForFork1_#t~ret5_1|, ~datas_mutex~0.base=v_~datas_mutex~0.base_22} 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|)), 20#L1065true, 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: 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, Black: 472#(= |#race~threads_alive~0| 0), 468#(= |#race~tids~0| 0), 589#true, Black: 475#true, 477#(= |#race~datas~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)), 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, 141#L1030-5true, 509#true, 576#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 464#(= |#race~datas_mutex~0| 0), 413#L1045-4true]) [2025-01-09 21:36:59,313 INFO L294 olderBase$Statistics]: this new event has 349 ancestors and is cut-off event [2025-01-09 21:36:59,313 INFO L297 olderBase$Statistics]: existing Event has 349 ancestors and is cut-off event [2025-01-09 21:36:59,313 INFO L297 olderBase$Statistics]: existing Event has 266 ancestors and is cut-off event [2025-01-09 21:36:59,313 INFO L297 olderBase$Statistics]: existing Event has 266 ancestors and is cut-off event [2025-01-09 21:36:59,361 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([946] L1030-2-->L1030-5: Formula: (and (= |v_#pthreadsMutex_119| (store |v_#pthreadsMutex_120| v_~datas_mutex~0.base_22 (store (select |v_#pthreadsMutex_120| v_~datas_mutex~0.base_22) (+ (* v_threadThread1of1ForFork1_~i~0_13 24) v_~datas_mutex~0.offset_22) 0))) (= |v_threadThread1of1ForFork1_#t~ret5_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_120|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_22, ~datas_mutex~0.base=v_~datas_mutex~0.base_22} OutVars{#pthreadsMutex=|v_#pthreadsMutex_119|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_22, threadThread1of1ForFork1_#t~ret5=|v_threadThread1of1ForFork1_#t~ret5_1|, ~datas_mutex~0.base=v_~datas_mutex~0.base_22} 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|)), 164#L1065-3true, 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: 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, Black: 472#(= |#race~threads_alive~0| 0), 468#(= |#race~tids~0| 0), 589#true, Black: 475#true, 477#(= |#race~datas~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)), 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, 141#L1030-5true, 509#true, 576#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 464#(= |#race~datas_mutex~0| 0), 413#L1045-4true]) [2025-01-09 21:36:59,361 INFO L294 olderBase$Statistics]: this new event has 350 ancestors and is cut-off event [2025-01-09 21:36:59,361 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2025-01-09 21:36:59,361 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2025-01-09 21:36:59,361 INFO L297 olderBase$Statistics]: existing Event has 350 ancestors and is cut-off event [2025-01-09 21:36:59,765 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([946] L1030-2-->L1030-5: Formula: (and (= |v_#pthreadsMutex_119| (store |v_#pthreadsMutex_120| v_~datas_mutex~0.base_22 (store (select |v_#pthreadsMutex_120| v_~datas_mutex~0.base_22) (+ (* v_threadThread1of1ForFork1_~i~0_13 24) v_~datas_mutex~0.offset_22) 0))) (= |v_threadThread1of1ForFork1_#t~ret5_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_120|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_22, ~datas_mutex~0.base=v_~datas_mutex~0.base_22} OutVars{#pthreadsMutex=|v_#pthreadsMutex_119|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_22, threadThread1of1ForFork1_#t~ret5=|v_threadThread1of1ForFork1_#t~ret5_1|, ~datas_mutex~0.base=v_~datas_mutex~0.base_22} 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|)), 63#L1067-3true, 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: 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, Black: 472#(= |#race~threads_alive~0| 0), 468#(= |#race~tids~0| 0), 589#true, Black: 475#true, Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 477#(= |#race~datas~0| 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)), 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, 141#L1030-5true, 509#true, 576#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 464#(= |#race~datas_mutex~0| 0), 413#L1045-4true]) [2025-01-09 21:36:59,765 INFO L294 olderBase$Statistics]: this new event has 359 ancestors and is cut-off event [2025-01-09 21:36:59,765 INFO L297 olderBase$Statistics]: existing Event has 276 ancestors and is cut-off event [2025-01-09 21:36:59,765 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2025-01-09 21:36:59,765 INFO L297 olderBase$Statistics]: existing Event has 276 ancestors and is cut-off event [2025-01-09 21:36:59,853 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([946] L1030-2-->L1030-5: Formula: (and (= |v_#pthreadsMutex_119| (store |v_#pthreadsMutex_120| v_~datas_mutex~0.base_22 (store (select |v_#pthreadsMutex_120| v_~datas_mutex~0.base_22) (+ (* v_threadThread1of1ForFork1_~i~0_13 24) v_~datas_mutex~0.offset_22) 0))) (= |v_threadThread1of1ForFork1_#t~ret5_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_120|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_22, ~datas_mutex~0.base=v_~datas_mutex~0.base_22} OutVars{#pthreadsMutex=|v_#pthreadsMutex_119|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_22, threadThread1of1ForFork1_#t~ret5=|v_threadThread1of1ForFork1_#t~ret5_1|, ~datas_mutex~0.base=v_~datas_mutex~0.base_22} 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: 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, Black: 470#true, 468#(= |#race~tids~0| 0), 589#true, Black: 475#true, Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 477#(= |#race~datas~0| 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)), 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, 141#L1030-5true, 309#L1068-1true, 509#true, 576#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 464#(= |#race~datas_mutex~0| 0), 413#L1045-4true]) [2025-01-09 21:36:59,853 INFO L294 olderBase$Statistics]: this new event has 361 ancestors and is cut-off event [2025-01-09 21:36:59,853 INFO L297 olderBase$Statistics]: existing Event has 278 ancestors and is cut-off event [2025-01-09 21:36:59,853 INFO L297 olderBase$Statistics]: existing Event has 278 ancestors and is cut-off event [2025-01-09 21:36:59,853 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2025-01-09 21:36:59,968 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([946] L1030-2-->L1030-5: Formula: (and (= |v_#pthreadsMutex_119| (store |v_#pthreadsMutex_120| v_~datas_mutex~0.base_22 (store (select |v_#pthreadsMutex_120| v_~datas_mutex~0.base_22) (+ (* v_threadThread1of1ForFork1_~i~0_13 24) v_~datas_mutex~0.offset_22) 0))) (= |v_threadThread1of1ForFork1_#t~ret5_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_120|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_22, ~datas_mutex~0.base=v_~datas_mutex~0.base_22} OutVars{#pthreadsMutex=|v_#pthreadsMutex_119|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_22, threadThread1of1ForFork1_#t~ret5=|v_threadThread1of1ForFork1_#t~ret5_1|, ~datas_mutex~0.base=v_~datas_mutex~0.base_22} 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: 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, Black: 470#true, 468#(= |#race~tids~0| 0), 589#true, 272#L1069-2true, Black: 475#true, Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 477#(= |#race~datas~0| 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)), 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, 141#L1030-5true, 509#true, 576#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 464#(= |#race~datas_mutex~0| 0), 413#L1045-4true]) [2025-01-09 21:36:59,968 INFO L294 olderBase$Statistics]: this new event has 364 ancestors and is cut-off event [2025-01-09 21:36:59,968 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-01-09 21:36:59,968 INFO L297 olderBase$Statistics]: existing Event has 364 ancestors and is cut-off event [2025-01-09 21:36:59,968 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-01-09 21:36:59,989 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([946] L1030-2-->L1030-5: Formula: (and (= |v_#pthreadsMutex_119| (store |v_#pthreadsMutex_120| v_~datas_mutex~0.base_22 (store (select |v_#pthreadsMutex_120| v_~datas_mutex~0.base_22) (+ (* v_threadThread1of1ForFork1_~i~0_13 24) v_~datas_mutex~0.offset_22) 0))) (= |v_threadThread1of1ForFork1_#t~ret5_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_120|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_22, ~datas_mutex~0.base=v_~datas_mutex~0.base_22} OutVars{#pthreadsMutex=|v_#pthreadsMutex_119|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_22, threadThread1of1ForFork1_#t~ret5=|v_threadThread1of1ForFork1_#t~ret5_1|, ~datas_mutex~0.base=v_~datas_mutex~0.base_22} 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: 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, Black: 470#true, 468#(= |#race~tids~0| 0), 589#true, Black: 475#true, Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 477#(= |#race~datas~0| 0), 403#L1070-2true, 443#true, Black: 553#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 486#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 541#(not (= ~datas~0.base ~tids~0.base)), Black: 542#(and (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0) (not (= ~datas~0.base ~tids~0.base))), Black: 497#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 519#true, 141#L1030-5true, 509#true, 576#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 464#(= |#race~datas_mutex~0| 0), 413#L1045-4true]) [2025-01-09 21:36:59,990 INFO L294 olderBase$Statistics]: this new event has 364 ancestors and is cut-off event [2025-01-09 21:36:59,990 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-01-09 21:36:59,990 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2025-01-09 21:36:59,990 INFO L297 olderBase$Statistics]: existing Event has 364 ancestors and is cut-off event [2025-01-09 21:37:00,026 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([946] L1030-2-->L1030-5: Formula: (and (= |v_#pthreadsMutex_119| (store |v_#pthreadsMutex_120| v_~datas_mutex~0.base_22 (store (select |v_#pthreadsMutex_120| v_~datas_mutex~0.base_22) (+ (* v_threadThread1of1ForFork1_~i~0_13 24) v_~datas_mutex~0.offset_22) 0))) (= |v_threadThread1of1ForFork1_#t~ret5_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_120|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_22, ~datas_mutex~0.base=v_~datas_mutex~0.base_22} OutVars{#pthreadsMutex=|v_#pthreadsMutex_119|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_22, threadThread1of1ForFork1_#t~ret5=|v_threadThread1of1ForFork1_#t~ret5_1|, ~datas_mutex~0.base=v_~datas_mutex~0.base_22} 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: 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, Black: 470#true, 468#(= |#race~tids~0| 0), 589#true, Black: 475#true, Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 477#(= |#race~datas~0| 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)), 52#L1069-5true, 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, 141#L1030-5true, 509#true, 576#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 464#(= |#race~datas_mutex~0| 0), 413#L1045-4true]) [2025-01-09 21:37:00,027 INFO L294 olderBase$Statistics]: this new event has 365 ancestors and is cut-off event [2025-01-09 21:37:00,027 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-01-09 21:37:00,027 INFO L297 olderBase$Statistics]: existing Event has 282 ancestors and is cut-off event [2025-01-09 21:37:00,027 INFO L297 olderBase$Statistics]: existing Event has 365 ancestors and is cut-off event [2025-01-09 21:37:00,064 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([563] L1061-5-->L1061-6: Formula: (= (store |v_#race_20| v_~tids~0.base_11 (store (select |v_#race_20| v_~tids~0.base_11) (+ (* |v_ULTIMATE.start_main_~i~3#1_6| 4) v_~tids~0.offset_11) |v_ULTIMATE.start_main_#t~nondet28#1_3|)) |v_#race_19|) InVars {#race=|v_#race_20|, ~tids~0.offset=v_~tids~0.offset_11, ~tids~0.base=v_~tids~0.base_11, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_6|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_3|} OutVars{#race=|v_#race_19|, ~tids~0.offset=v_~tids~0.offset_11, ~tids~0.base=v_~tids~0.base_11, ULTIMATE.start_main_~i~3#1=|v_ULTIMATE.start_main_~i~3#1_6|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_3|} AuxVars[] AssignedVars[#race][236], [452#(= |#race~threads_total~0| 0), Black: 513#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 512#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 514#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 104#L1035-7true, Black: 582#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 584#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 580#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (not (= ~datas~0.base ~tids~0.base)) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= 1 (select |#valid| ~tids~0.base))), Black: 462#true, 551#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 523#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base)), Black: 525#(= |cleanerThread1of1ForFork0_#t~mem7| 0), Black: 466#true, Black: 531#(and (= |cleanerThread1of1ForFork0_#t~mem7| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base))), Black: 524#(= (select (select |#memory_int| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork0_~i~1)) 0), 445#true, Black: 472#(= |#race~threads_alive~0| 0), 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: 475#true, 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), 477#(= |#race~datas~0| 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)), 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), 400#L1029-5true, 519#true, 28#L1061-6true, 464#(= |#race~datas_mutex~0| 0)]) [2025-01-09 21:37:00,064 INFO L294 olderBase$Statistics]: this new event has 362 ancestors and is cut-off event [2025-01-09 21:37:00,064 INFO L297 olderBase$Statistics]: existing Event has 279 ancestors and is cut-off event [2025-01-09 21:37:00,064 INFO L297 olderBase$Statistics]: existing Event has 279 ancestors and is cut-off event [2025-01-09 21:37:00,065 INFO L297 olderBase$Statistics]: existing Event has 362 ancestors and is cut-off event [2025-01-09 21:37:00,087 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([946] L1030-2-->L1030-5: Formula: (and (= |v_#pthreadsMutex_119| (store |v_#pthreadsMutex_120| v_~datas_mutex~0.base_22 (store (select |v_#pthreadsMutex_120| v_~datas_mutex~0.base_22) (+ (* v_threadThread1of1ForFork1_~i~0_13 24) v_~datas_mutex~0.offset_22) 0))) (= |v_threadThread1of1ForFork1_#t~ret5_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_120|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_22, ~datas_mutex~0.base=v_~datas_mutex~0.base_22} OutVars{#pthreadsMutex=|v_#pthreadsMutex_119|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_22, threadThread1of1ForFork1_#t~ret5=|v_threadThread1of1ForFork1_#t~ret5_1|, ~datas_mutex~0.base=v_~datas_mutex~0.base_22} 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, Black: 472#(= |#race~threads_alive~0| 0), 468#(= |#race~tids~0| 0), Black: 475#true, 477#(= |#race~datas~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)), 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, 141#L1030-5true, 282#L1063-7true, 509#true, 576#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 464#(= |#race~datas_mutex~0| 0), 413#L1045-4true]) [2025-01-09 21:37:00,088 INFO L294 olderBase$Statistics]: this new event has 368 ancestors and is cut-off event [2025-01-09 21:37:00,088 INFO L297 olderBase$Statistics]: existing Event has 264 ancestors and is cut-off event [2025-01-09 21:37:00,088 INFO L297 olderBase$Statistics]: existing Event has 264 ancestors and is cut-off event [2025-01-09 21:37:00,088 INFO L297 olderBase$Statistics]: existing Event has 347 ancestors and is cut-off event [2025-01-09 21:37:00,088 INFO L297 olderBase$Statistics]: existing Event has 347 ancestors and is cut-off event [2025-01-09 21:37:00,088 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([946] L1030-2-->L1030-5: Formula: (and (= |v_#pthreadsMutex_119| (store |v_#pthreadsMutex_120| v_~datas_mutex~0.base_22 (store (select |v_#pthreadsMutex_120| v_~datas_mutex~0.base_22) (+ (* v_threadThread1of1ForFork1_~i~0_13 24) v_~datas_mutex~0.offset_22) 0))) (= |v_threadThread1of1ForFork1_#t~ret5_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_120|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_22, ~datas_mutex~0.base=v_~datas_mutex~0.base_22} OutVars{#pthreadsMutex=|v_#pthreadsMutex_119|, threadThread1of1ForFork1_~i~0=v_threadThread1of1ForFork1_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_22, threadThread1of1ForFork1_#t~ret5=|v_threadThread1of1ForFork1_#t~ret5_1|, ~datas_mutex~0.base=v_~datas_mutex~0.base_22} 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, Black: 472#(= |#race~threads_alive~0| 0), 468#(= |#race~tids~0| 0), Black: 475#true, 477#(= |#race~datas~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)), 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), 25#L1063-6true, 519#true, 141#L1030-5true, 509#true, 576#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 464#(= |#race~datas_mutex~0| 0), 413#L1045-4true]) [2025-01-09 21:37:00,089 INFO L294 olderBase$Statistics]: this new event has 367 ancestors and is cut-off event [2025-01-09 21:37:00,089 INFO L297 olderBase$Statistics]: existing Event has 263 ancestors and is cut-off event [2025-01-09 21:37:00,089 INFO L297 olderBase$Statistics]: existing Event has 346 ancestors and is cut-off event [2025-01-09 21:37:00,089 INFO L297 olderBase$Statistics]: existing Event has 346 ancestors and is cut-off event [2025-01-09 21:37:00,089 INFO L297 olderBase$Statistics]: existing Event has 263 ancestors and is cut-off event