./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 8fc3dc66 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-?-8fc3dc6-m [2025-03-17 10:46:50,544 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 10:46:50,596 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 10:46:50,599 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 10:46:50,603 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 10:46:50,620 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 10:46:50,622 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 10:46:50,622 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 10:46:50,622 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 10:46:50,623 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 10:46:50,623 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 10:46:50,623 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 10:46:50,624 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 10:46:50,624 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 10:46:50,624 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 10:46:50,624 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 10:46:50,624 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 10:46:50,624 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 10:46:50,624 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 10:46:50,625 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 10:46:50,625 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 10:46:50,625 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 10:46:50,625 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 10:46:50,625 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 10:46:50,625 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 10:46:50,625 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 10:46:50,625 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 10:46:50,625 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 10:46:50,625 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 10:46:50,625 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 10:46:50,625 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 10:46:50,625 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:46:50,626 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 10:46:50,626 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 10:46:50,626 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 10:46:50,626 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 10:46:50,626 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 10:46:50,626 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 10:46:50,626 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 10:46:50,626 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 10:46:50,627 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 10:46:50,627 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 10:46:50,627 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-17 10:46:50,843 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 10:46:50,849 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 10:46:50,851 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 10:46:50,852 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 10:46:50,852 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 10:46:50,853 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-17 10:46:51,969 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b61a11bcb/c8fa6899332a4562bf005d8f9827653d/FLAG516bd5e4b [2025-03-17 10:46:52,269 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 10:46:52,269 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs-pthread.i [2025-03-17 10:46:52,285 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b61a11bcb/c8fa6899332a4562bf005d8f9827653d/FLAG516bd5e4b [2025-03-17 10:46:52,295 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b61a11bcb/c8fa6899332a4562bf005d8f9827653d [2025-03-17 10:46:52,297 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 10:46:52,298 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 10:46:52,299 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 10:46:52,299 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 10:46:52,302 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 10:46:52,303 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:46:52" (1/1) ... [2025-03-17 10:46:52,304 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48d4705a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:46:52, skipping insertion in model container [2025-03-17 10:46:52,304 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:46:52" (1/1) ... [2025-03-17 10:46:52,328 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 10:46:52,527 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:46:52,537 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 10:46:52,565 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:46:52,588 INFO L204 MainTranslator]: Completed translation [2025-03-17 10:46:52,589 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:46:52 WrapperNode [2025-03-17 10:46:52,589 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 10:46:52,590 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 10:46:52,590 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 10:46:52,590 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 10:46:52,594 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:46:52" (1/1) ... [2025-03-17 10:46:52,602 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:46:52" (1/1) ... [2025-03-17 10:46:52,614 INFO L138 Inliner]: procedures = 164, calls = 17, calls flagged for inlining = 4, calls inlined = 5, statements flattened = 86 [2025-03-17 10:46:52,614 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 10:46:52,615 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 10:46:52,615 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 10:46:52,615 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 10:46:52,619 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:46:52" (1/1) ... [2025-03-17 10:46:52,619 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:46:52" (1/1) ... [2025-03-17 10:46:52,621 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:46:52" (1/1) ... [2025-03-17 10:46:52,621 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:46:52" (1/1) ... [2025-03-17 10:46:52,624 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:46:52" (1/1) ... [2025-03-17 10:46:52,625 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:46:52" (1/1) ... [2025-03-17 10:46:52,626 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:46:52" (1/1) ... [2025-03-17 10:46:52,626 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:46:52" (1/1) ... [2025-03-17 10:46:52,628 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 10:46:52,628 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 10:46:52,628 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 10:46:52,628 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 10:46:52,629 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:46:52" (1/1) ... [2025-03-17 10:46:52,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:46:52,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:46:52,655 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-17 10:46:52,657 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-17 10:46:52,673 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-17 10:46:52,673 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-17 10:46:52,673 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-17 10:46:52,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 10:46:52,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 10:46:52,673 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-17 10:46:52,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 10:46:52,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 10:46:52,674 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 10:46:52,770 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 10:46:52,772 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 10:46:52,943 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 10:46:52,943 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 10:46:52,966 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 10:46:52,968 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 10:46:52,968 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:46:52 BoogieIcfgContainer [2025-03-17 10:46:52,968 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 10:46:52,970 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 10:46:52,970 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 10:46:52,974 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 10:46:52,974 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 10:46:52" (1/3) ... [2025-03-17 10:46:52,975 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@105b4f27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:46:52, skipping insertion in model container [2025-03-17 10:46:52,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:46:52" (2/3) ... [2025-03-17 10:46:52,975 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@105b4f27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:46:52, skipping insertion in model container [2025-03-17 10:46:52,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:46:52" (3/3) ... [2025-03-17 10:46:52,976 INFO L128 eAbstractionObserver]: Analyzing ICFG 48_ticket_lock_low_contention_vs-pthread.i [2025-03-17 10:46:52,985 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 10:46:52,987 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-17 10:46:52,987 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 10:46:53,040 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 10:46:53,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 99 transitions, 202 flow [2025-03-17 10:46:53,108 INFO L124 PetriNetUnfolderBase]: 8/149 cut-off events. [2025-03-17 10:46:53,109 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 10:46:53,114 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 359 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-17 10:46:53,114 INFO L82 GeneralOperation]: Start removeDead. Operand has 97 places, 99 transitions, 202 flow [2025-03-17 10:46:53,119 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 99 transitions, 202 flow [2025-03-17 10:46:53,125 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 10:46:53,132 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;@339d2213, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 10:46:53,132 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-17 10:46:53,146 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 10:46:53,146 INFO L124 PetriNetUnfolderBase]: 2/49 cut-off events. [2025-03-17 10:46:53,146 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 10:46:53,147 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:46:53,147 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-17 10:46:53,147 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-17 10:46:53,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:46:53,152 INFO L85 PathProgramCache]: Analyzing trace with hash 834162335, now seen corresponding path program 1 times [2025-03-17 10:46:53,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:46:53,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999562503] [2025-03-17 10:46:53,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:46:53,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:46:53,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 10:46:53,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 10:46:53,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:46:53,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:46:53,292 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-17 10:46:53,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:46:53,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999562503] [2025-03-17 10:46:53,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999562503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:46:53,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:46:53,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:46:53,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150449236] [2025-03-17 10:46:53,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:46:53,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 10:46:53,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:46:53,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 10:46:53,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 10:46:53,333 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 99 [2025-03-17 10:46:53,335 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-17 10:46:53,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:46:53,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 99 [2025-03-17 10:46:53,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:46:53,381 INFO L124 PetriNetUnfolderBase]: 4/189 cut-off events. [2025-03-17 10:46:53,381 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 10:46:53,386 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 564 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-17 10:46:53,387 INFO L140 encePairwiseOnDemand]: 94/99 looper letters, 5 selfloop transitions, 0 changer transitions 0/90 dead transitions. [2025-03-17 10:46:53,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 90 transitions, 194 flow [2025-03-17 10:46:53,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 10:46:53,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-17 10:46:53,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 184 transitions. [2025-03-17 10:46:53,404 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9292929292929293 [2025-03-17 10:46:53,405 INFO L175 Difference]: Start difference. First operand has 97 places, 99 transitions, 202 flow. Second operand 2 states and 184 transitions. [2025-03-17 10:46:53,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 90 transitions, 194 flow [2025-03-17 10:46:53,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 90 transitions, 194 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 10:46:53,415 INFO L231 Difference]: Finished difference. Result has 94 places, 90 transitions, 184 flow [2025-03-17 10:46:53,418 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-17 10:46:53,421 INFO L279 CegarLoopForPetriNet]: 97 programPoint places, -3 predicate places. [2025-03-17 10:46:53,421 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 90 transitions, 184 flow [2025-03-17 10:46:53,422 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-17 10:46:53,422 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:46:53,422 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-17 10:46:53,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 10:46:53,422 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-17 10:46:53,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:46:53,423 INFO L85 PathProgramCache]: Analyzing trace with hash -326024485, now seen corresponding path program 1 times [2025-03-17 10:46:53,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:46:53,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414438109] [2025-03-17 10:46:53,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:46:53,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:46:53,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 10:46:53,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 10:46:53,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:46:53,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:46:53,490 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-17 10:46:53,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:46:53,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414438109] [2025-03-17 10:46:53,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414438109] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:46:53,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:46:53,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:46:53,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342406315] [2025-03-17 10:46:53,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:46:53,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:46:53,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:46:53,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:46:53,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:46:53,528 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 99 [2025-03-17 10:46:53,529 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-17 10:46:53,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:46:53,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 99 [2025-03-17 10:46:53,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:46:53,641 INFO L124 PetriNetUnfolderBase]: 59/448 cut-off events. [2025-03-17 10:46:53,642 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 10:46:53,644 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 2363 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-17 10:46:53,646 INFO L140 encePairwiseOnDemand]: 92/99 looper letters, 18 selfloop transitions, 6 changer transitions 0/97 dead transitions. [2025-03-17 10:46:53,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 97 transitions, 246 flow [2025-03-17 10:46:53,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:46:53,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:46:53,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 250 transitions. [2025-03-17 10:46:53,649 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8417508417508418 [2025-03-17 10:46:53,650 INFO L175 Difference]: Start difference. First operand has 94 places, 90 transitions, 184 flow. Second operand 3 states and 250 transitions. [2025-03-17 10:46:53,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 97 transitions, 246 flow [2025-03-17 10:46:53,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 97 transitions, 246 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 10:46:53,653 INFO L231 Difference]: Finished difference. Result has 98 places, 95 transitions, 230 flow [2025-03-17 10:46:53,654 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-17 10:46:53,654 INFO L279 CegarLoopForPetriNet]: 97 programPoint places, 1 predicate places. [2025-03-17 10:46:53,654 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 95 transitions, 230 flow [2025-03-17 10:46:53,655 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-17 10:46:53,655 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:46:53,655 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-17 10:46:53,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 10:46:53,655 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-17 10:46:53,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:46:53,657 INFO L85 PathProgramCache]: Analyzing trace with hash 2058423705, now seen corresponding path program 1 times [2025-03-17 10:46:53,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:46:53,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806204517] [2025-03-17 10:46:53,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:46:53,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:46:53,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 10:46:53,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 10:46:53,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:46:53,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:46:53,723 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-17 10:46:53,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:46:53,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806204517] [2025-03-17 10:46:53,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806204517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:46:53,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:46:53,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:46:53,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44848064] [2025-03-17 10:46:53,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:46:53,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:46:53,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:46:53,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:46:53,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:46:53,767 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 99 [2025-03-17 10:46:53,767 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-17 10:46:53,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:46:53,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 99 [2025-03-17 10:46:53,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:46:53,823 INFO L124 PetriNetUnfolderBase]: 64/427 cut-off events. [2025-03-17 10:46:53,823 INFO L125 PetriNetUnfolderBase]: For 46/48 co-relation queries the response was YES. [2025-03-17 10:46:53,824 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 2283 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-17 10:46:53,826 INFO L140 encePairwiseOnDemand]: 92/99 looper letters, 18 selfloop transitions, 7 changer transitions 0/102 dead transitions. [2025-03-17 10:46:53,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 102 transitions, 298 flow [2025-03-17 10:46:53,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:46:53,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:46:53,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 254 transitions. [2025-03-17 10:46:53,827 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8552188552188552 [2025-03-17 10:46:53,827 INFO L175 Difference]: Start difference. First operand has 98 places, 95 transitions, 230 flow. Second operand 3 states and 254 transitions. [2025-03-17 10:46:53,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 102 transitions, 298 flow [2025-03-17 10:46:53,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 102 transitions, 284 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:46:53,833 INFO L231 Difference]: Finished difference. Result has 100 places, 100 transitions, 270 flow [2025-03-17 10:46:53,833 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-17 10:46:53,834 INFO L279 CegarLoopForPetriNet]: 97 programPoint places, 3 predicate places. [2025-03-17 10:46:53,834 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 100 transitions, 270 flow [2025-03-17 10:46:53,834 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-17 10:46:53,835 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:46:53,835 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-17 10:46:53,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 10:46:53,835 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-17 10:46:53,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:46:53,835 INFO L85 PathProgramCache]: Analyzing trace with hash -56334708, now seen corresponding path program 1 times [2025-03-17 10:46:53,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:46:53,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167179479] [2025-03-17 10:46:53,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:46:53,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:46:53,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 10:46:53,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 10:46:53,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:46:53,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 10:46:53,858 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 10:46:53,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 10:46:53,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 10:46:53,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:46:53,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 10:46:53,884 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 10:46:53,884 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 10:46:53,885 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-03-17 10:46:53,886 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2025-03-17 10:46:53,887 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-03-17 10:46:53,887 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2025-03-17 10:46:53,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2025-03-17 10:46:53,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2025-03-17 10:46:53,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2025-03-17 10:46:53,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-03-17 10:46:53,889 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-03-17 10:46:53,889 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-03-17 10:46:53,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 10:46:53,890 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-17 10:46:53,893 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 10:46:53,894 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-17 10:46:53,919 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 10:46:53,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 130 transitions, 270 flow [2025-03-17 10:46:53,945 INFO L124 PetriNetUnfolderBase]: 13/230 cut-off events. [2025-03-17 10:46:53,946 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 10:46:53,947 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 785 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-17 10:46:53,947 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 130 transitions, 270 flow [2025-03-17 10:46:53,948 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 128 places, 130 transitions, 270 flow [2025-03-17 10:46:53,949 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 10:46:53,949 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@339d2213, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 10:46:53,949 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-03-17 10:46:53,952 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 10:46:53,952 INFO L124 PetriNetUnfolderBase]: 2/49 cut-off events. [2025-03-17 10:46:53,952 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 10:46:53,952 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:46:53,952 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-17 10:46:53,952 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-17 10:46:53,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:46:53,953 INFO L85 PathProgramCache]: Analyzing trace with hash 974291487, now seen corresponding path program 1 times [2025-03-17 10:46:53,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:46:53,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572021751] [2025-03-17 10:46:53,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:46:53,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:46:53,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 10:46:53,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 10:46:53,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:46:53,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:46:53,983 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-17 10:46:53,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:46:53,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572021751] [2025-03-17 10:46:53,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572021751] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:46:53,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:46:53,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:46:53,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907013932] [2025-03-17 10:46:53,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:46:53,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 10:46:53,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:46:53,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 10:46:53,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 10:46:53,989 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 130 [2025-03-17 10:46:53,990 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-17 10:46:53,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:46:53,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 130 [2025-03-17 10:46:53,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:46:54,048 INFO L124 PetriNetUnfolderBase]: 34/566 cut-off events. [2025-03-17 10:46:54,048 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-17 10:46:54,050 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 3284 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-17 10:46:54,052 INFO L140 encePairwiseOnDemand]: 123/130 looper letters, 8 selfloop transitions, 0 changer transitions 0/117 dead transitions. [2025-03-17 10:46:54,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 117 transitions, 260 flow [2025-03-17 10:46:54,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 10:46:54,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-17 10:46:54,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 239 transitions. [2025-03-17 10:46:54,054 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9192307692307692 [2025-03-17 10:46:54,054 INFO L175 Difference]: Start difference. First operand has 128 places, 130 transitions, 270 flow. Second operand 2 states and 239 transitions. [2025-03-17 10:46:54,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 117 transitions, 260 flow [2025-03-17 10:46:54,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 117 transitions, 260 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 10:46:54,056 INFO L231 Difference]: Finished difference. Result has 123 places, 117 transitions, 244 flow [2025-03-17 10:46:54,058 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-17 10:46:54,059 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, -5 predicate places. [2025-03-17 10:46:54,059 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 117 transitions, 244 flow [2025-03-17 10:46:54,059 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-17 10:46:54,059 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:46:54,059 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:46:54,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 10:46:54,059 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-17 10:46:54,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:46:54,061 INFO L85 PathProgramCache]: Analyzing trace with hash -446539875, now seen corresponding path program 1 times [2025-03-17 10:46:54,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:46:54,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926752391] [2025-03-17 10:46:54,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:46:54,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:46:54,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 10:46:54,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 10:46:54,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:46:54,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:46:54,118 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-17 10:46:54,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:46:54,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926752391] [2025-03-17 10:46:54,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926752391] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:46:54,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:46:54,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:46:54,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132919648] [2025-03-17 10:46:54,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:46:54,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:46:54,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:46:54,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:46:54,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:46:54,156 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 130 [2025-03-17 10:46:54,157 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-17 10:46:54,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:46:54,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 130 [2025-03-17 10:46:54,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:46:54,424 INFO L124 PetriNetUnfolderBase]: 845/3283 cut-off events. [2025-03-17 10:46:54,424 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-17 10:46:54,430 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 29784 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-17 10:46:54,443 INFO L140 encePairwiseOnDemand]: 120/130 looper letters, 26 selfloop transitions, 9 changer transitions 0/129 dead transitions. [2025-03-17 10:46:54,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 129 transitions, 338 flow [2025-03-17 10:46:54,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:46:54,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:46:54,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 327 transitions. [2025-03-17 10:46:54,444 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8384615384615385 [2025-03-17 10:46:54,444 INFO L175 Difference]: Start difference. First operand has 123 places, 117 transitions, 244 flow. Second operand 3 states and 327 transitions. [2025-03-17 10:46:54,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 129 transitions, 338 flow [2025-03-17 10:46:54,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 129 transitions, 338 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 10:46:54,448 INFO L231 Difference]: Finished difference. Result has 127 places, 125 transitions, 314 flow [2025-03-17 10:46:54,448 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-17 10:46:54,449 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, -1 predicate places. [2025-03-17 10:46:54,450 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 125 transitions, 314 flow [2025-03-17 10:46:54,450 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-17 10:46:54,450 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:46:54,450 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-17 10:46:54,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 10:46:54,450 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-17 10:46:54,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:46:54,451 INFO L85 PathProgramCache]: Analyzing trace with hash 809959577, now seen corresponding path program 1 times [2025-03-17 10:46:54,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:46:54,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380691795] [2025-03-17 10:46:54,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:46:54,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:46:54,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 10:46:54,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 10:46:54,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:46:54,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:46:54,494 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-17 10:46:54,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:46:54,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380691795] [2025-03-17 10:46:54,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380691795] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:46:54,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:46:54,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:46:54,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495630497] [2025-03-17 10:46:54,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:46:54,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:46:54,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:46:54,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:46:54,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:46:54,531 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 130 [2025-03-17 10:46:54,532 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-17 10:46:54,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:46:54,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 130 [2025-03-17 10:46:54,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:46:54,863 INFO L124 PetriNetUnfolderBase]: 1088/3830 cut-off events. [2025-03-17 10:46:54,864 INFO L125 PetriNetUnfolderBase]: For 861/1014 co-relation queries the response was YES. [2025-03-17 10:46:54,871 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 36139 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-17 10:46:54,886 INFO L140 encePairwiseOnDemand]: 120/130 looper letters, 30 selfloop transitions, 13 changer transitions 0/141 dead transitions. [2025-03-17 10:46:54,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 141 transitions, 459 flow [2025-03-17 10:46:54,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:46:54,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:46:54,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 332 transitions. [2025-03-17 10:46:54,889 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8512820512820513 [2025-03-17 10:46:54,889 INFO L175 Difference]: Start difference. First operand has 127 places, 125 transitions, 314 flow. Second operand 3 states and 332 transitions. [2025-03-17 10:46:54,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 141 transitions, 459 flow [2025-03-17 10:46:54,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 141 transitions, 433 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:46:54,899 INFO L231 Difference]: Finished difference. Result has 129 places, 136 transitions, 408 flow [2025-03-17 10:46:54,899 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-17 10:46:54,902 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, 1 predicate places. [2025-03-17 10:46:54,902 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 136 transitions, 408 flow [2025-03-17 10:46:54,903 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-17 10:46:54,903 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:46:54,903 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-17 10:46:54,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 10:46:54,903 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-17 10:46:54,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:46:54,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1355475727, now seen corresponding path program 1 times [2025-03-17 10:46:54,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:46:54,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384956317] [2025-03-17 10:46:54,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:46:54,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:46:54,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 10:46:54,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 10:46:54,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:46:54,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:46:54,938 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-17 10:46:54,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:46:54,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384956317] [2025-03-17 10:46:54,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384956317] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:46:54,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:46:54,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:46:54,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341383634] [2025-03-17 10:46:54,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:46:54,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:46:54,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:46:54,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:46:54,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:46:54,976 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 130 [2025-03-17 10:46:54,976 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-17 10:46:54,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:46:54,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 130 [2025-03-17 10:46:54,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:46:55,564 INFO L124 PetriNetUnfolderBase]: 2061/6890 cut-off events. [2025-03-17 10:46:55,565 INFO L125 PetriNetUnfolderBase]: For 3815/3995 co-relation queries the response was YES. [2025-03-17 10:46:55,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13659 conditions, 6890 events. 2061/6890 cut-off events. For 3815/3995 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 72152 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-17 10:46:55,604 INFO L140 encePairwiseOnDemand]: 115/130 looper letters, 44 selfloop transitions, 26 changer transitions 0/168 dead transitions. [2025-03-17 10:46:55,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 168 transitions, 707 flow [2025-03-17 10:46:55,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:46:55,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:46:55,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 336 transitions. [2025-03-17 10:46:55,606 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8615384615384616 [2025-03-17 10:46:55,606 INFO L175 Difference]: Start difference. First operand has 129 places, 136 transitions, 408 flow. Second operand 3 states and 336 transitions. [2025-03-17 10:46:55,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 168 transitions, 707 flow [2025-03-17 10:46:55,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 168 transitions, 663 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:46:55,614 INFO L231 Difference]: Finished difference. Result has 131 places, 161 transitions, 664 flow [2025-03-17 10:46:55,615 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-17 10:46:55,615 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, 3 predicate places. [2025-03-17 10:46:55,615 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 161 transitions, 664 flow [2025-03-17 10:46:55,615 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-17 10:46:55,615 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:46:55,615 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-17 10:46:55,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 10:46:55,616 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-17 10:46:55,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:46:55,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1420839283, now seen corresponding path program 1 times [2025-03-17 10:46:55,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:46:55,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144162236] [2025-03-17 10:46:55,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:46:55,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:46:55,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 10:46:55,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 10:46:55,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:46:55,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:46:55,641 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-17 10:46:55,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:46:55,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144162236] [2025-03-17 10:46:55,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144162236] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:46:55,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:46:55,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:46:55,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370849803] [2025-03-17 10:46:55,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:46:55,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:46:55,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:46:55,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:46:55,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:46:55,678 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 130 [2025-03-17 10:46:55,679 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-17 10:46:55,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:46:55,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 130 [2025-03-17 10:46:55,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:46:56,360 INFO L124 PetriNetUnfolderBase]: 2966/9755 cut-off events. [2025-03-17 10:46:56,361 INFO L125 PetriNetUnfolderBase]: For 15077/15566 co-relation queries the response was YES. [2025-03-17 10:46:56,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23389 conditions, 9755 events. 2966/9755 cut-off events. For 15077/15566 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 106121 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-17 10:46:56,413 INFO L140 encePairwiseOnDemand]: 120/130 looper letters, 60 selfloop transitions, 22 changer transitions 0/183 dead transitions. [2025-03-17 10:46:56,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 183 transitions, 976 flow [2025-03-17 10:46:56,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:46:56,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:46:56,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 327 transitions. [2025-03-17 10:46:56,415 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8384615384615385 [2025-03-17 10:46:56,417 INFO L175 Difference]: Start difference. First operand has 131 places, 161 transitions, 664 flow. Second operand 3 states and 327 transitions. [2025-03-17 10:46:56,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 183 transitions, 976 flow [2025-03-17 10:46:56,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 183 transitions, 908 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:46:56,427 INFO L231 Difference]: Finished difference. Result has 133 places, 179 transitions, 862 flow [2025-03-17 10:46:56,427 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-17 10:46:56,427 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, 5 predicate places. [2025-03-17 10:46:56,429 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 179 transitions, 862 flow [2025-03-17 10:46:56,429 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-17 10:46:56,429 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:46:56,429 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-17 10:46:56,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 10:46:56,429 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-17 10:46:56,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:46:56,430 INFO L85 PathProgramCache]: Analyzing trace with hash -2022155602, now seen corresponding path program 1 times [2025-03-17 10:46:56,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:46:56,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626695532] [2025-03-17 10:46:56,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:46:56,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:46:56,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 10:46:56,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 10:46:56,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:46:56,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:46:56,455 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-17 10:46:56,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:46:56,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626695532] [2025-03-17 10:46:56,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626695532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:46:56,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:46:56,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:46:56,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311108848] [2025-03-17 10:46:56,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:46:56,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:46:56,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:46:56,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:46:56,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:46:56,496 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 130 [2025-03-17 10:46:56,498 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-17 10:46:56,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:46:56,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 130 [2025-03-17 10:46:56,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:46:57,261 INFO L124 PetriNetUnfolderBase]: 3528/10620 cut-off events. [2025-03-17 10:46:57,262 INFO L125 PetriNetUnfolderBase]: For 19511/19963 co-relation queries the response was YES. [2025-03-17 10:46:57,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27729 conditions, 10620 events. 3528/10620 cut-off events. For 19511/19963 co-relation queries the response was YES. Maximal size of possible extension queue 504. Compared 115225 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-17 10:46:57,338 INFO L140 encePairwiseOnDemand]: 120/130 looper letters, 68 selfloop transitions, 36 changer transitions 0/209 dead transitions. [2025-03-17 10:46:57,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 209 transitions, 1284 flow [2025-03-17 10:46:57,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:46:57,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:46:57,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 331 transitions. [2025-03-17 10:46:57,340 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8487179487179487 [2025-03-17 10:46:57,340 INFO L175 Difference]: Start difference. First operand has 133 places, 179 transitions, 862 flow. Second operand 3 states and 331 transitions. [2025-03-17 10:46:57,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 209 transitions, 1284 flow [2025-03-17 10:46:57,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 209 transitions, 1184 flow, removed 20 selfloop flow, removed 2 redundant places. [2025-03-17 10:46:57,375 INFO L231 Difference]: Finished difference. Result has 135 places, 205 transitions, 1166 flow [2025-03-17 10:46:57,375 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-17 10:46:57,375 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, 7 predicate places. [2025-03-17 10:46:57,375 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 205 transitions, 1166 flow [2025-03-17 10:46:57,376 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-17 10:46:57,376 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:46:57,376 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:46:57,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 10:46:57,376 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-17 10:46:57,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:46:57,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1869603230, now seen corresponding path program 1 times [2025-03-17 10:46:57,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:46:57,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72412557] [2025-03-17 10:46:57,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:46:57,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:46:57,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 10:46:57,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 10:46:57,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:46:57,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:46:57,413 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-17 10:46:57,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:46:57,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72412557] [2025-03-17 10:46:57,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72412557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:46:57,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:46:57,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:46:57,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651011271] [2025-03-17 10:46:57,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:46:57,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:46:57,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:46:57,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:46:57,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:46:57,447 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 130 [2025-03-17 10:46:57,448 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-17 10:46:57,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:46:57,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 130 [2025-03-17 10:46:57,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:46:58,182 INFO L124 PetriNetUnfolderBase]: 4489/13143 cut-off events. [2025-03-17 10:46:58,182 INFO L125 PetriNetUnfolderBase]: For 33710/34309 co-relation queries the response was YES. [2025-03-17 10:46:58,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37383 conditions, 13143 events. 4489/13143 cut-off events. For 33710/34309 co-relation queries the response was YES. Maximal size of possible extension queue 583. Compared 145130 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-17 10:46:58,259 INFO L140 encePairwiseOnDemand]: 120/130 looper letters, 91 selfloop transitions, 38 changer transitions 0/236 dead transitions. [2025-03-17 10:46:58,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 236 transitions, 1685 flow [2025-03-17 10:46:58,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:46:58,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:46:58,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 332 transitions. [2025-03-17 10:46:58,261 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8512820512820513 [2025-03-17 10:46:58,261 INFO L175 Difference]: Start difference. First operand has 135 places, 205 transitions, 1166 flow. Second operand 3 states and 332 transitions. [2025-03-17 10:46:58,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 236 transitions, 1685 flow [2025-03-17 10:46:58,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 236 transitions, 1597 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:46:58,279 INFO L231 Difference]: Finished difference. Result has 137 places, 231 transitions, 1530 flow [2025-03-17 10:46:58,279 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-17 10:46:58,279 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, 9 predicate places. [2025-03-17 10:46:58,280 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 231 transitions, 1530 flow [2025-03-17 10:46:58,280 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-17 10:46:58,280 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:46:58,280 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-17 10:46:58,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 10:46:58,280 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-17 10:46:58,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:46:58,281 INFO L85 PathProgramCache]: Analyzing trace with hash -2000241481, now seen corresponding path program 1 times [2025-03-17 10:46:58,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:46:58,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912001461] [2025-03-17 10:46:58,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:46:58,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:46:58,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 10:46:58,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 10:46:58,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:46:58,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 10:46:58,289 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 10:46:58,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 10:46:58,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 10:46:58,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:46:58,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 10:46:58,296 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 10:46:58,296 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 10:46:58,296 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-03-17 10:46:58,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining) [2025-03-17 10:46:58,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining) [2025-03-17 10:46:58,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining) [2025-03-17 10:46:58,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining) [2025-03-17 10:46:58,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining) [2025-03-17 10:46:58,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining) [2025-03-17 10:46:58,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining) [2025-03-17 10:46:58,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining) [2025-03-17 10:46:58,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining) [2025-03-17 10:46:58,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining) [2025-03-17 10:46:58,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining) [2025-03-17 10:46:58,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining) [2025-03-17 10:46:58,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 10:46:58,298 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:46:58,298 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 10:46:58,298 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-17 10:46:58,315 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 10:46:58,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 161 transitions, 340 flow [2025-03-17 10:46:58,336 INFO L124 PetriNetUnfolderBase]: 18/311 cut-off events. [2025-03-17 10:46:58,337 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-17 10:46:58,338 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 1206 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-17 10:46:58,338 INFO L82 GeneralOperation]: Start removeDead. Operand has 159 places, 161 transitions, 340 flow [2025-03-17 10:46:58,341 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 159 places, 161 transitions, 340 flow [2025-03-17 10:46:58,342 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 10:46:58,342 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;@339d2213, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 10:46:58,343 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-03-17 10:46:58,345 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 10:46:58,345 INFO L124 PetriNetUnfolderBase]: 2/49 cut-off events. [2025-03-17 10:46:58,345 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 10:46:58,345 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:46:58,345 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-17 10:46:58,345 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-17 10:46:58,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:46:58,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1891679265, now seen corresponding path program 1 times [2025-03-17 10:46:58,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:46:58,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208696665] [2025-03-17 10:46:58,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:46:58,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:46:58,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 10:46:58,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 10:46:58,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:46:58,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:46:58,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:46:58,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:46:58,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208696665] [2025-03-17 10:46:58,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208696665] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:46:58,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:46:58,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:46:58,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513277777] [2025-03-17 10:46:58,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:46:58,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 10:46:58,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:46:58,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 10:46:58,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 10:46:58,363 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 161 [2025-03-17 10:46:58,363 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-17 10:46:58,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:46:58,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 161 [2025-03-17 10:46:58,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:46:58,497 INFO L124 PetriNetUnfolderBase]: 178/1732 cut-off events. [2025-03-17 10:46:58,498 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2025-03-17 10:46:58,503 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 14497 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-17 10:46:58,508 INFO L140 encePairwiseOnDemand]: 152/161 looper letters, 11 selfloop transitions, 0 changer transitions 0/144 dead transitions. [2025-03-17 10:46:58,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 144 transitions, 328 flow [2025-03-17 10:46:58,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 10:46:58,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-17 10:46:58,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 294 transitions. [2025-03-17 10:46:58,509 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9130434782608695 [2025-03-17 10:46:58,509 INFO L175 Difference]: Start difference. First operand has 159 places, 161 transitions, 340 flow. Second operand 2 states and 294 transitions. [2025-03-17 10:46:58,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 144 transitions, 328 flow [2025-03-17 10:46:58,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 144 transitions, 326 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-17 10:46:58,511 INFO L231 Difference]: Finished difference. Result has 152 places, 144 transitions, 304 flow [2025-03-17 10:46:58,511 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-17 10:46:58,513 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, -7 predicate places. [2025-03-17 10:46:58,513 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 144 transitions, 304 flow [2025-03-17 10:46:58,513 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-17 10:46:58,513 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:46:58,513 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:46:58,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 10:46:58,513 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-17 10:46:58,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:46:58,513 INFO L85 PathProgramCache]: Analyzing trace with hash -926175650, now seen corresponding path program 1 times [2025-03-17 10:46:58,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:46:58,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263719609] [2025-03-17 10:46:58,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:46:58,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:46:58,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 10:46:58,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 10:46:58,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:46:58,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:46:58,542 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-17 10:46:58,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:46:58,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263719609] [2025-03-17 10:46:58,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263719609] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:46:58,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:46:58,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:46:58,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654916518] [2025-03-17 10:46:58,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:46:58,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:46:58,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:46:58,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:46:58,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:46:58,595 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 161 [2025-03-17 10:46:58,596 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-17 10:46:58,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:46:58,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 161 [2025-03-17 10:46:58,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:46:59,876 INFO L124 PetriNetUnfolderBase]: 8153/23044 cut-off events. [2025-03-17 10:46:59,876 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2025-03-17 10:46:59,912 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-17 10:46:59,996 INFO L140 encePairwiseOnDemand]: 148/161 looper letters, 34 selfloop transitions, 12 changer transitions 0/161 dead transitions. [2025-03-17 10:46:59,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 161 transitions, 430 flow [2025-03-17 10:46:59,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:46:59,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:46:59,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 404 transitions. [2025-03-17 10:46:59,999 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8364389233954451 [2025-03-17 10:46:59,999 INFO L175 Difference]: Start difference. First operand has 152 places, 144 transitions, 304 flow. Second operand 3 states and 404 transitions. [2025-03-17 10:46:59,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 161 transitions, 430 flow [2025-03-17 10:47:00,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 161 transitions, 430 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 10:47:00,002 INFO L231 Difference]: Finished difference. Result has 156 places, 155 transitions, 398 flow [2025-03-17 10:47:00,002 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-17 10:47:00,004 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, -3 predicate places. [2025-03-17 10:47:00,004 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 155 transitions, 398 flow [2025-03-17 10:47:00,004 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-17 10:47:00,004 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:47:00,004 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-17 10:47:00,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 10:47:00,005 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-17 10:47:00,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:47:00,005 INFO L85 PathProgramCache]: Analyzing trace with hash -429144901, now seen corresponding path program 1 times [2025-03-17 10:47:00,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:47:00,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730767718] [2025-03-17 10:47:00,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:47:00,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:47:00,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 10:47:00,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 10:47:00,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:47:00,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:47:00,038 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-17 10:47:00,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:47:00,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730767718] [2025-03-17 10:47:00,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730767718] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:47:00,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:47:00,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:47:00,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513243463] [2025-03-17 10:47:00,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:47:00,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:47:00,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:47:00,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:47:00,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:47:00,084 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 161 [2025-03-17 10:47:00,085 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-17 10:47:00,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:47:00,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 161 [2025-03-17 10:47:00,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:47:01,962 INFO L124 PetriNetUnfolderBase]: 11247/29861 cut-off events. [2025-03-17 10:47:01,963 INFO L125 PetriNetUnfolderBase]: For 7888/9103 co-relation queries the response was YES. [2025-03-17 10:47:02,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56111 conditions, 29861 events. 11247/29861 cut-off events. For 7888/9103 co-relation queries the response was YES. Maximal size of possible extension queue 1034. Compared 351658 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-17 10:47:02,165 INFO L140 encePairwiseOnDemand]: 148/161 looper letters, 42 selfloop transitions, 19 changer transitions 0/180 dead transitions. [2025-03-17 10:47:02,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 180 transitions, 620 flow [2025-03-17 10:47:02,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:47:02,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:47:02,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 410 transitions. [2025-03-17 10:47:02,167 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8488612836438924 [2025-03-17 10:47:02,167 INFO L175 Difference]: Start difference. First operand has 156 places, 155 transitions, 398 flow. Second operand 3 states and 410 transitions. [2025-03-17 10:47:02,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 180 transitions, 620 flow [2025-03-17 10:47:02,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 180 transitions, 582 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:47:02,211 INFO L231 Difference]: Finished difference. Result has 158 places, 172 transitions, 546 flow [2025-03-17 10:47:02,211 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-17 10:47:02,213 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, -1 predicate places. [2025-03-17 10:47:02,213 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 172 transitions, 546 flow [2025-03-17 10:47:02,213 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-17 10:47:02,213 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:47:02,213 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-17 10:47:02,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 10:47:02,214 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-17 10:47:02,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:47:02,214 INFO L85 PathProgramCache]: Analyzing trace with hash -828495087, now seen corresponding path program 1 times [2025-03-17 10:47:02,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:47:02,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108538122] [2025-03-17 10:47:02,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:47:02,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:47:02,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 10:47:02,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 10:47:02,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:47:02,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:47:02,237 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-17 10:47:02,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:47:02,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108538122] [2025-03-17 10:47:02,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108538122] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:47:02,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:47:02,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:47:02,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129743843] [2025-03-17 10:47:02,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:47:02,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:47:02,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:47:02,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:47:02,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:47:02,282 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 161 [2025-03-17 10:47:02,283 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-17 10:47:02,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:47:02,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 161 [2025-03-17 10:47:02,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:47:04,935 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([457] L693-10-->L693-9: Formula: (= |v_#race~c~0_15| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_15|} AuxVars[] AssignedVars[#race~c~0][151], [4#L693-9true, 114#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 156#true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 160#true, 70#L693-7true, 169#true, 105#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 176#(= |#race~c~0| 0), 158#true]) [2025-03-17 10:47:04,935 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2025-03-17 10:47:04,935 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-17 10:47:04,935 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-17 10:47:04,935 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-17 10:47:05,212 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([524] 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, 70#L693-7true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 169#true, 82#L693-12true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true]) [2025-03-17 10:47:05,213 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2025-03-17 10:47:05,215 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-17 10:47:05,215 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-17 10:47:05,215 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-17 10:47:05,236 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([584] 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, 90#L693true, 160#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 169#true, 105#L693-7true, 82#L693-12true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true]) [2025-03-17 10:47:05,236 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2025-03-17 10:47:05,236 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-17 10:47:05,236 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-17 10:47:05,236 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-17 10:47:05,679 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([584] 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, 90#L693true, 160#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 169#true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 105#L693-7true, 118#L693-10true, 174#true, 158#true]) [2025-03-17 10:47:05,679 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2025-03-17 10:47:05,679 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-17 10:47:05,679 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-17 10:47:05,679 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-17 10:47:05,680 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([524] 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, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 160#true, 70#L693-7true, 169#true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 118#L693-10true, 174#true, 158#true]) [2025-03-17 10:47:05,680 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2025-03-17 10:47:05,680 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-17 10:47:05,680 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-17 10:47:05,680 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-17 10:47:07,410 INFO L124 PetriNetUnfolderBase]: 31793/78596 cut-off events. [2025-03-17 10:47:07,410 INFO L125 PetriNetUnfolderBase]: For 55642/57338 co-relation queries the response was YES. [2025-03-17 10:47:07,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170883 conditions, 78596 events. 31793/78596 cut-off events. For 55642/57338 co-relation queries the response was YES. Maximal size of possible extension queue 2895. Compared 1028994 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-17 10:47:07,960 INFO L140 encePairwiseOnDemand]: 141/161 looper letters, 65 selfloop transitions, 40 changer transitions 0/222 dead transitions. [2025-03-17 10:47:07,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 222 transitions, 1028 flow [2025-03-17 10:47:07,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:47:07,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:47:07,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 412 transitions. [2025-03-17 10:47:07,961 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8530020703933747 [2025-03-17 10:47:07,961 INFO L175 Difference]: Start difference. First operand has 158 places, 172 transitions, 546 flow. Second operand 3 states and 412 transitions. [2025-03-17 10:47:07,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 222 transitions, 1028 flow [2025-03-17 10:47:08,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 222 transitions, 956 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:47:08,120 INFO L231 Difference]: Finished difference. Result has 160 places, 212 transitions, 964 flow [2025-03-17 10:47:08,120 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-17 10:47:08,121 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 1 predicate places. [2025-03-17 10:47:08,121 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 212 transitions, 964 flow [2025-03-17 10:47:08,121 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-17 10:47:08,121 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:47:08,121 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-17 10:47:08,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 10:47:08,121 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-17 10:47:08,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:47:08,122 INFO L85 PathProgramCache]: Analyzing trace with hash 961048500, now seen corresponding path program 1 times [2025-03-17 10:47:08,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:47:08,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593780511] [2025-03-17 10:47:08,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:47:08,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:47:08,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 10:47:08,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 10:47:08,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:47:08,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:47:08,147 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-17 10:47:08,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:47:08,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593780511] [2025-03-17 10:47:08,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593780511] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:47:08,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:47:08,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:47:08,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911373916] [2025-03-17 10:47:08,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:47:08,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:47:08,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:47:08,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:47:08,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:47:08,191 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 161 [2025-03-17 10:47:08,192 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-17 10:47:08,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:47:08,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 161 [2025-03-17 10:47:08,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:47:10,607 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([542] L693-10-->L693-9: 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, 70#L693-7true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 108#L693-9true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 112#L693-7true, Black: 174#true, 179#true, 156#true, 39#L692true, 160#true, 176#(= |#race~c~0| 0)]) [2025-03-17 10:47:10,607 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2025-03-17 10:47:10,607 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2025-03-17 10:47:10,607 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2025-03-17 10:47:10,607 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2025-03-17 10:47:10,617 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([457] L693-10-->L693-9: Formula: (= |v_#race~c~0_15| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_15|} AuxVars[] AssignedVars[#race~c~0][145], [162#true, 104#L693-7true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 70#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 4#L693-9true, Black: 174#true, 179#true, 156#true, 39#L692true, 160#true, 176#(= |#race~c~0| 0)]) [2025-03-17 10:47:10,617 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2025-03-17 10:47:10,617 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2025-03-17 10:47:10,617 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2025-03-17 10:47:10,617 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2025-03-17 10:47:10,676 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([508] L693-13-->L693-11: 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, 29#L693-12true, 70#L693-7true, 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), 112#L693-7true, 179#true, 156#true, 28#L693-11true, 160#true]) [2025-03-17 10:47:10,676 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2025-03-17 10:47:10,676 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-17 10:47:10,676 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-17 10:47:10,676 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-17 10:47:10,682 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([508] L693-13-->L693-11: 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, 104#L693-7true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 70#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 28#L693-11true, 160#true, 82#L693-12true]) [2025-03-17 10:47:10,682 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2025-03-17 10:47:10,682 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-17 10:47:10,682 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-17 10:47:10,682 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-17 10:47:10,812 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([584] 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, 29#L693-12true, 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), 112#L693-7true, 156#true, 179#true, 90#L693true, 39#L692true, 160#true]) [2025-03-17 10:47:10,812 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2025-03-17 10:47:10,812 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-17 10:47:10,812 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-17 10:47:10,812 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-17 10:47:10,829 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([584] 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, 104#L693-7true, 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#L693true, 39#L692true, 160#true, 82#L693-12true]) [2025-03-17 10:47:10,829 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2025-03-17 10:47:10,829 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-17 10:47:10,829 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-17 10:47:10,829 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-17 10:47:10,865 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] 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|), 70#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 119#L693true, 158#true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 39#L692true, 160#true, 82#L693-12true]) [2025-03-17 10:47:10,865 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2025-03-17 10:47:10,865 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-17 10:47:10,865 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-17 10:47:10,865 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-17 10:47:11,134 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] 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|), 70#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 118#L693-10true, 174#true, 119#L693true, 158#true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 39#L692true, 160#true]) [2025-03-17 10:47:11,135 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2025-03-17 10:47:11,135 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-03-17 10:47:11,135 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-03-17 10:47:11,135 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-03-17 10:47:11,317 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([584] 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, 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#L693-10true, Black: 176#(= |#race~c~0| 0), 112#L693-7true, 179#true, 156#true, 90#L693true, 39#L692true, 160#true]) [2025-03-17 10:47:11,317 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2025-03-17 10:47:11,317 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-03-17 10:47:11,317 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-03-17 10:47:11,317 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-03-17 10:47:11,332 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([584] 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, 104#L693-7true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 118#L693-10true, 174#true, 158#true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 90#L693true, 39#L692true, 160#true]) [2025-03-17 10:47:11,333 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2025-03-17 10:47:11,333 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-03-17 10:47:11,333 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-03-17 10:47:11,333 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-03-17 10:47:11,527 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([508] L693-13-->L693-11: 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, 70#L693-7true, 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#L693-10true, Black: 176#(= |#race~c~0| 0), 112#L693-7true, 179#true, 156#true, 28#L693-11true, 160#true]) [2025-03-17 10:47:11,528 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is not cut-off event [2025-03-17 10:47:11,528 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is not cut-off event [2025-03-17 10:47:11,528 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is not cut-off event [2025-03-17 10:47:11,528 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is not cut-off event [2025-03-17 10:47:11,543 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([508] L693-13-->L693-11: 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, 104#L693-7true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 70#L693-7true, 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, 28#L693-11true, 160#true]) [2025-03-17 10:47:11,543 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is not cut-off event [2025-03-17 10:47:11,543 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is not cut-off event [2025-03-17 10:47:11,543 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is not cut-off event [2025-03-17 10:47:11,543 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is not cut-off event [2025-03-17 10:47:11,814 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([457] L693-10-->L693-9: Formula: (= |v_#race~c~0_15| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_15|} AuxVars[] AssignedVars[#race~c~0][145], [114#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 70#L693-7true, 105#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 4#L693-9true, Black: 174#true, 179#true, 156#true, 160#true, 176#(= |#race~c~0| 0)]) [2025-03-17 10:47:11,814 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2025-03-17 10:47:11,814 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-17 10:47:11,815 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-17 10:47:11,815 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-17 10:47:11,835 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([542] L693-10-->L693-9: 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|), 70#L693-7true, 84#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, 108#L693-9true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 105#L693-7true, 158#true, Black: 174#true, 179#true, 156#true, 160#true, 176#(= |#race~c~0| 0)]) [2025-03-17 10:47:11,835 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2025-03-17 10:47:11,835 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-17 10:47:11,835 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-17 10:47:11,835 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-17 10:47:12,269 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([524] 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, 29#L693-12true, 70#L693-7true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 84#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, 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, 160#true]) [2025-03-17 10:47:12,269 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2025-03-17 10:47:12,269 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-17 10:47:12,269 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-17 10:47:12,269 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-17 10:47:12,269 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([524] 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, 70#L693-7true, 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, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 160#true, 82#L693-12true]) [2025-03-17 10:47:12,269 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2025-03-17 10:47:12,269 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-17 10:47:12,269 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-17 10:47:12,269 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-17 10:47:12,281 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([584] 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, 29#L693-12true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 84#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, 105#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 90#L693true, 160#true]) [2025-03-17 10:47:12,281 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2025-03-17 10:47:12,281 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-17 10:47:12,281 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-17 10:47:12,281 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-17 10:47:12,287 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([584] 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, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 105#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 90#L693true, 160#true, 82#L693-12true]) [2025-03-17 10:47:12,287 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2025-03-17 10:47:12,287 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-17 10:47:12,287 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-17 10:47:12,287 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-17 10:47:12,668 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([584] 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, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 105#L693-7true, 118#L693-10true, 174#true, 158#true, Black: 176#(= |#race~c~0| 0), 156#true, 179#true, 90#L693true, 160#true]) [2025-03-17 10:47:12,668 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2025-03-17 10:47:12,668 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-17 10:47:12,668 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-17 10:47:12,668 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-17 10:47:12,669 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([524] 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|), 70#L693-7true, 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-17 10:47:12,669 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2025-03-17 10:47:12,669 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-17 10:47:12,669 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-17 10:47:12,669 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-17 10:47:12,686 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([584] 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, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 84#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, 105#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, 69#L693-10true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 90#L693true, 160#true]) [2025-03-17 10:47:12,686 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2025-03-17 10:47:12,686 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-17 10:47:12,686 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-17 10:47:12,686 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-17 10:47:12,687 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([524] 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], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 70#L693-7true, 84#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, 5#L693true, 69#L693-10true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 160#true]) [2025-03-17 10:47:12,687 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2025-03-17 10:47:12,687 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-17 10:47:12,687 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-17 10:47:12,687 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-17 10:47:15,100 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([584] 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, 29#L693-12true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, 38#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 90#L693true, 160#true, 92#L694true]) [2025-03-17 10:47:15,100 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2025-03-17 10:47:15,100 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-17 10:47:15,100 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-17 10:47:15,100 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-17 10:47:15,101 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([524] 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, 29#L693-12true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 71#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, 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, 92#L694true]) [2025-03-17 10:47:15,101 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2025-03-17 10:47:15,104 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-17 10:47:15,104 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-17 10:47:15,104 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-17 10:47:15,266 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([524] 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|), 71#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, 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, 92#L694true]) [2025-03-17 10:47:15,266 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2025-03-17 10:47:15,266 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-17 10:47:15,266 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-17 10:47:15,266 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-17 10:47:15,267 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([584] 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, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, 38#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 90#L693true, 160#true, 92#L694true]) [2025-03-17 10:47:15,267 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2025-03-17 10:47:15,267 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-17 10:47:15,267 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-17 10:47:15,267 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-17 10:47:15,631 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([584] 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, 29#L693-12true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, 38#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 90#L693true, 160#true, 19#L701-1true]) [2025-03-17 10:47:15,631 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2025-03-17 10:47:15,631 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-03-17 10:47:15,631 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-03-17 10:47:15,631 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-03-17 10:47:15,633 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([524] 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, 29#L693-12true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 71#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, 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, 19#L701-1true]) [2025-03-17 10:47:15,633 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2025-03-17 10:47:15,633 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-03-17 10:47:15,633 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-03-17 10:47:15,633 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-03-17 10:47:15,739 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([584] 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, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true, 38#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 90#L693true, 160#true, 19#L701-1true]) [2025-03-17 10:47:15,740 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2025-03-17 10:47:15,740 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-03-17 10:47:15,740 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-03-17 10:47:15,740 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-03-17 10:47:15,745 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([524] 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|), 71#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, 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, 19#L701-1true]) [2025-03-17 10:47:15,745 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2025-03-17 10:47:15,745 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-03-17 10:47:15,745 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-03-17 10:47:15,745 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-03-17 10:47:16,380 INFO L124 PetriNetUnfolderBase]: 45373/113850 cut-off events. [2025-03-17 10:47:16,380 INFO L125 PetriNetUnfolderBase]: For 213654/219657 co-relation queries the response was YES. [2025-03-17 10:47:16,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 305572 conditions, 113850 events. 45373/113850 cut-off events. For 213654/219657 co-relation queries the response was YES. Maximal size of possible extension queue 3851. Compared 1550884 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-17 10:47:17,474 INFO L140 encePairwiseOnDemand]: 148/161 looper letters, 91 selfloop transitions, 36 changer transitions 0/250 dead transitions. [2025-03-17 10:47:17,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 250 transitions, 1496 flow [2025-03-17 10:47:17,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:47:17,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:47:17,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 404 transitions. [2025-03-17 10:47:17,476 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8364389233954451 [2025-03-17 10:47:17,476 INFO L175 Difference]: Start difference. First operand has 160 places, 212 transitions, 964 flow. Second operand 3 states and 404 transitions. [2025-03-17 10:47:17,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 250 transitions, 1496 flow [2025-03-17 10:47:17,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 250 transitions, 1386 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:47:17,589 INFO L231 Difference]: Finished difference. Result has 162 places, 244 transitions, 1330 flow [2025-03-17 10:47:17,589 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-17 10:47:17,590 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 3 predicate places. [2025-03-17 10:47:17,590 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 244 transitions, 1330 flow [2025-03-17 10:47:17,590 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-17 10:47:17,590 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:47:17,590 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-17 10:47:17,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 10:47:17,590 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-17 10:47:17,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:47:17,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1591568082, now seen corresponding path program 1 times [2025-03-17 10:47:17,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:47:17,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94918738] [2025-03-17 10:47:17,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:47:17,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:47:17,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 10:47:17,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 10:47:17,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:47:17,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:47:17,621 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-17 10:47:17,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:47:17,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94918738] [2025-03-17 10:47:17,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94918738] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:47:17,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:47:17,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:47:17,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123317673] [2025-03-17 10:47:17,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:47:17,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:47:17,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:47:17,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:47:17,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:47:17,661 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 161 [2025-03-17 10:47:17,662 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-17 10:47:17,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:47:17,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 161 [2025-03-17 10:47:17,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:47:20,970 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([457] L693-10-->L693-9: Formula: (= |v_#race~c~0_15| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_15|} AuxVars[] AssignedVars[#race~c~0][297], [120#L693-12true, 162#true, 29#L693-12true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 105#L693-7true, 158#true, 4#L693-9true, Black: 174#true, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2025-03-17 10:47:20,970 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2025-03-17 10:47:20,970 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-17 10:47:20,971 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-17 10:47:20,971 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-17 10:47:20,980 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([542] L693-10-->L693-9: Formula: (= |v_#race~c~0_6| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_6|} AuxVars[] AssignedVars[#race~c~0][295], [120#L693-12true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 108#L693-9true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 105#L693-7true, 158#true, Black: 174#true, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true, 82#L693-12true]) [2025-03-17 10:47:20,980 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2025-03-17 10:47:20,980 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-17 10:47:20,980 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-17 10:47:20,980 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-17 10:47:20,984 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] L693-10-->L693-9: 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, 29#L693-12true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 105#L693-7true, 95#L693-9true, 158#true, Black: 174#true, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true, 82#L693-12true]) [2025-03-17 10:47:20,984 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2025-03-17 10:47:20,984 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-17 10:47:20,984 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-17 10:47:20,984 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-17 10:47:21,081 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([524] 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], [120#L693-12true, 162#true, 29#L693-12true, 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), 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 82#L693-12true, 184#true]) [2025-03-17 10:47:21,082 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2025-03-17 10:47:21,082 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-17 10:47:21,082 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-17 10:47:21,082 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-17 10:47:21,941 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([524] 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, 29#L693-12true, 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|), 160#true, 82#L693-12true, 184#true]) [2025-03-17 10:47:21,941 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2025-03-17 10:47:21,941 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-17 10:47:21,941 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-17 10:47:21,941 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-17 10:47:21,966 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([524] 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], [120#L693-12true, 162#true, 29#L693-12true, 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), 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2025-03-17 10:47:21,966 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2025-03-17 10:47:21,966 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-17 10:47:21,966 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-17 10:47:21,966 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-17 10:47:21,972 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([524] 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], [120#L693-12true, 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#L693-10true, 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, 82#L693-12true, 184#true]) [2025-03-17 10:47:21,972 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2025-03-17 10:47:21,972 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-17 10:47:21,972 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-17 10:47:21,972 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-17 10:47:22,755 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([542] L693-10-->L693-9: 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|), 108#L693-9true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 97#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 105#L693-7true, 158#true, Black: 174#true, 112#L693-7true, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2025-03-17 10:47:22,755 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2025-03-17 10:47:22,755 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-17 10:47:22,755 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-17 10:47:22,755 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-17 10:47:22,775 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([457] L693-10-->L693-9: Formula: (= |v_#race~c~0_15| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_15|} AuxVars[] AssignedVars[#race~c~0][152], [162#true, 104#L693-7true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 105#L693-7true, 97#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 174#true, 4#L693-9true, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2025-03-17 10:47:22,775 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2025-03-17 10:47:22,775 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-17 10:47:22,775 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-17 10:47:22,775 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-17 10:47:22,834 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] L693-10-->L693-9: 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|), 105#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 95#L693-9true, 158#true, Black: 174#true, 112#L693-7true, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2025-03-17 10:47:22,835 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2025-03-17 10:47:22,835 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-17 10:47:22,835 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-17 10:47:22,835 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-17 10:47:22,848 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([524] 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], [120#L693-12true, 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-7true, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2025-03-17 10:47:22,848 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2025-03-17 10:47:22,848 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-17 10:47:22,848 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-17 10:47:22,848 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-17 10:47:22,881 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] L693-10-->L693-9: 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, 104#L693-7true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 84#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 105#L693-7true, 95#L693-9true, 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-17 10:47:22,882 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2025-03-17 10:47:22,882 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-17 10:47:22,882 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-17 10:47:22,882 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-17 10:47:22,886 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([524] 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], [120#L693-12true, 162#true, 104#L693-7true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 84#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 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-17 10:47:22,886 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2025-03-17 10:47:22,886 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-17 10:47:22,886 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-17 10:47:22,886 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-17 10:47:23,127 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([524] 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, 29#L693-12true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 97#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 158#true, 5#L693true, Black: 176#(= |#race~c~0| 0), 112#L693-7true, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2025-03-17 10:47:23,128 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2025-03-17 10:47:23,128 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-17 10:47:23,128 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-17 10:47:23,128 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-17 10:47:23,173 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([484] 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], [120#L693-12true, 114#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 134#L693true, 105#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 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, 184#true]) [2025-03-17 10:47:23,173 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2025-03-17 10:47:23,173 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-17 10:47:23,173 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-17 10:47:23,173 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-17 10:47:23,222 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] 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], [120#L693-12true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 84#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 105#L693-7true, 158#true, 119#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-17 10:47:23,222 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2025-03-17 10:47:23,222 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-17 10:47:23,222 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-17 10:47:23,222 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-17 10:47:23,247 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([484] 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, 29#L693-12true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 134#L693true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 97#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 105#L693-7true, 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, 184#true]) [2025-03-17 10:47:23,247 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2025-03-17 10:47:23,247 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-17 10:47:23,247 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-17 10:47:23,247 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-17 10:47:23,922 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([484] 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], [162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 134#L693true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 97#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 105#L693-7true, 158#true, 69#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, 184#true]) [2025-03-17 10:47:23,922 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2025-03-17 10:47:23,922 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-17 10:47:23,922 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-17 10:47:23,922 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-17 10:47:23,925 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([524] 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|), 97#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 5#L693true, 69#L693-10true, Black: 176#(= |#race~c~0| 0), 112#L693-7true, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2025-03-17 10:47:23,925 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2025-03-17 10:47:23,925 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-17 10:47:23,925 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-17 10:47:23,925 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-17 10:47:23,943 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] 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|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 118#L693-10true, 105#L693-7true, 97#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-17 10:47:23,944 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2025-03-17 10:47:23,944 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-17 10:47:23,944 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-17 10:47:23,944 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-17 10:47:23,947 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([524] 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, 104#L693-7true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 118#L693-10true, 97#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 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-17 10:47:23,947 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2025-03-17 10:47:23,947 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-17 10:47:23,947 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-17 10:47:23,947 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-17 10:47:24,003 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([484] 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|), 134#L693true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 105#L693-7true, 158#true, Black: 176#(= |#race~c~0| 0), 116#L693-10true, 156#true, 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), Black: 179#true, 160#true, 184#true]) [2025-03-17 10:47:24,003 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2025-03-17 10:47:24,003 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-17 10:47:24,003 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-17 10:47:24,003 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-17 10:47:24,025 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([524] 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, 116#L693-10true, Black: 176#(= |#race~c~0| 0), 112#L693-7true, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2025-03-17 10:47:24,025 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2025-03-17 10:47:24,025 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-17 10:47:24,025 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-17 10:47:24,025 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-17 10:47:24,049 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] 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|), 84#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, 105#L693-7true, 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, 184#true]) [2025-03-17 10:47:24,050 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2025-03-17 10:47:24,050 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-17 10:47:24,050 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-17 10:47:24,050 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-17 10:47:24,059 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([524] 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, 104#L693-7true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 84#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, 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, 184#true]) [2025-03-17 10:47:24,059 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2025-03-17 10:47:24,059 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-17 10:47:24,059 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-17 10:47:24,059 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-03-17 10:47:24,231 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([542] L693-10-->L693-9: Formula: (= |v_#race~c~0_6| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_6|} AuxVars[] AssignedVars[#race~c~0][313], [120#L693-12true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 108#L693-9true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 105#L693-7true, 158#true, 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-17 10:47:24,231 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2025-03-17 10:47:24,231 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2025-03-17 10:47:24,231 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2025-03-17 10:47:24,231 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2025-03-17 10:47:24,269 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([508] L693-13-->L693-11: 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, 29#L693-12true, 16#L694-3true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 71#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 28#L693-11true, 160#true, 184#true]) [2025-03-17 10:47:24,270 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is not cut-off event [2025-03-17 10:47:24,270 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is not cut-off event [2025-03-17 10:47:24,270 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is not cut-off event [2025-03-17 10:47:24,270 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is not cut-off event [2025-03-17 10:47:24,274 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] L693-10-->L693-9: 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, 29#L693-12true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 105#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 95#L693-9true, 158#true, 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-17 10:47:24,274 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2025-03-17 10:47:24,274 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2025-03-17 10:47:24,274 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2025-03-17 10:47:24,274 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2025-03-17 10:47:24,408 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([524] 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], [120#L693-12true, 162#true, 29#L693-12true, 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), 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 7#L693-1true, 184#true]) [2025-03-17 10:47:24,408 INFO L294 olderBase$Statistics]: this new event has 91 ancestors and is cut-off event [2025-03-17 10:47:24,408 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2025-03-17 10:47:24,408 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2025-03-17 10:47:24,408 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2025-03-17 10:47:24,780 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([508] L693-13-->L693-11: 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, 29#L693-12true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 71#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 28#L693-11true, 160#true, 184#true, 92#L694true]) [2025-03-17 10:47:24,780 INFO L294 olderBase$Statistics]: this new event has 88 ancestors and is not cut-off event [2025-03-17 10:47:24,780 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is not cut-off event [2025-03-17 10:47:24,780 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is not cut-off event [2025-03-17 10:47:24,780 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is not cut-off event [2025-03-17 10:47:24,789 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] L693-10-->L693-9: 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, 29#L693-12true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 102#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 95#L693-9true, 158#true, 38#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 174#true, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2025-03-17 10:47:24,789 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2025-03-17 10:47:24,789 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2025-03-17 10:47:24,789 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2025-03-17 10:47:24,789 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2025-03-17 10:47:24,904 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([542] L693-10-->L693-9: Formula: (= |v_#race~c~0_6| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_6|} AuxVars[] AssignedVars[#race~c~0][128], [120#L693-12true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 102#ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACEtrue, 108#L693-9true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 38#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 174#true, 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2025-03-17 10:47:24,904 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2025-03-17 10:47:24,904 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2025-03-17 10:47:24,904 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2025-03-17 10:47:24,904 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2025-03-17 10:47:25,055 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([524] 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], [120#L693-12true, 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, 69#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-17 10:47:25,055 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2025-03-17 10:47:25,055 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2025-03-17 10:47:25,055 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2025-03-17 10:47:25,055 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2025-03-17 10:47:25,134 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([524] 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], [120#L693-12true, 162#true, 29#L693-12true, 16#L694-3true, 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), 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true]) [2025-03-17 10:47:25,134 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2025-03-17 10:47:25,134 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2025-03-17 10:47:25,134 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2025-03-17 10:47:25,134 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2025-03-17 10:47:25,147 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([524] 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, 29#L693-12true, 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, 179#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 7#L693-1true, 184#true]) [2025-03-17 10:47:25,147 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2025-03-17 10:47:25,147 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2025-03-17 10:47:25,147 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2025-03-17 10:47:25,147 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2025-03-17 10:47:27,063 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([584] 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, 29#L693-12true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 38#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, 90#L693true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 184#true, 92#L694true]) [2025-03-17 10:47:27,064 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2025-03-17 10:47:27,064 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-17 10:47:27,064 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-17 10:47:27,064 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-17 10:47:27,065 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([524] 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, 29#L693-12true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 71#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 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, 92#L694true]) [2025-03-17 10:47:27,065 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2025-03-17 10:47:27,065 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-17 10:47:27,065 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-17 10:47:27,065 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-03-17 10:47:27,345 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([508] L693-13-->L693-11: 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|), 52#L694true, 158#true, Black: 176#(= |#race~c~0| 0), 179#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 12#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, 28#L693-11true, 160#true, 7#L693-1true, 184#true]) [2025-03-17 10:47:27,345 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is not cut-off event [2025-03-17 10:47:27,345 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is not cut-off event [2025-03-17 10:47:27,345 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is not cut-off event [2025-03-17 10:47:27,345 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is not cut-off event [2025-03-17 10:47:28,488 INFO L124 PetriNetUnfolderBase]: 57922/139420 cut-off events. [2025-03-17 10:47:28,488 INFO L125 PetriNetUnfolderBase]: For 335053/355063 co-relation queries the response was YES. [2025-03-17 10:47:29,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 401363 conditions, 139420 events. 57922/139420 cut-off events. For 335053/355063 co-relation queries the response was YES. Maximal size of possible extension queue 4969. Compared 1909648 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-17 10:47:29,740 INFO L140 encePairwiseOnDemand]: 148/161 looper letters, 112 selfloop transitions, 76 changer transitions 0/315 dead transitions. [2025-03-17 10:47:29,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 315 transitions, 2301 flow [2025-03-17 10:47:29,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:47:29,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:47:29,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 409 transitions. [2025-03-17 10:47:29,741 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8467908902691511 [2025-03-17 10:47:29,741 INFO L175 Difference]: Start difference. First operand has 162 places, 244 transitions, 1330 flow. Second operand 3 states and 409 transitions. [2025-03-17 10:47:29,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 315 transitions, 2301 flow [2025-03-17 10:47:32,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 315 transitions, 2097 flow, removed 46 selfloop flow, removed 2 redundant places. [2025-03-17 10:47:32,330 INFO L231 Difference]: Finished difference. Result has 164 places, 308 transitions, 2136 flow [2025-03-17 10:47:32,331 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-17 10:47:32,331 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 5 predicate places. [2025-03-17 10:47:32,331 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 308 transitions, 2136 flow [2025-03-17 10:47:32,331 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-17 10:47:32,331 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:47:32,331 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-17 10:47:32,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 10:47:32,332 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-17 10:47:32,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:47:32,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1374371580, now seen corresponding path program 1 times [2025-03-17 10:47:32,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:47:32,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883777130] [2025-03-17 10:47:32,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:47:32,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:47:32,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 10:47:32,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 10:47:32,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:47:32,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:47:32,360 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-17 10:47:32,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:47:32,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883777130] [2025-03-17 10:47:32,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883777130] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:47:32,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:47:32,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:47:32,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257441671] [2025-03-17 10:47:32,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:47:32,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:47:32,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:47:32,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:47:32,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:47:32,404 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 161 [2025-03-17 10:47:32,405 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-17 10:47:32,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:47:32,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 161 [2025-03-17 10:47:32,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:47:33,777 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] L693-10-->L693-9: 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, 29#L693-12true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 84#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 95#L693-9true, 158#true, Black: 174#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 39#L692true, 160#true, Black: 186#(= |thr1Thread2of3ForFork0_#t~nondet2#1| |#race~c~0|), 184#true]) [2025-03-17 10:47:33,778 INFO L294 olderBase$Statistics]: this new event has 73 ancestors and is cut-off event [2025-03-17 10:47:33,778 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-03-17 10:47:33,778 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-03-17 10:47:33,778 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2025-03-17 10:47:34,125 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] L693-10-->L693-9: Formula: (= |v_#race~c~0_6| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_6|} AuxVars[] AssignedVars[#race~c~0][189], [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|), 95#L693-9true, 158#true, Black: 174#true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 39#L692true, 160#true, Black: 186#(= |thr1Thread2of3ForFork0_#t~nondet2#1| |#race~c~0|), 184#true, 82#L693-12true]) [2025-03-17 10:47:34,125 INFO L294 olderBase$Statistics]: this new event has 73 ancestors and is not cut-off event [2025-03-17 10:47:34,125 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is not cut-off event [2025-03-17 10:47:34,125 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is not cut-off event [2025-03-17 10:47:34,125 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is not cut-off event [2025-03-17 10:47:34,769 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([508] L693-13-->L693-11: 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|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 116#L693-10true, Black: 176#(= |#race~c~0| 0), 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 28#L693-11true, Black: 186#(= |thr1Thread2of3ForFork0_#t~nondet2#1| |#race~c~0|), 184#true, 82#L693-12true]) [2025-03-17 10:47:34,770 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is not cut-off event [2025-03-17 10:47:34,770 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is not cut-off event [2025-03-17 10:47:34,770 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is not cut-off event [2025-03-17 10:47:34,770 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is not cut-off event [2025-03-17 10:47:34,791 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([508] L693-13-->L693-11: 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, 29#L693-12true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 84#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, 116#L693-10true, Black: 176#(= |#race~c~0| 0), 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 28#L693-11true, 160#true, Black: 186#(= |thr1Thread2of3ForFork0_#t~nondet2#1| |#race~c~0|), 184#true]) [2025-03-17 10:47:34,791 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is not cut-off event [2025-03-17 10:47:34,791 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is not cut-off event [2025-03-17 10:47:34,791 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is not cut-off event [2025-03-17 10:47:34,791 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is not cut-off event [2025-03-17 10:47:35,554 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] L693-10-->L693-9: 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, 104#L693-7true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 95#L693-9true, 158#true, Black: 174#true, 112#L693-7true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 39#L692true, 160#true, Black: 186#(= |thr1Thread2of3ForFork0_#t~nondet2#1| |#race~c~0|), 184#true]) [2025-03-17 10:47:35,554 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2025-03-17 10:47:35,554 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2025-03-17 10:47:35,554 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2025-03-17 10:47:35,554 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2025-03-17 10:47:36,021 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([457] L693-10-->L693-9: Formula: (= |v_#race~c~0_15| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_15|} AuxVars[] AssignedVars[#race~c~0][335], [120#L693-12true, 189#true, 162#true, 29#L693-12true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 105#L693-7true, 158#true, 4#L693-9true, 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-17 10:47:36,021 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2025-03-17 10:47:36,021 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-17 10:47:36,021 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-17 10:47:36,021 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-17 10:47:36,036 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([542] L693-10-->L693-9: Formula: (= |v_#race~c~0_6| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_6|} AuxVars[] AssignedVars[#race~c~0][334], [120#L693-12true, 189#true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 108#L693-9true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 105#L693-7true, 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|), 82#L693-12true, 184#true]) [2025-03-17 10:47:36,036 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2025-03-17 10:47:36,036 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-17 10:47:36,036 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-17 10:47:36,036 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-17 10:47:36,042 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] L693-10-->L693-9: 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, 29#L693-12true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 105#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 95#L693-9true, 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|), 82#L693-12true, 184#true]) [2025-03-17 10:47:36,042 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2025-03-17 10:47:36,042 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-17 10:47:36,042 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-17 10:47:36,042 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-17 10:47:36,192 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([524] 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], [120#L693-12true, 189#true, 162#true, 29#L693-12true, 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), 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, Black: 186#(= |thr1Thread2of3ForFork0_#t~nondet2#1| |#race~c~0|), 82#L693-12true, 184#true]) [2025-03-17 10:47:36,192 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2025-03-17 10:47:36,192 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-17 10:47:36,192 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-17 10:47:36,192 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-17 10:47:36,569 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([484] 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, 104#L693-7true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 134#L693true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 176#(= |#race~c~0| 0), 116#L693-10true, 156#true, Black: 179#true, 39#L692true, 160#true, Black: 186#(= |thr1Thread2of3ForFork0_#t~nondet2#1| |#race~c~0|), 184#true]) [2025-03-17 10:47:36,569 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is cut-off event [2025-03-17 10:47:36,569 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-03-17 10:47:36,569 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-03-17 10:47:36,569 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-03-17 10:47:36,704 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([457] L693-10-->L693-9: Formula: (= |v_#race~c~0_15| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_15|} AuxVars[] AssignedVars[#race~c~0][153], [189#true, 114#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 105#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 97#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 158#true, 4#L693-9true, 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-17 10:47:36,704 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2025-03-17 10:47:36,704 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-17 10:47:36,704 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-17 10:47:36,704 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-17 10:47:36,707 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] L693-10-->L693-9: 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|), 95#L693-9true, 158#true, 38#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, 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|), 82#L693-12true, 184#true]) [2025-03-17 10:47:36,707 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2025-03-17 10:47:36,707 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-17 10:47:36,707 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-17 10:47:36,707 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-17 10:47:36,745 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] L693-10-->L693-9: 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, 29#L693-12true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 84#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 95#L693-9true, 158#true, 38#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, 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-17 10:47:36,746 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2025-03-17 10:47:36,746 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-17 10:47:36,746 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-17 10:47:36,746 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-17 10:47:36,783 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([457] L693-10-->L693-9: Formula: (= |v_#race~c~0_15| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_15|} AuxVars[] AssignedVars[#race~c~0][188], [120#L693-12true, 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, 38#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, 4#L693-9true, 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-17 10:47:36,784 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2025-03-17 10:47:36,784 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-17 10:47:36,784 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-17 10:47:36,784 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2025-03-17 10:47:37,121 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([524] 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, 29#L693-12true, 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|), 82#L693-12true, 184#true]) [2025-03-17 10:47:37,121 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2025-03-17 10:47:37,121 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-17 10:47:37,121 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-17 10:47:37,121 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-17 10:47:37,123 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([524] 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], [120#L693-12true, 114#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 189#true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 84#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 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-17 10:47:37,123 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2025-03-17 10:47:37,123 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-17 10:47:37,123 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-17 10:47:37,123 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-17 10:47:37,140 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([524] 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], [120#L693-12true, 189#true, 162#true, 29#L693-12true, 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), 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-17 10:47:37,141 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2025-03-17 10:47:37,141 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-17 10:47:37,141 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-17 10:47:37,141 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-17 10:47:37,147 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([524] 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], [120#L693-12true, 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, 5#L693true, 69#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|), 82#L693-12true, 184#true]) [2025-03-17 10:47:37,147 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2025-03-17 10:47:37,147 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-17 10:47:37,147 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-17 10:47:37,147 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-17 10:47:37,165 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([524] 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|), 97#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 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|), 82#L693-12true, 184#true]) [2025-03-17 10:47:37,166 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2025-03-17 10:47:37,166 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-17 10:47:37,166 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-17 10:47:37,166 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2025-03-17 10:47:37,287 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([508] L693-13-->L693-11: 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, 104#L693-7true, 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: 176#(= |#race~c~0| 0), 112#L693-7true, 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 28#L693-11true, 160#true, Black: 186#(= |thr1Thread2of3ForFork0_#t~nondet2#1| |#race~c~0|), 184#true]) [2025-03-17 10:47:37,287 INFO L294 olderBase$Statistics]: this new event has 82 ancestors and is not cut-off event [2025-03-17 10:47:37,287 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is not cut-off event [2025-03-17 10:47:37,287 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is not cut-off event [2025-03-17 10:47:37,288 INFO L297 olderBase$Statistics]: existing Event has 82 ancestors and is not cut-off event [2025-03-17 10:47:38,039 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([542] L693-10-->L693-9: 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|), 108#L693-9true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 105#L693-7true, 97#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 158#true, 112#L693-7true, 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-17 10:47:38,039 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2025-03-17 10:47:38,040 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-17 10:47:38,040 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-17 10:47:38,040 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-17 10:47:38,159 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([457] L693-10-->L693-9: Formula: (= |v_#race~c~0_15| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_15|} AuxVars[] AssignedVars[#race~c~0][153], [114#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 189#true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 70#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 105#L693-7true, 158#true, 4#L693-9true, 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-17 10:47:38,159 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2025-03-17 10:47:38,159 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-17 10:47:38,159 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-17 10:47:38,159 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-17 10:47:38,206 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([542] L693-10-->L693-9: 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, 70#L693-7true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 84#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, 108#L693-9true, 105#L693-7true, 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|), 160#true, Black: 186#(= |thr1Thread2of3ForFork0_#t~nondet2#1| |#race~c~0|), 184#true]) [2025-03-17 10:47:38,206 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2025-03-17 10:47:38,206 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-17 10:47:38,206 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-17 10:47:38,206 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-03-17 10:47:38,546 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([508] L693-13-->L693-11: 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], [120#L693-12true, 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, Black: 176#(= |#race~c~0| 0), 156#true, Black: 181#(= |ULTIMATE.start_thr1_#t~nondet3#1| |#race~c~0|), 160#true, 28#L693-11true, Black: 186#(= |thr1Thread2of3ForFork0_#t~nondet2#1| |#race~c~0|), 184#true, 92#L694true]) [2025-03-17 10:47:38,547 INFO L294 olderBase$Statistics]: this new event has 85 ancestors and is cut-off event [2025-03-17 10:47:38,547 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-03-17 10:47:38,547 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-03-17 10:47:38,547 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-03-17 10:47:38,560 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([524] 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][232], [189#true, 162#true, 29#L693-12true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 97#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 158#true, 5#L693true, Black: 176#(= |#race~c~0| 0), 112#L693-7true, 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-17 10:47:38,561 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2025-03-17 10:47:38,561 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-17 10:47:38,561 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-17 10:47:38,561 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-17 10:47:38,573 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([524] 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][187], [114#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 189#true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 118#L693-10true, 97#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 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-17 10:47:38,574 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is not cut-off event [2025-03-17 10:47:38,574 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is not cut-off event [2025-03-17 10:47:38,574 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is not cut-off event [2025-03-17 10:47:38,574 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is not cut-off event [2025-03-17 10:47:38,627 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([524] 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][232], [189#true, 162#true, 29#L693-12true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 70#L693-7true, 84#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 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-17 10:47:38,627 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2025-03-17 10:47:38,627 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-17 10:47:38,627 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-17 10:47:38,627 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-17 10:47:38,627 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([524] 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], [114#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 189#true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 70#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 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, 82#L693-12true]) [2025-03-17 10:47:38,627 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2025-03-17 10:47:38,627 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-17 10:47:38,628 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-17 10:47:38,628 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-17 10:47:38,636 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([484] 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][165], [189#true, 162#true, 29#L693-12true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 134#L693true, 97#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 105#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true, Black: 176#(= |#race~c~0| 0), 156#true, Black: 179#true, 160#true, Black: 186#(= |thr1Thread2of3ForFork0_#t~nondet2#1| |#race~c~0|), 184#true]) [2025-03-17 10:47:38,636 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2025-03-17 10:47:38,636 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-17 10:47:38,636 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-17 10:47:38,636 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-17 10:47:38,646 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([584] 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], [189#true, 162#true, 29#L693-12true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 84#ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACEtrue, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 105#L693-7true, 158#true, Black: 176#(= |#race~c~0| 0), 156#true, 90#L693true, 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-17 10:47:38,646 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2025-03-17 10:47:38,646 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-17 10:47:38,646 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-17 10:47:38,646 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-17 10:47:38,660 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([584] 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][225], [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|), 105#L693-7true, 158#true, Black: 176#(= |#race~c~0| 0), 156#true, 90#L693true, 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#L693-12true]) [2025-03-17 10:47:38,660 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2025-03-17 10:47:38,660 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-17 10:47:38,660 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-03-17 10:47:38,660 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event