./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs-b.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs-b.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bee6bfabfc9168d01d046a770b423c49a0035ad8b39e289385170f3b76ba2fb2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:02:03,028 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:02:03,074 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-06 09:02:03,078 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:02:03,078 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:02:03,092 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:02:03,092 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:02:03,092 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:02:03,093 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:02:03,093 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:02:03,093 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:02:03,093 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:02:03,093 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:02:03,093 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:02:03,093 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:02:03,093 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:02:03,093 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:02:03,093 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:02:03,094 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:02:03,094 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:02:03,094 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:02:03,094 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:02:03,094 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:02:03,094 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:02:03,094 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:02:03,094 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:02:03,094 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:02:03,094 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:02:03,095 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:02:03,095 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:02:03,095 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:02:03,095 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:02:03,095 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:02:03,095 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:02:03,095 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:02:03,095 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:02:03,095 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:02:03,095 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:02:03,095 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:02:03,095 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:02:03,095 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:02:03,095 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:02:03,095 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bee6bfabfc9168d01d046a770b423c49a0035ad8b39e289385170f3b76ba2fb2 [2025-02-06 09:02:03,325 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:02:03,334 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:02:03,336 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:02:03,337 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:02:03,337 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:02:03,338 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs-b.i [2025-02-06 09:02:04,507 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fab922341/32de624e601c4a9fa5a990576c8e93cb/FLAG7a5173efb [2025-02-06 09:02:04,806 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:02:04,809 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs-b.i [2025-02-06 09:02:04,823 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fab922341/32de624e601c4a9fa5a990576c8e93cb/FLAG7a5173efb [2025-02-06 09:02:05,070 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fab922341/32de624e601c4a9fa5a990576c8e93cb [2025-02-06 09:02:05,072 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:02:05,074 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:02:05,075 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:02:05,075 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:02:05,078 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:02:05,079 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:02:05" (1/1) ... [2025-02-06 09:02:05,079 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48c12871 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:02:05, skipping insertion in model container [2025-02-06 09:02:05,079 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:02:05" (1/1) ... [2025-02-06 09:02:05,105 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:02:05,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:02:05,302 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:02:05,327 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:02:05,349 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:02:05,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:02:05 WrapperNode [2025-02-06 09:02:05,349 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:02:05,350 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:02:05,350 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:02:05,350 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:02:05,354 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:02:05" (1/1) ... [2025-02-06 09:02:05,364 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:02:05" (1/1) ... [2025-02-06 09:02:05,389 INFO L138 Inliner]: procedures = 169, calls = 16, calls flagged for inlining = 6, calls inlined = 9, statements flattened = 175 [2025-02-06 09:02:05,389 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:02:05,390 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:02:05,390 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:02:05,390 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:02:05,397 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:02:05" (1/1) ... [2025-02-06 09:02:05,398 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:02:05" (1/1) ... [2025-02-06 09:02:05,400 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:02:05" (1/1) ... [2025-02-06 09:02:05,400 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:02:05" (1/1) ... [2025-02-06 09:02:05,405 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:02:05" (1/1) ... [2025-02-06 09:02:05,406 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:02:05" (1/1) ... [2025-02-06 09:02:05,407 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:02:05" (1/1) ... [2025-02-06 09:02:05,408 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:02:05" (1/1) ... [2025-02-06 09:02:05,409 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:02:05,410 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:02:05,410 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:02:05,410 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:02:05,411 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:02:05" (1/1) ... [2025-02-06 09:02:05,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:02:05,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:02:05,441 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 09:02:05,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 09:02:05,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 09:02:05,466 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-02-06 09:02:05,466 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-02-06 09:02:05,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 09:02:05,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:02:05,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 09:02:05,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 09:02:05,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 09:02:05,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:02:05,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:02:05,468 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 09:02:05,553 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:02:05,555 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:02:05,744 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L700: havoc ~#l~0#1.base, ~#l~0#1.offset; [2025-02-06 09:02:05,744 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L700-1: SUMMARY for call ULTIMATE.dealloc(~#l~0#1.base, ~#l~0#1.offset); srcloc: null [2025-02-06 09:02:05,843 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L700: havoc thr1_~#l~0#1.base, thr1_~#l~0#1.offset; [2025-02-06 09:02:05,843 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L700-1: SUMMARY for call ULTIMATE.dealloc(thr1_~#l~0#1.base, thr1_~#l~0#1.offset); srcloc: null [2025-02-06 09:02:05,844 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:02:05,844 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:02:05,922 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:02:05,923 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:02:05,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:02:05 BoogieIcfgContainer [2025-02-06 09:02:05,923 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:02:05,925 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:02:05,925 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:02:05,928 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:02:05,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:02:05" (1/3) ... [2025-02-06 09:02:05,929 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@744c587a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:02:05, skipping insertion in model container [2025-02-06 09:02:05,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:02:05" (2/3) ... [2025-02-06 09:02:05,929 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@744c587a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:02:05, skipping insertion in model container [2025-02-06 09:02:05,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:02:05" (3/3) ... [2025-02-06 09:02:05,930 INFO L128 eAbstractionObserver]: Analyzing ICFG 48_ticket_lock_low_contention_vs-b.i [2025-02-06 09:02:05,940 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:02:05,941 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 48_ticket_lock_low_contention_vs-b.i that has 2 procedures, 149 locations, 1 initial locations, 3 loop locations, and 24 error locations. [2025-02-06 09:02:05,941 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:02:06,002 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 09:02:06,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 158 transitions, 320 flow [2025-02-06 09:02:06,100 INFO L124 PetriNetUnfolderBase]: 14/240 cut-off events. [2025-02-06 09:02:06,102 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:02:06,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 244 conditions, 240 events. 14/240 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 850 event pairs, 0 based on Foata normal form. 0/188 useless extension candidates. Maximal degree in co-relation 144. Up to 4 conditions per place. [2025-02-06 09:02:06,108 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 158 transitions, 320 flow [2025-02-06 09:02:06,111 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 152 places, 158 transitions, 320 flow [2025-02-06 09:02:06,116 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:02:06,123 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;@28ef0440, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:02:06,123 INFO L334 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2025-02-06 09:02:06,128 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:02:06,129 INFO L124 PetriNetUnfolderBase]: 1/27 cut-off events. [2025-02-06 09:02:06,129 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:02:06,129 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:02:06,129 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:02:06,129 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thr1Err11ASSERT_VIOLATIONDATA_RACE, thr1Err10ASSERT_VIOLATIONDATA_RACE, thr1Err9ASSERT_VIOLATIONDATA_RACE, thr1Err8ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2025-02-06 09:02:06,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:02:06,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1296852478, now seen corresponding path program 1 times [2025-02-06 09:02:06,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:02:06,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735554476] [2025-02-06 09:02:06,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:02:06,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:02:06,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 09:02:06,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 09:02:06,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:02:06,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:02:06,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:02:06,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:02:06,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735554476] [2025-02-06 09:02:06,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735554476] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:02:06,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:02:06,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:02:06,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647039174] [2025-02-06 09:02:06,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:02:06,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 09:02:06,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:02:06,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 09:02:06,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 09:02:06,277 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 158 [2025-02-06 09:02:06,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 158 transitions, 320 flow. Second operand has 2 states, 2 states have (on average 137.0) internal successors, (274), 2 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:02:06,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:02:06,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 158 [2025-02-06 09:02:06,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:02:06,325 INFO L124 PetriNetUnfolderBase]: 5/259 cut-off events. [2025-02-06 09:02:06,325 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:02:06,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 270 conditions, 259 events. 5/259 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 807 event pairs, 1 based on Foata normal form. 16/236 useless extension candidates. Maximal degree in co-relation 178. Up to 7 conditions per place. [2025-02-06 09:02:06,328 INFO L140 encePairwiseOnDemand]: 141/158 looper letters, 3 selfloop transitions, 0 changer transitions 0/137 dead transitions. [2025-02-06 09:02:06,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 137 transitions, 284 flow [2025-02-06 09:02:06,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 09:02:06,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-06 09:02:06,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 292 transitions. [2025-02-06 09:02:06,339 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9240506329113924 [2025-02-06 09:02:06,340 INFO L175 Difference]: Start difference. First operand has 152 places, 158 transitions, 320 flow. Second operand 2 states and 292 transitions. [2025-02-06 09:02:06,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 137 transitions, 284 flow [2025-02-06 09:02:06,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 137 transitions, 284 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:02:06,345 INFO L231 Difference]: Finished difference. Result has 139 places, 137 transitions, 278 flow [2025-02-06 09:02:06,347 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=278, PETRI_PLACES=139, PETRI_TRANSITIONS=137} [2025-02-06 09:02:06,350 INFO L279 CegarLoopForPetriNet]: 152 programPoint places, -13 predicate places. [2025-02-06 09:02:06,350 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 137 transitions, 278 flow [2025-02-06 09:02:06,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 137.0) internal successors, (274), 2 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:02:06,350 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:02:06,350 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:02:06,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:02:06,351 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err11ASSERT_VIOLATIONDATA_RACE, thr1Err10ASSERT_VIOLATIONDATA_RACE, thr1Err9ASSERT_VIOLATIONDATA_RACE, thr1Err8ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2025-02-06 09:02:06,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:02:06,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1813384056, now seen corresponding path program 1 times [2025-02-06 09:02:06,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:02:06,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145585933] [2025-02-06 09:02:06,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:02:06,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:02:06,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 09:02:06,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 09:02:06,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:02:06,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:02:06,377 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 09:02:06,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 09:02:06,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 09:02:06,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:02:06,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:02:06,416 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 09:02:06,416 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 09:02:06,418 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 37 remaining) [2025-02-06 09:02:06,419 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (35 of 37 remaining) [2025-02-06 09:02:06,419 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (34 of 37 remaining) [2025-02-06 09:02:06,419 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (33 of 37 remaining) [2025-02-06 09:02:06,419 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (32 of 37 remaining) [2025-02-06 09:02:06,419 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (31 of 37 remaining) [2025-02-06 09:02:06,420 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (30 of 37 remaining) [2025-02-06 09:02:06,420 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (29 of 37 remaining) [2025-02-06 09:02:06,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (28 of 37 remaining) [2025-02-06 09:02:06,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (27 of 37 remaining) [2025-02-06 09:02:06,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (26 of 37 remaining) [2025-02-06 09:02:06,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (25 of 37 remaining) [2025-02-06 09:02:06,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (24 of 37 remaining) [2025-02-06 09:02:06,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (23 of 37 remaining) [2025-02-06 09:02:06,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (22 of 37 remaining) [2025-02-06 09:02:06,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (21 of 37 remaining) [2025-02-06 09:02:06,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (20 of 37 remaining) [2025-02-06 09:02:06,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (19 of 37 remaining) [2025-02-06 09:02:06,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (18 of 37 remaining) [2025-02-06 09:02:06,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (17 of 37 remaining) [2025-02-06 09:02:06,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (16 of 37 remaining) [2025-02-06 09:02:06,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (15 of 37 remaining) [2025-02-06 09:02:06,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (14 of 37 remaining) [2025-02-06 09:02:06,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (13 of 37 remaining) [2025-02-06 09:02:06,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 37 remaining) [2025-02-06 09:02:06,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (11 of 37 remaining) [2025-02-06 09:02:06,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (10 of 37 remaining) [2025-02-06 09:02:06,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (9 of 37 remaining) [2025-02-06 09:02:06,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (8 of 37 remaining) [2025-02-06 09:02:06,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (7 of 37 remaining) [2025-02-06 09:02:06,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (6 of 37 remaining) [2025-02-06 09:02:06,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (5 of 37 remaining) [2025-02-06 09:02:06,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (4 of 37 remaining) [2025-02-06 09:02:06,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (3 of 37 remaining) [2025-02-06 09:02:06,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 37 remaining) [2025-02-06 09:02:06,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 37 remaining) [2025-02-06 09:02:06,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 37 remaining) [2025-02-06 09:02:06,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:02:06,422 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-06 09:02:06,424 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 09:02:06,424 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-06 09:02:06,462 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 09:02:06,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 213 places, 221 transitions, 452 flow [2025-02-06 09:02:06,504 INFO L124 PetriNetUnfolderBase]: 23/385 cut-off events. [2025-02-06 09:02:06,504 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 09:02:06,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 393 conditions, 385 events. 23/385 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1772 event pairs, 0 based on Foata normal form. 0/299 useless extension candidates. Maximal degree in co-relation 241. Up to 6 conditions per place. [2025-02-06 09:02:06,507 INFO L82 GeneralOperation]: Start removeDead. Operand has 213 places, 221 transitions, 452 flow [2025-02-06 09:02:06,510 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 213 places, 221 transitions, 452 flow [2025-02-06 09:02:06,511 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:02:06,511 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;@28ef0440, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:02:06,511 INFO L334 AbstractCegarLoop]: Starting to check reachability of 49 error locations. [2025-02-06 09:02:06,513 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:02:06,513 INFO L124 PetriNetUnfolderBase]: 1/27 cut-off events. [2025-02-06 09:02:06,513 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:02:06,513 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:02:06,513 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:02:06,514 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thr1Err11ASSERT_VIOLATIONDATA_RACE, thr1Err10ASSERT_VIOLATIONDATA_RACE, thr1Err9ASSERT_VIOLATIONDATA_RACE, thr1Err8ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2025-02-06 09:02:06,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:02:06,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1291657787, now seen corresponding path program 1 times [2025-02-06 09:02:06,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:02:06,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892372393] [2025-02-06 09:02:06,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:02:06,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:02:06,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 09:02:06,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 09:02:06,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:02:06,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:02:06,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:02:06,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:02:06,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892372393] [2025-02-06 09:02:06,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892372393] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:02:06,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:02:06,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:02:06,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778622264] [2025-02-06 09:02:06,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:02:06,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 09:02:06,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:02:06,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 09:02:06,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 09:02:06,559 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 221 [2025-02-06 09:02:06,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 221 transitions, 452 flow. Second operand has 2 states, 2 states have (on average 189.0) internal successors, (378), 2 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:02:06,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:02:06,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 221 [2025-02-06 09:02:06,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:02:06,701 INFO L124 PetriNetUnfolderBase]: 18/639 cut-off events. [2025-02-06 09:02:06,701 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-02-06 09:02:06,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 671 conditions, 639 events. 18/639 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3665 event pairs, 7 based on Foata normal form. 46/578 useless extension candidates. Maximal degree in co-relation 392. Up to 21 conditions per place. [2025-02-06 09:02:06,706 INFO L140 encePairwiseOnDemand]: 196/221 looper letters, 5 selfloop transitions, 0 changer transitions 0/190 dead transitions. [2025-02-06 09:02:06,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 190 transitions, 400 flow [2025-02-06 09:02:06,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 09:02:06,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-06 09:02:06,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 406 transitions. [2025-02-06 09:02:06,708 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.918552036199095 [2025-02-06 09:02:06,708 INFO L175 Difference]: Start difference. First operand has 213 places, 221 transitions, 452 flow. Second operand 2 states and 406 transitions. [2025-02-06 09:02:06,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 190 transitions, 400 flow [2025-02-06 09:02:06,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 190 transitions, 400 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:02:06,715 INFO L231 Difference]: Finished difference. Result has 193 places, 190 transitions, 390 flow [2025-02-06 09:02:06,715 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=390, PETRI_PLACES=193, PETRI_TRANSITIONS=190} [2025-02-06 09:02:06,715 INFO L279 CegarLoopForPetriNet]: 213 programPoint places, -20 predicate places. [2025-02-06 09:02:06,715 INFO L471 AbstractCegarLoop]: Abstraction has has 193 places, 190 transitions, 390 flow [2025-02-06 09:02:06,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 189.0) internal successors, (378), 2 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:02:06,716 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:02:06,716 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] [2025-02-06 09:02:06,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:02:06,716 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thr1Err11ASSERT_VIOLATIONDATA_RACE, thr1Err10ASSERT_VIOLATIONDATA_RACE, thr1Err9ASSERT_VIOLATIONDATA_RACE, thr1Err8ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2025-02-06 09:02:06,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:02:06,716 INFO L85 PathProgramCache]: Analyzing trace with hash -717463100, now seen corresponding path program 1 times [2025-02-06 09:02:06,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:02:06,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74735963] [2025-02-06 09:02:06,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:02:06,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:02:06,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 09:02:06,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 09:02:06,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:02:06,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:02:07,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:02:07,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:02:07,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74735963] [2025-02-06 09:02:07,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74735963] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:02:07,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:02:07,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:02:07,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139130057] [2025-02-06 09:02:07,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:02:07,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:02:07,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:02:07,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:02:07,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:02:07,283 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 221 [2025-02-06 09:02:07,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 190 transitions, 390 flow. Second operand has 6 states, 6 states have (on average 179.33333333333334) internal successors, (1076), 6 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:02:07,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:02:07,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 221 [2025-02-06 09:02:07,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:02:07,583 INFO L124 PetriNetUnfolderBase]: 134/2734 cut-off events. [2025-02-06 09:02:07,584 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-02-06 09:02:07,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2958 conditions, 2734 events. 134/2734 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 24815 event pairs, 33 based on Foata normal form. 0/2267 useless extension candidates. Maximal degree in co-relation 2953. Up to 141 conditions per place. [2025-02-06 09:02:07,604 INFO L140 encePairwiseOnDemand]: 212/221 looper letters, 18 selfloop transitions, 14 changer transitions 0/207 dead transitions. [2025-02-06 09:02:07,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 207 transitions, 488 flow [2025-02-06 09:02:07,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:02:07,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:02:07,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1101 transitions. [2025-02-06 09:02:07,608 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.830316742081448 [2025-02-06 09:02:07,608 INFO L175 Difference]: Start difference. First operand has 193 places, 190 transitions, 390 flow. Second operand 6 states and 1101 transitions. [2025-02-06 09:02:07,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 207 transitions, 488 flow [2025-02-06 09:02:07,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 207 transitions, 488 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:02:07,613 INFO L231 Difference]: Finished difference. Result has 203 places, 204 transitions, 492 flow [2025-02-06 09:02:07,615 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=492, PETRI_PLACES=203, PETRI_TRANSITIONS=204} [2025-02-06 09:02:07,615 INFO L279 CegarLoopForPetriNet]: 213 programPoint places, -10 predicate places. [2025-02-06 09:02:07,616 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 204 transitions, 492 flow [2025-02-06 09:02:07,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 179.33333333333334) internal successors, (1076), 6 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:02:07,617 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:02:07,617 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] [2025-02-06 09:02:07,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:02:07,617 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr1Err11ASSERT_VIOLATIONDATA_RACE, thr1Err10ASSERT_VIOLATIONDATA_RACE, thr1Err9ASSERT_VIOLATIONDATA_RACE, thr1Err8ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2025-02-06 09:02:07,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:02:07,618 INFO L85 PathProgramCache]: Analyzing trace with hash -929905284, now seen corresponding path program 1 times [2025-02-06 09:02:07,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:02:07,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230524562] [2025-02-06 09:02:07,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:02:07,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:02:07,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 09:02:07,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 09:02:07,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:02:07,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:02:07,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:02:07,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:02:07,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230524562] [2025-02-06 09:02:07,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230524562] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:02:07,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:02:07,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:02:07,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964544930] [2025-02-06 09:02:07,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:02:07,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:02:07,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:02:07,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:02:07,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:02:08,028 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 221 [2025-02-06 09:02:08,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 204 transitions, 492 flow. Second operand has 6 states, 6 states have (on average 181.33333333333334) internal successors, (1088), 6 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:02:08,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:02:08,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 221 [2025-02-06 09:02:08,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:02:08,576 INFO L124 PetriNetUnfolderBase]: 426/5659 cut-off events. [2025-02-06 09:02:08,576 INFO L125 PetriNetUnfolderBase]: For 558/594 co-relation queries the response was YES. [2025-02-06 09:02:08,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7140 conditions, 5659 events. 426/5659 cut-off events. For 558/594 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 61192 event pairs, 34 based on Foata normal form. 0/4761 useless extension candidates. Maximal degree in co-relation 7130. Up to 368 conditions per place. [2025-02-06 09:02:08,610 INFO L140 encePairwiseOnDemand]: 212/221 looper letters, 28 selfloop transitions, 30 changer transitions 0/241 dead transitions. [2025-02-06 09:02:08,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 241 transitions, 774 flow [2025-02-06 09:02:08,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:02:08,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:02:08,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1115 transitions. [2025-02-06 09:02:08,613 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8408748114630468 [2025-02-06 09:02:08,613 INFO L175 Difference]: Start difference. First operand has 203 places, 204 transitions, 492 flow. Second operand 6 states and 1115 transitions. [2025-02-06 09:02:08,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 241 transitions, 774 flow [2025-02-06 09:02:08,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 241 transitions, 774 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:02:08,619 INFO L231 Difference]: Finished difference. Result has 213 places, 234 transitions, 770 flow [2025-02-06 09:02:08,619 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=770, PETRI_PLACES=213, PETRI_TRANSITIONS=234} [2025-02-06 09:02:08,620 INFO L279 CegarLoopForPetriNet]: 213 programPoint places, 0 predicate places. [2025-02-06 09:02:08,620 INFO L471 AbstractCegarLoop]: Abstraction has has 213 places, 234 transitions, 770 flow [2025-02-06 09:02:08,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 181.33333333333334) internal successors, (1088), 6 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:02:08,620 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:02:08,621 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] [2025-02-06 09:02:08,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:02:08,621 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thr1Err11ASSERT_VIOLATIONDATA_RACE, thr1Err10ASSERT_VIOLATIONDATA_RACE, thr1Err9ASSERT_VIOLATIONDATA_RACE, thr1Err8ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2025-02-06 09:02:08,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:02:08,621 INFO L85 PathProgramCache]: Analyzing trace with hash 2007715876, now seen corresponding path program 1 times [2025-02-06 09:02:08,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:02:08,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555558546] [2025-02-06 09:02:08,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:02:08,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:02:08,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 09:02:08,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 09:02:08,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:02:08,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:02:08,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:02:08,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:02:08,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555558546] [2025-02-06 09:02:08,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555558546] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:02:08,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:02:08,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:02:08,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39275204] [2025-02-06 09:02:08,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:02:08,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:02:08,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:02:08,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:02:08,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:02:08,671 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 221 [2025-02-06 09:02:08,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 234 transitions, 770 flow. Second operand has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:02:08,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:02:08,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 221 [2025-02-06 09:02:08,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:02:11,231 INFO L124 PetriNetUnfolderBase]: 4680/31320 cut-off events. [2025-02-06 09:02:11,231 INFO L125 PetriNetUnfolderBase]: For 5487/5612 co-relation queries the response was YES. [2025-02-06 09:02:11,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44328 conditions, 31320 events. 4680/31320 cut-off events. For 5487/5612 co-relation queries the response was YES. Maximal size of possible extension queue 770. Compared 449887 event pairs, 1493 based on Foata normal form. 1/26878 useless extension candidates. Maximal degree in co-relation 44313. Up to 5538 conditions per place. [2025-02-06 09:02:11,557 INFO L140 encePairwiseOnDemand]: 200/221 looper letters, 94 selfloop transitions, 15 changer transitions 0/285 dead transitions. [2025-02-06 09:02:11,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 285 transitions, 1311 flow [2025-02-06 09:02:11,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:02:11,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:02:11,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 552 transitions. [2025-02-06 09:02:11,560 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.832579185520362 [2025-02-06 09:02:11,560 INFO L175 Difference]: Start difference. First operand has 213 places, 234 transitions, 770 flow. Second operand 3 states and 552 transitions. [2025-02-06 09:02:11,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 285 transitions, 1311 flow [2025-02-06 09:02:11,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 285 transitions, 1311 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:02:11,576 INFO L231 Difference]: Finished difference. Result has 217 places, 249 transitions, 902 flow [2025-02-06 09:02:11,576 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=770, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=902, PETRI_PLACES=217, PETRI_TRANSITIONS=249} [2025-02-06 09:02:11,577 INFO L279 CegarLoopForPetriNet]: 213 programPoint places, 4 predicate places. [2025-02-06 09:02:11,577 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 249 transitions, 902 flow [2025-02-06 09:02:11,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:02:11,577 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:02:11,577 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:02:11,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:02:11,578 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err11ASSERT_VIOLATIONDATA_RACE, thr1Err10ASSERT_VIOLATIONDATA_RACE, thr1Err9ASSERT_VIOLATIONDATA_RACE, thr1Err8ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2025-02-06 09:02:11,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:02:11,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1803340553, now seen corresponding path program 1 times [2025-02-06 09:02:11,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:02:11,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609751383] [2025-02-06 09:02:11,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:02:11,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:02:11,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-06 09:02:11,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-06 09:02:11,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:02:11,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:02:11,588 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 09:02:11,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-06 09:02:11,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-06 09:02:11,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:02:11,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:02:11,600 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 09:02:11,603 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 09:02:11,603 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (48 of 49 remaining) [2025-02-06 09:02:11,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (47 of 49 remaining) [2025-02-06 09:02:11,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (46 of 49 remaining) [2025-02-06 09:02:11,604 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (45 of 49 remaining) [2025-02-06 09:02:11,604 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (44 of 49 remaining) [2025-02-06 09:02:11,604 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (43 of 49 remaining) [2025-02-06 09:02:11,604 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (42 of 49 remaining) [2025-02-06 09:02:11,604 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (41 of 49 remaining) [2025-02-06 09:02:11,604 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (40 of 49 remaining) [2025-02-06 09:02:11,604 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (39 of 49 remaining) [2025-02-06 09:02:11,604 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (38 of 49 remaining) [2025-02-06 09:02:11,604 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (37 of 49 remaining) [2025-02-06 09:02:11,604 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (36 of 49 remaining) [2025-02-06 09:02:11,604 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (35 of 49 remaining) [2025-02-06 09:02:11,604 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (34 of 49 remaining) [2025-02-06 09:02:11,604 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (33 of 49 remaining) [2025-02-06 09:02:11,604 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (32 of 49 remaining) [2025-02-06 09:02:11,604 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (31 of 49 remaining) [2025-02-06 09:02:11,604 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (30 of 49 remaining) [2025-02-06 09:02:11,604 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (29 of 49 remaining) [2025-02-06 09:02:11,604 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (28 of 49 remaining) [2025-02-06 09:02:11,604 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (27 of 49 remaining) [2025-02-06 09:02:11,604 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (26 of 49 remaining) [2025-02-06 09:02:11,604 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (25 of 49 remaining) [2025-02-06 09:02:11,604 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (24 of 49 remaining) [2025-02-06 09:02:11,604 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (23 of 49 remaining) [2025-02-06 09:02:11,604 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (22 of 49 remaining) [2025-02-06 09:02:11,604 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (21 of 49 remaining) [2025-02-06 09:02:11,605 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (20 of 49 remaining) [2025-02-06 09:02:11,605 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (19 of 49 remaining) [2025-02-06 09:02:11,605 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (18 of 49 remaining) [2025-02-06 09:02:11,605 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (17 of 49 remaining) [2025-02-06 09:02:11,605 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (16 of 49 remaining) [2025-02-06 09:02:11,605 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (15 of 49 remaining) [2025-02-06 09:02:11,605 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (14 of 49 remaining) [2025-02-06 09:02:11,605 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (13 of 49 remaining) [2025-02-06 09:02:11,605 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (12 of 49 remaining) [2025-02-06 09:02:11,605 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (11 of 49 remaining) [2025-02-06 09:02:11,605 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (10 of 49 remaining) [2025-02-06 09:02:11,605 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (9 of 49 remaining) [2025-02-06 09:02:11,605 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (8 of 49 remaining) [2025-02-06 09:02:11,605 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (7 of 49 remaining) [2025-02-06 09:02:11,605 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (6 of 49 remaining) [2025-02-06 09:02:11,605 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (5 of 49 remaining) [2025-02-06 09:02:11,605 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (4 of 49 remaining) [2025-02-06 09:02:11,605 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (3 of 49 remaining) [2025-02-06 09:02:11,605 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 49 remaining) [2025-02-06 09:02:11,605 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 49 remaining) [2025-02-06 09:02:11,605 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 49 remaining) [2025-02-06 09:02:11,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:02:11,605 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-06 09:02:11,606 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 09:02:11,606 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-06 09:02:11,660 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 09:02:11,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 274 places, 284 transitions, 586 flow [2025-02-06 09:02:11,722 INFO L124 PetriNetUnfolderBase]: 32/530 cut-off events. [2025-02-06 09:02:11,722 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-06 09:02:11,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 543 conditions, 530 events. 32/530 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2756 event pairs, 0 based on Foata normal form. 0/410 useless extension candidates. Maximal degree in co-relation 389. Up to 8 conditions per place. [2025-02-06 09:02:11,726 INFO L82 GeneralOperation]: Start removeDead. Operand has 274 places, 284 transitions, 586 flow [2025-02-06 09:02:11,732 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 274 places, 284 transitions, 586 flow [2025-02-06 09:02:11,734 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:02:11,734 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;@28ef0440, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:02:11,734 INFO L334 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2025-02-06 09:02:11,738 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:02:11,738 INFO L124 PetriNetUnfolderBase]: 1/27 cut-off events. [2025-02-06 09:02:11,738 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:02:11,738 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:02:11,738 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:02:11,739 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thr1Err11ASSERT_VIOLATIONDATA_RACE, thr1Err10ASSERT_VIOLATIONDATA_RACE, thr1Err9ASSERT_VIOLATIONDATA_RACE, thr1Err8ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-02-06 09:02:11,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:02:11,739 INFO L85 PathProgramCache]: Analyzing trace with hash 857428951, now seen corresponding path program 1 times [2025-02-06 09:02:11,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:02:11,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730467196] [2025-02-06 09:02:11,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:02:11,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:02:11,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 09:02:11,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 09:02:11,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:02:11,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:02:11,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:02:11,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:02:11,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730467196] [2025-02-06 09:02:11,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730467196] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:02:11,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:02:11,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:02:11,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104666576] [2025-02-06 09:02:11,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:02:11,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 09:02:11,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:02:11,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 09:02:11,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 09:02:11,754 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 284 [2025-02-06 09:02:11,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 284 transitions, 586 flow. Second operand has 2 states, 2 states have (on average 241.0) internal successors, (482), 2 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:02:11,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:02:11,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 284 [2025-02-06 09:02:11,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:02:11,924 INFO L124 PetriNetUnfolderBase]: 53/1433 cut-off events. [2025-02-06 09:02:11,924 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-02-06 09:02:11,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1518 conditions, 1433 events. 53/1433 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 11402 event pairs, 27 based on Foata normal form. 116/1297 useless extension candidates. Maximal degree in co-relation 826. Up to 57 conditions per place. [2025-02-06 09:02:11,940 INFO L140 encePairwiseOnDemand]: 251/284 looper letters, 7 selfloop transitions, 0 changer transitions 0/243 dead transitions. [2025-02-06 09:02:11,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 243 transitions, 518 flow [2025-02-06 09:02:11,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 09:02:11,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-06 09:02:11,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 520 transitions. [2025-02-06 09:02:11,942 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9154929577464789 [2025-02-06 09:02:11,942 INFO L175 Difference]: Start difference. First operand has 274 places, 284 transitions, 586 flow. Second operand 2 states and 520 transitions. [2025-02-06 09:02:11,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 243 transitions, 518 flow [2025-02-06 09:02:11,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 243 transitions, 516 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-02-06 09:02:11,946 INFO L231 Difference]: Finished difference. Result has 247 places, 243 transitions, 502 flow [2025-02-06 09:02:11,947 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=502, PETRI_PLACES=247, PETRI_TRANSITIONS=243} [2025-02-06 09:02:11,949 INFO L279 CegarLoopForPetriNet]: 274 programPoint places, -27 predicate places. [2025-02-06 09:02:11,949 INFO L471 AbstractCegarLoop]: Abstraction has has 247 places, 243 transitions, 502 flow [2025-02-06 09:02:11,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 241.0) internal successors, (482), 2 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:02:11,950 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:02:11,950 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] [2025-02-06 09:02:11,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:02:11,950 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thr1Err11ASSERT_VIOLATIONDATA_RACE, thr1Err10ASSERT_VIOLATIONDATA_RACE, thr1Err9ASSERT_VIOLATIONDATA_RACE, thr1Err8ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-02-06 09:02:11,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:02:11,951 INFO L85 PathProgramCache]: Analyzing trace with hash 248656352, now seen corresponding path program 1 times [2025-02-06 09:02:11,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:02:11,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010568247] [2025-02-06 09:02:11,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:02:11,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:02:11,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 09:02:11,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 09:02:11,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:02:11,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:02:12,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:02:12,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:02:12,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010568247] [2025-02-06 09:02:12,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010568247] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:02:12,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:02:12,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:02:12,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229205945] [2025-02-06 09:02:12,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:02:12,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:02:12,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:02:12,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:02:12,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:02:12,341 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 284 [2025-02-06 09:02:12,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 243 transitions, 502 flow. Second operand has 6 states, 6 states have (on average 231.33333333333334) internal successors, (1388), 6 states have internal predecessors, (1388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:02:12,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:02:12,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 284 [2025-02-06 09:02:12,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:02:13,221 INFO L124 PetriNetUnfolderBase]: 444/7245 cut-off events. [2025-02-06 09:02:13,222 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-02-06 09:02:13,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7869 conditions, 7245 events. 444/7245 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 83663 event pairs, 131 based on Foata normal form. 0/5997 useless extension candidates. Maximal degree in co-relation 7863. Up to 442 conditions per place. [2025-02-06 09:02:13,325 INFO L140 encePairwiseOnDemand]: 274/284 looper letters, 20 selfloop transitions, 18 changer transitions 0/264 dead transitions. [2025-02-06 09:02:13,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 264 transitions, 620 flow [2025-02-06 09:02:13,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:02:13,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:02:13,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1419 transitions. [2025-02-06 09:02:13,328 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8327464788732394 [2025-02-06 09:02:13,328 INFO L175 Difference]: Start difference. First operand has 247 places, 243 transitions, 502 flow. Second operand 6 states and 1419 transitions. [2025-02-06 09:02:13,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 264 transitions, 620 flow [2025-02-06 09:02:13,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 264 transitions, 620 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:02:13,334 INFO L231 Difference]: Finished difference. Result has 257 places, 261 transitions, 630 flow [2025-02-06 09:02:13,335 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=630, PETRI_PLACES=257, PETRI_TRANSITIONS=261} [2025-02-06 09:02:13,336 INFO L279 CegarLoopForPetriNet]: 274 programPoint places, -17 predicate places. [2025-02-06 09:02:13,336 INFO L471 AbstractCegarLoop]: Abstraction has has 257 places, 261 transitions, 630 flow [2025-02-06 09:02:13,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 231.33333333333334) internal successors, (1388), 6 states have internal predecessors, (1388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:02:13,337 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:02:13,337 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] [2025-02-06 09:02:13,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 09:02:13,337 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr1Err11ASSERT_VIOLATIONDATA_RACE, thr1Err10ASSERT_VIOLATIONDATA_RACE, thr1Err9ASSERT_VIOLATIONDATA_RACE, thr1Err8ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-02-06 09:02:13,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:02:13,338 INFO L85 PathProgramCache]: Analyzing trace with hash -786807622, now seen corresponding path program 1 times [2025-02-06 09:02:13,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:02:13,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874650588] [2025-02-06 09:02:13,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:02:13,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:02:13,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 09:02:13,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 09:02:13,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:02:13,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:02:13,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:02:13,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:02:13,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874650588] [2025-02-06 09:02:13,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874650588] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:02:13,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:02:13,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:02:13,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796527898] [2025-02-06 09:02:13,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:02:13,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:02:13,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:02:13,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:02:13,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:02:13,737 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 284 [2025-02-06 09:02:13,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 261 transitions, 630 flow. Second operand has 6 states, 6 states have (on average 233.33333333333334) internal successors, (1400), 6 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:02:13,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:02:13,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 284 [2025-02-06 09:02:13,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:02:15,648 INFO L124 PetriNetUnfolderBase]: 1848/18907 cut-off events. [2025-02-06 09:02:15,648 INFO L125 PetriNetUnfolderBase]: For 2471/2579 co-relation queries the response was YES. [2025-02-06 09:02:15,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24226 conditions, 18907 events. 1848/18907 cut-off events. For 2471/2579 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 258178 event pairs, 169 based on Foata normal form. 0/15819 useless extension candidates. Maximal degree in co-relation 24215. Up to 1598 conditions per place. [2025-02-06 09:02:15,929 INFO L140 encePairwiseOnDemand]: 274/284 looper letters, 38 selfloop transitions, 50 changer transitions 0/322 dead transitions. [2025-02-06 09:02:15,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 322 transitions, 1112 flow [2025-02-06 09:02:15,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:02:15,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:02:15,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1437 transitions. [2025-02-06 09:02:15,939 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8433098591549296 [2025-02-06 09:02:15,939 INFO L175 Difference]: Start difference. First operand has 257 places, 261 transitions, 630 flow. Second operand 6 states and 1437 transitions. [2025-02-06 09:02:15,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 322 transitions, 1112 flow [2025-02-06 09:02:15,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 322 transitions, 1112 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:02:15,955 INFO L231 Difference]: Finished difference. Result has 267 places, 311 transitions, 1110 flow [2025-02-06 09:02:15,955 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=630, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1110, PETRI_PLACES=267, PETRI_TRANSITIONS=311} [2025-02-06 09:02:15,956 INFO L279 CegarLoopForPetriNet]: 274 programPoint places, -7 predicate places. [2025-02-06 09:02:15,956 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 311 transitions, 1110 flow [2025-02-06 09:02:15,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 233.33333333333334) internal successors, (1400), 6 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:02:15,957 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:02:15,957 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] [2025-02-06 09:02:15,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 09:02:15,957 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thr1Err11ASSERT_VIOLATIONDATA_RACE, thr1Err10ASSERT_VIOLATIONDATA_RACE, thr1Err9ASSERT_VIOLATIONDATA_RACE, thr1Err8ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-02-06 09:02:15,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:02:15,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1559384896, now seen corresponding path program 1 times [2025-02-06 09:02:15,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:02:15,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856203623] [2025-02-06 09:02:15,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:02:15,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:02:15,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 09:02:15,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 09:02:15,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:02:15,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:02:15,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:02:15,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:02:15,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856203623] [2025-02-06 09:02:15,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856203623] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:02:15,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:02:15,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:02:15,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751033274] [2025-02-06 09:02:15,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:02:15,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:02:15,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:02:15,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:02:15,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:02:16,013 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 284 [2025-02-06 09:02:16,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 311 transitions, 1110 flow. Second operand has 3 states, 3 states have (on average 213.0) internal successors, (639), 3 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:02:16,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:02:16,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 284 [2025-02-06 09:02:16,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:02:20,320 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([982] L701-15-->L701: Formula: (let ((.cse4 (select |v_#race_185| |v_thr1Thread3of3ForFork0_~#l~0#1.base_5|)) (.cse1 (+ |v_thr1Thread3of3ForFork0_~#l~0#1.offset_5| 1))) (let ((.cse2 (+ |v_thr1Thread3of3ForFork0_~#l~0#1.offset_5| 2)) (.cse0 (select .cse4 .cse1)) (.cse3 (+ |v_thr1Thread3of3ForFork0_~#l~0#1.offset_5| 3))) (and (= |v_#memory_int_85| (store |v_#memory_int_86| |v_thr1Thread3of3ForFork0_~#l~0#1.base_5| (store (select |v_#memory_int_86| |v_thr1Thread3of3ForFork0_~#l~0#1.base_5|) |v_thr1Thread3of3ForFork0_~#l~0#1.offset_5| v_~t~0_123))) (= v_~t~0_122 (+ v_~t~0_123 1)) (= |v_#race_185| (store |v_#race_186| |v_thr1Thread3of3ForFork0_~#l~0#1.base_5| (store (store (store (store (select |v_#race_186| |v_thr1Thread3of3ForFork0_~#l~0#1.base_5|) |v_thr1Thread3of3ForFork0_~#l~0#1.offset_5| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0))) (= (select .cse4 |v_thr1Thread3of3ForFork0_~#l~0#1.offset_5|) .cse0) (= .cse0 (select .cse4 .cse2)) (not (= (ite (not (= (mod v_~t~0_123 4294967296) 4294967295)) 1 0) 0)) (= .cse0 (select .cse4 .cse3))))) InVars {#race=|v_#race_186|, #memory_int=|v_#memory_int_86|, thr1Thread3of3ForFork0_~#l~0#1.base=|v_thr1Thread3of3ForFork0_~#l~0#1.base_5|, thr1Thread3of3ForFork0_~#l~0#1.offset=|v_thr1Thread3of3ForFork0_~#l~0#1.offset_5|, ~t~0=v_~t~0_123} OutVars{#race=|v_#race_185|, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1_11|, thr1Thread3of3ForFork0_~#l~0#1.base=|v_thr1Thread3of3ForFork0_~#l~0#1.base_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset_11|, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset_11|, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base_11|, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1_11|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_9|, #memory_int=|v_#memory_int_85|, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base_11|, #race~t~0=|v_#race~t~0_209|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_9|, thr1Thread3of3ForFork0_~#l~0#1.offset=|v_thr1Thread3of3ForFork0_~#l~0#1.offset_5|, ~t~0=v_~t~0_122} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base, #race~t~0, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1, ~t~0][298], [Black: 284#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 3 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), 44#L701true, Black: 292#(= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 0), Black: 294#(and (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ |thr1Thread1of3ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of3ForFork0_~#l~0#1.offset|)) 0)), 290#true, Black: 293#(and (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ |thr1Thread1of3ForFork0_~#l~0#1.offset| 1)) 0)), 275#true, Black: 295#(and (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ 3 |thr1Thread1of3ForFork0_~#l~0#1.offset|)) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ |thr1Thread1of3ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of3ForFork0_~#l~0#1.offset|)) 0)), 218#L701-4true, 273#true, 125#L701-6true, 277#true, 271#true, 303#(= |#race~s~0| 0), 128#L701-6true, 279#true, Black: 281#(= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0), Black: 282#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), Black: 283#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0))]) [2025-02-06 09:02:20,321 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2025-02-06 09:02:20,321 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2025-02-06 09:02:20,321 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2025-02-06 09:02:20,321 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2025-02-06 09:02:20,323 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1106] L701-15-->L701: Formula: (let ((.cse1 (select |v_#race_185| |v_thr1Thread2of3ForFork0_~#l~0#1.base_5|)) (.cse3 (+ |v_thr1Thread2of3ForFork0_~#l~0#1.offset_5| 1))) (let ((.cse2 (+ |v_thr1Thread2of3ForFork0_~#l~0#1.offset_5| 3)) (.cse0 (select .cse1 .cse3)) (.cse4 (+ |v_thr1Thread2of3ForFork0_~#l~0#1.offset_5| 2))) (and (= (store |v_#memory_int_86| |v_thr1Thread2of3ForFork0_~#l~0#1.base_5| (store (select |v_#memory_int_86| |v_thr1Thread2of3ForFork0_~#l~0#1.base_5|) |v_thr1Thread2of3ForFork0_~#l~0#1.offset_5| v_~t~0_123)) |v_#memory_int_85|) (= v_~t~0_122 (+ v_~t~0_123 1)) (= .cse0 (select .cse1 |v_thr1Thread2of3ForFork0_~#l~0#1.offset_5|)) (= .cse0 (select .cse1 .cse2)) (not (= (ite (not (= (mod v_~t~0_123 4294967296) 4294967295)) 1 0) 0)) (= |v_#race_185| (store |v_#race_186| |v_thr1Thread2of3ForFork0_~#l~0#1.base_5| (store (store (store (store (select |v_#race_186| |v_thr1Thread2of3ForFork0_~#l~0#1.base_5|) |v_thr1Thread2of3ForFork0_~#l~0#1.offset_5| .cse0) .cse3 .cse0) .cse4 .cse0) .cse2 .cse0))) (= .cse0 (select .cse1 .cse4))))) InVars {#race=|v_#race_186|, #memory_int=|v_#memory_int_86|, thr1Thread2of3ForFork0_~#l~0#1.base=|v_thr1Thread2of3ForFork0_~#l~0#1.base_5|, thr1Thread2of3ForFork0_~#l~0#1.offset=|v_thr1Thread2of3ForFork0_~#l~0#1.offset_5|, ~t~0=v_~t~0_123} OutVars{#race=|v_#race_185|, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1_11|, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base_11|, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_9|, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|, thr1Thread2of3ForFork0_~#l~0#1.offset=|v_thr1Thread2of3ForFork0_~#l~0#1.offset_5|, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base_11|, thr1Thread2of3ForFork0_~#l~0#1.base=|v_thr1Thread2of3ForFork0_~#l~0#1.base_5|, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1_11|, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset_11|, #memory_int=|v_#memory_int_85|, #race~t~0=|v_#race~t~0_209|, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset_11|, ~t~0=v_~t~0_122} AuxVars[] AssignedVars[#race, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset, #memory_int, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, #race~t~0, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset, ~t~0][212], [Black: 284#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 3 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), Black: 292#(= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 0), 107#L701true, Black: 294#(and (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ |thr1Thread1of3ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of3ForFork0_~#l~0#1.offset|)) 0)), 290#true, Black: 293#(and (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ |thr1Thread1of3ForFork0_~#l~0#1.offset| 1)) 0)), 275#true, Black: 295#(and (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ 3 |thr1Thread1of3ForFork0_~#l~0#1.offset|)) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ |thr1Thread1of3ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of3ForFork0_~#l~0#1.offset|)) 0)), 273#true, 125#L701-6true, 277#true, 271#true, 303#(= |#race~s~0| 0), 96#L701-4true, 128#L701-6true, 279#true, Black: 281#(= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0), Black: 282#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), Black: 283#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0))]) [2025-02-06 09:02:20,324 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2025-02-06 09:02:20,324 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2025-02-06 09:02:20,324 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2025-02-06 09:02:20,324 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2025-02-06 09:02:20,324 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1106] L701-15-->L701: Formula: (let ((.cse1 (select |v_#race_185| |v_thr1Thread2of3ForFork0_~#l~0#1.base_5|)) (.cse3 (+ |v_thr1Thread2of3ForFork0_~#l~0#1.offset_5| 1))) (let ((.cse2 (+ |v_thr1Thread2of3ForFork0_~#l~0#1.offset_5| 3)) (.cse0 (select .cse1 .cse3)) (.cse4 (+ |v_thr1Thread2of3ForFork0_~#l~0#1.offset_5| 2))) (and (= (store |v_#memory_int_86| |v_thr1Thread2of3ForFork0_~#l~0#1.base_5| (store (select |v_#memory_int_86| |v_thr1Thread2of3ForFork0_~#l~0#1.base_5|) |v_thr1Thread2of3ForFork0_~#l~0#1.offset_5| v_~t~0_123)) |v_#memory_int_85|) (= v_~t~0_122 (+ v_~t~0_123 1)) (= .cse0 (select .cse1 |v_thr1Thread2of3ForFork0_~#l~0#1.offset_5|)) (= .cse0 (select .cse1 .cse2)) (not (= (ite (not (= (mod v_~t~0_123 4294967296) 4294967295)) 1 0) 0)) (= |v_#race_185| (store |v_#race_186| |v_thr1Thread2of3ForFork0_~#l~0#1.base_5| (store (store (store (store (select |v_#race_186| |v_thr1Thread2of3ForFork0_~#l~0#1.base_5|) |v_thr1Thread2of3ForFork0_~#l~0#1.offset_5| .cse0) .cse3 .cse0) .cse4 .cse0) .cse2 .cse0))) (= .cse0 (select .cse1 .cse4))))) InVars {#race=|v_#race_186|, #memory_int=|v_#memory_int_86|, thr1Thread2of3ForFork0_~#l~0#1.base=|v_thr1Thread2of3ForFork0_~#l~0#1.base_5|, thr1Thread2of3ForFork0_~#l~0#1.offset=|v_thr1Thread2of3ForFork0_~#l~0#1.offset_5|, ~t~0=v_~t~0_123} OutVars{#race=|v_#race_185|, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1_11|, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base_11|, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_9|, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|, thr1Thread2of3ForFork0_~#l~0#1.offset=|v_thr1Thread2of3ForFork0_~#l~0#1.offset_5|, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base_11|, thr1Thread2of3ForFork0_~#l~0#1.base=|v_thr1Thread2of3ForFork0_~#l~0#1.base_5|, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1_11|, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset_11|, #memory_int=|v_#memory_int_85|, #race~t~0=|v_#race~t~0_209|, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset_11|, ~t~0=v_~t~0_122} AuxVars[] AssignedVars[#race, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset, #memory_int, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, #race~t~0, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset, ~t~0][212], [Black: 284#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 3 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), Black: 292#(= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 0), 107#L701true, Black: 294#(and (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ |thr1Thread1of3ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of3ForFork0_~#l~0#1.offset|)) 0)), 108#L701-1true, Black: 293#(and (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ |thr1Thread1of3ForFork0_~#l~0#1.offset| 1)) 0)), 290#true, 275#true, Black: 295#(and (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ 3 |thr1Thread1of3ForFork0_~#l~0#1.offset|)) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ |thr1Thread1of3ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of3ForFork0_~#l~0#1.offset|)) 0)), 273#true, 125#L701-6true, 277#true, 271#true, 303#(= |#race~s~0| 0), 128#L701-6true, 279#true, Black: 281#(= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0), Black: 282#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), Black: 283#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0))]) [2025-02-06 09:02:20,324 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2025-02-06 09:02:20,324 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-02-06 09:02:20,328 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2025-02-06 09:02:20,329 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2025-02-06 09:02:20,536 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([982] L701-15-->L701: Formula: (let ((.cse4 (select |v_#race_185| |v_thr1Thread3of3ForFork0_~#l~0#1.base_5|)) (.cse1 (+ |v_thr1Thread3of3ForFork0_~#l~0#1.offset_5| 1))) (let ((.cse2 (+ |v_thr1Thread3of3ForFork0_~#l~0#1.offset_5| 2)) (.cse0 (select .cse4 .cse1)) (.cse3 (+ |v_thr1Thread3of3ForFork0_~#l~0#1.offset_5| 3))) (and (= |v_#memory_int_85| (store |v_#memory_int_86| |v_thr1Thread3of3ForFork0_~#l~0#1.base_5| (store (select |v_#memory_int_86| |v_thr1Thread3of3ForFork0_~#l~0#1.base_5|) |v_thr1Thread3of3ForFork0_~#l~0#1.offset_5| v_~t~0_123))) (= v_~t~0_122 (+ v_~t~0_123 1)) (= |v_#race_185| (store |v_#race_186| |v_thr1Thread3of3ForFork0_~#l~0#1.base_5| (store (store (store (store (select |v_#race_186| |v_thr1Thread3of3ForFork0_~#l~0#1.base_5|) |v_thr1Thread3of3ForFork0_~#l~0#1.offset_5| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0))) (= (select .cse4 |v_thr1Thread3of3ForFork0_~#l~0#1.offset_5|) .cse0) (= .cse0 (select .cse4 .cse2)) (not (= (ite (not (= (mod v_~t~0_123 4294967296) 4294967295)) 1 0) 0)) (= .cse0 (select .cse4 .cse3))))) InVars {#race=|v_#race_186|, #memory_int=|v_#memory_int_86|, thr1Thread3of3ForFork0_~#l~0#1.base=|v_thr1Thread3of3ForFork0_~#l~0#1.base_5|, thr1Thread3of3ForFork0_~#l~0#1.offset=|v_thr1Thread3of3ForFork0_~#l~0#1.offset_5|, ~t~0=v_~t~0_123} OutVars{#race=|v_#race_185|, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1_11|, thr1Thread3of3ForFork0_~#l~0#1.base=|v_thr1Thread3of3ForFork0_~#l~0#1.base_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset_11|, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset_11|, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base_11|, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1_11|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_9|, #memory_int=|v_#memory_int_85|, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base_11|, #race~t~0=|v_#race~t~0_209|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_9|, thr1Thread3of3ForFork0_~#l~0#1.offset=|v_thr1Thread3of3ForFork0_~#l~0#1.offset_5|, ~t~0=v_~t~0_122} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base, #race~t~0, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1, ~t~0][298], [Black: 284#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 3 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), 44#L701true, Black: 292#(= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 0), Black: 294#(and (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ |thr1Thread1of3ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of3ForFork0_~#l~0#1.offset|)) 0)), 290#true, Black: 293#(and (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ |thr1Thread1of3ForFork0_~#l~0#1.offset| 1)) 0)), 275#true, Black: 295#(and (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ 3 |thr1Thread1of3ForFork0_~#l~0#1.offset|)) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ |thr1Thread1of3ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of3ForFork0_~#l~0#1.offset|)) 0)), 273#true, 125#L701-6true, 277#true, 271#true, 303#(= |#race~s~0| 0), 128#L701-6true, 279#true, Black: 281#(= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0), Black: 282#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), Black: 283#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), 261#L701-1true]) [2025-02-06 09:02:20,536 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2025-02-06 09:02:20,536 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2025-02-06 09:02:20,536 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2025-02-06 09:02:20,536 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2025-02-06 09:02:22,826 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1106] L701-15-->L701: Formula: (let ((.cse1 (select |v_#race_185| |v_thr1Thread2of3ForFork0_~#l~0#1.base_5|)) (.cse3 (+ |v_thr1Thread2of3ForFork0_~#l~0#1.offset_5| 1))) (let ((.cse2 (+ |v_thr1Thread2of3ForFork0_~#l~0#1.offset_5| 3)) (.cse0 (select .cse1 .cse3)) (.cse4 (+ |v_thr1Thread2of3ForFork0_~#l~0#1.offset_5| 2))) (and (= (store |v_#memory_int_86| |v_thr1Thread2of3ForFork0_~#l~0#1.base_5| (store (select |v_#memory_int_86| |v_thr1Thread2of3ForFork0_~#l~0#1.base_5|) |v_thr1Thread2of3ForFork0_~#l~0#1.offset_5| v_~t~0_123)) |v_#memory_int_85|) (= v_~t~0_122 (+ v_~t~0_123 1)) (= .cse0 (select .cse1 |v_thr1Thread2of3ForFork0_~#l~0#1.offset_5|)) (= .cse0 (select .cse1 .cse2)) (not (= (ite (not (= (mod v_~t~0_123 4294967296) 4294967295)) 1 0) 0)) (= |v_#race_185| (store |v_#race_186| |v_thr1Thread2of3ForFork0_~#l~0#1.base_5| (store (store (store (store (select |v_#race_186| |v_thr1Thread2of3ForFork0_~#l~0#1.base_5|) |v_thr1Thread2of3ForFork0_~#l~0#1.offset_5| .cse0) .cse3 .cse0) .cse4 .cse0) .cse2 .cse0))) (= .cse0 (select .cse1 .cse4))))) InVars {#race=|v_#race_186|, #memory_int=|v_#memory_int_86|, thr1Thread2of3ForFork0_~#l~0#1.base=|v_thr1Thread2of3ForFork0_~#l~0#1.base_5|, thr1Thread2of3ForFork0_~#l~0#1.offset=|v_thr1Thread2of3ForFork0_~#l~0#1.offset_5|, ~t~0=v_~t~0_123} OutVars{#race=|v_#race_185|, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1_11|, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base_11|, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_9|, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|, thr1Thread2of3ForFork0_~#l~0#1.offset=|v_thr1Thread2of3ForFork0_~#l~0#1.offset_5|, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base_11|, thr1Thread2of3ForFork0_~#l~0#1.base=|v_thr1Thread2of3ForFork0_~#l~0#1.base_5|, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1_11|, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset_11|, #memory_int=|v_#memory_int_85|, #race~t~0=|v_#race~t~0_209|, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset_11|, ~t~0=v_~t~0_122} AuxVars[] AssignedVars[#race, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset, #memory_int, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, #race~t~0, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset, ~t~0][212], [Black: 284#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 3 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), Black: 292#(= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 0), 107#L701true, Black: 294#(and (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ |thr1Thread1of3ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of3ForFork0_~#l~0#1.offset|)) 0)), Black: 293#(and (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ |thr1Thread1of3ForFork0_~#l~0#1.offset| 1)) 0)), 290#true, 275#true, Black: 295#(and (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ 3 |thr1Thread1of3ForFork0_~#l~0#1.offset|)) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ |thr1Thread1of3ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of3ForFork0_~#l~0#1.offset|)) 0)), 273#true, 125#L701-6true, 277#true, 106#L703-6true, 271#true, 303#(= |#race~s~0| 0), 128#L701-6true, 279#true, Black: 281#(= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0), Black: 282#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), Black: 283#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0))]) [2025-02-06 09:02:22,826 INFO L294 olderBase$Statistics]: this new event has 116 ancestors and is cut-off event [2025-02-06 09:02:22,826 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2025-02-06 09:02:22,827 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2025-02-06 09:02:22,827 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2025-02-06 09:02:23,174 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1106] L701-15-->L701: Formula: (let ((.cse1 (select |v_#race_185| |v_thr1Thread2of3ForFork0_~#l~0#1.base_5|)) (.cse3 (+ |v_thr1Thread2of3ForFork0_~#l~0#1.offset_5| 1))) (let ((.cse2 (+ |v_thr1Thread2of3ForFork0_~#l~0#1.offset_5| 3)) (.cse0 (select .cse1 .cse3)) (.cse4 (+ |v_thr1Thread2of3ForFork0_~#l~0#1.offset_5| 2))) (and (= (store |v_#memory_int_86| |v_thr1Thread2of3ForFork0_~#l~0#1.base_5| (store (select |v_#memory_int_86| |v_thr1Thread2of3ForFork0_~#l~0#1.base_5|) |v_thr1Thread2of3ForFork0_~#l~0#1.offset_5| v_~t~0_123)) |v_#memory_int_85|) (= v_~t~0_122 (+ v_~t~0_123 1)) (= .cse0 (select .cse1 |v_thr1Thread2of3ForFork0_~#l~0#1.offset_5|)) (= .cse0 (select .cse1 .cse2)) (not (= (ite (not (= (mod v_~t~0_123 4294967296) 4294967295)) 1 0) 0)) (= |v_#race_185| (store |v_#race_186| |v_thr1Thread2of3ForFork0_~#l~0#1.base_5| (store (store (store (store (select |v_#race_186| |v_thr1Thread2of3ForFork0_~#l~0#1.base_5|) |v_thr1Thread2of3ForFork0_~#l~0#1.offset_5| .cse0) .cse3 .cse0) .cse4 .cse0) .cse2 .cse0))) (= .cse0 (select .cse1 .cse4))))) InVars {#race=|v_#race_186|, #memory_int=|v_#memory_int_86|, thr1Thread2of3ForFork0_~#l~0#1.base=|v_thr1Thread2of3ForFork0_~#l~0#1.base_5|, thr1Thread2of3ForFork0_~#l~0#1.offset=|v_thr1Thread2of3ForFork0_~#l~0#1.offset_5|, ~t~0=v_~t~0_123} OutVars{#race=|v_#race_185|, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1_11|, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base_11|, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_9|, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|, thr1Thread2of3ForFork0_~#l~0#1.offset=|v_thr1Thread2of3ForFork0_~#l~0#1.offset_5|, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base_11|, thr1Thread2of3ForFork0_~#l~0#1.base=|v_thr1Thread2of3ForFork0_~#l~0#1.base_5|, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1_11|, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset_11|, #memory_int=|v_#memory_int_85|, #race~t~0=|v_#race~t~0_209|, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset_11|, ~t~0=v_~t~0_122} AuxVars[] AssignedVars[#race, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset, #memory_int, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, #race~t~0, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset, ~t~0][212], [Black: 284#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 3 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), Black: 292#(= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 0), 107#L701true, Black: 294#(and (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ |thr1Thread1of3ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of3ForFork0_~#l~0#1.offset|)) 0)), 290#true, Black: 293#(and (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ |thr1Thread1of3ForFork0_~#l~0#1.offset| 1)) 0)), 275#true, Black: 295#(and (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ 3 |thr1Thread1of3ForFork0_~#l~0#1.offset|)) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ |thr1Thread1of3ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of3ForFork0_~#l~0#1.offset|)) 0)), 273#true, 125#L701-6true, 277#true, 271#true, 303#(= |#race~s~0| 0), 128#L701-6true, 279#true, Black: 281#(= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0), Black: 282#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), 212#L703-7true, Black: 283#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0))]) [2025-02-06 09:02:23,175 INFO L294 olderBase$Statistics]: this new event has 117 ancestors and is cut-off event [2025-02-06 09:02:23,175 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-02-06 09:02:23,175 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2025-02-06 09:02:23,175 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-02-06 09:02:23,187 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1106] L701-15-->L701: Formula: (let ((.cse1 (select |v_#race_185| |v_thr1Thread2of3ForFork0_~#l~0#1.base_5|)) (.cse3 (+ |v_thr1Thread2of3ForFork0_~#l~0#1.offset_5| 1))) (let ((.cse2 (+ |v_thr1Thread2of3ForFork0_~#l~0#1.offset_5| 3)) (.cse0 (select .cse1 .cse3)) (.cse4 (+ |v_thr1Thread2of3ForFork0_~#l~0#1.offset_5| 2))) (and (= (store |v_#memory_int_86| |v_thr1Thread2of3ForFork0_~#l~0#1.base_5| (store (select |v_#memory_int_86| |v_thr1Thread2of3ForFork0_~#l~0#1.base_5|) |v_thr1Thread2of3ForFork0_~#l~0#1.offset_5| v_~t~0_123)) |v_#memory_int_85|) (= v_~t~0_122 (+ v_~t~0_123 1)) (= .cse0 (select .cse1 |v_thr1Thread2of3ForFork0_~#l~0#1.offset_5|)) (= .cse0 (select .cse1 .cse2)) (not (= (ite (not (= (mod v_~t~0_123 4294967296) 4294967295)) 1 0) 0)) (= |v_#race_185| (store |v_#race_186| |v_thr1Thread2of3ForFork0_~#l~0#1.base_5| (store (store (store (store (select |v_#race_186| |v_thr1Thread2of3ForFork0_~#l~0#1.base_5|) |v_thr1Thread2of3ForFork0_~#l~0#1.offset_5| .cse0) .cse3 .cse0) .cse4 .cse0) .cse2 .cse0))) (= .cse0 (select .cse1 .cse4))))) InVars {#race=|v_#race_186|, #memory_int=|v_#memory_int_86|, thr1Thread2of3ForFork0_~#l~0#1.base=|v_thr1Thread2of3ForFork0_~#l~0#1.base_5|, thr1Thread2of3ForFork0_~#l~0#1.offset=|v_thr1Thread2of3ForFork0_~#l~0#1.offset_5|, ~t~0=v_~t~0_123} OutVars{#race=|v_#race_185|, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1_11|, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base_11|, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_9|, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|, thr1Thread2of3ForFork0_~#l~0#1.offset=|v_thr1Thread2of3ForFork0_~#l~0#1.offset_5|, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base_11|, thr1Thread2of3ForFork0_~#l~0#1.base=|v_thr1Thread2of3ForFork0_~#l~0#1.base_5|, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1_11|, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset_11|, #memory_int=|v_#memory_int_85|, #race~t~0=|v_#race~t~0_209|, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset_11|, ~t~0=v_~t~0_122} AuxVars[] AssignedVars[#race, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset, #memory_int, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, #race~t~0, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset, ~t~0][198], [Black: 284#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 3 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), Black: 292#(= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 0), 107#L701true, Black: 294#(and (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ |thr1Thread1of3ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of3ForFork0_~#l~0#1.offset|)) 0)), 71#L703-1true, Black: 293#(and (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ |thr1Thread1of3ForFork0_~#l~0#1.offset| 1)) 0)), 290#true, 275#true, Black: 295#(and (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ 3 |thr1Thread1of3ForFork0_~#l~0#1.offset|)) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ |thr1Thread1of3ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of3ForFork0_~#l~0#1.offset|)) 0)), 273#true, 125#L701-6true, 277#true, 271#true, 301#true, 128#L701-6true, Black: 281#(= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0), 279#true, Black: 282#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), Black: 283#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0))]) [2025-02-06 09:02:23,188 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2025-02-06 09:02:23,188 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-02-06 09:02:23,188 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-02-06 09:02:23,188 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-02-06 09:02:23,969 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([982] L701-15-->L701: Formula: (let ((.cse4 (select |v_#race_185| |v_thr1Thread3of3ForFork0_~#l~0#1.base_5|)) (.cse1 (+ |v_thr1Thread3of3ForFork0_~#l~0#1.offset_5| 1))) (let ((.cse2 (+ |v_thr1Thread3of3ForFork0_~#l~0#1.offset_5| 2)) (.cse0 (select .cse4 .cse1)) (.cse3 (+ |v_thr1Thread3of3ForFork0_~#l~0#1.offset_5| 3))) (and (= |v_#memory_int_85| (store |v_#memory_int_86| |v_thr1Thread3of3ForFork0_~#l~0#1.base_5| (store (select |v_#memory_int_86| |v_thr1Thread3of3ForFork0_~#l~0#1.base_5|) |v_thr1Thread3of3ForFork0_~#l~0#1.offset_5| v_~t~0_123))) (= v_~t~0_122 (+ v_~t~0_123 1)) (= |v_#race_185| (store |v_#race_186| |v_thr1Thread3of3ForFork0_~#l~0#1.base_5| (store (store (store (store (select |v_#race_186| |v_thr1Thread3of3ForFork0_~#l~0#1.base_5|) |v_thr1Thread3of3ForFork0_~#l~0#1.offset_5| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0))) (= (select .cse4 |v_thr1Thread3of3ForFork0_~#l~0#1.offset_5|) .cse0) (= .cse0 (select .cse4 .cse2)) (not (= (ite (not (= (mod v_~t~0_123 4294967296) 4294967295)) 1 0) 0)) (= .cse0 (select .cse4 .cse3))))) InVars {#race=|v_#race_186|, #memory_int=|v_#memory_int_86|, thr1Thread3of3ForFork0_~#l~0#1.base=|v_thr1Thread3of3ForFork0_~#l~0#1.base_5|, thr1Thread3of3ForFork0_~#l~0#1.offset=|v_thr1Thread3of3ForFork0_~#l~0#1.offset_5|, ~t~0=v_~t~0_123} OutVars{#race=|v_#race_185|, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1_11|, thr1Thread3of3ForFork0_~#l~0#1.base=|v_thr1Thread3of3ForFork0_~#l~0#1.base_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset_11|, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset_11|, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base_11|, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1_11|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_9|, #memory_int=|v_#memory_int_85|, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base_11|, #race~t~0=|v_#race~t~0_209|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_9|, thr1Thread3of3ForFork0_~#l~0#1.offset=|v_thr1Thread3of3ForFork0_~#l~0#1.offset_5|, ~t~0=v_~t~0_122} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base, #race~t~0, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1, ~t~0][278], [Black: 284#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 3 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), 44#L701true, Black: 292#(= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 0), Black: 294#(and (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ |thr1Thread1of3ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of3ForFork0_~#l~0#1.offset|)) 0)), Black: 293#(and (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ |thr1Thread1of3ForFork0_~#l~0#1.offset| 1)) 0)), 290#true, 275#true, Black: 295#(and (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ 3 |thr1Thread1of3ForFork0_~#l~0#1.offset|)) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ |thr1Thread1of3ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of3ForFork0_~#l~0#1.offset|)) 0)), 273#true, 125#L701-6true, 277#true, 271#true, 301#true, 128#L701-6true, Black: 281#(= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0), 279#true, Black: 282#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), 204#L703-1true, Black: 283#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0))]) [2025-02-06 09:02:23,969 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2025-02-06 09:02:23,969 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-02-06 09:02:23,969 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-02-06 09:02:23,969 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-02-06 09:02:24,762 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1106] L701-15-->L701: Formula: (let ((.cse1 (select |v_#race_185| |v_thr1Thread2of3ForFork0_~#l~0#1.base_5|)) (.cse3 (+ |v_thr1Thread2of3ForFork0_~#l~0#1.offset_5| 1))) (let ((.cse2 (+ |v_thr1Thread2of3ForFork0_~#l~0#1.offset_5| 3)) (.cse0 (select .cse1 .cse3)) (.cse4 (+ |v_thr1Thread2of3ForFork0_~#l~0#1.offset_5| 2))) (and (= (store |v_#memory_int_86| |v_thr1Thread2of3ForFork0_~#l~0#1.base_5| (store (select |v_#memory_int_86| |v_thr1Thread2of3ForFork0_~#l~0#1.base_5|) |v_thr1Thread2of3ForFork0_~#l~0#1.offset_5| v_~t~0_123)) |v_#memory_int_85|) (= v_~t~0_122 (+ v_~t~0_123 1)) (= .cse0 (select .cse1 |v_thr1Thread2of3ForFork0_~#l~0#1.offset_5|)) (= .cse0 (select .cse1 .cse2)) (not (= (ite (not (= (mod v_~t~0_123 4294967296) 4294967295)) 1 0) 0)) (= |v_#race_185| (store |v_#race_186| |v_thr1Thread2of3ForFork0_~#l~0#1.base_5| (store (store (store (store (select |v_#race_186| |v_thr1Thread2of3ForFork0_~#l~0#1.base_5|) |v_thr1Thread2of3ForFork0_~#l~0#1.offset_5| .cse0) .cse3 .cse0) .cse4 .cse0) .cse2 .cse0))) (= .cse0 (select .cse1 .cse4))))) InVars {#race=|v_#race_186|, #memory_int=|v_#memory_int_86|, thr1Thread2of3ForFork0_~#l~0#1.base=|v_thr1Thread2of3ForFork0_~#l~0#1.base_5|, thr1Thread2of3ForFork0_~#l~0#1.offset=|v_thr1Thread2of3ForFork0_~#l~0#1.offset_5|, ~t~0=v_~t~0_123} OutVars{#race=|v_#race_185|, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1_11|, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base_11|, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_9|, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|, thr1Thread2of3ForFork0_~#l~0#1.offset=|v_thr1Thread2of3ForFork0_~#l~0#1.offset_5|, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base_11|, thr1Thread2of3ForFork0_~#l~0#1.base=|v_thr1Thread2of3ForFork0_~#l~0#1.base_5|, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1_11|, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset_11|, #memory_int=|v_#memory_int_85|, #race~t~0=|v_#race~t~0_209|, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset_11|, ~t~0=v_~t~0_122} AuxVars[] AssignedVars[#race, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset, #memory_int, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, #race~t~0, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset, ~t~0][198], [Black: 284#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 3 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), Black: 292#(= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 0), 107#L701true, Black: 294#(and (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ |thr1Thread1of3ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of3ForFork0_~#l~0#1.offset|)) 0)), 71#L703-1true, 290#true, Black: 293#(and (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ |thr1Thread1of3ForFork0_~#l~0#1.offset| 1)) 0)), 275#true, Black: 295#(and (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ 3 |thr1Thread1of3ForFork0_~#l~0#1.offset|)) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ |thr1Thread1of3ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of3ForFork0_~#l~0#1.offset|)) 0)), 273#true, 125#L701-6true, 277#true, 271#true, 301#true, 128#L701-6true, 279#true, Black: 281#(= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0), Black: 282#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), Black: 283#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0))]) [2025-02-06 09:02:24,763 INFO L294 olderBase$Statistics]: this new event has 121 ancestors and is cut-off event [2025-02-06 09:02:24,763 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-02-06 09:02:24,763 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-02-06 09:02:24,763 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-02-06 09:02:24,763 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-02-06 09:02:26,628 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([982] L701-15-->L701: Formula: (let ((.cse4 (select |v_#race_185| |v_thr1Thread3of3ForFork0_~#l~0#1.base_5|)) (.cse1 (+ |v_thr1Thread3of3ForFork0_~#l~0#1.offset_5| 1))) (let ((.cse2 (+ |v_thr1Thread3of3ForFork0_~#l~0#1.offset_5| 2)) (.cse0 (select .cse4 .cse1)) (.cse3 (+ |v_thr1Thread3of3ForFork0_~#l~0#1.offset_5| 3))) (and (= |v_#memory_int_85| (store |v_#memory_int_86| |v_thr1Thread3of3ForFork0_~#l~0#1.base_5| (store (select |v_#memory_int_86| |v_thr1Thread3of3ForFork0_~#l~0#1.base_5|) |v_thr1Thread3of3ForFork0_~#l~0#1.offset_5| v_~t~0_123))) (= v_~t~0_122 (+ v_~t~0_123 1)) (= |v_#race_185| (store |v_#race_186| |v_thr1Thread3of3ForFork0_~#l~0#1.base_5| (store (store (store (store (select |v_#race_186| |v_thr1Thread3of3ForFork0_~#l~0#1.base_5|) |v_thr1Thread3of3ForFork0_~#l~0#1.offset_5| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0))) (= (select .cse4 |v_thr1Thread3of3ForFork0_~#l~0#1.offset_5|) .cse0) (= .cse0 (select .cse4 .cse2)) (not (= (ite (not (= (mod v_~t~0_123 4294967296) 4294967295)) 1 0) 0)) (= .cse0 (select .cse4 .cse3))))) InVars {#race=|v_#race_186|, #memory_int=|v_#memory_int_86|, thr1Thread3of3ForFork0_~#l~0#1.base=|v_thr1Thread3of3ForFork0_~#l~0#1.base_5|, thr1Thread3of3ForFork0_~#l~0#1.offset=|v_thr1Thread3of3ForFork0_~#l~0#1.offset_5|, ~t~0=v_~t~0_123} OutVars{#race=|v_#race_185|, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1_11|, thr1Thread3of3ForFork0_~#l~0#1.base=|v_thr1Thread3of3ForFork0_~#l~0#1.base_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset_11|, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset_11|, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base_11|, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1_11|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_9|, #memory_int=|v_#memory_int_85|, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base_11|, #race~t~0=|v_#race~t~0_209|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_9|, thr1Thread3of3ForFork0_~#l~0#1.offset=|v_thr1Thread3of3ForFork0_~#l~0#1.offset_5|, ~t~0=v_~t~0_122} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base, #race~t~0, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1, ~t~0][298], [Black: 284#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 3 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), 44#L701true, Black: 292#(= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 0), Black: 294#(and (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ |thr1Thread1of3ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of3ForFork0_~#l~0#1.offset|)) 0)), Black: 293#(and (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ |thr1Thread1of3ForFork0_~#l~0#1.offset| 1)) 0)), 290#true, 275#true, Black: 295#(and (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ 3 |thr1Thread1of3ForFork0_~#l~0#1.offset|)) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ |thr1Thread1of3ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of3ForFork0_~#l~0#1.offset|)) 0)), 273#true, 125#L701-6true, 277#true, 271#true, 147#L703-6true, 303#(= |#race~s~0| 0), 128#L701-6true, Black: 281#(= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0), 279#true, Black: 282#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), Black: 283#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0))]) [2025-02-06 09:02:26,628 INFO L294 olderBase$Statistics]: this new event has 116 ancestors and is cut-off event [2025-02-06 09:02:26,628 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2025-02-06 09:02:26,628 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2025-02-06 09:02:26,628 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2025-02-06 09:02:26,629 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([982] L701-15-->L701: Formula: (let ((.cse4 (select |v_#race_185| |v_thr1Thread3of3ForFork0_~#l~0#1.base_5|)) (.cse1 (+ |v_thr1Thread3of3ForFork0_~#l~0#1.offset_5| 1))) (let ((.cse2 (+ |v_thr1Thread3of3ForFork0_~#l~0#1.offset_5| 2)) (.cse0 (select .cse4 .cse1)) (.cse3 (+ |v_thr1Thread3of3ForFork0_~#l~0#1.offset_5| 3))) (and (= |v_#memory_int_85| (store |v_#memory_int_86| |v_thr1Thread3of3ForFork0_~#l~0#1.base_5| (store (select |v_#memory_int_86| |v_thr1Thread3of3ForFork0_~#l~0#1.base_5|) |v_thr1Thread3of3ForFork0_~#l~0#1.offset_5| v_~t~0_123))) (= v_~t~0_122 (+ v_~t~0_123 1)) (= |v_#race_185| (store |v_#race_186| |v_thr1Thread3of3ForFork0_~#l~0#1.base_5| (store (store (store (store (select |v_#race_186| |v_thr1Thread3of3ForFork0_~#l~0#1.base_5|) |v_thr1Thread3of3ForFork0_~#l~0#1.offset_5| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0))) (= (select .cse4 |v_thr1Thread3of3ForFork0_~#l~0#1.offset_5|) .cse0) (= .cse0 (select .cse4 .cse2)) (not (= (ite (not (= (mod v_~t~0_123 4294967296) 4294967295)) 1 0) 0)) (= .cse0 (select .cse4 .cse3))))) InVars {#race=|v_#race_186|, #memory_int=|v_#memory_int_86|, thr1Thread3of3ForFork0_~#l~0#1.base=|v_thr1Thread3of3ForFork0_~#l~0#1.base_5|, thr1Thread3of3ForFork0_~#l~0#1.offset=|v_thr1Thread3of3ForFork0_~#l~0#1.offset_5|, ~t~0=v_~t~0_123} OutVars{#race=|v_#race_185|, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1_11|, thr1Thread3of3ForFork0_~#l~0#1.base=|v_thr1Thread3of3ForFork0_~#l~0#1.base_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset_11|, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset_11|, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base_11|, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1_11|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_9|, #memory_int=|v_#memory_int_85|, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base_11|, #race~t~0=|v_#race~t~0_209|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_9|, thr1Thread3of3ForFork0_~#l~0#1.offset=|v_thr1Thread3of3ForFork0_~#l~0#1.offset_5|, ~t~0=v_~t~0_122} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base, #race~t~0, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1, ~t~0][298], [Black: 284#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 3 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), 44#L701true, 41#L703-7true, Black: 292#(= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 0), Black: 294#(and (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ |thr1Thread1of3ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of3ForFork0_~#l~0#1.offset|)) 0)), 290#true, Black: 293#(and (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ |thr1Thread1of3ForFork0_~#l~0#1.offset| 1)) 0)), 275#true, Black: 295#(and (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ 3 |thr1Thread1of3ForFork0_~#l~0#1.offset|)) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ |thr1Thread1of3ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of3ForFork0_~#l~0#1.offset|)) 0)), 273#true, 125#L701-6true, 277#true, 271#true, 303#(= |#race~s~0| 0), 128#L701-6true, 279#true, Black: 281#(= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0), Black: 282#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), Black: 283#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0))]) [2025-02-06 09:02:26,632 INFO L294 olderBase$Statistics]: this new event has 117 ancestors and is cut-off event [2025-02-06 09:02:26,632 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-02-06 09:02:26,632 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2025-02-06 09:02:26,632 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2025-02-06 09:02:26,633 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([982] L701-15-->L701: Formula: (let ((.cse4 (select |v_#race_185| |v_thr1Thread3of3ForFork0_~#l~0#1.base_5|)) (.cse1 (+ |v_thr1Thread3of3ForFork0_~#l~0#1.offset_5| 1))) (let ((.cse2 (+ |v_thr1Thread3of3ForFork0_~#l~0#1.offset_5| 2)) (.cse0 (select .cse4 .cse1)) (.cse3 (+ |v_thr1Thread3of3ForFork0_~#l~0#1.offset_5| 3))) (and (= |v_#memory_int_85| (store |v_#memory_int_86| |v_thr1Thread3of3ForFork0_~#l~0#1.base_5| (store (select |v_#memory_int_86| |v_thr1Thread3of3ForFork0_~#l~0#1.base_5|) |v_thr1Thread3of3ForFork0_~#l~0#1.offset_5| v_~t~0_123))) (= v_~t~0_122 (+ v_~t~0_123 1)) (= |v_#race_185| (store |v_#race_186| |v_thr1Thread3of3ForFork0_~#l~0#1.base_5| (store (store (store (store (select |v_#race_186| |v_thr1Thread3of3ForFork0_~#l~0#1.base_5|) |v_thr1Thread3of3ForFork0_~#l~0#1.offset_5| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0))) (= (select .cse4 |v_thr1Thread3of3ForFork0_~#l~0#1.offset_5|) .cse0) (= .cse0 (select .cse4 .cse2)) (not (= (ite (not (= (mod v_~t~0_123 4294967296) 4294967295)) 1 0) 0)) (= .cse0 (select .cse4 .cse3))))) InVars {#race=|v_#race_186|, #memory_int=|v_#memory_int_86|, thr1Thread3of3ForFork0_~#l~0#1.base=|v_thr1Thread3of3ForFork0_~#l~0#1.base_5|, thr1Thread3of3ForFork0_~#l~0#1.offset=|v_thr1Thread3of3ForFork0_~#l~0#1.offset_5|, ~t~0=v_~t~0_123} OutVars{#race=|v_#race_185|, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1_11|, thr1Thread3of3ForFork0_~#l~0#1.base=|v_thr1Thread3of3ForFork0_~#l~0#1.base_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset_11|, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset_11|, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base_11|, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1_11|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_9|, #memory_int=|v_#memory_int_85|, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base_11|, #race~t~0=|v_#race~t~0_209|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_9|, thr1Thread3of3ForFork0_~#l~0#1.offset=|v_thr1Thread3of3ForFork0_~#l~0#1.offset_5|, ~t~0=v_~t~0_122} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base, #race~t~0, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1, ~t~0][278], [Black: 284#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 3 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), 44#L701true, Black: 292#(= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 0), Black: 294#(and (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ |thr1Thread1of3ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of3ForFork0_~#l~0#1.offset|)) 0)), 290#true, Black: 293#(and (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ |thr1Thread1of3ForFork0_~#l~0#1.offset| 1)) 0)), 275#true, Black: 295#(and (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ 3 |thr1Thread1of3ForFork0_~#l~0#1.offset|)) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ |thr1Thread1of3ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of3ForFork0_~#l~0#1.offset|)) 0)), 273#true, 125#L701-6true, 277#true, 271#true, 301#true, 128#L701-6true, 279#true, Black: 281#(= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0), 204#L703-1true, Black: 282#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), Black: 283#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0))]) [2025-02-06 09:02:26,633 INFO L294 olderBase$Statistics]: this new event has 121 ancestors and is cut-off event [2025-02-06 09:02:26,633 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-02-06 09:02:26,633 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-02-06 09:02:26,633 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-02-06 09:02:26,633 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-02-06 09:02:40,400 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([982] L701-15-->L701: Formula: (let ((.cse4 (select |v_#race_185| |v_thr1Thread3of3ForFork0_~#l~0#1.base_5|)) (.cse1 (+ |v_thr1Thread3of3ForFork0_~#l~0#1.offset_5| 1))) (let ((.cse2 (+ |v_thr1Thread3of3ForFork0_~#l~0#1.offset_5| 2)) (.cse0 (select .cse4 .cse1)) (.cse3 (+ |v_thr1Thread3of3ForFork0_~#l~0#1.offset_5| 3))) (and (= |v_#memory_int_85| (store |v_#memory_int_86| |v_thr1Thread3of3ForFork0_~#l~0#1.base_5| (store (select |v_#memory_int_86| |v_thr1Thread3of3ForFork0_~#l~0#1.base_5|) |v_thr1Thread3of3ForFork0_~#l~0#1.offset_5| v_~t~0_123))) (= v_~t~0_122 (+ v_~t~0_123 1)) (= |v_#race_185| (store |v_#race_186| |v_thr1Thread3of3ForFork0_~#l~0#1.base_5| (store (store (store (store (select |v_#race_186| |v_thr1Thread3of3ForFork0_~#l~0#1.base_5|) |v_thr1Thread3of3ForFork0_~#l~0#1.offset_5| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0))) (= (select .cse4 |v_thr1Thread3of3ForFork0_~#l~0#1.offset_5|) .cse0) (= .cse0 (select .cse4 .cse2)) (not (= (ite (not (= (mod v_~t~0_123 4294967296) 4294967295)) 1 0) 0)) (= .cse0 (select .cse4 .cse3))))) InVars {#race=|v_#race_186|, #memory_int=|v_#memory_int_86|, thr1Thread3of3ForFork0_~#l~0#1.base=|v_thr1Thread3of3ForFork0_~#l~0#1.base_5|, thr1Thread3of3ForFork0_~#l~0#1.offset=|v_thr1Thread3of3ForFork0_~#l~0#1.offset_5|, ~t~0=v_~t~0_123} OutVars{#race=|v_#race_185|, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1_11|, thr1Thread3of3ForFork0_~#l~0#1.base=|v_thr1Thread3of3ForFork0_~#l~0#1.base_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset_11|, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset_11|, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base_11|, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1_11|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_9|, #memory_int=|v_#memory_int_85|, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base_11|, #race~t~0=|v_#race~t~0_209|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_9|, thr1Thread3of3ForFork0_~#l~0#1.offset=|v_thr1Thread3of3ForFork0_~#l~0#1.offset_5|, ~t~0=v_~t~0_122} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base, #race~t~0, thr1Thread3of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1, ~t~0][247], [Black: 284#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 3 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), 44#L701true, Black: 292#(= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 0), Black: 294#(and (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ |thr1Thread1of3ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of3ForFork0_~#l~0#1.offset|)) 0)), Black: 293#(and (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ |thr1Thread1of3ForFork0_~#l~0#1.offset| 1)) 0)), 290#true, 275#true, Black: 295#(and (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ 3 |thr1Thread1of3ForFork0_~#l~0#1.offset|)) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ |thr1Thread1of3ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of3ForFork0_~#l~0#1.offset|)) 0)), 273#true, 125#L701-6true, 277#true, 271#true, 124#thr1FINALtrue, 301#true, Black: 281#(= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0), 279#true, Black: 282#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), 204#L703-1true, Black: 283#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0))]) [2025-02-06 09:02:40,401 INFO L294 olderBase$Statistics]: this new event has 128 ancestors and is cut-off event [2025-02-06 09:02:40,401 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2025-02-06 09:02:40,401 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2025-02-06 09:02:40,401 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2025-02-06 09:02:40,701 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1106] L701-15-->L701: Formula: (let ((.cse1 (select |v_#race_185| |v_thr1Thread2of3ForFork0_~#l~0#1.base_5|)) (.cse3 (+ |v_thr1Thread2of3ForFork0_~#l~0#1.offset_5| 1))) (let ((.cse2 (+ |v_thr1Thread2of3ForFork0_~#l~0#1.offset_5| 3)) (.cse0 (select .cse1 .cse3)) (.cse4 (+ |v_thr1Thread2of3ForFork0_~#l~0#1.offset_5| 2))) (and (= (store |v_#memory_int_86| |v_thr1Thread2of3ForFork0_~#l~0#1.base_5| (store (select |v_#memory_int_86| |v_thr1Thread2of3ForFork0_~#l~0#1.base_5|) |v_thr1Thread2of3ForFork0_~#l~0#1.offset_5| v_~t~0_123)) |v_#memory_int_85|) (= v_~t~0_122 (+ v_~t~0_123 1)) (= .cse0 (select .cse1 |v_thr1Thread2of3ForFork0_~#l~0#1.offset_5|)) (= .cse0 (select .cse1 .cse2)) (not (= (ite (not (= (mod v_~t~0_123 4294967296) 4294967295)) 1 0) 0)) (= |v_#race_185| (store |v_#race_186| |v_thr1Thread2of3ForFork0_~#l~0#1.base_5| (store (store (store (store (select |v_#race_186| |v_thr1Thread2of3ForFork0_~#l~0#1.base_5|) |v_thr1Thread2of3ForFork0_~#l~0#1.offset_5| .cse0) .cse3 .cse0) .cse4 .cse0) .cse2 .cse0))) (= .cse0 (select .cse1 .cse4))))) InVars {#race=|v_#race_186|, #memory_int=|v_#memory_int_86|, thr1Thread2of3ForFork0_~#l~0#1.base=|v_thr1Thread2of3ForFork0_~#l~0#1.base_5|, thr1Thread2of3ForFork0_~#l~0#1.offset=|v_thr1Thread2of3ForFork0_~#l~0#1.offset_5|, ~t~0=v_~t~0_123} OutVars{#race=|v_#race_185|, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1_11|, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base_11|, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_9|, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|, thr1Thread2of3ForFork0_~#l~0#1.offset=|v_thr1Thread2of3ForFork0_~#l~0#1.offset_5|, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base_11|, thr1Thread2of3ForFork0_~#l~0#1.base=|v_thr1Thread2of3ForFork0_~#l~0#1.base_5|, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1_11|, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset_11|, #memory_int=|v_#memory_int_85|, #race~t~0=|v_#race~t~0_209|, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset_11|, ~t~0=v_~t~0_122} AuxVars[] AssignedVars[#race, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet3#1, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.base, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.base, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#t~nondet4#1, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l#1.offset, #memory_int, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, #race~t~0, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of3ForFork0___VERIFIER_atomic_fetch_and_inc_~l#1.offset, ~t~0][163], [Black: 284#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 3 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), 107#L701true, Black: 292#(= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 0), Black: 294#(and (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ |thr1Thread1of3ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of3ForFork0_~#l~0#1.offset|)) 0)), 71#L703-1true, 290#true, Black: 293#(and (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ |thr1Thread1of3ForFork0_~#l~0#1.offset| 1)) 0)), 275#true, Black: 295#(and (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ 3 |thr1Thread1of3ForFork0_~#l~0#1.offset|)) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ |thr1Thread1of3ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of3ForFork0_~#l~0#1.offset|)) 0)), 273#true, 125#L701-6true, 277#true, 271#true, 124#thr1FINALtrue, 301#true, Black: 281#(= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0), 279#true, Black: 282#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), Black: 283#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0))]) [2025-02-06 09:02:40,702 INFO L294 olderBase$Statistics]: this new event has 139 ancestors and is cut-off event [2025-02-06 09:02:40,702 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2025-02-06 09:02:40,702 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2025-02-06 09:02:40,702 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2025-02-06 09:02:40,845 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1061] L701-6-->L701-4: Formula: (= |v_#race~s~0_9| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_9|} AuxVars[] AssignedVars[#race~s~0][54], [Black: 279#true, 77#L701-4true, Black: 292#(= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 0), 107#L701true, Black: 294#(and (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ |thr1Thread1of3ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of3ForFork0_~#l~0#1.offset|)) 0)), Black: 290#true, Black: 293#(and (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ |thr1Thread1of3ForFork0_~#l~0#1.offset| 1)) 0)), 71#L703-1true, 284#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 3 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), 275#true, 273#true, 52#L703-1true, 295#(and (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ 3 |thr1Thread1of3ForFork0_~#l~0#1.offset|)) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ |thr1Thread1of3ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of3ForFork0_~#l~0#1.offset|)) 0)), 277#true, 271#true, 303#(= |#race~s~0| 0), Black: 281#(= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0), Black: 282#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), Black: 283#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0))]) [2025-02-06 09:02:40,845 INFO L294 olderBase$Statistics]: this new event has 134 ancestors and is cut-off event [2025-02-06 09:02:40,845 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2025-02-06 09:02:40,845 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2025-02-06 09:02:40,845 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2025-02-06 09:02:42,225 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([950] L701-6-->L701-4: Formula: (= |v_#race~s~0_18| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_18|} AuxVars[] AssignedVars[#race~s~0][52], [Black: 279#true, Black: 292#(= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 0), 107#L701true, Black: 294#(and (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ |thr1Thread1of3ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of3ForFork0_~#l~0#1.offset|)) 0)), Black: 293#(and (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ |thr1Thread1of3ForFork0_~#l~0#1.offset| 1)) 0)), 71#L703-1true, 290#true, 284#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 3 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), 275#true, Black: 295#(and (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ 3 |thr1Thread1of3ForFork0_~#l~0#1.offset|)) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) |thr1Thread1of3ForFork0_~#l~0#1.offset|) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ |thr1Thread1of3ForFork0_~#l~0#1.offset| 1)) 0) (= (select (select |#race| |thr1Thread1of3ForFork0_~#l~0#1.base|) (+ 2 |thr1Thread1of3ForFork0_~#l~0#1.offset|)) 0)), 273#true, 94#L701-4true, 277#true, 271#true, 124#thr1FINALtrue, 303#(= |#race~s~0| 0), Black: 281#(= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0), Black: 282#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0)), Black: 283#(and (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ 2 |ULTIMATE.start_thr1_~#l~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) |ULTIMATE.start_thr1_~#l~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_thr1_~#l~0#1.base|) (+ |ULTIMATE.start_thr1_~#l~0#1.offset| 1)) 0))]) [2025-02-06 09:02:42,225 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is cut-off event [2025-02-06 09:02:42,225 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2025-02-06 09:02:42,229 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2025-02-06 09:02:42,229 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2025-02-06 09:02:55,113 INFO L124 PetriNetUnfolderBase]: 75917/334355 cut-off events. [2025-02-06 09:02:55,114 INFO L125 PetriNetUnfolderBase]: For 97958/100673 co-relation queries the response was YES.