./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-ext/25_stack_longer-1-race.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/25_stack_longer-1-race.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 71de1c8da7c81d1cb6f2035741a17645b8c79e199c0fda7e542c1cb232593d6b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:05:10,395 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:05:10,430 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:10,433 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:05:10,433 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:05:10,448 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:05:10,448 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:05:10,448 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:05:10,449 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:05:10,449 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:05:10,449 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:05:10,449 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:05:10,449 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:05:10,449 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:05:10,449 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:05:10,449 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:05:10,449 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:05:10,449 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:05:10,449 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:05:10,449 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:05:10,449 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:05:10,449 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:05:10,450 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:05:10,450 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:05:10,450 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:05:10,450 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:05:10,450 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:05:10,450 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:05:10,450 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:05:10,450 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:05:10,450 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:05:10,450 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:05:10,450 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:05:10,450 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:05:10,450 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:05:10,450 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:05:10,450 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:05:10,450 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:05:10,450 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:05:10,450 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:05:10,450 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:05:10,451 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:05:10,451 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:05:10,451 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:05:10,451 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:05:10,451 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:05:10,451 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 -> 71de1c8da7c81d1cb6f2035741a17645b8c79e199c0fda7e542c1cb232593d6b [2025-01-09 21:05:10,625 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:05:10,642 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:05:10,643 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:05:10,648 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:05:10,648 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:05:10,649 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/25_stack_longer-1-race.i [2025-01-09 21:05:11,767 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8aeb6bd76/777976dda0794dcda18293d393745042/FLAGfbf6f3b88 [2025-01-09 21:05:12,034 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:05:12,035 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/25_stack_longer-1-race.i [2025-01-09 21:05:12,045 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8aeb6bd76/777976dda0794dcda18293d393745042/FLAGfbf6f3b88 [2025-01-09 21:05:12,342 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8aeb6bd76/777976dda0794dcda18293d393745042 [2025-01-09 21:05:12,344 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:05:12,345 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:05:12,346 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:05:12,346 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:05:12,349 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:05:12,350 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:05:12" (1/1) ... [2025-01-09 21:05:12,352 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4922ca42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:05:12, skipping insertion in model container [2025-01-09 21:05:12,352 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:05:12" (1/1) ... [2025-01-09 21:05:12,372 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:05:12,623 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:05:12,643 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:05:12,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:05:12,713 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:05:12,716 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:05:12 WrapperNode [2025-01-09 21:05:12,716 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:05:12,717 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:05:12,717 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:05:12,717 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:05:12,722 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:12" (1/1) ... [2025-01-09 21:05:12,740 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:12" (1/1) ... [2025-01-09 21:05:12,777 INFO L138 Inliner]: procedures = 176, calls = 32, calls flagged for inlining = 19, calls inlined = 23, statements flattened = 928 [2025-01-09 21:05:12,778 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:05:12,778 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:05:12,778 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:05:12,778 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:05:12,784 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:12" (1/1) ... [2025-01-09 21:05:12,784 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:12" (1/1) ... [2025-01-09 21:05:12,788 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:12" (1/1) ... [2025-01-09 21:05:12,789 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:12" (1/1) ... [2025-01-09 21:05:12,802 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:12" (1/1) ... [2025-01-09 21:05:12,807 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:12" (1/1) ... [2025-01-09 21:05:12,810 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:12" (1/1) ... [2025-01-09 21:05:12,812 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:12" (1/1) ... [2025-01-09 21:05:12,814 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:12" (1/1) ... [2025-01-09 21:05:12,817 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:05:12,818 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:05:12,818 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:05:12,818 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:05:12,819 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:05:12" (1/1) ... [2025-01-09 21:05:12,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:05:12,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:05:12,852 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:12,867 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:12,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:05:12,885 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-01-09 21:05:12,885 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-01-09 21:05:12,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:05:12,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:05:12,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:05:12,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:05:12,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:05:12,887 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:12,992 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:05:12,994 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:05:13,790 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:05:13,790 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:05:14,029 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:05:14,029 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 21:05:14,029 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:05:14 BoogieIcfgContainer [2025-01-09 21:05:14,029 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:05:14,031 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:05:14,031 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:05:14,038 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:05:14,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:05:12" (1/3) ... [2025-01-09 21:05:14,039 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c5c56ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:05:14, skipping insertion in model container [2025-01-09 21:05:14,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:05:12" (2/3) ... [2025-01-09 21:05:14,040 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c5c56ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:05:14, skipping insertion in model container [2025-01-09 21:05:14,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:05:14" (3/3) ... [2025-01-09 21:05:14,041 INFO L128 eAbstractionObserver]: Analyzing ICFG 25_stack_longer-1-race.i [2025-01-09 21:05:14,054 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:05:14,055 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 25_stack_longer-1-race.i that has 2 procedures, 791 locations, 1 initial locations, 2 loop locations, and 26 error locations. [2025-01-09 21:05:14,056 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:05:14,137 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:05:14,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 794 places, 796 transitions, 1596 flow [2025-01-09 21:05:14,422 INFO L124 PetriNetUnfolderBase]: 5/803 cut-off events. [2025-01-09 21:05:14,425 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:05:14,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 807 conditions, 803 events. 5/803 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 221 event pairs, 0 based on Foata normal form. 0/770 useless extension candidates. Maximal degree in co-relation 135. Up to 2 conditions per place. [2025-01-09 21:05:14,431 INFO L82 GeneralOperation]: Start removeDead. Operand has 794 places, 796 transitions, 1596 flow [2025-01-09 21:05:14,439 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 794 places, 796 transitions, 1596 flow [2025-01-09 21:05:14,443 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:05:14,453 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;@54e562e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:05:14,454 INFO L334 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2025-01-09 21:05:14,541 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:05:14,542 INFO L124 PetriNetUnfolderBase]: 0/670 cut-off events. [2025-01-09 21:05:14,542 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:05:14,542 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:05:14,544 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] [2025-01-09 21:05:14,544 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:14,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:05:14,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1865052109, now seen corresponding path program 1 times [2025-01-09 21:05:14,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:05:14,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945754509] [2025-01-09 21:05:14,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:05:14,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:05:14,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 665 statements into 1 equivalence classes. [2025-01-09 21:05:15,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 665 of 665 statements. [2025-01-09 21:05:15,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:05:15,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:05:17,050 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:17,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:05:17,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945754509] [2025-01-09 21:05:17,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945754509] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:05:17,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:05:17,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-09 21:05:17,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170111251] [2025-01-09 21:05:17,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:05:17,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 21:05:17,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:05:17,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 21:05:17,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 21:05:17,091 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 770 out of 796 [2025-01-09 21:05:17,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 794 places, 796 transitions, 1596 flow. Second operand has 2 states, 2 states have (on average 771.0) internal successors, (1542), 2 states have internal predecessors, (1542), 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:17,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:05:17,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 770 of 796 [2025-01-09 21:05:17,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:05:17,303 INFO L124 PetriNetUnfolderBase]: 4/778 cut-off events. [2025-01-09 21:05:17,303 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:05:17,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 792 conditions, 778 events. 4/778 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 136 event pairs, 0 based on Foata normal form. 8/771 useless extension candidates. Maximal degree in co-relation 122. Up to 10 conditions per place. [2025-01-09 21:05:17,306 INFO L140 encePairwiseOnDemand]: 779/796 looper letters, 9 selfloop transitions, 0 changer transitions 0/775 dead transitions. [2025-01-09 21:05:17,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 775 places, 775 transitions, 1572 flow [2025-01-09 21:05:17,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 21:05:17,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-09 21:05:17,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1566 transitions. [2025-01-09 21:05:17,322 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9836683417085427 [2025-01-09 21:05:17,325 INFO L175 Difference]: Start difference. First operand has 794 places, 796 transitions, 1596 flow. Second operand 2 states and 1566 transitions. [2025-01-09 21:05:17,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 775 places, 775 transitions, 1572 flow [2025-01-09 21:05:17,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 775 places, 775 transitions, 1572 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:05:17,345 INFO L231 Difference]: Finished difference. Result has 775 places, 775 transitions, 1554 flow [2025-01-09 21:05:17,349 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=796, PETRI_DIFFERENCE_MINUEND_FLOW=1554, PETRI_DIFFERENCE_MINUEND_PLACES=774, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=775, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=775, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=1554, PETRI_PLACES=775, PETRI_TRANSITIONS=775} [2025-01-09 21:05:17,352 INFO L279 CegarLoopForPetriNet]: 794 programPoint places, -19 predicate places. [2025-01-09 21:05:17,352 INFO L471 AbstractCegarLoop]: Abstraction has has 775 places, 775 transitions, 1554 flow [2025-01-09 21:05:17,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 771.0) internal successors, (1542), 2 states have internal predecessors, (1542), 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:17,354 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:05:17,354 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:17,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:05:17,355 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:17,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:05:17,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1313644106, now seen corresponding path program 1 times [2025-01-09 21:05:17,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:05:17,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433318436] [2025-01-09 21:05:17,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:05:17,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:05:17,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 667 statements into 1 equivalence classes. [2025-01-09 21:05:17,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 667 of 667 statements. [2025-01-09 21:05:17,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:05:17,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:05:17,973 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:17,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:05:17,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433318436] [2025-01-09 21:05:17,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433318436] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:05:17,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:05:17,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:05:17,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584400416] [2025-01-09 21:05:17,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:05:17,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:05:17,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:05:17,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:05:17,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:05:17,986 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 766 out of 796 [2025-01-09 21:05:17,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 775 places, 775 transitions, 1554 flow. Second operand has 3 states, 3 states have (on average 767.3333333333334) internal successors, (2302), 3 states have internal predecessors, (2302), 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:17,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:05:17,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 766 of 796 [2025-01-09 21:05:17,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:05:18,141 INFO L124 PetriNetUnfolderBase]: 6/865 cut-off events. [2025-01-09 21:05:18,141 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:05:18,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 890 conditions, 865 events. 6/865 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 434 event pairs, 0 based on Foata normal form. 0/840 useless extension candidates. Maximal degree in co-relation 886. Up to 11 conditions per place. [2025-01-09 21:05:18,144 INFO L140 encePairwiseOnDemand]: 793/796 looper letters, 17 selfloop transitions, 2 changer transitions 0/781 dead transitions. [2025-01-09 21:05:18,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 776 places, 781 transitions, 1604 flow [2025-01-09 21:05:18,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:05:18,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:05:18,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2318 transitions. [2025-01-09 21:05:18,151 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9706867671691792 [2025-01-09 21:05:18,151 INFO L175 Difference]: Start difference. First operand has 775 places, 775 transitions, 1554 flow. Second operand 3 states and 2318 transitions. [2025-01-09 21:05:18,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 776 places, 781 transitions, 1604 flow [2025-01-09 21:05:18,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 776 places, 781 transitions, 1604 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:05:18,162 INFO L231 Difference]: Finished difference. Result has 776 places, 774 transitions, 1556 flow [2025-01-09 21:05:18,163 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=796, PETRI_DIFFERENCE_MINUEND_FLOW=1552, PETRI_DIFFERENCE_MINUEND_PLACES=774, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=774, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=772, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1556, PETRI_PLACES=776, PETRI_TRANSITIONS=774} [2025-01-09 21:05:18,164 INFO L279 CegarLoopForPetriNet]: 794 programPoint places, -18 predicate places. [2025-01-09 21:05:18,164 INFO L471 AbstractCegarLoop]: Abstraction has has 776 places, 774 transitions, 1556 flow [2025-01-09 21:05:18,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 767.3333333333334) internal successors, (2302), 3 states have internal predecessors, (2302), 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:18,165 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:05:18,166 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] [2025-01-09 21:05:18,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:05:18,167 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:18,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:05:18,168 INFO L85 PathProgramCache]: Analyzing trace with hash 2107280272, now seen corresponding path program 1 times [2025-01-09 21:05:18,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:05:18,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493713805] [2025-01-09 21:05:18,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:05:18,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:05:18,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 669 statements into 1 equivalence classes. [2025-01-09 21:05:18,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 669 of 669 statements. [2025-01-09 21:05:18,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:05:18,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:05:18,395 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:05:18,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 669 statements into 1 equivalence classes. [2025-01-09 21:05:18,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 669 of 669 statements. [2025-01-09 21:05:18,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:05:18,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:05:18,728 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:05:18,728 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:05:18,729 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (52 of 53 remaining) [2025-01-09 21:05:18,731 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (51 of 53 remaining) [2025-01-09 21:05:18,731 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (50 of 53 remaining) [2025-01-09 21:05:18,731 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (49 of 53 remaining) [2025-01-09 21:05:18,731 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (48 of 53 remaining) [2025-01-09 21:05:18,731 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (47 of 53 remaining) [2025-01-09 21:05:18,731 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (46 of 53 remaining) [2025-01-09 21:05:18,731 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (45 of 53 remaining) [2025-01-09 21:05:18,731 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (44 of 53 remaining) [2025-01-09 21:05:18,731 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (43 of 53 remaining) [2025-01-09 21:05:18,731 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (42 of 53 remaining) [2025-01-09 21:05:18,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (41 of 53 remaining) [2025-01-09 21:05:18,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (40 of 53 remaining) [2025-01-09 21:05:18,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (39 of 53 remaining) [2025-01-09 21:05:18,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (38 of 53 remaining) [2025-01-09 21:05:18,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (37 of 53 remaining) [2025-01-09 21:05:18,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (36 of 53 remaining) [2025-01-09 21:05:18,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (35 of 53 remaining) [2025-01-09 21:05:18,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (34 of 53 remaining) [2025-01-09 21:05:18,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (33 of 53 remaining) [2025-01-09 21:05:18,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (32 of 53 remaining) [2025-01-09 21:05:18,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (31 of 53 remaining) [2025-01-09 21:05:18,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (30 of 53 remaining) [2025-01-09 21:05:18,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (29 of 53 remaining) [2025-01-09 21:05:18,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (28 of 53 remaining) [2025-01-09 21:05:18,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (27 of 53 remaining) [2025-01-09 21:05:18,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (26 of 53 remaining) [2025-01-09 21:05:18,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (25 of 53 remaining) [2025-01-09 21:05:18,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (24 of 53 remaining) [2025-01-09 21:05:18,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (23 of 53 remaining) [2025-01-09 21:05:18,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (22 of 53 remaining) [2025-01-09 21:05:18,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (21 of 53 remaining) [2025-01-09 21:05:18,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (20 of 53 remaining) [2025-01-09 21:05:18,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (19 of 53 remaining) [2025-01-09 21:05:18,734 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (18 of 53 remaining) [2025-01-09 21:05:18,734 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (17 of 53 remaining) [2025-01-09 21:05:18,734 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (16 of 53 remaining) [2025-01-09 21:05:18,734 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (15 of 53 remaining) [2025-01-09 21:05:18,734 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (14 of 53 remaining) [2025-01-09 21:05:18,734 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (13 of 53 remaining) [2025-01-09 21:05:18,734 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (12 of 53 remaining) [2025-01-09 21:05:18,734 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (11 of 53 remaining) [2025-01-09 21:05:18,734 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (10 of 53 remaining) [2025-01-09 21:05:18,734 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (9 of 53 remaining) [2025-01-09 21:05:18,734 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (8 of 53 remaining) [2025-01-09 21:05:18,734 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (7 of 53 remaining) [2025-01-09 21:05:18,735 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (6 of 53 remaining) [2025-01-09 21:05:18,735 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (5 of 53 remaining) [2025-01-09 21:05:18,735 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (4 of 53 remaining) [2025-01-09 21:05:18,735 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (3 of 53 remaining) [2025-01-09 21:05:18,735 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (2 of 53 remaining) [2025-01-09 21:05:18,735 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (1 of 53 remaining) [2025-01-09 21:05:18,735 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (0 of 53 remaining) [2025-01-09 21:05:18,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:05:18,735 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-09 21:05:18,737 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:05:18,737 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-09 21:05:18,797 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:05:18,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 918 places, 923 transitions, 1856 flow [2025-01-09 21:05:18,934 INFO L124 PetriNetUnfolderBase]: 10/939 cut-off events. [2025-01-09 21:05:18,934 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:05:18,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 947 conditions, 939 events. 10/939 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 871 event pairs, 0 based on Foata normal form. 0/874 useless extension candidates. Maximal degree in co-relation 804. Up to 3 conditions per place. [2025-01-09 21:05:18,939 INFO L82 GeneralOperation]: Start removeDead. Operand has 918 places, 923 transitions, 1856 flow [2025-01-09 21:05:18,945 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 918 places, 923 transitions, 1856 flow [2025-01-09 21:05:18,948 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:05:18,949 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;@54e562e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:05:18,949 INFO L334 AbstractCegarLoop]: Starting to check reachability of 79 error locations. [2025-01-09 21:05:19,065 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:05:19,066 INFO L124 PetriNetUnfolderBase]: 0/669 cut-off events. [2025-01-09 21:05:19,066 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:05:19,066 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:05:19,067 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] [2025-01-09 21:05:19,067 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:19,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:05:19,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1839045644, now seen corresponding path program 1 times [2025-01-09 21:05:19,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:05:19,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346914374] [2025-01-09 21:05:19,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:05:19,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:05:19,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 665 statements into 1 equivalence classes. [2025-01-09 21:05:19,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 665 of 665 statements. [2025-01-09 21:05:19,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:05:19,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:05:20,589 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:20,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:05:20,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346914374] [2025-01-09 21:05:20,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346914374] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:05:20,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:05:20,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-09 21:05:20,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164537419] [2025-01-09 21:05:20,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:05:20,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 21:05:20,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:05:20,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 21:05:20,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 21:05:20,594 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 872 out of 923 [2025-01-09 21:05:20,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 918 places, 923 transitions, 1856 flow. Second operand has 2 states, 2 states have (on average 873.0) internal successors, (1746), 2 states have internal predecessors, (1746), 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:20,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:05:20,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 872 of 923 [2025-01-09 21:05:20,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:05:21,030 INFO L124 PetriNetUnfolderBase]: 112/1909 cut-off events. [2025-01-09 21:05:21,030 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-01-09 21:05:21,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2096 conditions, 1909 events. 112/1909 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 8100 event pairs, 52 based on Foata normal form. 89/1825 useless extension candidates. Maximal degree in co-relation 1269. Up to 161 conditions per place. [2025-01-09 21:05:21,042 INFO L140 encePairwiseOnDemand]: 890/923 looper letters, 18 selfloop transitions, 0 changer transitions 0/885 dead transitions. [2025-01-09 21:05:21,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 883 places, 885 transitions, 1816 flow [2025-01-09 21:05:21,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 21:05:21,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-09 21:05:21,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1795 transitions. [2025-01-09 21:05:21,046 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9723726977248104 [2025-01-09 21:05:21,046 INFO L175 Difference]: Start difference. First operand has 918 places, 923 transitions, 1856 flow. Second operand 2 states and 1795 transitions. [2025-01-09 21:05:21,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 883 places, 885 transitions, 1816 flow [2025-01-09 21:05:21,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 883 places, 885 transitions, 1816 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:05:21,056 INFO L231 Difference]: Finished difference. Result has 883 places, 885 transitions, 1780 flow [2025-01-09 21:05:21,057 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=923, PETRI_DIFFERENCE_MINUEND_FLOW=1780, PETRI_DIFFERENCE_MINUEND_PLACES=882, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=885, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=885, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=1780, PETRI_PLACES=883, PETRI_TRANSITIONS=885} [2025-01-09 21:05:21,057 INFO L279 CegarLoopForPetriNet]: 918 programPoint places, -35 predicate places. [2025-01-09 21:05:21,058 INFO L471 AbstractCegarLoop]: Abstraction has has 883 places, 885 transitions, 1780 flow [2025-01-09 21:05:21,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 873.0) internal successors, (1746), 2 states have internal predecessors, (1746), 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:21,059 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:05:21,059 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:21,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:05:21,059 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:05:21,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:05:21,061 INFO L85 PathProgramCache]: Analyzing trace with hash 2091409007, now seen corresponding path program 1 times [2025-01-09 21:05:21,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:05:21,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374455559] [2025-01-09 21:05:21,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:05:21,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:05:21,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 667 statements into 1 equivalence classes. [2025-01-09 21:05:21,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 667 of 667 statements. [2025-01-09 21:05:21,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:05:21,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:05:21,307 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:21,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:05:21,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374455559] [2025-01-09 21:05:21,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374455559] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:05:21,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:05:21,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:05:21,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047571244] [2025-01-09 21:05:21,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:05:21,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:05:21,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:05:21,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:05:21,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:05:21,323 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 864 out of 923 [2025-01-09 21:05:21,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 883 places, 885 transitions, 1780 flow. Second operand has 3 states, 3 states have (on average 865.3333333333334) internal successors, (2596), 3 states have internal predecessors, (2596), 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:21,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:05:21,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 864 of 923 [2025-01-09 21:05:21,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:05:22,071 INFO L124 PetriNetUnfolderBase]: 366/4265 cut-off events. [2025-01-09 21:05:22,071 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2025-01-09 21:05:22,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4889 conditions, 4265 events. 366/4265 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 32809 event pairs, 95 based on Foata normal form. 0/3784 useless extension candidates. Maximal degree in co-relation 4884. Up to 290 conditions per place. [2025-01-09 21:05:22,089 INFO L140 encePairwiseOnDemand]: 915/923 looper letters, 43 selfloop transitions, 6 changer transitions 0/908 dead transitions. [2025-01-09 21:05:22,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 885 places, 908 transitions, 1929 flow [2025-01-09 21:05:22,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:05:22,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:05:22,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2643 transitions. [2025-01-09 21:05:22,093 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9544962080173348 [2025-01-09 21:05:22,093 INFO L175 Difference]: Start difference. First operand has 883 places, 885 transitions, 1780 flow. Second operand 3 states and 2643 transitions. [2025-01-09 21:05:22,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 885 places, 908 transitions, 1929 flow [2025-01-09 21:05:22,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 885 places, 908 transitions, 1929 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:05:22,103 INFO L231 Difference]: Finished difference. Result has 887 places, 891 transitions, 1832 flow [2025-01-09 21:05:22,104 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=923, PETRI_DIFFERENCE_MINUEND_FLOW=1780, PETRI_DIFFERENCE_MINUEND_PLACES=883, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=885, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=879, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1832, PETRI_PLACES=887, PETRI_TRANSITIONS=891} [2025-01-09 21:05:22,104 INFO L279 CegarLoopForPetriNet]: 918 programPoint places, -31 predicate places. [2025-01-09 21:05:22,104 INFO L471 AbstractCegarLoop]: Abstraction has has 887 places, 891 transitions, 1832 flow [2025-01-09 21:05:22,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 865.3333333333334) internal successors, (2596), 3 states have internal predecessors, (2596), 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:22,106 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:05:22,106 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] [2025-01-09 21:05:22,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:05:22,106 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2025-01-09 21:05:22,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:05:22,108 INFO L85 PathProgramCache]: Analyzing trace with hash -462589462, now seen corresponding path program 1 times [2025-01-09 21:05:22,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:05:22,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091288753] [2025-01-09 21:05:22,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:05:22,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:05:22,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 674 statements into 1 equivalence classes. [2025-01-09 21:05:22,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 674 of 674 statements. [2025-01-09 21:05:22,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:05:22,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:05:22,332 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:22,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:05:22,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091288753] [2025-01-09 21:05:22,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091288753] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:05:22,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:05:22,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:05:22,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293086225] [2025-01-09 21:05:22,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:05:22,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:05:22,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:05:22,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:05:22,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:05:22,367 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 860 out of 923 [2025-01-09 21:05:22,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 887 places, 891 transitions, 1832 flow. Second operand has 3 states, 3 states have (on average 862.0) internal successors, (2586), 3 states have internal predecessors, (2586), 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:22,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:05:22,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 860 of 923 [2025-01-09 21:05:22,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:05:23,411 INFO L124 PetriNetUnfolderBase]: 674/5421 cut-off events. [2025-01-09 21:05:23,411 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2025-01-09 21:05:23,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6677 conditions, 5421 events. 674/5421 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 45234 event pairs, 283 based on Foata normal form. 0/4759 useless extension candidates. Maximal degree in co-relation 6670. Up to 992 conditions per place. [2025-01-09 21:05:23,447 INFO L140 encePairwiseOnDemand]: 915/923 looper letters, 37 selfloop transitions, 7 changer transitions 0/905 dead transitions. [2025-01-09 21:05:23,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 889 places, 905 transitions, 1953 flow [2025-01-09 21:05:23,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:05:23,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:05:23,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2625 transitions. [2025-01-09 21:05:23,453 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9479956663055255 [2025-01-09 21:05:23,453 INFO L175 Difference]: Start difference. First operand has 887 places, 891 transitions, 1832 flow. Second operand 3 states and 2625 transitions. [2025-01-09 21:05:23,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 889 places, 905 transitions, 1953 flow [2025-01-09 21:05:23,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 887 places, 905 transitions, 1941 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:05:23,465 INFO L231 Difference]: Finished difference. Result has 889 places, 897 transitions, 1874 flow [2025-01-09 21:05:23,466 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=923, PETRI_DIFFERENCE_MINUEND_FLOW=1820, PETRI_DIFFERENCE_MINUEND_PLACES=885, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=891, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=884, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1874, PETRI_PLACES=889, PETRI_TRANSITIONS=897} [2025-01-09 21:05:23,468 INFO L279 CegarLoopForPetriNet]: 918 programPoint places, -29 predicate places. [2025-01-09 21:05:23,468 INFO L471 AbstractCegarLoop]: Abstraction has has 889 places, 897 transitions, 1874 flow [2025-01-09 21:05:23,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 862.0) internal successors, (2586), 3 states have internal predecessors, (2586), 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:23,469 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:05:23,470 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] [2025-01-09 21:05:23,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:05:23,470 INFO L396 AbstractCegarLoop]: === Iteration 4 === 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:05:23,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:05:23,472 INFO L85 PathProgramCache]: Analyzing trace with hash 544919781, now seen corresponding path program 1 times [2025-01-09 21:05:23,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:05:23,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957422558] [2025-01-09 21:05:23,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:05:23,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:05:23,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 675 statements into 1 equivalence classes. [2025-01-09 21:05:23,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 675 of 675 statements. [2025-01-09 21:05:23,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:05:23,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:05:23,644 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:05:23,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 675 statements into 1 equivalence classes. [2025-01-09 21:05:23,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 675 of 675 statements. [2025-01-09 21:05:23,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:05:23,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:05:23,829 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:05:23,829 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:05:23,829 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (78 of 79 remaining) [2025-01-09 21:05:23,829 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (77 of 79 remaining) [2025-01-09 21:05:23,830 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (76 of 79 remaining) [2025-01-09 21:05:23,830 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (75 of 79 remaining) [2025-01-09 21:05:23,830 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (74 of 79 remaining) [2025-01-09 21:05:23,830 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (73 of 79 remaining) [2025-01-09 21:05:23,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (72 of 79 remaining) [2025-01-09 21:05:23,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (71 of 79 remaining) [2025-01-09 21:05:23,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (70 of 79 remaining) [2025-01-09 21:05:23,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (69 of 79 remaining) [2025-01-09 21:05:23,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (68 of 79 remaining) [2025-01-09 21:05:23,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (67 of 79 remaining) [2025-01-09 21:05:23,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (66 of 79 remaining) [2025-01-09 21:05:23,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (65 of 79 remaining) [2025-01-09 21:05:23,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (64 of 79 remaining) [2025-01-09 21:05:23,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (63 of 79 remaining) [2025-01-09 21:05:23,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (62 of 79 remaining) [2025-01-09 21:05:23,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (61 of 79 remaining) [2025-01-09 21:05:23,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (60 of 79 remaining) [2025-01-09 21:05:23,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (59 of 79 remaining) [2025-01-09 21:05:23,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (58 of 79 remaining) [2025-01-09 21:05:23,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (57 of 79 remaining) [2025-01-09 21:05:23,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (56 of 79 remaining) [2025-01-09 21:05:23,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (55 of 79 remaining) [2025-01-09 21:05:23,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (54 of 79 remaining) [2025-01-09 21:05:23,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (53 of 79 remaining) [2025-01-09 21:05:23,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (52 of 79 remaining) [2025-01-09 21:05:23,831 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (51 of 79 remaining) [2025-01-09 21:05:23,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (50 of 79 remaining) [2025-01-09 21:05:23,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (49 of 79 remaining) [2025-01-09 21:05:23,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (48 of 79 remaining) [2025-01-09 21:05:23,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (47 of 79 remaining) [2025-01-09 21:05:23,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (46 of 79 remaining) [2025-01-09 21:05:23,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (45 of 79 remaining) [2025-01-09 21:05:23,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (44 of 79 remaining) [2025-01-09 21:05:23,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (43 of 79 remaining) [2025-01-09 21:05:23,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (42 of 79 remaining) [2025-01-09 21:05:23,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (41 of 79 remaining) [2025-01-09 21:05:23,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (40 of 79 remaining) [2025-01-09 21:05:23,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (39 of 79 remaining) [2025-01-09 21:05:23,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (38 of 79 remaining) [2025-01-09 21:05:23,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (37 of 79 remaining) [2025-01-09 21:05:23,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (36 of 79 remaining) [2025-01-09 21:05:23,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (35 of 79 remaining) [2025-01-09 21:05:23,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (34 of 79 remaining) [2025-01-09 21:05:23,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (33 of 79 remaining) [2025-01-09 21:05:23,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (32 of 79 remaining) [2025-01-09 21:05:23,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (31 of 79 remaining) [2025-01-09 21:05:23,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (30 of 79 remaining) [2025-01-09 21:05:23,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (29 of 79 remaining) [2025-01-09 21:05:23,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (28 of 79 remaining) [2025-01-09 21:05:23,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (27 of 79 remaining) [2025-01-09 21:05:23,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (26 of 79 remaining) [2025-01-09 21:05:23,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (25 of 79 remaining) [2025-01-09 21:05:23,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (24 of 79 remaining) [2025-01-09 21:05:23,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (23 of 79 remaining) [2025-01-09 21:05:23,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (22 of 79 remaining) [2025-01-09 21:05:23,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (21 of 79 remaining) [2025-01-09 21:05:23,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (20 of 79 remaining) [2025-01-09 21:05:23,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (19 of 79 remaining) [2025-01-09 21:05:23,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (18 of 79 remaining) [2025-01-09 21:05:23,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (17 of 79 remaining) [2025-01-09 21:05:23,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (16 of 79 remaining) [2025-01-09 21:05:23,836 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (15 of 79 remaining) [2025-01-09 21:05:23,836 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (14 of 79 remaining) [2025-01-09 21:05:23,836 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (13 of 79 remaining) [2025-01-09 21:05:23,836 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (12 of 79 remaining) [2025-01-09 21:05:23,836 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (11 of 79 remaining) [2025-01-09 21:05:23,836 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (10 of 79 remaining) [2025-01-09 21:05:23,836 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16ASSERT_VIOLATIONDATA_RACE (9 of 79 remaining) [2025-01-09 21:05:23,837 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17ASSERT_VIOLATIONDATA_RACE (8 of 79 remaining) [2025-01-09 21:05:23,837 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18ASSERT_VIOLATIONDATA_RACE (7 of 79 remaining) [2025-01-09 21:05:23,837 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19ASSERT_VIOLATIONDATA_RACE (6 of 79 remaining) [2025-01-09 21:05:23,837 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONDATA_RACE (5 of 79 remaining) [2025-01-09 21:05:23,837 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20ASSERT_VIOLATIONDATA_RACE (4 of 79 remaining) [2025-01-09 21:05:23,837 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21ASSERT_VIOLATIONDATA_RACE (3 of 79 remaining) [2025-01-09 21:05:23,837 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONDATA_RACE (2 of 79 remaining) [2025-01-09 21:05:23,837 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23ASSERT_VIOLATIONDATA_RACE (1 of 79 remaining) [2025-01-09 21:05:23,837 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24ASSERT_VIOLATIONDATA_RACE (0 of 79 remaining) [2025-01-09 21:05:23,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:05:23,837 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:05:23,838 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:05:23,838 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-09 21:05:23,936 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:05:23,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1042 places, 1050 transitions, 2118 flow [2025-01-09 21:05:24,142 INFO L124 PetriNetUnfolderBase]: 15/1075 cut-off events. [2025-01-09 21:05:24,143 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-09 21:05:24,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1088 conditions, 1075 events. 15/1075 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1694 event pairs, 0 based on Foata normal form. 0/978 useless extension candidates. Maximal degree in co-relation 943. Up to 4 conditions per place. [2025-01-09 21:05:24,149 INFO L82 GeneralOperation]: Start removeDead. Operand has 1042 places, 1050 transitions, 2118 flow [2025-01-09 21:05:24,157 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1042 places, 1050 transitions, 2118 flow [2025-01-09 21:05:24,159 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:05:24,159 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;@54e562e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:05:24,160 INFO L334 AbstractCegarLoop]: Starting to check reachability of 105 error locations. [2025-01-09 21:05:24,201 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:05:24,201 INFO L124 PetriNetUnfolderBase]: 0/669 cut-off events. [2025-01-09 21:05:24,201 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:05:24,202 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:05:24,202 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] [2025-01-09 21:05:24,202 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:05:24,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:05:24,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1732132316, now seen corresponding path program 1 times [2025-01-09 21:05:24,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:05:24,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174521046] [2025-01-09 21:05:24,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:05:24,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:05:24,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 665 statements into 1 equivalence classes. [2025-01-09 21:05:24,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 665 of 665 statements. [2025-01-09 21:05:24,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:05:24,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:05:24,923 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:24,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:05:24,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174521046] [2025-01-09 21:05:24,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174521046] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:05:24,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:05:24,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-09 21:05:24,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724437522] [2025-01-09 21:05:24,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:05:24,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 21:05:24,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:05:24,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 21:05:24,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 21:05:24,926 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 974 out of 1050 [2025-01-09 21:05:24,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1042 places, 1050 transitions, 2118 flow. Second operand has 2 states, 2 states have (on average 975.0) internal successors, (1950), 2 states have internal predecessors, (1950), 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:24,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:05:24,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 974 of 1050 [2025-01-09 21:05:24,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:05:27,025 INFO L124 PetriNetUnfolderBase]: 1750/12706 cut-off events. [2025-01-09 21:05:27,025 INFO L125 PetriNetUnfolderBase]: For 391/391 co-relation queries the response was YES. [2025-01-09 21:05:27,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15179 conditions, 12706 events. 1750/12706 cut-off events. For 391/391 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 136209 event pairs, 962 based on Foata normal form. 956/12079 useless extension candidates. Maximal degree in co-relation 12718. Up to 2202 conditions per place. [2025-01-09 21:05:27,126 INFO L140 encePairwiseOnDemand]: 1001/1050 looper letters, 27 selfloop transitions, 0 changer transitions 0/995 dead transitions. [2025-01-09 21:05:27,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 991 places, 995 transitions, 2062 flow [2025-01-09 21:05:27,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 21:05:27,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-09 21:05:27,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2024 transitions. [2025-01-09 21:05:27,130 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9638095238095238 [2025-01-09 21:05:27,130 INFO L175 Difference]: Start difference. First operand has 1042 places, 1050 transitions, 2118 flow. Second operand 2 states and 2024 transitions. [2025-01-09 21:05:27,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 991 places, 995 transitions, 2062 flow [2025-01-09 21:05:27,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 991 places, 995 transitions, 2060 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-01-09 21:05:27,139 INFO L231 Difference]: Finished difference. Result has 991 places, 995 transitions, 2006 flow [2025-01-09 21:05:27,140 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1050, PETRI_DIFFERENCE_MINUEND_FLOW=2006, PETRI_DIFFERENCE_MINUEND_PLACES=990, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=995, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=995, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=2006, PETRI_PLACES=991, PETRI_TRANSITIONS=995} [2025-01-09 21:05:27,141 INFO L279 CegarLoopForPetriNet]: 1042 programPoint places, -51 predicate places. [2025-01-09 21:05:27,141 INFO L471 AbstractCegarLoop]: Abstraction has has 991 places, 995 transitions, 2006 flow [2025-01-09 21:05:27,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 975.0) internal successors, (1950), 2 states have internal predecessors, (1950), 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:27,142 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:05:27,142 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:27,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:05:27,143 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:05:27,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:05:27,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1868292551, now seen corresponding path program 1 times [2025-01-09 21:05:27,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:05:27,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153049006] [2025-01-09 21:05:27,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:05:27,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:05:27,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 667 statements into 1 equivalence classes. [2025-01-09 21:05:27,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 667 of 667 statements. [2025-01-09 21:05:27,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:05:27,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:05:27,492 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:27,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:05:27,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153049006] [2025-01-09 21:05:27,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153049006] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:05:27,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:05:27,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:05:27,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156156006] [2025-01-09 21:05:27,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:05:27,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:05:27,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:05:27,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:05:27,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:05:27,516 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 962 out of 1050 [2025-01-09 21:05:27,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 991 places, 995 transitions, 2006 flow. Second operand has 3 states, 3 states have (on average 963.3333333333334) internal successors, (2890), 3 states have internal predecessors, (2890), 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:27,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:05:27,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 962 of 1050 [2025-01-09 21:05:27,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:05:38,666 INFO L124 PetriNetUnfolderBase]: 9392/56089 cut-off events. [2025-01-09 21:05:38,667 INFO L125 PetriNetUnfolderBase]: For 718/718 co-relation queries the response was YES. [2025-01-09 21:05:39,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69296 conditions, 56089 events. 9392/56089 cut-off events. For 718/718 co-relation queries the response was YES. Maximal size of possible extension queue 1005. Compared 820079 event pairs, 2763 based on Foata normal form. 0/48618 useless extension candidates. Maximal degree in co-relation 69290. Up to 6318 conditions per place. [2025-01-09 21:05:39,290 INFO L140 encePairwiseOnDemand]: 1038/1050 looper letters, 65 selfloop transitions, 9 changer transitions 0/1030 dead transitions. [2025-01-09 21:05:39,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 993 places, 1030 transitions, 2234 flow [2025-01-09 21:05:39,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:05:39,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:05:39,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2963 transitions. [2025-01-09 21:05:39,296 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9406349206349206 [2025-01-09 21:05:39,296 INFO L175 Difference]: Start difference. First operand has 991 places, 995 transitions, 2006 flow. Second operand 3 states and 2963 transitions. [2025-01-09 21:05:39,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 993 places, 1030 transitions, 2234 flow [2025-01-09 21:05:39,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 993 places, 1030 transitions, 2234 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:05:39,311 INFO L231 Difference]: Finished difference. Result has 995 places, 1004 transitions, 2084 flow [2025-01-09 21:05:39,312 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1050, PETRI_DIFFERENCE_MINUEND_FLOW=2006, PETRI_DIFFERENCE_MINUEND_PLACES=991, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=995, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=986, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2084, PETRI_PLACES=995, PETRI_TRANSITIONS=1004} [2025-01-09 21:05:39,313 INFO L279 CegarLoopForPetriNet]: 1042 programPoint places, -47 predicate places. [2025-01-09 21:05:39,313 INFO L471 AbstractCegarLoop]: Abstraction has has 995 places, 1004 transitions, 2084 flow [2025-01-09 21:05:39,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 963.3333333333334) internal successors, (2890), 3 states have internal predecessors, (2890), 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:39,315 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:05:39,315 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] [2025-01-09 21:05:39,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:05:39,315 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:05:39,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:05:39,317 INFO L85 PathProgramCache]: Analyzing trace with hash 897654252, now seen corresponding path program 1 times [2025-01-09 21:05:39,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:05:39,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461147526] [2025-01-09 21:05:39,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:05:39,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:05:39,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 674 statements into 1 equivalence classes. [2025-01-09 21:05:39,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 674 of 674 statements. [2025-01-09 21:05:39,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:05:39,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:05:39,590 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:39,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:05:39,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461147526] [2025-01-09 21:05:39,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461147526] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:05:39,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:05:39,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:05:39,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25969359] [2025-01-09 21:05:39,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:05:39,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:05:39,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:05:39,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:05:39,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:05:39,632 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 959 out of 1050 [2025-01-09 21:05:39,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 995 places, 1004 transitions, 2084 flow. Second operand has 3 states, 3 states have (on average 961.0) internal successors, (2883), 3 states have internal predecessors, (2883), 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:39,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:05:39,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 959 of 1050 [2025-01-09 21:05:39,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:05:42,315 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4121] L766-->L766-3: Formula: (let ((.cse4 (select |v_#race_731| |v_~#m2~0.base_21|))) (let ((.cse2 (+ |v_~#m2~0.offset_21| 2)) (.cse1 (+ |v_~#m2~0.offset_21| 1)) (.cse5 (select |v_#memory_int_425| |v_~#m2~0.base_21|)) (.cse0 (select .cse4 |v_~#m2~0.offset_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 3))) (and (= |v_#race_731| (store |v_#race_733| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_733| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0))) (= .cse0 (select .cse4 .cse2)) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_21|) 1) 1 0) 0)) (= (select .cse4 .cse1) .cse0) (= |v_#memory_int_424| (store |v_#memory_int_425| |v_~#m2~0.base_21| (store .cse5 |v_~#m2~0.offset_21| 0))) (= .cse0 (select .cse4 .cse3))))) InVars {#race=|v_#race_733|, #memory_int=|v_#memory_int_425|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_731|, 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_424|, ~#m2~0.base=|v_~#m2~0.base_21|, 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_21|, 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][760], [1039#true, 146#L766-3true, 652#L766-3true, 1047#true, 1045#true, 1052#true, 1041#true, Black: 1049#(= |#race~state~0| 0), 498#L716true, 754#L775-4true, 1043#true]) [2025-01-09 21:05:42,316 INFO L294 olderBase$Statistics]: this new event has 727 ancestors and is cut-off event [2025-01-09 21:05:42,316 INFO L297 olderBase$Statistics]: existing Event has 716 ancestors and is cut-off event [2025-01-09 21:05:42,316 INFO L297 olderBase$Statistics]: existing Event has 716 ancestors and is cut-off event [2025-01-09 21:05:42,316 INFO L297 olderBase$Statistics]: existing Event has 727 ancestors and is cut-off event [2025-01-09 21:05:42,439 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4121] L766-->L766-3: Formula: (let ((.cse4 (select |v_#race_731| |v_~#m2~0.base_21|))) (let ((.cse2 (+ |v_~#m2~0.offset_21| 2)) (.cse1 (+ |v_~#m2~0.offset_21| 1)) (.cse5 (select |v_#memory_int_425| |v_~#m2~0.base_21|)) (.cse0 (select .cse4 |v_~#m2~0.offset_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 3))) (and (= |v_#race_731| (store |v_#race_733| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_733| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0))) (= .cse0 (select .cse4 .cse2)) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_21|) 1) 1 0) 0)) (= (select .cse4 .cse1) .cse0) (= |v_#memory_int_424| (store |v_#memory_int_425| |v_~#m2~0.base_21| (store .cse5 |v_~#m2~0.offset_21| 0))) (= .cse0 (select .cse4 .cse3))))) InVars {#race=|v_#race_733|, #memory_int=|v_#memory_int_425|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_731|, 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_424|, ~#m2~0.base=|v_~#m2~0.base_21|, 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_21|, 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][760], [1039#true, 146#L766-3true, 652#L766-3true, 1047#true, 1045#true, 1052#true, 1041#true, 384#L764true, Black: 1049#(= |#race~state~0| 0), 754#L775-4true, 1043#true]) [2025-01-09 21:05:42,439 INFO L294 olderBase$Statistics]: this new event has 728 ancestors and is cut-off event [2025-01-09 21:05:42,439 INFO L297 olderBase$Statistics]: existing Event has 728 ancestors and is cut-off event [2025-01-09 21:05:42,439 INFO L297 olderBase$Statistics]: existing Event has 717 ancestors and is cut-off event [2025-01-09 21:05:42,439 INFO L297 olderBase$Statistics]: existing Event has 717 ancestors and is cut-off event [2025-01-09 21:05:44,976 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4121] L766-->L766-3: Formula: (let ((.cse4 (select |v_#race_731| |v_~#m2~0.base_21|))) (let ((.cse2 (+ |v_~#m2~0.offset_21| 2)) (.cse1 (+ |v_~#m2~0.offset_21| 1)) (.cse5 (select |v_#memory_int_425| |v_~#m2~0.base_21|)) (.cse0 (select .cse4 |v_~#m2~0.offset_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 3))) (and (= |v_#race_731| (store |v_#race_733| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_733| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0))) (= .cse0 (select .cse4 .cse2)) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_21|) 1) 1 0) 0)) (= (select .cse4 .cse1) .cse0) (= |v_#memory_int_424| (store |v_#memory_int_425| |v_~#m2~0.base_21| (store .cse5 |v_~#m2~0.offset_21| 0))) (= .cse0 (select .cse4 .cse3))))) InVars {#race=|v_#race_733|, #memory_int=|v_#memory_int_425|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_731|, 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_424|, ~#m2~0.base=|v_~#m2~0.base_21|, 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_21|, 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][760], [1039#true, 652#L766-3true, 1047#true, 1045#true, 1052#true, 1041#true, 714#L705-3true, Black: 1049#(= |#race~state~0| 0), 498#L716true, 754#L775-4true, 1043#true]) [2025-01-09 21:05:44,977 INFO L294 olderBase$Statistics]: this new event has 743 ancestors and is cut-off event [2025-01-09 21:05:44,977 INFO L297 olderBase$Statistics]: existing Event has 743 ancestors and is cut-off event [2025-01-09 21:05:44,977 INFO L297 olderBase$Statistics]: existing Event has 732 ancestors and is cut-off event [2025-01-09 21:05:44,977 INFO L297 olderBase$Statistics]: existing Event has 732 ancestors and is cut-off event [2025-01-09 21:05:45,317 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4121] L766-->L766-3: Formula: (let ((.cse4 (select |v_#race_731| |v_~#m2~0.base_21|))) (let ((.cse2 (+ |v_~#m2~0.offset_21| 2)) (.cse1 (+ |v_~#m2~0.offset_21| 1)) (.cse5 (select |v_#memory_int_425| |v_~#m2~0.base_21|)) (.cse0 (select .cse4 |v_~#m2~0.offset_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 3))) (and (= |v_#race_731| (store |v_#race_733| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_733| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0))) (= .cse0 (select .cse4 .cse2)) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_21|) 1) 1 0) 0)) (= (select .cse4 .cse1) .cse0) (= |v_#memory_int_424| (store |v_#memory_int_425| |v_~#m2~0.base_21| (store .cse5 |v_~#m2~0.offset_21| 0))) (= .cse0 (select .cse4 .cse3))))) InVars {#race=|v_#race_733|, #memory_int=|v_#memory_int_425|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_731|, 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_424|, ~#m2~0.base=|v_~#m2~0.base_21|, 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_21|, 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][760], [1039#true, 652#L766-3true, 1047#true, 1045#true, 1052#true, 1041#true, 714#L705-3true, 384#L764true, Black: 1049#(= |#race~state~0| 0), 754#L775-4true, 1043#true]) [2025-01-09 21:05:45,317 INFO L294 olderBase$Statistics]: this new event has 744 ancestors and is cut-off event [2025-01-09 21:05:45,317 INFO L297 olderBase$Statistics]: existing Event has 733 ancestors and is cut-off event [2025-01-09 21:05:45,317 INFO L297 olderBase$Statistics]: existing Event has 744 ancestors and is cut-off event [2025-01-09 21:05:45,317 INFO L297 olderBase$Statistics]: existing Event has 733 ancestors and is cut-off event [2025-01-09 21:05:46,136 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4121] L766-->L766-3: Formula: (let ((.cse4 (select |v_#race_731| |v_~#m2~0.base_21|))) (let ((.cse2 (+ |v_~#m2~0.offset_21| 2)) (.cse1 (+ |v_~#m2~0.offset_21| 1)) (.cse5 (select |v_#memory_int_425| |v_~#m2~0.base_21|)) (.cse0 (select .cse4 |v_~#m2~0.offset_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 3))) (and (= |v_#race_731| (store |v_#race_733| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_733| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0))) (= .cse0 (select .cse4 .cse2)) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_21|) 1) 1 0) 0)) (= (select .cse4 .cse1) .cse0) (= |v_#memory_int_424| (store |v_#memory_int_425| |v_~#m2~0.base_21| (store .cse5 |v_~#m2~0.offset_21| 0))) (= .cse0 (select .cse4 .cse3))))) InVars {#race=|v_#race_733|, #memory_int=|v_#memory_int_425|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_731|, 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_424|, ~#m2~0.base=|v_~#m2~0.base_21|, 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_21|, 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][760], [1039#true, 652#L766-3true, 1047#true, 1045#true, 1052#true, 1041#true, Black: 1049#(= |#race~state~0| 0), 498#L716true, 754#L775-4true, 1043#true, 921#L707-3true]) [2025-01-09 21:05:46,136 INFO L294 olderBase$Statistics]: this new event has 747 ancestors and is cut-off event [2025-01-09 21:05:46,136 INFO L297 olderBase$Statistics]: existing Event has 736 ancestors and is cut-off event [2025-01-09 21:05:46,136 INFO L297 olderBase$Statistics]: existing Event has 736 ancestors and is cut-off event [2025-01-09 21:05:46,136 INFO L297 olderBase$Statistics]: existing Event has 747 ancestors and is cut-off event [2025-01-09 21:05:46,429 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4121] L766-->L766-3: Formula: (let ((.cse4 (select |v_#race_731| |v_~#m2~0.base_21|))) (let ((.cse2 (+ |v_~#m2~0.offset_21| 2)) (.cse1 (+ |v_~#m2~0.offset_21| 1)) (.cse5 (select |v_#memory_int_425| |v_~#m2~0.base_21|)) (.cse0 (select .cse4 |v_~#m2~0.offset_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 3))) (and (= |v_#race_731| (store |v_#race_733| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_733| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0))) (= .cse0 (select .cse4 .cse2)) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_21|) 1) 1 0) 0)) (= (select .cse4 .cse1) .cse0) (= |v_#memory_int_424| (store |v_#memory_int_425| |v_~#m2~0.base_21| (store .cse5 |v_~#m2~0.offset_21| 0))) (= .cse0 (select .cse4 .cse3))))) InVars {#race=|v_#race_733|, #memory_int=|v_#memory_int_425|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_731|, 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_424|, ~#m2~0.base=|v_~#m2~0.base_21|, 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_21|, 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][760], [1039#true, 652#L766-3true, 1047#true, 1045#true, 1052#true, 1041#true, 384#L764true, Black: 1049#(= |#race~state~0| 0), 754#L775-4true, 1043#true, 921#L707-3true]) [2025-01-09 21:05:46,430 INFO L294 olderBase$Statistics]: this new event has 748 ancestors and is cut-off event [2025-01-09 21:05:46,430 INFO L297 olderBase$Statistics]: existing Event has 748 ancestors and is cut-off event [2025-01-09 21:05:46,430 INFO L297 olderBase$Statistics]: existing Event has 737 ancestors and is cut-off event [2025-01-09 21:05:46,430 INFO L297 olderBase$Statistics]: existing Event has 737 ancestors and is cut-off event [2025-01-09 21:05:49,313 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4121] L766-->L766-3: Formula: (let ((.cse4 (select |v_#race_731| |v_~#m2~0.base_21|))) (let ((.cse2 (+ |v_~#m2~0.offset_21| 2)) (.cse1 (+ |v_~#m2~0.offset_21| 1)) (.cse5 (select |v_#memory_int_425| |v_~#m2~0.base_21|)) (.cse0 (select .cse4 |v_~#m2~0.offset_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 3))) (and (= |v_#race_731| (store |v_#race_733| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_733| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0))) (= .cse0 (select .cse4 .cse2)) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_21|) 1) 1 0) 0)) (= (select .cse4 .cse1) .cse0) (= |v_#memory_int_424| (store |v_#memory_int_425| |v_~#m2~0.base_21| (store .cse5 |v_~#m2~0.offset_21| 0))) (= .cse0 (select .cse4 .cse3))))) InVars {#race=|v_#race_733|, #memory_int=|v_#memory_int_425|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_731|, 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_424|, ~#m2~0.base=|v_~#m2~0.base_21|, 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_21|, 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][760], [1039#true, 652#L766-3true, 1047#true, 1045#true, 1052#true, 1041#true, 415#L732-3true, Black: 1049#(= |#race~state~0| 0), 498#L716true, 754#L775-4true, 1043#true]) [2025-01-09 21:05:49,313 INFO L294 olderBase$Statistics]: this new event has 761 ancestors and is cut-off event [2025-01-09 21:05:49,313 INFO L297 olderBase$Statistics]: existing Event has 750 ancestors and is cut-off event [2025-01-09 21:05:49,313 INFO L297 olderBase$Statistics]: existing Event has 750 ancestors and is cut-off event [2025-01-09 21:05:49,313 INFO L297 olderBase$Statistics]: existing Event has 761 ancestors and is cut-off event [2025-01-09 21:05:49,480 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4121] L766-->L766-3: Formula: (let ((.cse4 (select |v_#race_731| |v_~#m2~0.base_21|))) (let ((.cse2 (+ |v_~#m2~0.offset_21| 2)) (.cse1 (+ |v_~#m2~0.offset_21| 1)) (.cse5 (select |v_#memory_int_425| |v_~#m2~0.base_21|)) (.cse0 (select .cse4 |v_~#m2~0.offset_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 3))) (and (= |v_#race_731| (store |v_#race_733| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_733| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0))) (= .cse0 (select .cse4 .cse2)) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_21|) 1) 1 0) 0)) (= (select .cse4 .cse1) .cse0) (= |v_#memory_int_424| (store |v_#memory_int_425| |v_~#m2~0.base_21| (store .cse5 |v_~#m2~0.offset_21| 0))) (= .cse0 (select .cse4 .cse3))))) InVars {#race=|v_#race_733|, #memory_int=|v_#memory_int_425|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_731|, 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_424|, ~#m2~0.base=|v_~#m2~0.base_21|, 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_21|, 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][760], [1039#true, 652#L766-3true, 1047#true, 1045#true, 1052#true, 1041#true, 384#L764true, 415#L732-3true, Black: 1049#(= |#race~state~0| 0), 754#L775-4true, 1043#true]) [2025-01-09 21:05:49,480 INFO L294 olderBase$Statistics]: this new event has 762 ancestors and is cut-off event [2025-01-09 21:05:49,480 INFO L297 olderBase$Statistics]: existing Event has 762 ancestors and is cut-off event [2025-01-09 21:05:49,480 INFO L297 olderBase$Statistics]: existing Event has 751 ancestors and is cut-off event [2025-01-09 21:05:49,480 INFO L297 olderBase$Statistics]: existing Event has 751 ancestors and is cut-off event [2025-01-09 21:05:49,481 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4121] L766-->L766-3: Formula: (let ((.cse4 (select |v_#race_731| |v_~#m2~0.base_21|))) (let ((.cse2 (+ |v_~#m2~0.offset_21| 2)) (.cse1 (+ |v_~#m2~0.offset_21| 1)) (.cse5 (select |v_#memory_int_425| |v_~#m2~0.base_21|)) (.cse0 (select .cse4 |v_~#m2~0.offset_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 3))) (and (= |v_#race_731| (store |v_#race_733| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_733| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0))) (= .cse0 (select .cse4 .cse2)) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_21|) 1) 1 0) 0)) (= (select .cse4 .cse1) .cse0) (= |v_#memory_int_424| (store |v_#memory_int_425| |v_~#m2~0.base_21| (store .cse5 |v_~#m2~0.offset_21| 0))) (= .cse0 (select .cse4 .cse3))))) InVars {#race=|v_#race_733|, #memory_int=|v_#memory_int_425|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_731|, 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_424|, ~#m2~0.base=|v_~#m2~0.base_21|, 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_21|, 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][760], [1039#true, 652#L766-3true, 1047#true, 1045#true, 1052#true, 1041#true, 304#L733true, Black: 1049#(= |#race~state~0| 0), 498#L716true, 754#L775-4true, 1043#true]) [2025-01-09 21:05:49,481 INFO L294 olderBase$Statistics]: this new event has 762 ancestors and is cut-off event [2025-01-09 21:05:49,482 INFO L297 olderBase$Statistics]: existing Event has 751 ancestors and is cut-off event [2025-01-09 21:05:49,482 INFO L297 olderBase$Statistics]: existing Event has 751 ancestors and is cut-off event [2025-01-09 21:05:49,482 INFO L297 olderBase$Statistics]: existing Event has 762 ancestors and is cut-off event [2025-01-09 21:05:49,873 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4121] L766-->L766-3: Formula: (let ((.cse4 (select |v_#race_731| |v_~#m2~0.base_21|))) (let ((.cse2 (+ |v_~#m2~0.offset_21| 2)) (.cse1 (+ |v_~#m2~0.offset_21| 1)) (.cse5 (select |v_#memory_int_425| |v_~#m2~0.base_21|)) (.cse0 (select .cse4 |v_~#m2~0.offset_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 3))) (and (= |v_#race_731| (store |v_#race_733| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_733| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0))) (= .cse0 (select .cse4 .cse2)) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_21|) 1) 1 0) 0)) (= (select .cse4 .cse1) .cse0) (= |v_#memory_int_424| (store |v_#memory_int_425| |v_~#m2~0.base_21| (store .cse5 |v_~#m2~0.offset_21| 0))) (= .cse0 (select .cse4 .cse3))))) InVars {#race=|v_#race_733|, #memory_int=|v_#memory_int_425|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_731|, 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_424|, ~#m2~0.base=|v_~#m2~0.base_21|, 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_21|, 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][760], [1039#true, 652#L766-3true, 1047#true, 1045#true, 1052#true, 304#L733true, 1041#true, 384#L764true, Black: 1049#(= |#race~state~0| 0), 754#L775-4true, 1043#true]) [2025-01-09 21:05:49,873 INFO L294 olderBase$Statistics]: this new event has 763 ancestors and is cut-off event [2025-01-09 21:05:49,874 INFO L297 olderBase$Statistics]: existing Event has 763 ancestors and is cut-off event [2025-01-09 21:05:49,874 INFO L297 olderBase$Statistics]: existing Event has 752 ancestors and is cut-off event [2025-01-09 21:05:49,874 INFO L297 olderBase$Statistics]: existing Event has 752 ancestors and is cut-off event [2025-01-09 21:05:51,731 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4121] L766-->L766-3: Formula: (let ((.cse4 (select |v_#race_731| |v_~#m2~0.base_21|))) (let ((.cse2 (+ |v_~#m2~0.offset_21| 2)) (.cse1 (+ |v_~#m2~0.offset_21| 1)) (.cse5 (select |v_#memory_int_425| |v_~#m2~0.base_21|)) (.cse0 (select .cse4 |v_~#m2~0.offset_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 3))) (and (= |v_#race_731| (store |v_#race_733| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_733| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0))) (= .cse0 (select .cse4 .cse2)) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_21|) 1) 1 0) 0)) (= (select .cse4 .cse1) .cse0) (= |v_#memory_int_424| (store |v_#memory_int_425| |v_~#m2~0.base_21| (store .cse5 |v_~#m2~0.offset_21| 0))) (= .cse0 (select .cse4 .cse3))))) InVars {#race=|v_#race_733|, #memory_int=|v_#memory_int_425|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_731|, 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_424|, ~#m2~0.base=|v_~#m2~0.base_21|, 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_21|, 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][760], [1039#true, 652#L766-3true, 1047#true, 1045#true, 1052#true, 1041#true, Black: 1049#(= |#race~state~0| 0), 498#L716true, 459#L735-3true, 754#L775-4true, 1043#true]) [2025-01-09 21:05:51,731 INFO L294 olderBase$Statistics]: this new event has 772 ancestors and is cut-off event [2025-01-09 21:05:51,731 INFO L297 olderBase$Statistics]: existing Event has 761 ancestors and is cut-off event [2025-01-09 21:05:51,731 INFO L297 olderBase$Statistics]: existing Event has 761 ancestors and is cut-off event [2025-01-09 21:05:51,731 INFO L297 olderBase$Statistics]: existing Event has 772 ancestors and is cut-off event [2025-01-09 21:05:51,977 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4121] L766-->L766-3: Formula: (let ((.cse4 (select |v_#race_731| |v_~#m2~0.base_21|))) (let ((.cse2 (+ |v_~#m2~0.offset_21| 2)) (.cse1 (+ |v_~#m2~0.offset_21| 1)) (.cse5 (select |v_#memory_int_425| |v_~#m2~0.base_21|)) (.cse0 (select .cse4 |v_~#m2~0.offset_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 3))) (and (= |v_#race_731| (store |v_#race_733| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_733| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0))) (= .cse0 (select .cse4 .cse2)) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_21|) 1) 1 0) 0)) (= (select .cse4 .cse1) .cse0) (= |v_#memory_int_424| (store |v_#memory_int_425| |v_~#m2~0.base_21| (store .cse5 |v_~#m2~0.offset_21| 0))) (= .cse0 (select .cse4 .cse3))))) InVars {#race=|v_#race_733|, #memory_int=|v_#memory_int_425|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_731|, 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_424|, ~#m2~0.base=|v_~#m2~0.base_21|, 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_21|, 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][760], [1039#true, 652#L766-3true, 1047#true, 1045#true, 1052#true, 1041#true, 384#L764true, Black: 1049#(= |#race~state~0| 0), 459#L735-3true, 754#L775-4true, 1043#true]) [2025-01-09 21:05:51,977 INFO L294 olderBase$Statistics]: this new event has 773 ancestors and is cut-off event [2025-01-09 21:05:51,977 INFO L297 olderBase$Statistics]: existing Event has 762 ancestors and is cut-off event [2025-01-09 21:05:51,977 INFO L297 olderBase$Statistics]: existing Event has 773 ancestors and is cut-off event [2025-01-09 21:05:51,977 INFO L297 olderBase$Statistics]: existing Event has 762 ancestors and is cut-off event [2025-01-09 21:05:52,478 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4121] L766-->L766-3: Formula: (let ((.cse4 (select |v_#race_731| |v_~#m2~0.base_21|))) (let ((.cse2 (+ |v_~#m2~0.offset_21| 2)) (.cse1 (+ |v_~#m2~0.offset_21| 1)) (.cse5 (select |v_#memory_int_425| |v_~#m2~0.base_21|)) (.cse0 (select .cse4 |v_~#m2~0.offset_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 3))) (and (= |v_#race_731| (store |v_#race_733| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_733| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0))) (= .cse0 (select .cse4 .cse2)) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_21|) 1) 1 0) 0)) (= (select .cse4 .cse1) .cse0) (= |v_#memory_int_424| (store |v_#memory_int_425| |v_~#m2~0.base_21| (store .cse5 |v_~#m2~0.offset_21| 0))) (= .cse0 (select .cse4 .cse3))))) InVars {#race=|v_#race_733|, #memory_int=|v_#memory_int_425|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_731|, 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_424|, ~#m2~0.base=|v_~#m2~0.base_21|, 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_21|, 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][760], [1039#true, 652#L766-3true, 721#L736-3true, 1047#true, 1045#true, 1052#true, 1041#true, Black: 1049#(= |#race~state~0| 0), 498#L716true, 754#L775-4true, 1043#true]) [2025-01-09 21:05:52,479 INFO L294 olderBase$Statistics]: this new event has 775 ancestors and is cut-off event [2025-01-09 21:05:52,479 INFO L297 olderBase$Statistics]: existing Event has 764 ancestors and is cut-off event [2025-01-09 21:05:52,479 INFO L297 olderBase$Statistics]: existing Event has 775 ancestors and is cut-off event [2025-01-09 21:05:52,479 INFO L297 olderBase$Statistics]: existing Event has 764 ancestors and is cut-off event [2025-01-09 21:05:52,849 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([4121] L766-->L766-3: Formula: (let ((.cse4 (select |v_#race_731| |v_~#m2~0.base_21|))) (let ((.cse2 (+ |v_~#m2~0.offset_21| 2)) (.cse1 (+ |v_~#m2~0.offset_21| 1)) (.cse5 (select |v_#memory_int_425| |v_~#m2~0.base_21|)) (.cse0 (select .cse4 |v_~#m2~0.offset_21|)) (.cse3 (+ |v_~#m2~0.offset_21| 3))) (and (= |v_#race_731| (store |v_#race_733| |v_~#m2~0.base_21| (store (store (store (store (select |v_#race_733| |v_~#m2~0.base_21|) |v_~#m2~0.offset_21| .cse0) .cse1 .cse0) .cse2 .cse0) .cse3 .cse0))) (= .cse0 (select .cse4 .cse2)) (not (= (ite (= (select .cse5 |v_~#m2~0.offset_21|) 1) 1 0) 0)) (= (select .cse4 .cse1) .cse0) (= |v_#memory_int_424| (store |v_#memory_int_425| |v_~#m2~0.base_21| (store .cse5 |v_~#m2~0.offset_21| 0))) (= .cse0 (select .cse4 .cse3))))) InVars {#race=|v_#race_733|, #memory_int=|v_#memory_int_425|, ~#m2~0.base=|v_~#m2~0.base_21|, ~#m2~0.offset=|v_~#m2~0.offset_21|} OutVars{#race=|v_#race_731|, 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_424|, ~#m2~0.base=|v_~#m2~0.base_21|, 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_21|, 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][760], [1039#true, 652#L766-3true, 721#L736-3true, 1047#true, 1045#true, 1052#true, 1041#true, 384#L764true, Black: 1049#(= |#race~state~0| 0), 754#L775-4true, 1043#true]) [2025-01-09 21:05:52,850 INFO L294 olderBase$Statistics]: this new event has 776 ancestors and is cut-off event [2025-01-09 21:05:52,850 INFO L297 olderBase$Statistics]: existing Event has 765 ancestors and is cut-off event [2025-01-09 21:05:52,850 INFO L297 olderBase$Statistics]: existing Event has 776 ancestors and is cut-off event [2025-01-09 21:05:52,850 INFO L297 olderBase$Statistics]: existing Event has 765 ancestors and is cut-off event