./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-ext/26_stack_cas_longer-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/26_stack_cas_longer-1.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 f66a662852389d8ac1f64241746e843d67de7f5d7507051fb5c8e68404b785cd --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:05:51,149 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:05:51,189 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:05:51,192 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:05:51,192 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:05:51,213 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:05:51,213 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:05:51,213 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:05:51,214 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:05:51,214 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:05:51,218 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:05:51,218 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:05:51,218 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:05:51,218 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:05:51,218 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:05:51,218 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:05:51,218 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:05:51,218 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:05:51,218 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:05:51,218 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:05:51,218 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:05:51,218 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:05:51,218 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:05:51,218 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:05:51,219 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:05:51,219 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:05:51,219 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:05:51,219 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:05:51,219 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:05:51,219 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:05:51,219 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:05:51,219 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:05:51,219 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:05:51,219 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:05:51,219 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:05:51,219 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:05:51,219 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:05:51,219 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:05:51,219 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:05:51,219 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:05:51,219 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:05:51,219 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:05:51,219 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:05:51,219 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:05:51,219 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:05:51,219 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:05:51,219 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 -> f66a662852389d8ac1f64241746e843d67de7f5d7507051fb5c8e68404b785cd [2025-01-09 21:05:51,450 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:05:51,459 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:05:51,461 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:05:51,462 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:05:51,462 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:05:51,467 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/26_stack_cas_longer-1.i [2025-01-09 21:05:52,680 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c28cc2561/1fcf9c7af6184686bbf4874001ae4da2/FLAGb82671eff [2025-01-09 21:05:53,023 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:05:53,023 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/26_stack_cas_longer-1.i [2025-01-09 21:05:53,039 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c28cc2561/1fcf9c7af6184686bbf4874001ae4da2/FLAGb82671eff [2025-01-09 21:05:53,056 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c28cc2561/1fcf9c7af6184686bbf4874001ae4da2 [2025-01-09 21:05:53,061 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:05:53,062 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:05:53,063 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:05:53,063 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:05:53,065 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:05:53,069 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:05:53" (1/1) ... [2025-01-09 21:05:53,069 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@658708a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:05:53, skipping insertion in model container [2025-01-09 21:05:53,069 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:05:53" (1/1) ... [2025-01-09 21:05:53,107 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:05:53,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:05:53,371 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:05:53,404 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:05:53,433 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:05:53,433 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:05:53 WrapperNode [2025-01-09 21:05:53,434 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:05:53,434 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:05:53,434 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:05:53,434 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:05:53,440 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:05:53" (1/1) ... [2025-01-09 21:05:53,464 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:05:53" (1/1) ... [2025-01-09 21:05:53,492 INFO L138 Inliner]: procedures = 179, calls = 47, calls flagged for inlining = 17, calls inlined = 20, statements flattened = 954 [2025-01-09 21:05:53,493 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:05:53,493 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:05:53,494 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:05:53,494 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:05:53,503 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:05:53" (1/1) ... [2025-01-09 21:05:53,503 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:05:53" (1/1) ... [2025-01-09 21:05:53,512 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:05:53" (1/1) ... [2025-01-09 21:05:53,512 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:05:53" (1/1) ... [2025-01-09 21:05:53,529 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:05:53" (1/1) ... [2025-01-09 21:05:53,532 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:05:53" (1/1) ... [2025-01-09 21:05:53,535 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:05:53" (1/1) ... [2025-01-09 21:05:53,538 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:05:53" (1/1) ... [2025-01-09 21:05:53,539 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:05:53" (1/1) ... [2025-01-09 21:05:53,542 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:05:53,543 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:05:53,543 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:05:53,543 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:05:53,544 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:05:53" (1/1) ... [2025-01-09 21:05:53,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:05:53,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:05:53,569 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-01-09 21:05:53,571 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-01-09 21:05:53,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:05:53,587 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-01-09 21:05:53,587 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-01-09 21:05:53,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:05:53,587 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 21:05:53,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:05:53,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 21:05:53,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 21:05:53,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:05:53,587 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 21:05:53,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:05:53,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:05:53,589 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:05:53,669 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:05:53,671 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:05:54,651 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:05:54,652 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:05:54,936 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:05:54,936 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-01-09 21:05:54,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:05:54 BoogieIcfgContainer [2025-01-09 21:05:54,937 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:05:54,938 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:05:54,938 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:05:54,942 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:05:54,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:05:53" (1/3) ... [2025-01-09 21:05:54,943 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75cd3e68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:05:54, skipping insertion in model container [2025-01-09 21:05:54,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:05:53" (2/3) ... [2025-01-09 21:05:54,943 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75cd3e68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:05:54, skipping insertion in model container [2025-01-09 21:05:54,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:05:54" (3/3) ... [2025-01-09 21:05:54,944 INFO L128 eAbstractionObserver]: Analyzing ICFG 26_stack_cas_longer-1.i [2025-01-09 21:05:54,957 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:05:54,958 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 26_stack_cas_longer-1.i that has 2 procedures, 805 locations, 1 initial locations, 3 loop locations, and 26 error locations. [2025-01-09 21:05:54,958 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:05:55,051 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:05:55,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 808 places, 812 transitions, 1628 flow [2025-01-09 21:05:55,341 INFO L124 PetriNetUnfolderBase]: 7/819 cut-off events. [2025-01-09 21:05:55,343 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:05:55,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 823 conditions, 819 events. 7/819 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 244 event pairs, 0 based on Foata normal form. 0/784 useless extension candidates. Maximal degree in co-relation 149. Up to 3 conditions per place. [2025-01-09 21:05:55,346 INFO L82 GeneralOperation]: Start removeDead. Operand has 808 places, 812 transitions, 1628 flow [2025-01-09 21:05:55,352 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 808 places, 812 transitions, 1628 flow [2025-01-09 21:05:55,357 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:05:55,365 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;@1c0e81c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:05:55,365 INFO L334 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2025-01-09 21:05:55,450 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:05:55,450 INFO L124 PetriNetUnfolderBase]: 0/671 cut-off events. [2025-01-09 21:05:55,450 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:05:55,450 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:05:55,455 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:05:55,455 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 49 more)] === [2025-01-09 21:05:55,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:05:55,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1497738597, now seen corresponding path program 1 times [2025-01-09 21:05:55,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:05:55,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051094818] [2025-01-09 21:05:55,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:05:55,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:05:55,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 667 statements into 1 equivalence classes. [2025-01-09 21:05:55,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 667 of 667 statements. [2025-01-09 21:05:55,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:05:55,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:05:57,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:05:57,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:05:57,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051094818] [2025-01-09 21:05:57,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051094818] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:05:57,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:05:57,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-09 21:05:57,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049006332] [2025-01-09 21:05:57,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:05:57,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 21:05:57,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:05:57,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 21:05:57,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 21:05:57,811 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 784 out of 812 [2025-01-09 21:05:57,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 808 places, 812 transitions, 1628 flow. Second operand has 2 states, 2 states have (on average 785.0) internal successors, (1570), 2 states have internal predecessors, (1570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:05:57,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:05:57,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 784 of 812 [2025-01-09 21:05:57,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:05:58,076 INFO L124 PetriNetUnfolderBase]: 5/790 cut-off events. [2025-01-09 21:05:58,077 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:05:58,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 804 conditions, 790 events. 5/790 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 143 event pairs, 0 based on Foata normal form. 8/783 useless extension candidates. Maximal degree in co-relation 132. Up to 10 conditions per place. [2025-01-09 21:05:58,080 INFO L140 encePairwiseOnDemand]: 793/812 looper letters, 9 selfloop transitions, 0 changer transitions 0/787 dead transitions. [2025-01-09 21:05:58,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 786 places, 787 transitions, 1596 flow [2025-01-09 21:05:58,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 21:05:58,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-09 21:05:58,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1596 transitions. [2025-01-09 21:05:58,098 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9827586206896551 [2025-01-09 21:05:58,100 INFO L175 Difference]: Start difference. First operand has 808 places, 812 transitions, 1628 flow. Second operand 2 states and 1596 transitions. [2025-01-09 21:05:58,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 786 places, 787 transitions, 1596 flow [2025-01-09 21:05:58,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 786 places, 787 transitions, 1596 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:05:58,119 INFO L231 Difference]: Finished difference. Result has 786 places, 787 transitions, 1578 flow [2025-01-09 21:05:58,122 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=812, PETRI_DIFFERENCE_MINUEND_FLOW=1578, PETRI_DIFFERENCE_MINUEND_PLACES=785, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=787, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=787, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=1578, PETRI_PLACES=786, PETRI_TRANSITIONS=787} [2025-01-09 21:05:58,125 INFO L279 CegarLoopForPetriNet]: 808 programPoint places, -22 predicate places. [2025-01-09 21:05:58,125 INFO L471 AbstractCegarLoop]: Abstraction has has 786 places, 787 transitions, 1578 flow [2025-01-09 21:05:58,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 785.0) internal successors, (1570), 2 states have internal predecessors, (1570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:05:58,126 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:05:58,127 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:05:58,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:05:58,127 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 49 more)] === [2025-01-09 21:05:58,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:05:58,129 INFO L85 PathProgramCache]: Analyzing trace with hash -512675906, now seen corresponding path program 1 times [2025-01-09 21:05:58,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:05:58,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937632901] [2025-01-09 21:05:58,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:05:58,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:05:58,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 669 statements into 1 equivalence classes. [2025-01-09 21:05:58,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 669 of 669 statements. [2025-01-09 21:05:58,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:05:58,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:05:58,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:05:58,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:05:58,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937632901] [2025-01-09 21:05:58,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937632901] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:05:58,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:05:58,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:05:58,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14634119] [2025-01-09 21:05:58,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:05:58,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:05:58,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:05:58,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:05:58,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:05:58,727 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 780 out of 812 [2025-01-09 21:05:58,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 786 places, 787 transitions, 1578 flow. Second operand has 3 states, 3 states have (on average 781.3333333333334) internal successors, (2344), 3 states have internal predecessors, (2344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:05:58,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:05:58,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 780 of 812 [2025-01-09 21:05:58,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:05:58,928 INFO L124 PetriNetUnfolderBase]: 8/884 cut-off events. [2025-01-09 21:05:58,929 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:05:58,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 909 conditions, 884 events. 8/884 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 446 event pairs, 0 based on Foata normal form. 0/859 useless extension candidates. Maximal degree in co-relation 905. Up to 11 conditions per place. [2025-01-09 21:05:58,931 INFO L140 encePairwiseOnDemand]: 809/812 looper letters, 17 selfloop transitions, 2 changer transitions 0/793 dead transitions. [2025-01-09 21:05:58,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 787 places, 793 transitions, 1628 flow [2025-01-09 21:05:58,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:05:58,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:05:58,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2360 transitions. [2025-01-09 21:05:58,936 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9688013136288999 [2025-01-09 21:05:58,936 INFO L175 Difference]: Start difference. First operand has 786 places, 787 transitions, 1578 flow. Second operand 3 states and 2360 transitions. [2025-01-09 21:05:58,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 787 places, 793 transitions, 1628 flow [2025-01-09 21:05:58,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 787 places, 793 transitions, 1628 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:05:58,946 INFO L231 Difference]: Finished difference. Result has 787 places, 786 transitions, 1580 flow [2025-01-09 21:05:58,947 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=812, PETRI_DIFFERENCE_MINUEND_FLOW=1576, PETRI_DIFFERENCE_MINUEND_PLACES=785, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=786, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=784, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1580, PETRI_PLACES=787, PETRI_TRANSITIONS=786} [2025-01-09 21:05:58,947 INFO L279 CegarLoopForPetriNet]: 808 programPoint places, -21 predicate places. [2025-01-09 21:05:58,948 INFO L471 AbstractCegarLoop]: Abstraction has has 787 places, 786 transitions, 1580 flow [2025-01-09 21:05:58,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 781.3333333333334) internal successors, (2344), 3 states have internal predecessors, (2344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:05:58,949 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:05:58,949 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:05:58,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:05:58,949 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 49 more)] === [2025-01-09 21:05:58,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:05:58,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1140762417, now seen corresponding path program 1 times [2025-01-09 21:05:58,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:05:58,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345207323] [2025-01-09 21:05:58,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:05:58,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:05:59,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 671 statements into 1 equivalence classes. [2025-01-09 21:05:59,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 671 of 671 statements. [2025-01-09 21:05:59,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:05:59,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:05:59,105 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:05:59,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 671 statements into 1 equivalence classes. [2025-01-09 21:05:59,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 671 of 671 statements. [2025-01-09 21:05:59,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:05:59,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:05:59,315 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:05:59,315 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:05:59,316 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (52 of 53 remaining) [2025-01-09 21:05:59,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (51 of 53 remaining) [2025-01-09 21:05:59,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (50 of 53 remaining) [2025-01-09 21:05:59,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (49 of 53 remaining) [2025-01-09 21:05:59,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (48 of 53 remaining) [2025-01-09 21:05:59,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (47 of 53 remaining) [2025-01-09 21:05:59,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (46 of 53 remaining) [2025-01-09 21:05:59,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (45 of 53 remaining) [2025-01-09 21:05:59,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (44 of 53 remaining) [2025-01-09 21:05:59,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (43 of 53 remaining) [2025-01-09 21:05:59,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (42 of 53 remaining) [2025-01-09 21:05:59,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (41 of 53 remaining) [2025-01-09 21:05:59,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (40 of 53 remaining) [2025-01-09 21:05:59,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (39 of 53 remaining) [2025-01-09 21:05:59,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (38 of 53 remaining) [2025-01-09 21:05:59,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (37 of 53 remaining) [2025-01-09 21:05:59,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (36 of 53 remaining) [2025-01-09 21:05:59,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (35 of 53 remaining) [2025-01-09 21:05:59,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (34 of 53 remaining) [2025-01-09 21:05:59,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (33 of 53 remaining) [2025-01-09 21:05:59,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (32 of 53 remaining) [2025-01-09 21:05:59,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (31 of 53 remaining) [2025-01-09 21:05:59,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (30 of 53 remaining) [2025-01-09 21:05:59,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (29 of 53 remaining) [2025-01-09 21:05:59,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (28 of 53 remaining) [2025-01-09 21:05:59,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (27 of 53 remaining) [2025-01-09 21:05:59,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (26 of 53 remaining) [2025-01-09 21:05:59,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (25 of 53 remaining) [2025-01-09 21:05:59,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (24 of 53 remaining) [2025-01-09 21:05:59,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (23 of 53 remaining) [2025-01-09 21:05:59,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (22 of 53 remaining) [2025-01-09 21:05:59,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (21 of 53 remaining) [2025-01-09 21:05:59,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (20 of 53 remaining) [2025-01-09 21:05:59,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (19 of 53 remaining) [2025-01-09 21:05:59,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (18 of 53 remaining) [2025-01-09 21:05:59,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (17 of 53 remaining) [2025-01-09 21:05:59,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (16 of 53 remaining) [2025-01-09 21:05:59,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (15 of 53 remaining) [2025-01-09 21:05:59,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (14 of 53 remaining) [2025-01-09 21:05:59,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (13 of 53 remaining) [2025-01-09 21:05:59,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (12 of 53 remaining) [2025-01-09 21:05:59,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (11 of 53 remaining) [2025-01-09 21:05:59,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (10 of 53 remaining) [2025-01-09 21:05:59,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (9 of 53 remaining) [2025-01-09 21:05:59,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (8 of 53 remaining) [2025-01-09 21:05:59,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (7 of 53 remaining) [2025-01-09 21:05:59,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (6 of 53 remaining) [2025-01-09 21:05:59,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (5 of 53 remaining) [2025-01-09 21:05:59,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (4 of 53 remaining) [2025-01-09 21:05:59,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (3 of 53 remaining) [2025-01-09 21:05:59,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (2 of 53 remaining) [2025-01-09 21:05:59,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (1 of 53 remaining) [2025-01-09 21:05:59,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (0 of 53 remaining) [2025-01-09 21:05:59,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:05:59,320 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-09 21:05:59,321 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:05:59,321 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-09 21:05:59,395 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:05:59,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 944 places, 953 transitions, 1916 flow [2025-01-09 21:05:59,568 INFO L124 PetriNetUnfolderBase]: 14/969 cut-off events. [2025-01-09 21:05:59,568 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:05:59,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 977 conditions, 969 events. 14/969 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 986 event pairs, 0 based on Foata normal form. 0/900 useless extension candidates. Maximal degree in co-relation 820. Up to 3 conditions per place. [2025-01-09 21:05:59,572 INFO L82 GeneralOperation]: Start removeDead. Operand has 944 places, 953 transitions, 1916 flow [2025-01-09 21:05:59,578 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 944 places, 953 transitions, 1916 flow [2025-01-09 21:05:59,579 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:05:59,579 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;@1c0e81c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:05:59,579 INFO L334 AbstractCegarLoop]: Starting to check reachability of 79 error locations. [2025-01-09 21:05:59,631 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:05:59,631 INFO L124 PetriNetUnfolderBase]: 0/671 cut-off events. [2025-01-09 21:05:59,631 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:05:59,631 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:05:59,631 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:05:59,632 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2025-01-09 21:05:59,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:05:59,633 INFO L85 PathProgramCache]: Analyzing trace with hash 795804864, now seen corresponding path program 1 times [2025-01-09 21:05:59,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:05:59,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747996764] [2025-01-09 21:05:59,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:05:59,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:05:59,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 667 statements into 1 equivalence classes. [2025-01-09 21:05:59,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 667 of 667 statements. [2025-01-09 21:05:59,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:05:59,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:06:00,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:06:00,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:06:00,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747996764] [2025-01-09 21:06:00,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747996764] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:06:00,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:06:00,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-09 21:06:00,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137231050] [2025-01-09 21:06:00,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:06:00,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 21:06:00,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:06:00,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 21:06:00,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 21:06:00,856 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 898 out of 953 [2025-01-09 21:06:00,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 944 places, 953 transitions, 1916 flow. Second operand has 2 states, 2 states have (on average 899.0) internal successors, (1798), 2 states have internal predecessors, (1798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:06:00,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:06:00,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 898 of 953 [2025-01-09 21:06:00,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:06:01,377 INFO L124 PetriNetUnfolderBase]: 123/2019 cut-off events. [2025-01-09 21:06:01,377 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-01-09 21:06:01,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2206 conditions, 2019 events. 123/2019 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 8852 event pairs, 52 based on Foata normal form. 89/1936 useless extension candidates. Maximal degree in co-relation 1367. Up to 161 conditions per place. [2025-01-09 21:06:01,388 INFO L140 encePairwiseOnDemand]: 916/953 looper letters, 18 selfloop transitions, 0 changer transitions 0/907 dead transitions. [2025-01-09 21:06:01,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 903 places, 907 transitions, 1860 flow [2025-01-09 21:06:01,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 21:06:01,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-09 21:06:01,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1851 transitions. [2025-01-09 21:06:01,392 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9711437565582371 [2025-01-09 21:06:01,392 INFO L175 Difference]: Start difference. First operand has 944 places, 953 transitions, 1916 flow. Second operand 2 states and 1851 transitions. [2025-01-09 21:06:01,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 903 places, 907 transitions, 1860 flow [2025-01-09 21:06:01,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 903 places, 907 transitions, 1860 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:06:01,405 INFO L231 Difference]: Finished difference. Result has 903 places, 907 transitions, 1824 flow [2025-01-09 21:06:01,406 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=953, PETRI_DIFFERENCE_MINUEND_FLOW=1824, PETRI_DIFFERENCE_MINUEND_PLACES=902, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=907, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=907, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=1824, PETRI_PLACES=903, PETRI_TRANSITIONS=907} [2025-01-09 21:06:01,409 INFO L279 CegarLoopForPetriNet]: 944 programPoint places, -41 predicate places. [2025-01-09 21:06:01,409 INFO L471 AbstractCegarLoop]: Abstraction has has 903 places, 907 transitions, 1824 flow [2025-01-09 21:06:01,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 899.0) internal successors, (1798), 2 states have internal predecessors, (1798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:06:01,411 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:06:01,411 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:06:01,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:06:01,411 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2025-01-09 21:06:01,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:06:01,414 INFO L85 PathProgramCache]: Analyzing trace with hash 264402243, now seen corresponding path program 1 times [2025-01-09 21:06:01,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:06:01,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735881055] [2025-01-09 21:06:01,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:06:01,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:06:01,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 669 statements into 1 equivalence classes. [2025-01-09 21:06:01,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 669 of 669 statements. [2025-01-09 21:06:01,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:06:01,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:06:01,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:06:01,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:06:01,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735881055] [2025-01-09 21:06:01,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735881055] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:06:01,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:06:01,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:06:01,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129185629] [2025-01-09 21:06:01,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:06:01,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:06:01,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:06:01,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:06:01,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:06:01,767 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 890 out of 953 [2025-01-09 21:06:01,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 903 places, 907 transitions, 1824 flow. Second operand has 3 states, 3 states have (on average 891.3333333333334) internal successors, (2674), 3 states have internal predecessors, (2674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:06:01,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:06:01,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 890 of 953 [2025-01-09 21:06:01,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:06:02,645 INFO L124 PetriNetUnfolderBase]: 399/4511 cut-off events. [2025-01-09 21:06:02,645 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-01-09 21:06:02,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5140 conditions, 4511 events. 399/4511 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 34924 event pairs, 99 based on Foata normal form. 0/4034 useless extension candidates. Maximal degree in co-relation 5135. Up to 293 conditions per place. [2025-01-09 21:06:02,668 INFO L140 encePairwiseOnDemand]: 945/953 looper letters, 43 selfloop transitions, 6 changer transitions 0/930 dead transitions. [2025-01-09 21:06:02,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 905 places, 930 transitions, 1973 flow [2025-01-09 21:06:02,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:06:02,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:06:02,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2721 transitions. [2025-01-09 21:06:02,674 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9517313746065058 [2025-01-09 21:06:02,674 INFO L175 Difference]: Start difference. First operand has 903 places, 907 transitions, 1824 flow. Second operand 3 states and 2721 transitions. [2025-01-09 21:06:02,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 905 places, 930 transitions, 1973 flow [2025-01-09 21:06:02,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 905 places, 930 transitions, 1973 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:06:02,685 INFO L231 Difference]: Finished difference. Result has 907 places, 913 transitions, 1876 flow [2025-01-09 21:06:02,686 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=953, PETRI_DIFFERENCE_MINUEND_FLOW=1824, PETRI_DIFFERENCE_MINUEND_PLACES=903, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=907, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=901, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1876, PETRI_PLACES=907, PETRI_TRANSITIONS=913} [2025-01-09 21:06:02,686 INFO L279 CegarLoopForPetriNet]: 944 programPoint places, -37 predicate places. [2025-01-09 21:06:02,686 INFO L471 AbstractCegarLoop]: Abstraction has has 907 places, 913 transitions, 1876 flow [2025-01-09 21:06:02,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 891.3333333333334) internal successors, (2674), 3 states have internal predecessors, (2674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:06:02,688 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:06:02,688 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:06:02,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:06:02,688 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2025-01-09 21:06:02,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:06:02,690 INFO L85 PathProgramCache]: Analyzing trace with hash 354568327, now seen corresponding path program 1 times [2025-01-09 21:06:02,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:06:02,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476041849] [2025-01-09 21:06:02,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:06:02,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:06:02,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 677 statements into 1 equivalence classes. [2025-01-09 21:06:02,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 677 of 677 statements. [2025-01-09 21:06:02,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:06:02,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:06:02,836 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:06:02,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 677 statements into 1 equivalence classes. [2025-01-09 21:06:02,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 677 of 677 statements. [2025-01-09 21:06:02,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:06:02,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:06:02,982 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:06:02,982 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:06:02,983 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (78 of 79 remaining) [2025-01-09 21:06:02,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (77 of 79 remaining) [2025-01-09 21:06:02,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (76 of 79 remaining) [2025-01-09 21:06:02,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (75 of 79 remaining) [2025-01-09 21:06:02,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (74 of 79 remaining) [2025-01-09 21:06:02,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (73 of 79 remaining) [2025-01-09 21:06:02,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (72 of 79 remaining) [2025-01-09 21:06:02,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (71 of 79 remaining) [2025-01-09 21:06:02,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (70 of 79 remaining) [2025-01-09 21:06:02,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (69 of 79 remaining) [2025-01-09 21:06:02,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (68 of 79 remaining) [2025-01-09 21:06:02,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (67 of 79 remaining) [2025-01-09 21:06:02,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (66 of 79 remaining) [2025-01-09 21:06:02,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (65 of 79 remaining) [2025-01-09 21:06:02,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (64 of 79 remaining) [2025-01-09 21:06:02,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (63 of 79 remaining) [2025-01-09 21:06:02,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (62 of 79 remaining) [2025-01-09 21:06:02,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (61 of 79 remaining) [2025-01-09 21:06:02,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (60 of 79 remaining) [2025-01-09 21:06:02,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (59 of 79 remaining) [2025-01-09 21:06:02,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (58 of 79 remaining) [2025-01-09 21:06:02,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (57 of 79 remaining) [2025-01-09 21:06:02,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (56 of 79 remaining) [2025-01-09 21:06:02,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (55 of 79 remaining) [2025-01-09 21:06:02,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (54 of 79 remaining) [2025-01-09 21:06:02,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (53 of 79 remaining) [2025-01-09 21:06:02,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (52 of 79 remaining) [2025-01-09 21:06:02,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (51 of 79 remaining) [2025-01-09 21:06:02,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (50 of 79 remaining) [2025-01-09 21:06:02,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (49 of 79 remaining) [2025-01-09 21:06:02,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (48 of 79 remaining) [2025-01-09 21:06:02,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (47 of 79 remaining) [2025-01-09 21:06:02,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (46 of 79 remaining) [2025-01-09 21:06:02,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (45 of 79 remaining) [2025-01-09 21:06:02,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (44 of 79 remaining) [2025-01-09 21:06:02,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (43 of 79 remaining) [2025-01-09 21:06:02,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (42 of 79 remaining) [2025-01-09 21:06:02,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (41 of 79 remaining) [2025-01-09 21:06:02,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (40 of 79 remaining) [2025-01-09 21:06:02,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (39 of 79 remaining) [2025-01-09 21:06:02,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (38 of 79 remaining) [2025-01-09 21:06:02,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (37 of 79 remaining) [2025-01-09 21:06:02,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (36 of 79 remaining) [2025-01-09 21:06:02,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (35 of 79 remaining) [2025-01-09 21:06:02,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (34 of 79 remaining) [2025-01-09 21:06:02,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (33 of 79 remaining) [2025-01-09 21:06:02,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (32 of 79 remaining) [2025-01-09 21:06:02,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (31 of 79 remaining) [2025-01-09 21:06:02,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (30 of 79 remaining) [2025-01-09 21:06:02,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (29 of 79 remaining) [2025-01-09 21:06:02,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (28 of 79 remaining) [2025-01-09 21:06:02,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (27 of 79 remaining) [2025-01-09 21:06:02,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (26 of 79 remaining) [2025-01-09 21:06:02,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (25 of 79 remaining) [2025-01-09 21:06:02,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (24 of 79 remaining) [2025-01-09 21:06:02,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (23 of 79 remaining) [2025-01-09 21:06:02,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (22 of 79 remaining) [2025-01-09 21:06:02,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (21 of 79 remaining) [2025-01-09 21:06:02,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (20 of 79 remaining) [2025-01-09 21:06:02,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (19 of 79 remaining) [2025-01-09 21:06:02,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (18 of 79 remaining) [2025-01-09 21:06:02,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (17 of 79 remaining) [2025-01-09 21:06:02,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (16 of 79 remaining) [2025-01-09 21:06:02,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (15 of 79 remaining) [2025-01-09 21:06:02,987 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (14 of 79 remaining) [2025-01-09 21:06:02,987 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (13 of 79 remaining) [2025-01-09 21:06:02,987 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (12 of 79 remaining) [2025-01-09 21:06:02,987 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (11 of 79 remaining) [2025-01-09 21:06:02,987 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (10 of 79 remaining) [2025-01-09 21:06:02,987 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (9 of 79 remaining) [2025-01-09 21:06:02,987 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (8 of 79 remaining) [2025-01-09 21:06:02,987 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (7 of 79 remaining) [2025-01-09 21:06:02,987 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (6 of 79 remaining) [2025-01-09 21:06:02,987 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (5 of 79 remaining) [2025-01-09 21:06:02,987 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (4 of 79 remaining) [2025-01-09 21:06:02,987 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (3 of 79 remaining) [2025-01-09 21:06:02,987 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (2 of 79 remaining) [2025-01-09 21:06:02,987 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (1 of 79 remaining) [2025-01-09 21:06:02,987 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (0 of 79 remaining) [2025-01-09 21:06:02,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:06:02,988 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-09 21:06:02,988 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:06:02,988 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-09 21:06:03,082 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:06:03,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1080 places, 1094 transitions, 2206 flow [2025-01-09 21:06:03,306 INFO L124 PetriNetUnfolderBase]: 21/1119 cut-off events. [2025-01-09 21:06:03,306 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-09 21:06:03,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1132 conditions, 1119 events. 21/1119 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1893 event pairs, 0 based on Foata normal form. 0/1016 useless extension candidates. Maximal degree in co-relation 973. Up to 4 conditions per place. [2025-01-09 21:06:03,312 INFO L82 GeneralOperation]: Start removeDead. Operand has 1080 places, 1094 transitions, 2206 flow [2025-01-09 21:06:03,325 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1080 places, 1094 transitions, 2206 flow [2025-01-09 21:06:03,326 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:06:03,329 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;@1c0e81c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:06:03,329 INFO L334 AbstractCegarLoop]: Starting to check reachability of 105 error locations. [2025-01-09 21:06:03,376 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:06:03,376 INFO L124 PetriNetUnfolderBase]: 0/671 cut-off events. [2025-01-09 21:06:03,376 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:06:03,376 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:06:03,376 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:06:03,377 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2025-01-09 21:06:03,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:06:03,378 INFO L85 PathProgramCache]: Analyzing trace with hash 147721426, now seen corresponding path program 1 times [2025-01-09 21:06:03,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:06:03,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094695616] [2025-01-09 21:06:03,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:06:03,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:06:03,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 667 statements into 1 equivalence classes. [2025-01-09 21:06:03,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 667 of 667 statements. [2025-01-09 21:06:03,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:06:03,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:06:04,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:06:04,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:06:04,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094695616] [2025-01-09 21:06:04,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094695616] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:06:04,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:06:04,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-09 21:06:04,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273623528] [2025-01-09 21:06:04,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:06:04,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 21:06:04,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:06:04,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 21:06:04,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 21:06:04,440 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1012 out of 1094 [2025-01-09 21:06:04,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1080 places, 1094 transitions, 2206 flow. Second operand has 2 states, 2 states have (on average 1013.0) internal successors, (2026), 2 states have internal predecessors, (2026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:06:04,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:06:04,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1012 of 1094 [2025-01-09 21:06:04,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:06:07,326 INFO L124 PetriNetUnfolderBase]: 1850/13708 cut-off events. [2025-01-09 21:06:07,327 INFO L125 PetriNetUnfolderBase]: For 391/391 co-relation queries the response was YES. [2025-01-09 21:06:07,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16181 conditions, 13708 events. 1850/13708 cut-off events. For 391/391 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 148883 event pairs, 962 based on Foata normal form. 956/13094 useless extension candidates. Maximal degree in co-relation 13610. Up to 2202 conditions per place. [2025-01-09 21:06:07,441 INFO L140 encePairwiseOnDemand]: 1039/1094 looper letters, 27 selfloop transitions, 0 changer transitions 0/1027 dead transitions. [2025-01-09 21:06:07,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1020 places, 1027 transitions, 2126 flow [2025-01-09 21:06:07,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 21:06:07,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-09 21:06:07,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2106 transitions. [2025-01-09 21:06:07,445 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9625228519195612 [2025-01-09 21:06:07,445 INFO L175 Difference]: Start difference. First operand has 1080 places, 1094 transitions, 2206 flow. Second operand 2 states and 2106 transitions. [2025-01-09 21:06:07,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1020 places, 1027 transitions, 2126 flow [2025-01-09 21:06:07,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1020 places, 1027 transitions, 2124 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-01-09 21:06:07,456 INFO L231 Difference]: Finished difference. Result has 1020 places, 1027 transitions, 2070 flow [2025-01-09 21:06:07,457 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1094, PETRI_DIFFERENCE_MINUEND_FLOW=2070, PETRI_DIFFERENCE_MINUEND_PLACES=1019, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1027, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1027, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=2070, PETRI_PLACES=1020, PETRI_TRANSITIONS=1027} [2025-01-09 21:06:07,458 INFO L279 CegarLoopForPetriNet]: 1080 programPoint places, -60 predicate places. [2025-01-09 21:06:07,458 INFO L471 AbstractCegarLoop]: Abstraction has has 1020 places, 1027 transitions, 2070 flow [2025-01-09 21:06:07,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 1013.0) internal successors, (2026), 2 states have internal predecessors, (2026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:06:07,459 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:06:07,459 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:06:07,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:06:07,459 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2025-01-09 21:06:07,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:06:07,461 INFO L85 PathProgramCache]: Analyzing trace with hash 226511253, now seen corresponding path program 1 times [2025-01-09 21:06:07,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:06:07,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55861875] [2025-01-09 21:06:07,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:06:07,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:06:07,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 669 statements into 1 equivalence classes. [2025-01-09 21:06:07,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 669 of 669 statements. [2025-01-09 21:06:07,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:06:07,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:06:07,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:06:07,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:06:07,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55861875] [2025-01-09 21:06:07,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55861875] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:06:07,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:06:07,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:06:07,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338483486] [2025-01-09 21:06:07,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:06:07,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:06:07,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:06:07,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:06:07,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:06:07,824 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1000 out of 1094 [2025-01-09 21:06:07,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1020 places, 1027 transitions, 2070 flow. Second operand has 3 states, 3 states have (on average 1001.3333333333334) internal successors, (3004), 3 states have internal predecessors, (3004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:06:07,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:06:07,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1000 of 1094 [2025-01-09 21:06:07,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:06:20,576 INFO L124 PetriNetUnfolderBase]: 9817/60210 cut-off events. [2025-01-09 21:06:20,576 INFO L125 PetriNetUnfolderBase]: For 718/718 co-relation queries the response was YES. [2025-01-09 21:06:20,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73417 conditions, 60210 events. 9817/60210 cut-off events. For 718/718 co-relation queries the response was YES. Maximal size of possible extension queue 1024. Compared 887451 event pairs, 2763 based on Foata normal form. 0/52782 useless extension candidates. Maximal degree in co-relation 73411. Up to 6318 conditions per place. [2025-01-09 21:06:21,095 INFO L140 encePairwiseOnDemand]: 1082/1094 looper letters, 65 selfloop transitions, 9 changer transitions 0/1062 dead transitions. [2025-01-09 21:06:21,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1022 places, 1062 transitions, 2298 flow [2025-01-09 21:06:21,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:06:21,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:06:21,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3077 transitions. [2025-01-09 21:06:21,103 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9375380865326021 [2025-01-09 21:06:21,103 INFO L175 Difference]: Start difference. First operand has 1020 places, 1027 transitions, 2070 flow. Second operand 3 states and 3077 transitions. [2025-01-09 21:06:21,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1022 places, 1062 transitions, 2298 flow [2025-01-09 21:06:21,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1022 places, 1062 transitions, 2298 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:06:21,117 INFO L231 Difference]: Finished difference. Result has 1024 places, 1036 transitions, 2148 flow [2025-01-09 21:06:21,118 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1094, PETRI_DIFFERENCE_MINUEND_FLOW=2070, PETRI_DIFFERENCE_MINUEND_PLACES=1020, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1027, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1018, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2148, PETRI_PLACES=1024, PETRI_TRANSITIONS=1036} [2025-01-09 21:06:21,120 INFO L279 CegarLoopForPetriNet]: 1080 programPoint places, -56 predicate places. [2025-01-09 21:06:21,121 INFO L471 AbstractCegarLoop]: Abstraction has has 1024 places, 1036 transitions, 2148 flow [2025-01-09 21:06:21,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1001.3333333333334) internal successors, (3004), 3 states have internal predecessors, (3004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:06:21,122 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:06:21,123 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:06:21,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:06:21,123 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 101 more)] === [2025-01-09 21:06:21,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:06:21,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1046166236, now seen corresponding path program 1 times [2025-01-09 21:06:21,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:06:21,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117080954] [2025-01-09 21:06:21,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:06:21,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:06:21,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 679 statements into 1 equivalence classes. [2025-01-09 21:06:21,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 679 of 679 statements. [2025-01-09 21:06:21,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:06:21,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:06:22,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:06:22,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:06:22,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117080954] [2025-01-09 21:06:22,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117080954] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:06:22,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:06:22,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:06:22,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54336121] [2025-01-09 21:06:22,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:06:22,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:06:22,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:06:22,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:06:22,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:06:23,024 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 979 out of 1094 [2025-01-09 21:06:23,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1024 places, 1036 transitions, 2148 flow. Second operand has 6 states, 6 states have (on average 980.6666666666666) internal successors, (5884), 6 states have internal predecessors, (5884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:06:23,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:06:23,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 979 of 1094 [2025-01-09 21:06:23,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:06:27,033 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4240] L784-->L784-3: Formula: (let ((.cse4 (select |v_#race_845| |v_~#m2~0.base_31|)) (.cse3 (+ |v_~#m2~0.offset_31| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_31| 2)) (.cse5 (select |v_#memory_int_499| |v_~#m2~0.base_31|)) (.cse0 (select .cse4 .cse3)) (.cse1 (+ |v_~#m2~0.offset_31| 1))) (and (= (store |v_#race_847| |v_~#m2~0.base_31| (store (store (store (store (select |v_#race_847| |v_~#m2~0.base_31|) |v_~#m2~0.offset_31| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0)) |v_#race_845|) (= (select .cse4 .cse2) .cse0) (not (= 0 (ite (= (select .cse5 |v_~#m2~0.offset_31|) 1) 1 0))) (= (select .cse4 |v_~#m2~0.offset_31|) .cse0) (= (store |v_#memory_int_499| |v_~#m2~0.base_31| (store .cse5 |v_~#m2~0.offset_31| 0)) |v_#memory_int_498|) (= .cse0 (select .cse4 .cse1))))) InVars {#race=|v_#race_847|, #memory_int=|v_#memory_int_499|, ~#m2~0.base=|v_~#m2~0.base_31|, ~#m2~0.offset=|v_~#m2~0.offset_31|} OutVars{#race=|v_#race_845|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_498|, ~#m2~0.base=|v_~#m2~0.base_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][838], [Black: 1085#true, 406#L784-3true, 609#L734-7true, 1083#true, 1090#true, 1079#true, 1087#(= |#race~state~0| 0), 1077#true, 95#L784-3true, 883#L793-4true, 1081#true]) [2025-01-09 21:06:27,033 INFO L294 olderBase$Statistics]: this new event has 723 ancestors and is cut-off event [2025-01-09 21:06:27,033 INFO L297 olderBase$Statistics]: existing Event has 709 ancestors and is cut-off event [2025-01-09 21:06:27,033 INFO L297 olderBase$Statistics]: existing Event has 723 ancestors and is cut-off event [2025-01-09 21:06:27,033 INFO L297 olderBase$Statistics]: existing Event has 709 ancestors and is cut-off event [2025-01-09 21:06:27,212 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4240] L784-->L784-3: Formula: (let ((.cse4 (select |v_#race_845| |v_~#m2~0.base_31|)) (.cse3 (+ |v_~#m2~0.offset_31| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_31| 2)) (.cse5 (select |v_#memory_int_499| |v_~#m2~0.base_31|)) (.cse0 (select .cse4 .cse3)) (.cse1 (+ |v_~#m2~0.offset_31| 1))) (and (= (store |v_#race_847| |v_~#m2~0.base_31| (store (store (store (store (select |v_#race_847| |v_~#m2~0.base_31|) |v_~#m2~0.offset_31| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0)) |v_#race_845|) (= (select .cse4 .cse2) .cse0) (not (= 0 (ite (= (select .cse5 |v_~#m2~0.offset_31|) 1) 1 0))) (= (select .cse4 |v_~#m2~0.offset_31|) .cse0) (= (store |v_#memory_int_499| |v_~#m2~0.base_31| (store .cse5 |v_~#m2~0.offset_31| 0)) |v_#memory_int_498|) (= .cse0 (select .cse4 .cse1))))) InVars {#race=|v_#race_847|, #memory_int=|v_#memory_int_499|, ~#m2~0.base=|v_~#m2~0.base_31|, ~#m2~0.offset=|v_~#m2~0.offset_31|} OutVars{#race=|v_#race_845|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_498|, ~#m2~0.base=|v_~#m2~0.base_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [Black: 1085#true, 406#L784-3true, 1083#true, 867#L733true, 1090#true, 1079#true, 1087#(= |#race~state~0| 0), 1077#true, 95#L784-3true, 883#L793-4true, 1081#true]) [2025-01-09 21:06:27,212 INFO L294 olderBase$Statistics]: this new event has 724 ancestors and is cut-off event [2025-01-09 21:06:27,212 INFO L297 olderBase$Statistics]: existing Event has 710 ancestors and is cut-off event [2025-01-09 21:06:27,212 INFO L297 olderBase$Statistics]: existing Event has 710 ancestors and is cut-off event [2025-01-09 21:06:27,212 INFO L297 olderBase$Statistics]: existing Event has 724 ancestors and is cut-off event [2025-01-09 21:06:27,387 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4240] L784-->L784-3: Formula: (let ((.cse4 (select |v_#race_845| |v_~#m2~0.base_31|)) (.cse3 (+ |v_~#m2~0.offset_31| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_31| 2)) (.cse5 (select |v_#memory_int_499| |v_~#m2~0.base_31|)) (.cse0 (select .cse4 .cse3)) (.cse1 (+ |v_~#m2~0.offset_31| 1))) (and (= (store |v_#race_847| |v_~#m2~0.base_31| (store (store (store (store (select |v_#race_847| |v_~#m2~0.base_31|) |v_~#m2~0.offset_31| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0)) |v_#race_845|) (= (select .cse4 .cse2) .cse0) (not (= 0 (ite (= (select .cse5 |v_~#m2~0.offset_31|) 1) 1 0))) (= (select .cse4 |v_~#m2~0.offset_31|) .cse0) (= (store |v_#memory_int_499| |v_~#m2~0.base_31| (store .cse5 |v_~#m2~0.offset_31| 0)) |v_#memory_int_498|) (= .cse0 (select .cse4 .cse1))))) InVars {#race=|v_#race_847|, #memory_int=|v_#memory_int_499|, ~#m2~0.base=|v_~#m2~0.base_31|, ~#m2~0.offset=|v_~#m2~0.offset_31|} OutVars{#race=|v_#race_845|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_498|, ~#m2~0.base=|v_~#m2~0.base_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [Black: 1085#true, 72#L782true, 406#L784-3true, 1083#true, 1090#true, 1079#true, 1087#(= |#race~state~0| 0), 1077#true, 95#L784-3true, 883#L793-4true, 1081#true]) [2025-01-09 21:06:27,387 INFO L294 olderBase$Statistics]: this new event has 725 ancestors and is cut-off event [2025-01-09 21:06:27,387 INFO L297 olderBase$Statistics]: existing Event has 725 ancestors and is cut-off event [2025-01-09 21:06:27,388 INFO L297 olderBase$Statistics]: existing Event has 711 ancestors and is cut-off event [2025-01-09 21:06:27,388 INFO L297 olderBase$Statistics]: existing Event has 711 ancestors and is cut-off event [2025-01-09 21:06:28,741 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4240] L784-->L784-3: Formula: (let ((.cse4 (select |v_#race_845| |v_~#m2~0.base_31|)) (.cse3 (+ |v_~#m2~0.offset_31| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_31| 2)) (.cse5 (select |v_#memory_int_499| |v_~#m2~0.base_31|)) (.cse0 (select .cse4 .cse3)) (.cse1 (+ |v_~#m2~0.offset_31| 1))) (and (= (store |v_#race_847| |v_~#m2~0.base_31| (store (store (store (store (select |v_#race_847| |v_~#m2~0.base_31|) |v_~#m2~0.offset_31| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0)) |v_#race_845|) (= (select .cse4 .cse2) .cse0) (not (= 0 (ite (= (select .cse5 |v_~#m2~0.offset_31|) 1) 1 0))) (= (select .cse4 |v_~#m2~0.offset_31|) .cse0) (= (store |v_#memory_int_499| |v_~#m2~0.base_31| (store .cse5 |v_~#m2~0.offset_31| 0)) |v_#memory_int_498|) (= .cse0 (select .cse4 .cse1))))) InVars {#race=|v_#race_847|, #memory_int=|v_#memory_int_499|, ~#m2~0.base=|v_~#m2~0.base_31|, ~#m2~0.offset=|v_~#m2~0.offset_31|} OutVars{#race=|v_#race_845|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_498|, ~#m2~0.base=|v_~#m2~0.base_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [Black: 1085#true, 1083#true, 1090#true, 1079#true, 1087#(= |#race~state~0| 0), 1077#true, 605#L782-3true, 95#L784-3true, 883#L793-4true, 1081#true, 564#L734-4true]) [2025-01-09 21:06:28,741 INFO L294 olderBase$Statistics]: this new event has 730 ancestors and is cut-off event [2025-01-09 21:06:28,741 INFO L297 olderBase$Statistics]: existing Event has 716 ancestors and is cut-off event [2025-01-09 21:06:28,741 INFO L297 olderBase$Statistics]: existing Event has 716 ancestors and is cut-off event [2025-01-09 21:06:28,741 INFO L297 olderBase$Statistics]: existing Event has 716 ancestors and is cut-off event [2025-01-09 21:06:29,077 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4240] L784-->L784-3: Formula: (let ((.cse4 (select |v_#race_845| |v_~#m2~0.base_31|)) (.cse3 (+ |v_~#m2~0.offset_31| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_31| 2)) (.cse5 (select |v_#memory_int_499| |v_~#m2~0.base_31|)) (.cse0 (select .cse4 .cse3)) (.cse1 (+ |v_~#m2~0.offset_31| 1))) (and (= (store |v_#race_847| |v_~#m2~0.base_31| (store (store (store (store (select |v_#race_847| |v_~#m2~0.base_31|) |v_~#m2~0.offset_31| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0)) |v_#race_845|) (= (select .cse4 .cse2) .cse0) (not (= 0 (ite (= (select .cse5 |v_~#m2~0.offset_31|) 1) 1 0))) (= (select .cse4 |v_~#m2~0.offset_31|) .cse0) (= (store |v_#memory_int_499| |v_~#m2~0.base_31| (store .cse5 |v_~#m2~0.offset_31| 0)) |v_#memory_int_498|) (= .cse0 (select .cse4 .cse1))))) InVars {#race=|v_#race_847|, #memory_int=|v_#memory_int_499|, ~#m2~0.base=|v_~#m2~0.base_31|, ~#m2~0.offset=|v_~#m2~0.offset_31|} OutVars{#race=|v_#race_845|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_498|, ~#m2~0.base=|v_~#m2~0.base_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [Black: 1085#true, 51#L734-5true, 1083#true, 1090#true, 1079#true, 1087#(= |#race~state~0| 0), 1077#true, 605#L782-3true, 95#L784-3true, 883#L793-4true, 1081#true]) [2025-01-09 21:06:29,077 INFO L294 olderBase$Statistics]: this new event has 731 ancestors and is cut-off event [2025-01-09 21:06:29,077 INFO L297 olderBase$Statistics]: existing Event has 717 ancestors and is cut-off event [2025-01-09 21:06:29,078 INFO L297 olderBase$Statistics]: existing Event has 717 ancestors and is cut-off event [2025-01-09 21:06:29,078 INFO L297 olderBase$Statistics]: existing Event has 717 ancestors and is cut-off event [2025-01-09 21:06:29,472 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4240] L784-->L784-3: Formula: (let ((.cse4 (select |v_#race_845| |v_~#m2~0.base_31|)) (.cse3 (+ |v_~#m2~0.offset_31| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_31| 2)) (.cse5 (select |v_#memory_int_499| |v_~#m2~0.base_31|)) (.cse0 (select .cse4 .cse3)) (.cse1 (+ |v_~#m2~0.offset_31| 1))) (and (= (store |v_#race_847| |v_~#m2~0.base_31| (store (store (store (store (select |v_#race_847| |v_~#m2~0.base_31|) |v_~#m2~0.offset_31| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0)) |v_#race_845|) (= (select .cse4 .cse2) .cse0) (not (= 0 (ite (= (select .cse5 |v_~#m2~0.offset_31|) 1) 1 0))) (= (select .cse4 |v_~#m2~0.offset_31|) .cse0) (= (store |v_#memory_int_499| |v_~#m2~0.base_31| (store .cse5 |v_~#m2~0.offset_31| 0)) |v_#memory_int_498|) (= .cse0 (select .cse4 .cse1))))) InVars {#race=|v_#race_847|, #memory_int=|v_#memory_int_499|, ~#m2~0.base=|v_~#m2~0.base_31|, ~#m2~0.offset=|v_~#m2~0.offset_31|} OutVars{#race=|v_#race_845|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_498|, ~#m2~0.base=|v_~#m2~0.base_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [Black: 1085#true, 1083#true, 1090#true, 1079#true, 1087#(= |#race~state~0| 0), 1077#true, 246#L734-6true, 605#L782-3true, 95#L784-3true, 883#L793-4true, 1081#true]) [2025-01-09 21:06:29,472 INFO L294 olderBase$Statistics]: this new event has 732 ancestors and is cut-off event [2025-01-09 21:06:29,480 INFO L297 olderBase$Statistics]: existing Event has 718 ancestors and is cut-off event [2025-01-09 21:06:29,481 INFO L297 olderBase$Statistics]: existing Event has 718 ancestors and is cut-off event [2025-01-09 21:06:29,481 INFO L297 olderBase$Statistics]: existing Event has 718 ancestors and is cut-off event [2025-01-09 21:06:29,798 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4240] L784-->L784-3: Formula: (let ((.cse4 (select |v_#race_845| |v_~#m2~0.base_31|)) (.cse3 (+ |v_~#m2~0.offset_31| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_31| 2)) (.cse5 (select |v_#memory_int_499| |v_~#m2~0.base_31|)) (.cse0 (select .cse4 .cse3)) (.cse1 (+ |v_~#m2~0.offset_31| 1))) (and (= (store |v_#race_847| |v_~#m2~0.base_31| (store (store (store (store (select |v_#race_847| |v_~#m2~0.base_31|) |v_~#m2~0.offset_31| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0)) |v_#race_845|) (= (select .cse4 .cse2) .cse0) (not (= 0 (ite (= (select .cse5 |v_~#m2~0.offset_31|) 1) 1 0))) (= (select .cse4 |v_~#m2~0.offset_31|) .cse0) (= (store |v_#memory_int_499| |v_~#m2~0.base_31| (store .cse5 |v_~#m2~0.offset_31| 0)) |v_#memory_int_498|) (= .cse0 (select .cse4 .cse1))))) InVars {#race=|v_#race_847|, #memory_int=|v_#memory_int_499|, ~#m2~0.base=|v_~#m2~0.base_31|, ~#m2~0.offset=|v_~#m2~0.offset_31|} OutVars{#race=|v_#race_845|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_498|, ~#m2~0.base=|v_~#m2~0.base_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [Black: 1085#true, 268#L734-7true, 1083#true, 1090#true, 1079#true, 1087#(= |#race~state~0| 0), 1077#true, 605#L782-3true, 95#L784-3true, 883#L793-4true, 1081#true]) [2025-01-09 21:06:29,799 INFO L294 olderBase$Statistics]: this new event has 733 ancestors and is cut-off event [2025-01-09 21:06:29,799 INFO L297 olderBase$Statistics]: existing Event has 719 ancestors and is cut-off event [2025-01-09 21:06:29,799 INFO L297 olderBase$Statistics]: existing Event has 719 ancestors and is cut-off event [2025-01-09 21:06:29,799 INFO L297 olderBase$Statistics]: existing Event has 719 ancestors and is cut-off event [2025-01-09 21:06:31,069 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4240] L784-->L784-3: Formula: (let ((.cse4 (select |v_#race_845| |v_~#m2~0.base_31|)) (.cse3 (+ |v_~#m2~0.offset_31| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_31| 2)) (.cse5 (select |v_#memory_int_499| |v_~#m2~0.base_31|)) (.cse0 (select .cse4 .cse3)) (.cse1 (+ |v_~#m2~0.offset_31| 1))) (and (= (store |v_#race_847| |v_~#m2~0.base_31| (store (store (store (store (select |v_#race_847| |v_~#m2~0.base_31|) |v_~#m2~0.offset_31| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0)) |v_#race_845|) (= (select .cse4 .cse2) .cse0) (not (= 0 (ite (= (select .cse5 |v_~#m2~0.offset_31|) 1) 1 0))) (= (select .cse4 |v_~#m2~0.offset_31|) .cse0) (= (store |v_#memory_int_499| |v_~#m2~0.base_31| (store .cse5 |v_~#m2~0.offset_31| 0)) |v_#memory_int_498|) (= .cse0 (select .cse4 .cse1))))) InVars {#race=|v_#race_847|, #memory_int=|v_#memory_int_499|, ~#m2~0.base=|v_~#m2~0.base_31|, ~#m2~0.offset=|v_~#m2~0.offset_31|} OutVars{#race=|v_#race_845|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_498|, ~#m2~0.base=|v_~#m2~0.base_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [57#L734-3true, Black: 1085#true, 461#L722-3true, 1083#true, 1090#true, 1079#true, 1087#(= |#race~state~0| 0), 1077#true, 95#L784-3true, 883#L793-4true, 1081#true]) [2025-01-09 21:06:31,069 INFO L294 olderBase$Statistics]: this new event has 737 ancestors and is cut-off event [2025-01-09 21:06:31,069 INFO L297 olderBase$Statistics]: existing Event has 723 ancestors and is cut-off event [2025-01-09 21:06:31,069 INFO L297 olderBase$Statistics]: existing Event has 737 ancestors and is cut-off event [2025-01-09 21:06:31,069 INFO L297 olderBase$Statistics]: existing Event has 723 ancestors and is cut-off event [2025-01-09 21:06:31,536 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4240] L784-->L784-3: Formula: (let ((.cse4 (select |v_#race_845| |v_~#m2~0.base_31|)) (.cse3 (+ |v_~#m2~0.offset_31| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_31| 2)) (.cse5 (select |v_#memory_int_499| |v_~#m2~0.base_31|)) (.cse0 (select .cse4 .cse3)) (.cse1 (+ |v_~#m2~0.offset_31| 1))) (and (= (store |v_#race_847| |v_~#m2~0.base_31| (store (store (store (store (select |v_#race_847| |v_~#m2~0.base_31|) |v_~#m2~0.offset_31| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0)) |v_#race_845|) (= (select .cse4 .cse2) .cse0) (not (= 0 (ite (= (select .cse5 |v_~#m2~0.offset_31|) 1) 1 0))) (= (select .cse4 |v_~#m2~0.offset_31|) .cse0) (= (store |v_#memory_int_499| |v_~#m2~0.base_31| (store .cse5 |v_~#m2~0.offset_31| 0)) |v_#memory_int_498|) (= .cse0 (select .cse4 .cse1))))) InVars {#race=|v_#race_847|, #memory_int=|v_#memory_int_499|, ~#m2~0.base=|v_~#m2~0.base_31|, ~#m2~0.offset=|v_~#m2~0.offset_31|} OutVars{#race=|v_#race_845|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_498|, ~#m2~0.base=|v_~#m2~0.base_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [Black: 1085#true, 461#L722-3true, 1083#true, 1090#true, 1079#true, 123#L734-4true, 1087#(= |#race~state~0| 0), 1077#true, 95#L784-3true, 883#L793-4true, 1081#true]) [2025-01-09 21:06:31,537 INFO L294 olderBase$Statistics]: this new event has 738 ancestors and is cut-off event [2025-01-09 21:06:31,537 INFO L297 olderBase$Statistics]: existing Event has 724 ancestors and is cut-off event [2025-01-09 21:06:31,537 INFO L297 olderBase$Statistics]: existing Event has 724 ancestors and is cut-off event [2025-01-09 21:06:31,537 INFO L297 olderBase$Statistics]: existing Event has 738 ancestors and is cut-off event [2025-01-09 21:06:31,846 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4240] L784-->L784-3: Formula: (let ((.cse4 (select |v_#race_845| |v_~#m2~0.base_31|)) (.cse3 (+ |v_~#m2~0.offset_31| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_31| 2)) (.cse5 (select |v_#memory_int_499| |v_~#m2~0.base_31|)) (.cse0 (select .cse4 .cse3)) (.cse1 (+ |v_~#m2~0.offset_31| 1))) (and (= (store |v_#race_847| |v_~#m2~0.base_31| (store (store (store (store (select |v_#race_847| |v_~#m2~0.base_31|) |v_~#m2~0.offset_31| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0)) |v_#race_845|) (= (select .cse4 .cse2) .cse0) (not (= 0 (ite (= (select .cse5 |v_~#m2~0.offset_31|) 1) 1 0))) (= (select .cse4 |v_~#m2~0.offset_31|) .cse0) (= (store |v_#memory_int_499| |v_~#m2~0.base_31| (store .cse5 |v_~#m2~0.offset_31| 0)) |v_#memory_int_498|) (= .cse0 (select .cse4 .cse1))))) InVars {#race=|v_#race_847|, #memory_int=|v_#memory_int_499|, ~#m2~0.base=|v_~#m2~0.base_31|, ~#m2~0.offset=|v_~#m2~0.offset_31|} OutVars{#race=|v_#race_845|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_498|, ~#m2~0.base=|v_~#m2~0.base_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [Black: 1085#true, 701#L734-5true, 461#L722-3true, 1083#true, 1090#true, 1079#true, 1087#(= |#race~state~0| 0), 1077#true, 95#L784-3true, 883#L793-4true, 1081#true]) [2025-01-09 21:06:31,846 INFO L294 olderBase$Statistics]: this new event has 739 ancestors and is cut-off event [2025-01-09 21:06:31,846 INFO L297 olderBase$Statistics]: existing Event has 739 ancestors and is cut-off event [2025-01-09 21:06:31,846 INFO L297 olderBase$Statistics]: existing Event has 725 ancestors and is cut-off event [2025-01-09 21:06:31,846 INFO L297 olderBase$Statistics]: existing Event has 725 ancestors and is cut-off event [2025-01-09 21:06:32,167 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4240] L784-->L784-3: Formula: (let ((.cse4 (select |v_#race_845| |v_~#m2~0.base_31|)) (.cse3 (+ |v_~#m2~0.offset_31| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_31| 2)) (.cse5 (select |v_#memory_int_499| |v_~#m2~0.base_31|)) (.cse0 (select .cse4 .cse3)) (.cse1 (+ |v_~#m2~0.offset_31| 1))) (and (= (store |v_#race_847| |v_~#m2~0.base_31| (store (store (store (store (select |v_#race_847| |v_~#m2~0.base_31|) |v_~#m2~0.offset_31| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0)) |v_#race_845|) (= (select .cse4 .cse2) .cse0) (not (= 0 (ite (= (select .cse5 |v_~#m2~0.offset_31|) 1) 1 0))) (= (select .cse4 |v_~#m2~0.offset_31|) .cse0) (= (store |v_#memory_int_499| |v_~#m2~0.base_31| (store .cse5 |v_~#m2~0.offset_31| 0)) |v_#memory_int_498|) (= .cse0 (select .cse4 .cse1))))) InVars {#race=|v_#race_847|, #memory_int=|v_#memory_int_499|, ~#m2~0.base=|v_~#m2~0.base_31|, ~#m2~0.offset=|v_~#m2~0.offset_31|} OutVars{#race=|v_#race_845|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_498|, ~#m2~0.base=|v_~#m2~0.base_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [Black: 1085#true, 461#L722-3true, 513#L734-6true, 1083#true, 1090#true, 1079#true, 1087#(= |#race~state~0| 0), 1077#true, 95#L784-3true, 883#L793-4true, 1081#true]) [2025-01-09 21:06:32,167 INFO L294 olderBase$Statistics]: this new event has 740 ancestors and is cut-off event [2025-01-09 21:06:32,168 INFO L297 olderBase$Statistics]: existing Event has 726 ancestors and is cut-off event [2025-01-09 21:06:32,168 INFO L297 olderBase$Statistics]: existing Event has 726 ancestors and is cut-off event [2025-01-09 21:06:32,168 INFO L297 olderBase$Statistics]: existing Event has 740 ancestors and is cut-off event [2025-01-09 21:06:32,457 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4240] L784-->L784-3: Formula: (let ((.cse4 (select |v_#race_845| |v_~#m2~0.base_31|)) (.cse3 (+ |v_~#m2~0.offset_31| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_31| 2)) (.cse5 (select |v_#memory_int_499| |v_~#m2~0.base_31|)) (.cse0 (select .cse4 .cse3)) (.cse1 (+ |v_~#m2~0.offset_31| 1))) (and (= (store |v_#race_847| |v_~#m2~0.base_31| (store (store (store (store (select |v_#race_847| |v_~#m2~0.base_31|) |v_~#m2~0.offset_31| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0)) |v_#race_845|) (= (select .cse4 .cse2) .cse0) (not (= 0 (ite (= (select .cse5 |v_~#m2~0.offset_31|) 1) 1 0))) (= (select .cse4 |v_~#m2~0.offset_31|) .cse0) (= (store |v_#memory_int_499| |v_~#m2~0.base_31| (store .cse5 |v_~#m2~0.offset_31| 0)) |v_#memory_int_498|) (= .cse0 (select .cse4 .cse1))))) InVars {#race=|v_#race_847|, #memory_int=|v_#memory_int_499|, ~#m2~0.base=|v_~#m2~0.base_31|, ~#m2~0.offset=|v_~#m2~0.offset_31|} OutVars{#race=|v_#race_845|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_498|, ~#m2~0.base=|v_~#m2~0.base_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][838], [Black: 1085#true, 461#L722-3true, 609#L734-7true, 1083#true, 1090#true, 1079#true, 1087#(= |#race~state~0| 0), 1077#true, 95#L784-3true, 883#L793-4true, 1081#true]) [2025-01-09 21:06:32,457 INFO L294 olderBase$Statistics]: this new event has 741 ancestors and is cut-off event [2025-01-09 21:06:32,457 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-01-09 21:06:32,457 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-01-09 21:06:32,457 INFO L297 olderBase$Statistics]: existing Event has 741 ancestors and is cut-off event [2025-01-09 21:06:32,461 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4240] L784-->L784-3: Formula: (let ((.cse4 (select |v_#race_845| |v_~#m2~0.base_31|)) (.cse3 (+ |v_~#m2~0.offset_31| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_31| 2)) (.cse5 (select |v_#memory_int_499| |v_~#m2~0.base_31|)) (.cse0 (select .cse4 .cse3)) (.cse1 (+ |v_~#m2~0.offset_31| 1))) (and (= (store |v_#race_847| |v_~#m2~0.base_31| (store (store (store (store (select |v_#race_847| |v_~#m2~0.base_31|) |v_~#m2~0.offset_31| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0)) |v_#race_845|) (= (select .cse4 .cse2) .cse0) (not (= 0 (ite (= (select .cse5 |v_~#m2~0.offset_31|) 1) 1 0))) (= (select .cse4 |v_~#m2~0.offset_31|) .cse0) (= (store |v_#memory_int_499| |v_~#m2~0.base_31| (store .cse5 |v_~#m2~0.offset_31| 0)) |v_#memory_int_498|) (= .cse0 (select .cse4 .cse1))))) InVars {#race=|v_#race_847|, #memory_int=|v_#memory_int_499|, ~#m2~0.base=|v_~#m2~0.base_31|, ~#m2~0.offset=|v_~#m2~0.offset_31|} OutVars{#race=|v_#race_845|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_498|, ~#m2~0.base=|v_~#m2~0.base_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [Black: 1085#true, 461#L722-3true, 609#L734-7true, 1083#true, 1090#true, 1079#true, 1087#(= |#race~state~0| 0), 1077#true, 95#L784-3true, 883#L793-4true, 1081#true]) [2025-01-09 21:06:32,461 INFO L294 olderBase$Statistics]: this new event has 741 ancestors and is cut-off event [2025-01-09 21:06:32,462 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-01-09 21:06:32,462 INFO L297 olderBase$Statistics]: existing Event has 741 ancestors and is cut-off event [2025-01-09 21:06:32,462 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-01-09 21:06:32,462 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4240] L784-->L784-3: Formula: (let ((.cse4 (select |v_#race_845| |v_~#m2~0.base_31|)) (.cse3 (+ |v_~#m2~0.offset_31| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_31| 2)) (.cse5 (select |v_#memory_int_499| |v_~#m2~0.base_31|)) (.cse0 (select .cse4 .cse3)) (.cse1 (+ |v_~#m2~0.offset_31| 1))) (and (= (store |v_#race_847| |v_~#m2~0.base_31| (store (store (store (store (select |v_#race_847| |v_~#m2~0.base_31|) |v_~#m2~0.offset_31| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0)) |v_#race_845|) (= (select .cse4 .cse2) .cse0) (not (= 0 (ite (= (select .cse5 |v_~#m2~0.offset_31|) 1) 1 0))) (= (select .cse4 |v_~#m2~0.offset_31|) .cse0) (= (store |v_#memory_int_499| |v_~#m2~0.base_31| (store .cse5 |v_~#m2~0.offset_31| 0)) |v_#memory_int_498|) (= .cse0 (select .cse4 .cse1))))) InVars {#race=|v_#race_847|, #memory_int=|v_#memory_int_499|, ~#m2~0.base=|v_~#m2~0.base_31|, ~#m2~0.offset=|v_~#m2~0.offset_31|} OutVars{#race=|v_#race_845|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_498|, ~#m2~0.base=|v_~#m2~0.base_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [Black: 1085#true, 461#L722-3true, 1083#true, 568#thr1Err3ASSERT_VIOLATIONDATA_RACEtrue, 1090#true, 1079#true, 1087#(= |#race~state~0| 0), 1077#true, 95#L784-3true, 883#L793-4true, 1081#true]) [2025-01-09 21:06:32,462 INFO L294 olderBase$Statistics]: this new event has 741 ancestors and is cut-off event [2025-01-09 21:06:32,462 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-01-09 21:06:32,462 INFO L297 olderBase$Statistics]: existing Event has 741 ancestors and is cut-off event [2025-01-09 21:06:32,462 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-01-09 21:06:32,466 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4240] L784-->L784-3: Formula: (let ((.cse4 (select |v_#race_845| |v_~#m2~0.base_31|)) (.cse3 (+ |v_~#m2~0.offset_31| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_31| 2)) (.cse5 (select |v_#memory_int_499| |v_~#m2~0.base_31|)) (.cse0 (select .cse4 .cse3)) (.cse1 (+ |v_~#m2~0.offset_31| 1))) (and (= (store |v_#race_847| |v_~#m2~0.base_31| (store (store (store (store (select |v_#race_847| |v_~#m2~0.base_31|) |v_~#m2~0.offset_31| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0)) |v_#race_845|) (= (select .cse4 .cse2) .cse0) (not (= 0 (ite (= (select .cse5 |v_~#m2~0.offset_31|) 1) 1 0))) (= (select .cse4 |v_~#m2~0.offset_31|) .cse0) (= (store |v_#memory_int_499| |v_~#m2~0.base_31| (store .cse5 |v_~#m2~0.offset_31| 0)) |v_#memory_int_498|) (= .cse0 (select .cse4 .cse1))))) InVars {#race=|v_#race_847|, #memory_int=|v_#memory_int_499|, ~#m2~0.base=|v_~#m2~0.base_31|, ~#m2~0.offset=|v_~#m2~0.offset_31|} OutVars{#race=|v_#race_845|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_498|, ~#m2~0.base=|v_~#m2~0.base_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [57#L734-3true, Black: 1085#true, 1083#true, 1090#true, 1079#true, 1087#(= |#race~state~0| 0), 1077#true, 624#L724-3true, 95#L784-3true, 883#L793-4true, 1081#true]) [2025-01-09 21:06:32,469 INFO L294 olderBase$Statistics]: this new event has 741 ancestors and is cut-off event [2025-01-09 21:06:32,470 INFO L297 olderBase$Statistics]: existing Event has 741 ancestors and is cut-off event [2025-01-09 21:06:32,470 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-01-09 21:06:32,470 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-01-09 21:06:32,939 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4240] L784-->L784-3: Formula: (let ((.cse4 (select |v_#race_845| |v_~#m2~0.base_31|)) (.cse3 (+ |v_~#m2~0.offset_31| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_31| 2)) (.cse5 (select |v_#memory_int_499| |v_~#m2~0.base_31|)) (.cse0 (select .cse4 .cse3)) (.cse1 (+ |v_~#m2~0.offset_31| 1))) (and (= (store |v_#race_847| |v_~#m2~0.base_31| (store (store (store (store (select |v_#race_847| |v_~#m2~0.base_31|) |v_~#m2~0.offset_31| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0)) |v_#race_845|) (= (select .cse4 .cse2) .cse0) (not (= 0 (ite (= (select .cse5 |v_~#m2~0.offset_31|) 1) 1 0))) (= (select .cse4 |v_~#m2~0.offset_31|) .cse0) (= (store |v_#memory_int_499| |v_~#m2~0.base_31| (store .cse5 |v_~#m2~0.offset_31| 0)) |v_#memory_int_498|) (= .cse0 (select .cse4 .cse1))))) InVars {#race=|v_#race_847|, #memory_int=|v_#memory_int_499|, ~#m2~0.base=|v_~#m2~0.base_31|, ~#m2~0.offset=|v_~#m2~0.offset_31|} OutVars{#race=|v_#race_845|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_498|, ~#m2~0.base=|v_~#m2~0.base_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [Black: 1085#true, 461#L722-3true, 1083#true, 867#L733true, 1090#true, 1079#true, 1087#(= |#race~state~0| 0), 1077#true, 95#L784-3true, 883#L793-4true, 1081#true]) [2025-01-09 21:06:32,939 INFO L294 olderBase$Statistics]: this new event has 742 ancestors and is cut-off event [2025-01-09 21:06:32,940 INFO L297 olderBase$Statistics]: existing Event has 728 ancestors and is cut-off event [2025-01-09 21:06:32,940 INFO L297 olderBase$Statistics]: existing Event has 728 ancestors and is cut-off event [2025-01-09 21:06:32,940 INFO L297 olderBase$Statistics]: existing Event has 742 ancestors and is cut-off event [2025-01-09 21:06:32,943 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4240] L784-->L784-3: Formula: (let ((.cse4 (select |v_#race_845| |v_~#m2~0.base_31|)) (.cse3 (+ |v_~#m2~0.offset_31| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_31| 2)) (.cse5 (select |v_#memory_int_499| |v_~#m2~0.base_31|)) (.cse0 (select .cse4 .cse3)) (.cse1 (+ |v_~#m2~0.offset_31| 1))) (and (= (store |v_#race_847| |v_~#m2~0.base_31| (store (store (store (store (select |v_#race_847| |v_~#m2~0.base_31|) |v_~#m2~0.offset_31| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0)) |v_#race_845|) (= (select .cse4 .cse2) .cse0) (not (= 0 (ite (= (select .cse5 |v_~#m2~0.offset_31|) 1) 1 0))) (= (select .cse4 |v_~#m2~0.offset_31|) .cse0) (= (store |v_#memory_int_499| |v_~#m2~0.base_31| (store .cse5 |v_~#m2~0.offset_31| 0)) |v_#memory_int_498|) (= .cse0 (select .cse4 .cse1))))) InVars {#race=|v_#race_847|, #memory_int=|v_#memory_int_499|, ~#m2~0.base=|v_~#m2~0.base_31|, ~#m2~0.offset=|v_~#m2~0.offset_31|} OutVars{#race=|v_#race_845|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_498|, ~#m2~0.base=|v_~#m2~0.base_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [Black: 1085#true, 1083#true, 1090#true, 1079#true, 123#L734-4true, 1087#(= |#race~state~0| 0), 1077#true, 624#L724-3true, 95#L784-3true, 883#L793-4true, 1081#true]) [2025-01-09 21:06:32,943 INFO L294 olderBase$Statistics]: this new event has 742 ancestors and is cut-off event [2025-01-09 21:06:32,943 INFO L297 olderBase$Statistics]: existing Event has 728 ancestors and is cut-off event [2025-01-09 21:06:32,943 INFO L297 olderBase$Statistics]: existing Event has 728 ancestors and is cut-off event [2025-01-09 21:06:32,943 INFO L297 olderBase$Statistics]: existing Event has 742 ancestors and is cut-off event [2025-01-09 21:06:33,255 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4240] L784-->L784-3: Formula: (let ((.cse4 (select |v_#race_845| |v_~#m2~0.base_31|)) (.cse3 (+ |v_~#m2~0.offset_31| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_31| 2)) (.cse5 (select |v_#memory_int_499| |v_~#m2~0.base_31|)) (.cse0 (select .cse4 .cse3)) (.cse1 (+ |v_~#m2~0.offset_31| 1))) (and (= (store |v_#race_847| |v_~#m2~0.base_31| (store (store (store (store (select |v_#race_847| |v_~#m2~0.base_31|) |v_~#m2~0.offset_31| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0)) |v_#race_845|) (= (select .cse4 .cse2) .cse0) (not (= 0 (ite (= (select .cse5 |v_~#m2~0.offset_31|) 1) 1 0))) (= (select .cse4 |v_~#m2~0.offset_31|) .cse0) (= (store |v_#memory_int_499| |v_~#m2~0.base_31| (store .cse5 |v_~#m2~0.offset_31| 0)) |v_#memory_int_498|) (= .cse0 (select .cse4 .cse1))))) InVars {#race=|v_#race_847|, #memory_int=|v_#memory_int_499|, ~#m2~0.base=|v_~#m2~0.base_31|, ~#m2~0.offset=|v_~#m2~0.offset_31|} OutVars{#race=|v_#race_845|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_498|, ~#m2~0.base=|v_~#m2~0.base_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [Black: 1085#true, 72#L782true, 461#L722-3true, 1083#true, 1090#true, 1079#true, 1087#(= |#race~state~0| 0), 1077#true, 95#L784-3true, 883#L793-4true, 1081#true]) [2025-01-09 21:06:33,255 INFO L294 olderBase$Statistics]: this new event has 743 ancestors and is cut-off event [2025-01-09 21:06:33,255 INFO L297 olderBase$Statistics]: existing Event has 729 ancestors and is cut-off event [2025-01-09 21:06:33,255 INFO L297 olderBase$Statistics]: existing Event has 743 ancestors and is cut-off event [2025-01-09 21:06:33,255 INFO L297 olderBase$Statistics]: existing Event has 729 ancestors and is cut-off event [2025-01-09 21:06:33,258 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4240] L784-->L784-3: Formula: (let ((.cse4 (select |v_#race_845| |v_~#m2~0.base_31|)) (.cse3 (+ |v_~#m2~0.offset_31| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_31| 2)) (.cse5 (select |v_#memory_int_499| |v_~#m2~0.base_31|)) (.cse0 (select .cse4 .cse3)) (.cse1 (+ |v_~#m2~0.offset_31| 1))) (and (= (store |v_#race_847| |v_~#m2~0.base_31| (store (store (store (store (select |v_#race_847| |v_~#m2~0.base_31|) |v_~#m2~0.offset_31| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0)) |v_#race_845|) (= (select .cse4 .cse2) .cse0) (not (= 0 (ite (= (select .cse5 |v_~#m2~0.offset_31|) 1) 1 0))) (= (select .cse4 |v_~#m2~0.offset_31|) .cse0) (= (store |v_#memory_int_499| |v_~#m2~0.base_31| (store .cse5 |v_~#m2~0.offset_31| 0)) |v_#memory_int_498|) (= .cse0 (select .cse4 .cse1))))) InVars {#race=|v_#race_847|, #memory_int=|v_#memory_int_499|, ~#m2~0.base=|v_~#m2~0.base_31|, ~#m2~0.offset=|v_~#m2~0.offset_31|} OutVars{#race=|v_#race_845|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_498|, ~#m2~0.base=|v_~#m2~0.base_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [701#L734-5true, Black: 1085#true, 1083#true, 1090#true, 1079#true, 1087#(= |#race~state~0| 0), 1077#true, 624#L724-3true, 95#L784-3true, 883#L793-4true, 1081#true]) [2025-01-09 21:06:33,258 INFO L294 olderBase$Statistics]: this new event has 743 ancestors and is cut-off event [2025-01-09 21:06:33,258 INFO L297 olderBase$Statistics]: existing Event has 743 ancestors and is cut-off event [2025-01-09 21:06:33,258 INFO L297 olderBase$Statistics]: existing Event has 729 ancestors and is cut-off event [2025-01-09 21:06:33,258 INFO L297 olderBase$Statistics]: existing Event has 729 ancestors and is cut-off event [2025-01-09 21:06:33,556 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4240] L784-->L784-3: Formula: (let ((.cse4 (select |v_#race_845| |v_~#m2~0.base_31|)) (.cse3 (+ |v_~#m2~0.offset_31| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_31| 2)) (.cse5 (select |v_#memory_int_499| |v_~#m2~0.base_31|)) (.cse0 (select .cse4 .cse3)) (.cse1 (+ |v_~#m2~0.offset_31| 1))) (and (= (store |v_#race_847| |v_~#m2~0.base_31| (store (store (store (store (select |v_#race_847| |v_~#m2~0.base_31|) |v_~#m2~0.offset_31| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0)) |v_#race_845|) (= (select .cse4 .cse2) .cse0) (not (= 0 (ite (= (select .cse5 |v_~#m2~0.offset_31|) 1) 1 0))) (= (select .cse4 |v_~#m2~0.offset_31|) .cse0) (= (store |v_#memory_int_499| |v_~#m2~0.base_31| (store .cse5 |v_~#m2~0.offset_31| 0)) |v_#memory_int_498|) (= .cse0 (select .cse4 .cse1))))) InVars {#race=|v_#race_847|, #memory_int=|v_#memory_int_499|, ~#m2~0.base=|v_~#m2~0.base_31|, ~#m2~0.offset=|v_~#m2~0.offset_31|} OutVars{#race=|v_#race_845|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_498|, ~#m2~0.base=|v_~#m2~0.base_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [Black: 1085#true, 513#L734-6true, 1083#true, 1090#true, 1079#true, 1087#(= |#race~state~0| 0), 1077#true, 624#L724-3true, 95#L784-3true, 883#L793-4true, 1081#true]) [2025-01-09 21:06:33,556 INFO L294 olderBase$Statistics]: this new event has 744 ancestors and is cut-off event [2025-01-09 21:06:33,556 INFO L297 olderBase$Statistics]: existing Event has 730 ancestors and is cut-off event [2025-01-09 21:06:33,557 INFO L297 olderBase$Statistics]: existing Event has 744 ancestors and is cut-off event [2025-01-09 21:06:33,557 INFO L297 olderBase$Statistics]: existing Event has 730 ancestors and is cut-off event [2025-01-09 21:06:34,075 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4240] L784-->L784-3: Formula: (let ((.cse4 (select |v_#race_845| |v_~#m2~0.base_31|)) (.cse3 (+ |v_~#m2~0.offset_31| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_31| 2)) (.cse5 (select |v_#memory_int_499| |v_~#m2~0.base_31|)) (.cse0 (select .cse4 .cse3)) (.cse1 (+ |v_~#m2~0.offset_31| 1))) (and (= (store |v_#race_847| |v_~#m2~0.base_31| (store (store (store (store (select |v_#race_847| |v_~#m2~0.base_31|) |v_~#m2~0.offset_31| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0)) |v_#race_845|) (= (select .cse4 .cse2) .cse0) (not (= 0 (ite (= (select .cse5 |v_~#m2~0.offset_31|) 1) 1 0))) (= (select .cse4 |v_~#m2~0.offset_31|) .cse0) (= (store |v_#memory_int_499| |v_~#m2~0.base_31| (store .cse5 |v_~#m2~0.offset_31| 0)) |v_#memory_int_498|) (= .cse0 (select .cse4 .cse1))))) InVars {#race=|v_#race_847|, #memory_int=|v_#memory_int_499|, ~#m2~0.base=|v_~#m2~0.base_31|, ~#m2~0.offset=|v_~#m2~0.offset_31|} OutVars{#race=|v_#race_845|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_498|, ~#m2~0.base=|v_~#m2~0.base_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][838], [Black: 1085#true, 609#L734-7true, 1083#true, 1090#true, 1079#true, 1087#(= |#race~state~0| 0), 1077#true, 624#L724-3true, 95#L784-3true, 883#L793-4true, 1081#true]) [2025-01-09 21:06:34,075 INFO L294 olderBase$Statistics]: this new event has 745 ancestors and is cut-off event [2025-01-09 21:06:34,075 INFO L297 olderBase$Statistics]: existing Event has 745 ancestors and is cut-off event [2025-01-09 21:06:34,075 INFO L297 olderBase$Statistics]: existing Event has 731 ancestors and is cut-off event [2025-01-09 21:06:34,075 INFO L297 olderBase$Statistics]: existing Event has 731 ancestors and is cut-off event [2025-01-09 21:06:34,076 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4240] L784-->L784-3: Formula: (let ((.cse4 (select |v_#race_845| |v_~#m2~0.base_31|)) (.cse3 (+ |v_~#m2~0.offset_31| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_31| 2)) (.cse5 (select |v_#memory_int_499| |v_~#m2~0.base_31|)) (.cse0 (select .cse4 .cse3)) (.cse1 (+ |v_~#m2~0.offset_31| 1))) (and (= (store |v_#race_847| |v_~#m2~0.base_31| (store (store (store (store (select |v_#race_847| |v_~#m2~0.base_31|) |v_~#m2~0.offset_31| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0)) |v_#race_845|) (= (select .cse4 .cse2) .cse0) (not (= 0 (ite (= (select .cse5 |v_~#m2~0.offset_31|) 1) 1 0))) (= (select .cse4 |v_~#m2~0.offset_31|) .cse0) (= (store |v_#memory_int_499| |v_~#m2~0.base_31| (store .cse5 |v_~#m2~0.offset_31| 0)) |v_#memory_int_498|) (= .cse0 (select .cse4 .cse1))))) InVars {#race=|v_#race_847|, #memory_int=|v_#memory_int_499|, ~#m2~0.base=|v_~#m2~0.base_31|, ~#m2~0.offset=|v_~#m2~0.offset_31|} OutVars{#race=|v_#race_845|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_498|, ~#m2~0.base=|v_~#m2~0.base_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [Black: 1085#true, 609#L734-7true, 1083#true, 1090#true, 1079#true, 1087#(= |#race~state~0| 0), 1077#true, 624#L724-3true, 95#L784-3true, 883#L793-4true, 1081#true]) [2025-01-09 21:06:34,076 INFO L294 olderBase$Statistics]: this new event has 745 ancestors and is cut-off event [2025-01-09 21:06:34,076 INFO L297 olderBase$Statistics]: existing Event has 731 ancestors and is cut-off event [2025-01-09 21:06:34,076 INFO L297 olderBase$Statistics]: existing Event has 731 ancestors and is cut-off event [2025-01-09 21:06:34,076 INFO L297 olderBase$Statistics]: existing Event has 745 ancestors and is cut-off event [2025-01-09 21:06:34,077 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4240] L784-->L784-3: Formula: (let ((.cse4 (select |v_#race_845| |v_~#m2~0.base_31|)) (.cse3 (+ |v_~#m2~0.offset_31| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_31| 2)) (.cse5 (select |v_#memory_int_499| |v_~#m2~0.base_31|)) (.cse0 (select .cse4 .cse3)) (.cse1 (+ |v_~#m2~0.offset_31| 1))) (and (= (store |v_#race_847| |v_~#m2~0.base_31| (store (store (store (store (select |v_#race_847| |v_~#m2~0.base_31|) |v_~#m2~0.offset_31| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0)) |v_#race_845|) (= (select .cse4 .cse2) .cse0) (not (= 0 (ite (= (select .cse5 |v_~#m2~0.offset_31|) 1) 1 0))) (= (select .cse4 |v_~#m2~0.offset_31|) .cse0) (= (store |v_#memory_int_499| |v_~#m2~0.base_31| (store .cse5 |v_~#m2~0.offset_31| 0)) |v_#memory_int_498|) (= .cse0 (select .cse4 .cse1))))) InVars {#race=|v_#race_847|, #memory_int=|v_#memory_int_499|, ~#m2~0.base=|v_~#m2~0.base_31|, ~#m2~0.offset=|v_~#m2~0.offset_31|} OutVars{#race=|v_#race_845|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_498|, ~#m2~0.base=|v_~#m2~0.base_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [Black: 1085#true, 1083#true, 568#thr1Err3ASSERT_VIOLATIONDATA_RACEtrue, 1090#true, 1079#true, 1087#(= |#race~state~0| 0), 1077#true, 624#L724-3true, 95#L784-3true, 883#L793-4true, 1081#true]) [2025-01-09 21:06:34,077 INFO L294 olderBase$Statistics]: this new event has 745 ancestors and is cut-off event [2025-01-09 21:06:34,077 INFO L297 olderBase$Statistics]: existing Event has 731 ancestors and is cut-off event [2025-01-09 21:06:34,077 INFO L297 olderBase$Statistics]: existing Event has 731 ancestors and is cut-off event [2025-01-09 21:06:34,077 INFO L297 olderBase$Statistics]: existing Event has 745 ancestors and is cut-off event [2025-01-09 21:06:34,525 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4240] L784-->L784-3: Formula: (let ((.cse4 (select |v_#race_845| |v_~#m2~0.base_31|)) (.cse3 (+ |v_~#m2~0.offset_31| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_31| 2)) (.cse5 (select |v_#memory_int_499| |v_~#m2~0.base_31|)) (.cse0 (select .cse4 .cse3)) (.cse1 (+ |v_~#m2~0.offset_31| 1))) (and (= (store |v_#race_847| |v_~#m2~0.base_31| (store (store (store (store (select |v_#race_847| |v_~#m2~0.base_31|) |v_~#m2~0.offset_31| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0)) |v_#race_845|) (= (select .cse4 .cse2) .cse0) (not (= 0 (ite (= (select .cse5 |v_~#m2~0.offset_31|) 1) 1 0))) (= (select .cse4 |v_~#m2~0.offset_31|) .cse0) (= (store |v_#memory_int_499| |v_~#m2~0.base_31| (store .cse5 |v_~#m2~0.offset_31| 0)) |v_#memory_int_498|) (= .cse0 (select .cse4 .cse1))))) InVars {#race=|v_#race_847|, #memory_int=|v_#memory_int_499|, ~#m2~0.base=|v_~#m2~0.base_31|, ~#m2~0.offset=|v_~#m2~0.offset_31|} OutVars{#race=|v_#race_845|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_498|, ~#m2~0.base=|v_~#m2~0.base_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [Black: 1085#true, 1083#true, 867#L733true, 1090#true, 1079#true, 1087#(= |#race~state~0| 0), 1077#true, 624#L724-3true, 95#L784-3true, 883#L793-4true, 1081#true]) [2025-01-09 21:06:34,526 INFO L294 olderBase$Statistics]: this new event has 746 ancestors and is cut-off event [2025-01-09 21:06:34,526 INFO L297 olderBase$Statistics]: existing Event has 746 ancestors and is cut-off event [2025-01-09 21:06:34,526 INFO L297 olderBase$Statistics]: existing Event has 732 ancestors and is cut-off event [2025-01-09 21:06:34,526 INFO L297 olderBase$Statistics]: existing Event has 732 ancestors and is cut-off event [2025-01-09 21:06:34,974 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4240] L784-->L784-3: Formula: (let ((.cse4 (select |v_#race_845| |v_~#m2~0.base_31|)) (.cse3 (+ |v_~#m2~0.offset_31| 3))) (let ((.cse2 (+ |v_~#m2~0.offset_31| 2)) (.cse5 (select |v_#memory_int_499| |v_~#m2~0.base_31|)) (.cse0 (select .cse4 .cse3)) (.cse1 (+ |v_~#m2~0.offset_31| 1))) (and (= (store |v_#race_847| |v_~#m2~0.base_31| (store (store (store (store (select |v_#race_847| |v_~#m2~0.base_31|) |v_~#m2~0.offset_31| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0)) |v_#race_845|) (= (select .cse4 .cse2) .cse0) (not (= 0 (ite (= (select .cse5 |v_~#m2~0.offset_31|) 1) 1 0))) (= (select .cse4 |v_~#m2~0.offset_31|) .cse0) (= (store |v_#memory_int_499| |v_~#m2~0.base_31| (store .cse5 |v_~#m2~0.offset_31| 0)) |v_#memory_int_498|) (= .cse0 (select .cse4 .cse1))))) InVars {#race=|v_#race_847|, #memory_int=|v_#memory_int_499|, ~#m2~0.base=|v_~#m2~0.base_31|, ~#m2~0.offset=|v_~#m2~0.offset_31|} OutVars{#race=|v_#race_845|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_7|, #memory_int=|v_#memory_int_498|, ~#m2~0.base=|v_~#m2~0.base_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset_5|, ~#m2~0.offset=|v_~#m2~0.offset_31|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset_5|, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base_5|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[#race, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #memory_int, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet6#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~mem5#1, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.offset, thr1Thread3of3ForFork0___VERIFIER_atomic_release_#in~m#1.base, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][779], [Black: 1085#true, 72#L782true, 1083#true, 1090#true, 1079#true, 1087#(= |#race~state~0| 0), 1077#true, 624#L724-3true, 95#L784-3true, 883#L793-4true, 1081#true]) [2025-01-09 21:06:34,974 INFO L294 olderBase$Statistics]: this new event has 747 ancestors and is cut-off event [2025-01-09 21:06:34,974 INFO L297 olderBase$Statistics]: existing Event has 747 ancestors and is cut-off event [2025-01-09 21:06:34,975 INFO L297 olderBase$Statistics]: existing Event has 733 ancestors and is cut-off event [2025-01-09 21:06:34,975 INFO L297 olderBase$Statistics]: existing Event has 733 ancestors and is cut-off event