./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-ext/26_stack_cas_longer-1-race.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/26_stack_cas_longer-1-race.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e12b29ddb474fc17e74c2b71eb245022640b1de10fdbbb130c7f22e13cd3653f --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 08:59:49,646 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 08:59:49,693 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-06 08:59:49,698 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 08:59:49,698 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 08:59:49,725 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 08:59:49,725 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 08:59:49,725 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 08:59:49,726 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 08:59:49,726 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 08:59:49,726 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 08:59:49,726 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 08:59:49,726 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 08:59:49,726 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 08:59:49,726 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 08:59:49,726 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 08:59:49,726 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 08:59:49,726 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 08:59:49,726 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 08:59:49,726 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 08:59:49,727 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 08:59:49,727 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 08:59:49,727 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 08:59:49,727 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 08:59:49,727 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 08:59:49,727 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 08:59:49,727 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 08:59:49,727 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 08:59:49,727 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 08:59:49,727 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 08:59:49,727 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 08:59:49,727 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 08:59:49,727 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 08:59:49,727 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 08:59:49,727 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 08:59:49,729 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 08:59:49,729 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 08:59:49,729 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 08:59:49,729 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 08:59:49,729 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 08:59:49,729 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 08:59:49,729 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 08:59:49,729 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e12b29ddb474fc17e74c2b71eb245022640b1de10fdbbb130c7f22e13cd3653f [2025-02-06 08:59:49,960 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 08:59:49,965 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 08:59:49,967 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 08:59:49,969 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 08:59:49,969 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 08:59:49,970 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/26_stack_cas_longer-1-race.i [2025-02-06 08:59:51,111 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4d7805220/7ee0b25194d0422b91b8cbfa368414d9/FLAG403cef8ea [2025-02-06 08:59:51,385 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 08:59:51,386 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/26_stack_cas_longer-1-race.i [2025-02-06 08:59:51,396 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4d7805220/7ee0b25194d0422b91b8cbfa368414d9/FLAG403cef8ea [2025-02-06 08:59:51,678 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4d7805220/7ee0b25194d0422b91b8cbfa368414d9 [2025-02-06 08:59:51,680 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 08:59:51,681 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 08:59:51,682 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 08:59:51,682 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 08:59:51,685 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 08:59:51,685 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 08:59:51" (1/1) ... [2025-02-06 08:59:51,686 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a49c00d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:59:51, skipping insertion in model container [2025-02-06 08:59:51,687 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 08:59:51" (1/1) ... [2025-02-06 08:59:51,714 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 08:59:51,993 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 08:59:52,028 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 08:59:52,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 08:59:52,106 INFO L204 MainTranslator]: Completed translation [2025-02-06 08:59:52,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:59:52 WrapperNode [2025-02-06 08:59:52,107 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 08:59:52,107 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 08:59:52,108 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 08:59:52,108 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 08:59:52,112 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:59:52" (1/1) ... [2025-02-06 08:59:52,125 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:59:52" (1/1) ... [2025-02-06 08:59:52,171 INFO L138 Inliner]: procedures = 177, calls = 45, calls flagged for inlining = 17, calls inlined = 20, statements flattened = 952 [2025-02-06 08:59:52,171 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 08:59:52,171 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 08:59:52,171 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 08:59:52,172 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 08:59:52,179 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:59:52" (1/1) ... [2025-02-06 08:59:52,179 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:59:52" (1/1) ... [2025-02-06 08:59:52,185 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:59:52" (1/1) ... [2025-02-06 08:59:52,185 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:59:52" (1/1) ... [2025-02-06 08:59:52,210 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:59:52" (1/1) ... [2025-02-06 08:59:52,218 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:59:52" (1/1) ... [2025-02-06 08:59:52,223 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:59:52" (1/1) ... [2025-02-06 08:59:52,227 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:59:52" (1/1) ... [2025-02-06 08:59:52,236 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 08:59:52,237 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 08:59:52,238 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 08:59:52,238 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 08:59:52,238 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:59:52" (1/1) ... [2025-02-06 08:59:52,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 08:59:52,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:59:52,273 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 08:59:52,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 08:59:52,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 08:59:52,301 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-02-06 08:59:52,302 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-02-06 08:59:52,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 08:59:52,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 08:59:52,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 08:59:52,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 08:59:52,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 08:59:52,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 08:59:52,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 08:59:52,303 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 08:59:52,414 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 08:59:52,416 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 08:59:53,391 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 08:59:53,392 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 08:59:53,690 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 08:59:53,690 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 08:59:53,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 08:59:53 BoogieIcfgContainer [2025-02-06 08:59:53,691 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 08:59:53,692 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 08:59:53,693 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 08:59:53,696 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 08:59:53,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 08:59:51" (1/3) ... [2025-02-06 08:59:53,696 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b48d885 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 08:59:53, skipping insertion in model container [2025-02-06 08:59:53,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:59:52" (2/3) ... [2025-02-06 08:59:53,697 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b48d885 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 08:59:53, skipping insertion in model container [2025-02-06 08:59:53,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 08:59:53" (3/3) ... [2025-02-06 08:59:53,697 INFO L128 eAbstractionObserver]: Analyzing ICFG 26_stack_cas_longer-1-race.i [2025-02-06 08:59:53,709 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 08:59:53,710 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 26_stack_cas_longer-1-race.i that has 2 procedures, 813 locations, 1 initial locations, 3 loop locations, and 26 error locations. [2025-02-06 08:59:53,710 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 08:59:53,805 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 08:59:53,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 816 places, 820 transitions, 1644 flow [2025-02-06 08:59:54,100 INFO L124 PetriNetUnfolderBase]: 7/827 cut-off events. [2025-02-06 08:59:54,101 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 08:59:54,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 831 conditions, 827 events. 7/827 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 249 event pairs, 0 based on Foata normal form. 0/792 useless extension candidates. Maximal degree in co-relation 157. Up to 3 conditions per place. [2025-02-06 08:59:54,105 INFO L82 GeneralOperation]: Start removeDead. Operand has 816 places, 820 transitions, 1644 flow [2025-02-06 08:59:54,111 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 816 places, 820 transitions, 1644 flow [2025-02-06 08:59:54,120 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 08:59:54,131 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@71275923, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 08:59:54,131 INFO L334 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2025-02-06 08:59:54,198 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 08:59:54,198 INFO L124 PetriNetUnfolderBase]: 0/671 cut-off events. [2025-02-06 08:59:54,198 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 08:59:54,198 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:59:54,199 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:59:54,199 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err25ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 49 more)] === [2025-02-06 08:59:54,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:59:54,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1308930191, now seen corresponding path program 1 times [2025-02-06 08:59:54,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:59:54,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292737606] [2025-02-06 08:59:54,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:59:54,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:59:54,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 667 statements into 1 equivalence classes. [2025-02-06 08:59:54,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 667 of 667 statements. [2025-02-06 08:59:54,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:59:54,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:59:56,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:59:56,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:59:56,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292737606] [2025-02-06 08:59:56,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292737606] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:59:56,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:59:56,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 08:59:57,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26348357] [2025-02-06 08:59:57,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:59:57,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 08:59:57,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:59:57,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 08:59:57,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 08:59:57,035 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 794 out of 820 [2025-02-06 08:59:57,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 816 places, 820 transitions, 1644 flow. Second operand has 2 states, 2 states have (on average 795.0) internal successors, (1590), 2 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:59:57,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:59:57,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 794 of 820 [2025-02-06 08:59:57,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:59:57,270 INFO L124 PetriNetUnfolderBase]: 5/799 cut-off events. [2025-02-06 08:59:57,272 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 08:59:57,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 812 conditions, 799 events. 5/799 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 160 event pairs, 0 based on Foata normal form. 9/792 useless extension candidates. Maximal degree in co-relation 140. Up to 9 conditions per place. [2025-02-06 08:59:57,275 INFO L140 encePairwiseOnDemand]: 802/820 looper letters, 8 selfloop transitions, 0 changer transitions 0/796 dead transitions. [2025-02-06 08:59:57,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 795 places, 796 transitions, 1612 flow [2025-02-06 08:59:57,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 08:59:57,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-06 08:59:57,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1614 transitions. [2025-02-06 08:59:57,294 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9841463414634146 [2025-02-06 08:59:57,296 INFO L175 Difference]: Start difference. First operand has 816 places, 820 transitions, 1644 flow. Second operand 2 states and 1614 transitions. [2025-02-06 08:59:57,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 795 places, 796 transitions, 1612 flow [2025-02-06 08:59:57,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 795 places, 796 transitions, 1612 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 08:59:57,319 INFO L231 Difference]: Finished difference. Result has 795 places, 796 transitions, 1596 flow [2025-02-06 08:59:57,322 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=820, PETRI_DIFFERENCE_MINUEND_FLOW=1596, PETRI_DIFFERENCE_MINUEND_PLACES=794, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=796, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=796, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=1596, PETRI_PLACES=795, PETRI_TRANSITIONS=796} [2025-02-06 08:59:57,325 INFO L279 CegarLoopForPetriNet]: 816 programPoint places, -21 predicate places. [2025-02-06 08:59:57,326 INFO L471 AbstractCegarLoop]: Abstraction has has 795 places, 796 transitions, 1596 flow [2025-02-06 08:59:57,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 795.0) internal successors, (1590), 2 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:59:57,328 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:59:57,328 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:59:57,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 08:59:57,329 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err23ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 49 more)] === [2025-02-06 08:59:57,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:59:57,331 INFO L85 PathProgramCache]: Analyzing trace with hash -543434669, now seen corresponding path program 1 times [2025-02-06 08:59:57,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:59:57,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677643278] [2025-02-06 08:59:57,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:59:57,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:59:57,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 669 statements into 1 equivalence classes. [2025-02-06 08:59:57,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 669 of 669 statements. [2025-02-06 08:59:57,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:59:57,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:59:57,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:59:57,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:59:57,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677643278] [2025-02-06 08:59:57,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677643278] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:59:57,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:59:57,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 08:59:57,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615228218] [2025-02-06 08:59:57,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:59:57,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:59:57,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:59:57,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:59:57,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:59:58,001 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 790 out of 820 [2025-02-06 08:59:58,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 795 places, 796 transitions, 1596 flow. Second operand has 3 states, 3 states have (on average 791.3333333333334) internal successors, (2374), 3 states have internal predecessors, (2374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:59:58,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 08:59:58,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 790 of 820 [2025-02-06 08:59:58,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 08:59:58,172 INFO L124 PetriNetUnfolderBase]: 8/902 cut-off events. [2025-02-06 08:59:58,173 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 08:59:58,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 925 conditions, 902 events. 8/902 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 493 event pairs, 0 based on Foata normal form. 0/875 useless extension candidates. Maximal degree in co-relation 921. Up to 10 conditions per place. [2025-02-06 08:59:58,176 INFO L140 encePairwiseOnDemand]: 817/820 looper letters, 15 selfloop transitions, 2 changer transitions 0/801 dead transitions. [2025-02-06 08:59:58,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 796 places, 801 transitions, 1640 flow [2025-02-06 08:59:58,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:59:58,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 08:59:58,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2388 transitions. [2025-02-06 08:59:58,185 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9707317073170731 [2025-02-06 08:59:58,186 INFO L175 Difference]: Start difference. First operand has 795 places, 796 transitions, 1596 flow. Second operand 3 states and 2388 transitions. [2025-02-06 08:59:58,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 796 places, 801 transitions, 1640 flow [2025-02-06 08:59:58,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 796 places, 801 transitions, 1640 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 08:59:58,199 INFO L231 Difference]: Finished difference. Result has 796 places, 795 transitions, 1598 flow [2025-02-06 08:59:58,201 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=820, PETRI_DIFFERENCE_MINUEND_FLOW=1594, PETRI_DIFFERENCE_MINUEND_PLACES=794, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=795, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=793, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1598, PETRI_PLACES=796, PETRI_TRANSITIONS=795} [2025-02-06 08:59:58,201 INFO L279 CegarLoopForPetriNet]: 816 programPoint places, -20 predicate places. [2025-02-06 08:59:58,202 INFO L471 AbstractCegarLoop]: Abstraction has has 796 places, 795 transitions, 1598 flow [2025-02-06 08:59:58,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 791.3333333333334) internal successors, (2374), 3 states have internal predecessors, (2374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:59:58,204 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:59:58,205 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:59:58,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 08:59:58,205 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 49 more)] === [2025-02-06 08:59:58,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:59:58,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1415911043, now seen corresponding path program 1 times [2025-02-06 08:59:58,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:59:58,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956784745] [2025-02-06 08:59:58,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:59:58,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:59:58,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 671 statements into 1 equivalence classes. [2025-02-06 08:59:58,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 671 of 671 statements. [2025-02-06 08:59:58,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:59:58,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 08:59:58,440 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 08:59:58,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 671 statements into 1 equivalence classes. [2025-02-06 08:59:58,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 671 of 671 statements. [2025-02-06 08:59:58,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:59:58,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 08:59:58,677 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 08:59:58,677 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 08:59:58,678 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (52 of 53 remaining) [2025-02-06 08:59:58,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (51 of 53 remaining) [2025-02-06 08:59:58,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (50 of 53 remaining) [2025-02-06 08:59:58,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (49 of 53 remaining) [2025-02-06 08:59:58,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (48 of 53 remaining) [2025-02-06 08:59:58,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (47 of 53 remaining) [2025-02-06 08:59:58,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (46 of 53 remaining) [2025-02-06 08:59:58,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (45 of 53 remaining) [2025-02-06 08:59:58,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (44 of 53 remaining) [2025-02-06 08:59:58,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (43 of 53 remaining) [2025-02-06 08:59:58,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (42 of 53 remaining) [2025-02-06 08:59:58,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (41 of 53 remaining) [2025-02-06 08:59:58,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (40 of 53 remaining) [2025-02-06 08:59:58,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (39 of 53 remaining) [2025-02-06 08:59:58,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (38 of 53 remaining) [2025-02-06 08:59:58,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (37 of 53 remaining) [2025-02-06 08:59:58,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (36 of 53 remaining) [2025-02-06 08:59:58,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (35 of 53 remaining) [2025-02-06 08:59:58,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (34 of 53 remaining) [2025-02-06 08:59:58,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (33 of 53 remaining) [2025-02-06 08:59:58,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (32 of 53 remaining) [2025-02-06 08:59:58,681 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (31 of 53 remaining) [2025-02-06 08:59:58,681 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (30 of 53 remaining) [2025-02-06 08:59:58,681 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (29 of 53 remaining) [2025-02-06 08:59:58,681 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (28 of 53 remaining) [2025-02-06 08:59:58,681 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (27 of 53 remaining) [2025-02-06 08:59:58,681 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (26 of 53 remaining) [2025-02-06 08:59:58,681 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (25 of 53 remaining) [2025-02-06 08:59:58,681 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (24 of 53 remaining) [2025-02-06 08:59:58,681 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (23 of 53 remaining) [2025-02-06 08:59:58,681 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (22 of 53 remaining) [2025-02-06 08:59:58,681 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (21 of 53 remaining) [2025-02-06 08:59:58,681 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (20 of 53 remaining) [2025-02-06 08:59:58,682 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (19 of 53 remaining) [2025-02-06 08:59:58,682 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (18 of 53 remaining) [2025-02-06 08:59:58,682 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (17 of 53 remaining) [2025-02-06 08:59:58,682 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (16 of 53 remaining) [2025-02-06 08:59:58,682 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (15 of 53 remaining) [2025-02-06 08:59:58,682 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (14 of 53 remaining) [2025-02-06 08:59:58,682 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (13 of 53 remaining) [2025-02-06 08:59:58,682 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (12 of 53 remaining) [2025-02-06 08:59:58,682 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (11 of 53 remaining) [2025-02-06 08:59:58,682 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (10 of 53 remaining) [2025-02-06 08:59:58,682 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (9 of 53 remaining) [2025-02-06 08:59:58,682 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (8 of 53 remaining) [2025-02-06 08:59:58,682 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (7 of 53 remaining) [2025-02-06 08:59:58,682 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (6 of 53 remaining) [2025-02-06 08:59:58,683 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (5 of 53 remaining) [2025-02-06 08:59:58,683 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (4 of 53 remaining) [2025-02-06 08:59:58,683 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (3 of 53 remaining) [2025-02-06 08:59:58,683 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (2 of 53 remaining) [2025-02-06 08:59:58,683 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (1 of 53 remaining) [2025-02-06 08:59:58,683 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 53 remaining) [2025-02-06 08:59:58,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 08:59:58,683 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-06 08:59:58,685 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 08:59:58,685 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-06 08:59:58,762 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 08:59:58,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 960 places, 969 transitions, 1948 flow [2025-02-06 08:59:58,988 INFO L124 PetriNetUnfolderBase]: 14/985 cut-off events. [2025-02-06 08:59:58,989 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 08:59:58,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 993 conditions, 985 events. 14/985 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1007 event pairs, 0 based on Foata normal form. 0/916 useless extension candidates. Maximal degree in co-relation 828. Up to 3 conditions per place. [2025-02-06 08:59:58,995 INFO L82 GeneralOperation]: Start removeDead. Operand has 960 places, 969 transitions, 1948 flow [2025-02-06 08:59:59,002 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 960 places, 969 transitions, 1948 flow [2025-02-06 08:59:59,003 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 08:59:59,003 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@71275923, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 08:59:59,003 INFO L334 AbstractCegarLoop]: Starting to check reachability of 79 error locations. [2025-02-06 08:59:59,082 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 08:59:59,082 INFO L124 PetriNetUnfolderBase]: 0/671 cut-off events. [2025-02-06 08:59:59,082 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 08:59:59,082 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 08:59:59,083 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:59:59,083 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err25ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2025-02-06 08:59:59,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:59:59,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1928406988, now seen corresponding path program 1 times [2025-02-06 08:59:59,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:59:59,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97543120] [2025-02-06 08:59:59,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:59:59,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:59:59,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 667 statements into 1 equivalence classes. [2025-02-06 08:59:59,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 667 of 667 statements. [2025-02-06 08:59:59,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:59:59,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:00:00,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:00:00,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:00:00,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97543120] [2025-02-06 09:00:00,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97543120] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:00:00,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:00:00,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 09:00:00,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070152089] [2025-02-06 09:00:00,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:00:00,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 09:00:00,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:00:00,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 09:00:00,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 09:00:00,574 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 918 out of 969 [2025-02-06 09:00:00,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 960 places, 969 transitions, 1948 flow. Second operand has 2 states, 2 states have (on average 919.0) internal successors, (1838), 2 states have internal predecessors, (1838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:00:00,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:00:00,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 918 of 969 [2025-02-06 09:00:00,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:00:01,051 INFO L124 PetriNetUnfolderBase]: 101/1990 cut-off events. [2025-02-06 09:00:01,052 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-02-06 09:00:01,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2139 conditions, 1990 events. 101/1990 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 8357 event pairs, 38 based on Foata normal form. 89/1909 useless extension candidates. Maximal degree in co-relation 1297. Up to 126 conditions per place. [2025-02-06 09:00:01,064 INFO L140 encePairwiseOnDemand]: 934/969 looper letters, 16 selfloop transitions, 0 changer transitions 0/925 dead transitions. [2025-02-06 09:00:01,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 921 places, 925 transitions, 1892 flow [2025-02-06 09:00:01,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 09:00:01,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-06 09:00:01,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1887 transitions. [2025-02-06 09:00:01,071 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9736842105263158 [2025-02-06 09:00:01,071 INFO L175 Difference]: Start difference. First operand has 960 places, 969 transitions, 1948 flow. Second operand 2 states and 1887 transitions. [2025-02-06 09:00:01,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 921 places, 925 transitions, 1892 flow [2025-02-06 09:00:01,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 921 places, 925 transitions, 1892 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:00:01,084 INFO L231 Difference]: Finished difference. Result has 921 places, 925 transitions, 1860 flow [2025-02-06 09:00:01,086 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=969, PETRI_DIFFERENCE_MINUEND_FLOW=1860, PETRI_DIFFERENCE_MINUEND_PLACES=920, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=925, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=925, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=1860, PETRI_PLACES=921, PETRI_TRANSITIONS=925} [2025-02-06 09:00:01,086 INFO L279 CegarLoopForPetriNet]: 960 programPoint places, -39 predicate places. [2025-02-06 09:00:01,086 INFO L471 AbstractCegarLoop]: Abstraction has has 921 places, 925 transitions, 1860 flow [2025-02-06 09:00:01,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 919.0) internal successors, (1838), 2 states have internal predecessors, (1838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:00:01,087 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:00:01,088 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:00:01,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:00:01,088 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err23ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2025-02-06 09:00:01,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:00:01,090 INFO L85 PathProgramCache]: Analyzing trace with hash 2068316144, now seen corresponding path program 1 times [2025-02-06 09:00:01,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:00:01,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839779986] [2025-02-06 09:00:01,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:00:01,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:00:01,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 669 statements into 1 equivalence classes. [2025-02-06 09:00:01,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 669 of 669 statements. [2025-02-06 09:00:01,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:00:01,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:00:01,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:00:01,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:00:01,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839779986] [2025-02-06 09:00:01,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839779986] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:00:01,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:00:01,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:00:01,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628593522] [2025-02-06 09:00:01,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:00:01,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:00:01,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:00:01,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:00:01,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:00:01,441 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 910 out of 969 [2025-02-06 09:00:01,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 921 places, 925 transitions, 1860 flow. Second operand has 3 states, 3 states have (on average 911.3333333333334) internal successors, (2734), 3 states have internal predecessors, (2734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:00:01,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:00:01,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 910 of 969 [2025-02-06 09:00:01,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:00:02,440 INFO L124 PetriNetUnfolderBase]: 339/4574 cut-off events. [2025-02-06 09:00:02,441 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-02-06 09:00:02,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5095 conditions, 4574 events. 339/4574 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 35398 event pairs, 77 based on Foata normal form. 0/4087 useless extension candidates. Maximal degree in co-relation 5090. Up to 242 conditions per place. [2025-02-06 09:00:02,474 INFO L140 encePairwiseOnDemand]: 961/969 looper letters, 39 selfloop transitions, 6 changer transitions 0/946 dead transitions. [2025-02-06 09:00:02,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 923 places, 946 transitions, 1997 flow [2025-02-06 09:00:02,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:00:02,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:00:02,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2777 transitions. [2025-02-06 09:00:02,486 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9552803577571379 [2025-02-06 09:00:02,486 INFO L175 Difference]: Start difference. First operand has 921 places, 925 transitions, 1860 flow. Second operand 3 states and 2777 transitions. [2025-02-06 09:00:02,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 923 places, 946 transitions, 1997 flow [2025-02-06 09:00:02,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 923 places, 946 transitions, 1997 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:00:02,498 INFO L231 Difference]: Finished difference. Result has 925 places, 931 transitions, 1912 flow [2025-02-06 09:00:02,499 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=969, PETRI_DIFFERENCE_MINUEND_FLOW=1860, PETRI_DIFFERENCE_MINUEND_PLACES=921, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=925, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=919, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1912, PETRI_PLACES=925, PETRI_TRANSITIONS=931} [2025-02-06 09:00:02,500 INFO L279 CegarLoopForPetriNet]: 960 programPoint places, -35 predicate places. [2025-02-06 09:00:02,500 INFO L471 AbstractCegarLoop]: Abstraction has has 925 places, 931 transitions, 1912 flow [2025-02-06 09:00:02,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 911.3333333333334) internal successors, (2734), 3 states have internal predecessors, (2734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:00:02,502 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:00:02,502 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:00:02,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:00:02,502 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2025-02-06 09:00:02,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:00:02,504 INFO L85 PathProgramCache]: Analyzing trace with hash 756559743, now seen corresponding path program 1 times [2025-02-06 09:00:02,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:00:02,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546228383] [2025-02-06 09:00:02,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:00:02,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:00:02,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 677 statements into 1 equivalence classes. [2025-02-06 09:00:02,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 677 of 677 statements. [2025-02-06 09:00:02,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:00:02,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:00:02,663 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 09:00:02,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 677 statements into 1 equivalence classes. [2025-02-06 09:00:02,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 677 of 677 statements. [2025-02-06 09:00:02,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:00:02,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:00:02,819 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 09:00:02,819 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 09:00:02,820 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (78 of 79 remaining) [2025-02-06 09:00:02,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (77 of 79 remaining) [2025-02-06 09:00:02,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (76 of 79 remaining) [2025-02-06 09:00:02,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (75 of 79 remaining) [2025-02-06 09:00:02,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (74 of 79 remaining) [2025-02-06 09:00:02,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (73 of 79 remaining) [2025-02-06 09:00:02,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (72 of 79 remaining) [2025-02-06 09:00:02,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (71 of 79 remaining) [2025-02-06 09:00:02,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (70 of 79 remaining) [2025-02-06 09:00:02,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (69 of 79 remaining) [2025-02-06 09:00:02,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (68 of 79 remaining) [2025-02-06 09:00:02,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (67 of 79 remaining) [2025-02-06 09:00:02,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (66 of 79 remaining) [2025-02-06 09:00:02,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (65 of 79 remaining) [2025-02-06 09:00:02,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (64 of 79 remaining) [2025-02-06 09:00:02,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (63 of 79 remaining) [2025-02-06 09:00:02,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (62 of 79 remaining) [2025-02-06 09:00:02,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (61 of 79 remaining) [2025-02-06 09:00:02,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (60 of 79 remaining) [2025-02-06 09:00:02,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (59 of 79 remaining) [2025-02-06 09:00:02,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (58 of 79 remaining) [2025-02-06 09:00:02,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (57 of 79 remaining) [2025-02-06 09:00:02,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (56 of 79 remaining) [2025-02-06 09:00:02,821 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (55 of 79 remaining) [2025-02-06 09:00:02,821 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (54 of 79 remaining) [2025-02-06 09:00:02,821 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (53 of 79 remaining) [2025-02-06 09:00:02,821 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (52 of 79 remaining) [2025-02-06 09:00:02,821 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (51 of 79 remaining) [2025-02-06 09:00:02,821 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (50 of 79 remaining) [2025-02-06 09:00:02,821 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (49 of 79 remaining) [2025-02-06 09:00:02,821 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (48 of 79 remaining) [2025-02-06 09:00:02,821 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (47 of 79 remaining) [2025-02-06 09:00:02,821 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (46 of 79 remaining) [2025-02-06 09:00:02,821 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (45 of 79 remaining) [2025-02-06 09:00:02,821 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (44 of 79 remaining) [2025-02-06 09:00:02,821 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (43 of 79 remaining) [2025-02-06 09:00:02,821 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (42 of 79 remaining) [2025-02-06 09:00:02,821 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (41 of 79 remaining) [2025-02-06 09:00:02,821 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (40 of 79 remaining) [2025-02-06 09:00:02,821 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (39 of 79 remaining) [2025-02-06 09:00:02,821 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (38 of 79 remaining) [2025-02-06 09:00:02,821 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (37 of 79 remaining) [2025-02-06 09:00:02,821 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (36 of 79 remaining) [2025-02-06 09:00:02,821 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (35 of 79 remaining) [2025-02-06 09:00:02,821 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (34 of 79 remaining) [2025-02-06 09:00:02,821 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (33 of 79 remaining) [2025-02-06 09:00:02,821 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (32 of 79 remaining) [2025-02-06 09:00:02,821 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (31 of 79 remaining) [2025-02-06 09:00:02,821 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (30 of 79 remaining) [2025-02-06 09:00:02,821 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (29 of 79 remaining) [2025-02-06 09:00:02,821 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (28 of 79 remaining) [2025-02-06 09:00:02,821 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (27 of 79 remaining) [2025-02-06 09:00:02,821 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (26 of 79 remaining) [2025-02-06 09:00:02,821 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (25 of 79 remaining) [2025-02-06 09:00:02,821 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (24 of 79 remaining) [2025-02-06 09:00:02,821 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (23 of 79 remaining) [2025-02-06 09:00:02,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (22 of 79 remaining) [2025-02-06 09:00:02,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (21 of 79 remaining) [2025-02-06 09:00:02,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (20 of 79 remaining) [2025-02-06 09:00:02,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (19 of 79 remaining) [2025-02-06 09:00:02,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (18 of 79 remaining) [2025-02-06 09:00:02,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (17 of 79 remaining) [2025-02-06 09:00:02,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (16 of 79 remaining) [2025-02-06 09:00:02,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (15 of 79 remaining) [2025-02-06 09:00:02,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (14 of 79 remaining) [2025-02-06 09:00:02,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (13 of 79 remaining) [2025-02-06 09:00:02,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (12 of 79 remaining) [2025-02-06 09:00:02,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (11 of 79 remaining) [2025-02-06 09:00:02,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (10 of 79 remaining) [2025-02-06 09:00:02,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (9 of 79 remaining) [2025-02-06 09:00:02,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (8 of 79 remaining) [2025-02-06 09:00:02,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (7 of 79 remaining) [2025-02-06 09:00:02,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (6 of 79 remaining) [2025-02-06 09:00:02,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (5 of 79 remaining) [2025-02-06 09:00:02,824 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (4 of 79 remaining) [2025-02-06 09:00:02,824 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (3 of 79 remaining) [2025-02-06 09:00:02,824 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (2 of 79 remaining) [2025-02-06 09:00:02,824 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (1 of 79 remaining) [2025-02-06 09:00:02,824 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 79 remaining) [2025-02-06 09:00:02,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:00:02,824 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-06 09:00:02,825 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 09:00:02,825 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-06 09:00:02,924 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 09:00:02,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1104 places, 1118 transitions, 2254 flow [2025-02-06 09:00:03,145 INFO L124 PetriNetUnfolderBase]: 21/1143 cut-off events. [2025-02-06 09:00:03,145 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-06 09:00:03,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1156 conditions, 1143 events. 21/1143 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1950 event pairs, 0 based on Foata normal form. 0/1040 useless extension candidates. Maximal degree in co-relation 989. Up to 4 conditions per place. [2025-02-06 09:00:03,153 INFO L82 GeneralOperation]: Start removeDead. Operand has 1104 places, 1118 transitions, 2254 flow [2025-02-06 09:00:03,161 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1104 places, 1118 transitions, 2254 flow [2025-02-06 09:00:03,162 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:00:03,162 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@71275923, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:00:03,162 INFO L334 AbstractCegarLoop]: Starting to check reachability of 105 error locations. [2025-02-06 09:00:03,204 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:00:03,204 INFO L124 PetriNetUnfolderBase]: 0/672 cut-off events. [2025-02-06 09:00:03,204 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:00:03,204 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:00:03,205 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:00:03,205 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err25ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2025-02-06 09:00:03,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:00:03,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1230780674, now seen corresponding path program 1 times [2025-02-06 09:00:03,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:00:03,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484283183] [2025-02-06 09:00:03,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:00:03,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:00:03,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 667 statements into 1 equivalence classes. [2025-02-06 09:00:03,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 667 of 667 statements. [2025-02-06 09:00:03,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:00:03,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:00:04,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:00:04,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:00:04,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484283183] [2025-02-06 09:00:04,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484283183] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:00:04,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:00:04,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 09:00:04,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135964681] [2025-02-06 09:00:04,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:00:04,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 09:00:04,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:00:04,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 09:00:04,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 09:00:04,159 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1042 out of 1118 [2025-02-06 09:00:04,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1104 places, 1118 transitions, 2254 flow. Second operand has 2 states, 2 states have (on average 1043.0) internal successors, (2086), 2 states have internal predecessors, (2086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:00:04,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:00:04,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1042 of 1118 [2025-02-06 09:00:04,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:00:07,121 INFO L124 PetriNetUnfolderBase]: 1325/12117 cut-off events. [2025-02-06 09:00:07,121 INFO L125 PetriNetUnfolderBase]: For 298/298 co-relation queries the response was YES. [2025-02-06 09:00:07,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13858 conditions, 12117 events. 1325/12117 cut-off events. For 298/298 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 127748 event pairs, 624 based on Foata normal form. 920/11609 useless extension candidates. Maximal degree in co-relation 11444. Up to 1533 conditions per place. [2025-02-06 09:00:07,232 INFO L140 encePairwiseOnDemand]: 1066/1118 looper letters, 24 selfloop transitions, 0 changer transitions 0/1054 dead transitions. [2025-02-06 09:00:07,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1047 places, 1054 transitions, 2174 flow [2025-02-06 09:00:07,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 09:00:07,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-06 09:00:07,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2160 transitions. [2025-02-06 09:00:07,239 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9660107334525939 [2025-02-06 09:00:07,239 INFO L175 Difference]: Start difference. First operand has 1104 places, 1118 transitions, 2254 flow. Second operand 2 states and 2160 transitions. [2025-02-06 09:00:07,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1047 places, 1054 transitions, 2174 flow [2025-02-06 09:00:07,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1047 places, 1054 transitions, 2172 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-02-06 09:00:07,253 INFO L231 Difference]: Finished difference. Result has 1047 places, 1054 transitions, 2124 flow [2025-02-06 09:00:07,254 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1118, PETRI_DIFFERENCE_MINUEND_FLOW=2124, PETRI_DIFFERENCE_MINUEND_PLACES=1046, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1054, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1054, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=2124, PETRI_PLACES=1047, PETRI_TRANSITIONS=1054} [2025-02-06 09:00:07,256 INFO L279 CegarLoopForPetriNet]: 1104 programPoint places, -57 predicate places. [2025-02-06 09:00:07,256 INFO L471 AbstractCegarLoop]: Abstraction has has 1047 places, 1054 transitions, 2124 flow [2025-02-06 09:00:07,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 1043.0) internal successors, (2086), 2 states have internal predecessors, (2086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:00:07,258 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:00:07,258 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:00:07,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:00:07,259 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err23ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2025-02-06 09:00:07,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:00:07,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1664080286, now seen corresponding path program 1 times [2025-02-06 09:00:07,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:00:07,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395715158] [2025-02-06 09:00:07,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:00:07,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:00:07,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 669 statements into 1 equivalence classes. [2025-02-06 09:00:07,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 669 of 669 statements. [2025-02-06 09:00:07,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:00:07,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:00:07,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:00:07,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:00:07,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395715158] [2025-02-06 09:00:07,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395715158] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:00:07,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:00:07,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:00:07,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511028850] [2025-02-06 09:00:07,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:00:07,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:00:07,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:00:07,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:00:07,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:00:07,510 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1030 out of 1118 [2025-02-06 09:00:07,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1047 places, 1054 transitions, 2124 flow. Second operand has 3 states, 3 states have (on average 1031.3333333333333) internal successors, (3094), 3 states have internal predecessors, (3094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:00:07,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:00:07,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1030 of 1118 [2025-02-06 09:00:07,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:00:19,109 INFO L124 PetriNetUnfolderBase]: 7711/55446 cut-off events. [2025-02-06 09:00:19,109 INFO L125 PetriNetUnfolderBase]: For 595/595 co-relation queries the response was YES. [2025-02-06 09:00:19,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65718 conditions, 55446 events. 7711/55446 cut-off events. For 595/595 co-relation queries the response was YES. Maximal size of possible extension queue 938. Compared 820428 event pairs, 2078 based on Foata normal form. 0/48410 useless extension candidates. Maximal degree in co-relation 65712. Up to 4933 conditions per place. [2025-02-06 09:00:19,838 INFO L140 encePairwiseOnDemand]: 1106/1118 looper letters, 59 selfloop transitions, 9 changer transitions 0/1086 dead transitions. [2025-02-06 09:00:19,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1049 places, 1086 transitions, 2334 flow [2025-02-06 09:00:19,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:00:19,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:00:19,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3161 transitions. [2025-02-06 09:00:19,845 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9424567680381634 [2025-02-06 09:00:19,846 INFO L175 Difference]: Start difference. First operand has 1047 places, 1054 transitions, 2124 flow. Second operand 3 states and 3161 transitions. [2025-02-06 09:00:19,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1049 places, 1086 transitions, 2334 flow [2025-02-06 09:00:19,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1049 places, 1086 transitions, 2334 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:00:19,858 INFO L231 Difference]: Finished difference. Result has 1051 places, 1063 transitions, 2202 flow [2025-02-06 09:00:19,860 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1118, PETRI_DIFFERENCE_MINUEND_FLOW=2124, PETRI_DIFFERENCE_MINUEND_PLACES=1047, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1054, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1045, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2202, PETRI_PLACES=1051, PETRI_TRANSITIONS=1063} [2025-02-06 09:00:19,862 INFO L279 CegarLoopForPetriNet]: 1104 programPoint places, -53 predicate places. [2025-02-06 09:00:19,862 INFO L471 AbstractCegarLoop]: Abstraction has has 1051 places, 1063 transitions, 2202 flow [2025-02-06 09:00:19,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1031.3333333333333) internal successors, (3094), 3 states have internal predecessors, (3094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:00:19,865 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:00:19,866 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:00:19,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:00:19,866 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err22ASSERT_VIOLATIONDATA_RACE === [thr1Err25ASSERT_VIOLATIONDATA_RACE, thr1Err24ASSERT_VIOLATIONDATA_RACE, thr1Err23ASSERT_VIOLATIONDATA_RACE, thr1Err20ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2025-02-06 09:00:19,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:00:19,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1851147344, now seen corresponding path program 1 times [2025-02-06 09:00:19,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:00:19,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814520325] [2025-02-06 09:00:19,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:00:19,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:00:19,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 679 statements into 1 equivalence classes. [2025-02-06 09:00:20,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 679 of 679 statements. [2025-02-06 09:00:20,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:00:20,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:00:21,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:00:21,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:00:21,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814520325] [2025-02-06 09:00:21,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814520325] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:00:21,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:00:21,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:00:21,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432518486] [2025-02-06 09:00:21,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:00:21,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:00:21,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:00:21,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:00:21,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:00:21,677 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 994 out of 1118 [2025-02-06 09:00:21,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1051 places, 1063 transitions, 2202 flow. Second operand has 6 states, 6 states have (on average 995.6666666666666) internal successors, (5974), 6 states have internal predecessors, (5974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:00:21,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:00:21,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 994 of 1118 [2025-02-06 09:00:21,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:00:26,060 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4213] L780-3-->L781: Formula: (let ((.cse1 (select |v_#race_863| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse4 (+ |v_~#m2~0.offset_23| 1)) (.cse3 (select .cse1 .cse5)) (.cse0 (select |v_#memory_int_285| |v_~#m2~0.base_23|))) (and (not (= (ite (= (select .cse0 |v_~#m2~0.offset_23|) 1) 1 0) 0)) (= (select .cse1 .cse2) .cse3) (= |v_#race_863| (store |v_#race_865| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_865| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse3) .cse4 .cse3) .cse2 .cse3) .cse5 .cse3))) (= .cse3 (select .cse1 .cse4)) (= .cse3 (select .cse1 |v_~#m2~0.offset_23|)) (= (store |v_#memory_int_285| |v_~#m2~0.base_23| (store .cse0 |v_~#m2~0.offset_23| 0)) |v_#memory_int_284|)))) InVars {#race=|v_#race_865|, #memory_int=|v_#memory_int_285|, ~#m2~0.base=|v_~#m2~0.base_23|, ~#m2~0.offset=|v_~#m2~0.offset_23|} OutVars{#race=|v_#race_863|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_284|, ~#m2~0.base=|v_~#m2~0.base_23|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_23|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][839], [781#L732-1true, 809#L781true, 1111#(= |#race~state~0| 0), 1114#true, 1105#true, Black: 1109#true, 717#L789-2true, 1103#true, 1107#true, 1101#true, 907#L781true]) [2025-02-06 09:00:26,061 INFO L294 olderBase$Statistics]: this new event has 723 ancestors and is cut-off event [2025-02-06 09:00:26,061 INFO L297 olderBase$Statistics]: existing Event has 723 ancestors and is cut-off event [2025-02-06 09:00:26,061 INFO L297 olderBase$Statistics]: existing Event has 709 ancestors and is cut-off event [2025-02-06 09:00:26,061 INFO L297 olderBase$Statistics]: existing Event has 709 ancestors and is cut-off event [2025-02-06 09:00:26,236 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4213] L780-3-->L781: Formula: (let ((.cse1 (select |v_#race_863| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse4 (+ |v_~#m2~0.offset_23| 1)) (.cse3 (select .cse1 .cse5)) (.cse0 (select |v_#memory_int_285| |v_~#m2~0.base_23|))) (and (not (= (ite (= (select .cse0 |v_~#m2~0.offset_23|) 1) 1 0) 0)) (= (select .cse1 .cse2) .cse3) (= |v_#race_863| (store |v_#race_865| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_865| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse3) .cse4 .cse3) .cse2 .cse3) .cse5 .cse3))) (= .cse3 (select .cse1 .cse4)) (= .cse3 (select .cse1 |v_~#m2~0.offset_23|)) (= (store |v_#memory_int_285| |v_~#m2~0.base_23| (store .cse0 |v_~#m2~0.offset_23| 0)) |v_#memory_int_284|)))) InVars {#race=|v_#race_865|, #memory_int=|v_#memory_int_285|, ~#m2~0.base=|v_~#m2~0.base_23|, ~#m2~0.offset=|v_~#m2~0.offset_23|} OutVars{#race=|v_#race_863|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_284|, ~#m2~0.base=|v_~#m2~0.base_23|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_23|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [809#L781true, 1114#true, 1111#(= |#race~state~0| 0), 1105#true, Black: 1109#true, 490#EBStack_init_returnLabel#1true, 717#L789-2true, 1103#true, 1107#true, 1101#true, 907#L781true]) [2025-02-06 09:00:26,236 INFO L294 olderBase$Statistics]: this new event has 724 ancestors and is cut-off event [2025-02-06 09:00:26,236 INFO L297 olderBase$Statistics]: existing Event has 710 ancestors and is cut-off event [2025-02-06 09:00:26,236 INFO L297 olderBase$Statistics]: existing Event has 710 ancestors and is cut-off event [2025-02-06 09:00:26,237 INFO L297 olderBase$Statistics]: existing Event has 724 ancestors and is cut-off event [2025-02-06 09:00:26,418 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4213] L780-3-->L781: Formula: (let ((.cse1 (select |v_#race_863| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse4 (+ |v_~#m2~0.offset_23| 1)) (.cse3 (select .cse1 .cse5)) (.cse0 (select |v_#memory_int_285| |v_~#m2~0.base_23|))) (and (not (= (ite (= (select .cse0 |v_~#m2~0.offset_23|) 1) 1 0) 0)) (= (select .cse1 .cse2) .cse3) (= |v_#race_863| (store |v_#race_865| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_865| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse3) .cse4 .cse3) .cse2 .cse3) .cse5 .cse3))) (= .cse3 (select .cse1 .cse4)) (= .cse3 (select .cse1 |v_~#m2~0.offset_23|)) (= (store |v_#memory_int_285| |v_~#m2~0.base_23| (store .cse0 |v_~#m2~0.offset_23| 0)) |v_#memory_int_284|)))) InVars {#race=|v_#race_865|, #memory_int=|v_#memory_int_285|, ~#m2~0.base=|v_~#m2~0.base_23|, ~#m2~0.offset=|v_~#m2~0.offset_23|} OutVars{#race=|v_#race_863|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_284|, ~#m2~0.base=|v_~#m2~0.base_23|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_23|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [809#L781true, 1114#true, 1111#(= |#race~state~0| 0), 1105#true, Black: 1109#true, 351#L777true, 717#L789-2true, 1103#true, 1107#true, 1101#true, 907#L781true]) [2025-02-06 09:00:26,419 INFO L294 olderBase$Statistics]: this new event has 725 ancestors and is cut-off event [2025-02-06 09:00:26,419 INFO L297 olderBase$Statistics]: existing Event has 725 ancestors and is cut-off event [2025-02-06 09:00:26,419 INFO L297 olderBase$Statistics]: existing Event has 711 ancestors and is cut-off event [2025-02-06 09:00:26,419 INFO L297 olderBase$Statistics]: existing Event has 711 ancestors and is cut-off event [2025-02-06 09:00:27,429 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4213] L780-3-->L781: Formula: (let ((.cse1 (select |v_#race_863| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse4 (+ |v_~#m2~0.offset_23| 1)) (.cse3 (select .cse1 .cse5)) (.cse0 (select |v_#memory_int_285| |v_~#m2~0.base_23|))) (and (not (= (ite (= (select .cse0 |v_~#m2~0.offset_23|) 1) 1 0) 0)) (= (select .cse1 .cse2) .cse3) (= |v_#race_863| (store |v_#race_865| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_865| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse3) .cse4 .cse3) .cse2 .cse3) .cse5 .cse3))) (= .cse3 (select .cse1 .cse4)) (= .cse3 (select .cse1 |v_~#m2~0.offset_23|)) (= (store |v_#memory_int_285| |v_~#m2~0.base_23| (store .cse0 |v_~#m2~0.offset_23| 0)) |v_#memory_int_284|)))) InVars {#race=|v_#race_865|, #memory_int=|v_#memory_int_285|, ~#m2~0.base=|v_~#m2~0.base_23|, ~#m2~0.offset=|v_~#m2~0.offset_23|} OutVars{#race=|v_#race_863|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_284|, ~#m2~0.base=|v_~#m2~0.base_23|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_23|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [809#L781true, 1111#(= |#race~state~0| 0), 1114#true, 175#L778-2true, 1105#true, Black: 1109#true, 384#L732-3true, 717#L789-2true, 1103#true, 1107#true, 1101#true]) [2025-02-06 09:00:27,429 INFO L294 olderBase$Statistics]: this new event has 730 ancestors and is cut-off event [2025-02-06 09:00:27,429 INFO L297 olderBase$Statistics]: existing Event has 716 ancestors and is cut-off event [2025-02-06 09:00:27,429 INFO L297 olderBase$Statistics]: existing Event has 716 ancestors and is cut-off event [2025-02-06 09:00:27,429 INFO L297 olderBase$Statistics]: existing Event has 716 ancestors and is cut-off event [2025-02-06 09:00:27,624 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4213] L780-3-->L781: Formula: (let ((.cse1 (select |v_#race_863| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse4 (+ |v_~#m2~0.offset_23| 1)) (.cse3 (select .cse1 .cse5)) (.cse0 (select |v_#memory_int_285| |v_~#m2~0.base_23|))) (and (not (= (ite (= (select .cse0 |v_~#m2~0.offset_23|) 1) 1 0) 0)) (= (select .cse1 .cse2) .cse3) (= |v_#race_863| (store |v_#race_865| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_865| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse3) .cse4 .cse3) .cse2 .cse3) .cse5 .cse3))) (= .cse3 (select .cse1 .cse4)) (= .cse3 (select .cse1 |v_~#m2~0.offset_23|)) (= (store |v_#memory_int_285| |v_~#m2~0.base_23| (store .cse0 |v_~#m2~0.offset_23| 0)) |v_#memory_int_284|)))) InVars {#race=|v_#race_865|, #memory_int=|v_#memory_int_285|, ~#m2~0.base=|v_~#m2~0.base_23|, ~#m2~0.offset=|v_~#m2~0.offset_23|} OutVars{#race=|v_#race_863|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_284|, ~#m2~0.base=|v_~#m2~0.base_23|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_23|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [253#L732-2true, 809#L781true, 1111#(= |#race~state~0| 0), 1114#true, 175#L778-2true, 1105#true, Black: 1109#true, 717#L789-2true, 1103#true, 1107#true, 1101#true]) [2025-02-06 09:00:27,625 INFO L294 olderBase$Statistics]: this new event has 731 ancestors and is cut-off event [2025-02-06 09:00:27,625 INFO L297 olderBase$Statistics]: existing Event has 717 ancestors and is cut-off event [2025-02-06 09:00:27,625 INFO L297 olderBase$Statistics]: existing Event has 717 ancestors and is cut-off event [2025-02-06 09:00:27,625 INFO L297 olderBase$Statistics]: existing Event has 717 ancestors and is cut-off event [2025-02-06 09:00:28,015 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4213] L780-3-->L781: Formula: (let ((.cse1 (select |v_#race_863| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse4 (+ |v_~#m2~0.offset_23| 1)) (.cse3 (select .cse1 .cse5)) (.cse0 (select |v_#memory_int_285| |v_~#m2~0.base_23|))) (and (not (= (ite (= (select .cse0 |v_~#m2~0.offset_23|) 1) 1 0) 0)) (= (select .cse1 .cse2) .cse3) (= |v_#race_863| (store |v_#race_865| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_865| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse3) .cse4 .cse3) .cse2 .cse3) .cse5 .cse3))) (= .cse3 (select .cse1 .cse4)) (= .cse3 (select .cse1 |v_~#m2~0.offset_23|)) (= (store |v_#memory_int_285| |v_~#m2~0.base_23| (store .cse0 |v_~#m2~0.offset_23| 0)) |v_#memory_int_284|)))) InVars {#race=|v_#race_865|, #memory_int=|v_#memory_int_285|, ~#m2~0.base=|v_~#m2~0.base_23|, ~#m2~0.offset=|v_~#m2~0.offset_23|} OutVars{#race=|v_#race_863|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_284|, ~#m2~0.base=|v_~#m2~0.base_23|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_23|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [809#L781true, 1114#true, 1111#(= |#race~state~0| 0), 449#L732true, 175#L778-2true, 1105#true, Black: 1109#true, 717#L789-2true, 1103#true, 1107#true, 1101#true]) [2025-02-06 09:00:28,015 INFO L294 olderBase$Statistics]: this new event has 732 ancestors and is cut-off event [2025-02-06 09:00:28,015 INFO L297 olderBase$Statistics]: existing Event has 718 ancestors and is cut-off event [2025-02-06 09:00:28,015 INFO L297 olderBase$Statistics]: existing Event has 718 ancestors and is cut-off event [2025-02-06 09:00:28,015 INFO L297 olderBase$Statistics]: existing Event has 718 ancestors and is cut-off event [2025-02-06 09:00:28,292 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4213] L780-3-->L781: Formula: (let ((.cse1 (select |v_#race_863| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse4 (+ |v_~#m2~0.offset_23| 1)) (.cse3 (select .cse1 .cse5)) (.cse0 (select |v_#memory_int_285| |v_~#m2~0.base_23|))) (and (not (= (ite (= (select .cse0 |v_~#m2~0.offset_23|) 1) 1 0) 0)) (= (select .cse1 .cse2) .cse3) (= |v_#race_863| (store |v_#race_865| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_865| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse3) .cse4 .cse3) .cse2 .cse3) .cse5 .cse3))) (= .cse3 (select .cse1 .cse4)) (= .cse3 (select .cse1 |v_~#m2~0.offset_23|)) (= (store |v_#memory_int_285| |v_~#m2~0.base_23| (store .cse0 |v_~#m2~0.offset_23| 0)) |v_#memory_int_284|)))) InVars {#race=|v_#race_865|, #memory_int=|v_#memory_int_285|, ~#m2~0.base=|v_~#m2~0.base_23|, ~#m2~0.offset=|v_~#m2~0.offset_23|} OutVars{#race=|v_#race_863|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_284|, ~#m2~0.base=|v_~#m2~0.base_23|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_23|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [809#L781true, 1114#true, 1111#(= |#race~state~0| 0), 850#L732-1true, 175#L778-2true, 1105#true, Black: 1109#true, 717#L789-2true, 1103#true, 1107#true, 1101#true]) [2025-02-06 09:00:28,292 INFO L294 olderBase$Statistics]: this new event has 733 ancestors and is cut-off event [2025-02-06 09:00:28,292 INFO L297 olderBase$Statistics]: existing Event has 719 ancestors and is cut-off event [2025-02-06 09:00:28,292 INFO L297 olderBase$Statistics]: existing Event has 719 ancestors and is cut-off event [2025-02-06 09:00:28,293 INFO L297 olderBase$Statistics]: existing Event has 719 ancestors and is cut-off event [2025-02-06 09:00:29,653 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4213] L780-3-->L781: Formula: (let ((.cse1 (select |v_#race_863| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse4 (+ |v_~#m2~0.offset_23| 1)) (.cse3 (select .cse1 .cse5)) (.cse0 (select |v_#memory_int_285| |v_~#m2~0.base_23|))) (and (not (= (ite (= (select .cse0 |v_~#m2~0.offset_23|) 1) 1 0) 0)) (= (select .cse1 .cse2) .cse3) (= |v_#race_863| (store |v_#race_865| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_865| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse3) .cse4 .cse3) .cse2 .cse3) .cse5 .cse3))) (= .cse3 (select .cse1 .cse4)) (= .cse3 (select .cse1 |v_~#m2~0.offset_23|)) (= (store |v_#memory_int_285| |v_~#m2~0.base_23| (store .cse0 |v_~#m2~0.offset_23| 0)) |v_#memory_int_284|)))) InVars {#race=|v_#race_865|, #memory_int=|v_#memory_int_285|, ~#m2~0.base=|v_~#m2~0.base_23|, ~#m2~0.offset=|v_~#m2~0.offset_23|} OutVars{#race=|v_#race_863|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_284|, ~#m2~0.base=|v_~#m2~0.base_23|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_23|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [809#L781true, 1111#(= |#race~state~0| 0), 1114#true, 1105#true, 491#L732-4true, Black: 1109#true, 64#L721-2true, 717#L789-2true, 1103#true, 1107#true, 1101#true]) [2025-02-06 09:00:29,653 INFO L294 olderBase$Statistics]: this new event has 737 ancestors and is cut-off event [2025-02-06 09:00:29,653 INFO L297 olderBase$Statistics]: existing Event has 737 ancestors and is cut-off event [2025-02-06 09:00:29,653 INFO L297 olderBase$Statistics]: existing Event has 723 ancestors and is cut-off event [2025-02-06 09:00:29,653 INFO L297 olderBase$Statistics]: existing Event has 723 ancestors and is cut-off event [2025-02-06 09:00:29,881 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4213] L780-3-->L781: Formula: (let ((.cse1 (select |v_#race_863| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse4 (+ |v_~#m2~0.offset_23| 1)) (.cse3 (select .cse1 .cse5)) (.cse0 (select |v_#memory_int_285| |v_~#m2~0.base_23|))) (and (not (= (ite (= (select .cse0 |v_~#m2~0.offset_23|) 1) 1 0) 0)) (= (select .cse1 .cse2) .cse3) (= |v_#race_863| (store |v_#race_865| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_865| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse3) .cse4 .cse3) .cse2 .cse3) .cse5 .cse3))) (= .cse3 (select .cse1 .cse4)) (= .cse3 (select .cse1 |v_~#m2~0.offset_23|)) (= (store |v_#memory_int_285| |v_~#m2~0.base_23| (store .cse0 |v_~#m2~0.offset_23| 0)) |v_#memory_int_284|)))) InVars {#race=|v_#race_865|, #memory_int=|v_#memory_int_285|, ~#m2~0.base=|v_~#m2~0.base_23|, ~#m2~0.offset=|v_~#m2~0.offset_23|} OutVars{#race=|v_#race_863|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_284|, ~#m2~0.base=|v_~#m2~0.base_23|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_23|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [809#L781true, 1111#(= |#race~state~0| 0), 1114#true, 224#L732-3true, 1105#true, Black: 1109#true, 64#L721-2true, 717#L789-2true, 1103#true, 1107#true, 1101#true]) [2025-02-06 09:00:29,881 INFO L294 olderBase$Statistics]: this new event has 738 ancestors and is cut-off event [2025-02-06 09:00:29,881 INFO L297 olderBase$Statistics]: existing Event has 724 ancestors and is cut-off event [2025-02-06 09:00:29,881 INFO L297 olderBase$Statistics]: existing Event has 724 ancestors and is cut-off event [2025-02-06 09:00:29,881 INFO L297 olderBase$Statistics]: existing Event has 738 ancestors and is cut-off event [2025-02-06 09:00:30,140 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4213] L780-3-->L781: Formula: (let ((.cse1 (select |v_#race_863| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse4 (+ |v_~#m2~0.offset_23| 1)) (.cse3 (select .cse1 .cse5)) (.cse0 (select |v_#memory_int_285| |v_~#m2~0.base_23|))) (and (not (= (ite (= (select .cse0 |v_~#m2~0.offset_23|) 1) 1 0) 0)) (= (select .cse1 .cse2) .cse3) (= |v_#race_863| (store |v_#race_865| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_865| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse3) .cse4 .cse3) .cse2 .cse3) .cse5 .cse3))) (= .cse3 (select .cse1 .cse4)) (= .cse3 (select .cse1 |v_~#m2~0.offset_23|)) (= (store |v_#memory_int_285| |v_~#m2~0.base_23| (store .cse0 |v_~#m2~0.offset_23| 0)) |v_#memory_int_284|)))) InVars {#race=|v_#race_865|, #memory_int=|v_#memory_int_285|, ~#m2~0.base=|v_~#m2~0.base_23|, ~#m2~0.offset=|v_~#m2~0.offset_23|} OutVars{#race=|v_#race_863|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_284|, ~#m2~0.base=|v_~#m2~0.base_23|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_23|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [809#L781true, 1111#(= |#race~state~0| 0), 1114#true, 836#L732-2true, 1105#true, Black: 1109#true, 64#L721-2true, 717#L789-2true, 1103#true, 1107#true, 1101#true]) [2025-02-06 09:00:30,140 INFO L294 olderBase$Statistics]: this new event has 739 ancestors and is cut-off event [2025-02-06 09:00:30,140 INFO L297 olderBase$Statistics]: existing Event has 739 ancestors and is cut-off event [2025-02-06 09:00:30,140 INFO L297 olderBase$Statistics]: existing Event has 725 ancestors and is cut-off event [2025-02-06 09:00:30,140 INFO L297 olderBase$Statistics]: existing Event has 725 ancestors and is cut-off event [2025-02-06 09:00:30,489 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4213] L780-3-->L781: Formula: (let ((.cse1 (select |v_#race_863| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse4 (+ |v_~#m2~0.offset_23| 1)) (.cse3 (select .cse1 .cse5)) (.cse0 (select |v_#memory_int_285| |v_~#m2~0.base_23|))) (and (not (= (ite (= (select .cse0 |v_~#m2~0.offset_23|) 1) 1 0) 0)) (= (select .cse1 .cse2) .cse3) (= |v_#race_863| (store |v_#race_865| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_865| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse3) .cse4 .cse3) .cse2 .cse3) .cse5 .cse3))) (= .cse3 (select .cse1 .cse4)) (= .cse3 (select .cse1 |v_~#m2~0.offset_23|)) (= (store |v_#memory_int_285| |v_~#m2~0.base_23| (store .cse0 |v_~#m2~0.offset_23| 0)) |v_#memory_int_284|)))) InVars {#race=|v_#race_865|, #memory_int=|v_#memory_int_285|, ~#m2~0.base=|v_~#m2~0.base_23|, ~#m2~0.offset=|v_~#m2~0.offset_23|} OutVars{#race=|v_#race_863|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_284|, ~#m2~0.base=|v_~#m2~0.base_23|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_23|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [809#L781true, 1111#(= |#race~state~0| 0), 1114#true, 1105#true, Black: 1109#true, 64#L721-2true, 717#L789-2true, 1103#true, 1107#true, 1101#true, 661#L732true]) [2025-02-06 09:00:30,489 INFO L294 olderBase$Statistics]: this new event has 740 ancestors and is cut-off event [2025-02-06 09:00:30,489 INFO L297 olderBase$Statistics]: existing Event has 740 ancestors and is cut-off event [2025-02-06 09:00:30,489 INFO L297 olderBase$Statistics]: existing Event has 726 ancestors and is cut-off event [2025-02-06 09:00:30,489 INFO L297 olderBase$Statistics]: existing Event has 726 ancestors and is cut-off event [2025-02-06 09:00:30,995 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4213] L780-3-->L781: Formula: (let ((.cse1 (select |v_#race_863| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse4 (+ |v_~#m2~0.offset_23| 1)) (.cse3 (select .cse1 .cse5)) (.cse0 (select |v_#memory_int_285| |v_~#m2~0.base_23|))) (and (not (= (ite (= (select .cse0 |v_~#m2~0.offset_23|) 1) 1 0) 0)) (= (select .cse1 .cse2) .cse3) (= |v_#race_863| (store |v_#race_865| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_865| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse3) .cse4 .cse3) .cse2 .cse3) .cse5 .cse3))) (= .cse3 (select .cse1 .cse4)) (= .cse3 (select .cse1 |v_~#m2~0.offset_23|)) (= (store |v_#memory_int_285| |v_~#m2~0.base_23| (store .cse0 |v_~#m2~0.offset_23| 0)) |v_#memory_int_284|)))) InVars {#race=|v_#race_865|, #memory_int=|v_#memory_int_285|, ~#m2~0.base=|v_~#m2~0.base_23|, ~#m2~0.offset=|v_~#m2~0.offset_23|} OutVars{#race=|v_#race_863|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_284|, ~#m2~0.base=|v_~#m2~0.base_23|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_23|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][839], [781#L732-1true, 809#L781true, 1111#(= |#race~state~0| 0), 1114#true, 1105#true, Black: 1109#true, 64#L721-2true, 717#L789-2true, 1103#true, 1107#true, 1101#true]) [2025-02-06 09:00:30,996 INFO L294 olderBase$Statistics]: this new event has 741 ancestors and is cut-off event [2025-02-06 09:00:30,996 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-02-06 09:00:30,996 INFO L297 olderBase$Statistics]: existing Event has 741 ancestors and is cut-off event [2025-02-06 09:00:30,996 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-02-06 09:00:30,996 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4213] L780-3-->L781: Formula: (let ((.cse1 (select |v_#race_863| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse4 (+ |v_~#m2~0.offset_23| 1)) (.cse3 (select .cse1 .cse5)) (.cse0 (select |v_#memory_int_285| |v_~#m2~0.base_23|))) (and (not (= (ite (= (select .cse0 |v_~#m2~0.offset_23|) 1) 1 0) 0)) (= (select .cse1 .cse2) .cse3) (= |v_#race_863| (store |v_#race_865| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_865| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse3) .cse4 .cse3) .cse2 .cse3) .cse5 .cse3))) (= .cse3 (select .cse1 .cse4)) (= .cse3 (select .cse1 |v_~#m2~0.offset_23|)) (= (store |v_#memory_int_285| |v_~#m2~0.base_23| (store .cse0 |v_~#m2~0.offset_23| 0)) |v_#memory_int_284|)))) InVars {#race=|v_#race_865|, #memory_int=|v_#memory_int_285|, ~#m2~0.base=|v_~#m2~0.base_23|, ~#m2~0.offset=|v_~#m2~0.offset_23|} OutVars{#race=|v_#race_863|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_284|, ~#m2~0.base=|v_~#m2~0.base_23|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_23|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [781#L732-1true, 809#L781true, 1111#(= |#race~state~0| 0), 1114#true, 1105#true, Black: 1109#true, 64#L721-2true, 717#L789-2true, 1103#true, 1107#true, 1101#true]) [2025-02-06 09:00:30,996 INFO L294 olderBase$Statistics]: this new event has 741 ancestors and is cut-off event [2025-02-06 09:00:30,996 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-02-06 09:00:30,996 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-02-06 09:00:30,996 INFO L297 olderBase$Statistics]: existing Event has 741 ancestors and is cut-off event [2025-02-06 09:00:30,997 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4213] L780-3-->L781: Formula: (let ((.cse1 (select |v_#race_863| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse4 (+ |v_~#m2~0.offset_23| 1)) (.cse3 (select .cse1 .cse5)) (.cse0 (select |v_#memory_int_285| |v_~#m2~0.base_23|))) (and (not (= (ite (= (select .cse0 |v_~#m2~0.offset_23|) 1) 1 0) 0)) (= (select .cse1 .cse2) .cse3) (= |v_#race_863| (store |v_#race_865| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_865| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse3) .cse4 .cse3) .cse2 .cse3) .cse5 .cse3))) (= .cse3 (select .cse1 .cse4)) (= .cse3 (select .cse1 |v_~#m2~0.offset_23|)) (= (store |v_#memory_int_285| |v_~#m2~0.base_23| (store .cse0 |v_~#m2~0.offset_23| 0)) |v_#memory_int_284|)))) InVars {#race=|v_#race_865|, #memory_int=|v_#memory_int_285|, ~#m2~0.base=|v_~#m2~0.base_23|, ~#m2~0.offset=|v_~#m2~0.offset_23|} OutVars{#race=|v_#race_863|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_284|, ~#m2~0.base=|v_~#m2~0.base_23|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_23|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [848#thr1Err22ASSERT_VIOLATIONDATA_RACEtrue, 809#L781true, 1111#(= |#race~state~0| 0), 1114#true, 1105#true, Black: 1109#true, 64#L721-2true, 717#L789-2true, 1103#true, 1107#true, 1101#true]) [2025-02-06 09:00:30,997 INFO L294 olderBase$Statistics]: this new event has 741 ancestors and is cut-off event [2025-02-06 09:00:30,997 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-02-06 09:00:30,997 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-02-06 09:00:30,997 INFO L297 olderBase$Statistics]: existing Event has 741 ancestors and is cut-off event [2025-02-06 09:00:31,000 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4213] L780-3-->L781: Formula: (let ((.cse1 (select |v_#race_863| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse4 (+ |v_~#m2~0.offset_23| 1)) (.cse3 (select .cse1 .cse5)) (.cse0 (select |v_#memory_int_285| |v_~#m2~0.base_23|))) (and (not (= (ite (= (select .cse0 |v_~#m2~0.offset_23|) 1) 1 0) 0)) (= (select .cse1 .cse2) .cse3) (= |v_#race_863| (store |v_#race_865| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_865| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse3) .cse4 .cse3) .cse2 .cse3) .cse5 .cse3))) (= .cse3 (select .cse1 .cse4)) (= .cse3 (select .cse1 |v_~#m2~0.offset_23|)) (= (store |v_#memory_int_285| |v_~#m2~0.base_23| (store .cse0 |v_~#m2~0.offset_23| 0)) |v_#memory_int_284|)))) InVars {#race=|v_#race_865|, #memory_int=|v_#memory_int_285|, ~#m2~0.base=|v_~#m2~0.base_23|, ~#m2~0.offset=|v_~#m2~0.offset_23|} OutVars{#race=|v_#race_863|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_284|, ~#m2~0.base=|v_~#m2~0.base_23|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_23|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [809#L781true, 1111#(= |#race~state~0| 0), 1114#true, 1105#true, 698#L723true, Black: 1109#true, 491#L732-4true, 717#L789-2true, 1103#true, 1107#true, 1101#true]) [2025-02-06 09:00:31,000 INFO L294 olderBase$Statistics]: this new event has 741 ancestors and is cut-off event [2025-02-06 09:00:31,000 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-02-06 09:00:31,000 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-02-06 09:00:31,000 INFO L297 olderBase$Statistics]: existing Event has 741 ancestors and is cut-off event [2025-02-06 09:00:31,272 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4213] L780-3-->L781: Formula: (let ((.cse1 (select |v_#race_863| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse4 (+ |v_~#m2~0.offset_23| 1)) (.cse3 (select .cse1 .cse5)) (.cse0 (select |v_#memory_int_285| |v_~#m2~0.base_23|))) (and (not (= (ite (= (select .cse0 |v_~#m2~0.offset_23|) 1) 1 0) 0)) (= (select .cse1 .cse2) .cse3) (= |v_#race_863| (store |v_#race_865| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_865| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse3) .cse4 .cse3) .cse2 .cse3) .cse5 .cse3))) (= .cse3 (select .cse1 .cse4)) (= .cse3 (select .cse1 |v_~#m2~0.offset_23|)) (= (store |v_#memory_int_285| |v_~#m2~0.base_23| (store .cse0 |v_~#m2~0.offset_23| 0)) |v_#memory_int_284|)))) InVars {#race=|v_#race_865|, #memory_int=|v_#memory_int_285|, ~#m2~0.base=|v_~#m2~0.base_23|, ~#m2~0.offset=|v_~#m2~0.offset_23|} OutVars{#race=|v_#race_863|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_284|, ~#m2~0.base=|v_~#m2~0.base_23|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_23|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [809#L781true, 1111#(= |#race~state~0| 0), 1114#true, 1105#true, Black: 1109#true, 490#EBStack_init_returnLabel#1true, 64#L721-2true, 717#L789-2true, 1103#true, 1107#true, 1101#true]) [2025-02-06 09:00:31,272 INFO L294 olderBase$Statistics]: this new event has 742 ancestors and is cut-off event [2025-02-06 09:00:31,272 INFO L297 olderBase$Statistics]: existing Event has 728 ancestors and is cut-off event [2025-02-06 09:00:31,272 INFO L297 olderBase$Statistics]: existing Event has 728 ancestors and is cut-off event [2025-02-06 09:00:31,272 INFO L297 olderBase$Statistics]: existing Event has 742 ancestors and is cut-off event [2025-02-06 09:00:31,275 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4213] L780-3-->L781: Formula: (let ((.cse1 (select |v_#race_863| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse4 (+ |v_~#m2~0.offset_23| 1)) (.cse3 (select .cse1 .cse5)) (.cse0 (select |v_#memory_int_285| |v_~#m2~0.base_23|))) (and (not (= (ite (= (select .cse0 |v_~#m2~0.offset_23|) 1) 1 0) 0)) (= (select .cse1 .cse2) .cse3) (= |v_#race_863| (store |v_#race_865| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_865| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse3) .cse4 .cse3) .cse2 .cse3) .cse5 .cse3))) (= .cse3 (select .cse1 .cse4)) (= .cse3 (select .cse1 |v_~#m2~0.offset_23|)) (= (store |v_#memory_int_285| |v_~#m2~0.base_23| (store .cse0 |v_~#m2~0.offset_23| 0)) |v_#memory_int_284|)))) InVars {#race=|v_#race_865|, #memory_int=|v_#memory_int_285|, ~#m2~0.base=|v_~#m2~0.base_23|, ~#m2~0.offset=|v_~#m2~0.offset_23|} OutVars{#race=|v_#race_863|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_284|, ~#m2~0.base=|v_~#m2~0.base_23|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_23|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [809#L781true, 1111#(= |#race~state~0| 0), 1114#true, 224#L732-3true, 1105#true, 698#L723true, Black: 1109#true, 717#L789-2true, 1103#true, 1107#true, 1101#true]) [2025-02-06 09:00:31,275 INFO L294 olderBase$Statistics]: this new event has 742 ancestors and is cut-off event [2025-02-06 09:00:31,275 INFO L297 olderBase$Statistics]: existing Event has 728 ancestors and is cut-off event [2025-02-06 09:00:31,275 INFO L297 olderBase$Statistics]: existing Event has 728 ancestors and is cut-off event [2025-02-06 09:00:31,275 INFO L297 olderBase$Statistics]: existing Event has 742 ancestors and is cut-off event [2025-02-06 09:00:31,626 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4213] L780-3-->L781: Formula: (let ((.cse1 (select |v_#race_863| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse4 (+ |v_~#m2~0.offset_23| 1)) (.cse3 (select .cse1 .cse5)) (.cse0 (select |v_#memory_int_285| |v_~#m2~0.base_23|))) (and (not (= (ite (= (select .cse0 |v_~#m2~0.offset_23|) 1) 1 0) 0)) (= (select .cse1 .cse2) .cse3) (= |v_#race_863| (store |v_#race_865| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_865| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse3) .cse4 .cse3) .cse2 .cse3) .cse5 .cse3))) (= .cse3 (select .cse1 .cse4)) (= .cse3 (select .cse1 |v_~#m2~0.offset_23|)) (= (store |v_#memory_int_285| |v_~#m2~0.base_23| (store .cse0 |v_~#m2~0.offset_23| 0)) |v_#memory_int_284|)))) InVars {#race=|v_#race_865|, #memory_int=|v_#memory_int_285|, ~#m2~0.base=|v_~#m2~0.base_23|, ~#m2~0.offset=|v_~#m2~0.offset_23|} OutVars{#race=|v_#race_863|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_284|, ~#m2~0.base=|v_~#m2~0.base_23|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_23|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [809#L781true, 1114#true, 1111#(= |#race~state~0| 0), 1105#true, Black: 1109#true, 351#L777true, 64#L721-2true, 717#L789-2true, 1103#true, 1107#true, 1101#true]) [2025-02-06 09:00:31,626 INFO L294 olderBase$Statistics]: this new event has 743 ancestors and is cut-off event [2025-02-06 09:00:31,626 INFO L297 olderBase$Statistics]: existing Event has 729 ancestors and is cut-off event [2025-02-06 09:00:31,626 INFO L297 olderBase$Statistics]: existing Event has 743 ancestors and is cut-off event [2025-02-06 09:00:31,626 INFO L297 olderBase$Statistics]: existing Event has 729 ancestors and is cut-off event [2025-02-06 09:00:31,628 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4213] L780-3-->L781: Formula: (let ((.cse1 (select |v_#race_863| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse4 (+ |v_~#m2~0.offset_23| 1)) (.cse3 (select .cse1 .cse5)) (.cse0 (select |v_#memory_int_285| |v_~#m2~0.base_23|))) (and (not (= (ite (= (select .cse0 |v_~#m2~0.offset_23|) 1) 1 0) 0)) (= (select .cse1 .cse2) .cse3) (= |v_#race_863| (store |v_#race_865| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_865| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse3) .cse4 .cse3) .cse2 .cse3) .cse5 .cse3))) (= .cse3 (select .cse1 .cse4)) (= .cse3 (select .cse1 |v_~#m2~0.offset_23|)) (= (store |v_#memory_int_285| |v_~#m2~0.base_23| (store .cse0 |v_~#m2~0.offset_23| 0)) |v_#memory_int_284|)))) InVars {#race=|v_#race_865|, #memory_int=|v_#memory_int_285|, ~#m2~0.base=|v_~#m2~0.base_23|, ~#m2~0.offset=|v_~#m2~0.offset_23|} OutVars{#race=|v_#race_863|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_284|, ~#m2~0.base=|v_~#m2~0.base_23|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_23|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [809#L781true, 1111#(= |#race~state~0| 0), 1114#true, 1105#true, 836#L732-2true, 698#L723true, Black: 1109#true, 717#L789-2true, 1103#true, 1107#true, 1101#true]) [2025-02-06 09:00:31,628 INFO L294 olderBase$Statistics]: this new event has 743 ancestors and is cut-off event [2025-02-06 09:00:31,628 INFO L297 olderBase$Statistics]: existing Event has 729 ancestors and is cut-off event [2025-02-06 09:00:31,628 INFO L297 olderBase$Statistics]: existing Event has 729 ancestors and is cut-off event [2025-02-06 09:00:31,628 INFO L297 olderBase$Statistics]: existing Event has 743 ancestors and is cut-off event [2025-02-06 09:00:32,091 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4213] L780-3-->L781: Formula: (let ((.cse1 (select |v_#race_863| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse4 (+ |v_~#m2~0.offset_23| 1)) (.cse3 (select .cse1 .cse5)) (.cse0 (select |v_#memory_int_285| |v_~#m2~0.base_23|))) (and (not (= (ite (= (select .cse0 |v_~#m2~0.offset_23|) 1) 1 0) 0)) (= (select .cse1 .cse2) .cse3) (= |v_#race_863| (store |v_#race_865| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_865| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse3) .cse4 .cse3) .cse2 .cse3) .cse5 .cse3))) (= .cse3 (select .cse1 .cse4)) (= .cse3 (select .cse1 |v_~#m2~0.offset_23|)) (= (store |v_#memory_int_285| |v_~#m2~0.base_23| (store .cse0 |v_~#m2~0.offset_23| 0)) |v_#memory_int_284|)))) InVars {#race=|v_#race_865|, #memory_int=|v_#memory_int_285|, ~#m2~0.base=|v_~#m2~0.base_23|, ~#m2~0.offset=|v_~#m2~0.offset_23|} OutVars{#race=|v_#race_863|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_284|, ~#m2~0.base=|v_~#m2~0.base_23|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_23|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [809#L781true, 1111#(= |#race~state~0| 0), 1114#true, 1105#true, 698#L723true, Black: 1109#true, 717#L789-2true, 1103#true, 1107#true, 1101#true, 661#L732true]) [2025-02-06 09:00:32,092 INFO L294 olderBase$Statistics]: this new event has 744 ancestors and is cut-off event [2025-02-06 09:00:32,092 INFO L297 olderBase$Statistics]: existing Event has 744 ancestors and is cut-off event [2025-02-06 09:00:32,092 INFO L297 olderBase$Statistics]: existing Event has 730 ancestors and is cut-off event [2025-02-06 09:00:32,092 INFO L297 olderBase$Statistics]: existing Event has 730 ancestors and is cut-off event [2025-02-06 09:00:32,449 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4213] L780-3-->L781: Formula: (let ((.cse1 (select |v_#race_863| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse4 (+ |v_~#m2~0.offset_23| 1)) (.cse3 (select .cse1 .cse5)) (.cse0 (select |v_#memory_int_285| |v_~#m2~0.base_23|))) (and (not (= (ite (= (select .cse0 |v_~#m2~0.offset_23|) 1) 1 0) 0)) (= (select .cse1 .cse2) .cse3) (= |v_#race_863| (store |v_#race_865| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_865| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse3) .cse4 .cse3) .cse2 .cse3) .cse5 .cse3))) (= .cse3 (select .cse1 .cse4)) (= .cse3 (select .cse1 |v_~#m2~0.offset_23|)) (= (store |v_#memory_int_285| |v_~#m2~0.base_23| (store .cse0 |v_~#m2~0.offset_23| 0)) |v_#memory_int_284|)))) InVars {#race=|v_#race_865|, #memory_int=|v_#memory_int_285|, ~#m2~0.base=|v_~#m2~0.base_23|, ~#m2~0.offset=|v_~#m2~0.offset_23|} OutVars{#race=|v_#race_863|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_284|, ~#m2~0.base=|v_~#m2~0.base_23|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_23|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][839], [781#L732-1true, 809#L781true, 1111#(= |#race~state~0| 0), 1114#true, 1105#true, 698#L723true, Black: 1109#true, 717#L789-2true, 1103#true, 1107#true, 1101#true]) [2025-02-06 09:00:32,450 INFO L294 olderBase$Statistics]: this new event has 745 ancestors and is cut-off event [2025-02-06 09:00:32,450 INFO L297 olderBase$Statistics]: existing Event has 731 ancestors and is cut-off event [2025-02-06 09:00:32,450 INFO L297 olderBase$Statistics]: existing Event has 731 ancestors and is cut-off event [2025-02-06 09:00:32,450 INFO L297 olderBase$Statistics]: existing Event has 745 ancestors and is cut-off event [2025-02-06 09:00:32,450 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4213] L780-3-->L781: Formula: (let ((.cse1 (select |v_#race_863| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse4 (+ |v_~#m2~0.offset_23| 1)) (.cse3 (select .cse1 .cse5)) (.cse0 (select |v_#memory_int_285| |v_~#m2~0.base_23|))) (and (not (= (ite (= (select .cse0 |v_~#m2~0.offset_23|) 1) 1 0) 0)) (= (select .cse1 .cse2) .cse3) (= |v_#race_863| (store |v_#race_865| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_865| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse3) .cse4 .cse3) .cse2 .cse3) .cse5 .cse3))) (= .cse3 (select .cse1 .cse4)) (= .cse3 (select .cse1 |v_~#m2~0.offset_23|)) (= (store |v_#memory_int_285| |v_~#m2~0.base_23| (store .cse0 |v_~#m2~0.offset_23| 0)) |v_#memory_int_284|)))) InVars {#race=|v_#race_865|, #memory_int=|v_#memory_int_285|, ~#m2~0.base=|v_~#m2~0.base_23|, ~#m2~0.offset=|v_~#m2~0.offset_23|} OutVars{#race=|v_#race_863|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_284|, ~#m2~0.base=|v_~#m2~0.base_23|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_23|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [781#L732-1true, 809#L781true, 1111#(= |#race~state~0| 0), 1114#true, 1105#true, Black: 1109#true, 698#L723true, 717#L789-2true, 1103#true, 1107#true, 1101#true]) [2025-02-06 09:00:32,450 INFO L294 olderBase$Statistics]: this new event has 745 ancestors and is cut-off event [2025-02-06 09:00:32,450 INFO L297 olderBase$Statistics]: existing Event has 731 ancestors and is cut-off event [2025-02-06 09:00:32,450 INFO L297 olderBase$Statistics]: existing Event has 745 ancestors and is cut-off event [2025-02-06 09:00:32,450 INFO L297 olderBase$Statistics]: existing Event has 731 ancestors and is cut-off event [2025-02-06 09:00:32,451 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4213] L780-3-->L781: Formula: (let ((.cse1 (select |v_#race_863| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse4 (+ |v_~#m2~0.offset_23| 1)) (.cse3 (select .cse1 .cse5)) (.cse0 (select |v_#memory_int_285| |v_~#m2~0.base_23|))) (and (not (= (ite (= (select .cse0 |v_~#m2~0.offset_23|) 1) 1 0) 0)) (= (select .cse1 .cse2) .cse3) (= |v_#race_863| (store |v_#race_865| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_865| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse3) .cse4 .cse3) .cse2 .cse3) .cse5 .cse3))) (= .cse3 (select .cse1 .cse4)) (= .cse3 (select .cse1 |v_~#m2~0.offset_23|)) (= (store |v_#memory_int_285| |v_~#m2~0.base_23| (store .cse0 |v_~#m2~0.offset_23| 0)) |v_#memory_int_284|)))) InVars {#race=|v_#race_865|, #memory_int=|v_#memory_int_285|, ~#m2~0.base=|v_~#m2~0.base_23|, ~#m2~0.offset=|v_~#m2~0.offset_23|} OutVars{#race=|v_#race_863|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_284|, ~#m2~0.base=|v_~#m2~0.base_23|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_23|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [848#thr1Err22ASSERT_VIOLATIONDATA_RACEtrue, 809#L781true, 1111#(= |#race~state~0| 0), 1114#true, 1105#true, 698#L723true, Black: 1109#true, 717#L789-2true, 1103#true, 1107#true, 1101#true]) [2025-02-06 09:00:32,451 INFO L294 olderBase$Statistics]: this new event has 745 ancestors and is cut-off event [2025-02-06 09:00:32,451 INFO L297 olderBase$Statistics]: existing Event has 731 ancestors and is cut-off event [2025-02-06 09:00:32,451 INFO L297 olderBase$Statistics]: existing Event has 731 ancestors and is cut-off event [2025-02-06 09:00:32,451 INFO L297 olderBase$Statistics]: existing Event has 745 ancestors and is cut-off event [2025-02-06 09:00:32,800 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4213] L780-3-->L781: Formula: (let ((.cse1 (select |v_#race_863| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse4 (+ |v_~#m2~0.offset_23| 1)) (.cse3 (select .cse1 .cse5)) (.cse0 (select |v_#memory_int_285| |v_~#m2~0.base_23|))) (and (not (= (ite (= (select .cse0 |v_~#m2~0.offset_23|) 1) 1 0) 0)) (= (select .cse1 .cse2) .cse3) (= |v_#race_863| (store |v_#race_865| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_865| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse3) .cse4 .cse3) .cse2 .cse3) .cse5 .cse3))) (= .cse3 (select .cse1 .cse4)) (= .cse3 (select .cse1 |v_~#m2~0.offset_23|)) (= (store |v_#memory_int_285| |v_~#m2~0.base_23| (store .cse0 |v_~#m2~0.offset_23| 0)) |v_#memory_int_284|)))) InVars {#race=|v_#race_865|, #memory_int=|v_#memory_int_285|, ~#m2~0.base=|v_~#m2~0.base_23|, ~#m2~0.offset=|v_~#m2~0.offset_23|} OutVars{#race=|v_#race_863|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_284|, ~#m2~0.base=|v_~#m2~0.base_23|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_23|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [809#L781true, 1114#true, 1111#(= |#race~state~0| 0), 1105#true, Black: 1109#true, 490#EBStack_init_returnLabel#1true, 698#L723true, 717#L789-2true, 1103#true, 1107#true, 1101#true]) [2025-02-06 09:00:32,801 INFO L294 olderBase$Statistics]: this new event has 746 ancestors and is cut-off event [2025-02-06 09:00:32,801 INFO L297 olderBase$Statistics]: existing Event has 732 ancestors and is cut-off event [2025-02-06 09:00:32,801 INFO L297 olderBase$Statistics]: existing Event has 746 ancestors and is cut-off event [2025-02-06 09:00:32,801 INFO L297 olderBase$Statistics]: existing Event has 732 ancestors and is cut-off event [2025-02-06 09:00:33,401 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4213] L780-3-->L781: Formula: (let ((.cse1 (select |v_#race_863| |v_~#m2~0.base_23|)) (.cse5 (+ |v_~#m2~0.offset_23| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_23| 2)) (.cse4 (+ |v_~#m2~0.offset_23| 1)) (.cse3 (select .cse1 .cse5)) (.cse0 (select |v_#memory_int_285| |v_~#m2~0.base_23|))) (and (not (= (ite (= (select .cse0 |v_~#m2~0.offset_23|) 1) 1 0) 0)) (= (select .cse1 .cse2) .cse3) (= |v_#race_863| (store |v_#race_865| |v_~#m2~0.base_23| (store (store (store (store (select |v_#race_865| |v_~#m2~0.base_23|) |v_~#m2~0.offset_23| .cse3) .cse4 .cse3) .cse2 .cse3) .cse5 .cse3))) (= .cse3 (select .cse1 .cse4)) (= .cse3 (select .cse1 |v_~#m2~0.offset_23|)) (= (store |v_#memory_int_285| |v_~#m2~0.base_23| (store .cse0 |v_~#m2~0.offset_23| 0)) |v_#memory_int_284|)))) InVars {#race=|v_#race_865|, #memory_int=|v_#memory_int_285|, ~#m2~0.base=|v_~#m2~0.base_23|, ~#m2~0.offset=|v_~#m2~0.offset_23|} OutVars{#race=|v_#race_863|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_284|, ~#m2~0.base=|v_~#m2~0.base_23|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_23|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [809#L781true, 1114#true, 1111#(= |#race~state~0| 0), 1105#true, 698#L723true, Black: 1109#true, 351#L777true, 717#L789-2true, 1103#true, 1107#true, 1101#true]) [2025-02-06 09:00:33,401 INFO L294 olderBase$Statistics]: this new event has 747 ancestors and is cut-off event [2025-02-06 09:00:33,401 INFO L297 olderBase$Statistics]: existing Event has 733 ancestors and is cut-off event [2025-02-06 09:00:33,401 INFO L297 olderBase$Statistics]: existing Event has 733 ancestors and is cut-off event [2025-02-06 09:00:33,401 INFO L297 olderBase$Statistics]: existing Event has 747 ancestors and is cut-off event