./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-array-join-counter-race-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-array-join-counter-race-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 534bdd637f5e5b671357d3ac8ec1b617321ae1d1d7a44132336275a64f61ed0f --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:29:14,570 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:29:14,631 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-04-30 10:29:14,635 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:29:14,637 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:29:14,660 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:29:14,661 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:29:14,661 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:29:14,662 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:29:14,662 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:29:14,663 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:29:14,663 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:29:14,663 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:29:14,663 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:29:14,663 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:29:14,664 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:29:14,664 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:29:14,664 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:29:14,664 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:29:14,664 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:29:14,664 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:29:14,664 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:29:14,664 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-30 10:29:14,664 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:29:14,664 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:29:14,664 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:29:14,665 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:29:14,665 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:29:14,665 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:29:14,665 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:29:14,665 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:29:14,665 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:29:14,665 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:29:14,665 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:29:14,665 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:29:14,666 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:29:14,666 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:29:14,666 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:29:14,666 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:29:14,666 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:29:14,666 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:29:14,666 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:29:14,666 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:29:14,666 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:29:14,667 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:29:14,667 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 534bdd637f5e5b671357d3ac8ec1b617321ae1d1d7a44132336275a64f61ed0f [2025-04-30 10:29:14,880 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:29:14,885 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:29:14,888 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:29:14,889 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:29:14,889 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:29:14,891 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-array-join-counter-race-2.i [2025-04-30 10:29:16,194 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b23f4c10/14b224a6aa9e47a5844be4843abd1efb/FLAG2a4bd1117 [2025-04-30 10:29:16,435 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:29:16,436 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-race-challenges/per-thread-array-join-counter-race-2.i [2025-04-30 10:29:16,456 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b23f4c10/14b224a6aa9e47a5844be4843abd1efb/FLAG2a4bd1117 [2025-04-30 10:29:17,195 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b23f4c10/14b224a6aa9e47a5844be4843abd1efb [2025-04-30 10:29:17,197 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:29:17,198 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:29:17,199 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:29:17,199 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:29:17,202 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:29:17,202 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:29:17" (1/1) ... [2025-04-30 10:29:17,203 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@174384f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:29:17, skipping insertion in model container [2025-04-30 10:29:17,203 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:29:17" (1/1) ... [2025-04-30 10:29:17,230 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:29:17,582 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:29:17,606 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:29:17,669 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:29:17,714 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:29:17,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:29:17 WrapperNode [2025-04-30 10:29:17,714 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:29:17,715 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:29:17,716 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:29:17,716 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:29:17,720 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:29:17" (1/1) ... [2025-04-30 10:29:17,736 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:29:17" (1/1) ... [2025-04-30 10:29:17,755 INFO L138 Inliner]: procedures = 267, calls = 41, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 265 [2025-04-30 10:29:17,756 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:29:17,756 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:29:17,756 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:29:17,756 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:29:17,761 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:29:17" (1/1) ... [2025-04-30 10:29:17,762 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:29:17" (1/1) ... [2025-04-30 10:29:17,766 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:29:17" (1/1) ... [2025-04-30 10:29:17,766 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:29:17" (1/1) ... [2025-04-30 10:29:17,773 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:29:17" (1/1) ... [2025-04-30 10:29:17,775 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:29:17" (1/1) ... [2025-04-30 10:29:17,777 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:29:17" (1/1) ... [2025-04-30 10:29:17,782 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:29:17" (1/1) ... [2025-04-30 10:29:17,783 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:29:17" (1/1) ... [2025-04-30 10:29:17,787 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:29:17,788 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:29:17,788 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:29:17,788 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:29:17,788 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:29:17" (1/1) ... [2025-04-30 10:29:17,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:29:17,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:29:17,816 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-30 10:29:17,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-30 10:29:17,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-30 10:29:17,839 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-30 10:29:17,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-30 10:29:17,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-30 10:29:17,839 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-30 10:29:17,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-30 10:29:17,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:29:17,840 INFO L130 BoogieDeclarations]: Found specification of procedure cleaner [2025-04-30 10:29:17,840 INFO L138 BoogieDeclarations]: Found implementation of procedure cleaner [2025-04-30 10:29:17,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-30 10:29:17,840 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-04-30 10:29:17,840 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-04-30 10:29:17,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:29:17,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:29:17,841 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-30 10:29:17,950 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:29:17,951 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:29:18,317 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-30 10:29:18,318 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:29:18,374 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:29:18,375 INFO L312 CfgBuilder]: Removed 5 assume(true) statements. [2025-04-30 10:29:18,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:29:18 BoogieIcfgContainer [2025-04-30 10:29:18,375 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:29:18,377 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:29:18,377 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:29:18,380 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:29:18,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:29:17" (1/3) ... [2025-04-30 10:29:18,380 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@287d24a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:29:18, skipping insertion in model container [2025-04-30 10:29:18,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:29:17" (2/3) ... [2025-04-30 10:29:18,381 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@287d24a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:29:18, skipping insertion in model container [2025-04-30 10:29:18,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:29:18" (3/3) ... [2025-04-30 10:29:18,382 INFO L128 eAbstractionObserver]: Analyzing ICFG per-thread-array-join-counter-race-2.i [2025-04-30 10:29:18,392 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:29:18,394 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG per-thread-array-join-counter-race-2.i that has 3 procedures, 386 locations, 394 edges, 1 initial locations, 5 loop locations, and 34 error locations. [2025-04-30 10:29:18,394 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-30 10:29:18,470 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-30 10:29:18,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 460 places, 467 transitions, 948 flow [2025-04-30 10:29:18,655 INFO L116 PetriNetUnfolderBase]: 19/586 cut-off events. [2025-04-30 10:29:18,657 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-30 10:29:18,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 597 conditions, 586 events. 19/586 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 906 event pairs, 0 based on Foata normal form. 0/503 useless extension candidates. Maximal degree in co-relation 374. Up to 6 conditions per place. [2025-04-30 10:29:18,674 INFO L82 GeneralOperation]: Start removeDead. Operand has 460 places, 467 transitions, 948 flow [2025-04-30 10:29:18,682 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 391 places, 395 transitions, 800 flow [2025-04-30 10:29:18,692 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:29:18,702 INFO L340 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;@e8ca7f3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:29:18,704 INFO L341 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2025-04-30 10:29:18,736 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:29:18,738 INFO L116 PetriNetUnfolderBase]: 0/147 cut-off events. [2025-04-30 10:29:18,738 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:29:18,738 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:18,739 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] [2025-04-30 10:29:18,740 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-04-30 10:29:18,743 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:18,744 INFO L85 PathProgramCache]: Analyzing trace with hash -2108841411, now seen corresponding path program 1 times [2025-04-30 10:29:18,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:18,751 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050836730] [2025-04-30 10:29:18,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:18,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:18,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-04-30 10:29:18,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-04-30 10:29:18,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:18,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:19,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:29:19,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:19,075 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050836730] [2025-04-30 10:29:19,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050836730] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:19,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:19,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:29:19,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900491207] [2025-04-30 10:29:19,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:19,082 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:29:19,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:19,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:29:19,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:29:19,146 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 422 out of 467 [2025-04-30 10:29:19,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 395 transitions, 800 flow. Second operand has 3 states, 3 states have (on average 423.3333333333333) internal successors, (1270), 3 states have internal predecessors, (1270), 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-04-30 10:29:19,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:19,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 422 of 467 [2025-04-30 10:29:19,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:19,920 INFO L116 PetriNetUnfolderBase]: 654/4276 cut-off events. [2025-04-30 10:29:19,921 INFO L117 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-04-30 10:29:19,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5312 conditions, 4276 events. 654/4276 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 33102 event pairs, 489 based on Foata normal form. 182/3762 useless extension candidates. Maximal degree in co-relation 5080. Up to 1006 conditions per place. [2025-04-30 10:29:19,950 INFO L140 encePairwiseOnDemand]: 458/467 looper letters, 28 selfloop transitions, 2 changer transitions 1/386 dead transitions. [2025-04-30 10:29:19,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 386 transitions, 842 flow [2025-04-30 10:29:19,951 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:29:19,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:29:19,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1303 transitions. [2025-04-30 10:29:19,963 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9300499643112062 [2025-04-30 10:29:19,967 INFO L175 Difference]: Start difference. First operand has 391 places, 395 transitions, 800 flow. Second operand 3 states and 1303 transitions. [2025-04-30 10:29:19,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 386 transitions, 842 flow [2025-04-30 10:29:19,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 386 transitions, 841 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:29:19,980 INFO L231 Difference]: Finished difference. Result has 388 places, 385 transitions, 783 flow [2025-04-30 10:29:19,985 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=781, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=384, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=783, PETRI_PLACES=388, PETRI_TRANSITIONS=385} [2025-04-30 10:29:19,989 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, -3 predicate places. [2025-04-30 10:29:19,989 INFO L485 AbstractCegarLoop]: Abstraction has has 388 places, 385 transitions, 783 flow [2025-04-30 10:29:19,990 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 423.3333333333333) internal successors, (1270), 3 states have internal predecessors, (1270), 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-04-30 10:29:19,990 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:19,991 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] [2025-04-30 10:29:19,991 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:29:19,991 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-04-30 10:29:19,992 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:19,993 INFO L85 PathProgramCache]: Analyzing trace with hash -2092754096, now seen corresponding path program 1 times [2025-04-30 10:29:19,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:19,994 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088352390] [2025-04-30 10:29:19,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:19,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:20,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-04-30 10:29:20,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-04-30 10:29:20,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:20,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:20,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:29:20,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:20,136 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088352390] [2025-04-30 10:29:20,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088352390] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:20,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:20,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:29:20,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800717019] [2025-04-30 10:29:20,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:20,138 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:29:20,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:20,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:29:20,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:29:20,171 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 467 [2025-04-30 10:29:20,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 385 transitions, 783 flow. Second operand has 3 states, 3 states have (on average 413.0) internal successors, (1239), 3 states have internal predecessors, (1239), 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-04-30 10:29:20,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:20,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 467 [2025-04-30 10:29:20,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:20,762 INFO L116 PetriNetUnfolderBase]: 760/4471 cut-off events. [2025-04-30 10:29:20,763 INFO L117 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-04-30 10:29:20,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5685 conditions, 4471 events. 760/4471 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 34848 event pairs, 564 based on Foata normal form. 0/3819 useless extension candidates. Maximal degree in co-relation 5528. Up to 1180 conditions per place. [2025-04-30 10:29:20,786 INFO L140 encePairwiseOnDemand]: 459/467 looper letters, 31 selfloop transitions, 1 changer transitions 0/378 dead transitions. [2025-04-30 10:29:20,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 378 transitions, 833 flow [2025-04-30 10:29:20,786 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:29:20,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:29:20,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1275 transitions. [2025-04-30 10:29:20,789 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9100642398286938 [2025-04-30 10:29:20,789 INFO L175 Difference]: Start difference. First operand has 388 places, 385 transitions, 783 flow. Second operand 3 states and 1275 transitions. [2025-04-30 10:29:20,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 378 transitions, 833 flow [2025-04-30 10:29:20,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 378 transitions, 829 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:29:20,796 INFO L231 Difference]: Finished difference. Result has 380 places, 378 transitions, 767 flow [2025-04-30 10:29:20,797 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=765, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=767, PETRI_PLACES=380, PETRI_TRANSITIONS=378} [2025-04-30 10:29:20,798 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, -11 predicate places. [2025-04-30 10:29:20,798 INFO L485 AbstractCegarLoop]: Abstraction has has 380 places, 378 transitions, 767 flow [2025-04-30 10:29:20,799 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.0) internal successors, (1239), 3 states have internal predecessors, (1239), 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-04-30 10:29:20,799 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:20,799 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] [2025-04-30 10:29:20,799 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:29:20,800 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-04-30 10:29:20,800 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:20,800 INFO L85 PathProgramCache]: Analyzing trace with hash -404228134, now seen corresponding path program 1 times [2025-04-30 10:29:20,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:20,801 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443389884] [2025-04-30 10:29:20,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:20,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:20,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-04-30 10:29:20,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-04-30 10:29:20,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:20,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:20,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:29:20,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:20,952 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443389884] [2025-04-30 10:29:20,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443389884] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:20,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:20,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:29:20,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017928346] [2025-04-30 10:29:20,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:20,952 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:29:20,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:20,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:29:20,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:29:20,976 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 467 [2025-04-30 10:29:20,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 378 transitions, 767 flow. Second operand has 3 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 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-04-30 10:29:20,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:20,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 467 [2025-04-30 10:29:20,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:21,553 INFO L116 PetriNetUnfolderBase]: 725/4655 cut-off events. [2025-04-30 10:29:21,553 INFO L117 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-04-30 10:29:21,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5798 conditions, 4655 events. 725/4655 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 37766 event pairs, 548 based on Foata normal form. 0/3944 useless extension candidates. Maximal degree in co-relation 5641. Up to 1111 conditions per place. [2025-04-30 10:29:21,595 INFO L140 encePairwiseOnDemand]: 464/467 looper letters, 24 selfloop transitions, 2 changer transitions 0/377 dead transitions. [2025-04-30 10:29:21,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 377 transitions, 817 flow [2025-04-30 10:29:21,596 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:29:21,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:29:21,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1305 transitions. [2025-04-30 10:29:21,600 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9314775160599572 [2025-04-30 10:29:21,600 INFO L175 Difference]: Start difference. First operand has 380 places, 378 transitions, 767 flow. Second operand 3 states and 1305 transitions. [2025-04-30 10:29:21,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 377 transitions, 817 flow [2025-04-30 10:29:21,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 377 transitions, 816 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:29:21,606 INFO L231 Difference]: Finished difference. Result has 380 places, 377 transitions, 768 flow [2025-04-30 10:29:21,607 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=764, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=768, PETRI_PLACES=380, PETRI_TRANSITIONS=377} [2025-04-30 10:29:21,607 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, -11 predicate places. [2025-04-30 10:29:21,607 INFO L485 AbstractCegarLoop]: Abstraction has has 380 places, 377 transitions, 768 flow [2025-04-30 10:29:21,609 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 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-04-30 10:29:21,609 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:21,609 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:29:21,609 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:29:21,609 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-04-30 10:29:21,610 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:21,610 INFO L85 PathProgramCache]: Analyzing trace with hash -357020463, now seen corresponding path program 1 times [2025-04-30 10:29:21,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:21,610 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99495729] [2025-04-30 10:29:21,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:21,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:21,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-04-30 10:29:21,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-04-30 10:29:21,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:21,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:21,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:29:21,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:21,737 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99495729] [2025-04-30 10:29:21,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99495729] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:21,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:21,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:29:21,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620637375] [2025-04-30 10:29:21,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:21,738 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:29:21,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:21,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:29:21,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:29:21,767 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 425 out of 467 [2025-04-30 10:29:21,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 377 transitions, 768 flow. Second operand has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 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-04-30 10:29:21,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:21,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 425 of 467 [2025-04-30 10:29:21,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:22,222 INFO L116 PetriNetUnfolderBase]: 849/4491 cut-off events. [2025-04-30 10:29:22,222 INFO L117 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-04-30 10:29:22,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5798 conditions, 4491 events. 849/4491 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 34762 event pairs, 607 based on Foata normal form. 0/3824 useless extension candidates. Maximal degree in co-relation 5641. Up to 1267 conditions per place. [2025-04-30 10:29:22,252 INFO L140 encePairwiseOnDemand]: 464/467 looper letters, 24 selfloop transitions, 2 changer transitions 0/376 dead transitions. [2025-04-30 10:29:22,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 376 transitions, 818 flow [2025-04-30 10:29:22,252 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:29:22,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:29:22,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1302 transitions. [2025-04-30 10:29:22,255 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9293361884368309 [2025-04-30 10:29:22,255 INFO L175 Difference]: Start difference. First operand has 380 places, 377 transitions, 768 flow. Second operand 3 states and 1302 transitions. [2025-04-30 10:29:22,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 376 transitions, 818 flow [2025-04-30 10:29:22,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 376 transitions, 814 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:29:22,260 INFO L231 Difference]: Finished difference. Result has 379 places, 376 transitions, 766 flow [2025-04-30 10:29:22,261 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=762, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=766, PETRI_PLACES=379, PETRI_TRANSITIONS=376} [2025-04-30 10:29:22,262 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, -12 predicate places. [2025-04-30 10:29:22,263 INFO L485 AbstractCegarLoop]: Abstraction has has 379 places, 376 transitions, 766 flow [2025-04-30 10:29:22,264 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 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-04-30 10:29:22,264 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:22,264 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-04-30 10:29:22,264 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:29:22,264 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-04-30 10:29:22,265 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:22,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1438810501, now seen corresponding path program 1 times [2025-04-30 10:29:22,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:22,266 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385587882] [2025-04-30 10:29:22,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:22,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:22,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-04-30 10:29:22,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-04-30 10:29:22,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:22,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:22,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:29:22,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:22,377 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385587882] [2025-04-30 10:29:22,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385587882] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:22,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:22,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:29:22,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496565179] [2025-04-30 10:29:22,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:22,377 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:29:22,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:22,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:29:22,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:29:22,416 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 423 out of 467 [2025-04-30 10:29:22,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 376 transitions, 766 flow. Second operand has 3 states, 3 states have (on average 424.3333333333333) internal successors, (1273), 3 states have internal predecessors, (1273), 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-04-30 10:29:22,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:22,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 423 of 467 [2025-04-30 10:29:22,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:22,866 INFO L116 PetriNetUnfolderBase]: 991/4610 cut-off events. [2025-04-30 10:29:22,867 INFO L117 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-04-30 10:29:22,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6127 conditions, 4610 events. 991/4610 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 36125 event pairs, 713 based on Foata normal form. 0/3941 useless extension candidates. Maximal degree in co-relation 5970. Up to 1475 conditions per place. [2025-04-30 10:29:22,898 INFO L140 encePairwiseOnDemand]: 464/467 looper letters, 26 selfloop transitions, 2 changer transitions 0/375 dead transitions. [2025-04-30 10:29:22,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 375 transitions, 820 flow [2025-04-30 10:29:22,898 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:29:22,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:29:22,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1298 transitions. [2025-04-30 10:29:22,901 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.926481084939329 [2025-04-30 10:29:22,901 INFO L175 Difference]: Start difference. First operand has 379 places, 376 transitions, 766 flow. Second operand 3 states and 1298 transitions. [2025-04-30 10:29:22,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 375 transitions, 820 flow [2025-04-30 10:29:22,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 375 transitions, 816 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:29:22,907 INFO L231 Difference]: Finished difference. Result has 378 places, 375 transitions, 764 flow [2025-04-30 10:29:22,908 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=760, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=764, PETRI_PLACES=378, PETRI_TRANSITIONS=375} [2025-04-30 10:29:22,909 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, -13 predicate places. [2025-04-30 10:29:22,909 INFO L485 AbstractCegarLoop]: Abstraction has has 378 places, 375 transitions, 764 flow [2025-04-30 10:29:22,910 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 424.3333333333333) internal successors, (1273), 3 states have internal predecessors, (1273), 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-04-30 10:29:22,912 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:22,913 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] [2025-04-30 10:29:22,913 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:29:22,913 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-04-30 10:29:22,913 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:22,913 INFO L85 PathProgramCache]: Analyzing trace with hash -12642578, now seen corresponding path program 1 times [2025-04-30 10:29:22,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:22,914 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123817193] [2025-04-30 10:29:22,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:22,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:22,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-04-30 10:29:22,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-04-30 10:29:22,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:22,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:23,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:29:23,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:23,029 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123817193] [2025-04-30 10:29:23,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123817193] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:23,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:23,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:29:23,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93297857] [2025-04-30 10:29:23,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:23,030 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:29:23,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:23,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:29:23,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:29:23,061 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 467 [2025-04-30 10:29:23,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 375 transitions, 764 flow. Second operand has 3 states, 3 states have (on average 416.0) internal successors, (1248), 3 states have internal predecessors, (1248), 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-04-30 10:29:23,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:23,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 467 [2025-04-30 10:29:23,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:23,526 INFO L116 PetriNetUnfolderBase]: 1451/5118 cut-off events. [2025-04-30 10:29:23,526 INFO L117 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2025-04-30 10:29:23,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7312 conditions, 5118 events. 1451/5118 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 39135 event pairs, 507 based on Foata normal form. 0/4530 useless extension candidates. Maximal degree in co-relation 7156. Up to 2100 conditions per place. [2025-04-30 10:29:23,559 INFO L140 encePairwiseOnDemand]: 459/467 looper letters, 38 selfloop transitions, 3 changer transitions 0/383 dead transitions. [2025-04-30 10:29:23,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 383 transitions, 867 flow [2025-04-30 10:29:23,560 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:29:23,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:29:23,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1291 transitions. [2025-04-30 10:29:23,563 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9214846538187009 [2025-04-30 10:29:23,563 INFO L175 Difference]: Start difference. First operand has 378 places, 375 transitions, 764 flow. Second operand 3 states and 1291 transitions. [2025-04-30 10:29:23,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 383 transitions, 867 flow [2025-04-30 10:29:23,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 383 transitions, 863 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:29:23,568 INFO L231 Difference]: Finished difference. Result has 374 places, 373 transitions, 771 flow [2025-04-30 10:29:23,569 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=771, PETRI_PLACES=374, PETRI_TRANSITIONS=373} [2025-04-30 10:29:23,569 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, -17 predicate places. [2025-04-30 10:29:23,569 INFO L485 AbstractCegarLoop]: Abstraction has has 374 places, 373 transitions, 771 flow [2025-04-30 10:29:23,570 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 416.0) internal successors, (1248), 3 states have internal predecessors, (1248), 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-04-30 10:29:23,570 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:23,570 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] [2025-04-30 10:29:23,570 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:29:23,571 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-04-30 10:29:23,571 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:23,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1660382984, now seen corresponding path program 1 times [2025-04-30 10:29:23,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:23,571 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151334550] [2025-04-30 10:29:23,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:23,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:23,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-04-30 10:29:23,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-04-30 10:29:23,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:23,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:23,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:29:23,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:23,637 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151334550] [2025-04-30 10:29:23,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151334550] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:23,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:23,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:29:23,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80382146] [2025-04-30 10:29:23,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:23,637 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:29:23,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:23,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:29:23,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:29:23,652 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 424 out of 467 [2025-04-30 10:29:23,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 373 transitions, 771 flow. Second operand has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 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-04-30 10:29:23,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:23,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 424 of 467 [2025-04-30 10:29:23,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:24,244 INFO L116 PetriNetUnfolderBase]: 971/5688 cut-off events. [2025-04-30 10:29:24,245 INFO L117 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2025-04-30 10:29:24,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7384 conditions, 5688 events. 971/5688 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 49141 event pairs, 625 based on Foata normal form. 0/5048 useless extension candidates. Maximal degree in co-relation 7228. Up to 1488 conditions per place. [2025-04-30 10:29:24,276 INFO L140 encePairwiseOnDemand]: 461/467 looper letters, 30 selfloop transitions, 3 changer transitions 0/379 dead transitions. [2025-04-30 10:29:24,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 379 transitions, 849 flow [2025-04-30 10:29:24,276 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:29:24,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:29:24,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1308 transitions. [2025-04-30 10:29:24,279 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9336188436830836 [2025-04-30 10:29:24,279 INFO L175 Difference]: Start difference. First operand has 374 places, 373 transitions, 771 flow. Second operand 3 states and 1308 transitions. [2025-04-30 10:29:24,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 379 transitions, 849 flow [2025-04-30 10:29:24,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 379 transitions, 849 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:29:24,283 INFO L231 Difference]: Finished difference. Result has 374 places, 373 transitions, 786 flow [2025-04-30 10:29:24,284 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=765, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=786, PETRI_PLACES=374, PETRI_TRANSITIONS=373} [2025-04-30 10:29:24,284 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, -17 predicate places. [2025-04-30 10:29:24,284 INFO L485 AbstractCegarLoop]: Abstraction has has 374 places, 373 transitions, 786 flow [2025-04-30 10:29:24,285 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 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-04-30 10:29:24,285 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:24,285 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] [2025-04-30 10:29:24,285 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:29:24,286 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-04-30 10:29:24,286 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:24,286 INFO L85 PathProgramCache]: Analyzing trace with hash 39763656, now seen corresponding path program 1 times [2025-04-30 10:29:24,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:24,286 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091072673] [2025-04-30 10:29:24,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:24,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:24,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-04-30 10:29:24,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-04-30 10:29:24,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:24,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:24,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:29:24,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:24,360 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091072673] [2025-04-30 10:29:24,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091072673] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:24,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:24,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:29:24,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17460249] [2025-04-30 10:29:24,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:24,363 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:29:24,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:24,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:29:24,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:29:24,392 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 422 out of 467 [2025-04-30 10:29:24,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 373 transitions, 786 flow. Second operand has 3 states, 3 states have (on average 423.3333333333333) internal successors, (1270), 3 states have internal predecessors, (1270), 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-04-30 10:29:24,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:24,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 422 of 467 [2025-04-30 10:29:24,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:25,240 INFO L116 PetriNetUnfolderBase]: 1749/8110 cut-off events. [2025-04-30 10:29:25,240 INFO L117 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2025-04-30 10:29:25,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11188 conditions, 8110 events. 1749/8110 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 71444 event pairs, 642 based on Foata normal form. 0/7057 useless extension candidates. Maximal degree in co-relation 11031. Up to 1448 conditions per place. [2025-04-30 10:29:25,270 INFO L140 encePairwiseOnDemand]: 456/467 looper letters, 44 selfloop transitions, 8 changer transitions 0/397 dead transitions. [2025-04-30 10:29:25,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 397 transitions, 944 flow [2025-04-30 10:29:25,270 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:29:25,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:29:25,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1321 transitions. [2025-04-30 10:29:25,272 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9428979300499644 [2025-04-30 10:29:25,272 INFO L175 Difference]: Start difference. First operand has 374 places, 373 transitions, 786 flow. Second operand 3 states and 1321 transitions. [2025-04-30 10:29:25,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 397 transitions, 944 flow [2025-04-30 10:29:25,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 397 transitions, 944 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:29:25,277 INFO L231 Difference]: Finished difference. Result has 378 places, 381 transitions, 856 flow [2025-04-30 10:29:25,277 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=786, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=856, PETRI_PLACES=378, PETRI_TRANSITIONS=381} [2025-04-30 10:29:25,278 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, -13 predicate places. [2025-04-30 10:29:25,278 INFO L485 AbstractCegarLoop]: Abstraction has has 378 places, 381 transitions, 856 flow [2025-04-30 10:29:25,279 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 423.3333333333333) internal successors, (1270), 3 states have internal predecessors, (1270), 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-04-30 10:29:25,279 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:25,279 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] [2025-04-30 10:29:25,279 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:29:25,279 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting cleanerErr2ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-04-30 10:29:25,279 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:25,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1509307135, now seen corresponding path program 1 times [2025-04-30 10:29:25,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:25,280 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537593306] [2025-04-30 10:29:25,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:25,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:25,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-04-30 10:29:25,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-04-30 10:29:25,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:25,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:25,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:29:25,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:25,343 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537593306] [2025-04-30 10:29:25,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537593306] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:25,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:25,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:29:25,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670154717] [2025-04-30 10:29:25,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:25,344 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:29:25,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:25,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:29:25,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:29:25,364 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 421 out of 467 [2025-04-30 10:29:25,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 381 transitions, 856 flow. Second operand has 3 states, 3 states have (on average 422.6666666666667) internal successors, (1268), 3 states have internal predecessors, (1268), 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-04-30 10:29:25,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:25,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 421 of 467 [2025-04-30 10:29:25,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:26,529 INFO L116 PetriNetUnfolderBase]: 2120/10630 cut-off events. [2025-04-30 10:29:26,530 INFO L117 PetriNetUnfolderBase]: For 154/162 co-relation queries the response was YES. [2025-04-30 10:29:26,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14453 conditions, 10630 events. 2120/10630 cut-off events. For 154/162 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 100931 event pairs, 1244 based on Foata normal form. 0/9528 useless extension candidates. Maximal degree in co-relation 14294. Up to 2843 conditions per place. [2025-04-30 10:29:26,568 INFO L140 encePairwiseOnDemand]: 462/467 looper letters, 35 selfloop transitions, 2 changer transitions 0/391 dead transitions. [2025-04-30 10:29:26,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 391 transitions, 953 flow [2025-04-30 10:29:26,569 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:29:26,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:29:26,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1303 transitions. [2025-04-30 10:29:26,571 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9300499643112062 [2025-04-30 10:29:26,571 INFO L175 Difference]: Start difference. First operand has 378 places, 381 transitions, 856 flow. Second operand 3 states and 1303 transitions. [2025-04-30 10:29:26,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 391 transitions, 953 flow [2025-04-30 10:29:26,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 391 transitions, 937 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:29:26,579 INFO L231 Difference]: Finished difference. Result has 376 places, 380 transitions, 848 flow [2025-04-30 10:29:26,579 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=834, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=848, PETRI_PLACES=376, PETRI_TRANSITIONS=380} [2025-04-30 10:29:26,580 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, -15 predicate places. [2025-04-30 10:29:26,580 INFO L485 AbstractCegarLoop]: Abstraction has has 376 places, 380 transitions, 848 flow [2025-04-30 10:29:26,581 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 422.6666666666667) internal successors, (1268), 3 states have internal predecessors, (1268), 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-04-30 10:29:26,581 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:26,581 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-04-30 10:29:26,581 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-30 10:29:26,581 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting cleanerErr3ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-04-30 10:29:26,582 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:26,582 INFO L85 PathProgramCache]: Analyzing trace with hash 244701458, now seen corresponding path program 1 times [2025-04-30 10:29:26,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:26,582 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033602493] [2025-04-30 10:29:26,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:26,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:26,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-04-30 10:29:26,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-04-30 10:29:26,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:26,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:26,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:29:26,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:26,773 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033602493] [2025-04-30 10:29:26,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033602493] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:26,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:26,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:29:26,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430183378] [2025-04-30 10:29:26,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:26,773 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:29:26,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:26,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:29:26,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:29:26,838 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 422 out of 467 [2025-04-30 10:29:26,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 380 transitions, 848 flow. Second operand has 3 states, 3 states have (on average 424.3333333333333) internal successors, (1273), 3 states have internal predecessors, (1273), 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-04-30 10:29:26,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:26,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 422 of 467 [2025-04-30 10:29:26,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:29,266 INFO L116 PetriNetUnfolderBase]: 4584/20498 cut-off events. [2025-04-30 10:29:29,266 INFO L117 PetriNetUnfolderBase]: For 151/151 co-relation queries the response was YES. [2025-04-30 10:29:29,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29224 conditions, 20498 events. 4584/20498 cut-off events. For 151/151 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 220728 event pairs, 2480 based on Foata normal form. 0/18556 useless extension candidates. Maximal degree in co-relation 29064. Up to 5342 conditions per place. [2025-04-30 10:29:29,380 INFO L140 encePairwiseOnDemand]: 457/467 looper letters, 45 selfloop transitions, 9 changer transitions 0/403 dead transitions. [2025-04-30 10:29:29,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 403 transitions, 1008 flow [2025-04-30 10:29:29,381 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:29:29,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:29:29,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1321 transitions. [2025-04-30 10:29:29,383 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9428979300499644 [2025-04-30 10:29:29,383 INFO L175 Difference]: Start difference. First operand has 376 places, 380 transitions, 848 flow. Second operand 3 states and 1321 transitions. [2025-04-30 10:29:29,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 403 transitions, 1008 flow [2025-04-30 10:29:29,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 403 transitions, 1008 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:29:29,389 INFO L231 Difference]: Finished difference. Result has 380 places, 388 transitions, 918 flow [2025-04-30 10:29:29,390 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=848, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=918, PETRI_PLACES=380, PETRI_TRANSITIONS=388} [2025-04-30 10:29:29,390 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, -11 predicate places. [2025-04-30 10:29:29,390 INFO L485 AbstractCegarLoop]: Abstraction has has 380 places, 388 transitions, 918 flow [2025-04-30 10:29:29,391 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 424.3333333333333) internal successors, (1273), 3 states have internal predecessors, (1273), 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-04-30 10:29:29,391 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:29,391 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:29:29,391 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-30 10:29:29,392 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-04-30 10:29:29,392 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:29,392 INFO L85 PathProgramCache]: Analyzing trace with hash -522211293, now seen corresponding path program 1 times [2025-04-30 10:29:29,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:29,392 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333391081] [2025-04-30 10:29:29,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:29,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:29,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-04-30 10:29:29,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-04-30 10:29:29,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:29,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:29,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:29:29,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:29,709 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333391081] [2025-04-30 10:29:29,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333391081] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:29,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:29,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:29:29,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307238321] [2025-04-30 10:29:29,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:29,710 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:29:29,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:29,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:29:29,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:29:29,792 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 425 out of 467 [2025-04-30 10:29:29,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 388 transitions, 918 flow. Second operand has 5 states, 5 states have (on average 426.8) internal successors, (2134), 5 states have internal predecessors, (2134), 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-04-30 10:29:29,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:29,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 425 of 467 [2025-04-30 10:29:29,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:31,712 INFO L116 PetriNetUnfolderBase]: 2608/15740 cut-off events. [2025-04-30 10:29:31,712 INFO L117 PetriNetUnfolderBase]: For 512/576 co-relation queries the response was YES. [2025-04-30 10:29:31,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22205 conditions, 15740 events. 2608/15740 cut-off events. For 512/576 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 172174 event pairs, 1917 based on Foata normal form. 4/14270 useless extension candidates. Maximal degree in co-relation 22041. Up to 3513 conditions per place. [2025-04-30 10:29:31,790 INFO L140 encePairwiseOnDemand]: 458/467 looper letters, 36 selfloop transitions, 8 changer transitions 0/402 dead transitions. [2025-04-30 10:29:31,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 402 transitions, 1033 flow [2025-04-30 10:29:31,791 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:29:31,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:29:31,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2595 transitions. [2025-04-30 10:29:31,795 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9261241970021413 [2025-04-30 10:29:31,795 INFO L175 Difference]: Start difference. First operand has 380 places, 388 transitions, 918 flow. Second operand 6 states and 2595 transitions. [2025-04-30 10:29:31,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 402 transitions, 1033 flow [2025-04-30 10:29:31,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 402 transitions, 1015 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:29:31,807 INFO L231 Difference]: Finished difference. Result has 387 places, 392 transitions, 945 flow [2025-04-30 10:29:31,808 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=895, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=945, PETRI_PLACES=387, PETRI_TRANSITIONS=392} [2025-04-30 10:29:31,808 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, -4 predicate places. [2025-04-30 10:29:31,808 INFO L485 AbstractCegarLoop]: Abstraction has has 387 places, 392 transitions, 945 flow [2025-04-30 10:29:31,809 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 426.8) internal successors, (2134), 5 states have internal predecessors, (2134), 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-04-30 10:29:31,810 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:31,810 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:29:31,810 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-30 10:29:31,810 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-04-30 10:29:31,811 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:31,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1169954021, now seen corresponding path program 1 times [2025-04-30 10:29:31,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:31,811 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741588359] [2025-04-30 10:29:31,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:31,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:31,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-04-30 10:29:31,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-04-30 10:29:31,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:31,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:31,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:29:31,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:31,995 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741588359] [2025-04-30 10:29:31,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741588359] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:31,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:31,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:29:31,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722149242] [2025-04-30 10:29:31,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:31,995 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:29:31,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:31,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:29:31,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:29:32,008 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 432 out of 467 [2025-04-30 10:29:32,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 387 places, 392 transitions, 945 flow. Second operand has 3 states, 3 states have (on average 433.6666666666667) internal successors, (1301), 3 states have internal predecessors, (1301), 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-04-30 10:29:32,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:32,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 432 of 467 [2025-04-30 10:29:32,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:34,416 INFO L116 PetriNetUnfolderBase]: 3099/16974 cut-off events. [2025-04-30 10:29:34,416 INFO L117 PetriNetUnfolderBase]: For 202/215 co-relation queries the response was YES. [2025-04-30 10:29:34,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24065 conditions, 16974 events. 3099/16974 cut-off events. For 202/215 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 184938 event pairs, 1526 based on Foata normal form. 14/15176 useless extension candidates. Maximal degree in co-relation 23896. Up to 3551 conditions per place. [2025-04-30 10:29:34,499 INFO L140 encePairwiseOnDemand]: 463/467 looper letters, 33 selfloop transitions, 3 changer transitions 0/406 dead transitions. [2025-04-30 10:29:34,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 406 transitions, 1048 flow [2025-04-30 10:29:34,499 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:29:34,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:29:34,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1333 transitions. [2025-04-30 10:29:34,501 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9514632405424697 [2025-04-30 10:29:34,501 INFO L175 Difference]: Start difference. First operand has 387 places, 392 transitions, 945 flow. Second operand 3 states and 1333 transitions. [2025-04-30 10:29:34,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 406 transitions, 1048 flow [2025-04-30 10:29:34,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 406 transitions, 1044 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:29:34,506 INFO L231 Difference]: Finished difference. Result has 389 places, 393 transitions, 955 flow [2025-04-30 10:29:34,506 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=936, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=388, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=955, PETRI_PLACES=389, PETRI_TRANSITIONS=393} [2025-04-30 10:29:34,507 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, -2 predicate places. [2025-04-30 10:29:34,507 INFO L485 AbstractCegarLoop]: Abstraction has has 389 places, 393 transitions, 955 flow [2025-04-30 10:29:34,507 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 433.6666666666667) internal successors, (1301), 3 states have internal predecessors, (1301), 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-04-30 10:29:34,507 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:34,508 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:29:34,508 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-30 10:29:34,508 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting cleanerErr5ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-04-30 10:29:34,508 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:34,508 INFO L85 PathProgramCache]: Analyzing trace with hash 646924222, now seen corresponding path program 1 times [2025-04-30 10:29:34,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:34,509 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68220724] [2025-04-30 10:29:34,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:34,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:34,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-04-30 10:29:34,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-04-30 10:29:34,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:34,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:34,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:29:34,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:34,643 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68220724] [2025-04-30 10:29:34,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68220724] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:34,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:34,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:29:34,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262031868] [2025-04-30 10:29:34,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:34,644 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:29:34,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:34,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:29:34,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:29:34,747 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 425 out of 467 [2025-04-30 10:29:34,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 393 transitions, 955 flow. Second operand has 5 states, 5 states have (on average 427.0) internal successors, (2135), 5 states have internal predecessors, (2135), 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-04-30 10:29:34,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:34,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 425 of 467 [2025-04-30 10:29:34,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:36,942 INFO L116 PetriNetUnfolderBase]: 3649/18551 cut-off events. [2025-04-30 10:29:36,942 INFO L117 PetriNetUnfolderBase]: For 572/601 co-relation queries the response was YES. [2025-04-30 10:29:36,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26835 conditions, 18551 events. 3649/18551 cut-off events. For 572/601 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 202122 event pairs, 2410 based on Foata normal form. 4/16845 useless extension candidates. Maximal degree in co-relation 26663. Up to 4881 conditions per place. [2025-04-30 10:29:37,036 INFO L140 encePairwiseOnDemand]: 458/467 looper letters, 27 selfloop transitions, 4 changer transitions 13/401 dead transitions. [2025-04-30 10:29:37,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 394 places, 401 transitions, 1054 flow [2025-04-30 10:29:37,037 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:29:37,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:29:37,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2592 transitions. [2025-04-30 10:29:37,040 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9250535331905781 [2025-04-30 10:29:37,040 INFO L175 Difference]: Start difference. First operand has 389 places, 393 transitions, 955 flow. Second operand 6 states and 2592 transitions. [2025-04-30 10:29:37,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 394 places, 401 transitions, 1054 flow [2025-04-30 10:29:37,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 393 places, 401 transitions, 1051 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:29:37,047 INFO L231 Difference]: Finished difference. Result has 395 places, 388 transitions, 939 flow [2025-04-30 10:29:37,047 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=947, PETRI_DIFFERENCE_MINUEND_PLACES=388, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=392, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=388, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=939, PETRI_PLACES=395, PETRI_TRANSITIONS=388} [2025-04-30 10:29:37,048 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, 4 predicate places. [2025-04-30 10:29:37,048 INFO L485 AbstractCegarLoop]: Abstraction has has 395 places, 388 transitions, 939 flow [2025-04-30 10:29:37,049 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 427.0) internal successors, (2135), 5 states have internal predecessors, (2135), 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-04-30 10:29:37,049 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:37,049 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] [2025-04-30 10:29:37,049 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-30 10:29:37,049 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-04-30 10:29:37,050 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:37,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1744580107, now seen corresponding path program 1 times [2025-04-30 10:29:37,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:37,050 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836493135] [2025-04-30 10:29:37,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:37,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:37,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-04-30 10:29:37,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-04-30 10:29:37,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:37,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:37,532 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:29:37,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:37,532 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836493135] [2025-04-30 10:29:37,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836493135] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:37,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:37,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:29:37,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055287597] [2025-04-30 10:29:37,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:37,533 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:29:37,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:37,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:29:37,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:29:37,688 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 467 [2025-04-30 10:29:37,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 388 transitions, 939 flow. Second operand has 6 states, 6 states have (on average 410.8333333333333) internal successors, (2465), 6 states have internal predecessors, (2465), 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-04-30 10:29:37,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:37,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 467 [2025-04-30 10:29:37,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:42,248 INFO L116 PetriNetUnfolderBase]: 9843/33650 cut-off events. [2025-04-30 10:29:42,249 INFO L117 PetriNetUnfolderBase]: For 2731/2856 co-relation queries the response was YES. [2025-04-30 10:29:42,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56697 conditions, 33650 events. 9843/33650 cut-off events. For 2731/2856 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 373008 event pairs, 3778 based on Foata normal form. 1/30710 useless extension candidates. Maximal degree in co-relation 56521. Up to 11645 conditions per place. [2025-04-30 10:29:42,715 INFO L140 encePairwiseOnDemand]: 453/467 looper letters, 95 selfloop transitions, 46 changer transitions 0/484 dead transitions. [2025-04-30 10:29:42,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 484 transitions, 1495 flow [2025-04-30 10:29:42,723 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:29:42,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:29:42,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2579 transitions. [2025-04-30 10:29:42,725 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9204139900071378 [2025-04-30 10:29:42,725 INFO L175 Difference]: Start difference. First operand has 395 places, 388 transitions, 939 flow. Second operand 6 states and 2579 transitions. [2025-04-30 10:29:42,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 484 transitions, 1495 flow [2025-04-30 10:29:42,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 387 places, 484 transitions, 1467 flow, removed 7 selfloop flow, removed 9 redundant places. [2025-04-30 10:29:42,744 INFO L231 Difference]: Finished difference. Result has 391 places, 433 transitions, 1246 flow [2025-04-30 10:29:42,745 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=911, PETRI_DIFFERENCE_MINUEND_PLACES=382, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1246, PETRI_PLACES=391, PETRI_TRANSITIONS=433} [2025-04-30 10:29:42,745 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, 0 predicate places. [2025-04-30 10:29:42,745 INFO L485 AbstractCegarLoop]: Abstraction has has 391 places, 433 transitions, 1246 flow [2025-04-30 10:29:42,746 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 410.8333333333333) internal successors, (2465), 6 states have internal predecessors, (2465), 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-04-30 10:29:42,746 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:42,746 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:29:42,746 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-30 10:29:42,747 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting cleanerErr5ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-04-30 10:29:42,747 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:42,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1091775274, now seen corresponding path program 1 times [2025-04-30 10:29:42,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:42,747 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907085834] [2025-04-30 10:29:42,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:42,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:42,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-04-30 10:29:42,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-04-30 10:29:42,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:42,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:42,962 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:29:42,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:42,963 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907085834] [2025-04-30 10:29:42,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907085834] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:42,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:42,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-30 10:29:42,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410747495] [2025-04-30 10:29:42,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:42,963 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:29:42,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:42,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:29:42,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:29:43,199 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 467 [2025-04-30 10:29:43,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 433 transitions, 1246 flow. Second operand has 7 states, 7 states have (on average 420.0) internal successors, (2940), 7 states have internal predecessors, (2940), 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-04-30 10:29:43,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:43,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 467 [2025-04-30 10:29:43,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:48,663 INFO L116 PetriNetUnfolderBase]: 9432/39432 cut-off events. [2025-04-30 10:29:48,664 INFO L117 PetriNetUnfolderBase]: For 3891/5993 co-relation queries the response was YES. [2025-04-30 10:29:48,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65896 conditions, 39432 events. 9432/39432 cut-off events. For 3891/5993 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 481229 event pairs, 4444 based on Foata normal form. 228/35850 useless extension candidates. Maximal degree in co-relation 65726. Up to 10503 conditions per place. [2025-04-30 10:29:48,882 INFO L140 encePairwiseOnDemand]: 455/467 looper letters, 64 selfloop transitions, 14 changer transitions 5/478 dead transitions. [2025-04-30 10:29:48,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 478 transitions, 1509 flow [2025-04-30 10:29:48,882 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:29:48,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-30 10:29:48,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4264 transitions. [2025-04-30 10:29:48,886 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9130620985010707 [2025-04-30 10:29:48,886 INFO L175 Difference]: Start difference. First operand has 391 places, 433 transitions, 1246 flow. Second operand 10 states and 4264 transitions. [2025-04-30 10:29:48,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 478 transitions, 1509 flow [2025-04-30 10:29:48,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 478 transitions, 1509 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:29:48,899 INFO L231 Difference]: Finished difference. Result has 404 places, 441 transitions, 1318 flow [2025-04-30 10:29:48,900 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=1241, PETRI_DIFFERENCE_MINUEND_PLACES=391, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=432, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=421, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1318, PETRI_PLACES=404, PETRI_TRANSITIONS=441} [2025-04-30 10:29:48,900 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, 13 predicate places. [2025-04-30 10:29:48,900 INFO L485 AbstractCegarLoop]: Abstraction has has 404 places, 441 transitions, 1318 flow [2025-04-30 10:29:48,901 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 420.0) internal successors, (2940), 7 states have internal predecessors, (2940), 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-04-30 10:29:48,901 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:48,901 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:29:48,901 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-30 10:29:48,902 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting cleanerErr3ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-04-30 10:29:48,902 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:48,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1801610091, now seen corresponding path program 1 times [2025-04-30 10:29:48,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:48,902 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041642688] [2025-04-30 10:29:48,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:48,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:48,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-04-30 10:29:48,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-04-30 10:29:48,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:48,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:49,139 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:29:49,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:49,139 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041642688] [2025-04-30 10:29:49,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041642688] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:49,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:49,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-30 10:29:49,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723701089] [2025-04-30 10:29:49,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:49,140 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:29:49,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:49,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:29:49,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:29:49,551 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 413 out of 467 [2025-04-30 10:29:49,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 441 transitions, 1318 flow. Second operand has 8 states, 8 states have (on average 414.875) internal successors, (3319), 8 states have internal predecessors, (3319), 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-04-30 10:29:49,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:49,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 413 of 467 [2025-04-30 10:29:49,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:55,644 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([992] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][398], [493#(= |#race~flags~0| 0), Black: 527#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 491#true, 304#L1066-7true, Black: 526#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), 459#true, Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 513#(<= (+ ~threads_alive~0 1) 0), 534#true, 480#(= |#race~flags_mutex~0| 0), 468#(= |#race~threads_total~0| 0), 566#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 524#true, Black: 482#true, 70#L1034-5true, Black: 488#(= |#race~threads_alive~0| 0), 484#(= |#race~tids~0| 0), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 478#true, Black: 538#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 539#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 461#true, 390#L1043-4true, Black: 540#(= |cleanerThread1of1ForFork1_#t~mem11| 0), Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 546#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 529#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|))]) [2025-04-30 10:29:55,644 INFO L286 olderBase$Statistics]: this new event has 414 ancestors and is cut-off event [2025-04-30 10:29:55,644 INFO L289 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2025-04-30 10:29:55,644 INFO L289 olderBase$Statistics]: existing Event has 319 ancestors and is cut-off event [2025-04-30 10:29:55,644 INFO L289 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2025-04-30 10:29:55,664 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([992] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][398], [493#(= |#race~flags~0| 0), Black: 527#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 491#true, Black: 526#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), 459#true, Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 513#(<= (+ ~threads_alive~0 1) 0), 534#true, 480#(= |#race~flags_mutex~0| 0), 468#(= |#race~threads_total~0| 0), 566#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 524#true, 287#L1066-8true, Black: 482#true, 70#L1034-5true, Black: 488#(= |#race~threads_alive~0| 0), 484#(= |#race~tids~0| 0), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 478#true, Black: 539#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 538#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), 461#true, 390#L1043-4true, Black: 540#(= |cleanerThread1of1ForFork1_#t~mem11| 0), Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 529#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 546#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0))]) [2025-04-30 10:29:55,664 INFO L286 olderBase$Statistics]: this new event has 415 ancestors and is cut-off event [2025-04-30 10:29:55,664 INFO L289 olderBase$Statistics]: existing Event has 320 ancestors and is cut-off event [2025-04-30 10:29:55,664 INFO L289 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-04-30 10:29:55,664 INFO L289 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-04-30 10:29:55,665 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([992] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][398], [493#(= |#race~flags~0| 0), Black: 527#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 491#true, 304#L1066-7true, Black: 526#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), 459#true, Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 513#(<= (+ ~threads_alive~0 1) 0), 534#true, 480#(= |#race~flags_mutex~0| 0), 468#(= |#race~threads_total~0| 0), 566#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 524#true, Black: 482#true, 70#L1034-5true, Black: 488#(= |#race~threads_alive~0| 0), 484#(= |#race~tids~0| 0), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 478#true, Black: 538#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 539#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 461#true, 324#L1043-5true, Black: 540#(= |cleanerThread1of1ForFork1_#t~mem11| 0), Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 546#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 529#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|))]) [2025-04-30 10:29:55,665 INFO L286 olderBase$Statistics]: this new event has 415 ancestors and is cut-off event [2025-04-30 10:29:55,665 INFO L289 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-04-30 10:29:55,665 INFO L289 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-04-30 10:29:55,665 INFO L289 olderBase$Statistics]: existing Event has 320 ancestors and is cut-off event [2025-04-30 10:29:55,665 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([992] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][398], [493#(= |#race~flags~0| 0), Black: 527#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 491#true, Black: 526#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), 459#true, Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 513#(<= (+ ~threads_alive~0 1) 0), 534#true, 480#(= |#race~flags_mutex~0| 0), 468#(= |#race~threads_total~0| 0), 566#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 524#true, 287#L1066-8true, Black: 482#true, 70#L1034-5true, Black: 488#(= |#race~threads_alive~0| 0), 484#(= |#race~tids~0| 0), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 478#true, Black: 539#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 538#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), 461#true, 324#L1043-5true, Black: 540#(= |cleanerThread1of1ForFork1_#t~mem11| 0), Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 529#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 546#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0))]) [2025-04-30 10:29:55,665 INFO L286 olderBase$Statistics]: this new event has 416 ancestors and is cut-off event [2025-04-30 10:29:55,665 INFO L289 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-04-30 10:29:55,665 INFO L289 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-04-30 10:29:55,665 INFO L289 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2025-04-30 10:29:55,681 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([992] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][398], [493#(= |#race~flags~0| 0), Black: 527#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 20#L1066-9true, Black: 491#true, Black: 526#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), 459#true, Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 513#(<= (+ ~threads_alive~0 1) 0), 534#true, 480#(= |#race~flags_mutex~0| 0), 468#(= |#race~threads_total~0| 0), 566#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 524#true, Black: 482#true, 70#L1034-5true, Black: 488#(= |#race~threads_alive~0| 0), 484#(= |#race~tids~0| 0), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 478#true, Black: 539#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 538#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), 461#true, 390#L1043-4true, Black: 540#(= |cleanerThread1of1ForFork1_#t~mem11| 0), Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 529#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 546#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0))]) [2025-04-30 10:29:55,681 INFO L286 olderBase$Statistics]: this new event has 416 ancestors and is cut-off event [2025-04-30 10:29:55,681 INFO L289 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-04-30 10:29:55,681 INFO L289 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2025-04-30 10:29:55,681 INFO L289 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-04-30 10:29:55,681 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([992] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][398], [493#(= |#race~flags~0| 0), Black: 527#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 20#L1066-9true, Black: 491#true, Black: 526#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), 459#true, Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 513#(<= (+ ~threads_alive~0 1) 0), 534#true, 480#(= |#race~flags_mutex~0| 0), 468#(= |#race~threads_total~0| 0), 566#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 524#true, Black: 482#true, 70#L1034-5true, Black: 488#(= |#race~threads_alive~0| 0), 484#(= |#race~tids~0| 0), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 478#true, Black: 539#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 538#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), 461#true, 324#L1043-5true, Black: 540#(= |cleanerThread1of1ForFork1_#t~mem11| 0), Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 529#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 546#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0))]) [2025-04-30 10:29:55,681 INFO L286 olderBase$Statistics]: this new event has 417 ancestors and is cut-off event [2025-04-30 10:29:55,681 INFO L289 olderBase$Statistics]: existing Event has 322 ancestors and is cut-off event [2025-04-30 10:29:55,681 INFO L289 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-04-30 10:29:55,681 INFO L289 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-04-30 10:29:55,805 INFO L116 PetriNetUnfolderBase]: 11364/46010 cut-off events. [2025-04-30 10:29:55,805 INFO L117 PetriNetUnfolderBase]: For 15963/18084 co-relation queries the response was YES. [2025-04-30 10:29:56,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85110 conditions, 46010 events. 11364/46010 cut-off events. For 15963/18084 co-relation queries the response was YES. Maximal size of possible extension queue 581. Compared 565219 event pairs, 4101 based on Foata normal form. 119/42139 useless extension candidates. Maximal degree in co-relation 84934. Up to 9071 conditions per place. [2025-04-30 10:29:56,137 INFO L140 encePairwiseOnDemand]: 454/467 looper letters, 101 selfloop transitions, 44 changer transitions 0/511 dead transitions. [2025-04-30 10:29:56,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 511 transitions, 1900 flow [2025-04-30 10:29:56,137 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-30 10:29:56,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-30 10:29:56,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 4639 transitions. [2025-04-30 10:29:56,142 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.903056258516644 [2025-04-30 10:29:56,142 INFO L175 Difference]: Start difference. First operand has 404 places, 441 transitions, 1318 flow. Second operand 11 states and 4639 transitions. [2025-04-30 10:29:56,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 511 transitions, 1900 flow [2025-04-30 10:29:56,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 410 places, 511 transitions, 1892 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-30 10:29:56,170 INFO L231 Difference]: Finished difference. Result has 414 places, 462 transitions, 1635 flow [2025-04-30 10:29:56,171 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=1310, PETRI_DIFFERENCE_MINUEND_PLACES=400, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=441, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1635, PETRI_PLACES=414, PETRI_TRANSITIONS=462} [2025-04-30 10:29:56,171 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, 23 predicate places. [2025-04-30 10:29:56,171 INFO L485 AbstractCegarLoop]: Abstraction has has 414 places, 462 transitions, 1635 flow [2025-04-30 10:29:56,172 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 414.875) internal successors, (3319), 8 states have internal predecessors, (3319), 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-04-30 10:29:56,172 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:56,173 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:29:56,173 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-30 10:29:56,173 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-04-30 10:29:56,174 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:56,174 INFO L85 PathProgramCache]: Analyzing trace with hash -208325691, now seen corresponding path program 1 times [2025-04-30 10:29:56,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:56,174 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608232031] [2025-04-30 10:29:56,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:56,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:56,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-04-30 10:29:56,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-04-30 10:29:56,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:56,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:56,241 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:29:56,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:56,241 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608232031] [2025-04-30 10:29:56,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608232031] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:56,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:56,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:29:56,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251835076] [2025-04-30 10:29:56,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:56,242 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:29:56,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:56,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:29:56,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:29:56,250 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 431 out of 467 [2025-04-30 10:29:56,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 414 places, 462 transitions, 1635 flow. Second operand has 3 states, 3 states have (on average 433.0) internal successors, (1299), 3 states have internal predecessors, (1299), 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-04-30 10:29:56,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:56,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 431 of 467 [2025-04-30 10:29:56,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:57,607 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([992] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][358], [493#(= |#race~flags~0| 0), Black: 527#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 573#true, Black: 491#true, Black: 526#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 459#true, Black: 513#(<= (+ ~threads_alive~0 1) 0), 534#true, 236#L1040-7true, 480#(= |#race~flags_mutex~0| 0), 468#(= |#race~threads_total~0| 0), 566#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 524#true, Black: 568#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 556#(not (= ~flags~0.base ~tids~0.base)), Black: 482#true, 70#L1034-5true, Black: 488#(= |#race~threads_alive~0| 0), 484#(= |#race~tids~0| 0), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 478#true, Black: 539#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 538#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), 217#L1066-10true, 461#true, Black: 557#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 540#(= |cleanerThread1of1ForFork1_#t~mem11| 0), Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 529#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 546#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0))]) [2025-04-30 10:29:57,608 INFO L286 olderBase$Statistics]: this new event has 303 ancestors and is cut-off event [2025-04-30 10:29:57,608 INFO L289 olderBase$Statistics]: existing Event has 303 ancestors and is cut-off event [2025-04-30 10:29:57,608 INFO L289 olderBase$Statistics]: existing Event has 303 ancestors and is cut-off event [2025-04-30 10:29:57,608 INFO L289 olderBase$Statistics]: existing Event has 303 ancestors and is cut-off event [2025-04-30 10:29:57,681 INFO L284 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([992] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][358], [493#(= |#race~flags~0| 0), Black: 527#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 573#true, Black: 491#true, Black: 526#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 459#true, Black: 513#(<= (+ ~threads_alive~0 1) 0), 534#true, 236#L1040-7true, 480#(= |#race~flags_mutex~0| 0), 468#(= |#race~threads_total~0| 0), 566#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 524#true, Black: 568#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 556#(not (= ~flags~0.base ~tids~0.base)), Black: 482#true, 70#L1034-5true, Black: 488#(= |#race~threads_alive~0| 0), 484#(= |#race~tids~0| 0), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 478#true, Black: 539#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 538#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), 217#L1066-10true, 461#true, Black: 557#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 540#(= |cleanerThread1of1ForFork1_#t~mem11| 0), Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 546#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 529#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|))]) [2025-04-30 10:29:57,681 INFO L286 olderBase$Statistics]: this new event has 303 ancestors and is not cut-off event [2025-04-30 10:29:57,681 INFO L289 olderBase$Statistics]: existing Event has 303 ancestors and is not cut-off event [2025-04-30 10:29:57,681 INFO L289 olderBase$Statistics]: existing Event has 303 ancestors and is not cut-off event [2025-04-30 10:29:57,681 INFO L289 olderBase$Statistics]: existing Event has 303 ancestors and is not cut-off event [2025-04-30 10:29:57,681 INFO L289 olderBase$Statistics]: existing Event has 303 ancestors and is not cut-off event [2025-04-30 10:29:57,800 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([916] L1042-3-->L1042-4: Formula: (= |v_#race_1| (store |v_#race_2| v_~flags~0.base_2 (store (select |v_#race_2| v_~flags~0.base_2) (+ v_~flags~0.offset_2 v_cleanerThread1of1ForFork1_~i~1_13) 0))) InVars {#race=|v_#race_2|, ~flags~0.offset=v_~flags~0.offset_2, cleanerThread1of1ForFork1_~i~1=v_cleanerThread1of1ForFork1_~i~1_13, ~flags~0.base=v_~flags~0.base_2} OutVars{#race=|v_#race_1|, ~flags~0.offset=v_~flags~0.offset_2, cleanerThread1of1ForFork1_~i~1=v_cleanerThread1of1ForFork1_~i~1_13, ~flags~0.base=v_~flags~0.base_2} AuxVars[] AssignedVars[#race][275], [Black: 566#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 493#(= |#race~flags~0| 0), Black: 527#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 568#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), 573#true, Black: 491#true, Black: 526#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), 459#true, Black: 513#(<= (+ ~threads_alive~0 1) 0), 534#true, 480#(= |#race~flags_mutex~0| 0), 468#(= |#race~threads_total~0| 0), 524#true, Black: 556#(not (= ~flags~0.base ~tids~0.base)), Black: 482#true, 362#L1042-4true, Black: 488#(= |#race~threads_alive~0| 0), 484#(= |#race~tids~0| 0), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0), 434#L1034-1true, Black: 478#true, Black: 539#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 538#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 495#true, 217#L1066-10true, 461#true, Black: 557#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 540#(= |cleanerThread1of1ForFork1_#t~mem11| 0), Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 546#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 529#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|))]) [2025-04-30 10:29:57,800 INFO L286 olderBase$Statistics]: this new event has 311 ancestors and is cut-off event [2025-04-30 10:29:57,800 INFO L289 olderBase$Statistics]: existing Event has 311 ancestors and is cut-off event [2025-04-30 10:29:57,800 INFO L289 olderBase$Statistics]: existing Event has 311 ancestors and is cut-off event [2025-04-30 10:29:57,801 INFO L289 olderBase$Statistics]: existing Event has 311 ancestors and is cut-off event [2025-04-30 10:29:57,871 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([992] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][387], [493#(= |#race~flags~0| 0), Black: 527#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 573#true, Black: 491#true, 304#L1066-7true, Black: 526#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 459#true, Black: 513#(<= (+ ~threads_alive~0 1) 0), 534#true, 480#(= |#race~flags_mutex~0| 0), 468#(= |#race~threads_total~0| 0), 566#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 524#true, Black: 568#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 556#(not (= ~flags~0.base ~tids~0.base)), Black: 482#true, 70#L1034-5true, Black: 488#(= |#race~threads_alive~0| 0), 484#(= |#race~tids~0| 0), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 478#true, Black: 539#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 538#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), 461#true, 390#L1043-4true, Black: 557#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 540#(= |cleanerThread1of1ForFork1_#t~mem11| 0), Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 546#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 529#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|))]) [2025-04-30 10:29:57,871 INFO L286 olderBase$Statistics]: this new event has 319 ancestors and is cut-off event [2025-04-30 10:29:57,871 INFO L289 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2025-04-30 10:29:57,871 INFO L289 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2025-04-30 10:29:57,871 INFO L289 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2025-04-30 10:29:57,887 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([992] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][387], [493#(= |#race~flags~0| 0), Black: 527#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 573#true, Black: 491#true, Black: 526#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 459#true, Black: 513#(<= (+ ~threads_alive~0 1) 0), 534#true, 480#(= |#race~flags_mutex~0| 0), 468#(= |#race~threads_total~0| 0), 566#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 524#true, 287#L1066-8true, Black: 568#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 556#(not (= ~flags~0.base ~tids~0.base)), Black: 482#true, 70#L1034-5true, Black: 488#(= |#race~threads_alive~0| 0), 484#(= |#race~tids~0| 0), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 478#true, Black: 538#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 539#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 461#true, 390#L1043-4true, Black: 557#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 540#(= |cleanerThread1of1ForFork1_#t~mem11| 0), Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 546#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 529#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|))]) [2025-04-30 10:29:57,887 INFO L286 olderBase$Statistics]: this new event has 320 ancestors and is cut-off event [2025-04-30 10:29:57,887 INFO L289 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-04-30 10:29:57,887 INFO L289 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-04-30 10:29:57,887 INFO L289 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-04-30 10:29:57,888 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([992] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][387], [493#(= |#race~flags~0| 0), Black: 527#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 573#true, Black: 491#true, 304#L1066-7true, Black: 526#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 459#true, Black: 513#(<= (+ ~threads_alive~0 1) 0), 534#true, 480#(= |#race~flags_mutex~0| 0), 468#(= |#race~threads_total~0| 0), 566#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 524#true, Black: 568#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 556#(not (= ~flags~0.base ~tids~0.base)), Black: 482#true, 70#L1034-5true, Black: 488#(= |#race~threads_alive~0| 0), 484#(= |#race~tids~0| 0), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 478#true, Black: 539#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 538#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), 461#true, 324#L1043-5true, Black: 557#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 540#(= |cleanerThread1of1ForFork1_#t~mem11| 0), Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 546#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 529#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|))]) [2025-04-30 10:29:57,888 INFO L286 olderBase$Statistics]: this new event has 320 ancestors and is cut-off event [2025-04-30 10:29:57,888 INFO L289 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-04-30 10:29:57,888 INFO L289 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-04-30 10:29:57,888 INFO L289 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-04-30 10:29:57,889 INFO L284 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([992] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][387], [493#(= |#race~flags~0| 0), Black: 527#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 573#true, Black: 491#true, 304#L1066-7true, Black: 526#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 459#true, Black: 513#(<= (+ ~threads_alive~0 1) 0), 534#true, 480#(= |#race~flags_mutex~0| 0), 468#(= |#race~threads_total~0| 0), 566#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 524#true, Black: 568#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 556#(not (= ~flags~0.base ~tids~0.base)), Black: 482#true, 70#L1034-5true, Black: 488#(= |#race~threads_alive~0| 0), 484#(= |#race~tids~0| 0), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 478#true, Black: 539#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 538#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), 461#true, 390#L1043-4true, Black: 557#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 540#(= |cleanerThread1of1ForFork1_#t~mem11| 0), Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 546#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 529#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|))]) [2025-04-30 10:29:57,889 INFO L286 olderBase$Statistics]: this new event has 319 ancestors and is cut-off event [2025-04-30 10:29:57,889 INFO L289 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2025-04-30 10:29:57,889 INFO L289 olderBase$Statistics]: existing Event has 319 ancestors and is cut-off event [2025-04-30 10:29:57,889 INFO L289 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2025-04-30 10:29:57,889 INFO L289 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2025-04-30 10:29:57,906 INFO L284 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([992] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][387], [493#(= |#race~flags~0| 0), Black: 527#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 573#true, Black: 491#true, 304#L1066-7true, Black: 526#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 459#true, Black: 513#(<= (+ ~threads_alive~0 1) 0), 534#true, 480#(= |#race~flags_mutex~0| 0), 468#(= |#race~threads_total~0| 0), 566#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 524#true, Black: 568#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 556#(not (= ~flags~0.base ~tids~0.base)), Black: 482#true, 70#L1034-5true, Black: 488#(= |#race~threads_alive~0| 0), 484#(= |#race~tids~0| 0), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 478#true, Black: 538#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 539#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 461#true, 390#L1043-4true, Black: 557#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 540#(= |cleanerThread1of1ForFork1_#t~mem11| 0), Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 529#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 546#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0))]) [2025-04-30 10:29:57,906 INFO L286 olderBase$Statistics]: this new event has 319 ancestors and is cut-off event [2025-04-30 10:29:57,906 INFO L289 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2025-04-30 10:29:57,906 INFO L289 olderBase$Statistics]: existing Event has 319 ancestors and is cut-off event [2025-04-30 10:29:57,906 INFO L289 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2025-04-30 10:29:57,906 INFO L289 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2025-04-30 10:29:57,906 INFO L289 olderBase$Statistics]: existing Event has 319 ancestors and is cut-off event [2025-04-30 10:29:57,907 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([992] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][387], [493#(= |#race~flags~0| 0), 20#L1066-9true, Black: 527#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 573#true, Black: 491#true, Black: 526#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 459#true, Black: 513#(<= (+ ~threads_alive~0 1) 0), 534#true, 480#(= |#race~flags_mutex~0| 0), 468#(= |#race~threads_total~0| 0), 566#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 524#true, Black: 568#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 556#(not (= ~flags~0.base ~tids~0.base)), Black: 482#true, 70#L1034-5true, Black: 488#(= |#race~threads_alive~0| 0), 484#(= |#race~tids~0| 0), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 478#true, Black: 539#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 538#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), 461#true, 390#L1043-4true, Black: 557#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 540#(= |cleanerThread1of1ForFork1_#t~mem11| 0), Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 546#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 529#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|))]) [2025-04-30 10:29:57,908 INFO L286 olderBase$Statistics]: this new event has 321 ancestors and is cut-off event [2025-04-30 10:29:57,908 INFO L289 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-04-30 10:29:57,908 INFO L289 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-04-30 10:29:57,908 INFO L289 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-04-30 10:29:57,908 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([992] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][387], [493#(= |#race~flags~0| 0), Black: 527#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 573#true, Black: 491#true, Black: 526#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 459#true, Black: 513#(<= (+ ~threads_alive~0 1) 0), 534#true, 480#(= |#race~flags_mutex~0| 0), 468#(= |#race~threads_total~0| 0), 566#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 524#true, 287#L1066-8true, Black: 568#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 556#(not (= ~flags~0.base ~tids~0.base)), Black: 482#true, 70#L1034-5true, Black: 488#(= |#race~threads_alive~0| 0), 484#(= |#race~tids~0| 0), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 478#true, Black: 538#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 539#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 461#true, 324#L1043-5true, Black: 557#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 540#(= |cleanerThread1of1ForFork1_#t~mem11| 0), Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 546#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 529#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|))]) [2025-04-30 10:29:57,908 INFO L286 olderBase$Statistics]: this new event has 321 ancestors and is cut-off event [2025-04-30 10:29:57,908 INFO L289 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-04-30 10:29:57,908 INFO L289 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-04-30 10:29:57,909 INFO L289 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-04-30 10:29:57,909 INFO L284 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([992] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][387], [493#(= |#race~flags~0| 0), Black: 527#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 573#true, Black: 491#true, Black: 526#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 459#true, Black: 513#(<= (+ ~threads_alive~0 1) 0), 534#true, 480#(= |#race~flags_mutex~0| 0), 468#(= |#race~threads_total~0| 0), 566#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 524#true, 287#L1066-8true, Black: 568#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 556#(not (= ~flags~0.base ~tids~0.base)), Black: 482#true, 70#L1034-5true, Black: 488#(= |#race~threads_alive~0| 0), 484#(= |#race~tids~0| 0), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 478#true, Black: 539#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 538#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), 461#true, 390#L1043-4true, Black: 557#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 540#(= |cleanerThread1of1ForFork1_#t~mem11| 0), Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 546#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 529#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|))]) [2025-04-30 10:29:57,909 INFO L286 olderBase$Statistics]: this new event has 320 ancestors and is cut-off event [2025-04-30 10:29:57,909 INFO L289 olderBase$Statistics]: existing Event has 320 ancestors and is cut-off event [2025-04-30 10:29:57,909 INFO L289 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-04-30 10:29:57,909 INFO L289 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-04-30 10:29:57,909 INFO L289 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-04-30 10:29:57,910 INFO L284 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([992] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][387], [493#(= |#race~flags~0| 0), Black: 527#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 573#true, Black: 491#true, 304#L1066-7true, Black: 526#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 459#true, Black: 513#(<= (+ ~threads_alive~0 1) 0), 534#true, 480#(= |#race~flags_mutex~0| 0), 468#(= |#race~threads_total~0| 0), 566#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 524#true, Black: 568#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 556#(not (= ~flags~0.base ~tids~0.base)), Black: 482#true, 70#L1034-5true, Black: 488#(= |#race~threads_alive~0| 0), 484#(= |#race~tids~0| 0), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 478#true, Black: 539#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 538#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), 461#true, 324#L1043-5true, Black: 557#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 540#(= |cleanerThread1of1ForFork1_#t~mem11| 0), Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 546#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 529#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|))]) [2025-04-30 10:29:57,910 INFO L286 olderBase$Statistics]: this new event has 320 ancestors and is cut-off event [2025-04-30 10:29:57,910 INFO L289 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-04-30 10:29:57,910 INFO L289 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-04-30 10:29:57,910 INFO L289 olderBase$Statistics]: existing Event has 320 ancestors and is cut-off event [2025-04-30 10:29:57,910 INFO L289 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-04-30 10:29:57,927 INFO L284 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([992] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][387], [493#(= |#race~flags~0| 0), Black: 527#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 573#true, Black: 491#true, Black: 526#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 459#true, Black: 513#(<= (+ ~threads_alive~0 1) 0), 534#true, 480#(= |#race~flags_mutex~0| 0), 468#(= |#race~threads_total~0| 0), 566#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 524#true, 287#L1066-8true, Black: 568#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 556#(not (= ~flags~0.base ~tids~0.base)), Black: 482#true, 70#L1034-5true, Black: 488#(= |#race~threads_alive~0| 0), 484#(= |#race~tids~0| 0), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 478#true, Black: 538#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 539#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 461#true, 390#L1043-4true, Black: 557#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 540#(= |cleanerThread1of1ForFork1_#t~mem11| 0), Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 546#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 529#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|))]) [2025-04-30 10:29:57,928 INFO L286 olderBase$Statistics]: this new event has 320 ancestors and is cut-off event [2025-04-30 10:29:57,928 INFO L289 olderBase$Statistics]: existing Event has 320 ancestors and is cut-off event [2025-04-30 10:29:57,928 INFO L289 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-04-30 10:29:57,928 INFO L289 olderBase$Statistics]: existing Event has 320 ancestors and is cut-off event [2025-04-30 10:29:57,928 INFO L289 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-04-30 10:29:57,928 INFO L289 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-04-30 10:29:57,928 INFO L284 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([992] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][387], [493#(= |#race~flags~0| 0), Black: 527#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 573#true, Black: 491#true, 304#L1066-7true, Black: 526#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 459#true, Black: 513#(<= (+ ~threads_alive~0 1) 0), 534#true, 480#(= |#race~flags_mutex~0| 0), 468#(= |#race~threads_total~0| 0), 566#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 524#true, Black: 568#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 556#(not (= ~flags~0.base ~tids~0.base)), Black: 482#true, 70#L1034-5true, Black: 488#(= |#race~threads_alive~0| 0), 484#(= |#race~tids~0| 0), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 478#true, Black: 538#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 539#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 461#true, 324#L1043-5true, Black: 557#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 540#(= |cleanerThread1of1ForFork1_#t~mem11| 0), Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 529#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 546#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0))]) [2025-04-30 10:29:57,928 INFO L286 olderBase$Statistics]: this new event has 320 ancestors and is cut-off event [2025-04-30 10:29:57,928 INFO L289 olderBase$Statistics]: existing Event has 320 ancestors and is cut-off event [2025-04-30 10:29:57,928 INFO L289 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-04-30 10:29:57,928 INFO L289 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-04-30 10:29:57,928 INFO L289 olderBase$Statistics]: existing Event has 320 ancestors and is cut-off event [2025-04-30 10:29:57,928 INFO L289 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2025-04-30 10:29:57,929 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([992] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][387], [493#(= |#race~flags~0| 0), 20#L1066-9true, Black: 527#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 573#true, Black: 491#true, Black: 526#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 459#true, Black: 513#(<= (+ ~threads_alive~0 1) 0), 534#true, 480#(= |#race~flags_mutex~0| 0), 468#(= |#race~threads_total~0| 0), 566#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 524#true, Black: 568#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 556#(not (= ~flags~0.base ~tids~0.base)), Black: 482#true, 70#L1034-5true, Black: 488#(= |#race~threads_alive~0| 0), 484#(= |#race~tids~0| 0), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 478#true, Black: 539#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 538#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), 461#true, 324#L1043-5true, Black: 557#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 540#(= |cleanerThread1of1ForFork1_#t~mem11| 0), Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 546#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 529#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|))]) [2025-04-30 10:29:57,929 INFO L286 olderBase$Statistics]: this new event has 322 ancestors and is cut-off event [2025-04-30 10:29:57,929 INFO L289 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-04-30 10:29:57,929 INFO L289 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-04-30 10:29:57,929 INFO L289 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-04-30 10:29:57,930 INFO L284 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([992] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][387], [493#(= |#race~flags~0| 0), Black: 527#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 20#L1066-9true, 573#true, Black: 491#true, Black: 526#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 459#true, Black: 513#(<= (+ ~threads_alive~0 1) 0), 534#true, 480#(= |#race~flags_mutex~0| 0), 468#(= |#race~threads_total~0| 0), 566#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 524#true, Black: 568#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 556#(not (= ~flags~0.base ~tids~0.base)), Black: 482#true, 70#L1034-5true, Black: 488#(= |#race~threads_alive~0| 0), 484#(= |#race~tids~0| 0), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 478#true, Black: 539#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 538#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), 461#true, 390#L1043-4true, Black: 557#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 540#(= |cleanerThread1of1ForFork1_#t~mem11| 0), Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 529#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 546#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0))]) [2025-04-30 10:29:57,930 INFO L286 olderBase$Statistics]: this new event has 321 ancestors and is cut-off event [2025-04-30 10:29:57,930 INFO L289 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-04-30 10:29:57,930 INFO L289 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2025-04-30 10:29:57,930 INFO L289 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-04-30 10:29:57,930 INFO L289 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-04-30 10:29:57,931 INFO L284 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([992] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][387], [493#(= |#race~flags~0| 0), Black: 527#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 573#true, Black: 491#true, Black: 526#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 459#true, Black: 513#(<= (+ ~threads_alive~0 1) 0), 534#true, 480#(= |#race~flags_mutex~0| 0), 468#(= |#race~threads_total~0| 0), 566#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 524#true, 287#L1066-8true, Black: 568#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 556#(not (= ~flags~0.base ~tids~0.base)), Black: 482#true, 70#L1034-5true, Black: 488#(= |#race~threads_alive~0| 0), 484#(= |#race~tids~0| 0), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 478#true, Black: 539#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 538#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), 461#true, 324#L1043-5true, Black: 557#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 540#(= |cleanerThread1of1ForFork1_#t~mem11| 0), Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 546#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 529#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|))]) [2025-04-30 10:29:57,931 INFO L286 olderBase$Statistics]: this new event has 321 ancestors and is cut-off event [2025-04-30 10:29:57,931 INFO L289 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-04-30 10:29:57,931 INFO L289 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-04-30 10:29:57,931 INFO L289 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2025-04-30 10:29:57,931 INFO L289 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-04-30 10:29:57,947 INFO L284 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([992] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][387], [493#(= |#race~flags~0| 0), Black: 527#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 20#L1066-9true, 573#true, Black: 491#true, Black: 526#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 459#true, Black: 513#(<= (+ ~threads_alive~0 1) 0), 534#true, 480#(= |#race~flags_mutex~0| 0), 468#(= |#race~threads_total~0| 0), 566#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 524#true, Black: 568#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 556#(not (= ~flags~0.base ~tids~0.base)), Black: 482#true, 70#L1034-5true, Black: 488#(= |#race~threads_alive~0| 0), 484#(= |#race~tids~0| 0), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 478#true, Black: 539#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 538#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), 461#true, 390#L1043-4true, Black: 557#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 540#(= |cleanerThread1of1ForFork1_#t~mem11| 0), Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 546#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 529#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|))]) [2025-04-30 10:29:57,947 INFO L286 olderBase$Statistics]: this new event has 321 ancestors and is cut-off event [2025-04-30 10:29:57,947 INFO L289 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-04-30 10:29:57,947 INFO L289 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2025-04-30 10:29:57,947 INFO L289 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2025-04-30 10:29:57,947 INFO L289 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-04-30 10:29:57,947 INFO L289 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-04-30 10:29:57,948 INFO L284 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([992] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][387], [493#(= |#race~flags~0| 0), Black: 527#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 573#true, Black: 491#true, Black: 526#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 459#true, Black: 513#(<= (+ ~threads_alive~0 1) 0), 534#true, 480#(= |#race~flags_mutex~0| 0), 468#(= |#race~threads_total~0| 0), 566#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 524#true, 287#L1066-8true, Black: 568#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 556#(not (= ~flags~0.base ~tids~0.base)), Black: 482#true, 70#L1034-5true, Black: 488#(= |#race~threads_alive~0| 0), 484#(= |#race~tids~0| 0), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 478#true, Black: 538#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), Black: 539#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 461#true, 324#L1043-5true, Black: 557#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 540#(= |cleanerThread1of1ForFork1_#t~mem11| 0), Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 546#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 529#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|))]) [2025-04-30 10:29:57,948 INFO L286 olderBase$Statistics]: this new event has 321 ancestors and is cut-off event [2025-04-30 10:29:57,948 INFO L289 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-04-30 10:29:57,948 INFO L289 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-04-30 10:29:57,948 INFO L289 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2025-04-30 10:29:57,948 INFO L289 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2025-04-30 10:29:57,948 INFO L289 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2025-04-30 10:29:57,950 INFO L284 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([992] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][387], [493#(= |#race~flags~0| 0), Black: 527#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 20#L1066-9true, 573#true, Black: 491#true, Black: 526#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 459#true, Black: 513#(<= (+ ~threads_alive~0 1) 0), 534#true, 480#(= |#race~flags_mutex~0| 0), 468#(= |#race~threads_total~0| 0), 566#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 524#true, Black: 568#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 556#(not (= ~flags~0.base ~tids~0.base)), Black: 482#true, 70#L1034-5true, Black: 488#(= |#race~threads_alive~0| 0), 484#(= |#race~tids~0| 0), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 478#true, Black: 539#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 538#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), 461#true, 324#L1043-5true, Black: 557#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 540#(= |cleanerThread1of1ForFork1_#t~mem11| 0), Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 529#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 546#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0))]) [2025-04-30 10:29:57,950 INFO L286 olderBase$Statistics]: this new event has 322 ancestors and is cut-off event [2025-04-30 10:29:57,951 INFO L289 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-04-30 10:29:57,951 INFO L289 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-04-30 10:29:57,951 INFO L289 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-04-30 10:29:57,951 INFO L289 olderBase$Statistics]: existing Event has 322 ancestors and is cut-off event [2025-04-30 10:29:57,968 INFO L284 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([992] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][387], [493#(= |#race~flags~0| 0), Black: 527#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 20#L1066-9true, 573#true, Black: 491#true, Black: 526#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 459#true, Black: 513#(<= (+ ~threads_alive~0 1) 0), 534#true, 480#(= |#race~flags_mutex~0| 0), 468#(= |#race~threads_total~0| 0), 566#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 524#true, Black: 568#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 556#(not (= ~flags~0.base ~tids~0.base)), Black: 482#true, 70#L1034-5true, Black: 488#(= |#race~threads_alive~0| 0), 484#(= |#race~tids~0| 0), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 478#true, Black: 539#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 538#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), 461#true, 324#L1043-5true, Black: 557#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 540#(= |cleanerThread1of1ForFork1_#t~mem11| 0), Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 546#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 529#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|))]) [2025-04-30 10:29:57,968 INFO L286 olderBase$Statistics]: this new event has 322 ancestors and is cut-off event [2025-04-30 10:29:57,969 INFO L289 olderBase$Statistics]: existing Event has 322 ancestors and is cut-off event [2025-04-30 10:29:57,969 INFO L289 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-04-30 10:29:57,969 INFO L289 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-04-30 10:29:57,969 INFO L289 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2025-04-30 10:29:57,969 INFO L289 olderBase$Statistics]: existing Event has 322 ancestors and is cut-off event [2025-04-30 10:30:00,881 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([992] L1034-4-->L1034-5: Formula: (= (store |v_#race_30| v_~flags~0.base_12 (store (select |v_#race_30| v_~flags~0.base_12) (+ v_threadThread1of1ForFork0_~i~0_7 v_~flags~0.offset_12) |v_threadThread1of1ForFork0_#t~nondet8_3|)) |v_#race_29|) InVars {#race=|v_#race_30|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} OutVars{#race=|v_#race_29|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~flags~0.offset=v_~flags~0.offset_12, threadThread1of1ForFork0_#t~nondet8=|v_threadThread1of1ForFork0_#t~nondet8_3|, ~flags~0.base=v_~flags~0.base_12} AuxVars[] AssignedVars[#race][357], [493#(= |#race~flags~0| 0), 319#L1066-13true, Black: 527#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), 573#true, Black: 491#true, Black: 526#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|), 459#true, Black: 497#(= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 513#(<= (+ ~threads_alive~0 1) 0), 534#true, 236#L1040-7true, 480#(= |#race~flags_mutex~0| 0), 468#(= |#race~threads_total~0| 0), 566#(and (not (= ~flags~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 524#true, Black: 568#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0) (= 1 (select |#valid| ~tids~0.base))), Black: 556#(not (= ~flags~0.base ~tids~0.base)), Black: 482#true, 70#L1034-5true, Black: 488#(= |#race~threads_alive~0| 0), 484#(= |#race~tids~0| 0), Black: 502#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 478#true, Black: 539#(= (select (select |#memory_int| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 538#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)), 461#true, Black: 557#(and (not (= ~flags~0.base ~tids~0.base)) (= (select (select |#race| ~flags~0.base) (+ ~flags~0.offset cleanerThread1of1ForFork1_~i~1)) 0)), Black: 540#(= |cleanerThread1of1ForFork1_#t~mem11| 0), Black: 528#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|)), Black: 546#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| ~flags~0.base)) (= |cleanerThread1of1ForFork1_#t~mem11| 0)), Black: 529#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet32#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet32#1|))]) [2025-04-30 10:30:00,881 INFO L286 olderBase$Statistics]: this new event has 388 ancestors and is cut-off event [2025-04-30 10:30:00,881 INFO L289 olderBase$Statistics]: existing Event has 367 ancestors and is cut-off event [2025-04-30 10:30:00,881 INFO L289 olderBase$Statistics]: existing Event has 367 ancestors and is cut-off event [2025-04-30 10:30:00,881 INFO L289 olderBase$Statistics]: existing Event has 367 ancestors and is cut-off event [2025-04-30 10:30:01,665 INFO L116 PetriNetUnfolderBase]: 8254/37774 cut-off events. [2025-04-30 10:30:01,665 INFO L117 PetriNetUnfolderBase]: For 13762/14998 co-relation queries the response was YES. [2025-04-30 10:30:01,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68779 conditions, 37774 events. 8254/37774 cut-off events. For 13762/14998 co-relation queries the response was YES. Maximal size of possible extension queue 571. Compared 470452 event pairs, 3481 based on Foata normal form. 106/34569 useless extension candidates. Maximal degree in co-relation 68601. Up to 7981 conditions per place. [2025-04-30 10:30:01,913 INFO L140 encePairwiseOnDemand]: 462/467 looper letters, 32 selfloop transitions, 4 changer transitions 0/475 dead transitions. [2025-04-30 10:30:01,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 475 transitions, 1733 flow [2025-04-30 10:30:01,914 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:30:01,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:30:01,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1330 transitions. [2025-04-30 10:30:01,915 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9493219129193433 [2025-04-30 10:30:01,915 INFO L175 Difference]: Start difference. First operand has 414 places, 462 transitions, 1635 flow. Second operand 3 states and 1330 transitions. [2025-04-30 10:30:01,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 475 transitions, 1733 flow [2025-04-30 10:30:01,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 410 places, 475 transitions, 1722 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-30 10:30:01,967 INFO L231 Difference]: Finished difference. Result has 412 places, 465 transitions, 1654 flow [2025-04-30 10:30:01,967 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=1624, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=462, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=458, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1654, PETRI_PLACES=412, PETRI_TRANSITIONS=465} [2025-04-30 10:30:01,967 INFO L279 CegarLoopForPetriNet]: 391 programPoint places, 21 predicate places. [2025-04-30 10:30:01,967 INFO L485 AbstractCegarLoop]: Abstraction has has 412 places, 465 transitions, 1654 flow [2025-04-30 10:30:01,968 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 433.0) internal successors, (1299), 3 states have internal predecessors, (1299), 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-04-30 10:30:01,968 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:30:01,968 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:30:01,968 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-30 10:30:01,968 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2025-04-30 10:30:01,969 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:30:01,969 INFO L85 PathProgramCache]: Analyzing trace with hash 555322560, now seen corresponding path program 1 times [2025-04-30 10:30:01,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:30:01,969 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117808409] [2025-04-30 10:30:01,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:30:01,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:30:01,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-04-30 10:30:01,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-04-30 10:30:01,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:30:01,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:30:02,584 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:30:02,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:30:02,584 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117808409] [2025-04-30 10:30:02,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117808409] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:30:02,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:30:02,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-30 10:30:02,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820676585] [2025-04-30 10:30:02,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:30:02,585 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-30 10:30:02,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:30:02,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-30 10:30:02,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:30:03,036 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 402 out of 467 [2025-04-30 10:30:03,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 465 transitions, 1654 flow. Second operand has 11 states, 11 states have (on average 403.72727272727275) internal successors, (4441), 11 states have internal predecessors, (4441), 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-04-30 10:30:03,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:30:03,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 402 of 467 [2025-04-30 10:30:03,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand