./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-ext/26_stack_cas_longer-1-race.i --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for data races
Using default analysis
Version 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-1-race.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 e12b29ddb474fc17e74c2b71eb245022640b1de10fdbbb130c7f22e13cd3653f
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-735b3cc-m
[2025-03-14 01:18:47,177 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-14 01:18:47,225 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:47,231 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-14 01:18:47,231 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-14 01:18:47,253 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-14 01:18:47,254 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-14 01:18:47,254 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-14 01:18:47,254 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-14 01:18:47,254 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-14 01:18:47,255 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-14 01:18:47,255 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-14 01:18:47,255 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-14 01:18:47,255 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-14 01:18:47,255 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-14 01:18:47,255 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-14 01:18:47,255 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-14 01:18:47,255 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-14 01:18:47,255 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-14 01:18:47,255 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-14 01:18:47,255 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-14 01:18:47,255 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-14 01:18:47,255 INFO  L153        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2025-03-14 01:18:47,255 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2025-03-14 01:18:47,255 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-14 01:18:47,256 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-14 01:18:47,256 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-14 01:18:47,256 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-14 01:18:47,256 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-14 01:18:47,256 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-14 01:18:47,257 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-14 01:18:47,257 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-14 01:18:47,257 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-14 01:18:47,257 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-14 01:18:47,257 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-14 01:18:47,257 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-14 01:18:47,257 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-14 01:18:47,257 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-14 01:18:47,257 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-14 01:18:47,257 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-14 01:18:47,257 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-14 01:18:47,257 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-14 01:18:47,257 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 -> e12b29ddb474fc17e74c2b71eb245022640b1de10fdbbb130c7f22e13cd3653f
[2025-03-14 01:18:47,480 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-14 01:18:47,488 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-14 01:18:47,490 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-14 01:18:47,491 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-14 01:18:47,491 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-14 01:18:47,492 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-1-race.i
[2025-03-14 01:18:48,589 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa7494f16/7873f6adadf74d168029c5b11d3b7b2c/FLAG6f6541dec
[2025-03-14 01:18:48,845 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-14 01:18:48,846 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/26_stack_cas_longer-1-race.i
[2025-03-14 01:18:48,859 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa7494f16/7873f6adadf74d168029c5b11d3b7b2c/FLAG6f6541dec
[2025-03-14 01:18:49,159 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa7494f16/7873f6adadf74d168029c5b11d3b7b2c
[2025-03-14 01:18:49,161 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-14 01:18:49,162 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-14 01:18:49,164 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-14 01:18:49,165 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-14 01:18:49,168 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-14 01:18:49,168 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:18:49" (1/1) ...
[2025-03-14 01:18:49,169 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@136f25bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:18:49, skipping insertion in model container
[2025-03-14 01:18:49,169 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:18:49" (1/1) ...
[2025-03-14 01:18:49,196 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-14 01:18:49,481 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-14 01:18:49,509 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-14 01:18:49,544 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-14 01:18:49,579 INFO  L204         MainTranslator]: Completed translation
[2025-03-14 01:18:49,579 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:18:49 WrapperNode
[2025-03-14 01:18:49,581 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-14 01:18:49,582 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-14 01:18:49,582 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-14 01:18:49,582 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-14 01:18:49,587 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:49" (1/1) ...
[2025-03-14 01:18:49,617 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:49" (1/1) ...
[2025-03-14 01:18:49,661 INFO  L138                Inliner]: procedures = 177, calls = 45, calls flagged for inlining = 17, calls inlined = 20, statements flattened = 952
[2025-03-14 01:18:49,662 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-14 01:18:49,662 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-14 01:18:49,662 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-14 01:18:49,662 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-14 01:18:49,676 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:49" (1/1) ...
[2025-03-14 01:18:49,679 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:49" (1/1) ...
[2025-03-14 01:18:49,684 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:49" (1/1) ...
[2025-03-14 01:18:49,684 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:49" (1/1) ...
[2025-03-14 01:18:49,709 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:49" (1/1) ...
[2025-03-14 01:18:49,713 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:49" (1/1) ...
[2025-03-14 01:18:49,720 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:49" (1/1) ...
[2025-03-14 01:18:49,725 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:49" (1/1) ...
[2025-03-14 01:18:49,735 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-14 01:18:49,735 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-14 01:18:49,736 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-14 01:18:49,736 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-14 01:18:49,736 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:18:49" (1/1) ...
[2025-03-14 01:18:49,740 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-14 01:18:49,749 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-14 01:18:49,762 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:49,764 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:49,786 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2025-03-14 01:18:49,786 INFO  L130     BoogieDeclarations]: Found specification of procedure thr1
[2025-03-14 01:18:49,786 INFO  L138     BoogieDeclarations]: Found implementation of procedure thr1
[2025-03-14 01:18:49,786 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2025-03-14 01:18:49,786 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-14 01:18:49,786 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2025-03-14 01:18:49,786 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2025-03-14 01:18:49,786 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2025-03-14 01:18:49,786 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-14 01:18:49,787 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-14 01:18:49,788 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:49,906 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-14 01:18:49,908 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-14 01:18:50,841 INFO  L303             CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2025-03-14 01:18:50,842 INFO  L313             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-14 01:18:50,843 INFO  L318             CfgBuilder]: Performing block encoding
[2025-03-14 01:18:51,142 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-14 01:18:51,145 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:18:51 BoogieIcfgContainer
[2025-03-14 01:18:51,145 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-14 01:18:51,147 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-14 01:18:51,147 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-14 01:18:51,150 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-14 01:18:51,150 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:18:49" (1/3) ...
[2025-03-14 01:18:51,150 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cf33247 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:18:51, skipping insertion in model container
[2025-03-14 01:18:51,151 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:18:49" (2/3) ...
[2025-03-14 01:18:51,151 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cf33247 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:18:51, skipping insertion in model container
[2025-03-14 01:18:51,151 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:18:51" (3/3) ...
[2025-03-14 01:18:51,152 INFO  L128   eAbstractionObserver]: Analyzing ICFG 26_stack_cas_longer-1-race.i
[2025-03-14 01:18:51,163 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-14 01:18:51,164 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG 26_stack_cas_longer-1-race.i that has 2 procedures, 812 locations, 1 initial locations, 3 loop locations, and 26 error locations.
[2025-03-14 01:18:51,164 INFO  L491   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2025-03-14 01:18:51,256 INFO  L143    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2025-03-14 01:18:51,292 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 815 places, 820 transitions, 1644 flow
[2025-03-14 01:18:51,523 INFO  L124   PetriNetUnfolderBase]: 8/827 cut-off events.
[2025-03-14 01:18:51,525 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2025-03-14 01:18:51,530 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 831 conditions, 827 events. 8/827 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 251 event pairs, 0 based on Foata normal form. 0/791 useless extension candidates. Maximal degree in co-relation 157. Up to 3 conditions per place. 
[2025-03-14 01:18:51,531 INFO  L82        GeneralOperation]: Start removeDead. Operand has 815 places, 820 transitions, 1644 flow
[2025-03-14 01:18:51,541 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 815 places, 820 transitions, 1644 flow
[2025-03-14 01:18:51,546 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-14 01:18:51,557 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;@2f336a4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-14 01:18:51,557 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 53 error locations.
[2025-03-14 01:18:51,630 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2025-03-14 01:18:51,630 INFO  L124   PetriNetUnfolderBase]: 0/671 cut-off events.
[2025-03-14 01:18:51,630 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2025-03-14 01:18:51,630 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-14 01:18:51,631 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:51,632 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:51,639 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-14 01:18:51,639 INFO  L85        PathProgramCache]: Analyzing trace with hash -15265529, now seen corresponding path program 1 times
[2025-03-14 01:18:51,644 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-14 01:18:51,645 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070808600]
[2025-03-14 01:18:51,645 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-14 01:18:51,647 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-14 01:18:51,832 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 667 statements into 1 equivalence classes.
[2025-03-14 01:18:52,184 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 667 of 667 statements.
[2025-03-14 01:18:52,184 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-14 01:18:52,184 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-14 01:18:54,098 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:18:54,099 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-14 01:18:54,101 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070808600]
[2025-03-14 01:18:54,102 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070808600] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-14 01:18:54,102 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-14 01:18:54,102 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2025-03-14 01:18:54,103 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4014769]
[2025-03-14 01:18:54,104 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-14 01:18:54,113 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-03-14 01:18:54,118 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-14 01:18:54,131 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-03-14 01:18:54,132 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-14 01:18:54,135 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 793 out of 820
[2025-03-14 01:18:54,139 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 815 places, 820 transitions, 1644 flow. Second operand  has 2 states, 2 states have (on average 794.0) internal successors, (1588), 2 states have internal predecessors, (1588), 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:18:54,139 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-14 01:18:54,139 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 793 of 820
[2025-03-14 01:18:54,142 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-14 01:18:54,371 INFO  L124   PetriNetUnfolderBase]: 6/799 cut-off events.
[2025-03-14 01:18:54,371 INFO  L125   PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES.
[2025-03-14 01:18:54,372 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 813 conditions, 799 events. 6/799 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 161 event pairs, 0 based on Foata normal form. 9/791 useless extension candidates. Maximal degree in co-relation 141. Up to 10 conditions per place. 
[2025-03-14 01:18:54,375 INFO  L140   encePairwiseOnDemand]: 802/820 looper letters, 9 selfloop transitions, 0 changer transitions 0/796 dead transitions.
[2025-03-14 01:18:54,375 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 794 places, 796 transitions, 1614 flow
[2025-03-14 01:18:54,376 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-03-14 01:18:54,378 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2025-03-14 01:18:54,386 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1613 transitions.
[2025-03-14 01:18:54,389 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9835365853658536
[2025-03-14 01:18:54,390 INFO  L175             Difference]: Start difference. First operand has 815 places, 820 transitions, 1644 flow. Second operand 2 states and 1613 transitions.
[2025-03-14 01:18:54,391 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 794 places, 796 transitions, 1614 flow
[2025-03-14 01:18:54,401 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 794 places, 796 transitions, 1614 flow, removed 0 selfloop flow, removed 0 redundant places.
[2025-03-14 01:18:54,414 INFO  L231             Difference]: Finished difference. Result has 794 places, 796 transitions, 1596 flow
[2025-03-14 01:18:54,418 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=820, PETRI_DIFFERENCE_MINUEND_FLOW=1596, PETRI_DIFFERENCE_MINUEND_PLACES=793, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=796, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=796, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=1596, PETRI_PLACES=794, PETRI_TRANSITIONS=796}
[2025-03-14 01:18:54,422 INFO  L279   CegarLoopForPetriNet]: 815 programPoint places, -21 predicate places.
[2025-03-14 01:18:54,422 INFO  L471      AbstractCegarLoop]: Abstraction has has 794 places, 796 transitions, 1596 flow
[2025-03-14 01:18:54,424 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 794.0) internal successors, (1588), 2 states have internal predecessors, (1588), 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:18:54,424 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-14 01:18:54,424 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:18:54,425 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-14 01:18:54,426 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:18:54,428 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-14 01:18:54,429 INFO  L85        PathProgramCache]: Analyzing trace with hash -1785202101, now seen corresponding path program 1 times
[2025-03-14 01:18:54,429 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-14 01:18:54,429 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262490800]
[2025-03-14 01:18:54,429 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-14 01:18:54,430 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-14 01:18:54,550 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 669 statements into 1 equivalence classes.
[2025-03-14 01:18:54,631 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 669 of 669 statements.
[2025-03-14 01:18:54,631 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-14 01:18:54,632 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-14 01:18:55,135 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:18:55,136 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-14 01:18:55,136 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262490800]
[2025-03-14 01:18:55,136 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262490800] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-14 01:18:55,136 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-14 01:18:55,136 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-14 01:18:55,136 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852588906]
[2025-03-14 01:18:55,137 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-14 01:18:55,138 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-14 01:18:55,140 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-14 01:18:55,141 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-14 01:18:55,141 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-14 01:18:55,151 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 789 out of 820
[2025-03-14 01:18:55,155 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 794 places, 796 transitions, 1596 flow. Second operand  has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 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:18:55,155 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-14 01:18:55,155 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 789 of 820
[2025-03-14 01:18:55,155 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-14 01:18:55,314 INFO  L124   PetriNetUnfolderBase]: 10/902 cut-off events.
[2025-03-14 01:18:55,315 INFO  L125   PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES.
[2025-03-14 01:18:55,316 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 927 conditions, 902 events. 10/902 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 493 event pairs, 0 based on Foata normal form. 0/873 useless extension candidates. Maximal degree in co-relation 923. Up to 11 conditions per place. 
[2025-03-14 01:18:55,319 INFO  L140   encePairwiseOnDemand]: 817/820 looper letters, 17 selfloop transitions, 2 changer transitions 0/802 dead transitions.
[2025-03-14 01:18:55,319 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 795 places, 802 transitions, 1646 flow
[2025-03-14 01:18:55,320 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-14 01:18:55,320 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-14 01:18:55,324 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2387 transitions.
[2025-03-14 01:18:55,325 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9703252032520325
[2025-03-14 01:18:55,325 INFO  L175             Difference]: Start difference. First operand has 794 places, 796 transitions, 1596 flow. Second operand 3 states and 2387 transitions.
[2025-03-14 01:18:55,325 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 795 places, 802 transitions, 1646 flow
[2025-03-14 01:18:55,331 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 795 places, 802 transitions, 1646 flow, removed 0 selfloop flow, removed 0 redundant places.
[2025-03-14 01:18:55,339 INFO  L231             Difference]: Finished difference. Result has 795 places, 795 transitions, 1598 flow
[2025-03-14 01:18:55,340 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=820, PETRI_DIFFERENCE_MINUEND_FLOW=1594, PETRI_DIFFERENCE_MINUEND_PLACES=793, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=795, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=793, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1598, PETRI_PLACES=795, PETRI_TRANSITIONS=795}
[2025-03-14 01:18:55,341 INFO  L279   CegarLoopForPetriNet]: 815 programPoint places, -20 predicate places.
[2025-03-14 01:18:55,341 INFO  L471      AbstractCegarLoop]: Abstraction has has 795 places, 795 transitions, 1598 flow
[2025-03-14 01:18:55,343 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 790.3333333333334) internal successors, (2371), 3 states have internal predecessors, (2371), 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:18:55,343 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-14 01:18:55,344 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:18:55,344 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-14 01:18:55,344 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:18:55,347 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-14 01:18:55,348 INFO  L85        PathProgramCache]: Analyzing trace with hash 2077363708, now seen corresponding path program 1 times
[2025-03-14 01:18:55,348 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-14 01:18:55,348 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492456492]
[2025-03-14 01:18:55,348 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-14 01:18:55,348 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-14 01:18:55,445 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 671 statements into 1 equivalence classes.
[2025-03-14 01:18:55,551 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 671 of 671 statements.
[2025-03-14 01:18:55,552 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-14 01:18:55,552 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-14 01:18:55,552 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-03-14 01:18:55,574 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 671 statements into 1 equivalence classes.
[2025-03-14 01:18:55,651 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 671 of 671 statements.
[2025-03-14 01:18:55,651 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-14 01:18:55,651 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-14 01:18:55,812 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-03-14 01:18:55,813 INFO  L340         BasicCegarLoop]: Counterexample is feasible
[2025-03-14 01:18:55,814 INFO  L782   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (52 of 53 remaining)
[2025-03-14 01:18:55,817 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (51 of 53 remaining)
[2025-03-14 01:18:55,817 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (50 of 53 remaining)
[2025-03-14 01:18:55,817 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (49 of 53 remaining)
[2025-03-14 01:18:55,818 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (48 of 53 remaining)
[2025-03-14 01:18:55,818 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (47 of 53 remaining)
[2025-03-14 01:18:55,818 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (46 of 53 remaining)
[2025-03-14 01:18:55,818 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (45 of 53 remaining)
[2025-03-14 01:18:55,818 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (44 of 53 remaining)
[2025-03-14 01:18:55,818 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (43 of 53 remaining)
[2025-03-14 01:18:55,818 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (42 of 53 remaining)
[2025-03-14 01:18:55,818 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (41 of 53 remaining)
[2025-03-14 01:18:55,818 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (40 of 53 remaining)
[2025-03-14 01:18:55,818 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (39 of 53 remaining)
[2025-03-14 01:18:55,818 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (38 of 53 remaining)
[2025-03-14 01:18:55,818 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (37 of 53 remaining)
[2025-03-14 01:18:55,818 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (36 of 53 remaining)
[2025-03-14 01:18:55,819 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (35 of 53 remaining)
[2025-03-14 01:18:55,819 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (34 of 53 remaining)
[2025-03-14 01:18:55,819 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (33 of 53 remaining)
[2025-03-14 01:18:55,819 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (32 of 53 remaining)
[2025-03-14 01:18:55,819 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (31 of 53 remaining)
[2025-03-14 01:18:55,819 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (30 of 53 remaining)
[2025-03-14 01:18:55,819 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (29 of 53 remaining)
[2025-03-14 01:18:55,819 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (28 of 53 remaining)
[2025-03-14 01:18:55,819 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (27 of 53 remaining)
[2025-03-14 01:18:55,819 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (26 of 53 remaining)
[2025-03-14 01:18:55,819 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (25 of 53 remaining)
[2025-03-14 01:18:55,819 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (24 of 53 remaining)
[2025-03-14 01:18:55,819 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (23 of 53 remaining)
[2025-03-14 01:18:55,819 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (22 of 53 remaining)
[2025-03-14 01:18:55,819 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (21 of 53 remaining)
[2025-03-14 01:18:55,819 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (20 of 53 remaining)
[2025-03-14 01:18:55,819 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (19 of 53 remaining)
[2025-03-14 01:18:55,819 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (18 of 53 remaining)
[2025-03-14 01:18:55,819 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (17 of 53 remaining)
[2025-03-14 01:18:55,819 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (16 of 53 remaining)
[2025-03-14 01:18:55,820 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (15 of 53 remaining)
[2025-03-14 01:18:55,820 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (14 of 53 remaining)
[2025-03-14 01:18:55,820 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (13 of 53 remaining)
[2025-03-14 01:18:55,820 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (12 of 53 remaining)
[2025-03-14 01:18:55,820 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (11 of 53 remaining)
[2025-03-14 01:18:55,820 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (10 of 53 remaining)
[2025-03-14 01:18:55,820 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (9 of 53 remaining)
[2025-03-14 01:18:55,820 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (8 of 53 remaining)
[2025-03-14 01:18:55,820 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (7 of 53 remaining)
[2025-03-14 01:18:55,820 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (6 of 53 remaining)
[2025-03-14 01:18:55,820 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (5 of 53 remaining)
[2025-03-14 01:18:55,820 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (4 of 53 remaining)
[2025-03-14 01:18:55,821 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (3 of 53 remaining)
[2025-03-14 01:18:55,821 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (2 of 53 remaining)
[2025-03-14 01:18:55,821 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (1 of 53 remaining)
[2025-03-14 01:18:55,822 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 53 remaining)
[2025-03-14 01:18:55,822 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-14 01:18:55,823 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1]
[2025-03-14 01:18:55,825 WARN  L246   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2025-03-14 01:18:55,826 INFO  L491   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2025-03-14 01:18:55,917 INFO  L143    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2025-03-14 01:18:55,927 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 958 places, 969 transitions, 1948 flow
[2025-03-14 01:18:56,099 INFO  L124   PetriNetUnfolderBase]: 16/985 cut-off events.
[2025-03-14 01:18:56,100 INFO  L125   PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES.
[2025-03-14 01:18:56,108 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 993 conditions, 985 events. 16/985 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1005 event pairs, 0 based on Foata normal form. 0/914 useless extension candidates. Maximal degree in co-relation 828. Up to 3 conditions per place. 
[2025-03-14 01:18:56,108 INFO  L82        GeneralOperation]: Start removeDead. Operand has 958 places, 969 transitions, 1948 flow
[2025-03-14 01:18:56,116 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 958 places, 969 transitions, 1948 flow
[2025-03-14 01:18:56,117 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-14 01:18:56,117 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;@2f336a4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-14 01:18:56,117 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 79 error locations.
[2025-03-14 01:18:56,211 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2025-03-14 01:18:56,211 INFO  L124   PetriNetUnfolderBase]: 0/671 cut-off events.
[2025-03-14 01:18:56,211 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2025-03-14 01:18:56,211 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-14 01:18:56,211 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:56,212 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:18:56,213 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-14 01:18:56,214 INFO  L85        PathProgramCache]: Analyzing trace with hash 604211268, now seen corresponding path program 1 times
[2025-03-14 01:18:56,214 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-14 01:18:56,214 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655862799]
[2025-03-14 01:18:56,214 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-14 01:18:56,214 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-14 01:18:56,301 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 667 statements into 1 equivalence classes.
[2025-03-14 01:18:56,373 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 667 of 667 statements.
[2025-03-14 01:18:56,373 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-14 01:18:56,374 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-14 01:18:57,835 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:18:57,835 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-14 01:18:57,836 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655862799]
[2025-03-14 01:18:57,836 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655862799] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-14 01:18:57,836 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-14 01:18:57,836 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2025-03-14 01:18:57,836 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260721781]
[2025-03-14 01:18:57,837 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-14 01:18:57,838 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-03-14 01:18:57,838 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-14 01:18:57,839 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-03-14 01:18:57,839 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-14 01:18:57,842 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 916 out of 969
[2025-03-14 01:18:57,844 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 958 places, 969 transitions, 1948 flow. Second operand  has 2 states, 2 states have (on average 917.0) internal successors, (1834), 2 states have internal predecessors, (1834), 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:18:57,844 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-14 01:18:57,844 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 916 of 969
[2025-03-14 01:18:57,845 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-14 01:18:58,371 INFO  L124   PetriNetUnfolderBase]: 121/1999 cut-off events.
[2025-03-14 01:18:58,372 INFO  L125   PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES.
[2025-03-14 01:18:58,381 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2168 conditions, 1999 events. 121/1999 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 8356 event pairs, 38 based on Foata normal form. 89/1899 useless extension candidates. Maximal degree in co-relation 1325. Up to 146 conditions per place. 
[2025-03-14 01:18:58,388 INFO  L140   encePairwiseOnDemand]: 934/969 looper letters, 18 selfloop transitions, 0 changer transitions 0/925 dead transitions.
[2025-03-14 01:18:58,388 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 919 places, 925 transitions, 1896 flow
[2025-03-14 01:18:58,389 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-03-14 01:18:58,389 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2025-03-14 01:18:58,392 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1885 transitions.
[2025-03-14 01:18:58,393 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9726522187822497
[2025-03-14 01:18:58,393 INFO  L175             Difference]: Start difference. First operand has 958 places, 969 transitions, 1948 flow. Second operand 2 states and 1885 transitions.
[2025-03-14 01:18:58,393 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 919 places, 925 transitions, 1896 flow
[2025-03-14 01:18:58,398 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 919 places, 925 transitions, 1896 flow, removed 0 selfloop flow, removed 0 redundant places.
[2025-03-14 01:18:58,406 INFO  L231             Difference]: Finished difference. Result has 919 places, 925 transitions, 1860 flow
[2025-03-14 01:18:58,408 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=969, PETRI_DIFFERENCE_MINUEND_FLOW=1860, PETRI_DIFFERENCE_MINUEND_PLACES=918, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=925, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=925, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=1860, PETRI_PLACES=919, PETRI_TRANSITIONS=925}
[2025-03-14 01:18:58,408 INFO  L279   CegarLoopForPetriNet]: 958 programPoint places, -39 predicate places.
[2025-03-14 01:18:58,409 INFO  L471      AbstractCegarLoop]: Abstraction has has 919 places, 925 transitions, 1860 flow
[2025-03-14 01:18:58,410 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 917.0) internal successors, (1834), 2 states have internal predecessors, (1834), 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:18:58,410 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-14 01:18:58,410 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:18:58,410 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-14 01:18:58,410 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:18:58,412 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-14 01:18:58,412 INFO  L85        PathProgramCache]: Analyzing trace with hash 826548712, now seen corresponding path program 1 times
[2025-03-14 01:18:58,412 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-14 01:18:58,412 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513854123]
[2025-03-14 01:18:58,412 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-14 01:18:58,413 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-14 01:18:58,503 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 669 statements into 1 equivalence classes.
[2025-03-14 01:18:58,553 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 669 of 669 statements.
[2025-03-14 01:18:58,554 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-14 01:18:58,554 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-14 01:18:58,744 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:18:58,744 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-14 01:18:58,744 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513854123]
[2025-03-14 01:18:58,745 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513854123] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-14 01:18:58,745 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-14 01:18:58,745 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-14 01:18:58,745 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625096222]
[2025-03-14 01:18:58,745 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-14 01:18:58,746 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-14 01:18:58,747 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-14 01:18:58,747 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-14 01:18:58,747 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-14 01:18:58,763 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 908 out of 969
[2025-03-14 01:18:58,766 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 919 places, 925 transitions, 1860 flow. Second operand  has 3 states, 3 states have (on average 909.3333333333334) internal successors, (2728), 3 states have internal predecessors, (2728), 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:18:58,766 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-14 01:18:58,766 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 908 of 969
[2025-03-14 01:18:58,766 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-14 01:18:59,689 INFO  L124   PetriNetUnfolderBase]: 396/4636 cut-off events.
[2025-03-14 01:18:59,689 INFO  L125   PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES.
[2025-03-14 01:18:59,707 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5210 conditions, 4636 events. 396/4636 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 35664 event pairs, 74 based on Foata normal form. 0/4089 useless extension candidates. Maximal degree in co-relation 5205. Up to 270 conditions per place. 
[2025-03-14 01:18:59,722 INFO  L140   encePairwiseOnDemand]: 961/969 looper letters, 43 selfloop transitions, 6 changer transitions 0/948 dead transitions.
[2025-03-14 01:18:59,723 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 921 places, 948 transitions, 2009 flow
[2025-03-14 01:18:59,723 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-14 01:18:59,723 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-14 01:18:59,726 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2775 transitions.
[2025-03-14 01:18:59,727 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9545923632610939
[2025-03-14 01:18:59,727 INFO  L175             Difference]: Start difference. First operand has 919 places, 925 transitions, 1860 flow. Second operand 3 states and 2775 transitions.
[2025-03-14 01:18:59,727 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 921 places, 948 transitions, 2009 flow
[2025-03-14 01:18:59,731 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 921 places, 948 transitions, 2009 flow, removed 0 selfloop flow, removed 0 redundant places.
[2025-03-14 01:18:59,740 INFO  L231             Difference]: Finished difference. Result has 923 places, 931 transitions, 1912 flow
[2025-03-14 01:18:59,741 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=969, PETRI_DIFFERENCE_MINUEND_FLOW=1860, PETRI_DIFFERENCE_MINUEND_PLACES=919, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=925, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=919, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1912, PETRI_PLACES=923, PETRI_TRANSITIONS=931}
[2025-03-14 01:18:59,741 INFO  L279   CegarLoopForPetriNet]: 958 programPoint places, -35 predicate places.
[2025-03-14 01:18:59,742 INFO  L471      AbstractCegarLoop]: Abstraction has has 923 places, 931 transitions, 1912 flow
[2025-03-14 01:18:59,744 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 909.3333333333334) internal successors, (2728), 3 states have internal predecessors, (2728), 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:18:59,744 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-14 01:18:59,744 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:18:59,744 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-14 01:18:59,745 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:18:59,746 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-14 01:18:59,746 INFO  L85        PathProgramCache]: Analyzing trace with hash 811973305, now seen corresponding path program 1 times
[2025-03-14 01:18:59,746 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-14 01:18:59,746 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818185693]
[2025-03-14 01:18:59,746 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-14 01:18:59,746 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-14 01:18:59,826 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 677 statements into 1 equivalence classes.
[2025-03-14 01:18:59,896 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 677 of 677 statements.
[2025-03-14 01:18:59,896 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-14 01:18:59,897 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-14 01:18:59,897 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-03-14 01:18:59,914 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 677 statements into 1 equivalence classes.
[2025-03-14 01:18:59,975 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 677 of 677 statements.
[2025-03-14 01:18:59,975 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-14 01:18:59,975 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-14 01:19:00,060 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-03-14 01:19:00,061 INFO  L340         BasicCegarLoop]: Counterexample is feasible
[2025-03-14 01:19:00,062 INFO  L782   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (78 of 79 remaining)
[2025-03-14 01:19:00,062 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (77 of 79 remaining)
[2025-03-14 01:19:00,062 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (76 of 79 remaining)
[2025-03-14 01:19:00,062 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (75 of 79 remaining)
[2025-03-14 01:19:00,062 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (74 of 79 remaining)
[2025-03-14 01:19:00,062 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (73 of 79 remaining)
[2025-03-14 01:19:00,063 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (72 of 79 remaining)
[2025-03-14 01:19:00,063 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (71 of 79 remaining)
[2025-03-14 01:19:00,063 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (70 of 79 remaining)
[2025-03-14 01:19:00,063 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (69 of 79 remaining)
[2025-03-14 01:19:00,063 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (68 of 79 remaining)
[2025-03-14 01:19:00,063 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (67 of 79 remaining)
[2025-03-14 01:19:00,063 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (66 of 79 remaining)
[2025-03-14 01:19:00,063 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (65 of 79 remaining)
[2025-03-14 01:19:00,063 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (64 of 79 remaining)
[2025-03-14 01:19:00,063 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (63 of 79 remaining)
[2025-03-14 01:19:00,063 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (62 of 79 remaining)
[2025-03-14 01:19:00,063 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (61 of 79 remaining)
[2025-03-14 01:19:00,064 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (60 of 79 remaining)
[2025-03-14 01:19:00,064 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (59 of 79 remaining)
[2025-03-14 01:19:00,064 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (58 of 79 remaining)
[2025-03-14 01:19:00,064 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (57 of 79 remaining)
[2025-03-14 01:19:00,064 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (56 of 79 remaining)
[2025-03-14 01:19:00,064 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (55 of 79 remaining)
[2025-03-14 01:19:00,065 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (54 of 79 remaining)
[2025-03-14 01:19:00,065 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (53 of 79 remaining)
[2025-03-14 01:19:00,065 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (52 of 79 remaining)
[2025-03-14 01:19:00,065 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (51 of 79 remaining)
[2025-03-14 01:19:00,065 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (50 of 79 remaining)
[2025-03-14 01:19:00,065 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (49 of 79 remaining)
[2025-03-14 01:19:00,065 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (48 of 79 remaining)
[2025-03-14 01:19:00,065 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (47 of 79 remaining)
[2025-03-14 01:19:00,065 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (46 of 79 remaining)
[2025-03-14 01:19:00,065 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (45 of 79 remaining)
[2025-03-14 01:19:00,065 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (44 of 79 remaining)
[2025-03-14 01:19:00,066 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (43 of 79 remaining)
[2025-03-14 01:19:00,066 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (42 of 79 remaining)
[2025-03-14 01:19:00,066 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (41 of 79 remaining)
[2025-03-14 01:19:00,066 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (40 of 79 remaining)
[2025-03-14 01:19:00,066 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (39 of 79 remaining)
[2025-03-14 01:19:00,066 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (38 of 79 remaining)
[2025-03-14 01:19:00,066 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (37 of 79 remaining)
[2025-03-14 01:19:00,066 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (36 of 79 remaining)
[2025-03-14 01:19:00,066 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (35 of 79 remaining)
[2025-03-14 01:19:00,066 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (34 of 79 remaining)
[2025-03-14 01:19:00,066 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (33 of 79 remaining)
[2025-03-14 01:19:00,066 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (32 of 79 remaining)
[2025-03-14 01:19:00,066 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (31 of 79 remaining)
[2025-03-14 01:19:00,066 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (30 of 79 remaining)
[2025-03-14 01:19:00,066 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (29 of 79 remaining)
[2025-03-14 01:19:00,067 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (28 of 79 remaining)
[2025-03-14 01:19:00,067 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (27 of 79 remaining)
[2025-03-14 01:19:00,067 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (26 of 79 remaining)
[2025-03-14 01:19:00,067 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (25 of 79 remaining)
[2025-03-14 01:19:00,067 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (24 of 79 remaining)
[2025-03-14 01:19:00,067 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (23 of 79 remaining)
[2025-03-14 01:19:00,067 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (22 of 79 remaining)
[2025-03-14 01:19:00,067 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (21 of 79 remaining)
[2025-03-14 01:19:00,067 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (20 of 79 remaining)
[2025-03-14 01:19:00,067 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (19 of 79 remaining)
[2025-03-14 01:19:00,067 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (18 of 79 remaining)
[2025-03-14 01:19:00,067 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (17 of 79 remaining)
[2025-03-14 01:19:00,067 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (16 of 79 remaining)
[2025-03-14 01:19:00,067 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (15 of 79 remaining)
[2025-03-14 01:19:00,067 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (14 of 79 remaining)
[2025-03-14 01:19:00,067 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (13 of 79 remaining)
[2025-03-14 01:19:00,067 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (12 of 79 remaining)
[2025-03-14 01:19:00,067 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (11 of 79 remaining)
[2025-03-14 01:19:00,067 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (10 of 79 remaining)
[2025-03-14 01:19:00,068 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (9 of 79 remaining)
[2025-03-14 01:19:00,068 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (8 of 79 remaining)
[2025-03-14 01:19:00,068 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (7 of 79 remaining)
[2025-03-14 01:19:00,068 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (6 of 79 remaining)
[2025-03-14 01:19:00,068 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (5 of 79 remaining)
[2025-03-14 01:19:00,068 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (4 of 79 remaining)
[2025-03-14 01:19:00,068 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (3 of 79 remaining)
[2025-03-14 01:19:00,068 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (2 of 79 remaining)
[2025-03-14 01:19:00,068 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (1 of 79 remaining)
[2025-03-14 01:19:00,068 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 79 remaining)
[2025-03-14 01:19:00,068 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-14 01:19:00,068 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1]
[2025-03-14 01:19:00,068 WARN  L246   ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis
[2025-03-14 01:19:00,069 INFO  L491   ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances.
[2025-03-14 01:19:00,174 INFO  L143    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2025-03-14 01:19:00,186 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 1101 places, 1118 transitions, 2254 flow
[2025-03-14 01:19:00,440 INFO  L124   PetriNetUnfolderBase]: 24/1143 cut-off events.
[2025-03-14 01:19:00,440 INFO  L125   PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES.
[2025-03-14 01:19:00,447 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1156 conditions, 1143 events. 24/1143 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1955 event pairs, 0 based on Foata normal form. 0/1037 useless extension candidates. Maximal degree in co-relation 989. Up to 4 conditions per place. 
[2025-03-14 01:19:00,447 INFO  L82        GeneralOperation]: Start removeDead. Operand has 1101 places, 1118 transitions, 2254 flow
[2025-03-14 01:19:00,460 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 1101 places, 1118 transitions, 2254 flow
[2025-03-14 01:19:00,462 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-14 01:19:00,463 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;@2f336a4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-14 01:19:00,463 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 105 error locations.
[2025-03-14 01:19:00,510 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2025-03-14 01:19:00,510 INFO  L124   PetriNetUnfolderBase]: 0/672 cut-off events.
[2025-03-14 01:19:00,510 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2025-03-14 01:19:00,511 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-14 01:19:00,511 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:00,511 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:00,512 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-14 01:19:00,513 INFO  L85        PathProgramCache]: Analyzing trace with hash 1739990902, now seen corresponding path program 1 times
[2025-03-14 01:19:00,513 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-14 01:19:00,513 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46894974]
[2025-03-14 01:19:00,513 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-14 01:19:00,513 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-14 01:19:00,586 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 667 statements into 1 equivalence classes.
[2025-03-14 01:19:00,649 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 667 of 667 statements.
[2025-03-14 01:19:00,649 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-14 01:19:00,649 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-14 01:19:01,361 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,362 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-14 01:19:01,362 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46894974]
[2025-03-14 01:19:01,362 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46894974] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-14 01:19:01,362 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-14 01:19:01,362 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2025-03-14 01:19:01,362 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155676303]
[2025-03-14 01:19:01,362 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-14 01:19:01,363 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-03-14 01:19:01,364 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-14 01:19:01,364 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-03-14 01:19:01,364 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-14 01:19:01,366 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 1039 out of 1118
[2025-03-14 01:19:01,368 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1101 places, 1118 transitions, 2254 flow. Second operand  has 2 states, 2 states have (on average 1040.0) internal successors, (2080), 2 states have internal predecessors, (2080), 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,368 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-14 01:19:01,368 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 1039 of 1118
[2025-03-14 01:19:01,368 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-14 01:19:04,093 INFO  L124   PetriNetUnfolderBase]: 1596/12286 cut-off events.
[2025-03-14 01:19:04,093 INFO  L125   PetriNetUnfolderBase]: For 298/298 co-relation queries the response was YES.
[2025-03-14 01:19:04,189 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14298 conditions, 12286 events. 1596/12286 cut-off events. For 298/298 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 126696 event pairs, 624 based on Foata normal form. 917/11513 useless extension candidates. Maximal degree in co-relation 11855. Up to 1804 conditions per place. 
[2025-03-14 01:19:04,252 INFO  L140   encePairwiseOnDemand]: 1066/1118 looper letters, 27 selfloop transitions, 0 changer transitions 0/1054 dead transitions.
[2025-03-14 01:19:04,253 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1044 places, 1054 transitions, 2180 flow
[2025-03-14 01:19:04,254 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-03-14 01:19:04,254 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2025-03-14 01:19:04,256 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2157 transitions.
[2025-03-14 01:19:04,257 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9646690518783542
[2025-03-14 01:19:04,257 INFO  L175             Difference]: Start difference. First operand has 1101 places, 1118 transitions, 2254 flow. Second operand 2 states and 2157 transitions.
[2025-03-14 01:19:04,257 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 1044 places, 1054 transitions, 2180 flow
[2025-03-14 01:19:04,261 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 1044 places, 1054 transitions, 2178 flow, removed 1 selfloop flow, removed 0 redundant places.
[2025-03-14 01:19:04,268 INFO  L231             Difference]: Finished difference. Result has 1044 places, 1054 transitions, 2124 flow
[2025-03-14 01:19:04,269 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=1118, PETRI_DIFFERENCE_MINUEND_FLOW=2124, PETRI_DIFFERENCE_MINUEND_PLACES=1043, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1054, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1054, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=2124, PETRI_PLACES=1044, PETRI_TRANSITIONS=1054}
[2025-03-14 01:19:04,270 INFO  L279   CegarLoopForPetriNet]: 1101 programPoint places, -57 predicate places.
[2025-03-14 01:19:04,270 INFO  L471      AbstractCegarLoop]: Abstraction has has 1044 places, 1054 transitions, 2124 flow
[2025-03-14 01:19:04,271 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 1040.0) internal successors, (2080), 2 states have internal predecessors, (2080), 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,271 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-14 01:19:04,271 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:04,272 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-14 01:19:04,272 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:04,273 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-14 01:19:04,273 INFO  L85        PathProgramCache]: Analyzing trace with hash 1389119578, now seen corresponding path program 1 times
[2025-03-14 01:19:04,273 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-14 01:19:04,273 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186970650]
[2025-03-14 01:19:04,273 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-14 01:19:04,273 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-14 01:19:04,346 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 669 statements into 1 equivalence classes.
[2025-03-14 01:19:04,377 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 669 of 669 statements.
[2025-03-14 01:19:04,378 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-14 01:19:04,378 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-14 01:19:04,659 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,659 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-14 01:19:04,659 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186970650]
[2025-03-14 01:19:04,659 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186970650] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-14 01:19:04,659 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-14 01:19:04,659 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-14 01:19:04,659 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653962068]
[2025-03-14 01:19:04,660 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-14 01:19:04,660 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-14 01:19:04,661 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-14 01:19:04,662 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-14 01:19:04,662 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-14 01:19:04,683 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 1027 out of 1118
[2025-03-14 01:19:04,686 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1044 places, 1054 transitions, 2124 flow. Second operand  has 3 states, 3 states have (on average 1028.3333333333333) internal successors, (3085), 3 states have internal predecessors, (3085), 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,686 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-14 01:19:04,686 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 1027 of 1118
[2025-03-14 01:19:04,686 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-14 01:19:16,261 INFO  L124   PetriNetUnfolderBase]: 8937/56209 cut-off events.
[2025-03-14 01:19:16,261 INFO  L125   PetriNetUnfolderBase]: For 595/595 co-relation queries the response was YES.
[2025-03-14 01:19:16,670 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 67707 conditions, 56209 events. 8937/56209 cut-off events. For 595/595 co-relation queries the response was YES. Maximal size of possible extension queue 943. Compared 813906 event pairs, 2078 based on Foata normal form. 0/47968 useless extension candidates. Maximal degree in co-relation 67701. Up to 5598 conditions per place. 
[2025-03-14 01:19:16,937 INFO  L140   encePairwiseOnDemand]: 1106/1118 looper letters, 65 selfloop transitions, 9 changer transitions 0/1089 dead transitions.
[2025-03-14 01:19:16,938 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1046 places, 1089 transitions, 2352 flow
[2025-03-14 01:19:16,938 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-14 01:19:16,938 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2025-03-14 01:19:16,941 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3158 transitions.
[2025-03-14 01:19:16,943 INFO  L514   CegarLoopForPetriNet]: DFA transition density 0.9415623136553369
[2025-03-14 01:19:16,943 INFO  L175             Difference]: Start difference. First operand has 1044 places, 1054 transitions, 2124 flow. Second operand 3 states and 3158 transitions.
[2025-03-14 01:19:16,943 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 1046 places, 1089 transitions, 2352 flow
[2025-03-14 01:19:16,947 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 1046 places, 1089 transitions, 2352 flow, removed 0 selfloop flow, removed 0 redundant places.
[2025-03-14 01:19:16,954 INFO  L231             Difference]: Finished difference. Result has 1048 places, 1063 transitions, 2202 flow
[2025-03-14 01:19:16,955 INFO  L262   CegarLoopForPetriNet]: {PETRI_ALPHABET=1118, PETRI_DIFFERENCE_MINUEND_FLOW=2124, PETRI_DIFFERENCE_MINUEND_PLACES=1044, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1054, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1045, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2202, PETRI_PLACES=1048, PETRI_TRANSITIONS=1063}
[2025-03-14 01:19:16,956 INFO  L279   CegarLoopForPetriNet]: 1101 programPoint places, -53 predicate places.
[2025-03-14 01:19:16,956 INFO  L471      AbstractCegarLoop]: Abstraction has has 1048 places, 1063 transitions, 2202 flow
[2025-03-14 01:19:16,957 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 1028.3333333333333) internal successors, (3085), 3 states have internal predecessors, (3085), 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:16,957 INFO  L198   CegarLoopForPetriNet]: Found error trace
[2025-03-14 01:19:16,958 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:16,958 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-14 01:19:16,958 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:16,959 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-14 01:19:16,959 INFO  L85        PathProgramCache]: Analyzing trace with hash -175665720, now seen corresponding path program 1 times
[2025-03-14 01:19:16,959 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-14 01:19:16,959 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443301598]
[2025-03-14 01:19:16,960 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-14 01:19:16,960 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-14 01:19:17,030 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 679 statements into 1 equivalence classes.
[2025-03-14 01:19:17,086 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 679 of 679 statements.
[2025-03-14 01:19:17,087 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-14 01:19:17,087 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-14 01:19:18,609 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:18,610 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-14 01:19:18,610 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443301598]
[2025-03-14 01:19:18,610 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443301598] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-14 01:19:18,610 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-14 01:19:18,610 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-14 01:19:18,610 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9547188]
[2025-03-14 01:19:18,610 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-14 01:19:18,611 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-14 01:19:18,612 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-14 01:19:18,612 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-14 01:19:18,612 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2025-03-14 01:19:18,836 INFO  L469   CegarLoopForPetriNet]: Number of universal loopers: 991 out of 1118
[2025-03-14 01:19:18,840 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1048 places, 1063 transitions, 2202 flow. Second operand  has 6 states, 6 states have (on average 992.6666666666666) internal successors, (5956), 6 states have internal predecessors, (5956), 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:18,840 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2025-03-14 01:19:18,840 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 991 of 1118
[2025-03-14 01:19:18,841 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2025-03-14 01:19:23,035 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4209] L780-3-->L781: Formula: (let ((.cse1 (select |v_#race_765| |v_~#m2~0.base_45|)) (.cse5 (+ |v_~#m2~0.offset_45| 2))) (let ((.cse3 (+ |v_~#m2~0.offset_45| 1)) (.cse2 (+ |v_~#m2~0.offset_45| 3)) (.cse0 (select .cse1 .cse5)) (.cse4 (select |v_#memory_int_421| |v_~#m2~0.base_45|))) (and (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_45|) 1) 1 0) 0)) (= .cse0 (select .cse1 |v_~#m2~0.offset_45|)) (= |v_#race_765| (store |v_#race_767| |v_~#m2~0.base_45| (store (store (store (store (select |v_#race_767| |v_~#m2~0.base_45|) |v_~#m2~0.offset_45| .cse0) .cse3 .cse0) .cse5 .cse0) .cse2 .cse0))) (= |v_#memory_int_420| (store |v_#memory_int_421| |v_~#m2~0.base_45| (store .cse4 |v_~#m2~0.offset_45| 0))))))  InVars {#race=|v_#race_767|, #memory_int=|v_#memory_int_421|, ~#m2~0.base=|v_~#m2~0.base_45|, ~#m2~0.offset=|v_~#m2~0.offset_45|}  OutVars{#race=|v_#race_765|, 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_420|, ~#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], [1100#true, 778#L732-1true, 904#L781true, 1111#true, 806#L781true, Black: 1106#true, 1098#true, 1108#(= |#race~state~0| 0), 714#L789-2true, 1104#true, 1102#true])
[2025-03-14 01:19:23,035 INFO  L294   olderBase$Statistics]: this new event has 723 ancestors and is cut-off event
[2025-03-14 01:19:23,035 INFO  L297   olderBase$Statistics]:   existing Event has 723 ancestors and is cut-off event
[2025-03-14 01:19:23,035 INFO  L297   olderBase$Statistics]:   existing Event has 709 ancestors and is cut-off event
[2025-03-14 01:19:23,035 INFO  L297   olderBase$Statistics]:   existing Event has 709 ancestors and is cut-off event
[2025-03-14 01:19:23,222 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4209] L780-3-->L781: Formula: (let ((.cse1 (select |v_#race_765| |v_~#m2~0.base_45|)) (.cse5 (+ |v_~#m2~0.offset_45| 2))) (let ((.cse3 (+ |v_~#m2~0.offset_45| 1)) (.cse2 (+ |v_~#m2~0.offset_45| 3)) (.cse0 (select .cse1 .cse5)) (.cse4 (select |v_#memory_int_421| |v_~#m2~0.base_45|))) (and (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_45|) 1) 1 0) 0)) (= .cse0 (select .cse1 |v_~#m2~0.offset_45|)) (= |v_#race_765| (store |v_#race_767| |v_~#m2~0.base_45| (store (store (store (store (select |v_#race_767| |v_~#m2~0.base_45|) |v_~#m2~0.offset_45| .cse0) .cse3 .cse0) .cse5 .cse0) .cse2 .cse0))) (= |v_#memory_int_420| (store |v_#memory_int_421| |v_~#m2~0.base_45| (store .cse4 |v_~#m2~0.offset_45| 0))))))  InVars {#race=|v_#race_767|, #memory_int=|v_#memory_int_421|, ~#m2~0.base=|v_~#m2~0.base_45|, ~#m2~0.offset=|v_~#m2~0.offset_45|}  OutVars{#race=|v_#race_765|, 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_420|, ~#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], [904#L781true, 1100#true, 1111#true, 806#L781true, 1098#true, Black: 1106#true, 1108#(= |#race~state~0| 0), 490#EBStack_init_returnLabel#1true, 714#L789-2true, 1104#true, 1102#true])
[2025-03-14 01:19:23,222 INFO  L294   olderBase$Statistics]: this new event has 724 ancestors and is cut-off event
[2025-03-14 01:19:23,222 INFO  L297   olderBase$Statistics]:   existing Event has 710 ancestors and is cut-off event
[2025-03-14 01:19:23,222 INFO  L297   olderBase$Statistics]:   existing Event has 710 ancestors and is cut-off event
[2025-03-14 01:19:23,222 INFO  L297   olderBase$Statistics]:   existing Event has 724 ancestors and is cut-off event
[2025-03-14 01:19:23,534 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4209] L780-3-->L781: Formula: (let ((.cse1 (select |v_#race_765| |v_~#m2~0.base_45|)) (.cse5 (+ |v_~#m2~0.offset_45| 2))) (let ((.cse3 (+ |v_~#m2~0.offset_45| 1)) (.cse2 (+ |v_~#m2~0.offset_45| 3)) (.cse0 (select .cse1 .cse5)) (.cse4 (select |v_#memory_int_421| |v_~#m2~0.base_45|))) (and (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_45|) 1) 1 0) 0)) (= .cse0 (select .cse1 |v_~#m2~0.offset_45|)) (= |v_#race_765| (store |v_#race_767| |v_~#m2~0.base_45| (store (store (store (store (select |v_#race_767| |v_~#m2~0.base_45|) |v_~#m2~0.offset_45| .cse0) .cse3 .cse0) .cse5 .cse0) .cse2 .cse0))) (= |v_#memory_int_420| (store |v_#memory_int_421| |v_~#m2~0.base_45| (store .cse4 |v_~#m2~0.offset_45| 0))))))  InVars {#race=|v_#race_767|, #memory_int=|v_#memory_int_421|, ~#m2~0.base=|v_~#m2~0.base_45|, ~#m2~0.offset=|v_~#m2~0.offset_45|}  OutVars{#race=|v_#race_765|, 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_420|, ~#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], [1100#true, 904#L781true, 1111#true, 806#L781true, 1098#true, Black: 1106#true, 1108#(= |#race~state~0| 0), 351#L777true, 714#L789-2true, 1104#true, 1102#true])
[2025-03-14 01:19:23,535 INFO  L294   olderBase$Statistics]: this new event has 725 ancestors and is cut-off event
[2025-03-14 01:19:23,535 INFO  L297   olderBase$Statistics]:   existing Event has 711 ancestors and is cut-off event
[2025-03-14 01:19:23,535 INFO  L297   olderBase$Statistics]:   existing Event has 725 ancestors and is cut-off event
[2025-03-14 01:19:23,535 INFO  L297   olderBase$Statistics]:   existing Event has 711 ancestors and is cut-off event
[2025-03-14 01:19:24,408 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4209] L780-3-->L781: Formula: (let ((.cse1 (select |v_#race_765| |v_~#m2~0.base_45|)) (.cse5 (+ |v_~#m2~0.offset_45| 2))) (let ((.cse3 (+ |v_~#m2~0.offset_45| 1)) (.cse2 (+ |v_~#m2~0.offset_45| 3)) (.cse0 (select .cse1 .cse5)) (.cse4 (select |v_#memory_int_421| |v_~#m2~0.base_45|))) (and (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_45|) 1) 1 0) 0)) (= .cse0 (select .cse1 |v_~#m2~0.offset_45|)) (= |v_#race_765| (store |v_#race_767| |v_~#m2~0.base_45| (store (store (store (store (select |v_#race_767| |v_~#m2~0.base_45|) |v_~#m2~0.offset_45| .cse0) .cse3 .cse0) .cse5 .cse0) .cse2 .cse0))) (= |v_#memory_int_420| (store |v_#memory_int_421| |v_~#m2~0.base_45| (store .cse4 |v_~#m2~0.offset_45| 0))))))  InVars {#race=|v_#race_767|, #memory_int=|v_#memory_int_421|, ~#m2~0.base=|v_~#m2~0.base_45|, ~#m2~0.offset=|v_~#m2~0.offset_45|}  OutVars{#race=|v_#race_765|, 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_420|, ~#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], [1100#true, 1111#true, 806#L781true, Black: 1106#true, 1098#true, 1108#(= |#race~state~0| 0), 175#L778-2true, 384#L732-3true, 714#L789-2true, 1104#true, 1102#true])
[2025-03-14 01:19:24,408 INFO  L294   olderBase$Statistics]: this new event has 730 ancestors and is cut-off event
[2025-03-14 01:19:24,408 INFO  L297   olderBase$Statistics]:   existing Event has 716 ancestors and is cut-off event
[2025-03-14 01:19:24,409 INFO  L297   olderBase$Statistics]:   existing Event has 716 ancestors and is cut-off event
[2025-03-14 01:19:24,409 INFO  L297   olderBase$Statistics]:   existing Event has 716 ancestors and is cut-off event
[2025-03-14 01:19:24,784 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4209] L780-3-->L781: Formula: (let ((.cse1 (select |v_#race_765| |v_~#m2~0.base_45|)) (.cse5 (+ |v_~#m2~0.offset_45| 2))) (let ((.cse3 (+ |v_~#m2~0.offset_45| 1)) (.cse2 (+ |v_~#m2~0.offset_45| 3)) (.cse0 (select .cse1 .cse5)) (.cse4 (select |v_#memory_int_421| |v_~#m2~0.base_45|))) (and (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_45|) 1) 1 0) 0)) (= .cse0 (select .cse1 |v_~#m2~0.offset_45|)) (= |v_#race_765| (store |v_#race_767| |v_~#m2~0.base_45| (store (store (store (store (select |v_#race_767| |v_~#m2~0.base_45|) |v_~#m2~0.offset_45| .cse0) .cse3 .cse0) .cse5 .cse0) .cse2 .cse0))) (= |v_#memory_int_420| (store |v_#memory_int_421| |v_~#m2~0.base_45| (store .cse4 |v_~#m2~0.offset_45| 0))))))  InVars {#race=|v_#race_767|, #memory_int=|v_#memory_int_421|, ~#m2~0.base=|v_~#m2~0.base_45|, ~#m2~0.offset=|v_~#m2~0.offset_45|}  OutVars{#race=|v_#race_765|, 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_420|, ~#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], [253#L732-2true, 1100#true, 1111#true, 806#L781true, Black: 1106#true, 1098#true, 1108#(= |#race~state~0| 0), 175#L778-2true, 714#L789-2true, 1104#true, 1102#true])
[2025-03-14 01:19:24,784 INFO  L294   olderBase$Statistics]: this new event has 731 ancestors and is cut-off event
[2025-03-14 01:19:24,784 INFO  L297   olderBase$Statistics]:   existing Event has 717 ancestors and is cut-off event
[2025-03-14 01:19:24,784 INFO  L297   olderBase$Statistics]:   existing Event has 717 ancestors and is cut-off event
[2025-03-14 01:19:24,784 INFO  L297   olderBase$Statistics]:   existing Event has 717 ancestors and is cut-off event
[2025-03-14 01:19:25,064 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4209] L780-3-->L781: Formula: (let ((.cse1 (select |v_#race_765| |v_~#m2~0.base_45|)) (.cse5 (+ |v_~#m2~0.offset_45| 2))) (let ((.cse3 (+ |v_~#m2~0.offset_45| 1)) (.cse2 (+ |v_~#m2~0.offset_45| 3)) (.cse0 (select .cse1 .cse5)) (.cse4 (select |v_#memory_int_421| |v_~#m2~0.base_45|))) (and (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_45|) 1) 1 0) 0)) (= .cse0 (select .cse1 |v_~#m2~0.offset_45|)) (= |v_#race_765| (store |v_#race_767| |v_~#m2~0.base_45| (store (store (store (store (select |v_#race_767| |v_~#m2~0.base_45|) |v_~#m2~0.offset_45| .cse0) .cse3 .cse0) .cse5 .cse0) .cse2 .cse0))) (= |v_#memory_int_420| (store |v_#memory_int_421| |v_~#m2~0.base_45| (store .cse4 |v_~#m2~0.offset_45| 0))))))  InVars {#race=|v_#race_767|, #memory_int=|v_#memory_int_421|, ~#m2~0.base=|v_~#m2~0.base_45|, ~#m2~0.offset=|v_~#m2~0.offset_45|}  OutVars{#race=|v_#race_765|, 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_420|, ~#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], [1100#true, 1111#true, 806#L781true, Black: 1106#true, 1098#true, 449#L732true, 1108#(= |#race~state~0| 0), 175#L778-2true, 714#L789-2true, 1104#true, 1102#true])
[2025-03-14 01:19:25,064 INFO  L294   olderBase$Statistics]: this new event has 732 ancestors and is cut-off event
[2025-03-14 01:19:25,064 INFO  L297   olderBase$Statistics]:   existing Event has 718 ancestors and is cut-off event
[2025-03-14 01:19:25,064 INFO  L297   olderBase$Statistics]:   existing Event has 718 ancestors and is cut-off event
[2025-03-14 01:19:25,064 INFO  L297   olderBase$Statistics]:   existing Event has 718 ancestors and is cut-off event
[2025-03-14 01:19:25,371 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4209] L780-3-->L781: Formula: (let ((.cse1 (select |v_#race_765| |v_~#m2~0.base_45|)) (.cse5 (+ |v_~#m2~0.offset_45| 2))) (let ((.cse3 (+ |v_~#m2~0.offset_45| 1)) (.cse2 (+ |v_~#m2~0.offset_45| 3)) (.cse0 (select .cse1 .cse5)) (.cse4 (select |v_#memory_int_421| |v_~#m2~0.base_45|))) (and (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_45|) 1) 1 0) 0)) (= .cse0 (select .cse1 |v_~#m2~0.offset_45|)) (= |v_#race_765| (store |v_#race_767| |v_~#m2~0.base_45| (store (store (store (store (select |v_#race_767| |v_~#m2~0.base_45|) |v_~#m2~0.offset_45| .cse0) .cse3 .cse0) .cse5 .cse0) .cse2 .cse0))) (= |v_#memory_int_420| (store |v_#memory_int_421| |v_~#m2~0.base_45| (store .cse4 |v_~#m2~0.offset_45| 0))))))  InVars {#race=|v_#race_767|, #memory_int=|v_#memory_int_421|, ~#m2~0.base=|v_~#m2~0.base_45|, ~#m2~0.offset=|v_~#m2~0.offset_45|}  OutVars{#race=|v_#race_765|, 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_420|, ~#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], [1100#true, 1111#true, 847#L732-1true, 806#L781true, Black: 1106#true, 1098#true, 1108#(= |#race~state~0| 0), 175#L778-2true, 714#L789-2true, 1104#true, 1102#true])
[2025-03-14 01:19:25,371 INFO  L294   olderBase$Statistics]: this new event has 733 ancestors and is cut-off event
[2025-03-14 01:19:25,371 INFO  L297   olderBase$Statistics]:   existing Event has 719 ancestors and is cut-off event
[2025-03-14 01:19:25,371 INFO  L297   olderBase$Statistics]:   existing Event has 719 ancestors and is cut-off event
[2025-03-14 01:19:25,371 INFO  L297   olderBase$Statistics]:   existing Event has 719 ancestors and is cut-off event
[2025-03-14 01:19:26,685 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4209] L780-3-->L781: Formula: (let ((.cse1 (select |v_#race_765| |v_~#m2~0.base_45|)) (.cse5 (+ |v_~#m2~0.offset_45| 2))) (let ((.cse3 (+ |v_~#m2~0.offset_45| 1)) (.cse2 (+ |v_~#m2~0.offset_45| 3)) (.cse0 (select .cse1 .cse5)) (.cse4 (select |v_#memory_int_421| |v_~#m2~0.base_45|))) (and (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_45|) 1) 1 0) 0)) (= .cse0 (select .cse1 |v_~#m2~0.offset_45|)) (= |v_#race_765| (store |v_#race_767| |v_~#m2~0.base_45| (store (store (store (store (select |v_#race_767| |v_~#m2~0.base_45|) |v_~#m2~0.offset_45| .cse0) .cse3 .cse0) .cse5 .cse0) .cse2 .cse0))) (= |v_#memory_int_420| (store |v_#memory_int_421| |v_~#m2~0.base_45| (store .cse4 |v_~#m2~0.offset_45| 0))))))  InVars {#race=|v_#race_767|, #memory_int=|v_#memory_int_421|, ~#m2~0.base=|v_~#m2~0.base_45|, ~#m2~0.offset=|v_~#m2~0.offset_45|}  OutVars{#race=|v_#race_765|, 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_420|, ~#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], [1100#true, 1111#true, 806#L781true, Black: 1106#true, 1098#true, 1108#(= |#race~state~0| 0), 491#L732-4true, 64#L721-2true, 714#L789-2true, 1104#true, 1102#true])
[2025-03-14 01:19:26,685 INFO  L294   olderBase$Statistics]: this new event has 737 ancestors and is cut-off event
[2025-03-14 01:19:26,685 INFO  L297   olderBase$Statistics]:   existing Event has 723 ancestors and is cut-off event
[2025-03-14 01:19:26,685 INFO  L297   olderBase$Statistics]:   existing Event has 737 ancestors and is cut-off event
[2025-03-14 01:19:26,685 INFO  L297   olderBase$Statistics]:   existing Event has 723 ancestors and is cut-off event
[2025-03-14 01:19:26,926 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4209] L780-3-->L781: Formula: (let ((.cse1 (select |v_#race_765| |v_~#m2~0.base_45|)) (.cse5 (+ |v_~#m2~0.offset_45| 2))) (let ((.cse3 (+ |v_~#m2~0.offset_45| 1)) (.cse2 (+ |v_~#m2~0.offset_45| 3)) (.cse0 (select .cse1 .cse5)) (.cse4 (select |v_#memory_int_421| |v_~#m2~0.base_45|))) (and (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_45|) 1) 1 0) 0)) (= .cse0 (select .cse1 |v_~#m2~0.offset_45|)) (= |v_#race_765| (store |v_#race_767| |v_~#m2~0.base_45| (store (store (store (store (select |v_#race_767| |v_~#m2~0.base_45|) |v_~#m2~0.offset_45| .cse0) .cse3 .cse0) .cse5 .cse0) .cse2 .cse0))) (= |v_#memory_int_420| (store |v_#memory_int_421| |v_~#m2~0.base_45| (store .cse4 |v_~#m2~0.offset_45| 0))))))  InVars {#race=|v_#race_767|, #memory_int=|v_#memory_int_421|, ~#m2~0.base=|v_~#m2~0.base_45|, ~#m2~0.offset=|v_~#m2~0.offset_45|}  OutVars{#race=|v_#race_765|, 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_420|, ~#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], [1100#true, 1111#true, 806#L781true, Black: 1106#true, 1098#true, 224#L732-3true, 1108#(= |#race~state~0| 0), 714#L789-2true, 64#L721-2true, 1104#true, 1102#true])
[2025-03-14 01:19:26,926 INFO  L294   olderBase$Statistics]: this new event has 738 ancestors and is cut-off event
[2025-03-14 01:19:26,926 INFO  L297   olderBase$Statistics]:   existing Event has 724 ancestors and is cut-off event
[2025-03-14 01:19:26,926 INFO  L297   olderBase$Statistics]:   existing Event has 738 ancestors and is cut-off event
[2025-03-14 01:19:26,926 INFO  L297   olderBase$Statistics]:   existing Event has 724 ancestors and is cut-off event
[2025-03-14 01:19:27,197 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4209] L780-3-->L781: Formula: (let ((.cse1 (select |v_#race_765| |v_~#m2~0.base_45|)) (.cse5 (+ |v_~#m2~0.offset_45| 2))) (let ((.cse3 (+ |v_~#m2~0.offset_45| 1)) (.cse2 (+ |v_~#m2~0.offset_45| 3)) (.cse0 (select .cse1 .cse5)) (.cse4 (select |v_#memory_int_421| |v_~#m2~0.base_45|))) (and (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_45|) 1) 1 0) 0)) (= .cse0 (select .cse1 |v_~#m2~0.offset_45|)) (= |v_#race_765| (store |v_#race_767| |v_~#m2~0.base_45| (store (store (store (store (select |v_#race_767| |v_~#m2~0.base_45|) |v_~#m2~0.offset_45| .cse0) .cse3 .cse0) .cse5 .cse0) .cse2 .cse0))) (= |v_#memory_int_420| (store |v_#memory_int_421| |v_~#m2~0.base_45| (store .cse4 |v_~#m2~0.offset_45| 0))))))  InVars {#race=|v_#race_767|, #memory_int=|v_#memory_int_421|, ~#m2~0.base=|v_~#m2~0.base_45|, ~#m2~0.offset=|v_~#m2~0.offset_45|}  OutVars{#race=|v_#race_765|, 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_420|, ~#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], [1100#true, 1111#true, 806#L781true, Black: 1106#true, 1098#true, 1108#(= |#race~state~0| 0), 714#L789-2true, 64#L721-2true, 1104#true, 1102#true, 833#L732-2true])
[2025-03-14 01:19:27,197 INFO  L294   olderBase$Statistics]: this new event has 739 ancestors and is cut-off event
[2025-03-14 01:19:27,197 INFO  L297   olderBase$Statistics]:   existing Event has 725 ancestors and is cut-off event
[2025-03-14 01:19:27,197 INFO  L297   olderBase$Statistics]:   existing Event has 739 ancestors and is cut-off event
[2025-03-14 01:19:27,197 INFO  L297   olderBase$Statistics]:   existing Event has 725 ancestors and is cut-off event
[2025-03-14 01:19:27,649 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4209] L780-3-->L781: Formula: (let ((.cse1 (select |v_#race_765| |v_~#m2~0.base_45|)) (.cse5 (+ |v_~#m2~0.offset_45| 2))) (let ((.cse3 (+ |v_~#m2~0.offset_45| 1)) (.cse2 (+ |v_~#m2~0.offset_45| 3)) (.cse0 (select .cse1 .cse5)) (.cse4 (select |v_#memory_int_421| |v_~#m2~0.base_45|))) (and (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_45|) 1) 1 0) 0)) (= .cse0 (select .cse1 |v_~#m2~0.offset_45|)) (= |v_#race_765| (store |v_#race_767| |v_~#m2~0.base_45| (store (store (store (store (select |v_#race_767| |v_~#m2~0.base_45|) |v_~#m2~0.offset_45| .cse0) .cse3 .cse0) .cse5 .cse0) .cse2 .cse0))) (= |v_#memory_int_420| (store |v_#memory_int_421| |v_~#m2~0.base_45| (store .cse4 |v_~#m2~0.offset_45| 0))))))  InVars {#race=|v_#race_767|, #memory_int=|v_#memory_int_421|, ~#m2~0.base=|v_~#m2~0.base_45|, ~#m2~0.offset=|v_~#m2~0.offset_45|}  OutVars{#race=|v_#race_765|, 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_420|, ~#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], [1100#true, 1111#true, 806#L781true, Black: 1106#true, 658#L732true, 1098#true, 1108#(= |#race~state~0| 0), 64#L721-2true, 714#L789-2true, 1104#true, 1102#true])
[2025-03-14 01:19:27,649 INFO  L294   olderBase$Statistics]: this new event has 740 ancestors and is cut-off event
[2025-03-14 01:19:27,649 INFO  L297   olderBase$Statistics]:   existing Event has 740 ancestors and is cut-off event
[2025-03-14 01:19:27,649 INFO  L297   olderBase$Statistics]:   existing Event has 726 ancestors and is cut-off event
[2025-03-14 01:19:27,649 INFO  L297   olderBase$Statistics]:   existing Event has 726 ancestors and is cut-off event
[2025-03-14 01:19:27,953 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4209] L780-3-->L781: Formula: (let ((.cse1 (select |v_#race_765| |v_~#m2~0.base_45|)) (.cse5 (+ |v_~#m2~0.offset_45| 2))) (let ((.cse3 (+ |v_~#m2~0.offset_45| 1)) (.cse2 (+ |v_~#m2~0.offset_45| 3)) (.cse0 (select .cse1 .cse5)) (.cse4 (select |v_#memory_int_421| |v_~#m2~0.base_45|))) (and (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_45|) 1) 1 0) 0)) (= .cse0 (select .cse1 |v_~#m2~0.offset_45|)) (= |v_#race_765| (store |v_#race_767| |v_~#m2~0.base_45| (store (store (store (store (select |v_#race_767| |v_~#m2~0.base_45|) |v_~#m2~0.offset_45| .cse0) .cse3 .cse0) .cse5 .cse0) .cse2 .cse0))) (= |v_#memory_int_420| (store |v_#memory_int_421| |v_~#m2~0.base_45| (store .cse4 |v_~#m2~0.offset_45| 0))))))  InVars {#race=|v_#race_767|, #memory_int=|v_#memory_int_421|, ~#m2~0.base=|v_~#m2~0.base_45|, ~#m2~0.offset=|v_~#m2~0.offset_45|}  OutVars{#race=|v_#race_765|, 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_420|, ~#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], [1100#true, 778#L732-1true, 1111#true, 806#L781true, Black: 1106#true, 1098#true, 1108#(= |#race~state~0| 0), 714#L789-2true, 64#L721-2true, 1104#true, 1102#true])
[2025-03-14 01:19:27,953 INFO  L294   olderBase$Statistics]: this new event has 741 ancestors and is cut-off event
[2025-03-14 01:19:27,953 INFO  L297   olderBase$Statistics]:   existing Event has 727 ancestors and is cut-off event
[2025-03-14 01:19:27,953 INFO  L297   olderBase$Statistics]:   existing Event has 727 ancestors and is cut-off event
[2025-03-14 01:19:27,953 INFO  L297   olderBase$Statistics]:   existing Event has 741 ancestors and is cut-off event
[2025-03-14 01:19:27,953 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4209] L780-3-->L781: Formula: (let ((.cse1 (select |v_#race_765| |v_~#m2~0.base_45|)) (.cse5 (+ |v_~#m2~0.offset_45| 2))) (let ((.cse3 (+ |v_~#m2~0.offset_45| 1)) (.cse2 (+ |v_~#m2~0.offset_45| 3)) (.cse0 (select .cse1 .cse5)) (.cse4 (select |v_#memory_int_421| |v_~#m2~0.base_45|))) (and (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_45|) 1) 1 0) 0)) (= .cse0 (select .cse1 |v_~#m2~0.offset_45|)) (= |v_#race_765| (store |v_#race_767| |v_~#m2~0.base_45| (store (store (store (store (select |v_#race_767| |v_~#m2~0.base_45|) |v_~#m2~0.offset_45| .cse0) .cse3 .cse0) .cse5 .cse0) .cse2 .cse0))) (= |v_#memory_int_420| (store |v_#memory_int_421| |v_~#m2~0.base_45| (store .cse4 |v_~#m2~0.offset_45| 0))))))  InVars {#race=|v_#race_767|, #memory_int=|v_#memory_int_421|, ~#m2~0.base=|v_~#m2~0.base_45|, ~#m2~0.offset=|v_~#m2~0.offset_45|}  OutVars{#race=|v_#race_765|, 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_420|, ~#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], [1100#true, 778#L732-1true, 1111#true, 806#L781true, Black: 1106#true, 1098#true, 1108#(= |#race~state~0| 0), 64#L721-2true, 714#L789-2true, 1104#true, 1102#true])
[2025-03-14 01:19:27,953 INFO  L294   olderBase$Statistics]: this new event has 741 ancestors and is cut-off event
[2025-03-14 01:19:27,953 INFO  L297   olderBase$Statistics]:   existing Event has 727 ancestors and is cut-off event
[2025-03-14 01:19:27,953 INFO  L297   olderBase$Statistics]:   existing Event has 727 ancestors and is cut-off event
[2025-03-14 01:19:27,953 INFO  L297   olderBase$Statistics]:   existing Event has 741 ancestors and is cut-off event
[2025-03-14 01:19:27,954 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4209] L780-3-->L781: Formula: (let ((.cse1 (select |v_#race_765| |v_~#m2~0.base_45|)) (.cse5 (+ |v_~#m2~0.offset_45| 2))) (let ((.cse3 (+ |v_~#m2~0.offset_45| 1)) (.cse2 (+ |v_~#m2~0.offset_45| 3)) (.cse0 (select .cse1 .cse5)) (.cse4 (select |v_#memory_int_421| |v_~#m2~0.base_45|))) (and (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_45|) 1) 1 0) 0)) (= .cse0 (select .cse1 |v_~#m2~0.offset_45|)) (= |v_#race_765| (store |v_#race_767| |v_~#m2~0.base_45| (store (store (store (store (select |v_#race_767| |v_~#m2~0.base_45|) |v_~#m2~0.offset_45| .cse0) .cse3 .cse0) .cse5 .cse0) .cse2 .cse0))) (= |v_#memory_int_420| (store |v_#memory_int_421| |v_~#m2~0.base_45| (store .cse4 |v_~#m2~0.offset_45| 0))))))  InVars {#race=|v_#race_767|, #memory_int=|v_#memory_int_421|, ~#m2~0.base=|v_~#m2~0.base_45|, ~#m2~0.offset=|v_~#m2~0.offset_45|}  OutVars{#race=|v_#race_765|, 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_420|, ~#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], [1100#true, 1111#true, 806#L781true, Black: 1106#true, 1098#true, 1108#(= |#race~state~0| 0), 845#thr1Err22ASSERT_VIOLATIONDATA_RACEtrue, 64#L721-2true, 714#L789-2true, 1104#true, 1102#true])
[2025-03-14 01:19:27,954 INFO  L294   olderBase$Statistics]: this new event has 741 ancestors and is cut-off event
[2025-03-14 01:19:27,954 INFO  L297   olderBase$Statistics]:   existing Event has 727 ancestors and is cut-off event
[2025-03-14 01:19:27,954 INFO  L297   olderBase$Statistics]:   existing Event has 741 ancestors and is cut-off event
[2025-03-14 01:19:27,954 INFO  L297   olderBase$Statistics]:   existing Event has 727 ancestors and is cut-off event
[2025-03-14 01:19:27,957 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4209] L780-3-->L781: Formula: (let ((.cse1 (select |v_#race_765| |v_~#m2~0.base_45|)) (.cse5 (+ |v_~#m2~0.offset_45| 2))) (let ((.cse3 (+ |v_~#m2~0.offset_45| 1)) (.cse2 (+ |v_~#m2~0.offset_45| 3)) (.cse0 (select .cse1 .cse5)) (.cse4 (select |v_#memory_int_421| |v_~#m2~0.base_45|))) (and (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_45|) 1) 1 0) 0)) (= .cse0 (select .cse1 |v_~#m2~0.offset_45|)) (= |v_#race_765| (store |v_#race_767| |v_~#m2~0.base_45| (store (store (store (store (select |v_#race_767| |v_~#m2~0.base_45|) |v_~#m2~0.offset_45| .cse0) .cse3 .cse0) .cse5 .cse0) .cse2 .cse0))) (= |v_#memory_int_420| (store |v_#memory_int_421| |v_~#m2~0.base_45| (store .cse4 |v_~#m2~0.offset_45| 0))))))  InVars {#race=|v_#race_767|, #memory_int=|v_#memory_int_421|, ~#m2~0.base=|v_~#m2~0.base_45|, ~#m2~0.offset=|v_~#m2~0.offset_45|}  OutVars{#race=|v_#race_765|, 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_420|, ~#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], [1100#true, 1111#true, 695#L723true, 806#L781true, Black: 1106#true, 1098#true, 1108#(= |#race~state~0| 0), 491#L732-4true, 714#L789-2true, 1104#true, 1102#true])
[2025-03-14 01:19:27,957 INFO  L294   olderBase$Statistics]: this new event has 741 ancestors and is cut-off event
[2025-03-14 01:19:27,957 INFO  L297   olderBase$Statistics]:   existing Event has 727 ancestors and is cut-off event
[2025-03-14 01:19:27,957 INFO  L297   olderBase$Statistics]:   existing Event has 741 ancestors and is cut-off event
[2025-03-14 01:19:27,958 INFO  L297   olderBase$Statistics]:   existing Event has 727 ancestors and is cut-off event
[2025-03-14 01:19:28,283 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4209] L780-3-->L781: Formula: (let ((.cse1 (select |v_#race_765| |v_~#m2~0.base_45|)) (.cse5 (+ |v_~#m2~0.offset_45| 2))) (let ((.cse3 (+ |v_~#m2~0.offset_45| 1)) (.cse2 (+ |v_~#m2~0.offset_45| 3)) (.cse0 (select .cse1 .cse5)) (.cse4 (select |v_#memory_int_421| |v_~#m2~0.base_45|))) (and (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_45|) 1) 1 0) 0)) (= .cse0 (select .cse1 |v_~#m2~0.offset_45|)) (= |v_#race_765| (store |v_#race_767| |v_~#m2~0.base_45| (store (store (store (store (select |v_#race_767| |v_~#m2~0.base_45|) |v_~#m2~0.offset_45| .cse0) .cse3 .cse0) .cse5 .cse0) .cse2 .cse0))) (= |v_#memory_int_420| (store |v_#memory_int_421| |v_~#m2~0.base_45| (store .cse4 |v_~#m2~0.offset_45| 0))))))  InVars {#race=|v_#race_767|, #memory_int=|v_#memory_int_421|, ~#m2~0.base=|v_~#m2~0.base_45|, ~#m2~0.offset=|v_~#m2~0.offset_45|}  OutVars{#race=|v_#race_765|, 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_420|, ~#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], [1100#true, 1111#true, 806#L781true, 1098#true, Black: 1106#true, 1108#(= |#race~state~0| 0), 490#EBStack_init_returnLabel#1true, 64#L721-2true, 714#L789-2true, 1104#true, 1102#true])
[2025-03-14 01:19:28,283 INFO  L294   olderBase$Statistics]: this new event has 742 ancestors and is cut-off event
[2025-03-14 01:19:28,283 INFO  L297   olderBase$Statistics]:   existing Event has 728 ancestors and is cut-off event
[2025-03-14 01:19:28,283 INFO  L297   olderBase$Statistics]:   existing Event has 728 ancestors and is cut-off event
[2025-03-14 01:19:28,283 INFO  L297   olderBase$Statistics]:   existing Event has 742 ancestors and is cut-off event
[2025-03-14 01:19:28,286 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4209] L780-3-->L781: Formula: (let ((.cse1 (select |v_#race_765| |v_~#m2~0.base_45|)) (.cse5 (+ |v_~#m2~0.offset_45| 2))) (let ((.cse3 (+ |v_~#m2~0.offset_45| 1)) (.cse2 (+ |v_~#m2~0.offset_45| 3)) (.cse0 (select .cse1 .cse5)) (.cse4 (select |v_#memory_int_421| |v_~#m2~0.base_45|))) (and (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_45|) 1) 1 0) 0)) (= .cse0 (select .cse1 |v_~#m2~0.offset_45|)) (= |v_#race_765| (store |v_#race_767| |v_~#m2~0.base_45| (store (store (store (store (select |v_#race_767| |v_~#m2~0.base_45|) |v_~#m2~0.offset_45| .cse0) .cse3 .cse0) .cse5 .cse0) .cse2 .cse0))) (= |v_#memory_int_420| (store |v_#memory_int_421| |v_~#m2~0.base_45| (store .cse4 |v_~#m2~0.offset_45| 0))))))  InVars {#race=|v_#race_767|, #memory_int=|v_#memory_int_421|, ~#m2~0.base=|v_~#m2~0.base_45|, ~#m2~0.offset=|v_~#m2~0.offset_45|}  OutVars{#race=|v_#race_765|, 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_420|, ~#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], [1100#true, 1111#true, 806#L781true, 695#L723true, 224#L732-3true, Black: 1106#true, 1098#true, 1108#(= |#race~state~0| 0), 714#L789-2true, 1104#true, 1102#true])
[2025-03-14 01:19:28,286 INFO  L294   olderBase$Statistics]: this new event has 742 ancestors and is cut-off event
[2025-03-14 01:19:28,286 INFO  L297   olderBase$Statistics]:   existing Event has 728 ancestors and is cut-off event
[2025-03-14 01:19:28,286 INFO  L297   olderBase$Statistics]:   existing Event has 728 ancestors and is cut-off event
[2025-03-14 01:19:28,286 INFO  L297   olderBase$Statistics]:   existing Event has 742 ancestors and is cut-off event
[2025-03-14 01:19:28,757 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4209] L780-3-->L781: Formula: (let ((.cse1 (select |v_#race_765| |v_~#m2~0.base_45|)) (.cse5 (+ |v_~#m2~0.offset_45| 2))) (let ((.cse3 (+ |v_~#m2~0.offset_45| 1)) (.cse2 (+ |v_~#m2~0.offset_45| 3)) (.cse0 (select .cse1 .cse5)) (.cse4 (select |v_#memory_int_421| |v_~#m2~0.base_45|))) (and (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_45|) 1) 1 0) 0)) (= .cse0 (select .cse1 |v_~#m2~0.offset_45|)) (= |v_#race_765| (store |v_#race_767| |v_~#m2~0.base_45| (store (store (store (store (select |v_#race_767| |v_~#m2~0.base_45|) |v_~#m2~0.offset_45| .cse0) .cse3 .cse0) .cse5 .cse0) .cse2 .cse0))) (= |v_#memory_int_420| (store |v_#memory_int_421| |v_~#m2~0.base_45| (store .cse4 |v_~#m2~0.offset_45| 0))))))  InVars {#race=|v_#race_767|, #memory_int=|v_#memory_int_421|, ~#m2~0.base=|v_~#m2~0.base_45|, ~#m2~0.offset=|v_~#m2~0.offset_45|}  OutVars{#race=|v_#race_765|, 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_420|, ~#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], [1100#true, 1111#true, 806#L781true, 1098#true, Black: 1106#true, 1108#(= |#race~state~0| 0), 351#L777true, 64#L721-2true, 714#L789-2true, 1104#true, 1102#true])
[2025-03-14 01:19:28,757 INFO  L294   olderBase$Statistics]: this new event has 743 ancestors and is cut-off event
[2025-03-14 01:19:28,757 INFO  L297   olderBase$Statistics]:   existing Event has 729 ancestors and is cut-off event
[2025-03-14 01:19:28,757 INFO  L297   olderBase$Statistics]:   existing Event has 729 ancestors and is cut-off event
[2025-03-14 01:19:28,757 INFO  L297   olderBase$Statistics]:   existing Event has 743 ancestors and is cut-off event
[2025-03-14 01:19:28,760 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4209] L780-3-->L781: Formula: (let ((.cse1 (select |v_#race_765| |v_~#m2~0.base_45|)) (.cse5 (+ |v_~#m2~0.offset_45| 2))) (let ((.cse3 (+ |v_~#m2~0.offset_45| 1)) (.cse2 (+ |v_~#m2~0.offset_45| 3)) (.cse0 (select .cse1 .cse5)) (.cse4 (select |v_#memory_int_421| |v_~#m2~0.base_45|))) (and (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_45|) 1) 1 0) 0)) (= .cse0 (select .cse1 |v_~#m2~0.offset_45|)) (= |v_#race_765| (store |v_#race_767| |v_~#m2~0.base_45| (store (store (store (store (select |v_#race_767| |v_~#m2~0.base_45|) |v_~#m2~0.offset_45| .cse0) .cse3 .cse0) .cse5 .cse0) .cse2 .cse0))) (= |v_#memory_int_420| (store |v_#memory_int_421| |v_~#m2~0.base_45| (store .cse4 |v_~#m2~0.offset_45| 0))))))  InVars {#race=|v_#race_767|, #memory_int=|v_#memory_int_421|, ~#m2~0.base=|v_~#m2~0.base_45|, ~#m2~0.offset=|v_~#m2~0.offset_45|}  OutVars{#race=|v_#race_765|, 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_420|, ~#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], [1100#true, 1111#true, 806#L781true, 695#L723true, Black: 1106#true, 1098#true, 1108#(= |#race~state~0| 0), 714#L789-2true, 1104#true, 1102#true, 833#L732-2true])
[2025-03-14 01:19:28,760 INFO  L294   olderBase$Statistics]: this new event has 743 ancestors and is cut-off event
[2025-03-14 01:19:28,760 INFO  L297   olderBase$Statistics]:   existing Event has 743 ancestors and is cut-off event
[2025-03-14 01:19:28,760 INFO  L297   olderBase$Statistics]:   existing Event has 729 ancestors and is cut-off event
[2025-03-14 01:19:28,760 INFO  L297   olderBase$Statistics]:   existing Event has 729 ancestors and is cut-off event
[2025-03-14 01:19:29,099 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4209] L780-3-->L781: Formula: (let ((.cse1 (select |v_#race_765| |v_~#m2~0.base_45|)) (.cse5 (+ |v_~#m2~0.offset_45| 2))) (let ((.cse3 (+ |v_~#m2~0.offset_45| 1)) (.cse2 (+ |v_~#m2~0.offset_45| 3)) (.cse0 (select .cse1 .cse5)) (.cse4 (select |v_#memory_int_421| |v_~#m2~0.base_45|))) (and (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_45|) 1) 1 0) 0)) (= .cse0 (select .cse1 |v_~#m2~0.offset_45|)) (= |v_#race_765| (store |v_#race_767| |v_~#m2~0.base_45| (store (store (store (store (select |v_#race_767| |v_~#m2~0.base_45|) |v_~#m2~0.offset_45| .cse0) .cse3 .cse0) .cse5 .cse0) .cse2 .cse0))) (= |v_#memory_int_420| (store |v_#memory_int_421| |v_~#m2~0.base_45| (store .cse4 |v_~#m2~0.offset_45| 0))))))  InVars {#race=|v_#race_767|, #memory_int=|v_#memory_int_421|, ~#m2~0.base=|v_~#m2~0.base_45|, ~#m2~0.offset=|v_~#m2~0.offset_45|}  OutVars{#race=|v_#race_765|, 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_420|, ~#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], [1100#true, 1111#true, 806#L781true, 695#L723true, 658#L732true, Black: 1106#true, 1098#true, 1108#(= |#race~state~0| 0), 714#L789-2true, 1104#true, 1102#true])
[2025-03-14 01:19:29,099 INFO  L294   olderBase$Statistics]: this new event has 744 ancestors and is cut-off event
[2025-03-14 01:19:29,099 INFO  L297   olderBase$Statistics]:   existing Event has 730 ancestors and is cut-off event
[2025-03-14 01:19:29,099 INFO  L297   olderBase$Statistics]:   existing Event has 730 ancestors and is cut-off event
[2025-03-14 01:19:29,099 INFO  L297   olderBase$Statistics]:   existing Event has 744 ancestors and is cut-off event
[2025-03-14 01:19:29,442 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4209] L780-3-->L781: Formula: (let ((.cse1 (select |v_#race_765| |v_~#m2~0.base_45|)) (.cse5 (+ |v_~#m2~0.offset_45| 2))) (let ((.cse3 (+ |v_~#m2~0.offset_45| 1)) (.cse2 (+ |v_~#m2~0.offset_45| 3)) (.cse0 (select .cse1 .cse5)) (.cse4 (select |v_#memory_int_421| |v_~#m2~0.base_45|))) (and (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_45|) 1) 1 0) 0)) (= .cse0 (select .cse1 |v_~#m2~0.offset_45|)) (= |v_#race_765| (store |v_#race_767| |v_~#m2~0.base_45| (store (store (store (store (select |v_#race_767| |v_~#m2~0.base_45|) |v_~#m2~0.offset_45| .cse0) .cse3 .cse0) .cse5 .cse0) .cse2 .cse0))) (= |v_#memory_int_420| (store |v_#memory_int_421| |v_~#m2~0.base_45| (store .cse4 |v_~#m2~0.offset_45| 0))))))  InVars {#race=|v_#race_767|, #memory_int=|v_#memory_int_421|, ~#m2~0.base=|v_~#m2~0.base_45|, ~#m2~0.offset=|v_~#m2~0.offset_45|}  OutVars{#race=|v_#race_765|, 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_420|, ~#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], [1100#true, 778#L732-1true, 1111#true, 695#L723true, 806#L781true, Black: 1106#true, 1098#true, 1108#(= |#race~state~0| 0), 714#L789-2true, 1104#true, 1102#true])
[2025-03-14 01:19:29,443 INFO  L294   olderBase$Statistics]: this new event has 745 ancestors and is cut-off event
[2025-03-14 01:19:29,443 INFO  L297   olderBase$Statistics]:   existing Event has 745 ancestors and is cut-off event
[2025-03-14 01:19:29,443 INFO  L297   olderBase$Statistics]:   existing Event has 731 ancestors and is cut-off event
[2025-03-14 01:19:29,443 INFO  L297   olderBase$Statistics]:   existing Event has 731 ancestors and is cut-off event
[2025-03-14 01:19:29,443 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4209] L780-3-->L781: Formula: (let ((.cse1 (select |v_#race_765| |v_~#m2~0.base_45|)) (.cse5 (+ |v_~#m2~0.offset_45| 2))) (let ((.cse3 (+ |v_~#m2~0.offset_45| 1)) (.cse2 (+ |v_~#m2~0.offset_45| 3)) (.cse0 (select .cse1 .cse5)) (.cse4 (select |v_#memory_int_421| |v_~#m2~0.base_45|))) (and (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_45|) 1) 1 0) 0)) (= .cse0 (select .cse1 |v_~#m2~0.offset_45|)) (= |v_#race_765| (store |v_#race_767| |v_~#m2~0.base_45| (store (store (store (store (select |v_#race_767| |v_~#m2~0.base_45|) |v_~#m2~0.offset_45| .cse0) .cse3 .cse0) .cse5 .cse0) .cse2 .cse0))) (= |v_#memory_int_420| (store |v_#memory_int_421| |v_~#m2~0.base_45| (store .cse4 |v_~#m2~0.offset_45| 0))))))  InVars {#race=|v_#race_767|, #memory_int=|v_#memory_int_421|, ~#m2~0.base=|v_~#m2~0.base_45|, ~#m2~0.offset=|v_~#m2~0.offset_45|}  OutVars{#race=|v_#race_765|, 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_420|, ~#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], [1100#true, 778#L732-1true, 1111#true, 695#L723true, 806#L781true, Black: 1106#true, 1098#true, 1108#(= |#race~state~0| 0), 714#L789-2true, 1104#true, 1102#true])
[2025-03-14 01:19:29,443 INFO  L294   olderBase$Statistics]: this new event has 745 ancestors and is cut-off event
[2025-03-14 01:19:29,443 INFO  L297   olderBase$Statistics]:   existing Event has 745 ancestors and is cut-off event
[2025-03-14 01:19:29,443 INFO  L297   olderBase$Statistics]:   existing Event has 731 ancestors and is cut-off event
[2025-03-14 01:19:29,443 INFO  L297   olderBase$Statistics]:   existing Event has 731 ancestors and is cut-off event
[2025-03-14 01:19:29,444 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4209] L780-3-->L781: Formula: (let ((.cse1 (select |v_#race_765| |v_~#m2~0.base_45|)) (.cse5 (+ |v_~#m2~0.offset_45| 2))) (let ((.cse3 (+ |v_~#m2~0.offset_45| 1)) (.cse2 (+ |v_~#m2~0.offset_45| 3)) (.cse0 (select .cse1 .cse5)) (.cse4 (select |v_#memory_int_421| |v_~#m2~0.base_45|))) (and (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_45|) 1) 1 0) 0)) (= .cse0 (select .cse1 |v_~#m2~0.offset_45|)) (= |v_#race_765| (store |v_#race_767| |v_~#m2~0.base_45| (store (store (store (store (select |v_#race_767| |v_~#m2~0.base_45|) |v_~#m2~0.offset_45| .cse0) .cse3 .cse0) .cse5 .cse0) .cse2 .cse0))) (= |v_#memory_int_420| (store |v_#memory_int_421| |v_~#m2~0.base_45| (store .cse4 |v_~#m2~0.offset_45| 0))))))  InVars {#race=|v_#race_767|, #memory_int=|v_#memory_int_421|, ~#m2~0.base=|v_~#m2~0.base_45|, ~#m2~0.offset=|v_~#m2~0.offset_45|}  OutVars{#race=|v_#race_765|, 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_420|, ~#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], [1100#true, 1111#true, 695#L723true, 806#L781true, Black: 1106#true, 1098#true, 1108#(= |#race~state~0| 0), 845#thr1Err22ASSERT_VIOLATIONDATA_RACEtrue, 714#L789-2true, 1104#true, 1102#true])
[2025-03-14 01:19:29,444 INFO  L294   olderBase$Statistics]: this new event has 745 ancestors and is cut-off event
[2025-03-14 01:19:29,444 INFO  L297   olderBase$Statistics]:   existing Event has 731 ancestors and is cut-off event
[2025-03-14 01:19:29,444 INFO  L297   olderBase$Statistics]:   existing Event has 745 ancestors and is cut-off event
[2025-03-14 01:19:29,444 INFO  L297   olderBase$Statistics]:   existing Event has 731 ancestors and is cut-off event
[2025-03-14 01:19:30,070 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4209] L780-3-->L781: Formula: (let ((.cse1 (select |v_#race_765| |v_~#m2~0.base_45|)) (.cse5 (+ |v_~#m2~0.offset_45| 2))) (let ((.cse3 (+ |v_~#m2~0.offset_45| 1)) (.cse2 (+ |v_~#m2~0.offset_45| 3)) (.cse0 (select .cse1 .cse5)) (.cse4 (select |v_#memory_int_421| |v_~#m2~0.base_45|))) (and (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_45|) 1) 1 0) 0)) (= .cse0 (select .cse1 |v_~#m2~0.offset_45|)) (= |v_#race_765| (store |v_#race_767| |v_~#m2~0.base_45| (store (store (store (store (select |v_#race_767| |v_~#m2~0.base_45|) |v_~#m2~0.offset_45| .cse0) .cse3 .cse0) .cse5 .cse0) .cse2 .cse0))) (= |v_#memory_int_420| (store |v_#memory_int_421| |v_~#m2~0.base_45| (store .cse4 |v_~#m2~0.offset_45| 0))))))  InVars {#race=|v_#race_767|, #memory_int=|v_#memory_int_421|, ~#m2~0.base=|v_~#m2~0.base_45|, ~#m2~0.offset=|v_~#m2~0.offset_45|}  OutVars{#race=|v_#race_765|, 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_420|, ~#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], [1100#true, 1111#true, 695#L723true, 806#L781true, 1098#true, Black: 1106#true, 1108#(= |#race~state~0| 0), 490#EBStack_init_returnLabel#1true, 714#L789-2true, 1104#true, 1102#true])
[2025-03-14 01:19:30,071 INFO  L294   olderBase$Statistics]: this new event has 746 ancestors and is cut-off event
[2025-03-14 01:19:30,071 INFO  L297   olderBase$Statistics]:   existing Event has 746 ancestors and is cut-off event
[2025-03-14 01:19:30,071 INFO  L297   olderBase$Statistics]:   existing Event has 732 ancestors and is cut-off event
[2025-03-14 01:19:30,071 INFO  L297   olderBase$Statistics]:   existing Event has 732 ancestors and is cut-off event
[2025-03-14 01:19:30,581 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4209] L780-3-->L781: Formula: (let ((.cse1 (select |v_#race_765| |v_~#m2~0.base_45|)) (.cse5 (+ |v_~#m2~0.offset_45| 2))) (let ((.cse3 (+ |v_~#m2~0.offset_45| 1)) (.cse2 (+ |v_~#m2~0.offset_45| 3)) (.cse0 (select .cse1 .cse5)) (.cse4 (select |v_#memory_int_421| |v_~#m2~0.base_45|))) (and (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_45|) 1) 1 0) 0)) (= .cse0 (select .cse1 |v_~#m2~0.offset_45|)) (= |v_#race_765| (store |v_#race_767| |v_~#m2~0.base_45| (store (store (store (store (select |v_#race_767| |v_~#m2~0.base_45|) |v_~#m2~0.offset_45| .cse0) .cse3 .cse0) .cse5 .cse0) .cse2 .cse0))) (= |v_#memory_int_420| (store |v_#memory_int_421| |v_~#m2~0.base_45| (store .cse4 |v_~#m2~0.offset_45| 0))))))  InVars {#race=|v_#race_767|, #memory_int=|v_#memory_int_421|, ~#m2~0.base=|v_~#m2~0.base_45|, ~#m2~0.offset=|v_~#m2~0.offset_45|}  OutVars{#race=|v_#race_765|, 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_420|, ~#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], [1100#true, 1111#true, 695#L723true, 806#L781true, 1098#true, Black: 1106#true, 1108#(= |#race~state~0| 0), 351#L777true, 714#L789-2true, 1104#true, 1102#true])
[2025-03-14 01:19:30,581 INFO  L294   olderBase$Statistics]: this new event has 747 ancestors and is cut-off event
[2025-03-14 01:19:30,581 INFO  L297   olderBase$Statistics]:   existing Event has 733 ancestors and is cut-off event
[2025-03-14 01:19:30,581 INFO  L297   olderBase$Statistics]:   existing Event has 747 ancestors and is cut-off event
[2025-03-14 01:19:30,581 INFO  L297   olderBase$Statistics]:   existing Event has 733 ancestors and is cut-off event
[2025-03-14 01:19:34,889 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4209] L780-3-->L781: Formula: (let ((.cse1 (select |v_#race_765| |v_~#m2~0.base_45|)) (.cse5 (+ |v_~#m2~0.offset_45| 2))) (let ((.cse3 (+ |v_~#m2~0.offset_45| 1)) (.cse2 (+ |v_~#m2~0.offset_45| 3)) (.cse0 (select .cse1 .cse5)) (.cse4 (select |v_#memory_int_421| |v_~#m2~0.base_45|))) (and (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (not (= (ite (= (select .cse4 |v_~#m2~0.offset_45|) 1) 1 0) 0)) (= .cse0 (select .cse1 |v_~#m2~0.offset_45|)) (= |v_#race_765| (store |v_#race_767| |v_~#m2~0.base_45| (store (store (store (store (select |v_#race_767| |v_~#m2~0.base_45|) |v_~#m2~0.offset_45| .cse0) .cse3 .cse0) .cse5 .cse0) .cse2 .cse0))) (= |v_#memory_int_420| (store |v_#memory_int_421| |v_~#m2~0.base_45| (store .cse4 |v_~#m2~0.offset_45| 0))))))  InVars {#race=|v_#race_767|, #memory_int=|v_#memory_int_421|, ~#m2~0.base=|v_~#m2~0.base_45|, ~#m2~0.offset=|v_~#m2~0.offset_45|}  OutVars{#race=|v_#race_765|, 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_420|, ~#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], [503#L729-1true, 1100#true, 1111#true, 806#L781true, Black: 1106#true, 1098#true, 1108#(= |#race~state~0| 0), 845#thr1Err22ASSERT_VIOLATIONDATA_RACEtrue, 714#L789-2true, 1104#true, 1102#true])
[2025-03-14 01:19:34,890 INFO  L294   olderBase$Statistics]: this new event has 755 ancestors and is cut-off event
[2025-03-14 01:19:34,890 INFO  L297   olderBase$Statistics]:   existing Event has 741 ancestors and is cut-off event
[2025-03-14 01:19:34,890 INFO  L297   olderBase$Statistics]:   existing Event has 741 ancestors and is cut-off event
[2025-03-14 01:19:34,890 INFO  L297   olderBase$Statistics]:   existing Event has 755 ancestors and is cut-off event