./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-ext/26_stack_cas_longer-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/26_stack_cas_longer-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f6a420ba5144c69cefe02db203552770c4018653c510d9792e57ffedc3dfc64e --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:18:54,673 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:18:54,730 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-14 01:18:54,734 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:18:54,734 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:18:54,751 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:18:54,752 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:18:54,752 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:18:54,752 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:18:54,752 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:18:54,753 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:18:54,753 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:18:54,753 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:18:54,753 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:18:54,753 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:18:54,753 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:18:54,753 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:18:54,753 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:18:54,753 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:18:54,753 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:18:54,753 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:18:54,754 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:18:54,754 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:18:54,754 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:18:54,754 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:18:54,754 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:18:54,754 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:18:54,754 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:18:54,754 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:18:54,754 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:18:54,754 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:18:54,754 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:18:54,754 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:18:54,754 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:18:54,755 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:18:54,755 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:18:54,755 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:18:54,755 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:18:54,755 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:18:54,755 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:18:54,755 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:18:54,755 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:18:54,755 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f6a420ba5144c69cefe02db203552770c4018653c510d9792e57ffedc3dfc64e [2025-03-14 01:18:54,960 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:18:54,970 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:18:54,972 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:18:54,974 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:18:54,974 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:18:54,975 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/26_stack_cas_longer-2.i [2025-03-14 01:18:56,185 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2fff3cd0/f6275a348d3c4f638b4ba6236836d5d2/FLAG0fcab6604 [2025-03-14 01:18:56,433 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:18:56,434 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/26_stack_cas_longer-2.i [2025-03-14 01:18:56,445 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2fff3cd0/f6275a348d3c4f638b4ba6236836d5d2/FLAG0fcab6604 [2025-03-14 01:18:56,459 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2fff3cd0/f6275a348d3c4f638b4ba6236836d5d2 [2025-03-14 01:18:56,460 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:18:56,462 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:18:56,462 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:18:56,462 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:18:56,465 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:18:56,466 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:18:56" (1/1) ... [2025-03-14 01:18:56,466 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60cd8bab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:18:56, skipping insertion in model container [2025-03-14 01:18:56,466 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:18:56" (1/1) ... [2025-03-14 01:18:56,486 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:18:56,699 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:18:56,732 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:18:56,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:18:56,823 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:18:56,823 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:18:56 WrapperNode [2025-03-14 01:18:56,823 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:18:56,824 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:18:56,824 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:18:56,824 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:18:56,828 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:18:56" (1/1) ... [2025-03-14 01:18:56,845 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:18:56" (1/1) ... [2025-03-14 01:18:56,882 INFO L138 Inliner]: procedures = 179, calls = 47, calls flagged for inlining = 17, calls inlined = 20, statements flattened = 954 [2025-03-14 01:18:56,882 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:18:56,883 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:18:56,883 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:18:56,883 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:18:56,888 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:18:56" (1/1) ... [2025-03-14 01:18:56,888 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:18:56" (1/1) ... [2025-03-14 01:18:56,893 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:18:56" (1/1) ... [2025-03-14 01:18:56,893 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:18:56" (1/1) ... [2025-03-14 01:18:56,921 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:18:56" (1/1) ... [2025-03-14 01:18:56,928 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:18:56" (1/1) ... [2025-03-14 01:18:56,934 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:18:56" (1/1) ... [2025-03-14 01:18:56,938 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:18:56" (1/1) ... [2025-03-14 01:18:56,943 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:18:56,944 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:18:56,944 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:18:56,944 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:18:56,945 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:18:56" (1/1) ... [2025-03-14 01:18:56,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:18:56,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:18:56,972 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-14 01:18:56,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-14 01:18:56,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-14 01:18:56,992 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-14 01:18:56,993 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-14 01:18:56,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 01:18:56,993 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-14 01:18:56,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:18:56,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-14 01:18:56,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-14 01:18:56,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:18:56,993 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-14 01:18:56,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:18:56,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:18:56,995 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:18:57,103 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:18:57,104 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:18:57,926 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:18:57,927 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:18:57,927 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:18:58,195 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:18:58,196 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:18:58 BoogieIcfgContainer [2025-03-14 01:18:58,196 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:18:58,197 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:18:58,197 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:18:58,200 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:18:58,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:18:56" (1/3) ... [2025-03-14 01:18:58,201 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@287ed771 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:18:58, skipping insertion in model container [2025-03-14 01:18:58,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:18:56" (2/3) ... [2025-03-14 01:18:58,201 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@287ed771 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:18:58, skipping insertion in model container [2025-03-14 01:18:58,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:18:58" (3/3) ... [2025-03-14 01:18:58,202 INFO L128 eAbstractionObserver]: Analyzing ICFG 26_stack_cas_longer-2.i [2025-03-14 01:18:58,213 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:18:58,214 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 26_stack_cas_longer-2.i that has 2 procedures, 805 locations, 1 initial locations, 3 loop locations, and 26 error locations. [2025-03-14 01:18:58,215 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:18:58,313 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 01:18:58,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 808 places, 812 transitions, 1628 flow [2025-03-14 01:18:58,600 INFO L124 PetriNetUnfolderBase]: 7/819 cut-off events. [2025-03-14 01:18:58,602 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:18:58,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 823 conditions, 819 events. 7/819 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 259 event pairs, 0 based on Foata normal form. 0/784 useless extension candidates. Maximal degree in co-relation 149. Up to 3 conditions per place. [2025-03-14 01:18:58,609 INFO L82 GeneralOperation]: Start removeDead. Operand has 808 places, 812 transitions, 1628 flow [2025-03-14 01:18:58,620 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 808 places, 812 transitions, 1628 flow [2025-03-14 01:18:58,630 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:18:58,642 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;@67338de8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:18:58,643 INFO L334 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2025-03-14 01:18:58,738 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:18:58,739 INFO L124 PetriNetUnfolderBase]: 0/672 cut-off events. [2025-03-14 01:18:58,739 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:18:58,739 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:18:58,740 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-03-14 01:18:58,740 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-03-14 01:18:58,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:18:58,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1224804625, now seen corresponding path program 1 times [2025-03-14 01:18:58,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:18:58,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51917939] [2025-03-14 01:18:58,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:18:58,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:18:58,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 667 statements into 1 equivalence classes. [2025-03-14 01:18:59,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 667 of 667 statements. [2025-03-14 01:18:59,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:18:59,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:19:01,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:19:01,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:19:01,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51917939] [2025-03-14 01:19:01,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51917939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:19:01,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:19:01,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-14 01:19:01,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834323538] [2025-03-14 01:19:01,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:19:01,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-14 01:19:01,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:19:01,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-14 01:19:01,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-14 01:19:01,213 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 784 out of 812 [2025-03-14 01:19:01,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 808 places, 812 transitions, 1628 flow. Second operand has 2 states, 2 states have (on average 785.0) internal successors, (1570), 2 states have internal predecessors, (1570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:19:01,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:19:01,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 784 of 812 [2025-03-14 01:19:01,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:19:01,457 INFO L124 PetriNetUnfolderBase]: 5/790 cut-off events. [2025-03-14 01:19:01,457 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:19:01,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 804 conditions, 790 events. 5/790 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 154 event pairs, 0 based on Foata normal form. 9/784 useless extension candidates. Maximal degree in co-relation 132. Up to 10 conditions per place. [2025-03-14 01:19:01,461 INFO L140 encePairwiseOnDemand]: 793/812 looper letters, 9 selfloop transitions, 0 changer transitions 0/787 dead transitions. [2025-03-14 01:19:01,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 786 places, 787 transitions, 1596 flow [2025-03-14 01:19:01,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-14 01:19:01,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-14 01:19:01,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1596 transitions. [2025-03-14 01:19:01,479 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9827586206896551 [2025-03-14 01:19:01,483 INFO L175 Difference]: Start difference. First operand has 808 places, 812 transitions, 1628 flow. Second operand 2 states and 1596 transitions. [2025-03-14 01:19:01,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 786 places, 787 transitions, 1596 flow [2025-03-14 01:19:01,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 786 places, 787 transitions, 1596 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:19:01,505 INFO L231 Difference]: Finished difference. Result has 786 places, 787 transitions, 1578 flow [2025-03-14 01:19:01,508 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=812, PETRI_DIFFERENCE_MINUEND_FLOW=1578, PETRI_DIFFERENCE_MINUEND_PLACES=785, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=787, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=787, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=1578, PETRI_PLACES=786, PETRI_TRANSITIONS=787} [2025-03-14 01:19:01,511 INFO L279 CegarLoopForPetriNet]: 808 programPoint places, -22 predicate places. [2025-03-14 01:19:01,511 INFO L471 AbstractCegarLoop]: Abstraction has has 786 places, 787 transitions, 1578 flow [2025-03-14 01:19:01,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 785.0) internal successors, (1570), 2 states have internal predecessors, (1570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:19:01,513 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:19:01,514 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-03-14 01:19:01,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:19:01,514 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-03-14 01:19:01,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:19:01,517 INFO L85 PathProgramCache]: Analyzing trace with hash -216135981, now seen corresponding path program 1 times [2025-03-14 01:19:01,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:19:01,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629874698] [2025-03-14 01:19:01,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:19:01,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:19:01,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 669 statements into 1 equivalence classes. [2025-03-14 01:19:01,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 669 of 669 statements. [2025-03-14 01:19:01,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:19:01,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:19:02,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:19:02,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:19:02,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629874698] [2025-03-14 01:19:02,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629874698] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:19:02,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:19:02,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:19:02,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838896488] [2025-03-14 01:19:02,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:19:02,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:19:02,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:19:02,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:19:02,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:19:02,158 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 780 out of 812 [2025-03-14 01:19:02,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 786 places, 787 transitions, 1578 flow. Second operand has 3 states, 3 states have (on average 781.3333333333334) internal successors, (2344), 3 states have internal predecessors, (2344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:19:02,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:19:02,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 780 of 812 [2025-03-14 01:19:02,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:19:02,330 INFO L124 PetriNetUnfolderBase]: 8/884 cut-off events. [2025-03-14 01:19:02,330 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:19:02,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 909 conditions, 884 events. 8/884 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 464 event pairs, 0 based on Foata normal form. 0/859 useless extension candidates. Maximal degree in co-relation 905. Up to 11 conditions per place. [2025-03-14 01:19:02,333 INFO L140 encePairwiseOnDemand]: 809/812 looper letters, 17 selfloop transitions, 2 changer transitions 0/793 dead transitions. [2025-03-14 01:19:02,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 787 places, 793 transitions, 1628 flow [2025-03-14 01:19:02,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:19:02,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:19:02,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2360 transitions. [2025-03-14 01:19:02,338 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9688013136288999 [2025-03-14 01:19:02,338 INFO L175 Difference]: Start difference. First operand has 786 places, 787 transitions, 1578 flow. Second operand 3 states and 2360 transitions. [2025-03-14 01:19:02,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 787 places, 793 transitions, 1628 flow [2025-03-14 01:19:02,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 787 places, 793 transitions, 1628 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:19:02,352 INFO L231 Difference]: Finished difference. Result has 787 places, 786 transitions, 1580 flow [2025-03-14 01:19:02,353 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=812, PETRI_DIFFERENCE_MINUEND_FLOW=1576, PETRI_DIFFERENCE_MINUEND_PLACES=785, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=786, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=784, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1580, PETRI_PLACES=787, PETRI_TRANSITIONS=786} [2025-03-14 01:19:02,354 INFO L279 CegarLoopForPetriNet]: 808 programPoint places, -21 predicate places. [2025-03-14 01:19:02,354 INFO L471 AbstractCegarLoop]: Abstraction has has 787 places, 786 transitions, 1580 flow [2025-03-14 01:19:02,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 781.3333333333334) internal successors, (2344), 3 states have internal predecessors, (2344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:19:02,356 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:19:02,356 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-03-14 01:19:02,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:19:02,357 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-03-14 01:19:02,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:19:02,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1310196485, now seen corresponding path program 1 times [2025-03-14 01:19:02,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:19:02,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434503429] [2025-03-14 01:19:02,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:19:02,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:19:02,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 671 statements into 1 equivalence classes. [2025-03-14 01:19:02,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 671 of 671 statements. [2025-03-14 01:19:02,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:19:02,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:19:02,551 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 01:19:02,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 671 statements into 1 equivalence classes. [2025-03-14 01:19:02,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 671 of 671 statements. [2025-03-14 01:19:02,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:19:02,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:19:02,803 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 01:19:02,803 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 01:19:02,804 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (52 of 53 remaining) [2025-03-14 01:19:02,805 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (51 of 53 remaining) [2025-03-14 01:19:02,805 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (50 of 53 remaining) [2025-03-14 01:19:02,805 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (49 of 53 remaining) [2025-03-14 01:19:02,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (48 of 53 remaining) [2025-03-14 01:19:02,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (47 of 53 remaining) [2025-03-14 01:19:02,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (46 of 53 remaining) [2025-03-14 01:19:02,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (45 of 53 remaining) [2025-03-14 01:19:02,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (44 of 53 remaining) [2025-03-14 01:19:02,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (43 of 53 remaining) [2025-03-14 01:19:02,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (42 of 53 remaining) [2025-03-14 01:19:02,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (41 of 53 remaining) [2025-03-14 01:19:02,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (40 of 53 remaining) [2025-03-14 01:19:02,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (39 of 53 remaining) [2025-03-14 01:19:02,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (38 of 53 remaining) [2025-03-14 01:19:02,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (37 of 53 remaining) [2025-03-14 01:19:02,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (36 of 53 remaining) [2025-03-14 01:19:02,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (35 of 53 remaining) [2025-03-14 01:19:02,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (34 of 53 remaining) [2025-03-14 01:19:02,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (33 of 53 remaining) [2025-03-14 01:19:02,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (32 of 53 remaining) [2025-03-14 01:19:02,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (31 of 53 remaining) [2025-03-14 01:19:02,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (30 of 53 remaining) [2025-03-14 01:19:02,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (29 of 53 remaining) [2025-03-14 01:19:02,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (28 of 53 remaining) [2025-03-14 01:19:02,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (27 of 53 remaining) [2025-03-14 01:19:02,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (26 of 53 remaining) [2025-03-14 01:19:02,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (25 of 53 remaining) [2025-03-14 01:19:02,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (24 of 53 remaining) [2025-03-14 01:19:02,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (23 of 53 remaining) [2025-03-14 01:19:02,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (22 of 53 remaining) [2025-03-14 01:19:02,808 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (21 of 53 remaining) [2025-03-14 01:19:02,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (20 of 53 remaining) [2025-03-14 01:19:02,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (19 of 53 remaining) [2025-03-14 01:19:02,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (18 of 53 remaining) [2025-03-14 01:19:02,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (17 of 53 remaining) [2025-03-14 01:19:02,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (16 of 53 remaining) [2025-03-14 01:19:02,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (15 of 53 remaining) [2025-03-14 01:19:02,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (14 of 53 remaining) [2025-03-14 01:19:02,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (13 of 53 remaining) [2025-03-14 01:19:02,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (12 of 53 remaining) [2025-03-14 01:19:02,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (11 of 53 remaining) [2025-03-14 01:19:02,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (10 of 53 remaining) [2025-03-14 01:19:02,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (9 of 53 remaining) [2025-03-14 01:19:02,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (8 of 53 remaining) [2025-03-14 01:19:02,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (7 of 53 remaining) [2025-03-14 01:19:02,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 53 remaining) [2025-03-14 01:19:02,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (5 of 53 remaining) [2025-03-14 01:19:02,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (4 of 53 remaining) [2025-03-14 01:19:02,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (3 of 53 remaining) [2025-03-14 01:19:02,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (2 of 53 remaining) [2025-03-14 01:19:02,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (1 of 53 remaining) [2025-03-14 01:19:02,810 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 53 remaining) [2025-03-14 01:19:02,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:19:02,810 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-14 01:19:02,813 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 01:19:02,813 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-14 01:19:02,940 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 01:19:02,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 944 places, 953 transitions, 1916 flow [2025-03-14 01:19:03,142 INFO L124 PetriNetUnfolderBase]: 14/969 cut-off events. [2025-03-14 01:19:03,143 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:19:03,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 977 conditions, 969 events. 14/969 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 998 event pairs, 0 based on Foata normal form. 0/900 useless extension candidates. Maximal degree in co-relation 820. Up to 3 conditions per place. [2025-03-14 01:19:03,148 INFO L82 GeneralOperation]: Start removeDead. Operand has 944 places, 953 transitions, 1916 flow [2025-03-14 01:19:03,154 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 944 places, 953 transitions, 1916 flow [2025-03-14 01:19:03,158 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:19:03,158 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;@67338de8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:19:03,158 INFO L334 AbstractCegarLoop]: Starting to check reachability of 79 error locations. [2025-03-14 01:19:03,216 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:19:03,216 INFO L124 PetriNetUnfolderBase]: 0/671 cut-off events. [2025-03-14 01:19:03,216 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:19:03,216 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:19:03,217 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-03-14 01:19:03,217 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-03-14 01:19:03,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:19:03,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1068738836, now seen corresponding path program 1 times [2025-03-14 01:19:03,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:19:03,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262185556] [2025-03-14 01:19:03,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:19:03,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:19:03,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 667 statements into 1 equivalence classes. [2025-03-14 01:19:03,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 667 of 667 statements. [2025-03-14 01:19:03,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:19:03,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:19:04,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:19:04,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:19:04,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262185556] [2025-03-14 01:19:04,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262185556] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:19:04,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:19:04,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-14 01:19:04,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608613075] [2025-03-14 01:19:04,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:19:04,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-14 01:19:04,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:19:04,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-14 01:19:04,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-14 01:19:04,975 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 898 out of 953 [2025-03-14 01:19:04,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 944 places, 953 transitions, 1916 flow. Second operand has 2 states, 2 states have (on average 899.0) internal successors, (1798), 2 states have internal predecessors, (1798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:19:04,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:19:04,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 898 of 953 [2025-03-14 01:19:04,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:19:05,659 INFO L124 PetriNetUnfolderBase]: 123/2019 cut-off events. [2025-03-14 01:19:05,659 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-03-14 01:19:05,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2206 conditions, 2019 events. 123/2019 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 8906 event pairs, 52 based on Foata normal form. 89/1936 useless extension candidates. Maximal degree in co-relation 1367. Up to 161 conditions per place. [2025-03-14 01:19:05,678 INFO L140 encePairwiseOnDemand]: 916/953 looper letters, 18 selfloop transitions, 0 changer transitions 0/907 dead transitions. [2025-03-14 01:19:05,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 903 places, 907 transitions, 1860 flow [2025-03-14 01:19:05,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-14 01:19:05,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-14 01:19:05,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1851 transitions. [2025-03-14 01:19:05,683 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9711437565582371 [2025-03-14 01:19:05,683 INFO L175 Difference]: Start difference. First operand has 944 places, 953 transitions, 1916 flow. Second operand 2 states and 1851 transitions. [2025-03-14 01:19:05,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 903 places, 907 transitions, 1860 flow [2025-03-14 01:19:05,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 903 places, 907 transitions, 1860 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:19:05,704 INFO L231 Difference]: Finished difference. Result has 903 places, 907 transitions, 1824 flow [2025-03-14 01:19:05,705 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=953, PETRI_DIFFERENCE_MINUEND_FLOW=1824, PETRI_DIFFERENCE_MINUEND_PLACES=902, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=907, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=907, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=1824, PETRI_PLACES=903, PETRI_TRANSITIONS=907} [2025-03-14 01:19:05,706 INFO L279 CegarLoopForPetriNet]: 944 programPoint places, -41 predicate places. [2025-03-14 01:19:05,706 INFO L471 AbstractCegarLoop]: Abstraction has has 903 places, 907 transitions, 1824 flow [2025-03-14 01:19:05,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 899.0) internal successors, (1798), 2 states have internal predecessors, (1798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:19:05,707 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:19:05,708 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-03-14 01:19:05,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:19:05,709 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-03-14 01:19:05,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:19:05,711 INFO L85 PathProgramCache]: Analyzing trace with hash 560942168, now seen corresponding path program 1 times [2025-03-14 01:19:05,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:19:05,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998063769] [2025-03-14 01:19:05,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:19:05,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:19:05,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 669 statements into 1 equivalence classes. [2025-03-14 01:19:05,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 669 of 669 statements. [2025-03-14 01:19:05,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:19:05,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:19:06,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:19:06,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:19:06,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998063769] [2025-03-14 01:19:06,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998063769] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:19:06,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:19:06,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:19:06,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626432132] [2025-03-14 01:19:06,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:19:06,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:19:06,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:19:06,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:19:06,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:19:06,067 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 890 out of 953 [2025-03-14 01:19:06,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 903 places, 907 transitions, 1824 flow. Second operand has 3 states, 3 states have (on average 891.3333333333334) internal successors, (2674), 3 states have internal predecessors, (2674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:19:06,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:19:06,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 890 of 953 [2025-03-14 01:19:06,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:19:06,915 INFO L124 PetriNetUnfolderBase]: 399/4511 cut-off events. [2025-03-14 01:19:06,915 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-03-14 01:19:06,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5140 conditions, 4511 events. 399/4511 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 34883 event pairs, 99 based on Foata normal form. 0/4034 useless extension candidates. Maximal degree in co-relation 5135. Up to 293 conditions per place. [2025-03-14 01:19:06,952 INFO L140 encePairwiseOnDemand]: 945/953 looper letters, 43 selfloop transitions, 6 changer transitions 0/930 dead transitions. [2025-03-14 01:19:06,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 905 places, 930 transitions, 1973 flow [2025-03-14 01:19:06,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:19:06,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:19:06,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2721 transitions. [2025-03-14 01:19:06,959 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9517313746065058 [2025-03-14 01:19:06,959 INFO L175 Difference]: Start difference. First operand has 903 places, 907 transitions, 1824 flow. Second operand 3 states and 2721 transitions. [2025-03-14 01:19:06,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 905 places, 930 transitions, 1973 flow [2025-03-14 01:19:06,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 905 places, 930 transitions, 1973 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:19:06,970 INFO L231 Difference]: Finished difference. Result has 907 places, 913 transitions, 1876 flow [2025-03-14 01:19:06,971 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=953, PETRI_DIFFERENCE_MINUEND_FLOW=1824, PETRI_DIFFERENCE_MINUEND_PLACES=903, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=907, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=901, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1876, PETRI_PLACES=907, PETRI_TRANSITIONS=913} [2025-03-14 01:19:06,973 INFO L279 CegarLoopForPetriNet]: 944 programPoint places, -37 predicate places. [2025-03-14 01:19:06,973 INFO L471 AbstractCegarLoop]: Abstraction has has 907 places, 913 transitions, 1876 flow [2025-03-14 01:19:06,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 891.3333333333334) internal successors, (2674), 3 states have internal predecessors, (2674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:19:06,974 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:19:06,975 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-03-14 01:19:06,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:19:06,976 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-03-14 01:19:06,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:19:06,977 INFO L85 PathProgramCache]: Analyzing trace with hash 2136453639, now seen corresponding path program 1 times [2025-03-14 01:19:06,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:19:06,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746005128] [2025-03-14 01:19:06,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:19:06,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:19:07,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 677 statements into 1 equivalence classes. [2025-03-14 01:19:07,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 677 of 677 statements. [2025-03-14 01:19:07,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:19:07,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:19:07,138 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 01:19:07,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 677 statements into 1 equivalence classes. [2025-03-14 01:19:07,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 677 of 677 statements. [2025-03-14 01:19:07,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:19:07,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:19:07,304 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 01:19:07,305 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 01:19:07,305 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (78 of 79 remaining) [2025-03-14 01:19:07,305 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (77 of 79 remaining) [2025-03-14 01:19:07,305 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (76 of 79 remaining) [2025-03-14 01:19:07,305 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (75 of 79 remaining) [2025-03-14 01:19:07,305 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (74 of 79 remaining) [2025-03-14 01:19:07,305 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (73 of 79 remaining) [2025-03-14 01:19:07,305 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (72 of 79 remaining) [2025-03-14 01:19:07,305 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (71 of 79 remaining) [2025-03-14 01:19:07,306 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (70 of 79 remaining) [2025-03-14 01:19:07,306 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (69 of 79 remaining) [2025-03-14 01:19:07,306 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (68 of 79 remaining) [2025-03-14 01:19:07,306 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (67 of 79 remaining) [2025-03-14 01:19:07,306 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (66 of 79 remaining) [2025-03-14 01:19:07,306 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (65 of 79 remaining) [2025-03-14 01:19:07,306 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (64 of 79 remaining) [2025-03-14 01:19:07,306 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (63 of 79 remaining) [2025-03-14 01:19:07,306 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (62 of 79 remaining) [2025-03-14 01:19:07,306 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (61 of 79 remaining) [2025-03-14 01:19:07,306 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (60 of 79 remaining) [2025-03-14 01:19:07,306 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (59 of 79 remaining) [2025-03-14 01:19:07,306 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (58 of 79 remaining) [2025-03-14 01:19:07,306 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (57 of 79 remaining) [2025-03-14 01:19:07,307 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (56 of 79 remaining) [2025-03-14 01:19:07,307 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (55 of 79 remaining) [2025-03-14 01:19:07,307 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (54 of 79 remaining) [2025-03-14 01:19:07,307 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (53 of 79 remaining) [2025-03-14 01:19:07,308 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (52 of 79 remaining) [2025-03-14 01:19:07,308 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (51 of 79 remaining) [2025-03-14 01:19:07,308 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (50 of 79 remaining) [2025-03-14 01:19:07,308 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (49 of 79 remaining) [2025-03-14 01:19:07,308 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (48 of 79 remaining) [2025-03-14 01:19:07,308 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (47 of 79 remaining) [2025-03-14 01:19:07,308 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (46 of 79 remaining) [2025-03-14 01:19:07,308 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (45 of 79 remaining) [2025-03-14 01:19:07,308 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (44 of 79 remaining) [2025-03-14 01:19:07,308 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (43 of 79 remaining) [2025-03-14 01:19:07,308 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (42 of 79 remaining) [2025-03-14 01:19:07,308 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (41 of 79 remaining) [2025-03-14 01:19:07,309 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (40 of 79 remaining) [2025-03-14 01:19:07,309 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (39 of 79 remaining) [2025-03-14 01:19:07,309 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (38 of 79 remaining) [2025-03-14 01:19:07,309 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (37 of 79 remaining) [2025-03-14 01:19:07,309 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (36 of 79 remaining) [2025-03-14 01:19:07,309 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (35 of 79 remaining) [2025-03-14 01:19:07,309 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (34 of 79 remaining) [2025-03-14 01:19:07,309 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (33 of 79 remaining) [2025-03-14 01:19:07,309 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (32 of 79 remaining) [2025-03-14 01:19:07,309 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (31 of 79 remaining) [2025-03-14 01:19:07,309 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (30 of 79 remaining) [2025-03-14 01:19:07,309 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (29 of 79 remaining) [2025-03-14 01:19:07,309 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (28 of 79 remaining) [2025-03-14 01:19:07,309 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (27 of 79 remaining) [2025-03-14 01:19:07,309 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (26 of 79 remaining) [2025-03-14 01:19:07,309 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (25 of 79 remaining) [2025-03-14 01:19:07,309 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (24 of 79 remaining) [2025-03-14 01:19:07,309 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (23 of 79 remaining) [2025-03-14 01:19:07,310 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (22 of 79 remaining) [2025-03-14 01:19:07,310 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (21 of 79 remaining) [2025-03-14 01:19:07,310 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (20 of 79 remaining) [2025-03-14 01:19:07,310 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (19 of 79 remaining) [2025-03-14 01:19:07,310 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (18 of 79 remaining) [2025-03-14 01:19:07,311 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (17 of 79 remaining) [2025-03-14 01:19:07,311 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (16 of 79 remaining) [2025-03-14 01:19:07,311 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (15 of 79 remaining) [2025-03-14 01:19:07,311 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (14 of 79 remaining) [2025-03-14 01:19:07,311 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (13 of 79 remaining) [2025-03-14 01:19:07,311 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (12 of 79 remaining) [2025-03-14 01:19:07,311 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (11 of 79 remaining) [2025-03-14 01:19:07,311 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (10 of 79 remaining) [2025-03-14 01:19:07,311 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (9 of 79 remaining) [2025-03-14 01:19:07,311 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (8 of 79 remaining) [2025-03-14 01:19:07,311 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (7 of 79 remaining) [2025-03-14 01:19:07,311 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 79 remaining) [2025-03-14 01:19:07,311 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (5 of 79 remaining) [2025-03-14 01:19:07,311 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (4 of 79 remaining) [2025-03-14 01:19:07,311 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (3 of 79 remaining) [2025-03-14 01:19:07,311 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (2 of 79 remaining) [2025-03-14 01:19:07,311 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (1 of 79 remaining) [2025-03-14 01:19:07,311 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 79 remaining) [2025-03-14 01:19:07,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:19:07,311 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-14 01:19:07,312 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 01:19:07,312 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-14 01:19:07,428 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 01:19:07,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1080 places, 1094 transitions, 2206 flow [2025-03-14 01:19:07,639 INFO L124 PetriNetUnfolderBase]: 21/1119 cut-off events. [2025-03-14 01:19:07,640 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-14 01:19:07,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1132 conditions, 1119 events. 21/1119 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1919 event pairs, 0 based on Foata normal form. 0/1016 useless extension candidates. Maximal degree in co-relation 973. Up to 4 conditions per place. [2025-03-14 01:19:07,648 INFO L82 GeneralOperation]: Start removeDead. Operand has 1080 places, 1094 transitions, 2206 flow [2025-03-14 01:19:07,657 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1080 places, 1094 transitions, 2206 flow [2025-03-14 01:19:07,658 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:19:07,658 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;@67338de8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:19:07,658 INFO L334 AbstractCegarLoop]: Starting to check reachability of 105 error locations. [2025-03-14 01:19:07,707 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:19:07,707 INFO L124 PetriNetUnfolderBase]: 0/672 cut-off events. [2025-03-14 01:19:07,707 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:19:07,707 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:19:07,708 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-03-14 01:19:07,708 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-03-14 01:19:07,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:19:07,709 INFO L85 PathProgramCache]: Analyzing trace with hash 420655398, now seen corresponding path program 1 times [2025-03-14 01:19:07,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:19:07,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706233333] [2025-03-14 01:19:07,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:19:07,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:19:07,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 667 statements into 1 equivalence classes. [2025-03-14 01:19:07,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 667 of 667 statements. [2025-03-14 01:19:07,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:19:07,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:19:08,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:19:08,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:19:08,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706233333] [2025-03-14 01:19:08,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706233333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:19:08,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:19:08,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-14 01:19:08,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144498061] [2025-03-14 01:19:08,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:19:08,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-14 01:19:08,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:19:08,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-14 01:19:08,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-14 01:19:08,727 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1012 out of 1094 [2025-03-14 01:19:08,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1080 places, 1094 transitions, 2206 flow. Second operand has 2 states, 2 states have (on average 1013.0) internal successors, (2026), 2 states have internal predecessors, (2026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:19:08,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:19:08,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1012 of 1094 [2025-03-14 01:19:08,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:19:11,570 INFO L124 PetriNetUnfolderBase]: 1850/13708 cut-off events. [2025-03-14 01:19:11,570 INFO L125 PetriNetUnfolderBase]: For 391/391 co-relation queries the response was YES. [2025-03-14 01:19:11,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16181 conditions, 13708 events. 1850/13708 cut-off events. For 391/391 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 149065 event pairs, 962 based on Foata normal form. 959/13097 useless extension candidates. Maximal degree in co-relation 13610. Up to 2202 conditions per place. [2025-03-14 01:19:11,696 INFO L140 encePairwiseOnDemand]: 1039/1094 looper letters, 27 selfloop transitions, 0 changer transitions 0/1027 dead transitions. [2025-03-14 01:19:11,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1020 places, 1027 transitions, 2126 flow [2025-03-14 01:19:11,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-14 01:19:11,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-14 01:19:11,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2106 transitions. [2025-03-14 01:19:11,702 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9625228519195612 [2025-03-14 01:19:11,702 INFO L175 Difference]: Start difference. First operand has 1080 places, 1094 transitions, 2206 flow. Second operand 2 states and 2106 transitions. [2025-03-14 01:19:11,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1020 places, 1027 transitions, 2126 flow [2025-03-14 01:19:11,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1020 places, 1027 transitions, 2124 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-14 01:19:11,714 INFO L231 Difference]: Finished difference. Result has 1020 places, 1027 transitions, 2070 flow [2025-03-14 01:19:11,715 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1094, PETRI_DIFFERENCE_MINUEND_FLOW=2070, PETRI_DIFFERENCE_MINUEND_PLACES=1019, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1027, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1027, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=2070, PETRI_PLACES=1020, PETRI_TRANSITIONS=1027} [2025-03-14 01:19:11,716 INFO L279 CegarLoopForPetriNet]: 1080 programPoint places, -60 predicate places. [2025-03-14 01:19:11,716 INFO L471 AbstractCegarLoop]: Abstraction has has 1020 places, 1027 transitions, 2070 flow [2025-03-14 01:19:11,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 1013.0) internal successors, (2026), 2 states have internal predecessors, (2026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:19:11,717 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:19:11,718 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-03-14 01:19:11,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:19:11,718 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-03-14 01:19:11,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:19:11,719 INFO L85 PathProgramCache]: Analyzing trace with hash 523051178, now seen corresponding path program 1 times [2025-03-14 01:19:11,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:19:11,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839726861] [2025-03-14 01:19:11,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:19:11,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:19:11,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 669 statements into 1 equivalence classes. [2025-03-14 01:19:11,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 669 of 669 statements. [2025-03-14 01:19:11,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:19:11,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:19:11,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:19:11,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:19:11,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839726861] [2025-03-14 01:19:11,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839726861] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:19:11,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:19:11,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:19:11,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378127092] [2025-03-14 01:19:11,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:19:11,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:19:11,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:19:11,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:19:11,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:19:11,972 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1000 out of 1094 [2025-03-14 01:19:11,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1020 places, 1027 transitions, 2070 flow. Second operand has 3 states, 3 states have (on average 1001.3333333333334) internal successors, (3004), 3 states have internal predecessors, (3004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:19:11,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:19:11,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1000 of 1094 [2025-03-14 01:19:11,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:19:24,348 INFO L124 PetriNetUnfolderBase]: 9817/60210 cut-off events. [2025-03-14 01:19:24,348 INFO L125 PetriNetUnfolderBase]: For 718/718 co-relation queries the response was YES. [2025-03-14 01:19:24,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73417 conditions, 60210 events. 9817/60210 cut-off events. For 718/718 co-relation queries the response was YES. Maximal size of possible extension queue 1024. Compared 886887 event pairs, 2763 based on Foata normal form. 0/52782 useless extension candidates. Maximal degree in co-relation 73411. Up to 6318 conditions per place. [2025-03-14 01:19:25,265 INFO L140 encePairwiseOnDemand]: 1082/1094 looper letters, 65 selfloop transitions, 9 changer transitions 0/1062 dead transitions. [2025-03-14 01:19:25,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1022 places, 1062 transitions, 2298 flow [2025-03-14 01:19:25,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:19:25,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:19:25,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3077 transitions. [2025-03-14 01:19:25,272 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9375380865326021 [2025-03-14 01:19:25,272 INFO L175 Difference]: Start difference. First operand has 1020 places, 1027 transitions, 2070 flow. Second operand 3 states and 3077 transitions. [2025-03-14 01:19:25,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1022 places, 1062 transitions, 2298 flow [2025-03-14 01:19:25,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1022 places, 1062 transitions, 2298 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:19:25,286 INFO L231 Difference]: Finished difference. Result has 1024 places, 1036 transitions, 2148 flow [2025-03-14 01:19:25,288 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1094, PETRI_DIFFERENCE_MINUEND_FLOW=2070, PETRI_DIFFERENCE_MINUEND_PLACES=1020, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1027, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1018, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2148, PETRI_PLACES=1024, PETRI_TRANSITIONS=1036} [2025-03-14 01:19:25,289 INFO L279 CegarLoopForPetriNet]: 1080 programPoint places, -56 predicate places. [2025-03-14 01:19:25,291 INFO L471 AbstractCegarLoop]: Abstraction has has 1024 places, 1036 transitions, 2148 flow [2025-03-14 01:19:25,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1001.3333333333334) internal successors, (3004), 3 states have internal predecessors, (3004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:19:25,292 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:19:25,292 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-03-14 01:19:25,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:19:25,293 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-03-14 01:19:25,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:19:25,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1223911624, now seen corresponding path program 1 times [2025-03-14 01:19:25,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:19:25,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681070436] [2025-03-14 01:19:25,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:19:25,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:19:25,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 679 statements into 1 equivalence classes. [2025-03-14 01:19:25,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 679 of 679 statements. [2025-03-14 01:19:25,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:19:25,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:19:27,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:19:27,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:19:27,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681070436] [2025-03-14 01:19:27,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681070436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:19:27,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:19:27,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:19:27,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741194072] [2025-03-14 01:19:27,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:19:27,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:19:27,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:19:27,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:19:27,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:19:27,341 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 979 out of 1094 [2025-03-14 01:19:27,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1024 places, 1036 transitions, 2148 flow. Second operand has 6 states, 6 states have (on average 980.6666666666666) internal successors, (5884), 6 states have internal predecessors, (5884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:19:27,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:19:27,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 979 of 1094 [2025-03-14 01:19:27,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:19:31,946 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4174] L784-3-->L785: Formula: (let ((.cse5 (select |v_#race_809| |v_~#m2~0.base_45|))) (let ((.cse2 (+ |v_~#m2~0.offset_45| 2)) (.cse3 (+ |v_~#m2~0.offset_45| 3)) (.cse0 (select .cse5 |v_~#m2~0.offset_45|)) (.cse1 (+ |v_~#m2~0.offset_45| 1)) (.cse4 (select |v_#memory_int_445| |v_~#m2~0.base_45|))) (and (= (store |v_#race_811| |v_~#m2~0.base_45| (store (store (store (store (select |v_#race_811| |v_~#m2~0.base_45|) |v_~#m2~0.offset_45| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0)) |v_#race_809|) (= (store |v_#memory_int_445| |v_~#m2~0.base_45| (store .cse4 |v_~#m2~0.offset_45| 0)) |v_#memory_int_444|) (= .cse0 (select .cse5 .cse2)) (= .cse0 (select .cse5 .cse3)) (= .cse0 (select .cse5 .cse1)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_45|) 1) 1 0) 0))))) InVars {#race=|v_#race_811|, #memory_int=|v_#memory_int_445|, ~#m2~0.base=|v_~#m2~0.base_45|, ~#m2~0.offset=|v_~#m2~0.offset_45|} OutVars{#race=|v_#race_809|, 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_444|, ~#m2~0.base=|v_~#m2~0.base_45|, 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_45|, 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], [326#L793-2true, Black: 1085#true, 37#L734-1true, 1083#true, 1031#L785true, 1090#true, 1079#true, 79#L785true, 1087#(= |#race~state~0| 0), 1077#true, 1081#true]) [2025-03-14 01:19:31,946 INFO L294 olderBase$Statistics]: this new event has 723 ancestors and is cut-off event [2025-03-14 01:19:31,947 INFO L297 olderBase$Statistics]: existing Event has 709 ancestors and is cut-off event [2025-03-14 01:19:31,947 INFO L297 olderBase$Statistics]: existing Event has 709 ancestors and is cut-off event [2025-03-14 01:19:31,947 INFO L297 olderBase$Statistics]: existing Event has 723 ancestors and is cut-off event [2025-03-14 01:19:32,381 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4174] L784-3-->L785: Formula: (let ((.cse5 (select |v_#race_809| |v_~#m2~0.base_45|))) (let ((.cse2 (+ |v_~#m2~0.offset_45| 2)) (.cse3 (+ |v_~#m2~0.offset_45| 3)) (.cse0 (select .cse5 |v_~#m2~0.offset_45|)) (.cse1 (+ |v_~#m2~0.offset_45| 1)) (.cse4 (select |v_#memory_int_445| |v_~#m2~0.base_45|))) (and (= (store |v_#race_811| |v_~#m2~0.base_45| (store (store (store (store (select |v_#race_811| |v_~#m2~0.base_45|) |v_~#m2~0.offset_45| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0)) |v_#race_809|) (= (store |v_#memory_int_445| |v_~#m2~0.base_45| (store .cse4 |v_~#m2~0.offset_45| 0)) |v_#memory_int_444|) (= .cse0 (select .cse5 .cse2)) (= .cse0 (select .cse5 .cse3)) (= .cse0 (select .cse5 .cse1)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_45|) 1) 1 0) 0))))) InVars {#race=|v_#race_811|, #memory_int=|v_#memory_int_445|, ~#m2~0.base=|v_~#m2~0.base_45|, ~#m2~0.offset=|v_~#m2~0.offset_45|} OutVars{#race=|v_#race_809|, 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_444|, ~#m2~0.base=|v_~#m2~0.base_45|, 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_45|, 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], [Black: 1085#true, 326#L793-2true, 1083#true, 1031#L785true, 1090#true, 482#EBStack_init_returnLabel#1true, 1079#true, 79#L785true, 1087#(= |#race~state~0| 0), 1077#true, 1081#true]) [2025-03-14 01:19:32,382 INFO L294 olderBase$Statistics]: this new event has 724 ancestors and is cut-off event [2025-03-14 01:19:32,382 INFO L297 olderBase$Statistics]: existing Event has 710 ancestors and is cut-off event [2025-03-14 01:19:32,382 INFO L297 olderBase$Statistics]: existing Event has 710 ancestors and is cut-off event [2025-03-14 01:19:32,382 INFO L297 olderBase$Statistics]: existing Event has 724 ancestors and is cut-off event [2025-03-14 01:19:32,557 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4174] L784-3-->L785: Formula: (let ((.cse5 (select |v_#race_809| |v_~#m2~0.base_45|))) (let ((.cse2 (+ |v_~#m2~0.offset_45| 2)) (.cse3 (+ |v_~#m2~0.offset_45| 3)) (.cse0 (select .cse5 |v_~#m2~0.offset_45|)) (.cse1 (+ |v_~#m2~0.offset_45| 1)) (.cse4 (select |v_#memory_int_445| |v_~#m2~0.base_45|))) (and (= (store |v_#race_811| |v_~#m2~0.base_45| (store (store (store (store (select |v_#race_811| |v_~#m2~0.base_45|) |v_~#m2~0.offset_45| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0)) |v_#race_809|) (= (store |v_#memory_int_445| |v_~#m2~0.base_45| (store .cse4 |v_~#m2~0.offset_45| 0)) |v_#memory_int_444|) (= .cse0 (select .cse5 .cse2)) (= .cse0 (select .cse5 .cse3)) (= .cse0 (select .cse5 .cse1)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_45|) 1) 1 0) 0))))) InVars {#race=|v_#race_811|, #memory_int=|v_#memory_int_445|, ~#m2~0.base=|v_~#m2~0.base_45|, ~#m2~0.offset=|v_~#m2~0.offset_45|} OutVars{#race=|v_#race_809|, 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_444|, ~#m2~0.base=|v_~#m2~0.base_45|, 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_45|, 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], [Black: 1085#true, 326#L793-2true, 652#L781true, 1083#true, 1031#L785true, 1090#true, 1079#true, 79#L785true, 1087#(= |#race~state~0| 0), 1077#true, 1081#true]) [2025-03-14 01:19:32,557 INFO L294 olderBase$Statistics]: this new event has 725 ancestors and is cut-off event [2025-03-14 01:19:32,557 INFO L297 olderBase$Statistics]: existing Event has 725 ancestors and is cut-off event [2025-03-14 01:19:32,557 INFO L297 olderBase$Statistics]: existing Event has 711 ancestors and is cut-off event [2025-03-14 01:19:32,557 INFO L297 olderBase$Statistics]: existing Event has 711 ancestors and is cut-off event [2025-03-14 01:19:33,489 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4174] L784-3-->L785: Formula: (let ((.cse5 (select |v_#race_809| |v_~#m2~0.base_45|))) (let ((.cse2 (+ |v_~#m2~0.offset_45| 2)) (.cse3 (+ |v_~#m2~0.offset_45| 3)) (.cse0 (select .cse5 |v_~#m2~0.offset_45|)) (.cse1 (+ |v_~#m2~0.offset_45| 1)) (.cse4 (select |v_#memory_int_445| |v_~#m2~0.base_45|))) (and (= (store |v_#race_811| |v_~#m2~0.base_45| (store (store (store (store (select |v_#race_811| |v_~#m2~0.base_45|) |v_~#m2~0.offset_45| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0)) |v_#race_809|) (= (store |v_#memory_int_445| |v_~#m2~0.base_45| (store .cse4 |v_~#m2~0.offset_45| 0)) |v_#memory_int_444|) (= .cse0 (select .cse5 .cse2)) (= .cse0 (select .cse5 .cse3)) (= .cse0 (select .cse5 .cse1)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_45|) 1) 1 0) 0))))) InVars {#race=|v_#race_811|, #memory_int=|v_#memory_int_445|, ~#m2~0.base=|v_~#m2~0.base_45|, ~#m2~0.offset=|v_~#m2~0.offset_45|} OutVars{#race=|v_#race_809|, 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_444|, ~#m2~0.base=|v_~#m2~0.base_45|, 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_45|, 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], [326#L793-2true, Black: 1085#true, 1083#true, 1031#L785true, 1090#true, 1079#true, 274#L782-2true, 1087#(= |#race~state~0| 0), 1077#true, 725#L734-3true, 1081#true]) [2025-03-14 01:19:33,489 INFO L294 olderBase$Statistics]: this new event has 730 ancestors and is cut-off event [2025-03-14 01:19:33,489 INFO L297 olderBase$Statistics]: existing Event has 716 ancestors and is cut-off event [2025-03-14 01:19:33,489 INFO L297 olderBase$Statistics]: existing Event has 716 ancestors and is cut-off event [2025-03-14 01:19:33,489 INFO L297 olderBase$Statistics]: existing Event has 716 ancestors and is cut-off event [2025-03-14 01:19:33,870 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4174] L784-3-->L785: Formula: (let ((.cse5 (select |v_#race_809| |v_~#m2~0.base_45|))) (let ((.cse2 (+ |v_~#m2~0.offset_45| 2)) (.cse3 (+ |v_~#m2~0.offset_45| 3)) (.cse0 (select .cse5 |v_~#m2~0.offset_45|)) (.cse1 (+ |v_~#m2~0.offset_45| 1)) (.cse4 (select |v_#memory_int_445| |v_~#m2~0.base_45|))) (and (= (store |v_#race_811| |v_~#m2~0.base_45| (store (store (store (store (select |v_#race_811| |v_~#m2~0.base_45|) |v_~#m2~0.offset_45| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0)) |v_#race_809|) (= (store |v_#memory_int_445| |v_~#m2~0.base_45| (store .cse4 |v_~#m2~0.offset_45| 0)) |v_#memory_int_444|) (= .cse0 (select .cse5 .cse2)) (= .cse0 (select .cse5 .cse3)) (= .cse0 (select .cse5 .cse1)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_45|) 1) 1 0) 0))))) InVars {#race=|v_#race_811|, #memory_int=|v_#memory_int_445|, ~#m2~0.base=|v_~#m2~0.base_45|, ~#m2~0.offset=|v_~#m2~0.offset_45|} OutVars{#race=|v_#race_809|, 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_444|, ~#m2~0.base=|v_~#m2~0.base_45|, 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_45|, 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], [326#L793-2true, Black: 1085#true, 1083#true, 1031#L785true, 1090#true, 1079#true, 274#L782-2true, 304#L734-2true, 1087#(= |#race~state~0| 0), 1077#true, 1081#true]) [2025-03-14 01:19:33,870 INFO L294 olderBase$Statistics]: this new event has 731 ancestors and is cut-off event [2025-03-14 01:19:33,870 INFO L297 olderBase$Statistics]: existing Event has 717 ancestors and is cut-off event [2025-03-14 01:19:33,870 INFO L297 olderBase$Statistics]: existing Event has 717 ancestors and is cut-off event [2025-03-14 01:19:33,870 INFO L297 olderBase$Statistics]: existing Event has 717 ancestors and is cut-off event [2025-03-14 01:19:34,152 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4174] L784-3-->L785: Formula: (let ((.cse5 (select |v_#race_809| |v_~#m2~0.base_45|))) (let ((.cse2 (+ |v_~#m2~0.offset_45| 2)) (.cse3 (+ |v_~#m2~0.offset_45| 3)) (.cse0 (select .cse5 |v_~#m2~0.offset_45|)) (.cse1 (+ |v_~#m2~0.offset_45| 1)) (.cse4 (select |v_#memory_int_445| |v_~#m2~0.base_45|))) (and (= (store |v_#race_811| |v_~#m2~0.base_45| (store (store (store (store (select |v_#race_811| |v_~#m2~0.base_45|) |v_~#m2~0.offset_45| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0)) |v_#race_809|) (= (store |v_#memory_int_445| |v_~#m2~0.base_45| (store .cse4 |v_~#m2~0.offset_45| 0)) |v_#memory_int_444|) (= .cse0 (select .cse5 .cse2)) (= .cse0 (select .cse5 .cse3)) (= .cse0 (select .cse5 .cse1)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_45|) 1) 1 0) 0))))) InVars {#race=|v_#race_811|, #memory_int=|v_#memory_int_445|, ~#m2~0.base=|v_~#m2~0.base_45|, ~#m2~0.offset=|v_~#m2~0.offset_45|} OutVars{#race=|v_#race_809|, 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_444|, ~#m2~0.base=|v_~#m2~0.base_45|, 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_45|, 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], [326#L793-2true, Black: 1085#true, 1083#true, 1031#L785true, 1090#true, 1079#true, 274#L782-2true, 1087#(= |#race~state~0| 0), 1077#true, 23#L734true, 1081#true]) [2025-03-14 01:19:34,152 INFO L294 olderBase$Statistics]: this new event has 732 ancestors and is cut-off event [2025-03-14 01:19:34,152 INFO L297 olderBase$Statistics]: existing Event has 718 ancestors and is cut-off event [2025-03-14 01:19:34,152 INFO L297 olderBase$Statistics]: existing Event has 718 ancestors and is cut-off event [2025-03-14 01:19:34,152 INFO L297 olderBase$Statistics]: existing Event has 718 ancestors and is cut-off event [2025-03-14 01:19:34,371 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4174] L784-3-->L785: Formula: (let ((.cse5 (select |v_#race_809| |v_~#m2~0.base_45|))) (let ((.cse2 (+ |v_~#m2~0.offset_45| 2)) (.cse3 (+ |v_~#m2~0.offset_45| 3)) (.cse0 (select .cse5 |v_~#m2~0.offset_45|)) (.cse1 (+ |v_~#m2~0.offset_45| 1)) (.cse4 (select |v_#memory_int_445| |v_~#m2~0.base_45|))) (and (= (store |v_#race_811| |v_~#m2~0.base_45| (store (store (store (store (select |v_#race_811| |v_~#m2~0.base_45|) |v_~#m2~0.offset_45| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0)) |v_#race_809|) (= (store |v_#memory_int_445| |v_~#m2~0.base_45| (store .cse4 |v_~#m2~0.offset_45| 0)) |v_#memory_int_444|) (= .cse0 (select .cse5 .cse2)) (= .cse0 (select .cse5 .cse3)) (= .cse0 (select .cse5 .cse1)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_45|) 1) 1 0) 0))))) InVars {#race=|v_#race_811|, #memory_int=|v_#memory_int_445|, ~#m2~0.base=|v_~#m2~0.base_45|, ~#m2~0.offset=|v_~#m2~0.offset_45|} OutVars{#race=|v_#race_809|, 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_444|, ~#m2~0.base=|v_~#m2~0.base_45|, 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_45|, 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], [326#L793-2true, Black: 1085#true, 1083#true, 1031#L785true, 1090#true, 1079#true, 274#L782-2true, 1087#(= |#race~state~0| 0), 1077#true, 330#L734-1true, 1081#true]) [2025-03-14 01:19:34,371 INFO L294 olderBase$Statistics]: this new event has 733 ancestors and is cut-off event [2025-03-14 01:19:34,371 INFO L297 olderBase$Statistics]: existing Event has 719 ancestors and is cut-off event [2025-03-14 01:19:34,371 INFO L297 olderBase$Statistics]: existing Event has 719 ancestors and is cut-off event [2025-03-14 01:19:34,371 INFO L297 olderBase$Statistics]: existing Event has 719 ancestors and is cut-off event [2025-03-14 01:19:35,725 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4174] L784-3-->L785: Formula: (let ((.cse5 (select |v_#race_809| |v_~#m2~0.base_45|))) (let ((.cse2 (+ |v_~#m2~0.offset_45| 2)) (.cse3 (+ |v_~#m2~0.offset_45| 3)) (.cse0 (select .cse5 |v_~#m2~0.offset_45|)) (.cse1 (+ |v_~#m2~0.offset_45| 1)) (.cse4 (select |v_#memory_int_445| |v_~#m2~0.base_45|))) (and (= (store |v_#race_811| |v_~#m2~0.base_45| (store (store (store (store (select |v_#race_811| |v_~#m2~0.base_45|) |v_~#m2~0.offset_45| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0)) |v_#race_809|) (= (store |v_#memory_int_445| |v_~#m2~0.base_45| (store .cse4 |v_~#m2~0.offset_45| 0)) |v_#memory_int_444|) (= .cse0 (select .cse5 .cse2)) (= .cse0 (select .cse5 .cse3)) (= .cse0 (select .cse5 .cse1)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_45|) 1) 1 0) 0))))) InVars {#race=|v_#race_811|, #memory_int=|v_#memory_int_445|, ~#m2~0.base=|v_~#m2~0.base_45|, ~#m2~0.offset=|v_~#m2~0.offset_45|} OutVars{#race=|v_#race_809|, 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_444|, ~#m2~0.base=|v_~#m2~0.base_45|, 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_45|, 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], [326#L793-2true, Black: 1085#true, 124#L734-4true, 1083#true, 1031#L785true, 1090#true, 1079#true, 1087#(= |#race~state~0| 0), 1077#true, 275#L723-2true, 1081#true]) [2025-03-14 01:19:35,725 INFO L294 olderBase$Statistics]: this new event has 737 ancestors and is cut-off event [2025-03-14 01:19:35,725 INFO L297 olderBase$Statistics]: existing Event has 723 ancestors and is cut-off event [2025-03-14 01:19:35,725 INFO L297 olderBase$Statistics]: existing Event has 737 ancestors and is cut-off event [2025-03-14 01:19:35,725 INFO L297 olderBase$Statistics]: existing Event has 723 ancestors and is cut-off event [2025-03-14 01:19:36,083 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4174] L784-3-->L785: Formula: (let ((.cse5 (select |v_#race_809| |v_~#m2~0.base_45|))) (let ((.cse2 (+ |v_~#m2~0.offset_45| 2)) (.cse3 (+ |v_~#m2~0.offset_45| 3)) (.cse0 (select .cse5 |v_~#m2~0.offset_45|)) (.cse1 (+ |v_~#m2~0.offset_45| 1)) (.cse4 (select |v_#memory_int_445| |v_~#m2~0.base_45|))) (and (= (store |v_#race_811| |v_~#m2~0.base_45| (store (store (store (store (select |v_#race_811| |v_~#m2~0.base_45|) |v_~#m2~0.offset_45| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0)) |v_#race_809|) (= (store |v_#memory_int_445| |v_~#m2~0.base_45| (store .cse4 |v_~#m2~0.offset_45| 0)) |v_#memory_int_444|) (= .cse0 (select .cse5 .cse2)) (= .cse0 (select .cse5 .cse3)) (= .cse0 (select .cse5 .cse1)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_45|) 1) 1 0) 0))))) InVars {#race=|v_#race_811|, #memory_int=|v_#memory_int_445|, ~#m2~0.base=|v_~#m2~0.base_45|, ~#m2~0.offset=|v_~#m2~0.offset_45|} OutVars{#race=|v_#race_809|, 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_444|, ~#m2~0.base=|v_~#m2~0.base_45|, 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_45|, 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], [57#L734-3true, 326#L793-2true, Black: 1085#true, 1083#true, 1031#L785true, 1090#true, 1079#true, 1087#(= |#race~state~0| 0), 1077#true, 275#L723-2true, 1081#true]) [2025-03-14 01:19:36,084 INFO L294 olderBase$Statistics]: this new event has 738 ancestors and is cut-off event [2025-03-14 01:19:36,084 INFO L297 olderBase$Statistics]: existing Event has 724 ancestors and is cut-off event [2025-03-14 01:19:36,084 INFO L297 olderBase$Statistics]: existing Event has 724 ancestors and is cut-off event [2025-03-14 01:19:36,084 INFO L297 olderBase$Statistics]: existing Event has 738 ancestors and is cut-off event [2025-03-14 01:19:36,527 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4174] L784-3-->L785: Formula: (let ((.cse5 (select |v_#race_809| |v_~#m2~0.base_45|))) (let ((.cse2 (+ |v_~#m2~0.offset_45| 2)) (.cse3 (+ |v_~#m2~0.offset_45| 3)) (.cse0 (select .cse5 |v_~#m2~0.offset_45|)) (.cse1 (+ |v_~#m2~0.offset_45| 1)) (.cse4 (select |v_#memory_int_445| |v_~#m2~0.base_45|))) (and (= (store |v_#race_811| |v_~#m2~0.base_45| (store (store (store (store (select |v_#race_811| |v_~#m2~0.base_45|) |v_~#m2~0.offset_45| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0)) |v_#race_809|) (= (store |v_#memory_int_445| |v_~#m2~0.base_45| (store .cse4 |v_~#m2~0.offset_45| 0)) |v_#memory_int_444|) (= .cse0 (select .cse5 .cse2)) (= .cse0 (select .cse5 .cse3)) (= .cse0 (select .cse5 .cse1)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_45|) 1) 1 0) 0))))) InVars {#race=|v_#race_811|, #memory_int=|v_#memory_int_445|, ~#m2~0.base=|v_~#m2~0.base_45|, ~#m2~0.offset=|v_~#m2~0.offset_45|} OutVars{#race=|v_#race_809|, 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_444|, ~#m2~0.base=|v_~#m2~0.base_45|, 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_45|, 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], [326#L793-2true, Black: 1085#true, 1083#true, 1031#L785true, 1090#true, 1079#true, 35#L734-2true, 1087#(= |#race~state~0| 0), 1077#true, 275#L723-2true, 1081#true]) [2025-03-14 01:19:36,527 INFO L294 olderBase$Statistics]: this new event has 739 ancestors and is cut-off event [2025-03-14 01:19:36,528 INFO L297 olderBase$Statistics]: existing Event has 725 ancestors and is cut-off event [2025-03-14 01:19:36,528 INFO L297 olderBase$Statistics]: existing Event has 739 ancestors and is cut-off event [2025-03-14 01:19:36,528 INFO L297 olderBase$Statistics]: existing Event has 725 ancestors and is cut-off event [2025-03-14 01:19:37,205 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4174] L784-3-->L785: Formula: (let ((.cse5 (select |v_#race_809| |v_~#m2~0.base_45|))) (let ((.cse2 (+ |v_~#m2~0.offset_45| 2)) (.cse3 (+ |v_~#m2~0.offset_45| 3)) (.cse0 (select .cse5 |v_~#m2~0.offset_45|)) (.cse1 (+ |v_~#m2~0.offset_45| 1)) (.cse4 (select |v_#memory_int_445| |v_~#m2~0.base_45|))) (and (= (store |v_#race_811| |v_~#m2~0.base_45| (store (store (store (store (select |v_#race_811| |v_~#m2~0.base_45|) |v_~#m2~0.offset_45| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0)) |v_#race_809|) (= (store |v_#memory_int_445| |v_~#m2~0.base_45| (store .cse4 |v_~#m2~0.offset_45| 0)) |v_#memory_int_444|) (= .cse0 (select .cse5 .cse2)) (= .cse0 (select .cse5 .cse3)) (= .cse0 (select .cse5 .cse1)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_45|) 1) 1 0) 0))))) InVars {#race=|v_#race_811|, #memory_int=|v_#memory_int_445|, ~#m2~0.base=|v_~#m2~0.base_45|, ~#m2~0.offset=|v_~#m2~0.offset_45|} OutVars{#race=|v_#race_809|, 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_444|, ~#m2~0.base=|v_~#m2~0.base_45|, 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_45|, 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], [326#L793-2true, Black: 1085#true, 1083#true, 823#L734true, 1031#L785true, 1090#true, 1079#true, 1087#(= |#race~state~0| 0), 1077#true, 275#L723-2true, 1081#true]) [2025-03-14 01:19:37,206 INFO L294 olderBase$Statistics]: this new event has 740 ancestors and is cut-off event [2025-03-14 01:19:37,206 INFO L297 olderBase$Statistics]: existing Event has 740 ancestors and is cut-off event [2025-03-14 01:19:37,206 INFO L297 olderBase$Statistics]: existing Event has 726 ancestors and is cut-off event [2025-03-14 01:19:37,206 INFO L297 olderBase$Statistics]: existing Event has 726 ancestors and is cut-off event [2025-03-14 01:19:37,509 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4174] L784-3-->L785: Formula: (let ((.cse5 (select |v_#race_809| |v_~#m2~0.base_45|))) (let ((.cse2 (+ |v_~#m2~0.offset_45| 2)) (.cse3 (+ |v_~#m2~0.offset_45| 3)) (.cse0 (select .cse5 |v_~#m2~0.offset_45|)) (.cse1 (+ |v_~#m2~0.offset_45| 1)) (.cse4 (select |v_#memory_int_445| |v_~#m2~0.base_45|))) (and (= (store |v_#race_811| |v_~#m2~0.base_45| (store (store (store (store (select |v_#race_811| |v_~#m2~0.base_45|) |v_~#m2~0.offset_45| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0)) |v_#race_809|) (= (store |v_#memory_int_445| |v_~#m2~0.base_45| (store .cse4 |v_~#m2~0.offset_45| 0)) |v_#memory_int_444|) (= .cse0 (select .cse5 .cse2)) (= .cse0 (select .cse5 .cse3)) (= .cse0 (select .cse5 .cse1)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_45|) 1) 1 0) 0))))) InVars {#race=|v_#race_811|, #memory_int=|v_#memory_int_445|, ~#m2~0.base=|v_~#m2~0.base_45|, ~#m2~0.offset=|v_~#m2~0.offset_45|} OutVars{#race=|v_#race_809|, 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_444|, ~#m2~0.base=|v_~#m2~0.base_45|, 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_45|, 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], [326#L793-2true, Black: 1085#true, 37#L734-1true, 1083#true, 1031#L785true, 1090#true, 1079#true, 1087#(= |#race~state~0| 0), 1077#true, 275#L723-2true, 1081#true]) [2025-03-14 01:19:37,509 INFO L294 olderBase$Statistics]: this new event has 741 ancestors and is cut-off event [2025-03-14 01:19:37,509 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-03-14 01:19:37,509 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-03-14 01:19:37,509 INFO L297 olderBase$Statistics]: existing Event has 741 ancestors and is cut-off event [2025-03-14 01:19:37,510 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4174] L784-3-->L785: Formula: (let ((.cse5 (select |v_#race_809| |v_~#m2~0.base_45|))) (let ((.cse2 (+ |v_~#m2~0.offset_45| 2)) (.cse3 (+ |v_~#m2~0.offset_45| 3)) (.cse0 (select .cse5 |v_~#m2~0.offset_45|)) (.cse1 (+ |v_~#m2~0.offset_45| 1)) (.cse4 (select |v_#memory_int_445| |v_~#m2~0.base_45|))) (and (= (store |v_#race_811| |v_~#m2~0.base_45| (store (store (store (store (select |v_#race_811| |v_~#m2~0.base_45|) |v_~#m2~0.offset_45| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0)) |v_#race_809|) (= (store |v_#memory_int_445| |v_~#m2~0.base_45| (store .cse4 |v_~#m2~0.offset_45| 0)) |v_#memory_int_444|) (= .cse0 (select .cse5 .cse2)) (= .cse0 (select .cse5 .cse3)) (= .cse0 (select .cse5 .cse1)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_45|) 1) 1 0) 0))))) InVars {#race=|v_#race_811|, #memory_int=|v_#memory_int_445|, ~#m2~0.base=|v_~#m2~0.base_45|, ~#m2~0.offset=|v_~#m2~0.offset_45|} OutVars{#race=|v_#race_809|, 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_444|, ~#m2~0.base=|v_~#m2~0.base_45|, 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_45|, 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], [326#L793-2true, Black: 1085#true, 37#L734-1true, 1083#true, 1031#L785true, 1090#true, 1079#true, 1087#(= |#race~state~0| 0), 1077#true, 275#L723-2true, 1081#true]) [2025-03-14 01:19:37,510 INFO L294 olderBase$Statistics]: this new event has 741 ancestors and is cut-off event [2025-03-14 01:19:37,510 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-03-14 01:19:37,510 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-03-14 01:19:37,510 INFO L297 olderBase$Statistics]: existing Event has 741 ancestors and is cut-off event [2025-03-14 01:19:37,510 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4174] L784-3-->L785: Formula: (let ((.cse5 (select |v_#race_809| |v_~#m2~0.base_45|))) (let ((.cse2 (+ |v_~#m2~0.offset_45| 2)) (.cse3 (+ |v_~#m2~0.offset_45| 3)) (.cse0 (select .cse5 |v_~#m2~0.offset_45|)) (.cse1 (+ |v_~#m2~0.offset_45| 1)) (.cse4 (select |v_#memory_int_445| |v_~#m2~0.base_45|))) (and (= (store |v_#race_811| |v_~#m2~0.base_45| (store (store (store (store (select |v_#race_811| |v_~#m2~0.base_45|) |v_~#m2~0.offset_45| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0)) |v_#race_809|) (= (store |v_#memory_int_445| |v_~#m2~0.base_45| (store .cse4 |v_~#m2~0.offset_45| 0)) |v_#memory_int_444|) (= .cse0 (select .cse5 .cse2)) (= .cse0 (select .cse5 .cse3)) (= .cse0 (select .cse5 .cse1)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_45|) 1) 1 0) 0))))) InVars {#race=|v_#race_811|, #memory_int=|v_#memory_int_445|, ~#m2~0.base=|v_~#m2~0.base_45|, ~#m2~0.offset=|v_~#m2~0.offset_45|} OutVars{#race=|v_#race_809|, 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_444|, ~#m2~0.base=|v_~#m2~0.base_45|, 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_45|, 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], [326#L793-2true, Black: 1085#true, 832#thr1Err22ASSERT_VIOLATIONDATA_RACEtrue, 1083#true, 1031#L785true, 1090#true, 1079#true, 1087#(= |#race~state~0| 0), 1077#true, 275#L723-2true, 1081#true]) [2025-03-14 01:19:37,510 INFO L294 olderBase$Statistics]: this new event has 741 ancestors and is cut-off event [2025-03-14 01:19:37,510 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-03-14 01:19:37,510 INFO L297 olderBase$Statistics]: existing Event has 741 ancestors and is cut-off event [2025-03-14 01:19:37,510 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-03-14 01:19:37,514 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4174] L784-3-->L785: Formula: (let ((.cse5 (select |v_#race_809| |v_~#m2~0.base_45|))) (let ((.cse2 (+ |v_~#m2~0.offset_45| 2)) (.cse3 (+ |v_~#m2~0.offset_45| 3)) (.cse0 (select .cse5 |v_~#m2~0.offset_45|)) (.cse1 (+ |v_~#m2~0.offset_45| 1)) (.cse4 (select |v_#memory_int_445| |v_~#m2~0.base_45|))) (and (= (store |v_#race_811| |v_~#m2~0.base_45| (store (store (store (store (select |v_#race_811| |v_~#m2~0.base_45|) |v_~#m2~0.offset_45| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0)) |v_#race_809|) (= (store |v_#memory_int_445| |v_~#m2~0.base_45| (store .cse4 |v_~#m2~0.offset_45| 0)) |v_#memory_int_444|) (= .cse0 (select .cse5 .cse2)) (= .cse0 (select .cse5 .cse3)) (= .cse0 (select .cse5 .cse1)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_45|) 1) 1 0) 0))))) InVars {#race=|v_#race_811|, #memory_int=|v_#memory_int_445|, ~#m2~0.base=|v_~#m2~0.base_45|, ~#m2~0.offset=|v_~#m2~0.offset_45|} OutVars{#race=|v_#race_809|, 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_444|, ~#m2~0.base=|v_~#m2~0.base_45|, 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_45|, 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], [326#L793-2true, Black: 1085#true, 124#L734-4true, 1083#true, 1031#L785true, 1090#true, 1079#true, 1087#(= |#race~state~0| 0), 1077#true, 97#L725true, 1081#true]) [2025-03-14 01:19:37,514 INFO L294 olderBase$Statistics]: this new event has 741 ancestors and is cut-off event [2025-03-14 01:19:37,514 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-03-14 01:19:37,514 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-03-14 01:19:37,514 INFO L297 olderBase$Statistics]: existing Event has 741 ancestors and is cut-off event [2025-03-14 01:19:37,794 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4174] L784-3-->L785: Formula: (let ((.cse5 (select |v_#race_809| |v_~#m2~0.base_45|))) (let ((.cse2 (+ |v_~#m2~0.offset_45| 2)) (.cse3 (+ |v_~#m2~0.offset_45| 3)) (.cse0 (select .cse5 |v_~#m2~0.offset_45|)) (.cse1 (+ |v_~#m2~0.offset_45| 1)) (.cse4 (select |v_#memory_int_445| |v_~#m2~0.base_45|))) (and (= (store |v_#race_811| |v_~#m2~0.base_45| (store (store (store (store (select |v_#race_811| |v_~#m2~0.base_45|) |v_~#m2~0.offset_45| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0)) |v_#race_809|) (= (store |v_#memory_int_445| |v_~#m2~0.base_45| (store .cse4 |v_~#m2~0.offset_45| 0)) |v_#memory_int_444|) (= .cse0 (select .cse5 .cse2)) (= .cse0 (select .cse5 .cse3)) (= .cse0 (select .cse5 .cse1)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_45|) 1) 1 0) 0))))) InVars {#race=|v_#race_811|, #memory_int=|v_#memory_int_445|, ~#m2~0.base=|v_~#m2~0.base_45|, ~#m2~0.offset=|v_~#m2~0.offset_45|} OutVars{#race=|v_#race_809|, 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_444|, ~#m2~0.base=|v_~#m2~0.base_45|, 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_45|, 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], [Black: 1085#true, 326#L793-2true, 1083#true, 1031#L785true, 1090#true, 482#EBStack_init_returnLabel#1true, 1079#true, 1087#(= |#race~state~0| 0), 1077#true, 275#L723-2true, 1081#true]) [2025-03-14 01:19:37,794 INFO L294 olderBase$Statistics]: this new event has 742 ancestors and is cut-off event [2025-03-14 01:19:37,794 INFO L297 olderBase$Statistics]: existing Event has 742 ancestors and is cut-off event [2025-03-14 01:19:37,794 INFO L297 olderBase$Statistics]: existing Event has 728 ancestors and is cut-off event [2025-03-14 01:19:37,794 INFO L297 olderBase$Statistics]: existing Event has 728 ancestors and is cut-off event [2025-03-14 01:19:37,797 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4174] L784-3-->L785: Formula: (let ((.cse5 (select |v_#race_809| |v_~#m2~0.base_45|))) (let ((.cse2 (+ |v_~#m2~0.offset_45| 2)) (.cse3 (+ |v_~#m2~0.offset_45| 3)) (.cse0 (select .cse5 |v_~#m2~0.offset_45|)) (.cse1 (+ |v_~#m2~0.offset_45| 1)) (.cse4 (select |v_#memory_int_445| |v_~#m2~0.base_45|))) (and (= (store |v_#race_811| |v_~#m2~0.base_45| (store (store (store (store (select |v_#race_811| |v_~#m2~0.base_45|) |v_~#m2~0.offset_45| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0)) |v_#race_809|) (= (store |v_#memory_int_445| |v_~#m2~0.base_45| (store .cse4 |v_~#m2~0.offset_45| 0)) |v_#memory_int_444|) (= .cse0 (select .cse5 .cse2)) (= .cse0 (select .cse5 .cse3)) (= .cse0 (select .cse5 .cse1)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_45|) 1) 1 0) 0))))) InVars {#race=|v_#race_811|, #memory_int=|v_#memory_int_445|, ~#m2~0.base=|v_~#m2~0.base_45|, ~#m2~0.offset=|v_~#m2~0.offset_45|} OutVars{#race=|v_#race_809|, 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_444|, ~#m2~0.base=|v_~#m2~0.base_45|, 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_45|, 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], [326#L793-2true, Black: 1085#true, 57#L734-3true, 1083#true, 1031#L785true, 1090#true, 1079#true, 1087#(= |#race~state~0| 0), 1077#true, 97#L725true, 1081#true]) [2025-03-14 01:19:37,798 INFO L294 olderBase$Statistics]: this new event has 742 ancestors and is cut-off event [2025-03-14 01:19:37,798 INFO L297 olderBase$Statistics]: existing Event has 728 ancestors and is cut-off event [2025-03-14 01:19:37,798 INFO L297 olderBase$Statistics]: existing Event has 728 ancestors and is cut-off event [2025-03-14 01:19:37,798 INFO L297 olderBase$Statistics]: existing Event has 742 ancestors and is cut-off event [2025-03-14 01:19:38,274 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4174] L784-3-->L785: Formula: (let ((.cse5 (select |v_#race_809| |v_~#m2~0.base_45|))) (let ((.cse2 (+ |v_~#m2~0.offset_45| 2)) (.cse3 (+ |v_~#m2~0.offset_45| 3)) (.cse0 (select .cse5 |v_~#m2~0.offset_45|)) (.cse1 (+ |v_~#m2~0.offset_45| 1)) (.cse4 (select |v_#memory_int_445| |v_~#m2~0.base_45|))) (and (= (store |v_#race_811| |v_~#m2~0.base_45| (store (store (store (store (select |v_#race_811| |v_~#m2~0.base_45|) |v_~#m2~0.offset_45| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0)) |v_#race_809|) (= (store |v_#memory_int_445| |v_~#m2~0.base_45| (store .cse4 |v_~#m2~0.offset_45| 0)) |v_#memory_int_444|) (= .cse0 (select .cse5 .cse2)) (= .cse0 (select .cse5 .cse3)) (= .cse0 (select .cse5 .cse1)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_45|) 1) 1 0) 0))))) InVars {#race=|v_#race_811|, #memory_int=|v_#memory_int_445|, ~#m2~0.base=|v_~#m2~0.base_45|, ~#m2~0.offset=|v_~#m2~0.offset_45|} OutVars{#race=|v_#race_809|, 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_444|, ~#m2~0.base=|v_~#m2~0.base_45|, 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_45|, 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], [Black: 1085#true, 326#L793-2true, 652#L781true, 1083#true, 1031#L785true, 1090#true, 1079#true, 1087#(= |#race~state~0| 0), 1077#true, 275#L723-2true, 1081#true]) [2025-03-14 01:19:38,274 INFO L294 olderBase$Statistics]: this new event has 743 ancestors and is cut-off event [2025-03-14 01:19:38,274 INFO L297 olderBase$Statistics]: existing Event has 729 ancestors and is cut-off event [2025-03-14 01:19:38,274 INFO L297 olderBase$Statistics]: existing Event has 743 ancestors and is cut-off event [2025-03-14 01:19:38,274 INFO L297 olderBase$Statistics]: existing Event has 729 ancestors and is cut-off event [2025-03-14 01:19:38,277 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4174] L784-3-->L785: Formula: (let ((.cse5 (select |v_#race_809| |v_~#m2~0.base_45|))) (let ((.cse2 (+ |v_~#m2~0.offset_45| 2)) (.cse3 (+ |v_~#m2~0.offset_45| 3)) (.cse0 (select .cse5 |v_~#m2~0.offset_45|)) (.cse1 (+ |v_~#m2~0.offset_45| 1)) (.cse4 (select |v_#memory_int_445| |v_~#m2~0.base_45|))) (and (= (store |v_#race_811| |v_~#m2~0.base_45| (store (store (store (store (select |v_#race_811| |v_~#m2~0.base_45|) |v_~#m2~0.offset_45| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0)) |v_#race_809|) (= (store |v_#memory_int_445| |v_~#m2~0.base_45| (store .cse4 |v_~#m2~0.offset_45| 0)) |v_#memory_int_444|) (= .cse0 (select .cse5 .cse2)) (= .cse0 (select .cse5 .cse3)) (= .cse0 (select .cse5 .cse1)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_45|) 1) 1 0) 0))))) InVars {#race=|v_#race_811|, #memory_int=|v_#memory_int_445|, ~#m2~0.base=|v_~#m2~0.base_45|, ~#m2~0.offset=|v_~#m2~0.offset_45|} OutVars{#race=|v_#race_809|, 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_444|, ~#m2~0.base=|v_~#m2~0.base_45|, 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_45|, 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], [326#L793-2true, Black: 1085#true, 1083#true, 1031#L785true, 1090#true, 1079#true, 35#L734-2true, 1087#(= |#race~state~0| 0), 1077#true, 97#L725true, 1081#true]) [2025-03-14 01:19:38,277 INFO L294 olderBase$Statistics]: this new event has 743 ancestors and is cut-off event [2025-03-14 01:19:38,277 INFO L297 olderBase$Statistics]: existing Event has 743 ancestors and is cut-off event [2025-03-14 01:19:38,277 INFO L297 olderBase$Statistics]: existing Event has 729 ancestors and is cut-off event [2025-03-14 01:19:38,277 INFO L297 olderBase$Statistics]: existing Event has 729 ancestors and is cut-off event [2025-03-14 01:19:38,611 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4174] L784-3-->L785: Formula: (let ((.cse5 (select |v_#race_809| |v_~#m2~0.base_45|))) (let ((.cse2 (+ |v_~#m2~0.offset_45| 2)) (.cse3 (+ |v_~#m2~0.offset_45| 3)) (.cse0 (select .cse5 |v_~#m2~0.offset_45|)) (.cse1 (+ |v_~#m2~0.offset_45| 1)) (.cse4 (select |v_#memory_int_445| |v_~#m2~0.base_45|))) (and (= (store |v_#race_811| |v_~#m2~0.base_45| (store (store (store (store (select |v_#race_811| |v_~#m2~0.base_45|) |v_~#m2~0.offset_45| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0)) |v_#race_809|) (= (store |v_#memory_int_445| |v_~#m2~0.base_45| (store .cse4 |v_~#m2~0.offset_45| 0)) |v_#memory_int_444|) (= .cse0 (select .cse5 .cse2)) (= .cse0 (select .cse5 .cse3)) (= .cse0 (select .cse5 .cse1)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_45|) 1) 1 0) 0))))) InVars {#race=|v_#race_811|, #memory_int=|v_#memory_int_445|, ~#m2~0.base=|v_~#m2~0.base_45|, ~#m2~0.offset=|v_~#m2~0.offset_45|} OutVars{#race=|v_#race_809|, 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_444|, ~#m2~0.base=|v_~#m2~0.base_45|, 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_45|, 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], [326#L793-2true, Black: 1085#true, 1083#true, 823#L734true, 1031#L785true, 1090#true, 1079#true, 1087#(= |#race~state~0| 0), 1077#true, 97#L725true, 1081#true]) [2025-03-14 01:19:38,612 INFO L294 olderBase$Statistics]: this new event has 744 ancestors and is cut-off event [2025-03-14 01:19:38,612 INFO L297 olderBase$Statistics]: existing Event has 744 ancestors and is cut-off event [2025-03-14 01:19:38,612 INFO L297 olderBase$Statistics]: existing Event has 730 ancestors and is cut-off event [2025-03-14 01:19:38,612 INFO L297 olderBase$Statistics]: existing Event has 730 ancestors and is cut-off event [2025-03-14 01:19:38,932 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4174] L784-3-->L785: Formula: (let ((.cse5 (select |v_#race_809| |v_~#m2~0.base_45|))) (let ((.cse2 (+ |v_~#m2~0.offset_45| 2)) (.cse3 (+ |v_~#m2~0.offset_45| 3)) (.cse0 (select .cse5 |v_~#m2~0.offset_45|)) (.cse1 (+ |v_~#m2~0.offset_45| 1)) (.cse4 (select |v_#memory_int_445| |v_~#m2~0.base_45|))) (and (= (store |v_#race_811| |v_~#m2~0.base_45| (store (store (store (store (select |v_#race_811| |v_~#m2~0.base_45|) |v_~#m2~0.offset_45| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0)) |v_#race_809|) (= (store |v_#memory_int_445| |v_~#m2~0.base_45| (store .cse4 |v_~#m2~0.offset_45| 0)) |v_#memory_int_444|) (= .cse0 (select .cse5 .cse2)) (= .cse0 (select .cse5 .cse3)) (= .cse0 (select .cse5 .cse1)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_45|) 1) 1 0) 0))))) InVars {#race=|v_#race_811|, #memory_int=|v_#memory_int_445|, ~#m2~0.base=|v_~#m2~0.base_45|, ~#m2~0.offset=|v_~#m2~0.offset_45|} OutVars{#race=|v_#race_809|, 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_444|, ~#m2~0.base=|v_~#m2~0.base_45|, 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_45|, 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], [326#L793-2true, Black: 1085#true, 37#L734-1true, 1083#true, 1031#L785true, 1090#true, 1079#true, 1087#(= |#race~state~0| 0), 1077#true, 97#L725true, 1081#true]) [2025-03-14 01:19:38,932 INFO L294 olderBase$Statistics]: this new event has 745 ancestors and is cut-off event [2025-03-14 01:19:38,932 INFO L297 olderBase$Statistics]: existing Event has 745 ancestors and is cut-off event [2025-03-14 01:19:38,932 INFO L297 olderBase$Statistics]: existing Event has 731 ancestors and is cut-off event [2025-03-14 01:19:38,932 INFO L297 olderBase$Statistics]: existing Event has 731 ancestors and is cut-off event [2025-03-14 01:19:38,932 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4174] L784-3-->L785: Formula: (let ((.cse5 (select |v_#race_809| |v_~#m2~0.base_45|))) (let ((.cse2 (+ |v_~#m2~0.offset_45| 2)) (.cse3 (+ |v_~#m2~0.offset_45| 3)) (.cse0 (select .cse5 |v_~#m2~0.offset_45|)) (.cse1 (+ |v_~#m2~0.offset_45| 1)) (.cse4 (select |v_#memory_int_445| |v_~#m2~0.base_45|))) (and (= (store |v_#race_811| |v_~#m2~0.base_45| (store (store (store (store (select |v_#race_811| |v_~#m2~0.base_45|) |v_~#m2~0.offset_45| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0)) |v_#race_809|) (= (store |v_#memory_int_445| |v_~#m2~0.base_45| (store .cse4 |v_~#m2~0.offset_45| 0)) |v_#memory_int_444|) (= .cse0 (select .cse5 .cse2)) (= .cse0 (select .cse5 .cse3)) (= .cse0 (select .cse5 .cse1)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_45|) 1) 1 0) 0))))) InVars {#race=|v_#race_811|, #memory_int=|v_#memory_int_445|, ~#m2~0.base=|v_~#m2~0.base_45|, ~#m2~0.offset=|v_~#m2~0.offset_45|} OutVars{#race=|v_#race_809|, 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_444|, ~#m2~0.base=|v_~#m2~0.base_45|, 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_45|, 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], [326#L793-2true, Black: 1085#true, 37#L734-1true, 1083#true, 1031#L785true, 1090#true, 1079#true, 1087#(= |#race~state~0| 0), 1077#true, 97#L725true, 1081#true]) [2025-03-14 01:19:38,932 INFO L294 olderBase$Statistics]: this new event has 745 ancestors and is cut-off event [2025-03-14 01:19:38,932 INFO L297 olderBase$Statistics]: existing Event has 731 ancestors and is cut-off event [2025-03-14 01:19:38,932 INFO L297 olderBase$Statistics]: existing Event has 731 ancestors and is cut-off event [2025-03-14 01:19:38,932 INFO L297 olderBase$Statistics]: existing Event has 745 ancestors and is cut-off event [2025-03-14 01:19:38,933 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4174] L784-3-->L785: Formula: (let ((.cse5 (select |v_#race_809| |v_~#m2~0.base_45|))) (let ((.cse2 (+ |v_~#m2~0.offset_45| 2)) (.cse3 (+ |v_~#m2~0.offset_45| 3)) (.cse0 (select .cse5 |v_~#m2~0.offset_45|)) (.cse1 (+ |v_~#m2~0.offset_45| 1)) (.cse4 (select |v_#memory_int_445| |v_~#m2~0.base_45|))) (and (= (store |v_#race_811| |v_~#m2~0.base_45| (store (store (store (store (select |v_#race_811| |v_~#m2~0.base_45|) |v_~#m2~0.offset_45| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0)) |v_#race_809|) (= (store |v_#memory_int_445| |v_~#m2~0.base_45| (store .cse4 |v_~#m2~0.offset_45| 0)) |v_#memory_int_444|) (= .cse0 (select .cse5 .cse2)) (= .cse0 (select .cse5 .cse3)) (= .cse0 (select .cse5 .cse1)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_45|) 1) 1 0) 0))))) InVars {#race=|v_#race_811|, #memory_int=|v_#memory_int_445|, ~#m2~0.base=|v_~#m2~0.base_45|, ~#m2~0.offset=|v_~#m2~0.offset_45|} OutVars{#race=|v_#race_809|, 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_444|, ~#m2~0.base=|v_~#m2~0.base_45|, 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_45|, 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], [326#L793-2true, Black: 1085#true, 832#thr1Err22ASSERT_VIOLATIONDATA_RACEtrue, 1083#true, 1031#L785true, 1090#true, 1079#true, 1087#(= |#race~state~0| 0), 1077#true, 97#L725true, 1081#true]) [2025-03-14 01:19:38,933 INFO L294 olderBase$Statistics]: this new event has 745 ancestors and is cut-off event [2025-03-14 01:19:38,933 INFO L297 olderBase$Statistics]: existing Event has 731 ancestors and is cut-off event [2025-03-14 01:19:38,933 INFO L297 olderBase$Statistics]: existing Event has 731 ancestors and is cut-off event [2025-03-14 01:19:38,933 INFO L297 olderBase$Statistics]: existing Event has 745 ancestors and is cut-off event [2025-03-14 01:19:39,259 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4174] L784-3-->L785: Formula: (let ((.cse5 (select |v_#race_809| |v_~#m2~0.base_45|))) (let ((.cse2 (+ |v_~#m2~0.offset_45| 2)) (.cse3 (+ |v_~#m2~0.offset_45| 3)) (.cse0 (select .cse5 |v_~#m2~0.offset_45|)) (.cse1 (+ |v_~#m2~0.offset_45| 1)) (.cse4 (select |v_#memory_int_445| |v_~#m2~0.base_45|))) (and (= (store |v_#race_811| |v_~#m2~0.base_45| (store (store (store (store (select |v_#race_811| |v_~#m2~0.base_45|) |v_~#m2~0.offset_45| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0)) |v_#race_809|) (= (store |v_#memory_int_445| |v_~#m2~0.base_45| (store .cse4 |v_~#m2~0.offset_45| 0)) |v_#memory_int_444|) (= .cse0 (select .cse5 .cse2)) (= .cse0 (select .cse5 .cse3)) (= .cse0 (select .cse5 .cse1)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_45|) 1) 1 0) 0))))) InVars {#race=|v_#race_811|, #memory_int=|v_#memory_int_445|, ~#m2~0.base=|v_~#m2~0.base_45|, ~#m2~0.offset=|v_~#m2~0.offset_45|} OutVars{#race=|v_#race_809|, 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_444|, ~#m2~0.base=|v_~#m2~0.base_45|, 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_45|, 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], [Black: 1085#true, 326#L793-2true, 1083#true, 1031#L785true, 482#EBStack_init_returnLabel#1true, 1090#true, 1079#true, 1087#(= |#race~state~0| 0), 1077#true, 97#L725true, 1081#true]) [2025-03-14 01:19:39,259 INFO L294 olderBase$Statistics]: this new event has 746 ancestors and is cut-off event [2025-03-14 01:19:39,259 INFO L297 olderBase$Statistics]: existing Event has 732 ancestors and is cut-off event [2025-03-14 01:19:39,259 INFO L297 olderBase$Statistics]: existing Event has 732 ancestors and is cut-off event [2025-03-14 01:19:39,259 INFO L297 olderBase$Statistics]: existing Event has 746 ancestors and is cut-off event [2025-03-14 01:19:39,813 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4174] L784-3-->L785: Formula: (let ((.cse5 (select |v_#race_809| |v_~#m2~0.base_45|))) (let ((.cse2 (+ |v_~#m2~0.offset_45| 2)) (.cse3 (+ |v_~#m2~0.offset_45| 3)) (.cse0 (select .cse5 |v_~#m2~0.offset_45|)) (.cse1 (+ |v_~#m2~0.offset_45| 1)) (.cse4 (select |v_#memory_int_445| |v_~#m2~0.base_45|))) (and (= (store |v_#race_811| |v_~#m2~0.base_45| (store (store (store (store (select |v_#race_811| |v_~#m2~0.base_45|) |v_~#m2~0.offset_45| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0)) |v_#race_809|) (= (store |v_#memory_int_445| |v_~#m2~0.base_45| (store .cse4 |v_~#m2~0.offset_45| 0)) |v_#memory_int_444|) (= .cse0 (select .cse5 .cse2)) (= .cse0 (select .cse5 .cse3)) (= .cse0 (select .cse5 .cse1)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_45|) 1) 1 0) 0))))) InVars {#race=|v_#race_811|, #memory_int=|v_#memory_int_445|, ~#m2~0.base=|v_~#m2~0.base_45|, ~#m2~0.offset=|v_~#m2~0.offset_45|} OutVars{#race=|v_#race_809|, 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_444|, ~#m2~0.base=|v_~#m2~0.base_45|, 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_45|, 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], [Black: 1085#true, 326#L793-2true, 652#L781true, 1083#true, 1031#L785true, 1090#true, 1079#true, 1087#(= |#race~state~0| 0), 1077#true, 97#L725true, 1081#true]) [2025-03-14 01:19:39,813 INFO L294 olderBase$Statistics]: this new event has 747 ancestors and is cut-off event [2025-03-14 01:19:39,813 INFO L297 olderBase$Statistics]: existing Event has 747 ancestors and is cut-off event [2025-03-14 01:19:39,813 INFO L297 olderBase$Statistics]: existing Event has 733 ancestors and is cut-off event [2025-03-14 01:19:39,813 INFO L297 olderBase$Statistics]: existing Event has 733 ancestors and is cut-off event