./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs-pthread.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs-pthread.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 801883caffd8b582a36607f9ec62109ac5c5dc10c811693a281fb396b4b60131 --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:20:41,145 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:20:41,204 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-14 01:20:41,210 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:20:41,210 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:20:41,230 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:20:41,231 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:20:41,231 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:20:41,232 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:20:41,232 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:20:41,233 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:20:41,233 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:20:41,233 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:20:41,233 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:20:41,233 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:20:41,233 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:20:41,233 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:20:41,233 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:20:41,234 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:20:41,234 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:20:41,234 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:20:41,234 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:20:41,234 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:20:41,234 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:20:41,234 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:20:41,234 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:20:41,235 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:20:41,235 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:20:41,235 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:20:41,235 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:20:41,235 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:20:41,235 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:20:41,235 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:20:41,235 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:20:41,235 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:20:41,235 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:20:41,236 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:20:41,236 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:20:41,236 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:20:41,236 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:20:41,236 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:20:41,236 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:20:41,236 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 801883caffd8b582a36607f9ec62109ac5c5dc10c811693a281fb396b4b60131 [2025-03-14 01:20:41,458 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:20:41,463 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:20:41,466 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:20:41,467 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:20:41,467 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:20:41,468 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs-pthread.i [2025-03-14 01:20:42,658 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2850e7e74/47a5ed9a5600413cb969b9e0b553f81e/FLAGfd93af97d [2025-03-14 01:20:42,938 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:20:42,939 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs-pthread.i [2025-03-14 01:20:42,952 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2850e7e74/47a5ed9a5600413cb969b9e0b553f81e/FLAGfd93af97d [2025-03-14 01:20:42,965 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2850e7e74/47a5ed9a5600413cb969b9e0b553f81e [2025-03-14 01:20:42,967 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:20:42,969 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:20:42,970 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:20:42,970 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:20:42,974 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:20:42,974 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:20:42" (1/1) ... [2025-03-14 01:20:42,975 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d24e16e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:20:42, skipping insertion in model container [2025-03-14 01:20:42,975 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:20:42" (1/1) ... [2025-03-14 01:20:43,000 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:20:43,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:20:43,263 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:20:43,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:20:43,321 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:20:43,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:20:43 WrapperNode [2025-03-14 01:20:43,321 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:20:43,322 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:20:43,322 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:20:43,322 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:20:43,327 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:20:43" (1/1) ... [2025-03-14 01:20:43,336 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:20:43" (1/1) ... [2025-03-14 01:20:43,350 INFO L138 Inliner]: procedures = 164, calls = 17, calls flagged for inlining = 4, calls inlined = 5, statements flattened = 86 [2025-03-14 01:20:43,350 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:20:43,351 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:20:43,351 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:20:43,351 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:20:43,356 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:20:43" (1/1) ... [2025-03-14 01:20:43,357 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:20:43" (1/1) ... [2025-03-14 01:20:43,358 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:20:43" (1/1) ... [2025-03-14 01:20:43,359 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:20:43" (1/1) ... [2025-03-14 01:20:43,362 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:20:43" (1/1) ... [2025-03-14 01:20:43,366 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:20:43" (1/1) ... [2025-03-14 01:20:43,367 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:20:43" (1/1) ... [2025-03-14 01:20:43,368 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:20:43" (1/1) ... [2025-03-14 01:20:43,369 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:20:43,370 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:20:43,370 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:20:43,370 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:20:43,371 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:20:43" (1/1) ... [2025-03-14 01:20:43,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:20:43,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:20:43,396 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-14 01:20:43,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-14 01:20:43,417 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-14 01:20:43,417 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-14 01:20:43,417 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-14 01:20:43,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:20:43,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:20:43,417 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-14 01:20:43,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:20:43,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:20:43,418 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:20:43,505 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:20:43,506 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:20:43,664 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:20:43,664 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:20:43,665 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:20:43,694 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:20:43,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:20:43 BoogieIcfgContainer [2025-03-14 01:20:43,697 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:20:43,699 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:20:43,699 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:20:43,703 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:20:43,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:20:42" (1/3) ... [2025-03-14 01:20:43,704 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59b7cda2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:20:43, skipping insertion in model container [2025-03-14 01:20:43,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:20:43" (2/3) ... [2025-03-14 01:20:43,705 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59b7cda2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:20:43, skipping insertion in model container [2025-03-14 01:20:43,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:20:43" (3/3) ... [2025-03-14 01:20:43,706 INFO L128 eAbstractionObserver]: Analyzing ICFG 48_ticket_lock_low_contention_vs-pthread.i [2025-03-14 01:20:43,719 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:20:43,720 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 48_ticket_lock_low_contention_vs-pthread.i that has 2 procedures, 94 locations, 1 initial locations, 1 loop locations, and 6 error locations. [2025-03-14 01:20:43,720 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:20:43,768 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 01:20:43,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 99 transitions, 202 flow [2025-03-14 01:20:43,857 INFO L124 PetriNetUnfolderBase]: 8/149 cut-off events. [2025-03-14 01:20:43,860 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:20:43,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 149 events. 8/149 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 363 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 80. Up to 4 conditions per place. [2025-03-14 01:20:43,865 INFO L82 GeneralOperation]: Start removeDead. Operand has 97 places, 99 transitions, 202 flow [2025-03-14 01:20:43,869 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 99 transitions, 202 flow [2025-03-14 01:20:43,877 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:20:43,888 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;@e484c0c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:20:43,889 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-14 01:20:43,901 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:20:43,901 INFO L124 PetriNetUnfolderBase]: 2/49 cut-off events. [2025-03-14 01:20:43,901 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:20:43,902 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:20:43,902 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] [2025-03-14 01:20:43,903 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-14 01:20:43,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:20:43,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1364451182, now seen corresponding path program 1 times [2025-03-14 01:20:43,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:20:43,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721281326] [2025-03-14 01:20:43,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:20:43,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:20:43,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-14 01:20:43,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-14 01:20:43,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:20:43,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:20:44,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:20:44,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:20:44,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721281326] [2025-03-14 01:20:44,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721281326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:20:44,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:20:44,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:20:44,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737855630] [2025-03-14 01:20:44,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:20:44,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-14 01:20:44,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:20:44,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-14 01:20:44,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-14 01:20:44,077 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 99 [2025-03-14 01:20:44,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 99 transitions, 202 flow. Second operand has 2 states, 2 states have (on average 88.0) internal successors, (176), 2 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:20:44,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:20:44,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 99 [2025-03-14 01:20:44,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:20:44,147 INFO L124 PetriNetUnfolderBase]: 4/189 cut-off events. [2025-03-14 01:20:44,147 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:20:44,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 209 conditions, 189 events. 4/189 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 556 event pairs, 4 based on Foata normal form. 16/181 useless extension candidates. Maximal degree in co-relation 137. Up to 16 conditions per place. [2025-03-14 01:20:44,153 INFO L140 encePairwiseOnDemand]: 94/99 looper letters, 5 selfloop transitions, 0 changer transitions 0/90 dead transitions. [2025-03-14 01:20:44,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 90 transitions, 194 flow [2025-03-14 01:20:44,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-14 01:20:44,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-14 01:20:44,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 184 transitions. [2025-03-14 01:20:44,169 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9292929292929293 [2025-03-14 01:20:44,170 INFO L175 Difference]: Start difference. First operand has 97 places, 99 transitions, 202 flow. Second operand 2 states and 184 transitions. [2025-03-14 01:20:44,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 90 transitions, 194 flow [2025-03-14 01:20:44,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 90 transitions, 194 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:20:44,191 INFO L231 Difference]: Finished difference. Result has 94 places, 90 transitions, 184 flow [2025-03-14 01:20:44,193 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=184, PETRI_PLACES=94, PETRI_TRANSITIONS=90} [2025-03-14 01:20:44,196 INFO L279 CegarLoopForPetriNet]: 97 programPoint places, -3 predicate places. [2025-03-14 01:20:44,197 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 90 transitions, 184 flow [2025-03-14 01:20:44,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 88.0) internal successors, (176), 2 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:20:44,198 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:20:44,198 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:20:44,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:20:44,199 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-14 01:20:44,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:20:44,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1284076147, now seen corresponding path program 1 times [2025-03-14 01:20:44,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:20:44,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383073823] [2025-03-14 01:20:44,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:20:44,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:20:44,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-14 01:20:44,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 01:20:44,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:20:44,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:20:44,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:20:44,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:20:44,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383073823] [2025-03-14 01:20:44,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383073823] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:20:44,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:20:44,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:20:44,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766830808] [2025-03-14 01:20:44,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:20:44,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:20:44,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:20:44,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:20:44,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:20:44,318 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 99 [2025-03-14 01:20:44,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 90 transitions, 184 flow. Second operand has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:20:44,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:20:44,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 99 [2025-03-14 01:20:44,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:20:44,403 INFO L124 PetriNetUnfolderBase]: 59/448 cut-off events. [2025-03-14 01:20:44,403 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:20:44,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 601 conditions, 448 events. 59/448 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2377 event pairs, 41 based on Foata normal form. 0/386 useless extension candidates. Maximal degree in co-relation 597. Up to 126 conditions per place. [2025-03-14 01:20:44,407 INFO L140 encePairwiseOnDemand]: 92/99 looper letters, 18 selfloop transitions, 6 changer transitions 0/97 dead transitions. [2025-03-14 01:20:44,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 97 transitions, 246 flow [2025-03-14 01:20:44,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:20:44,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:20:44,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 250 transitions. [2025-03-14 01:20:44,411 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8417508417508418 [2025-03-14 01:20:44,411 INFO L175 Difference]: Start difference. First operand has 94 places, 90 transitions, 184 flow. Second operand 3 states and 250 transitions. [2025-03-14 01:20:44,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 97 transitions, 246 flow [2025-03-14 01:20:44,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 97 transitions, 246 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:20:44,415 INFO L231 Difference]: Finished difference. Result has 98 places, 95 transitions, 230 flow [2025-03-14 01:20:44,415 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=230, PETRI_PLACES=98, PETRI_TRANSITIONS=95} [2025-03-14 01:20:44,416 INFO L279 CegarLoopForPetriNet]: 97 programPoint places, 1 predicate places. [2025-03-14 01:20:44,416 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 95 transitions, 230 flow [2025-03-14 01:20:44,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:20:44,417 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:20:44,417 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] [2025-03-14 01:20:44,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:20:44,417 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-14 01:20:44,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:20:44,419 INFO L85 PathProgramCache]: Analyzing trace with hash 195048, now seen corresponding path program 1 times [2025-03-14 01:20:44,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:20:44,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816620433] [2025-03-14 01:20:44,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:20:44,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:20:44,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-14 01:20:44,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-14 01:20:44,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:20:44,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:20:44,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:20:44,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:20:44,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816620433] [2025-03-14 01:20:44,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816620433] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:20:44,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:20:44,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:20:44,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183703697] [2025-03-14 01:20:44,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:20:44,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:20:44,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:20:44,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:20:44,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:20:44,513 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 99 [2025-03-14 01:20:44,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 95 transitions, 230 flow. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:20:44,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:20:44,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 99 [2025-03-14 01:20:44,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:20:44,559 INFO L124 PetriNetUnfolderBase]: 64/427 cut-off events. [2025-03-14 01:20:44,559 INFO L125 PetriNetUnfolderBase]: For 46/48 co-relation queries the response was YES. [2025-03-14 01:20:44,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 673 conditions, 427 events. 64/427 cut-off events. For 46/48 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2326 event pairs, 32 based on Foata normal form. 0/372 useless extension candidates. Maximal degree in co-relation 667. Up to 119 conditions per place. [2025-03-14 01:20:44,562 INFO L140 encePairwiseOnDemand]: 92/99 looper letters, 18 selfloop transitions, 7 changer transitions 0/102 dead transitions. [2025-03-14 01:20:44,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 102 transitions, 298 flow [2025-03-14 01:20:44,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:20:44,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:20:44,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 254 transitions. [2025-03-14 01:20:44,563 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8552188552188552 [2025-03-14 01:20:44,563 INFO L175 Difference]: Start difference. First operand has 98 places, 95 transitions, 230 flow. Second operand 3 states and 254 transitions. [2025-03-14 01:20:44,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 102 transitions, 298 flow [2025-03-14 01:20:44,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 102 transitions, 284 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:20:44,566 INFO L231 Difference]: Finished difference. Result has 100 places, 100 transitions, 270 flow [2025-03-14 01:20:44,566 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=270, PETRI_PLACES=100, PETRI_TRANSITIONS=100} [2025-03-14 01:20:44,567 INFO L279 CegarLoopForPetriNet]: 97 programPoint places, 3 predicate places. [2025-03-14 01:20:44,567 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 100 transitions, 270 flow [2025-03-14 01:20:44,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:20:44,567 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:20:44,567 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:20:44,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:20:44,568 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-14 01:20:44,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:20:44,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1876656035, now seen corresponding path program 1 times [2025-03-14 01:20:44,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:20:44,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886048845] [2025-03-14 01:20:44,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:20:44,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:20:44,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-14 01:20:44,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-14 01:20:44,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:20:44,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:20:44,588 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 01:20:44,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-14 01:20:44,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-14 01:20:44,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:20:44,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:20:44,613 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 01:20:44,613 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 01:20:44,614 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-03-14 01:20:44,615 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2025-03-14 01:20:44,616 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-03-14 01:20:44,616 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2025-03-14 01:20:44,616 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2025-03-14 01:20:44,616 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2025-03-14 01:20:44,616 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2025-03-14 01:20:44,616 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-03-14 01:20:44,616 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-03-14 01:20:44,616 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-03-14 01:20:44,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:20:44,616 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-14 01:20:44,618 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 01:20:44,618 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-14 01:20:44,645 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 01:20:44,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 130 transitions, 270 flow [2025-03-14 01:20:44,672 INFO L124 PetriNetUnfolderBase]: 13/230 cut-off events. [2025-03-14 01:20:44,672 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:20:44,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 230 events. 13/230 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 767 event pairs, 0 based on Foata normal form. 0/199 useless extension candidates. Maximal degree in co-relation 150. Up to 6 conditions per place. [2025-03-14 01:20:44,675 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 130 transitions, 270 flow [2025-03-14 01:20:44,677 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 128 places, 130 transitions, 270 flow [2025-03-14 01:20:44,682 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:20:44,683 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;@e484c0c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:20:44,683 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-03-14 01:20:44,688 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:20:44,690 INFO L124 PetriNetUnfolderBase]: 2/49 cut-off events. [2025-03-14 01:20:44,690 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:20:44,690 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:20:44,690 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] [2025-03-14 01:20:44,690 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-14 01:20:44,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:20:44,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1504580334, now seen corresponding path program 1 times [2025-03-14 01:20:44,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:20:44,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378506682] [2025-03-14 01:20:44,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:20:44,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:20:44,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-14 01:20:44,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-14 01:20:44,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:20:44,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:20:44,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:20:44,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:20:44,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378506682] [2025-03-14 01:20:44,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378506682] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:20:44,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:20:44,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:20:44,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185324267] [2025-03-14 01:20:44,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:20:44,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-14 01:20:44,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:20:44,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-14 01:20:44,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-14 01:20:44,717 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 130 [2025-03-14 01:20:44,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 130 transitions, 270 flow. Second operand has 2 states, 2 states have (on average 113.0) internal successors, (226), 2 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:20:44,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:20:44,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 130 [2025-03-14 01:20:44,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:20:44,817 INFO L124 PetriNetUnfolderBase]: 34/566 cut-off events. [2025-03-14 01:20:44,817 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-14 01:20:44,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 653 conditions, 566 events. 34/566 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3272 event pairs, 34 based on Foata normal form. 67/546 useless extension candidates. Maximal degree in co-relation 429. Up to 73 conditions per place. [2025-03-14 01:20:44,821 INFO L140 encePairwiseOnDemand]: 123/130 looper letters, 8 selfloop transitions, 0 changer transitions 0/117 dead transitions. [2025-03-14 01:20:44,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 117 transitions, 260 flow [2025-03-14 01:20:44,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-14 01:20:44,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-14 01:20:44,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 239 transitions. [2025-03-14 01:20:44,823 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9192307692307692 [2025-03-14 01:20:44,823 INFO L175 Difference]: Start difference. First operand has 128 places, 130 transitions, 270 flow. Second operand 2 states and 239 transitions. [2025-03-14 01:20:44,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 117 transitions, 260 flow [2025-03-14 01:20:44,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 117 transitions, 260 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:20:44,825 INFO L231 Difference]: Finished difference. Result has 123 places, 117 transitions, 244 flow [2025-03-14 01:20:44,825 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=244, PETRI_PLACES=123, PETRI_TRANSITIONS=117} [2025-03-14 01:20:44,827 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, -5 predicate places. [2025-03-14 01:20:44,827 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 117 transitions, 244 flow [2025-03-14 01:20:44,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 113.0) internal successors, (226), 2 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:20:44,829 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:20:44,830 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:20:44,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:20:44,830 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-14 01:20:44,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:20:44,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1163560757, now seen corresponding path program 1 times [2025-03-14 01:20:44,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:20:44,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749616088] [2025-03-14 01:20:44,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:20:44,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:20:44,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-14 01:20:44,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 01:20:44,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:20:44,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:20:44,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:20:44,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:20:44,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749616088] [2025-03-14 01:20:44,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749616088] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:20:44,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:20:44,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:20:44,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716563542] [2025-03-14 01:20:44,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:20:44,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:20:44,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:20:44,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:20:44,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:20:44,926 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 130 [2025-03-14 01:20:44,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 117 transitions, 244 flow. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:20:44,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:20:44,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 130 [2025-03-14 01:20:44,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:20:45,212 INFO L124 PetriNetUnfolderBase]: 845/3283 cut-off events. [2025-03-14 01:20:45,213 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-14 01:20:45,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4733 conditions, 3283 events. 845/3283 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 29902 event pairs, 632 based on Foata normal form. 0/2783 useless extension candidates. Maximal degree in co-relation 4728. Up to 1252 conditions per place. [2025-03-14 01:20:45,233 INFO L140 encePairwiseOnDemand]: 120/130 looper letters, 26 selfloop transitions, 9 changer transitions 0/129 dead transitions. [2025-03-14 01:20:45,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 129 transitions, 338 flow [2025-03-14 01:20:45,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:20:45,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:20:45,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 327 transitions. [2025-03-14 01:20:45,235 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8384615384615385 [2025-03-14 01:20:45,235 INFO L175 Difference]: Start difference. First operand has 123 places, 117 transitions, 244 flow. Second operand 3 states and 327 transitions. [2025-03-14 01:20:45,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 129 transitions, 338 flow [2025-03-14 01:20:45,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 129 transitions, 338 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:20:45,237 INFO L231 Difference]: Finished difference. Result has 127 places, 125 transitions, 314 flow [2025-03-14 01:20:45,238 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=314, PETRI_PLACES=127, PETRI_TRANSITIONS=125} [2025-03-14 01:20:45,238 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, -1 predicate places. [2025-03-14 01:20:45,239 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 125 transitions, 314 flow [2025-03-14 01:20:45,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:20:45,240 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:20:45,240 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] [2025-03-14 01:20:45,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:20:45,240 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-14 01:20:45,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:20:45,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1248269080, now seen corresponding path program 1 times [2025-03-14 01:20:45,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:20:45,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727684946] [2025-03-14 01:20:45,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:20:45,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:20:45,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-14 01:20:45,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-14 01:20:45,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:20:45,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:20:45,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:20:45,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:20:45,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727684946] [2025-03-14 01:20:45,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727684946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:20:45,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:20:45,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:20:45,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218565014] [2025-03-14 01:20:45,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:20:45,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:20:45,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:20:45,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:20:45,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:20:45,319 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 130 [2025-03-14 01:20:45,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 125 transitions, 314 flow. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:20:45,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:20:45,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 130 [2025-03-14 01:20:45,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:20:45,655 INFO L124 PetriNetUnfolderBase]: 1088/3830 cut-off events. [2025-03-14 01:20:45,655 INFO L125 PetriNetUnfolderBase]: For 861/1014 co-relation queries the response was YES. [2025-03-14 01:20:45,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6732 conditions, 3830 events. 1088/3830 cut-off events. For 861/1014 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 36068 event pairs, 560 based on Foata normal form. 3/3223 useless extension candidates. Maximal degree in co-relation 6725. Up to 1421 conditions per place. [2025-03-14 01:20:45,684 INFO L140 encePairwiseOnDemand]: 120/130 looper letters, 30 selfloop transitions, 13 changer transitions 0/141 dead transitions. [2025-03-14 01:20:45,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 141 transitions, 459 flow [2025-03-14 01:20:45,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:20:45,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:20:45,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 332 transitions. [2025-03-14 01:20:45,686 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8512820512820513 [2025-03-14 01:20:45,687 INFO L175 Difference]: Start difference. First operand has 127 places, 125 transitions, 314 flow. Second operand 3 states and 332 transitions. [2025-03-14 01:20:45,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 141 transitions, 459 flow [2025-03-14 01:20:45,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 141 transitions, 433 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:20:45,699 INFO L231 Difference]: Finished difference. Result has 129 places, 136 transitions, 408 flow [2025-03-14 01:20:45,699 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=408, PETRI_PLACES=129, PETRI_TRANSITIONS=136} [2025-03-14 01:20:45,701 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, 1 predicate places. [2025-03-14 01:20:45,701 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 136 transitions, 408 flow [2025-03-14 01:20:45,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:20:45,702 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:20:45,702 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] [2025-03-14 01:20:45,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:20:45,702 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-14 01:20:45,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:20:45,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1042264760, now seen corresponding path program 1 times [2025-03-14 01:20:45,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:20:45,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381794250] [2025-03-14 01:20:45,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:20:45,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:20:45,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-14 01:20:45,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-14 01:20:45,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:20:45,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:20:45,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:20:45,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:20:45,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381794250] [2025-03-14 01:20:45,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381794250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:20:45,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:20:45,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:20:45,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911919772] [2025-03-14 01:20:45,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:20:45,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:20:45,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:20:45,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:20:45,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:20:45,777 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 130 [2025-03-14 01:20:45,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 136 transitions, 408 flow. Second operand has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:20:45,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:20:45,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 130 [2025-03-14 01:20:45,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:20:46,356 INFO L124 PetriNetUnfolderBase]: 2061/6890 cut-off events. [2025-03-14 01:20:46,358 INFO L125 PetriNetUnfolderBase]: For 3804/3984 co-relation queries the response was YES. [2025-03-14 01:20:46,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13659 conditions, 6890 events. 2061/6890 cut-off events. For 3804/3984 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 72120 event pairs, 630 based on Foata normal form. 7/5762 useless extension candidates. Maximal degree in co-relation 13651. Up to 1788 conditions per place. [2025-03-14 01:20:46,413 INFO L140 encePairwiseOnDemand]: 115/130 looper letters, 44 selfloop transitions, 26 changer transitions 0/168 dead transitions. [2025-03-14 01:20:46,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 168 transitions, 707 flow [2025-03-14 01:20:46,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:20:46,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:20:46,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 336 transitions. [2025-03-14 01:20:46,415 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8615384615384616 [2025-03-14 01:20:46,415 INFO L175 Difference]: Start difference. First operand has 129 places, 136 transitions, 408 flow. Second operand 3 states and 336 transitions. [2025-03-14 01:20:46,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 168 transitions, 707 flow [2025-03-14 01:20:46,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 168 transitions, 663 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:20:46,427 INFO L231 Difference]: Finished difference. Result has 131 places, 161 transitions, 664 flow [2025-03-14 01:20:46,428 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=664, PETRI_PLACES=131, PETRI_TRANSITIONS=161} [2025-03-14 01:20:46,428 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, 3 predicate places. [2025-03-14 01:20:46,428 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 161 transitions, 664 flow [2025-03-14 01:20:46,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:20:46,429 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:20:46,429 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] [2025-03-14 01:20:46,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:20:46,429 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-14 01:20:46,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:20:46,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1464108484, now seen corresponding path program 1 times [2025-03-14 01:20:46,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:20:46,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421485503] [2025-03-14 01:20:46,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:20:46,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:20:46,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-14 01:20:46,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-14 01:20:46,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:20:46,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:20:46,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:20:46,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:20:46,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421485503] [2025-03-14 01:20:46,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421485503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:20:46,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:20:46,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:20:46,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636160055] [2025-03-14 01:20:46,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:20:46,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:20:46,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:20:46,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:20:46,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:20:46,502 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 130 [2025-03-14 01:20:46,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 161 transitions, 664 flow. Second operand has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:20:46,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:20:46,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 130 [2025-03-14 01:20:46,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:20:47,213 INFO L124 PetriNetUnfolderBase]: 2966/9755 cut-off events. [2025-03-14 01:20:47,214 INFO L125 PetriNetUnfolderBase]: For 14889/15378 co-relation queries the response was YES. [2025-03-14 01:20:47,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23389 conditions, 9755 events. 2966/9755 cut-off events. For 14889/15378 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 105992 event pairs, 1072 based on Foata normal form. 41/8329 useless extension candidates. Maximal degree in co-relation 23380. Up to 3627 conditions per place. [2025-03-14 01:20:47,279 INFO L140 encePairwiseOnDemand]: 120/130 looper letters, 60 selfloop transitions, 22 changer transitions 0/183 dead transitions. [2025-03-14 01:20:47,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 183 transitions, 976 flow [2025-03-14 01:20:47,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:20:47,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:20:47,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 327 transitions. [2025-03-14 01:20:47,281 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8384615384615385 [2025-03-14 01:20:47,282 INFO L175 Difference]: Start difference. First operand has 131 places, 161 transitions, 664 flow. Second operand 3 states and 327 transitions. [2025-03-14 01:20:47,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 183 transitions, 976 flow [2025-03-14 01:20:47,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 183 transitions, 908 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:20:47,296 INFO L231 Difference]: Finished difference. Result has 133 places, 179 transitions, 862 flow [2025-03-14 01:20:47,296 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=862, PETRI_PLACES=133, PETRI_TRANSITIONS=179} [2025-03-14 01:20:47,297 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, 5 predicate places. [2025-03-14 01:20:47,298 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 179 transitions, 862 flow [2025-03-14 01:20:47,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:20:47,298 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:20:47,298 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:20:47,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 01:20:47,299 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-14 01:20:47,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:20:47,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1031998207, now seen corresponding path program 1 times [2025-03-14 01:20:47,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:20:47,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830408089] [2025-03-14 01:20:47,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:20:47,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:20:47,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-14 01:20:47,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-14 01:20:47,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:20:47,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:20:47,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:20:47,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:20:47,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830408089] [2025-03-14 01:20:47,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830408089] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:20:47,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:20:47,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:20:47,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804796008] [2025-03-14 01:20:47,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:20:47,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:20:47,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:20:47,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:20:47,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:20:47,374 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 130 [2025-03-14 01:20:47,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 179 transitions, 862 flow. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:20:47,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:20:47,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 130 [2025-03-14 01:20:47,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:20:48,142 INFO L124 PetriNetUnfolderBase]: 3528/10620 cut-off events. [2025-03-14 01:20:48,142 INFO L125 PetriNetUnfolderBase]: For 19348/19800 co-relation queries the response was YES. [2025-03-14 01:20:48,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27729 conditions, 10620 events. 3528/10620 cut-off events. For 19348/19800 co-relation queries the response was YES. Maximal size of possible extension queue 504. Compared 115403 event pairs, 992 based on Foata normal form. 26/8854 useless extension candidates. Maximal degree in co-relation 27719. Up to 3989 conditions per place. [2025-03-14 01:20:48,226 INFO L140 encePairwiseOnDemand]: 120/130 looper letters, 68 selfloop transitions, 36 changer transitions 0/209 dead transitions. [2025-03-14 01:20:48,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 209 transitions, 1284 flow [2025-03-14 01:20:48,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:20:48,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:20:48,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 331 transitions. [2025-03-14 01:20:48,228 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8487179487179487 [2025-03-14 01:20:48,228 INFO L175 Difference]: Start difference. First operand has 133 places, 179 transitions, 862 flow. Second operand 3 states and 331 transitions. [2025-03-14 01:20:48,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 209 transitions, 1284 flow [2025-03-14 01:20:48,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 209 transitions, 1184 flow, removed 20 selfloop flow, removed 2 redundant places. [2025-03-14 01:20:48,266 INFO L231 Difference]: Finished difference. Result has 135 places, 205 transitions, 1166 flow [2025-03-14 01:20:48,266 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=786, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1166, PETRI_PLACES=135, PETRI_TRANSITIONS=205} [2025-03-14 01:20:48,266 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, 7 predicate places. [2025-03-14 01:20:48,266 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 205 transitions, 1166 flow [2025-03-14 01:20:48,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:20:48,267 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:20:48,267 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] [2025-03-14 01:20:48,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 01:20:48,267 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-14 01:20:48,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:20:48,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1231678641, now seen corresponding path program 1 times [2025-03-14 01:20:48,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:20:48,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702389040] [2025-03-14 01:20:48,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:20:48,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:20:48,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-14 01:20:48,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-14 01:20:48,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:20:48,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:20:48,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:20:48,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:20:48,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702389040] [2025-03-14 01:20:48,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702389040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:20:48,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:20:48,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:20:48,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833542423] [2025-03-14 01:20:48,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:20:48,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:20:48,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:20:48,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:20:48,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:20:48,337 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 130 [2025-03-14 01:20:48,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 205 transitions, 1166 flow. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:20:48,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:20:48,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 130 [2025-03-14 01:20:48,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:20:49,179 INFO L124 PetriNetUnfolderBase]: 4489/13143 cut-off events. [2025-03-14 01:20:49,180 INFO L125 PetriNetUnfolderBase]: For 33534/34133 co-relation queries the response was YES. [2025-03-14 01:20:49,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37383 conditions, 13143 events. 4489/13143 cut-off events. For 33534/34133 co-relation queries the response was YES. Maximal size of possible extension queue 583. Compared 145032 event pairs, 1134 based on Foata normal form. 23/11018 useless extension candidates. Maximal degree in co-relation 37372. Up to 4859 conditions per place. [2025-03-14 01:20:49,345 INFO L140 encePairwiseOnDemand]: 120/130 looper letters, 91 selfloop transitions, 38 changer transitions 0/236 dead transitions. [2025-03-14 01:20:49,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 236 transitions, 1685 flow [2025-03-14 01:20:49,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:20:49,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:20:49,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 332 transitions. [2025-03-14 01:20:49,347 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8512820512820513 [2025-03-14 01:20:49,347 INFO L175 Difference]: Start difference. First operand has 135 places, 205 transitions, 1166 flow. Second operand 3 states and 332 transitions. [2025-03-14 01:20:49,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 236 transitions, 1685 flow [2025-03-14 01:20:49,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 236 transitions, 1597 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:20:49,366 INFO L231 Difference]: Finished difference. Result has 137 places, 231 transitions, 1530 flow [2025-03-14 01:20:49,367 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=1094, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1530, PETRI_PLACES=137, PETRI_TRANSITIONS=231} [2025-03-14 01:20:49,367 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, 9 predicate places. [2025-03-14 01:20:49,367 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 231 transitions, 1530 flow [2025-03-14 01:20:49,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:20:49,368 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:20:49,368 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:20:49,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 01:20:49,368 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-14 01:20:49,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:20:49,369 INFO L85 PathProgramCache]: Analyzing trace with hash 44470982, now seen corresponding path program 1 times [2025-03-14 01:20:49,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:20:49,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050259623] [2025-03-14 01:20:49,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:20:49,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:20:49,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-14 01:20:49,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-14 01:20:49,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:20:49,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:20:49,384 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 01:20:49,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-14 01:20:49,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-14 01:20:49,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:20:49,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:20:49,393 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 01:20:49,396 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 01:20:49,397 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-03-14 01:20:49,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining) [2025-03-14 01:20:49,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining) [2025-03-14 01:20:49,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining) [2025-03-14 01:20:49,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining) [2025-03-14 01:20:49,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining) [2025-03-14 01:20:49,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining) [2025-03-14 01:20:49,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining) [2025-03-14 01:20:49,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining) [2025-03-14 01:20:49,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining) [2025-03-14 01:20:49,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining) [2025-03-14 01:20:49,398 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining) [2025-03-14 01:20:49,398 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining) [2025-03-14 01:20:49,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-14 01:20:49,398 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:20:49,398 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 01:20:49,398 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-14 01:20:49,419 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 01:20:49,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 161 transitions, 340 flow [2025-03-14 01:20:49,435 INFO L124 PetriNetUnfolderBase]: 18/311 cut-off events. [2025-03-14 01:20:49,436 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-14 01:20:49,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 324 conditions, 311 events. 18/311 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1196 event pairs, 0 based on Foata normal form. 0/268 useless extension candidates. Maximal degree in co-relation 234. Up to 8 conditions per place. [2025-03-14 01:20:49,437 INFO L82 GeneralOperation]: Start removeDead. Operand has 159 places, 161 transitions, 340 flow [2025-03-14 01:20:49,438 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 159 places, 161 transitions, 340 flow [2025-03-14 01:20:49,439 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:20:49,439 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;@e484c0c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:20:49,439 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-03-14 01:20:49,441 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:20:49,441 INFO L124 PetriNetUnfolderBase]: 2/49 cut-off events. [2025-03-14 01:20:49,441 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:20:49,441 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:20:49,441 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] [2025-03-14 01:20:49,441 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-14 01:20:49,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:20:49,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1361390418, now seen corresponding path program 1 times [2025-03-14 01:20:49,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:20:49,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634214435] [2025-03-14 01:20:49,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:20:49,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:20:49,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-14 01:20:49,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-14 01:20:49,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:20:49,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:20:49,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:20:49,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:20:49,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634214435] [2025-03-14 01:20:49,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634214435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:20:49,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:20:49,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:20:49,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761805011] [2025-03-14 01:20:49,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:20:49,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-14 01:20:49,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:20:49,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-14 01:20:49,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-14 01:20:49,456 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 161 [2025-03-14 01:20:49,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 161 transitions, 340 flow. Second operand has 2 states, 2 states have (on average 138.0) internal successors, (276), 2 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:20:49,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:20:49,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 161 [2025-03-14 01:20:49,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:20:49,556 INFO L124 PetriNetUnfolderBase]: 178/1732 cut-off events. [2025-03-14 01:20:49,556 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2025-03-14 01:20:49,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2081 conditions, 1732 events. 178/1732 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 14508 event pairs, 178 based on Foata normal form. 260/1709 useless extension candidates. Maximal degree in co-relation 1375. Up to 298 conditions per place. [2025-03-14 01:20:49,568 INFO L140 encePairwiseOnDemand]: 152/161 looper letters, 11 selfloop transitions, 0 changer transitions 0/144 dead transitions. [2025-03-14 01:20:49,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 144 transitions, 328 flow [2025-03-14 01:20:49,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-14 01:20:49,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-14 01:20:49,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 294 transitions. [2025-03-14 01:20:49,570 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9130434782608695 [2025-03-14 01:20:49,570 INFO L175 Difference]: Start difference. First operand has 159 places, 161 transitions, 340 flow. Second operand 2 states and 294 transitions. [2025-03-14 01:20:49,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 144 transitions, 328 flow [2025-03-14 01:20:49,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 144 transitions, 326 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-14 01:20:49,572 INFO L231 Difference]: Finished difference. Result has 152 places, 144 transitions, 304 flow [2025-03-14 01:20:49,572 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=304, PETRI_PLACES=152, PETRI_TRANSITIONS=144} [2025-03-14 01:20:49,572 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, -7 predicate places. [2025-03-14 01:20:49,572 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 144 transitions, 304 flow [2025-03-14 01:20:49,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 138.0) internal successors, (276), 2 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:20:49,573 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:20:49,573 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:20:49,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-14 01:20:49,573 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-14 01:20:49,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:20:49,574 INFO L85 PathProgramCache]: Analyzing trace with hash 683924982, now seen corresponding path program 1 times [2025-03-14 01:20:49,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:20:49,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239047402] [2025-03-14 01:20:49,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:20:49,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:20:49,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-14 01:20:49,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 01:20:49,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:20:49,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:20:49,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:20:49,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:20:49,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239047402] [2025-03-14 01:20:49,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239047402] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:20:49,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:20:49,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:20:49,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618384225] [2025-03-14 01:20:49,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:20:49,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:20:49,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:20:49,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:20:49,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:20:49,652 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 161 [2025-03-14 01:20:49,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 144 transitions, 304 flow. Second operand has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:20:49,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:20:49,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 161 [2025-03-14 01:20:49,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:20:51,174 INFO L124 PetriNetUnfolderBase]: 8153/23044 cut-off events. [2025-03-14 01:20:51,174 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2025-03-14 01:20:51,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34911 conditions, 23044 events. 8153/23044 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 726. Compared 266205 event pairs, 6332 based on Foata normal form. 0/19799 useless extension candidates. Maximal degree in co-relation 34905. Up to 10488 conditions per place. [2025-03-14 01:20:51,329 INFO L140 encePairwiseOnDemand]: 148/161 looper letters, 34 selfloop transitions, 12 changer transitions 0/161 dead transitions. [2025-03-14 01:20:51,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 161 transitions, 430 flow [2025-03-14 01:20:51,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:20:51,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:20:51,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 404 transitions. [2025-03-14 01:20:51,331 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8364389233954451 [2025-03-14 01:20:51,331 INFO L175 Difference]: Start difference. First operand has 152 places, 144 transitions, 304 flow. Second operand 3 states and 404 transitions. [2025-03-14 01:20:51,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 161 transitions, 430 flow [2025-03-14 01:20:51,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 161 transitions, 430 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:20:51,335 INFO L231 Difference]: Finished difference. Result has 156 places, 155 transitions, 398 flow [2025-03-14 01:20:51,335 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=398, PETRI_PLACES=156, PETRI_TRANSITIONS=155} [2025-03-14 01:20:51,336 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, -3 predicate places. [2025-03-14 01:20:51,337 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 155 transitions, 398 flow [2025-03-14 01:20:51,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:20:51,337 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:20:51,337 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:20:51,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-14 01:20:51,337 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-14 01:20:51,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:20:51,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1807593738, now seen corresponding path program 1 times [2025-03-14 01:20:51,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:20:51,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297007857] [2025-03-14 01:20:51,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:20:51,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:20:51,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-14 01:20:51,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-14 01:20:51,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:20:51,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:20:51,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:20:51,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:20:51,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297007857] [2025-03-14 01:20:51,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297007857] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:20:51,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:20:51,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:20:51,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078060136] [2025-03-14 01:20:51,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:20:51,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:20:51,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:20:51,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:20:51,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:20:51,407 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 161 [2025-03-14 01:20:51,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 155 transitions, 398 flow. Second operand has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:20:51,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:20:51,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 161 [2025-03-14 01:20:51,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:20:53,671 INFO L124 PetriNetUnfolderBase]: 11247/29861 cut-off events. [2025-03-14 01:20:53,671 INFO L125 PetriNetUnfolderBase]: For 7893/9108 co-relation queries the response was YES. [2025-03-14 01:20:53,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56111 conditions, 29861 events. 11247/29861 cut-off events. For 7893/9108 co-relation queries the response was YES. Maximal size of possible extension queue 1033. Compared 351958 event pairs, 6418 based on Foata normal form. 28/25419 useless extension candidates. Maximal degree in co-relation 56103. Up to 13140 conditions per place. [2025-03-14 01:20:53,899 INFO L140 encePairwiseOnDemand]: 148/161 looper letters, 42 selfloop transitions, 19 changer transitions 0/180 dead transitions. [2025-03-14 01:20:53,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 180 transitions, 620 flow [2025-03-14 01:20:53,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:20:53,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:20:53,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 410 transitions. [2025-03-14 01:20:53,901 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8488612836438924 [2025-03-14 01:20:53,901 INFO L175 Difference]: Start difference. First operand has 156 places, 155 transitions, 398 flow. Second operand 3 states and 410 transitions. [2025-03-14 01:20:53,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 180 transitions, 620 flow [2025-03-14 01:20:53,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 180 transitions, 582 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:20:53,954 INFO L231 Difference]: Finished difference. Result has 158 places, 172 transitions, 546 flow [2025-03-14 01:20:53,954 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=546, PETRI_PLACES=158, PETRI_TRANSITIONS=172} [2025-03-14 01:20:53,955 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, -1 predicate places. [2025-03-14 01:20:53,955 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 172 transitions, 546 flow [2025-03-14 01:20:53,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:20:53,955 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:20:53,955 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] [2025-03-14 01:20:53,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-14 01:20:53,956 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-14 01:20:53,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:20:53,956 INFO L85 PathProgramCache]: Analyzing trace with hash -515284120, now seen corresponding path program 1 times [2025-03-14 01:20:53,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:20:53,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396986487] [2025-03-14 01:20:53,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:20:53,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:20:53,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-14 01:20:53,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-14 01:20:53,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:20:53,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:20:53,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:20:53,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:20:53,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396986487] [2025-03-14 01:20:53,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396986487] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:20:53,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:20:53,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:20:53,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710790441] [2025-03-14 01:20:53,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:20:53,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:20:53,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:20:53,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:20:53,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:20:54,038 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 161 [2025-03-14 01:20:54,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 172 transitions, 546 flow. Second operand has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:20:54,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:20:54,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 161 [2025-03-14 01:20:54,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:20:57,149 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([412] L693-8-->L693-7: Formula: (= |v_#race~c~0_15| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_15|} AuxVars[] AssignedVars[#race~c~0][151], [111#L693-7true, 114#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 156#true, 162#true, 160#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 169#true, 149#L693-6true, 151#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 176#(= |#race~c~0| 0), 158#true]) [2025-03-14 01:20:57,149 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2025-03-14 01:20:57,150 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-14 01:20:57,150 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-14 01:20:57,150 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-14 01:20:57,395 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L693-2-->L693: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_3|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][214], [5#L693true, 114#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 156#true, 162#true, 160#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 169#true, 149#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 118#L693-10true, 174#true, 158#true]) [2025-03-14 01:20:57,395 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2025-03-14 01:20:57,396 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-14 01:20:57,396 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-14 01:20:57,396 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-14 01:20:57,414 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([586] L693-2-->L693: Formula: (= |v_#race~c~0_3| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][198], [114#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 156#true, 162#true, 88#L693true, 160#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 169#true, 151#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 118#L693-10true, 174#true, 158#true]) [2025-03-14 01:20:57,414 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2025-03-14 01:20:57,414 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-14 01:20:57,414 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-14 01:20:57,414 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-14 01:20:57,853 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([586] L693-2-->L693: Formula: (= |v_#race~c~0_3| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][123], [114#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 156#true, 162#true, 88#L693true, 77#L693-8true, 160#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 169#true, 151#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true]) [2025-03-14 01:20:57,853 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2025-03-14 01:20:57,853 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-14 01:20:57,853 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-14 01:20:57,853 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-14 01:20:57,854 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L693-2-->L693: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_3|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][174], [5#L693true, 114#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 156#true, 162#true, 77#L693-8true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 160#true, 169#true, 149#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true]) [2025-03-14 01:20:57,854 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2025-03-14 01:20:57,854 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-14 01:20:57,854 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-14 01:20:57,854 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-14 01:21:00,120 INFO L124 PetriNetUnfolderBase]: 31793/78596 cut-off events. [2025-03-14 01:21:00,120 INFO L125 PetriNetUnfolderBase]: For 55683/57379 co-relation queries the response was YES. [2025-03-14 01:21:00,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170883 conditions, 78596 events. 31793/78596 cut-off events. For 55683/57379 co-relation queries the response was YES. Maximal size of possible extension queue 2895. Compared 1028801 event pairs, 10563 based on Foata normal form. 71/64794 useless extension candidates. Maximal degree in co-relation 170874. Up to 24669 conditions per place. [2025-03-14 01:21:00,703 INFO L140 encePairwiseOnDemand]: 141/161 looper letters, 65 selfloop transitions, 40 changer transitions 0/222 dead transitions. [2025-03-14 01:21:00,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 222 transitions, 1028 flow [2025-03-14 01:21:00,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:21:00,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:21:00,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 412 transitions. [2025-03-14 01:21:00,705 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8530020703933747 [2025-03-14 01:21:00,705 INFO L175 Difference]: Start difference. First operand has 158 places, 172 transitions, 546 flow. Second operand 3 states and 412 transitions. [2025-03-14 01:21:00,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 222 transitions, 1028 flow [2025-03-14 01:21:00,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 222 transitions, 956 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:21:00,896 INFO L231 Difference]: Finished difference. Result has 160 places, 212 transitions, 964 flow [2025-03-14 01:21:00,897 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=964, PETRI_PLACES=160, PETRI_TRANSITIONS=212} [2025-03-14 01:21:00,897 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 1 predicate places. [2025-03-14 01:21:00,897 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 212 transitions, 964 flow [2025-03-14 01:21:00,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:21:00,897 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:21:00,898 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] [2025-03-14 01:21:00,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-14 01:21:00,898 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-14 01:21:00,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:21:00,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1004317701, now seen corresponding path program 1 times [2025-03-14 01:21:00,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:21:00,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750841296] [2025-03-14 01:21:00,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:21:00,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:21:00,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-14 01:21:00,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-14 01:21:00,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:21:00,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:21:00,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:21:00,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:21:00,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750841296] [2025-03-14 01:21:00,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750841296] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:21:00,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:21:00,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:21:00,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231877709] [2025-03-14 01:21:00,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:21:00,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:21:00,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:21:00,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:21:00,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:21:00,968 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 161 [2025-03-14 01:21:00,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 212 transitions, 964 flow. Second operand has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:21:00,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:21:00,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 161 [2025-03-14 01:21:00,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:21:03,077 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([544] L693-8-->L693-7: Formula: (= |v_#race~c~0_6| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_6|} AuxVars[] AssignedVars[#race~c~0][144], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 102#L693-7true, 149#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 40#L692true, Black: 174#true, 179#true, 15#L693-6true, 156#true, 160#true, 176#(= |#race~c~0| 0)]) [2025-03-14 01:21:03,077 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2025-03-14 01:21:03,077 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2025-03-14 01:21:03,077 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2025-03-14 01:21:03,077 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2025-03-14 01:21:03,087 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([412] L693-8-->L693-7: Formula: (= |v_#race~c~0_15| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_15|} AuxVars[] AssignedVars[#race~c~0][145], [111#L693-7true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 149#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 81#L693-6true, 158#true, 40#L692true, Black: 174#true, 179#true, 156#true, 160#true, 176#(= |#race~c~0| 0)]) [2025-03-14 01:21:03,087 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2025-03-14 01:21:03,088 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2025-03-14 01:21:03,088 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2025-03-14 01:21:03,088 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2025-03-14 01:21:03,334 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([510] L693-11-->L693-9: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_9|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_9|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][193], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 149#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 153#L693-9true, 174#true, 158#true, Black: 176#(= |#race~c~0| 0), 15#L693-6true, 179#true, 156#true, 67#L693-10true, 160#true]) [2025-03-14 01:21:03,335 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2025-03-14 01:21:03,335 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:21:03,335 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:21:03,335 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:21:03,343 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([510] L693-11-->L693-9: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_9|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_9|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][216], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 149#L693-6true, 118#L693-10true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 153#L693-9true, 174#true, 81#L693-6true, 158#true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 160#true]) [2025-03-14 01:21:03,343 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2025-03-14 01:21:03,343 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:21:03,343 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:21:03,343 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:21:03,523 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([586] L693-2-->L693: Formula: (= |v_#race~c~0_3| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][163], [162#true, 88#L693true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, 40#L692true, Black: 176#(= |#race~c~0| 0), 156#true, 15#L693-6true, 179#true, 160#true, 67#L693-10true]) [2025-03-14 01:21:03,523 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2025-03-14 01:21:03,523 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:21:03,523 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:21:03,523 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:21:03,550 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([586] L693-2-->L693: Formula: (= |v_#race~c~0_3| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][197], [162#true, 88#L693true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 118#L693-10true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 81#L693-6true, 158#true, Black: 176#(= |#race~c~0| 0), 40#L692true, 179#true, 156#true, 160#true]) [2025-03-14 01:21:03,550 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2025-03-14 01:21:03,550 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:21:03,550 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:21:03,550 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:21:03,602 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([556] L693-2-->L693: Formula: (= |v_#race~c~0_3| |v_thr1Thread1of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread1of3ForFork0_#t~nondet3#1=|v_thr1Thread1of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread1of3ForFork0_#t~nondet3#1=|v_thr1Thread1of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][157], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 149#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 118#L693-10true, 174#true, 119#L693true, 158#true, 40#L692true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 160#true]) [2025-03-14 01:21:03,602 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2025-03-14 01:21:03,603 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:21:03,603 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:21:03,603 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:21:03,748 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([556] L693-2-->L693: Formula: (= |v_#race~c~0_3| |v_thr1Thread1of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread1of3ForFork0_#t~nondet3#1=|v_thr1Thread1of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread1of3ForFork0_#t~nondet3#1=|v_thr1Thread1of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][70], [162#true, 77#L693-8true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 149#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, 119#L693true, Black: 176#(= |#race~c~0| 0), 40#L692true, 156#true, 179#true, 160#true]) [2025-03-14 01:21:03,749 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2025-03-14 01:21:03,749 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-03-14 01:21:03,749 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-03-14 01:21:03,749 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-03-14 01:21:04,007 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([586] L693-2-->L693: Formula: (= |v_#race~c~0_3| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][116], [139#L693-8true, 162#true, 88#L693true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, Black: 176#(= |#race~c~0| 0), 40#L692true, 15#L693-6true, 179#true, 156#true, 160#true]) [2025-03-14 01:21:04,007 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2025-03-14 01:21:04,007 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-03-14 01:21:04,007 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-03-14 01:21:04,007 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-03-14 01:21:04,029 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([586] L693-2-->L693: Formula: (= |v_#race~c~0_3| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][116], [162#true, 88#L693true, 77#L693-8true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 81#L693-6true, 158#true, Black: 176#(= |#race~c~0| 0), 40#L692true, 179#true, 156#true, 160#true]) [2025-03-14 01:21:04,029 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2025-03-14 01:21:04,029 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-03-14 01:21:04,029 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-03-14 01:21:04,029 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-03-14 01:21:04,313 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([510] L693-11-->L693-9: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_9|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_9|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][159], [139#L693-8true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 149#L693-6true, 153#L693-9true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, Black: 176#(= |#race~c~0| 0), 15#L693-6true, 179#true, 156#true, 160#true]) [2025-03-14 01:21:04,313 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is not cut-off event [2025-03-14 01:21:04,313 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is not cut-off event [2025-03-14 01:21:04,313 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is not cut-off event [2025-03-14 01:21:04,313 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is not cut-off event [2025-03-14 01:21:04,334 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([510] L693-11-->L693-9: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_9|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_9|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][159], [162#true, 77#L693-8true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 149#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 153#L693-9true, 174#true, 81#L693-6true, 158#true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 160#true]) [2025-03-14 01:21:04,334 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is not cut-off event [2025-03-14 01:21:04,334 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is not cut-off event [2025-03-14 01:21:04,334 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is not cut-off event [2025-03-14 01:21:04,335 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is not cut-off event [2025-03-14 01:21:04,800 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([412] L693-8-->L693-7: Formula: (= |v_#race~c~0_15| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_15|} AuxVars[] AssignedVars[#race~c~0][145], [111#L693-7true, 114#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 149#L693-6true, 151#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 174#true, 179#true, 156#true, 160#true, 176#(= |#race~c~0| 0)]) [2025-03-14 01:21:04,800 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2025-03-14 01:21:04,800 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-14 01:21:04,800 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-14 01:21:04,800 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-14 01:21:04,819 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([544] L693-8-->L693-7: Formula: (= |v_#race~c~0_6| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_6|} AuxVars[] AssignedVars[#race~c~0][144], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 102#L693-7true, 149#L693-6true, 151#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 174#true, 179#true, 156#true, 160#true, 82#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, 176#(= |#race~c~0| 0)]) [2025-03-14 01:21:04,819 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2025-03-14 01:21:04,819 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-14 01:21:04,819 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-14 01:21:04,819 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-14 01:21:05,075 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L693-2-->L693: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_3|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][200], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 149#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, 5#L693true, Black: 176#(= |#race~c~0| 0), 156#true, 179#true, 67#L693-10true, 160#true, 82#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue]) [2025-03-14 01:21:05,075 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2025-03-14 01:21:05,075 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-14 01:21:05,075 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-14 01:21:05,075 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-14 01:21:05,075 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L693-2-->L693: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_3|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][221], [114#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 149#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 118#L693-10true, 174#true, 158#true, 5#L693true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 160#true]) [2025-03-14 01:21:05,075 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2025-03-14 01:21:05,075 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-14 01:21:05,075 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-14 01:21:05,075 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-14 01:21:05,089 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([586] L693-2-->L693: Formula: (= |v_#race~c~0_3| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][163], [162#true, 88#L693true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 151#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 67#L693-10true, 160#true, 82#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue]) [2025-03-14 01:21:05,089 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2025-03-14 01:21:05,089 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-14 01:21:05,089 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-14 01:21:05,089 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-14 01:21:05,097 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([586] L693-2-->L693: Formula: (= |v_#race~c~0_3| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][197], [114#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 162#true, 88#L693true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 151#L693-6true, 118#L693-10true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 160#true]) [2025-03-14 01:21:05,097 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2025-03-14 01:21:05,097 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-14 01:21:05,097 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-14 01:21:05,097 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-14 01:21:05,734 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([586] L693-2-->L693: Formula: (= |v_#race~c~0_3| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][116], [114#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 162#true, 77#L693-8true, 88#L693true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 151#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, Black: 176#(= |#race~c~0| 0), 156#true, 179#true, 160#true]) [2025-03-14 01:21:05,735 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2025-03-14 01:21:05,735 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-14 01:21:05,735 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-14 01:21:05,735 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-14 01:21:05,736 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L693-2-->L693: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_3|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][172], [114#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 162#true, 77#L693-8true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 149#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, 5#L693true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 160#true]) [2025-03-14 01:21:05,736 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2025-03-14 01:21:05,736 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-14 01:21:05,736 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-14 01:21:05,736 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-14 01:21:05,753 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([586] L693-2-->L693: Formula: (= |v_#race~c~0_3| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][116], [139#L693-8true, 162#true, 88#L693true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 151#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 160#true, 82#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue]) [2025-03-14 01:21:05,753 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2025-03-14 01:21:05,753 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-14 01:21:05,753 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-14 01:21:05,753 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-14 01:21:05,754 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L693-2-->L693: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_3|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][172], [139#L693-8true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 149#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, 5#L693true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 160#true, 82#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue]) [2025-03-14 01:21:05,754 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2025-03-14 01:21:05,754 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-14 01:21:05,755 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-14 01:21:05,755 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-14 01:21:08,026 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([586] L693-2-->L693: Formula: (= |v_#race~c~0_3| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][163], [162#true, 88#L693true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 90#L694true, 39#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, 160#true, 67#L693-10true]) [2025-03-14 01:21:08,026 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2025-03-14 01:21:08,026 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-14 01:21:08,026 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-14 01:21:08,026 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-14 01:21:08,027 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L693-2-->L693: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_3|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][200], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, 69#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, 5#L693true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 90#L694true, 67#L693-10true, 160#true]) [2025-03-14 01:21:08,027 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2025-03-14 01:21:08,027 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-14 01:21:08,027 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-14 01:21:08,027 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-14 01:21:08,266 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L693-2-->L693: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_3|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][172], [114#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, 5#L693true, 69#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 90#L694true, 160#true]) [2025-03-14 01:21:08,266 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2025-03-14 01:21:08,266 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-14 01:21:08,266 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-14 01:21:08,266 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-14 01:21:08,267 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([586] L693-2-->L693: Formula: (= |v_#race~c~0_3| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][116], [114#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 162#true, 88#L693true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 90#L694true, 39#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, 160#true]) [2025-03-14 01:21:08,267 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2025-03-14 01:21:08,267 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-14 01:21:08,267 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-14 01:21:08,267 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-14 01:21:08,872 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([586] L693-2-->L693: Formula: (= |v_#race~c~0_3| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][163], [20#L701-1true, 162#true, 88#L693true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 39#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, 67#L693-10true, 160#true]) [2025-03-14 01:21:08,872 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2025-03-14 01:21:08,872 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-03-14 01:21:08,872 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-03-14 01:21:08,872 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-03-14 01:21:08,873 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L693-2-->L693: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_3|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][200], [20#L701-1true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, 69#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, 5#L693true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 67#L693-10true, 160#true]) [2025-03-14 01:21:08,874 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2025-03-14 01:21:08,874 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-03-14 01:21:08,874 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-03-14 01:21:08,874 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-03-14 01:21:08,971 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([586] L693-2-->L693: Formula: (= |v_#race~c~0_3| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][116], [114#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 20#L701-1true, 162#true, 88#L693true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 39#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, 160#true]) [2025-03-14 01:21:08,972 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2025-03-14 01:21:08,972 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-03-14 01:21:08,972 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-03-14 01:21:08,972 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-03-14 01:21:08,977 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L693-2-->L693: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_3|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][172], [114#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 20#L701-1true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, 69#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, 5#L693true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 160#true]) [2025-03-14 01:21:08,977 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2025-03-14 01:21:08,977 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-03-14 01:21:08,977 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-03-14 01:21:08,977 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-03-14 01:21:09,668 INFO L124 PetriNetUnfolderBase]: 45373/113850 cut-off events. [2025-03-14 01:21:09,668 INFO L125 PetriNetUnfolderBase]: For 214600/220603 co-relation queries the response was YES. [2025-03-14 01:21:10,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 305572 conditions, 113850 events. 45373/113850 cut-off events. For 214600/220603 co-relation queries the response was YES. Maximal size of possible extension queue 3851. Compared 1551025 event pairs, 17101 based on Foata normal form. 381/95004 useless extension candidates. Maximal degree in co-relation 305562. Up to 49200 conditions per place. [2025-03-14 01:21:10,615 INFO L140 encePairwiseOnDemand]: 148/161 looper letters, 91 selfloop transitions, 36 changer transitions 0/250 dead transitions. [2025-03-14 01:21:10,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 250 transitions, 1496 flow [2025-03-14 01:21:10,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:21:10,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:21:10,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 404 transitions. [2025-03-14 01:21:10,616 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8364389233954451 [2025-03-14 01:21:10,616 INFO L175 Difference]: Start difference. First operand has 160 places, 212 transitions, 964 flow. Second operand 3 states and 404 transitions. [2025-03-14 01:21:10,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 250 transitions, 1496 flow [2025-03-14 01:21:10,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 250 transitions, 1386 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:21:10,715 INFO L231 Difference]: Finished difference. Result has 162 places, 244 transitions, 1330 flow [2025-03-14 01:21:10,715 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=884, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1330, PETRI_PLACES=162, PETRI_TRANSITIONS=244} [2025-03-14 01:21:10,715 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 3 predicate places. [2025-03-14 01:21:10,715 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 244 transitions, 1330 flow [2025-03-14 01:21:10,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:21:10,716 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:21:10,716 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:21:10,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-14 01:21:10,716 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-14 01:21:10,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:21:10,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1462585727, now seen corresponding path program 1 times [2025-03-14 01:21:10,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:21:10,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781366462] [2025-03-14 01:21:10,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:21:10,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:21:10,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-14 01:21:10,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-14 01:21:10,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:21:10,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:21:10,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:21:10,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:21:10,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781366462] [2025-03-14 01:21:10,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781366462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:21:10,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:21:10,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:21:10,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805941083] [2025-03-14 01:21:10,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:21:10,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:21:10,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:21:10,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:21:10,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:21:10,770 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 161 [2025-03-14 01:21:10,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 244 transitions, 1330 flow. Second operand has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:21:10,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:21:10,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 161 [2025-03-14 01:21:10,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:21:14,126 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([412] L693-8-->L693-7: Formula: (= |v_#race~c~0_15| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_15|} AuxVars[] AssignedVars[#race~c~0][297], [111#L693-7true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 151#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 116#L693-10true, Black: 174#true, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 67#L693-10true, 160#true, 184#true]) [2025-03-14 01:21:14,126 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2025-03-14 01:21:14,126 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:21:14,126 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:21:14,126 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:21:14,136 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([544] L693-8-->L693-7: Formula: (= |v_#race~c~0_6| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_6|} AuxVars[] AssignedVars[#race~c~0][295], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 102#L693-7true, 151#L693-6true, 118#L693-10true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 116#L693-10true, Black: 174#true, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2025-03-14 01:21:14,136 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2025-03-14 01:21:14,136 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:21:14,136 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:21:14,136 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:21:14,140 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([574] L693-8-->L693-7: Formula: (= |v_#race~c~0_6| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_6|} AuxVars[] AssignedVars[#race~c~0][294], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 151#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 118#L693-10true, 158#true, Black: 174#true, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 67#L693-10true, 184#true, 68#L693-7true]) [2025-03-14 01:21:14,140 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2025-03-14 01:21:14,140 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:21:14,140 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:21:14,140 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:21:14,438 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L693-2-->L693: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_3|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][300], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 118#L693-10true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 5#L693true, 116#L693-10true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 67#L693-10true, 160#true, 184#true]) [2025-03-14 01:21:14,438 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2025-03-14 01:21:14,438 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-14 01:21:14,438 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-14 01:21:14,438 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-14 01:21:15,025 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L693-2-->L693: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_3|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][281], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 118#L693-10true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 5#L693true, Black: 176#(= |#race~c~0| 0), 112#L693-8true, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 67#L693-10true, 160#true, 184#true]) [2025-03-14 01:21:15,025 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2025-03-14 01:21:15,025 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-14 01:21:15,025 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-14 01:21:15,025 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-14 01:21:15,043 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L693-2-->L693: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_3|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][253], [162#true, 77#L693-8true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 5#L693true, Black: 176#(= |#race~c~0| 0), 116#L693-10true, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 67#L693-10true, 160#true, 184#true]) [2025-03-14 01:21:15,044 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2025-03-14 01:21:15,044 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-14 01:21:15,044 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-14 01:21:15,044 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-14 01:21:15,048 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L693-2-->L693: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_3|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][282], [139#L693-8true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 118#L693-10true, 158#true, 5#L693true, Black: 176#(= |#race~c~0| 0), 116#L693-10true, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2025-03-14 01:21:15,049 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2025-03-14 01:21:15,049 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-14 01:21:15,049 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-14 01:21:15,049 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-14 01:21:15,674 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([544] L693-8-->L693-7: Formula: (= |v_#race~c~0_6| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_6|} AuxVars[] AssignedVars[#race~c~0][151], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 102#L693-7true, 151#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 95#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 158#true, Black: 174#true, 179#true, 156#true, 15#L693-6true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2025-03-14 01:21:15,674 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2025-03-14 01:21:15,674 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-14 01:21:15,674 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-14 01:21:15,674 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-14 01:21:15,699 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([412] L693-8-->L693-7: Formula: (= |v_#race~c~0_15| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_15|} AuxVars[] AssignedVars[#race~c~0][152], [111#L693-7true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 151#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 95#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 81#L693-6true, 158#true, Black: 174#true, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2025-03-14 01:21:15,699 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2025-03-14 01:21:15,699 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-14 01:21:15,699 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-14 01:21:15,699 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-14 01:21:15,765 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([574] L693-8-->L693-7: Formula: (= |v_#race~c~0_6| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_6|} AuxVars[] AssignedVars[#race~c~0][155], [114#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 151#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 174#true, 179#true, 15#L693-6true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true, 68#L693-7true]) [2025-03-14 01:21:15,765 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2025-03-14 01:21:15,765 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-14 01:21:15,765 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-14 01:21:15,765 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-14 01:21:15,781 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L693-2-->L693: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_3|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][220], [114#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 5#L693true, Black: 176#(= |#race~c~0| 0), 116#L693-10true, 179#true, 15#L693-6true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2025-03-14 01:21:15,781 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2025-03-14 01:21:15,781 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-14 01:21:15,781 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-14 01:21:15,781 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-14 01:21:15,812 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([574] L693-8-->L693-7: Formula: (= |v_#race~c~0_6| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_6|} AuxVars[] AssignedVars[#race~c~0][155], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 151#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 81#L693-6true, 158#true, Black: 174#true, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 82#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, 184#true, 68#L693-7true]) [2025-03-14 01:21:15,812 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2025-03-14 01:21:15,812 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-14 01:21:15,812 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-14 01:21:15,812 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-14 01:21:15,816 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L693-2-->L693: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_3|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][220], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 81#L693-6true, 158#true, 5#L693true, Black: 176#(= |#race~c~0| 0), 116#L693-10true, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true, 82#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue]) [2025-03-14 01:21:15,816 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2025-03-14 01:21:15,816 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-14 01:21:15,816 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-14 01:21:15,816 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-14 01:21:16,064 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L693-2-->L693: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_3|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][219], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 95#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 158#true, 5#L693true, Black: 176#(= |#race~c~0| 0), 179#true, 15#L693-6true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 67#L693-10true, 160#true, 184#true]) [2025-03-14 01:21:16,065 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2025-03-14 01:21:16,065 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-14 01:21:16,065 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-14 01:21:16,065 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-14 01:21:16,110 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([488] L693-2-->L693: Formula: (= |v_#race~c~0_12| |v_ULTIMATE.start_thr1_#t~nondet3#1_5|) InVars {ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_5|} OutVars{#race~c~0=|v_#race~c~0_12|, ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_5|} AuxVars[] AssignedVars[#race~c~0][214], [114#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 151#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 116#L693-10true, Black: 176#(= |#race~c~0| 0), 156#true, 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), Black: 179#true, 160#true, 135#L693true, 184#true]) [2025-03-14 01:21:16,110 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2025-03-14 01:21:16,110 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-14 01:21:16,110 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-14 01:21:16,110 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-14 01:21:16,335 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([556] L693-2-->L693: Formula: (= |v_#race~c~0_3| |v_thr1Thread1of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread1of3ForFork0_#t~nondet3#1=|v_thr1Thread1of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread1of3ForFork0_#t~nondet3#1=|v_thr1Thread1of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][173], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 151#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 119#L693true, 116#L693-10true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 82#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, 184#true]) [2025-03-14 01:21:16,336 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2025-03-14 01:21:16,336 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-14 01:21:16,336 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-14 01:21:16,336 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-14 01:21:16,367 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([488] L693-2-->L693: Formula: (= |v_#race~c~0_12| |v_ULTIMATE.start_thr1_#t~nondet3#1_5|) InVars {ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_5|} OutVars{#race~c~0=|v_#race~c~0_12|, ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_5|} AuxVars[] AssignedVars[#race~c~0][166], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 151#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 95#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 158#true, Black: 176#(= |#race~c~0| 0), 156#true, 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), Black: 179#true, 160#true, 67#L693-10true, 135#L693true, 184#true]) [2025-03-14 01:21:16,367 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2025-03-14 01:21:16,367 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-14 01:21:16,367 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-14 01:21:16,367 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-14 01:21:17,006 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([488] L693-2-->L693: Formula: (= |v_#race~c~0_12| |v_ULTIMATE.start_thr1_#t~nondet3#1_5|) InVars {ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_5|} OutVars{#race~c~0=|v_#race~c~0_12|, ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_5|} AuxVars[] AssignedVars[#race~c~0][68], [139#L693-8true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 151#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 95#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 158#true, Black: 176#(= |#race~c~0| 0), 156#true, 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), Black: 179#true, 160#true, 135#L693true, 184#true]) [2025-03-14 01:21:17,006 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2025-03-14 01:21:17,006 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-14 01:21:17,006 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-14 01:21:17,006 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-14 01:21:17,011 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L693-2-->L693: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_3|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][183], [139#L693-8true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 95#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 158#true, 5#L693true, Black: 176#(= |#race~c~0| 0), 179#true, 15#L693-6true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2025-03-14 01:21:17,011 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2025-03-14 01:21:17,011 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-14 01:21:17,011 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-14 01:21:17,011 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-14 01:21:17,036 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([556] L693-2-->L693: Formula: (= |v_#race~c~0_3| |v_thr1Thread1of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread1of3ForFork0_#t~nondet3#1=|v_thr1Thread1of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread1of3ForFork0_#t~nondet3#1=|v_thr1Thread1of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][70], [162#true, 77#L693-8true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 151#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 95#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 119#L693true, 158#true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2025-03-14 01:21:17,037 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2025-03-14 01:21:17,037 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-14 01:21:17,037 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-14 01:21:17,037 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-14 01:21:17,041 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L693-2-->L693: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_3|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][183], [162#true, 77#L693-8true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 95#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 81#L693-6true, 158#true, 5#L693true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2025-03-14 01:21:17,041 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2025-03-14 01:21:17,041 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-14 01:21:17,041 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-14 01:21:17,041 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-14 01:21:17,123 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([488] L693-2-->L693: Formula: (= |v_#race~c~0_12| |v_ULTIMATE.start_thr1_#t~nondet3#1_5|) InVars {ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_5|} OutVars{#race~c~0=|v_#race~c~0_12|, ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_5|} AuxVars[] AssignedVars[#race~c~0][68], [114#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 151#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 176#(= |#race~c~0| 0), 112#L693-8true, 156#true, 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), Black: 179#true, 160#true, 135#L693true, 184#true]) [2025-03-14 01:21:17,123 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2025-03-14 01:21:17,123 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-14 01:21:17,123 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-14 01:21:17,123 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-14 01:21:17,152 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L693-2-->L693: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_3|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][183], [114#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 5#L693true, Black: 176#(= |#race~c~0| 0), 112#L693-8true, 179#true, 156#true, 15#L693-6true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2025-03-14 01:21:17,152 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2025-03-14 01:21:17,152 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-14 01:21:17,152 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-14 01:21:17,152 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-14 01:21:17,186 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([556] L693-2-->L693: Formula: (= |v_#race~c~0_3| |v_thr1Thread1of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread1of3ForFork0_#t~nondet3#1=|v_thr1Thread1of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread1of3ForFork0_#t~nondet3#1=|v_thr1Thread1of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][70], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 151#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 119#L693true, 158#true, Black: 176#(= |#race~c~0| 0), 112#L693-8true, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 82#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, 184#true]) [2025-03-14 01:21:17,186 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2025-03-14 01:21:17,186 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-14 01:21:17,186 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-14 01:21:17,186 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-14 01:21:17,198 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L693-2-->L693: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_3|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][183], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 81#L693-6true, 158#true, 5#L693true, Black: 176#(= |#race~c~0| 0), 112#L693-8true, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 82#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, 184#true]) [2025-03-14 01:21:17,198 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2025-03-14 01:21:17,198 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-14 01:21:17,198 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-14 01:21:17,198 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-14 01:21:17,440 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([544] L693-8-->L693-7: Formula: (= |v_#race~c~0_6| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_6|} AuxVars[] AssignedVars[#race~c~0][313], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 102#L693-7true, 151#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 116#L693-10true, Black: 174#true, 156#true, 179#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 7#L693-1true, 184#true]) [2025-03-14 01:21:17,440 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2025-03-14 01:21:17,440 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2025-03-14 01:21:17,440 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2025-03-14 01:21:17,440 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2025-03-14 01:21:17,501 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([510] L693-11-->L693-9: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_9|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_9|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][147], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 153#L693-9true, 158#true, 69#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, 17#L694-3true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 67#L693-10true, 160#true, 184#true]) [2025-03-14 01:21:17,501 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is not cut-off event [2025-03-14 01:21:17,501 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is not cut-off event [2025-03-14 01:21:17,501 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is not cut-off event [2025-03-14 01:21:17,501 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is not cut-off event [2025-03-14 01:21:17,510 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([574] L693-8-->L693-7: Formula: (= |v_#race~c~0_6| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_6|} AuxVars[] AssignedVars[#race~c~0][311], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 151#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 174#true, 156#true, 179#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 67#L693-10true, 7#L693-1true, 184#true, 68#L693-7true]) [2025-03-14 01:21:17,510 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2025-03-14 01:21:17,510 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2025-03-14 01:21:17,510 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2025-03-14 01:21:17,510 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2025-03-14 01:21:17,892 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L693-2-->L693: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_3|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][314], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 5#L693true, 116#L693-10true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 67#L693-10true, 160#true, 7#L693-1true, 184#true]) [2025-03-14 01:21:17,892 INFO L294 olderBase$Statistics]: this new event has 91 ancestors and is cut-off event [2025-03-14 01:21:17,892 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2025-03-14 01:21:17,892 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2025-03-14 01:21:17,892 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2025-03-14 01:21:18,054 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([510] L693-11-->L693-9: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_9|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_9|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][147], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 153#L693-9true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 69#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 90#L694true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 67#L693-10true, 160#true, 184#true]) [2025-03-14 01:21:18,054 INFO L294 olderBase$Statistics]: this new event has 88 ancestors and is not cut-off event [2025-03-14 01:21:18,054 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is not cut-off event [2025-03-14 01:21:18,054 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is not cut-off event [2025-03-14 01:21:18,054 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is not cut-off event [2025-03-14 01:21:18,064 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([574] L693-8-->L693-7: Formula: (= |v_#race~c~0_6| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_6|} AuxVars[] AssignedVars[#race~c~0][129], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 100#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 174#true, 179#true, 156#true, 39#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 67#L693-10true, 160#true, 184#true, 68#L693-7true]) [2025-03-14 01:21:18,064 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2025-03-14 01:21:18,064 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2025-03-14 01:21:18,064 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2025-03-14 01:21:18,064 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2025-03-14 01:21:18,178 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([544] L693-8-->L693-7: Formula: (= |v_#race~c~0_6| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_6|} AuxVars[] AssignedVars[#race~c~0][128], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 102#L693-7true, 100#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 116#L693-10true, Black: 174#true, 179#true, 156#true, 39#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2025-03-14 01:21:18,179 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2025-03-14 01:21:18,179 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2025-03-14 01:21:18,179 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2025-03-14 01:21:18,179 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2025-03-14 01:21:18,324 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L693-2-->L693: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_3|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][307], [139#L693-8true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 5#L693true, 116#L693-10true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 7#L693-1true, 184#true]) [2025-03-14 01:21:18,324 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2025-03-14 01:21:18,324 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2025-03-14 01:21:18,324 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2025-03-14 01:21:18,324 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2025-03-14 01:21:18,407 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L693-2-->L693: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_3|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][253], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 5#L693true, Black: 176#(= |#race~c~0| 0), 116#L693-10true, 17#L694-3true, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 67#L693-10true, 160#true, 184#true]) [2025-03-14 01:21:18,407 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2025-03-14 01:21:18,407 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2025-03-14 01:21:18,407 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2025-03-14 01:21:18,407 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2025-03-14 01:21:18,422 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L693-2-->L693: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_3|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][306], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 5#L693true, Black: 176#(= |#race~c~0| 0), 112#L693-8true, 156#true, 179#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 67#L693-10true, 160#true, 7#L693-1true, 184#true]) [2025-03-14 01:21:18,422 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2025-03-14 01:21:18,422 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2025-03-14 01:21:18,422 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2025-03-14 01:21:18,422 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2025-03-14 01:21:20,120 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([586] L693-2-->L693: Formula: (= |v_#race~c~0_3| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][174], [162#true, 88#L693true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 90#L694true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 39#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, 67#L693-10true, 160#true, 184#true]) [2025-03-14 01:21:20,120 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2025-03-14 01:21:20,120 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-14 01:21:20,120 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-14 01:21:20,120 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-14 01:21:20,121 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L693-2-->L693: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_3|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][219], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 69#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, 5#L693true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 90#L694true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 67#L693-10true, 184#true]) [2025-03-14 01:21:20,121 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2025-03-14 01:21:20,121 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-14 01:21:20,121 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-14 01:21:20,121 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-14 01:21:20,412 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([510] L693-11-->L693-9: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_9|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_9|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][256], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 153#L693-9true, 158#true, 51#L694true, Black: 176#(= |#race~c~0| 0), 156#true, 179#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 12#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, 160#true, 7#L693-1true, 184#true]) [2025-03-14 01:21:20,412 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is not cut-off event [2025-03-14 01:21:20,412 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is not cut-off event [2025-03-14 01:21:20,412 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is not cut-off event [2025-03-14 01:21:20,412 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is not cut-off event [2025-03-14 01:21:21,608 INFO L124 PetriNetUnfolderBase]: 57922/139420 cut-off events. [2025-03-14 01:21:21,609 INFO L125 PetriNetUnfolderBase]: For 335740/355750 co-relation queries the response was YES. [2025-03-14 01:21:22,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 401363 conditions, 139420 events. 57922/139420 cut-off events. For 335740/355750 co-relation queries the response was YES. Maximal size of possible extension queue 4969. Compared 1909658 event pairs, 16715 based on Foata normal form. 382/112176 useless extension candidates. Maximal degree in co-relation 401352. Up to 59162 conditions per place. [2025-03-14 01:21:23,109 INFO L140 encePairwiseOnDemand]: 148/161 looper letters, 112 selfloop transitions, 76 changer transitions 0/315 dead transitions. [2025-03-14 01:21:23,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 315 transitions, 2301 flow [2025-03-14 01:21:23,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:21:23,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:21:23,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 409 transitions. [2025-03-14 01:21:23,111 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8467908902691511 [2025-03-14 01:21:23,111 INFO L175 Difference]: Start difference. First operand has 162 places, 244 transitions, 1330 flow. Second operand 3 states and 409 transitions. [2025-03-14 01:21:23,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 315 transitions, 2301 flow [2025-03-14 01:21:25,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 315 transitions, 2097 flow, removed 46 selfloop flow, removed 2 redundant places. [2025-03-14 01:21:25,671 INFO L231 Difference]: Finished difference. Result has 164 places, 308 transitions, 2136 flow [2025-03-14 01:21:25,671 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=1198, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2136, PETRI_PLACES=164, PETRI_TRANSITIONS=308} [2025-03-14 01:21:25,671 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 5 predicate places. [2025-03-14 01:21:25,671 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 308 transitions, 2136 flow [2025-03-14 01:21:25,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:21:25,672 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:21:25,672 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] [2025-03-14 01:21:25,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-14 01:21:25,672 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-14 01:21:25,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:21:25,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1726910291, now seen corresponding path program 1 times [2025-03-14 01:21:25,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:21:25,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944031892] [2025-03-14 01:21:25,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:21:25,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:21:25,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-14 01:21:25,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-14 01:21:25,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:21:25,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:21:25,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:21:25,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:21:25,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944031892] [2025-03-14 01:21:25,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944031892] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:21:25,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:21:25,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:21:25,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203467772] [2025-03-14 01:21:25,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:21:25,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:21:25,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:21:25,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:21:25,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:21:25,748 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 161 [2025-03-14 01:21:25,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 308 transitions, 2136 flow. Second operand has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:21:25,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:21:25,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 161 [2025-03-14 01:21:25,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:21:27,210 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([574] L693-8-->L693-7: Formula: (= |v_#race~c~0_6| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_6|} AuxVars[] AssignedVars[#race~c~0][129], [189#true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 40#L692true, Black: 174#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 67#L693-10true, Black: 186#(= |thr1Thread2of3ForFork0_#t~nondet2#1| |#race~c~0|), 184#true, 82#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, 68#L693-7true]) [2025-03-14 01:21:27,211 INFO L294 olderBase$Statistics]: this new event has 73 ancestors and is cut-off event [2025-03-14 01:21:27,211 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-03-14 01:21:27,211 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-03-14 01:21:27,211 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-03-14 01:21:27,386 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([574] L693-8-->L693-7: Formula: (= |v_#race~c~0_6| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_6|} AuxVars[] AssignedVars[#race~c~0][189], [189#true, 114#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 118#L693-10true, 158#true, 40#L692true, Black: 174#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, Black: 186#(= |thr1Thread2of3ForFork0_#t~nondet2#1| |#race~c~0|), 184#true, 68#L693-7true]) [2025-03-14 01:21:27,386 INFO L294 olderBase$Statistics]: this new event has 73 ancestors and is not cut-off event [2025-03-14 01:21:27,386 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is not cut-off event [2025-03-14 01:21:27,386 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is not cut-off event [2025-03-14 01:21:27,386 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is not cut-off event [2025-03-14 01:21:28,351 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([510] L693-11-->L693-9: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_9|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_9|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][217], [189#true, 114#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 153#L693-9true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 118#L693-10true, 158#true, Black: 176#(= |#race~c~0| 0), 112#L693-8true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, Black: 186#(= |thr1Thread2of3ForFork0_#t~nondet2#1| |#race~c~0|), 184#true]) [2025-03-14 01:21:28,351 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is not cut-off event [2025-03-14 01:21:28,352 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is not cut-off event [2025-03-14 01:21:28,352 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is not cut-off event [2025-03-14 01:21:28,352 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is not cut-off event [2025-03-14 01:21:28,377 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([510] L693-11-->L693-9: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_9|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_9|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][146], [189#true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 153#L693-9true, 158#true, Black: 176#(= |#race~c~0| 0), 112#L693-8true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 67#L693-10true, 160#true, Black: 186#(= |thr1Thread2of3ForFork0_#t~nondet2#1| |#race~c~0|), 184#true, 82#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue]) [2025-03-14 01:21:28,378 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is not cut-off event [2025-03-14 01:21:28,378 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is not cut-off event [2025-03-14 01:21:28,378 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is not cut-off event [2025-03-14 01:21:28,378 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is not cut-off event [2025-03-14 01:21:29,102 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([574] L693-8-->L693-7: Formula: (= |v_#race~c~0_6| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_6|} AuxVars[] AssignedVars[#race~c~0][156], [189#true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 81#L693-6true, 158#true, 40#L692true, Black: 174#true, 156#true, 15#L693-6true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, Black: 186#(= |thr1Thread2of3ForFork0_#t~nondet2#1| |#race~c~0|), 184#true, 68#L693-7true]) [2025-03-14 01:21:29,103 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2025-03-14 01:21:29,103 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2025-03-14 01:21:29,103 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2025-03-14 01:21:29,103 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2025-03-14 01:21:29,465 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([412] L693-8-->L693-7: Formula: (= |v_#race~c~0_15| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_15|} AuxVars[] AssignedVars[#race~c~0][335], [111#L693-7true, 189#true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 151#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 116#L693-10true, Black: 174#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 67#L693-10true, Black: 186#(= |thr1Thread2of3ForFork0_#t~nondet2#1| |#race~c~0|), 184#true]) [2025-03-14 01:21:29,465 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2025-03-14 01:21:29,465 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:21:29,465 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:21:29,465 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:21:29,477 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([544] L693-8-->L693-7: Formula: (= |v_#race~c~0_6| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_6|} AuxVars[] AssignedVars[#race~c~0][334], [189#true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 102#L693-7true, 151#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 118#L693-10true, 158#true, 116#L693-10true, Black: 174#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, Black: 186#(= |thr1Thread2of3ForFork0_#t~nondet2#1| |#race~c~0|), 184#true]) [2025-03-14 01:21:29,477 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2025-03-14 01:21:29,477 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:21:29,477 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:21:29,477 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:21:29,481 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([574] L693-8-->L693-7: Formula: (= |v_#race~c~0_6| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_6|} AuxVars[] AssignedVars[#race~c~0][332], [189#true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 151#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 118#L693-10true, 158#true, Black: 174#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 67#L693-10true, Black: 186#(= |thr1Thread2of3ForFork0_#t~nondet2#1| |#race~c~0|), 184#true, 68#L693-7true]) [2025-03-14 01:21:29,482 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2025-03-14 01:21:29,482 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:21:29,482 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:21:29,482 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:21:29,599 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L693-2-->L693: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_3|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][339], [189#true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 118#L693-10true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 5#L693true, 116#L693-10true, Black: 176#(= |#race~c~0| 0), 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 67#L693-10true, Black: 186#(= |thr1Thread2of3ForFork0_#t~nondet2#1| |#race~c~0|), 184#true]) [2025-03-14 01:21:29,600 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2025-03-14 01:21:29,600 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-14 01:21:29,600 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-14 01:21:29,600 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-14 01:21:29,714 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([488] L693-2-->L693: Formula: (= |v_#race~c~0_12| |v_ULTIMATE.start_thr1_#t~nondet3#1_5|) InVars {ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_5|} OutVars{#race~c~0=|v_#race~c~0_12|, ULTIMATE.start_thr1_#t~nondet3#1=|v_ULTIMATE.start_thr1_#t~nondet3#1_5|} AuxVars[] AssignedVars[#race~c~0][68], [189#true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 81#L693-6true, 158#true, Black: 176#(= |#race~c~0| 0), 40#L692true, 112#L693-8true, 156#true, Black: 179#true, 160#true, 135#L693true, Black: 186#(= |thr1Thread2of3ForFork0_#t~nondet2#1| |#race~c~0|), 184#true]) [2025-03-14 01:21:29,714 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2025-03-14 01:21:29,714 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-03-14 01:21:29,714 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-03-14 01:21:29,714 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-03-14 01:21:29,860 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([412] L693-8-->L693-7: Formula: (= |v_#race~c~0_15| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_15|} AuxVars[] AssignedVars[#race~c~0][153], [111#L693-7true, 189#true, 114#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 151#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 95#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 158#true, Black: 174#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, Black: 186#(= |thr1Thread2of3ForFork0_#t~nondet2#1| |#race~c~0|), 184#true]) [2025-03-14 01:21:29,860 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2025-03-14 01:21:29,860 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:21:29,860 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:21:29,860 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:21:29,863 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([574] L693-8-->L693-7: Formula: (= |v_#race~c~0_6| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_6|} AuxVars[] AssignedVars[#race~c~0][189], [189#true, 114#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 118#L693-10true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 174#true, 156#true, 39#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, Black: 186#(= |thr1Thread2of3ForFork0_#t~nondet2#1| |#race~c~0|), 184#true, 68#L693-7true]) [2025-03-14 01:21:29,863 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2025-03-14 01:21:29,863 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:21:29,863 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:21:29,863 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:21:30,147 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([574] L693-8-->L693-7: Formula: (= |v_#race~c~0_6| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_6|} AuxVars[] AssignedVars[#race~c~0][129], [189#true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 174#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 39#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, 160#true, 67#L693-10true, Black: 186#(= |thr1Thread2of3ForFork0_#t~nondet2#1| |#race~c~0|), 82#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, 184#true, 68#L693-7true]) [2025-03-14 01:21:30,148 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2025-03-14 01:21:30,148 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:21:30,148 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:21:30,148 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:21:30,185 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([412] L693-8-->L693-7: Formula: (= |v_#race~c~0_15| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_15|} AuxVars[] AssignedVars[#race~c~0][188], [111#L693-7true, 114#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 189#true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 116#L693-10true, Black: 174#true, 156#true, 39#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, Black: 186#(= |thr1Thread2of3ForFork0_#t~nondet2#1| |#race~c~0|), 184#true]) [2025-03-14 01:21:30,186 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2025-03-14 01:21:30,186 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:21:30,186 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:21:30,186 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-14 01:21:30,543 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L693-2-->L693: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_3|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][313], [189#true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 118#L693-10true, 158#true, 5#L693true, Black: 176#(= |#race~c~0| 0), 112#L693-8true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 67#L693-10true, Black: 186#(= |thr1Thread2of3ForFork0_#t~nondet2#1| |#race~c~0|), 184#true]) [2025-03-14 01:21:30,543 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2025-03-14 01:21:30,543 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-14 01:21:30,543 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-14 01:21:30,543 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-14 01:21:30,545 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L693-2-->L693: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_3|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][233], [189#true, 114#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 5#L693true, 116#L693-10true, Black: 176#(= |#race~c~0| 0), 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, Black: 186#(= |thr1Thread2of3ForFork0_#t~nondet2#1| |#race~c~0|), 184#true, 82#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue]) [2025-03-14 01:21:30,545 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2025-03-14 01:21:30,545 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-14 01:21:30,545 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-14 01:21:30,545 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-14 01:21:30,564 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L693-2-->L693: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_3|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][267], [189#true, 162#true, 77#L693-8true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 5#L693true, Black: 176#(= |#race~c~0| 0), 116#L693-10true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 67#L693-10true, Black: 186#(= |thr1Thread2of3ForFork0_#t~nondet2#1| |#race~c~0|), 184#true]) [2025-03-14 01:21:30,565 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2025-03-14 01:21:30,565 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-14 01:21:30,565 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-14 01:21:30,565 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-14 01:21:30,572 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L693-2-->L693: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_3|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][314], [139#L693-8true, 189#true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 118#L693-10true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 5#L693true, 116#L693-10true, Black: 176#(= |#race~c~0| 0), 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, Black: 186#(= |thr1Thread2of3ForFork0_#t~nondet2#1| |#race~c~0|), 184#true]) [2025-03-14 01:21:30,572 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2025-03-14 01:21:30,572 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-14 01:21:30,572 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-14 01:21:30,572 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-14 01:21:30,592 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([526] L693-2-->L693: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_3|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_3|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][275], [189#true, 114#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 118#L693-10true, 95#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 158#true, 5#L693true, Black: 176#(= |#race~c~0| 0), 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, Black: 186#(= |thr1Thread2of3ForFork0_#t~nondet2#1| |#race~c~0|), 184#true]) [2025-03-14 01:21:30,592 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2025-03-14 01:21:30,592 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-14 01:21:30,592 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-14 01:21:30,592 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-14 01:21:30,728 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([510] L693-11-->L693-9: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet2#1_3| |v_#race~c~0_9|) InVars {thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} OutVars{#race~c~0=|v_#race~c~0_9|, thr1Thread3of3ForFork0_#t~nondet2#1=|v_thr1Thread3of3ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[#race~c~0][169], [189#true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 153#L693-9true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 81#L693-6true, 158#true, Black: 176#(= |#race~c~0| 0), 112#L693-8true, 156#true, 15#L693-6true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, Black: 186#(= |thr1Thread2of3ForFork0_#t~nondet2#1| |#race~c~0|), 184#true]) [2025-03-14 01:21:30,728 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is not cut-off event [2025-03-14 01:21:30,728 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is not cut-off event [2025-03-14 01:21:30,728 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is not cut-off event [2025-03-14 01:21:30,728 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is not cut-off event [2025-03-14 01:21:31,492 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([544] L693-8-->L693-7: Formula: (= |v_#race~c~0_6| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_6|} AuxVars[] AssignedVars[#race~c~0][152], [189#true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 102#L693-7true, 151#L693-6true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 95#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 158#true, Black: 174#true, 156#true, 15#L693-6true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, Black: 186#(= |thr1Thread2of3ForFork0_#t~nondet2#1| |#race~c~0|), 184#true]) [2025-03-14 01:21:31,493 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2025-03-14 01:21:31,493 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-14 01:21:31,493 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-14 01:21:31,493 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event