./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/pthread-race-challenges/thread-join-counter-inner-race.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version da043454 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 ../../../trunk/examples/svcomp/pthread-race-challenges/thread-join-counter-inner-race.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 490e43bb8ca19cea87b27390f3d2ab0cf6fc9da6355c682d1c6272a9c3d813c1 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:31:18,770 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:31:18,817 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-04-30 10:31:18,823 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:31:18,824 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:31:18,838 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:31:18,838 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:31:18,838 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:31:18,839 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:31:18,839 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:31:18,839 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:31:18,839 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:31:18,839 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:31:18,839 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:31:18,839 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:31:18,839 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:31:18,839 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:31:18,839 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:31:18,839 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:31:18,839 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:31:18,839 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:31:18,841 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:31:18,841 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-30 10:31:18,841 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:31:18,841 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:31:18,841 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:31:18,841 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:31:18,841 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:31:18,841 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:31:18,841 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:31:18,842 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:31:18,842 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:31:18,842 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:31:18,842 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:31:18,842 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:31:18,842 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:31:18,842 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:31:18,842 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:31:18,842 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:31:18,842 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:31:18,842 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:31:18,842 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:31:18,842 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:31:18,842 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:31:18,842 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:31:18,842 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 -> 490e43bb8ca19cea87b27390f3d2ab0cf6fc9da6355c682d1c6272a9c3d813c1 [2025-04-30 10:31:19,053 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:31:19,061 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:31:19,064 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:31:19,065 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:31:19,065 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:31:19,066 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-race-challenges/thread-join-counter-inner-race.i [2025-04-30 10:31:20,386 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a976b1939/229717a4bbf040a59292f6737cbc8d7d/FLAG93ac52cbf [2025-04-30 10:31:20,675 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:31:20,675 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-race-challenges/thread-join-counter-inner-race.i [2025-04-30 10:31:20,691 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a976b1939/229717a4bbf040a59292f6737cbc8d7d/FLAG93ac52cbf [2025-04-30 10:31:21,387 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a976b1939/229717a4bbf040a59292f6737cbc8d7d [2025-04-30 10:31:21,390 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:31:21,391 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:31:21,392 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:31:21,392 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:31:21,395 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:31:21,395 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:31:21" (1/1) ... [2025-04-30 10:31:21,396 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a702771 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:31:21, skipping insertion in model container [2025-04-30 10:31:21,396 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:31:21" (1/1) ... [2025-04-30 10:31:21,427 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:31:21,739 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:31:21,753 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:31:21,806 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:31:21,833 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:31:21,833 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:31:21 WrapperNode [2025-04-30 10:31:21,833 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:31:21,834 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:31:21,834 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:31:21,834 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:31:21,838 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:31:21" (1/1) ... [2025-04-30 10:31:21,847 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:31:21" (1/1) ... [2025-04-30 10:31:21,860 INFO L138 Inliner]: procedures = 159, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 70 [2025-04-30 10:31:21,861 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:31:21,861 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:31:21,861 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:31:21,861 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:31:21,866 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:31:21" (1/1) ... [2025-04-30 10:31:21,867 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:31:21" (1/1) ... [2025-04-30 10:31:21,869 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:31:21" (1/1) ... [2025-04-30 10:31:21,869 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:31:21" (1/1) ... [2025-04-30 10:31:21,873 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:31:21" (1/1) ... [2025-04-30 10:31:21,875 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:31:21" (1/1) ... [2025-04-30 10:31:21,877 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:31:21" (1/1) ... [2025-04-30 10:31:21,878 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:31:21" (1/1) ... [2025-04-30 10:31:21,879 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:31:21" (1/1) ... [2025-04-30 10:31:21,882 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:31:21,882 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:31:21,883 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:31:21,883 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:31:21,883 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:31:21" (1/1) ... [2025-04-30 10:31:21,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:31:21,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:31:21,910 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-04-30 10:31:21,913 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-04-30 10:31:21,927 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-30 10:31:21,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:31:21,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-30 10:31:21,927 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-04-30 10:31:21,928 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-04-30 10:31:21,928 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-30 10:31:21,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:31:21,928 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:31:21,929 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-30 10:31:22,021 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:31:22,023 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:31:22,169 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-30 10:31:22,169 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:31:22,189 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:31:22,189 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-04-30 10:31:22,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:31:22 BoogieIcfgContainer [2025-04-30 10:31:22,190 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:31:22,192 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:31:22,193 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:31:22,196 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:31:22,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:31:21" (1/3) ... [2025-04-30 10:31:22,196 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ac67b7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:31:22, skipping insertion in model container [2025-04-30 10:31:22,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:31:21" (2/3) ... [2025-04-30 10:31:22,197 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ac67b7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:31:22, skipping insertion in model container [2025-04-30 10:31:22,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:31:22" (3/3) ... [2025-04-30 10:31:22,197 INFO L128 eAbstractionObserver]: Analyzing ICFG thread-join-counter-inner-race.i [2025-04-30 10:31:22,207 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:31:22,208 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG thread-join-counter-inner-race.i that has 2 procedures, 125 locations, 131 edges, 1 initial locations, 4 loop locations, and 10 error locations. [2025-04-30 10:31:22,209 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-30 10:31:22,258 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-30 10:31:22,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 132 transitions, 268 flow [2025-04-30 10:31:22,335 INFO L116 PetriNetUnfolderBase]: 11/168 cut-off events. [2025-04-30 10:31:22,337 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:31:22,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 168 events. 11/168 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 348 event pairs, 0 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 96. Up to 4 conditions per place. [2025-04-30 10:31:22,340 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 132 transitions, 268 flow [2025-04-30 10:31:22,343 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 128 places, 132 transitions, 268 flow [2025-04-30 10:31:22,348 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:31:22,356 INFO L340 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;@72a9ef98, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:31:22,356 INFO L341 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-04-30 10:31:22,367 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:31:22,367 INFO L116 PetriNetUnfolderBase]: 1/42 cut-off events. [2025-04-30 10:31:22,367 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:31:22,367 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:22,368 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] [2025-04-30 10:31:22,370 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-04-30 10:31:22,375 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:22,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1663378957, now seen corresponding path program 1 times [2025-04-30 10:31:22,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:22,381 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057314093] [2025-04-30 10:31:22,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:22,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:22,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-30 10:31:22,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-30 10:31:22,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:22,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:22,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:31:22,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:22,602 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057314093] [2025-04-30 10:31:22,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057314093] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:22,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:22,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:31:22,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809493661] [2025-04-30 10:31:22,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:22,610 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:31:22,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:22,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:31:22,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:31:22,667 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 132 [2025-04-30 10:31:22,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 132 transitions, 268 flow. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 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-04-30 10:31:22,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:22,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 132 [2025-04-30 10:31:22,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:22,809 INFO L116 PetriNetUnfolderBase]: 159/812 cut-off events. [2025-04-30 10:31:22,809 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:31:22,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1124 conditions, 812 events. 159/812 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 4918 event pairs, 32 based on Foata normal form. 16/719 useless extension candidates. Maximal degree in co-relation 1043. Up to 204 conditions per place. [2025-04-30 10:31:22,818 INFO L140 encePairwiseOnDemand]: 116/132 looper letters, 27 selfloop transitions, 8 changer transitions 1/140 dead transitions. [2025-04-30 10:31:22,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 140 transitions, 354 flow [2025-04-30 10:31:22,819 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:31:22,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:31:22,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2025-04-30 10:31:22,830 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9116161616161617 [2025-04-30 10:31:22,832 INFO L175 Difference]: Start difference. First operand has 128 places, 132 transitions, 268 flow. Second operand 3 states and 361 transitions. [2025-04-30 10:31:22,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 140 transitions, 354 flow [2025-04-30 10:31:22,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 140 transitions, 354 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:31:22,840 INFO L231 Difference]: Finished difference. Result has 130 places, 131 transitions, 314 flow [2025-04-30 10:31:22,842 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=314, PETRI_PLACES=130, PETRI_TRANSITIONS=131} [2025-04-30 10:31:22,846 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, 2 predicate places. [2025-04-30 10:31:22,846 INFO L485 AbstractCegarLoop]: Abstraction has has 130 places, 131 transitions, 314 flow [2025-04-30 10:31:22,847 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 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-04-30 10:31:22,847 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:22,847 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:31:22,847 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:31:22,847 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-04-30 10:31:22,848 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:22,848 INFO L85 PathProgramCache]: Analyzing trace with hash -77756437, now seen corresponding path program 1 times [2025-04-30 10:31:22,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:22,848 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828269312] [2025-04-30 10:31:22,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:22,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:22,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-30 10:31:22,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-30 10:31:22,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:22,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:22,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:31:22,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:22,928 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828269312] [2025-04-30 10:31:22,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828269312] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:22,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:22,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:31:22,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098090275] [2025-04-30 10:31:22,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:22,929 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:31:22,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:22,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:31:22,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:31:22,942 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 132 [2025-04-30 10:31:22,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 131 transitions, 314 flow. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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-04-30 10:31:22,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:22,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 132 [2025-04-30 10:31:22,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:23,077 INFO L116 PetriNetUnfolderBase]: 198/1064 cut-off events. [2025-04-30 10:31:23,077 INFO L117 PetriNetUnfolderBase]: For 41/43 co-relation queries the response was YES. [2025-04-30 10:31:23,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1573 conditions, 1064 events. 198/1064 cut-off events. For 41/43 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 7485 event pairs, 88 based on Foata normal form. 0/923 useless extension candidates. Maximal degree in co-relation 1485. Up to 271 conditions per place. [2025-04-30 10:31:23,083 INFO L140 encePairwiseOnDemand]: 127/132 looper letters, 22 selfloop transitions, 4 changer transitions 0/140 dead transitions. [2025-04-30 10:31:23,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 140 transitions, 384 flow [2025-04-30 10:31:23,083 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:31:23,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:31:23,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 360 transitions. [2025-04-30 10:31:23,085 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9090909090909091 [2025-04-30 10:31:23,085 INFO L175 Difference]: Start difference. First operand has 130 places, 131 transitions, 314 flow. Second operand 3 states and 360 transitions. [2025-04-30 10:31:23,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 140 transitions, 384 flow [2025-04-30 10:31:23,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 140 transitions, 368 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:31:23,088 INFO L231 Difference]: Finished difference. Result has 131 places, 134 transitions, 328 flow [2025-04-30 10:31:23,088 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=328, PETRI_PLACES=131, PETRI_TRANSITIONS=134} [2025-04-30 10:31:23,089 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, 3 predicate places. [2025-04-30 10:31:23,089 INFO L485 AbstractCegarLoop]: Abstraction has has 131 places, 134 transitions, 328 flow [2025-04-30 10:31:23,089 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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-04-30 10:31:23,089 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:23,089 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:31:23,090 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:31:23,090 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-04-30 10:31:23,090 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:23,090 INFO L85 PathProgramCache]: Analyzing trace with hash -136255783, now seen corresponding path program 1 times [2025-04-30 10:31:23,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:23,090 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481958400] [2025-04-30 10:31:23,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:23,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:23,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-30 10:31:23,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-30 10:31:23,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:23,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:23,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:31:23,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:23,168 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481958400] [2025-04-30 10:31:23,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481958400] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:23,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:23,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:31:23,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482679801] [2025-04-30 10:31:23,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:23,169 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:31:23,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:23,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:31:23,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:31:23,205 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 132 [2025-04-30 10:31:23,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 134 transitions, 328 flow. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 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-04-30 10:31:23,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:23,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 132 [2025-04-30 10:31:23,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:23,335 INFO L116 PetriNetUnfolderBase]: 179/1009 cut-off events. [2025-04-30 10:31:23,335 INFO L117 PetriNetUnfolderBase]: For 123/152 co-relation queries the response was YES. [2025-04-30 10:31:23,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1576 conditions, 1009 events. 179/1009 cut-off events. For 123/152 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 6860 event pairs, 60 based on Foata normal form. 8/900 useless extension candidates. Maximal degree in co-relation 1486. Up to 297 conditions per place. [2025-04-30 10:31:23,344 INFO L140 encePairwiseOnDemand]: 126/132 looper letters, 24 selfloop transitions, 7 changer transitions 0/142 dead transitions. [2025-04-30 10:31:23,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 142 transitions, 414 flow [2025-04-30 10:31:23,345 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:31:23,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:31:23,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 353 transitions. [2025-04-30 10:31:23,346 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8914141414141414 [2025-04-30 10:31:23,346 INFO L175 Difference]: Start difference. First operand has 131 places, 134 transitions, 328 flow. Second operand 3 states and 353 transitions. [2025-04-30 10:31:23,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 142 transitions, 414 flow [2025-04-30 10:31:23,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 142 transitions, 406 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:31:23,351 INFO L231 Difference]: Finished difference. Result has 133 places, 140 transitions, 382 flow [2025-04-30 10:31:23,353 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=382, PETRI_PLACES=133, PETRI_TRANSITIONS=140} [2025-04-30 10:31:23,354 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, 5 predicate places. [2025-04-30 10:31:23,354 INFO L485 AbstractCegarLoop]: Abstraction has has 133 places, 140 transitions, 382 flow [2025-04-30 10:31:23,354 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 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-04-30 10:31:23,354 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:23,355 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:31:23,355 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:31:23,355 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-04-30 10:31:23,355 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:23,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1596046409, now seen corresponding path program 1 times [2025-04-30 10:31:23,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:23,356 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358075021] [2025-04-30 10:31:23,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:23,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:23,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-30 10:31:23,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-30 10:31:23,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:23,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:23,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:31:23,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:23,434 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358075021] [2025-04-30 10:31:23,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358075021] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:23,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:23,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:31:23,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074654475] [2025-04-30 10:31:23,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:23,436 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:31:23,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:23,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:31:23,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:31:23,448 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 132 [2025-04-30 10:31:23,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 140 transitions, 382 flow. Second operand has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 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-04-30 10:31:23,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:23,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 132 [2025-04-30 10:31:23,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:23,570 INFO L116 PetriNetUnfolderBase]: 198/1203 cut-off events. [2025-04-30 10:31:23,570 INFO L117 PetriNetUnfolderBase]: For 102/114 co-relation queries the response was YES. [2025-04-30 10:31:23,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1832 conditions, 1203 events. 198/1203 cut-off events. For 102/114 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 8116 event pairs, 50 based on Foata normal form. 4/1057 useless extension candidates. Maximal degree in co-relation 1742. Up to 201 conditions per place. [2025-04-30 10:31:23,578 INFO L140 encePairwiseOnDemand]: 128/132 looper letters, 18 selfloop transitions, 3 changer transitions 0/148 dead transitions. [2025-04-30 10:31:23,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 148 transitions, 440 flow [2025-04-30 10:31:23,578 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:31:23,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:31:23,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions. [2025-04-30 10:31:23,580 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9267676767676768 [2025-04-30 10:31:23,580 INFO L175 Difference]: Start difference. First operand has 133 places, 140 transitions, 382 flow. Second operand 3 states and 367 transitions. [2025-04-30 10:31:23,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 148 transitions, 440 flow [2025-04-30 10:31:23,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 148 transitions, 426 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:31:23,587 INFO L231 Difference]: Finished difference. Result has 135 places, 142 transitions, 390 flow [2025-04-30 10:31:23,588 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=390, PETRI_PLACES=135, PETRI_TRANSITIONS=142} [2025-04-30 10:31:23,588 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, 7 predicate places. [2025-04-30 10:31:23,588 INFO L485 AbstractCegarLoop]: Abstraction has has 135 places, 142 transitions, 390 flow [2025-04-30 10:31:23,588 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 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-04-30 10:31:23,588 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:23,589 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:31:23,589 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:31:23,589 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-04-30 10:31:23,589 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:23,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1349461623, now seen corresponding path program 1 times [2025-04-30 10:31:23,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:23,591 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499900366] [2025-04-30 10:31:23,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:23,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:23,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-04-30 10:31:23,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-04-30 10:31:23,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:23,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:31:23,618 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-30 10:31:23,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-04-30 10:31:23,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-04-30 10:31:23,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:23,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:31:23,651 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-30 10:31:23,651 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-30 10:31:23,652 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2025-04-30 10:31:23,653 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (15 of 17 remaining) [2025-04-30 10:31:23,653 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (14 of 17 remaining) [2025-04-30 10:31:23,654 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (13 of 17 remaining) [2025-04-30 10:31:23,654 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 17 remaining) [2025-04-30 10:31:23,654 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (11 of 17 remaining) [2025-04-30 10:31:23,654 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (10 of 17 remaining) [2025-04-30 10:31:23,654 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (9 of 17 remaining) [2025-04-30 10:31:23,654 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (8 of 17 remaining) [2025-04-30 10:31:23,654 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr5ASSERT_VIOLATIONDATA_RACE (7 of 17 remaining) [2025-04-30 10:31:23,654 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (6 of 17 remaining) [2025-04-30 10:31:23,654 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 17 remaining) [2025-04-30 10:31:23,654 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 17 remaining) [2025-04-30 10:31:23,654 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 17 remaining) [2025-04-30 10:31:23,654 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (2 of 17 remaining) [2025-04-30 10:31:23,654 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr5ASSERT_VIOLATIONDATA_RACE (1 of 17 remaining) [2025-04-30 10:31:23,655 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (0 of 17 remaining) [2025-04-30 10:31:23,655 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:31:23,655 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-04-30 10:31:23,657 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-30 10:31:23,657 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-30 10:31:23,681 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-30 10:31:23,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 181 places, 185 transitions, 380 flow [2025-04-30 10:31:23,714 INFO L116 PetriNetUnfolderBase]: 17/265 cut-off events. [2025-04-30 10:31:23,715 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-30 10:31:23,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 273 conditions, 265 events. 17/265 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 758 event pairs, 0 based on Foata normal form. 0/221 useless extension candidates. Maximal degree in co-relation 169. Up to 6 conditions per place. [2025-04-30 10:31:23,716 INFO L82 GeneralOperation]: Start removeDead. Operand has 181 places, 185 transitions, 380 flow [2025-04-30 10:31:23,717 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 181 places, 185 transitions, 380 flow [2025-04-30 10:31:23,718 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:31:23,718 INFO L340 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;@72a9ef98, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:31:23,718 INFO L341 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-04-30 10:31:23,721 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:31:23,721 INFO L116 PetriNetUnfolderBase]: 1/42 cut-off events. [2025-04-30 10:31:23,721 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:31:23,721 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:23,721 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] [2025-04-30 10:31:23,721 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-04-30 10:31:23,722 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:23,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1777307085, now seen corresponding path program 1 times [2025-04-30 10:31:23,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:23,722 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565877214] [2025-04-30 10:31:23,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:23,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:23,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-30 10:31:23,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-30 10:31:23,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:23,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:23,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:31:23,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:23,758 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565877214] [2025-04-30 10:31:23,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565877214] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:23,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:23,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:31:23,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134261980] [2025-04-30 10:31:23,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:23,759 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:31:23,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:23,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:31:23,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:31:23,795 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 185 [2025-04-30 10:31:23,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 185 transitions, 380 flow. Second operand has 3 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 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-04-30 10:31:23,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:23,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 185 [2025-04-30 10:31:23,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:25,200 INFO L116 PetriNetUnfolderBase]: 5875/17635 cut-off events. [2025-04-30 10:31:25,200 INFO L117 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-04-30 10:31:25,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26569 conditions, 17635 events. 5875/17635 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 530. Compared 197262 event pairs, 1985 based on Foata normal form. 531/15546 useless extension candidates. Maximal degree in co-relation 20027. Up to 5255 conditions per place. [2025-04-30 10:31:25,324 INFO L140 encePairwiseOnDemand]: 158/185 looper letters, 53 selfloop transitions, 16 changer transitions 1/211 dead transitions. [2025-04-30 10:31:25,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 211 transitions, 575 flow [2025-04-30 10:31:25,325 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:31:25,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:31:25,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 510 transitions. [2025-04-30 10:31:25,326 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.918918918918919 [2025-04-30 10:31:25,326 INFO L175 Difference]: Start difference. First operand has 181 places, 185 transitions, 380 flow. Second operand 3 states and 510 transitions. [2025-04-30 10:31:25,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 211 transitions, 575 flow [2025-04-30 10:31:25,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 211 transitions, 575 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:31:25,329 INFO L231 Difference]: Finished difference. Result has 185 places, 195 transitions, 508 flow [2025-04-30 10:31:25,330 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=508, PETRI_PLACES=185, PETRI_TRANSITIONS=195} [2025-04-30 10:31:25,330 INFO L279 CegarLoopForPetriNet]: 181 programPoint places, 4 predicate places. [2025-04-30 10:31:25,330 INFO L485 AbstractCegarLoop]: Abstraction has has 185 places, 195 transitions, 508 flow [2025-04-30 10:31:25,331 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 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-04-30 10:31:25,331 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:25,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, 1, 1, 1] [2025-04-30 10:31:25,331 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:31:25,331 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-04-30 10:31:25,331 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:25,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1477404420, now seen corresponding path program 1 times [2025-04-30 10:31:25,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:25,332 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849420151] [2025-04-30 10:31:25,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:25,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:25,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-30 10:31:25,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-30 10:31:25,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:25,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:25,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-04-30 10:31:25,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:25,360 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849420151] [2025-04-30 10:31:25,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849420151] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:25,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:25,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:31:25,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138333542] [2025-04-30 10:31:25,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:25,361 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:31:25,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:25,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:31:25,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:31:25,387 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 185 [2025-04-30 10:31:25,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 195 transitions, 508 flow. Second operand has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 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-04-30 10:31:25,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:25,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 185 [2025-04-30 10:31:25,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:27,068 INFO L116 PetriNetUnfolderBase]: 6214/21778 cut-off events. [2025-04-30 10:31:27,068 INFO L117 PetriNetUnfolderBase]: For 1078/1224 co-relation queries the response was YES. [2025-04-30 10:31:27,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34303 conditions, 21778 events. 6214/21778 cut-off events. For 1078/1224 co-relation queries the response was YES. Maximal size of possible extension queue 794. Compared 275611 event pairs, 3318 based on Foata normal form. 0/19006 useless extension candidates. Maximal degree in co-relation 32652. Up to 6232 conditions per place. [2025-04-30 10:31:27,169 INFO L140 encePairwiseOnDemand]: 179/185 looper letters, 36 selfloop transitions, 5 changer transitions 0/211 dead transitions. [2025-04-30 10:31:27,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 211 transitions, 622 flow [2025-04-30 10:31:27,170 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:31:27,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:31:27,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 507 transitions. [2025-04-30 10:31:27,171 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9135135135135135 [2025-04-30 10:31:27,171 INFO L175 Difference]: Start difference. First operand has 185 places, 195 transitions, 508 flow. Second operand 3 states and 507 transitions. [2025-04-30 10:31:27,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 211 transitions, 622 flow [2025-04-30 10:31:27,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 211 transitions, 590 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:31:27,181 INFO L231 Difference]: Finished difference. Result has 186 places, 199 transitions, 514 flow [2025-04-30 10:31:27,181 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=514, PETRI_PLACES=186, PETRI_TRANSITIONS=199} [2025-04-30 10:31:27,182 INFO L279 CegarLoopForPetriNet]: 181 programPoint places, 5 predicate places. [2025-04-30 10:31:27,182 INFO L485 AbstractCegarLoop]: Abstraction has has 186 places, 199 transitions, 514 flow [2025-04-30 10:31:27,182 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 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-04-30 10:31:27,182 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:27,183 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:31:27,183 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:31:27,183 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-04-30 10:31:27,183 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:27,183 INFO L85 PathProgramCache]: Analyzing trace with hash 350445293, now seen corresponding path program 1 times [2025-04-30 10:31:27,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:27,183 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048407586] [2025-04-30 10:31:27,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:27,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:27,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-30 10:31:27,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-30 10:31:27,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:27,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:27,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:31:27,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:27,209 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048407586] [2025-04-30 10:31:27,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048407586] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:27,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:27,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:31:27,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597323885] [2025-04-30 10:31:27,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:27,209 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:31:27,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:27,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:31:27,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:31:27,254 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 185 [2025-04-30 10:31:27,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 199 transitions, 514 flow. Second operand has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 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-04-30 10:31:27,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:27,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 185 [2025-04-30 10:31:27,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:27,356 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][118], [182#true, 8#L691-7true, 189#true, 194#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 180#true, 100#L712-1true, Black: 184#true, 121#L691-2true]) [2025-04-30 10:31:27,357 INFO L286 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2025-04-30 10:31:27,357 INFO L289 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2025-04-30 10:31:27,357 INFO L289 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2025-04-30 10:31:27,357 INFO L289 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2025-04-30 10:31:27,393 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][44], [182#true, 189#true, 194#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 180#true, 100#L712-1true, 45#L692true, 121#L691-2true, Black: 184#true]) [2025-04-30 10:31:27,394 INFO L286 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2025-04-30 10:31:27,394 INFO L289 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2025-04-30 10:31:27,394 INFO L289 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2025-04-30 10:31:27,394 INFO L289 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2025-04-30 10:31:27,395 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][44], [182#true, 189#true, 194#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 28#L692-3true, 180#true, 100#L712-1true, Black: 184#true, 121#L691-2true]) [2025-04-30 10:31:27,395 INFO L286 olderBase$Statistics]: this new event has 80 ancestors and is cut-off event [2025-04-30 10:31:27,395 INFO L289 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2025-04-30 10:31:27,395 INFO L289 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2025-04-30 10:31:27,395 INFO L289 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-04-30 10:31:27,416 INFO L284 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][44], [182#true, 189#true, 194#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 180#true, 28#L692-3true, 100#L712-1true, Black: 184#true, 121#L691-2true]) [2025-04-30 10:31:27,416 INFO L286 olderBase$Statistics]: this new event has 80 ancestors and is cut-off event [2025-04-30 10:31:27,416 INFO L289 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2025-04-30 10:31:27,416 INFO L289 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-04-30 10:31:27,417 INFO L289 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2025-04-30 10:31:27,417 INFO L289 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2025-04-30 10:31:27,468 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][44], [182#true, 189#true, 194#true, 20#L700-2true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 180#true, 100#L712-1true, Black: 184#true, 121#L691-2true]) [2025-04-30 10:31:27,469 INFO L286 olderBase$Statistics]: this new event has 85 ancestors and is cut-off event [2025-04-30 10:31:27,469 INFO L289 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-04-30 10:31:27,469 INFO L289 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-04-30 10:31:27,469 INFO L289 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-04-30 10:31:27,469 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][44], [182#true, 4#L694-2true, 189#true, 194#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 180#true, 100#L712-1true, Black: 184#true, 121#L691-2true]) [2025-04-30 10:31:27,469 INFO L286 olderBase$Statistics]: this new event has 85 ancestors and is cut-off event [2025-04-30 10:31:27,469 INFO L289 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-04-30 10:31:27,469 INFO L289 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-04-30 10:31:27,469 INFO L289 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-04-30 10:31:27,591 INFO L284 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][44], [182#true, 189#true, 20#L700-2true, 194#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 180#true, 100#L712-1true, Black: 184#true, 121#L691-2true]) [2025-04-30 10:31:27,591 INFO L286 olderBase$Statistics]: this new event has 85 ancestors and is cut-off event [2025-04-30 10:31:27,591 INFO L289 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-04-30 10:31:27,591 INFO L289 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-04-30 10:31:27,591 INFO L289 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-04-30 10:31:27,591 INFO L289 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-04-30 10:31:27,592 INFO L284 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][44], [182#true, 4#L694-2true, 189#true, 194#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 180#true, 100#L712-1true, Black: 184#true, 121#L691-2true]) [2025-04-30 10:31:27,592 INFO L286 olderBase$Statistics]: this new event has 85 ancestors and is cut-off event [2025-04-30 10:31:27,592 INFO L289 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-04-30 10:31:27,592 INFO L289 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-04-30 10:31:27,592 INFO L289 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2025-04-30 10:31:27,592 INFO L289 olderBase$Statistics]: existing Event has 82 ancestors and is cut-off event [2025-04-30 10:31:27,600 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][44], [182#true, 189#true, 194#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 122#L695-3true, 180#true, 100#L712-1true, Black: 184#true, 121#L691-2true]) [2025-04-30 10:31:27,601 INFO L286 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2025-04-30 10:31:27,601 INFO L289 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-04-30 10:31:27,601 INFO L289 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-04-30 10:31:27,601 INFO L289 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-04-30 10:31:27,637 INFO L284 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][44], [182#true, 189#true, 194#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 122#L695-3true, 180#true, 100#L712-1true, 121#L691-2true, Black: 184#true]) [2025-04-30 10:31:27,637 INFO L286 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2025-04-30 10:31:27,637 INFO L289 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-04-30 10:31:27,638 INFO L289 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2025-04-30 10:31:27,638 INFO L289 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-04-30 10:31:27,638 INFO L289 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2025-04-30 10:31:27,793 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][118], [130#L701-2true, 182#true, 8#L691-7true, 189#true, 194#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 180#true, 100#L712-1true, Black: 184#true]) [2025-04-30 10:31:27,793 INFO L286 olderBase$Statistics]: this new event has 93 ancestors and is cut-off event [2025-04-30 10:31:27,794 INFO L289 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2025-04-30 10:31:27,794 INFO L289 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2025-04-30 10:31:27,794 INFO L289 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2025-04-30 10:31:27,921 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][44], [130#L701-2true, 182#true, 189#true, 194#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 180#true, 28#L692-3true, 100#L712-1true, Black: 184#true]) [2025-04-30 10:31:27,921 INFO L286 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2025-04-30 10:31:27,921 INFO L289 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2025-04-30 10:31:27,921 INFO L289 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2025-04-30 10:31:27,921 INFO L289 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-04-30 10:31:27,921 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][44], [130#L701-2true, 182#true, 189#true, 194#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 180#true, 100#L712-1true, 45#L692true, Black: 184#true]) [2025-04-30 10:31:27,921 INFO L286 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2025-04-30 10:31:27,921 INFO L289 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2025-04-30 10:31:27,921 INFO L289 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2025-04-30 10:31:27,921 INFO L289 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2025-04-30 10:31:27,970 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][44], [182#true, 177#L697-3true, 189#true, 194#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 180#true, 100#L712-1true, Black: 184#true, 121#L691-2true]) [2025-04-30 10:31:27,970 INFO L286 olderBase$Statistics]: this new event has 97 ancestors and is cut-off event [2025-04-30 10:31:27,970 INFO L289 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2025-04-30 10:31:27,970 INFO L289 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2025-04-30 10:31:27,970 INFO L289 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-04-30 10:31:27,981 INFO L284 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][44], [130#L701-2true, 182#true, 189#true, 194#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 180#true, 28#L692-3true, 100#L712-1true, Black: 184#true]) [2025-04-30 10:31:27,981 INFO L286 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2025-04-30 10:31:27,981 INFO L289 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2025-04-30 10:31:27,981 INFO L289 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-04-30 10:31:27,981 INFO L289 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2025-04-30 10:31:27,981 INFO L289 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-04-30 10:31:28,027 INFO L284 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][44], [182#true, 177#L697-3true, 189#true, 194#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 180#true, 100#L712-1true, 121#L691-2true, Black: 184#true]) [2025-04-30 10:31:28,027 INFO L286 olderBase$Statistics]: this new event has 97 ancestors and is cut-off event [2025-04-30 10:31:28,027 INFO L289 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2025-04-30 10:31:28,027 INFO L289 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2025-04-30 10:31:28,027 INFO L289 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-04-30 10:31:28,027 INFO L289 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2025-04-30 10:31:28,068 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][44], [182#true, 189#true, 194#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 180#true, 100#L712-1true, 97#L698-3true, Black: 184#true, 121#L691-2true]) [2025-04-30 10:31:28,068 INFO L286 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2025-04-30 10:31:28,068 INFO L289 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-04-30 10:31:28,068 INFO L289 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-04-30 10:31:28,068 INFO L289 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-04-30 10:31:28,129 INFO L284 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][44], [182#true, 189#true, 194#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 180#true, 100#L712-1true, 97#L698-3true, Black: 184#true, 121#L691-2true]) [2025-04-30 10:31:28,130 INFO L286 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2025-04-30 10:31:28,130 INFO L289 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-04-30 10:31:28,130 INFO L289 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2025-04-30 10:31:28,130 INFO L289 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-04-30 10:31:28,130 INFO L289 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-04-30 10:31:28,169 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][44], [130#L701-2true, 182#true, 189#true, 194#true, 20#L700-2true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 180#true, 100#L712-1true, Black: 184#true]) [2025-04-30 10:31:28,169 INFO L286 olderBase$Statistics]: this new event has 101 ancestors and is cut-off event [2025-04-30 10:31:28,169 INFO L289 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-04-30 10:31:28,169 INFO L289 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-04-30 10:31:28,169 INFO L289 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-04-30 10:31:28,171 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][44], [130#L701-2true, 182#true, 4#L694-2true, 189#true, 194#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 180#true, 100#L712-1true, Black: 184#true]) [2025-04-30 10:31:28,171 INFO L286 olderBase$Statistics]: this new event has 101 ancestors and is cut-off event [2025-04-30 10:31:28,171 INFO L289 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-04-30 10:31:28,171 INFO L289 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-04-30 10:31:28,171 INFO L289 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-04-30 10:31:28,242 INFO L284 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][44], [130#L701-2true, 182#true, 189#true, 20#L700-2true, 194#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 180#true, 100#L712-1true, Black: 184#true]) [2025-04-30 10:31:28,242 INFO L286 olderBase$Statistics]: this new event has 101 ancestors and is cut-off event [2025-04-30 10:31:28,242 INFO L289 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-04-30 10:31:28,242 INFO L289 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-04-30 10:31:28,242 INFO L289 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-04-30 10:31:28,242 INFO L289 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-04-30 10:31:28,242 INFO L284 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][44], [130#L701-2true, 182#true, 4#L694-2true, 189#true, 194#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 180#true, 100#L712-1true, Black: 184#true]) [2025-04-30 10:31:28,243 INFO L286 olderBase$Statistics]: this new event has 101 ancestors and is cut-off event [2025-04-30 10:31:28,243 INFO L289 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-04-30 10:31:28,243 INFO L289 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-04-30 10:31:28,243 INFO L289 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-04-30 10:31:28,243 INFO L289 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-04-30 10:31:28,288 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][44], [130#L701-2true, 182#true, 189#true, 194#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 122#L695-3true, 180#true, 100#L712-1true, Black: 184#true]) [2025-04-30 10:31:28,288 INFO L286 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2025-04-30 10:31:28,289 INFO L289 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-04-30 10:31:28,289 INFO L289 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-04-30 10:31:28,289 INFO L289 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-04-30 10:31:28,357 INFO L284 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][44], [130#L701-2true, 182#true, 189#true, 194#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 122#L695-3true, 180#true, 100#L712-1true, Black: 184#true]) [2025-04-30 10:31:28,357 INFO L286 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2025-04-30 10:31:28,357 INFO L289 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-04-30 10:31:28,357 INFO L289 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-04-30 10:31:28,357 INFO L289 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-04-30 10:31:28,357 INFO L289 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-04-30 10:31:28,778 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][44], [130#L701-2true, 182#true, 177#L697-3true, 189#true, 194#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 180#true, 100#L712-1true, Black: 184#true]) [2025-04-30 10:31:28,778 INFO L286 olderBase$Statistics]: this new event has 113 ancestors and is cut-off event [2025-04-30 10:31:28,778 INFO L289 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-04-30 10:31:28,778 INFO L289 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-04-30 10:31:28,778 INFO L289 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-04-30 10:31:28,826 INFO L284 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][44], [130#L701-2true, 177#L697-3true, 182#true, 189#true, 194#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 180#true, 100#L712-1true, Black: 184#true]) [2025-04-30 10:31:28,826 INFO L286 olderBase$Statistics]: this new event has 113 ancestors and is cut-off event [2025-04-30 10:31:28,826 INFO L289 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-04-30 10:31:28,826 INFO L289 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-04-30 10:31:28,826 INFO L289 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2025-04-30 10:31:28,826 INFO L289 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-04-30 10:31:28,861 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][44], [130#L701-2true, 182#true, 189#true, 194#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 180#true, 100#L712-1true, 97#L698-3true, Black: 184#true]) [2025-04-30 10:31:28,861 INFO L286 olderBase$Statistics]: this new event has 115 ancestors and is cut-off event [2025-04-30 10:31:28,861 INFO L289 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-04-30 10:31:28,861 INFO L289 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2025-04-30 10:31:28,861 INFO L289 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-04-30 10:31:29,038 INFO L284 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][44], [130#L701-2true, 182#true, 189#true, 194#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 180#true, 100#L712-1true, 97#L698-3true, Black: 184#true]) [2025-04-30 10:31:29,038 INFO L286 olderBase$Statistics]: this new event has 115 ancestors and is cut-off event [2025-04-30 10:31:29,038 INFO L289 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-04-30 10:31:29,038 INFO L289 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2025-04-30 10:31:29,038 INFO L289 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2025-04-30 10:31:29,039 INFO L289 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-04-30 10:31:29,221 INFO L116 PetriNetUnfolderBase]: 7571/25064 cut-off events. [2025-04-30 10:31:29,221 INFO L117 PetriNetUnfolderBase]: For 4169/5357 co-relation queries the response was YES. [2025-04-30 10:31:29,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42986 conditions, 25064 events. 7571/25064 cut-off events. For 4169/5357 co-relation queries the response was YES. Maximal size of possible extension queue 819. Compared 312265 event pairs, 3421 based on Foata normal form. 210/21895 useless extension candidates. Maximal degree in co-relation 41284. Up to 9528 conditions per place. [2025-04-30 10:31:29,333 INFO L140 encePairwiseOnDemand]: 175/185 looper letters, 47 selfloop transitions, 16 changer transitions 0/222 dead transitions. [2025-04-30 10:31:29,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 222 transitions, 715 flow [2025-04-30 10:31:29,334 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:31:29,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:31:29,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 498 transitions. [2025-04-30 10:31:29,335 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8972972972972973 [2025-04-30 10:31:29,335 INFO L175 Difference]: Start difference. First operand has 186 places, 199 transitions, 514 flow. Second operand 3 states and 498 transitions. [2025-04-30 10:31:29,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 222 transitions, 715 flow [2025-04-30 10:31:29,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 222 transitions, 705 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:31:29,344 INFO L231 Difference]: Finished difference. Result has 188 places, 213 transitions, 650 flow [2025-04-30 10:31:29,345 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=650, PETRI_PLACES=188, PETRI_TRANSITIONS=213} [2025-04-30 10:31:29,345 INFO L279 CegarLoopForPetriNet]: 181 programPoint places, 7 predicate places. [2025-04-30 10:31:29,345 INFO L485 AbstractCegarLoop]: Abstraction has has 188 places, 213 transitions, 650 flow [2025-04-30 10:31:29,346 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 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-04-30 10:31:29,346 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:29,346 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:31:29,346 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:31:29,346 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-04-30 10:31:29,346 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:29,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1715512912, now seen corresponding path program 1 times [2025-04-30 10:31:29,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:29,347 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085119518] [2025-04-30 10:31:29,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:29,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:29,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-30 10:31:29,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-30 10:31:29,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:29,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:29,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:31:29,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:29,389 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085119518] [2025-04-30 10:31:29,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085119518] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:29,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:29,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:31:29,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562058951] [2025-04-30 10:31:29,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:29,390 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:31:29,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:29,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:31:29,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:31:29,398 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 185 [2025-04-30 10:31:29,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 213 transitions, 650 flow. Second operand has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 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-04-30 10:31:29,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:29,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 185 [2025-04-30 10:31:29,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:29,466 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][116], [182#true, 8#L691-7true, 194#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 199#true, 180#true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 100#L712-1true, Black: 184#true, 121#L691-2true]) [2025-04-30 10:31:29,466 INFO L286 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2025-04-30 10:31:29,466 INFO L289 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2025-04-30 10:31:29,466 INFO L289 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2025-04-30 10:31:29,466 INFO L289 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2025-04-30 10:31:29,487 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][44], [182#true, 194#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 199#true, 180#true, 100#L712-1true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 45#L692true, Black: 184#true, 121#L691-2true]) [2025-04-30 10:31:29,487 INFO L286 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2025-04-30 10:31:29,487 INFO L289 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2025-04-30 10:31:29,487 INFO L289 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2025-04-30 10:31:29,487 INFO L289 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2025-04-30 10:31:29,670 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][116], [130#L701-2true, 182#true, 8#L691-7true, 194#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 199#true, 180#true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 100#L712-1true, Black: 184#true]) [2025-04-30 10:31:29,671 INFO L286 olderBase$Statistics]: this new event has 93 ancestors and is cut-off event [2025-04-30 10:31:29,671 INFO L289 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2025-04-30 10:31:29,671 INFO L289 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2025-04-30 10:31:29,671 INFO L289 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2025-04-30 10:31:29,868 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][44], [130#L701-2true, 182#true, 194#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 199#true, 180#true, 100#L712-1true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 45#L692true, Black: 184#true]) [2025-04-30 10:31:29,869 INFO L286 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2025-04-30 10:31:29,869 INFO L289 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2025-04-30 10:31:29,869 INFO L289 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2025-04-30 10:31:29,869 INFO L289 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2025-04-30 10:31:30,030 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([590] L701-->L701-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][203], [182#true, 106#L701-1true, 8#L691-7true, 132#L716-2true, 194#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 199#true, 180#true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), Black: 184#true]) [2025-04-30 10:31:30,030 INFO L286 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2025-04-30 10:31:30,030 INFO L289 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-04-30 10:31:30,030 INFO L289 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-04-30 10:31:30,030 INFO L289 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-04-30 10:31:30,134 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([411] L716-3-->L716-1: Formula: (= 0 |v_#race~threads_alive~0_4|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_4|} AuxVars[] AssignedVars[#race~threads_alive~0][162], [130#L701-2true, 182#true, 8#L691-7true, 194#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 199#true, 180#true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 148#L716-1true, Black: 184#true]) [2025-04-30 10:31:30,134 INFO L286 olderBase$Statistics]: this new event has 105 ancestors and is cut-off event [2025-04-30 10:31:30,134 INFO L289 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-04-30 10:31:30,134 INFO L289 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-04-30 10:31:30,134 INFO L289 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-04-30 10:31:30,166 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([590] L701-->L701-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][169], [182#true, 106#L701-1true, 132#L716-2true, 194#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 199#true, 180#true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 45#L692true, Black: 184#true]) [2025-04-30 10:31:30,166 INFO L286 olderBase$Statistics]: this new event has 104 ancestors and is cut-off event [2025-04-30 10:31:30,166 INFO L289 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2025-04-30 10:31:30,166 INFO L289 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2025-04-30 10:31:30,166 INFO L289 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2025-04-30 10:31:31,130 INFO L116 PetriNetUnfolderBase]: 7298/27862 cut-off events. [2025-04-30 10:31:31,130 INFO L117 PetriNetUnfolderBase]: For 3172/3890 co-relation queries the response was YES. [2025-04-30 10:31:31,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45202 conditions, 27862 events. 7298/27862 cut-off events. For 3172/3890 co-relation queries the response was YES. Maximal size of possible extension queue 854. Compared 365936 event pairs, 3019 based on Foata normal form. 35/24037 useless extension candidates. Maximal degree in co-relation 43287. Up to 5991 conditions per place. [2025-04-30 10:31:31,273 INFO L140 encePairwiseOnDemand]: 180/185 looper letters, 32 selfloop transitions, 4 changer transitions 0/228 dead transitions. [2025-04-30 10:31:31,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 228 transitions, 752 flow [2025-04-30 10:31:31,273 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:31:31,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:31:31,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 514 transitions. [2025-04-30 10:31:31,274 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9261261261261261 [2025-04-30 10:31:31,274 INFO L175 Difference]: Start difference. First operand has 188 places, 213 transitions, 650 flow. Second operand 3 states and 514 transitions. [2025-04-30 10:31:31,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 228 transitions, 752 flow [2025-04-30 10:31:31,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 228 transitions, 720 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:31:31,284 INFO L231 Difference]: Finished difference. Result has 190 places, 216 transitions, 648 flow [2025-04-30 10:31:31,284 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=648, PETRI_PLACES=190, PETRI_TRANSITIONS=216} [2025-04-30 10:31:31,284 INFO L279 CegarLoopForPetriNet]: 181 programPoint places, 9 predicate places. [2025-04-30 10:31:31,284 INFO L485 AbstractCegarLoop]: Abstraction has has 190 places, 216 transitions, 648 flow [2025-04-30 10:31:31,285 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 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-04-30 10:31:31,285 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:31,285 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:31:31,285 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-30 10:31:31,285 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-04-30 10:31:31,285 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:31,285 INFO L85 PathProgramCache]: Analyzing trace with hash -167807534, now seen corresponding path program 1 times [2025-04-30 10:31:31,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:31,286 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769353150] [2025-04-30 10:31:31,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:31,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:31,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-04-30 10:31:31,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-04-30 10:31:31,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:31,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:31:31,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:31:31,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:31:31,316 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769353150] [2025-04-30 10:31:31,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769353150] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:31:31,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:31:31,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:31:31,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991504183] [2025-04-30 10:31:31,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:31:31,317 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:31:31,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:31:31,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:31:31,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:31:31,324 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 185 [2025-04-30 10:31:31,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 216 transitions, 648 flow. Second operand has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 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-04-30 10:31:31,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:31:31,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 185 [2025-04-30 10:31:31,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:31:31,394 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][116], [182#true, 8#L691-7true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 199#true, 180#true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 100#L712-1true, 204#true, Black: 201#(= |#race~data~0| 0), Black: 184#true, 121#L691-2true]) [2025-04-30 10:31:31,394 INFO L286 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2025-04-30 10:31:31,394 INFO L289 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2025-04-30 10:31:31,394 INFO L289 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2025-04-30 10:31:31,394 INFO L289 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2025-04-30 10:31:31,413 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][44], [182#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 199#true, 180#true, 100#L712-1true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 45#L692true, 204#true, Black: 201#(= |#race~data~0| 0), 121#L691-2true, Black: 184#true]) [2025-04-30 10:31:31,414 INFO L286 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2025-04-30 10:31:31,414 INFO L289 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2025-04-30 10:31:31,414 INFO L289 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2025-04-30 10:31:31,414 INFO L289 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2025-04-30 10:31:31,828 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][116], [130#L701-2true, 182#true, 8#L691-7true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 199#true, 180#true, 206#(= |#race~keep_alive~0| 0), Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 100#L712-1true, Black: 201#(= |#race~data~0| 0), Black: 184#true]) [2025-04-30 10:31:31,828 INFO L286 olderBase$Statistics]: this new event has 93 ancestors and is cut-off event [2025-04-30 10:31:31,828 INFO L289 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2025-04-30 10:31:31,828 INFO L289 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2025-04-30 10:31:31,828 INFO L289 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2025-04-30 10:31:31,975 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([401] L712-3-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_1|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_1|} AuxVars[] AssignedVars[#race~threads_alive~0][44], [130#L701-2true, 182#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 199#true, 180#true, 100#L712-1true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 206#(= |#race~keep_alive~0| 0), 45#L692true, Black: 201#(= |#race~data~0| 0), Black: 184#true]) [2025-04-30 10:31:31,975 INFO L286 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2025-04-30 10:31:31,975 INFO L289 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2025-04-30 10:31:31,975 INFO L289 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2025-04-30 10:31:31,975 INFO L289 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2025-04-30 10:31:32,170 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([590] L701-->L701-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][210], [182#true, 106#L701-1true, 8#L691-7true, 132#L716-2true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 199#true, 180#true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 206#(= |#race~keep_alive~0| 0), Black: 184#true, Black: 201#(= |#race~data~0| 0)]) [2025-04-30 10:31:32,170 INFO L286 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2025-04-30 10:31:32,170 INFO L289 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-04-30 10:31:32,170 INFO L289 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-04-30 10:31:32,170 INFO L289 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-04-30 10:31:32,623 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([590] L701-->L701-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][171], [182#true, 106#L701-1true, 132#L716-2true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 199#true, 180#true, 206#(= |#race~keep_alive~0| 0), Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 45#L692true, Black: 201#(= |#race~data~0| 0), Black: 184#true]) [2025-04-30 10:31:32,623 INFO L286 olderBase$Statistics]: this new event has 104 ancestors and is cut-off event [2025-04-30 10:31:32,623 INFO L289 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2025-04-30 10:31:32,623 INFO L289 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2025-04-30 10:31:32,623 INFO L289 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2025-04-30 10:31:33,459 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][231], [51#L714-4true, 182#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 199#true, 104#L693-1true, 180#true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 206#(= |#race~keep_alive~0| 0), Black: 184#true, Black: 201#(= |#race~data~0| 0), 94#L693-2true]) [2025-04-30 10:31:33,460 INFO L286 olderBase$Statistics]: this new event has 117 ancestors and is cut-off event [2025-04-30 10:31:33,460 INFO L289 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-04-30 10:31:33,460 INFO L289 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2025-04-30 10:31:33,460 INFO L289 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-04-30 10:31:33,461 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][231], [51#L714-4true, 182#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 199#true, 104#L693-1true, 180#true, 206#(= |#race~keep_alive~0| 0), Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), Black: 186#(= |#race~threads_alive~0| 0), Black: 201#(= |#race~data~0| 0), 94#L693-2true]) [2025-04-30 10:31:33,461 INFO L286 olderBase$Statistics]: this new event has 117 ancestors and is cut-off event [2025-04-30 10:31:33,461 INFO L289 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2025-04-30 10:31:33,461 INFO L289 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-04-30 10:31:33,461 INFO L289 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-04-30 10:31:33,506 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([583] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][235], [57#L693-1true, 51#L714-4true, 30#L693-2true, 182#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 199#true, 180#true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 206#(= |#race~keep_alive~0| 0), Black: 184#true, Black: 201#(= |#race~data~0| 0)]) [2025-04-30 10:31:33,506 INFO L286 olderBase$Statistics]: this new event has 117 ancestors and is cut-off event [2025-04-30 10:31:33,506 INFO L289 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-04-30 10:31:33,506 INFO L289 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2025-04-30 10:31:33,507 INFO L289 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-04-30 10:31:33,507 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([583] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][235], [57#L693-1true, 51#L714-4true, 30#L693-2true, 182#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 199#true, 180#true, 206#(= |#race~keep_alive~0| 0), Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), Black: 186#(= |#race~threads_alive~0| 0), Black: 201#(= |#race~data~0| 0)]) [2025-04-30 10:31:33,507 INFO L286 olderBase$Statistics]: this new event has 117 ancestors and is cut-off event [2025-04-30 10:31:33,507 INFO L289 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-04-30 10:31:33,507 INFO L289 olderBase$Statistics]: existing Event has 98 ancestors and is cut-off event [2025-04-30 10:31:33,507 INFO L289 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2025-04-30 10:31:33,532 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][179], [182#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 199#true, 104#L693-1true, 180#true, 206#(= |#race~keep_alive~0| 0), Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 19#L715true, Black: 184#true, Black: 201#(= |#race~data~0| 0), 94#L693-2true]) [2025-04-30 10:31:33,532 INFO L286 olderBase$Statistics]: this new event has 118 ancestors and is cut-off event [2025-04-30 10:31:33,532 INFO L289 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2025-04-30 10:31:33,532 INFO L289 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-04-30 10:31:33,532 INFO L289 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-04-30 10:31:33,533 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][179], [182#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 104#L693-1true, 199#true, 180#true, 206#(= |#race~keep_alive~0| 0), Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 19#L715true, Black: 186#(= |#race~threads_alive~0| 0), Black: 201#(= |#race~data~0| 0), 94#L693-2true]) [2025-04-30 10:31:33,533 INFO L286 olderBase$Statistics]: this new event has 118 ancestors and is cut-off event [2025-04-30 10:31:33,533 INFO L289 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-04-30 10:31:33,533 INFO L289 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2025-04-30 10:31:33,533 INFO L289 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-04-30 10:31:33,554 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][231], [51#L714-4true, 182#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 199#true, 104#L693-1true, 180#true, 175#L700-2true, 206#(= |#race~keep_alive~0| 0), Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), Black: 184#true, Black: 201#(= |#race~data~0| 0)]) [2025-04-30 10:31:33,554 INFO L286 olderBase$Statistics]: this new event has 119 ancestors and is cut-off event [2025-04-30 10:31:33,554 INFO L289 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2025-04-30 10:31:33,554 INFO L289 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-04-30 10:31:33,554 INFO L289 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-04-30 10:31:33,554 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][231], [51#L714-4true, 182#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 199#true, 104#L693-1true, 180#true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 206#(= |#race~keep_alive~0| 0), Black: 184#true, Black: 201#(= |#race~data~0| 0), 119#L694-2true]) [2025-04-30 10:31:33,554 INFO L286 olderBase$Statistics]: this new event has 119 ancestors and is cut-off event [2025-04-30 10:31:33,554 INFO L289 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-04-30 10:31:33,554 INFO L289 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2025-04-30 10:31:33,554 INFO L289 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-04-30 10:31:33,556 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][231], [51#L714-4true, 182#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 199#true, 104#L693-1true, 180#true, 175#L700-2true, 206#(= |#race~keep_alive~0| 0), Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), Black: 186#(= |#race~threads_alive~0| 0), Black: 201#(= |#race~data~0| 0)]) [2025-04-30 10:31:33,556 INFO L286 olderBase$Statistics]: this new event has 119 ancestors and is cut-off event [2025-04-30 10:31:33,556 INFO L289 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-04-30 10:31:33,556 INFO L289 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-04-30 10:31:33,556 INFO L289 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2025-04-30 10:31:33,556 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][231], [51#L714-4true, 182#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 199#true, 104#L693-1true, 180#true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 206#(= |#race~keep_alive~0| 0), Black: 186#(= |#race~threads_alive~0| 0), Black: 201#(= |#race~data~0| 0), 119#L694-2true]) [2025-04-30 10:31:33,556 INFO L286 olderBase$Statistics]: this new event has 119 ancestors and is cut-off event [2025-04-30 10:31:33,556 INFO L289 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-04-30 10:31:33,556 INFO L289 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-04-30 10:31:33,556 INFO L289 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2025-04-30 10:31:33,579 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([583] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][200], [57#L693-1true, 30#L693-2true, 182#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 199#true, 180#true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 206#(= |#race~keep_alive~0| 0), 19#L715true, Black: 184#true, Black: 201#(= |#race~data~0| 0)]) [2025-04-30 10:31:33,580 INFO L286 olderBase$Statistics]: this new event has 118 ancestors and is cut-off event [2025-04-30 10:31:33,580 INFO L289 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2025-04-30 10:31:33,580 INFO L289 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-04-30 10:31:33,580 INFO L289 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-04-30 10:31:33,580 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([583] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][200], [57#L693-1true, 30#L693-2true, 182#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 199#true, 180#true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 206#(= |#race~keep_alive~0| 0), 19#L715true, Black: 186#(= |#race~threads_alive~0| 0), Black: 201#(= |#race~data~0| 0)]) [2025-04-30 10:31:33,580 INFO L286 olderBase$Statistics]: this new event has 118 ancestors and is cut-off event [2025-04-30 10:31:33,580 INFO L289 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-04-30 10:31:33,580 INFO L289 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2025-04-30 10:31:33,580 INFO L289 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2025-04-30 10:31:33,600 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([583] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][235], [57#L693-1true, 51#L714-4true, 182#true, 20#L700-2true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 199#true, 180#true, 206#(= |#race~keep_alive~0| 0), Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), Black: 184#true, Black: 201#(= |#race~data~0| 0)]) [2025-04-30 10:31:33,600 INFO L286 olderBase$Statistics]: this new event has 119 ancestors and is cut-off event [2025-04-30 10:31:33,600 INFO L289 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2025-04-30 10:31:33,600 INFO L289 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-04-30 10:31:33,600 INFO L289 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-04-30 10:31:33,600 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([583] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][235], [57#L693-1true, 182#true, 51#L714-4true, 20#L700-2true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 199#true, 180#true, 206#(= |#race~keep_alive~0| 0), Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), Black: 186#(= |#race~threads_alive~0| 0), Black: 201#(= |#race~data~0| 0)]) [2025-04-30 10:31:33,600 INFO L286 olderBase$Statistics]: this new event has 119 ancestors and is cut-off event [2025-04-30 10:31:33,600 INFO L289 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-04-30 10:31:33,600 INFO L289 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-04-30 10:31:33,600 INFO L289 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2025-04-30 10:31:33,601 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([583] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][235], [57#L693-1true, 51#L714-4true, 182#true, 4#L694-2true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 199#true, 180#true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 206#(= |#race~keep_alive~0| 0), Black: 184#true, Black: 201#(= |#race~data~0| 0)]) [2025-04-30 10:31:33,601 INFO L286 olderBase$Statistics]: this new event has 119 ancestors and is cut-off event [2025-04-30 10:31:33,601 INFO L289 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-04-30 10:31:33,601 INFO L289 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-04-30 10:31:33,601 INFO L289 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2025-04-30 10:31:33,602 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([583] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][235], [57#L693-1true, 51#L714-4true, 182#true, 4#L694-2true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 199#true, 180#true, 206#(= |#race~keep_alive~0| 0), Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), Black: 186#(= |#race~threads_alive~0| 0), Black: 201#(= |#race~data~0| 0)]) [2025-04-30 10:31:33,602 INFO L286 olderBase$Statistics]: this new event has 119 ancestors and is cut-off event [2025-04-30 10:31:33,602 INFO L289 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2025-04-30 10:31:33,602 INFO L289 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-04-30 10:31:33,602 INFO L289 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2025-04-30 10:31:33,623 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][179], [182#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 199#true, 104#L693-1true, 180#true, 175#L700-2true, 206#(= |#race~keep_alive~0| 0), Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 19#L715true, Black: 184#true, Black: 201#(= |#race~data~0| 0)]) [2025-04-30 10:31:33,623 INFO L286 olderBase$Statistics]: this new event has 120 ancestors and is cut-off event [2025-04-30 10:31:33,623 INFO L289 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-04-30 10:31:33,623 INFO L289 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-04-30 10:31:33,623 INFO L289 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-04-30 10:31:33,623 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][179], [182#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 199#true, 104#L693-1true, 180#true, 206#(= |#race~keep_alive~0| 0), Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 19#L715true, Black: 184#true, Black: 201#(= |#race~data~0| 0), 119#L694-2true]) [2025-04-30 10:31:33,623 INFO L286 olderBase$Statistics]: this new event has 120 ancestors and is cut-off event [2025-04-30 10:31:33,623 INFO L289 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-04-30 10:31:33,623 INFO L289 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-04-30 10:31:33,623 INFO L289 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-04-30 10:31:33,624 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][179], [182#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 199#true, 104#L693-1true, 180#true, 175#L700-2true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 206#(= |#race~keep_alive~0| 0), 19#L715true, Black: 186#(= |#race~threads_alive~0| 0), Black: 201#(= |#race~data~0| 0)]) [2025-04-30 10:31:33,624 INFO L286 olderBase$Statistics]: this new event has 120 ancestors and is cut-off event [2025-04-30 10:31:33,624 INFO L289 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-04-30 10:31:33,624 INFO L289 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-04-30 10:31:33,624 INFO L289 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-04-30 10:31:33,624 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][179], [182#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 104#L693-1true, 199#true, 180#true, 206#(= |#race~keep_alive~0| 0), Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 19#L715true, Black: 186#(= |#race~threads_alive~0| 0), Black: 201#(= |#race~data~0| 0), 119#L694-2true]) [2025-04-30 10:31:33,624 INFO L286 olderBase$Statistics]: this new event has 120 ancestors and is cut-off event [2025-04-30 10:31:33,624 INFO L289 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-04-30 10:31:33,624 INFO L289 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-04-30 10:31:33,624 INFO L289 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-04-30 10:31:33,643 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][231], [34#L695-3true, 51#L714-4true, 182#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 199#true, 104#L693-1true, 180#true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 206#(= |#race~keep_alive~0| 0), Black: 184#true, Black: 201#(= |#race~data~0| 0)]) [2025-04-30 10:31:33,644 INFO L286 olderBase$Statistics]: this new event has 121 ancestors and is cut-off event [2025-04-30 10:31:33,644 INFO L289 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-04-30 10:31:33,644 INFO L289 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-04-30 10:31:33,644 INFO L289 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-04-30 10:31:33,645 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][231], [51#L714-4true, 34#L695-3true, 182#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 199#true, 104#L693-1true, 180#true, 206#(= |#race~keep_alive~0| 0), Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), Black: 186#(= |#race~threads_alive~0| 0), Black: 201#(= |#race~data~0| 0)]) [2025-04-30 10:31:33,645 INFO L286 olderBase$Statistics]: this new event has 121 ancestors and is cut-off event [2025-04-30 10:31:33,645 INFO L289 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-04-30 10:31:33,645 INFO L289 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-04-30 10:31:33,645 INFO L289 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-04-30 10:31:33,664 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([583] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][200], [57#L693-1true, 182#true, 20#L700-2true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 199#true, 180#true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 206#(= |#race~keep_alive~0| 0), 19#L715true, Black: 184#true, Black: 201#(= |#race~data~0| 0)]) [2025-04-30 10:31:33,664 INFO L286 olderBase$Statistics]: this new event has 120 ancestors and is cut-off event [2025-04-30 10:31:33,664 INFO L289 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-04-30 10:31:33,664 INFO L289 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-04-30 10:31:33,664 INFO L289 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-04-30 10:31:33,664 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([583] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][200], [57#L693-1true, 182#true, 20#L700-2true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 199#true, 180#true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 206#(= |#race~keep_alive~0| 0), 19#L715true, Black: 186#(= |#race~threads_alive~0| 0), Black: 201#(= |#race~data~0| 0)]) [2025-04-30 10:31:33,664 INFO L286 olderBase$Statistics]: this new event has 120 ancestors and is cut-off event [2025-04-30 10:31:33,664 INFO L289 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-04-30 10:31:33,664 INFO L289 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-04-30 10:31:33,664 INFO L289 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-04-30 10:31:33,665 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([583] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][200], [57#L693-1true, 182#true, 4#L694-2true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 199#true, 180#true, 206#(= |#race~keep_alive~0| 0), Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 19#L715true, Black: 184#true, Black: 201#(= |#race~data~0| 0)]) [2025-04-30 10:31:33,665 INFO L286 olderBase$Statistics]: this new event has 120 ancestors and is cut-off event [2025-04-30 10:31:33,665 INFO L289 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-04-30 10:31:33,665 INFO L289 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-04-30 10:31:33,665 INFO L289 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-04-30 10:31:33,665 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([583] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][200], [57#L693-1true, 182#true, 4#L694-2true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 199#true, 180#true, 206#(= |#race~keep_alive~0| 0), Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 19#L715true, Black: 186#(= |#race~threads_alive~0| 0), Black: 201#(= |#race~data~0| 0)]) [2025-04-30 10:31:33,665 INFO L286 olderBase$Statistics]: this new event has 120 ancestors and is cut-off event [2025-04-30 10:31:33,665 INFO L289 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-04-30 10:31:33,665 INFO L289 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2025-04-30 10:31:33,665 INFO L289 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2025-04-30 10:31:33,681 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([583] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][235], [57#L693-1true, 51#L714-4true, 182#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 199#true, 122#L695-3true, 180#true, 206#(= |#race~keep_alive~0| 0), Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), Black: 184#true, Black: 201#(= |#race~data~0| 0)]) [2025-04-30 10:31:33,681 INFO L286 olderBase$Statistics]: this new event has 121 ancestors and is cut-off event [2025-04-30 10:31:33,681 INFO L289 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-04-30 10:31:33,681 INFO L289 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-04-30 10:31:33,681 INFO L289 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-04-30 10:31:33,682 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([583] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][235], [57#L693-1true, 51#L714-4true, 182#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 199#true, 122#L695-3true, 180#true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 206#(= |#race~keep_alive~0| 0), Black: 186#(= |#race~threads_alive~0| 0), Black: 201#(= |#race~data~0| 0)]) [2025-04-30 10:31:33,682 INFO L286 olderBase$Statistics]: this new event has 121 ancestors and is cut-off event [2025-04-30 10:31:33,682 INFO L289 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-04-30 10:31:33,682 INFO L289 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2025-04-30 10:31:33,682 INFO L289 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-04-30 10:31:33,702 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][179], [34#L695-3true, 182#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 199#true, 104#L693-1true, 180#true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 206#(= |#race~keep_alive~0| 0), 19#L715true, Black: 184#true, Black: 201#(= |#race~data~0| 0)]) [2025-04-30 10:31:33,702 INFO L286 olderBase$Statistics]: this new event has 122 ancestors and is cut-off event [2025-04-30 10:31:33,702 INFO L289 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-04-30 10:31:33,702 INFO L289 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2025-04-30 10:31:33,702 INFO L289 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-04-30 10:31:33,702 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][179], [34#L695-3true, 182#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 104#L693-1true, 199#true, 180#true, 206#(= |#race~keep_alive~0| 0), Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 19#L715true, Black: 186#(= |#race~threads_alive~0| 0), Black: 201#(= |#race~data~0| 0)]) [2025-04-30 10:31:33,702 INFO L286 olderBase$Statistics]: this new event has 122 ancestors and is cut-off event [2025-04-30 10:31:33,702 INFO L289 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2025-04-30 10:31:33,702 INFO L289 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-04-30 10:31:33,703 INFO L289 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-04-30 10:31:33,738 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([583] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][200], [57#L693-1true, 182#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 199#true, 122#L695-3true, 180#true, 206#(= |#race~keep_alive~0| 0), Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 19#L715true, Black: 184#true, Black: 201#(= |#race~data~0| 0)]) [2025-04-30 10:31:33,738 INFO L286 olderBase$Statistics]: this new event has 122 ancestors and is cut-off event [2025-04-30 10:31:33,738 INFO L289 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-04-30 10:31:33,738 INFO L289 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-04-30 10:31:33,739 INFO L289 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2025-04-30 10:31:33,739 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([583] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][200], [57#L693-1true, 182#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 199#true, 122#L695-3true, 180#true, 206#(= |#race~keep_alive~0| 0), Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 19#L715true, Black: 186#(= |#race~threads_alive~0| 0), Black: 201#(= |#race~data~0| 0)]) [2025-04-30 10:31:33,739 INFO L286 olderBase$Statistics]: this new event has 122 ancestors and is cut-off event [2025-04-30 10:31:33,739 INFO L289 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2025-04-30 10:31:33,739 INFO L289 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-04-30 10:31:33,739 INFO L289 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-04-30 10:31:33,923 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][231], [51#L714-4true, 182#true, 161#L697-3true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 199#true, 104#L693-1true, 180#true, 206#(= |#race~keep_alive~0| 0), Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), Black: 184#true, Black: 201#(= |#race~data~0| 0)]) [2025-04-30 10:31:33,923 INFO L286 olderBase$Statistics]: this new event has 131 ancestors and is cut-off event [2025-04-30 10:31:33,923 INFO L289 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2025-04-30 10:31:33,923 INFO L289 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-04-30 10:31:33,923 INFO L289 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-04-30 10:31:33,924 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][231], [51#L714-4true, 182#true, 161#L697-3true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 199#true, 104#L693-1true, 180#true, 206#(= |#race~keep_alive~0| 0), Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), Black: 186#(= |#race~threads_alive~0| 0), Black: 201#(= |#race~data~0| 0)]) [2025-04-30 10:31:33,924 INFO L286 olderBase$Statistics]: this new event has 131 ancestors and is cut-off event [2025-04-30 10:31:33,924 INFO L289 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-04-30 10:31:33,924 INFO L289 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-04-30 10:31:33,924 INFO L289 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2025-04-30 10:31:33,939 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([583] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][235], [57#L693-1true, 51#L714-4true, 177#L697-3true, 182#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 199#true, 180#true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 206#(= |#race~keep_alive~0| 0), Black: 184#true, Black: 201#(= |#race~data~0| 0)]) [2025-04-30 10:31:33,940 INFO L286 olderBase$Statistics]: this new event has 131 ancestors and is cut-off event [2025-04-30 10:31:33,940 INFO L289 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-04-30 10:31:33,940 INFO L289 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-04-30 10:31:33,940 INFO L289 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2025-04-30 10:31:33,940 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([583] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][235], [57#L693-1true, 51#L714-4true, 177#L697-3true, 182#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 199#true, 180#true, 206#(= |#race~keep_alive~0| 0), Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), Black: 186#(= |#race~threads_alive~0| 0), Black: 201#(= |#race~data~0| 0)]) [2025-04-30 10:31:33,940 INFO L286 olderBase$Statistics]: this new event has 131 ancestors and is cut-off event [2025-04-30 10:31:33,940 INFO L289 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-04-30 10:31:33,940 INFO L289 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2025-04-30 10:31:33,940 INFO L289 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2025-04-30 10:31:33,949 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][179], [182#true, 161#L697-3true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 199#true, 104#L693-1true, 180#true, 206#(= |#race~keep_alive~0| 0), Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 19#L715true, Black: 184#true, Black: 201#(= |#race~data~0| 0)]) [2025-04-30 10:31:33,949 INFO L286 olderBase$Statistics]: this new event has 132 ancestors and is cut-off event [2025-04-30 10:31:33,949 INFO L289 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-04-30 10:31:33,949 INFO L289 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-04-30 10:31:33,949 INFO L289 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2025-04-30 10:31:33,949 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][179], [182#true, 161#L697-3true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 199#true, 104#L693-1true, 180#true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 206#(= |#race~keep_alive~0| 0), 19#L715true, Black: 186#(= |#race~threads_alive~0| 0), Black: 201#(= |#race~data~0| 0)]) [2025-04-30 10:31:33,949 INFO L286 olderBase$Statistics]: this new event has 132 ancestors and is cut-off event [2025-04-30 10:31:33,949 INFO L289 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-04-30 10:31:33,949 INFO L289 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-04-30 10:31:33,949 INFO L289 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2025-04-30 10:31:33,954 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][231], [51#L714-4true, 182#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 29#L698-3true, 199#true, 104#L693-1true, 180#true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 206#(= |#race~keep_alive~0| 0), Black: 184#true, Black: 201#(= |#race~data~0| 0)]) [2025-04-30 10:31:33,954 INFO L286 olderBase$Statistics]: this new event has 133 ancestors and is cut-off event [2025-04-30 10:31:33,955 INFO L289 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2025-04-30 10:31:33,955 INFO L289 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2025-04-30 10:31:33,955 INFO L289 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2025-04-30 10:31:33,955 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][231], [51#L714-4true, 182#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 29#L698-3true, 199#true, 104#L693-1true, 180#true, 206#(= |#race~keep_alive~0| 0), Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), Black: 186#(= |#race~threads_alive~0| 0), Black: 201#(= |#race~data~0| 0)]) [2025-04-30 10:31:33,955 INFO L286 olderBase$Statistics]: this new event has 133 ancestors and is cut-off event [2025-04-30 10:31:33,955 INFO L289 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2025-04-30 10:31:33,955 INFO L289 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2025-04-30 10:31:33,955 INFO L289 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2025-04-30 10:31:33,964 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([583] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][200], [57#L693-1true, 177#L697-3true, 182#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 199#true, 180#true, 206#(= |#race~keep_alive~0| 0), Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 19#L715true, Black: 184#true, Black: 201#(= |#race~data~0| 0)]) [2025-04-30 10:31:33,964 INFO L286 olderBase$Statistics]: this new event has 132 ancestors and is cut-off event [2025-04-30 10:31:33,964 INFO L289 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-04-30 10:31:33,964 INFO L289 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-04-30 10:31:33,964 INFO L289 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2025-04-30 10:31:33,964 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([583] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][200], [57#L693-1true, 177#L697-3true, 182#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 199#true, 180#true, 206#(= |#race~keep_alive~0| 0), Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 19#L715true, Black: 186#(= |#race~threads_alive~0| 0), Black: 201#(= |#race~data~0| 0)]) [2025-04-30 10:31:33,964 INFO L286 olderBase$Statistics]: this new event has 132 ancestors and is cut-off event [2025-04-30 10:31:33,964 INFO L289 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2025-04-30 10:31:33,964 INFO L289 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-04-30 10:31:33,964 INFO L289 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-04-30 10:31:33,969 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([583] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][235], [57#L693-1true, 51#L714-4true, 182#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 199#true, 180#true, 206#(= |#race~keep_alive~0| 0), Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 97#L698-3true, Black: 184#true, Black: 201#(= |#race~data~0| 0)]) [2025-04-30 10:31:33,969 INFO L286 olderBase$Statistics]: this new event has 133 ancestors and is cut-off event [2025-04-30 10:31:33,969 INFO L289 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2025-04-30 10:31:33,969 INFO L289 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2025-04-30 10:31:33,969 INFO L289 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2025-04-30 10:31:33,969 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([583] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][235], [57#L693-1true, 51#L714-4true, 182#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 199#true, 180#true, 206#(= |#race~keep_alive~0| 0), Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), Black: 186#(= |#race~threads_alive~0| 0), 97#L698-3true, Black: 201#(= |#race~data~0| 0)]) [2025-04-30 10:31:33,969 INFO L286 olderBase$Statistics]: this new event has 133 ancestors and is cut-off event [2025-04-30 10:31:33,970 INFO L289 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2025-04-30 10:31:33,970 INFO L289 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2025-04-30 10:31:33,970 INFO L289 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2025-04-30 10:31:33,978 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][179], [182#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 29#L698-3true, 199#true, 104#L693-1true, 180#true, 206#(= |#race~keep_alive~0| 0), Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 19#L715true, Black: 184#true, Black: 201#(= |#race~data~0| 0)]) [2025-04-30 10:31:33,978 INFO L286 olderBase$Statistics]: this new event has 134 ancestors and is cut-off event [2025-04-30 10:31:33,978 INFO L289 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2025-04-30 10:31:33,979 INFO L289 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2025-04-30 10:31:33,979 INFO L289 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2025-04-30 10:31:33,979 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([531] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][179], [182#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 29#L698-3true, 199#true, 104#L693-1true, 180#true, 206#(= |#race~keep_alive~0| 0), Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 19#L715true, Black: 186#(= |#race~threads_alive~0| 0), Black: 201#(= |#race~data~0| 0)]) [2025-04-30 10:31:33,979 INFO L286 olderBase$Statistics]: this new event has 134 ancestors and is cut-off event [2025-04-30 10:31:33,979 INFO L289 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2025-04-30 10:31:33,979 INFO L289 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2025-04-30 10:31:33,979 INFO L289 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2025-04-30 10:31:34,165 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([583] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][200], [57#L693-1true, 182#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 199#true, 180#true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 206#(= |#race~keep_alive~0| 0), 19#L715true, 97#L698-3true, Black: 184#true, Black: 201#(= |#race~data~0| 0)]) [2025-04-30 10:31:34,166 INFO L286 olderBase$Statistics]: this new event has 134 ancestors and is cut-off event [2025-04-30 10:31:34,166 INFO L289 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2025-04-30 10:31:34,166 INFO L289 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2025-04-30 10:31:34,166 INFO L289 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2025-04-30 10:31:34,166 INFO L284 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([583] L693-5-->L693-1: Formula: (= |v_#race~keep_alive~0_4| 0) InVars {} OutVars{#race~keep_alive~0=|v_#race~keep_alive~0_4|} AuxVars[] AssignedVars[#race~keep_alive~0][200], [57#L693-1true, 182#true, Black: 191#(= |#race~keep_alive~0| |ULTIMATE.start_main_#t~nondet18#1|), 199#true, 180#true, Black: 196#(= |threadThread1of2ForFork0_#t~nondet1| |#race~threads_alive~0|), 206#(= |#race~keep_alive~0| 0), 19#L715true, Black: 186#(= |#race~threads_alive~0| 0), 97#L698-3true, Black: 201#(= |#race~data~0| 0)]) [2025-04-30 10:31:34,166 INFO L286 olderBase$Statistics]: this new event has 134 ancestors and is cut-off event [2025-04-30 10:31:34,166 INFO L289 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2025-04-30 10:31:34,166 INFO L289 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2025-04-30 10:31:34,166 INFO L289 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2025-04-30 10:31:34,214 INFO L116 PetriNetUnfolderBase]: 9642/37247 cut-off events. [2025-04-30 10:31:34,214 INFO L117 PetriNetUnfolderBase]: For 6041/7025 co-relation queries the response was YES. [2025-04-30 10:31:34,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63909 conditions, 37247 events. 9642/37247 cut-off events. For 6041/7025 co-relation queries the response was YES. Maximal size of possible extension queue 1198. Compared 511501 event pairs, 2273 based on Foata normal form. 37/32873 useless extension candidates. Maximal degree in co-relation 61599. Up to 8515 conditions per place. [2025-04-30 10:31:34,398 INFO L140 encePairwiseOnDemand]: 178/185 looper letters, 40 selfloop transitions, 7 changer transitions 0/238 dead transitions. [2025-04-30 10:31:34,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 238 transitions, 801 flow [2025-04-30 10:31:34,398 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:31:34,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:31:34,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 516 transitions. [2025-04-30 10:31:34,399 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9297297297297298 [2025-04-30 10:31:34,399 INFO L175 Difference]: Start difference. First operand has 190 places, 216 transitions, 648 flow. Second operand 3 states and 516 transitions. [2025-04-30 10:31:34,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 238 transitions, 801 flow [2025-04-30 10:31:34,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 238 transitions, 793 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:31:34,448 INFO L231 Difference]: Finished difference. Result has 192 places, 223 transitions, 710 flow [2025-04-30 10:31:34,448 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=640, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=710, PETRI_PLACES=192, PETRI_TRANSITIONS=223} [2025-04-30 10:31:34,448 INFO L279 CegarLoopForPetriNet]: 181 programPoint places, 11 predicate places. [2025-04-30 10:31:34,449 INFO L485 AbstractCegarLoop]: Abstraction has has 192 places, 223 transitions, 710 flow [2025-04-30 10:31:34,449 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 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-04-30 10:31:34,449 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:31:34,449 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:31:34,449 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-30 10:31:34,449 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-04-30 10:31:34,449 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:31:34,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1006170458, now seen corresponding path program 1 times [2025-04-30 10:31:34,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:31:34,450 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568983781] [2025-04-30 10:31:34,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:31:34,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:31:34,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-04-30 10:31:34,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-04-30 10:31:34,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:34,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:31:34,462 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-30 10:31:34,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-04-30 10:31:34,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-04-30 10:31:34,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:31:34,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:31:34,477 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-30 10:31:34,477 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-30 10:31:34,477 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (22 of 23 remaining) [2025-04-30 10:31:34,477 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (21 of 23 remaining) [2025-04-30 10:31:34,477 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (20 of 23 remaining) [2025-04-30 10:31:34,478 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (19 of 23 remaining) [2025-04-30 10:31:34,478 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 23 remaining) [2025-04-30 10:31:34,478 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (17 of 23 remaining) [2025-04-30 10:31:34,478 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (16 of 23 remaining) [2025-04-30 10:31:34,478 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (15 of 23 remaining) [2025-04-30 10:31:34,478 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (14 of 23 remaining) [2025-04-30 10:31:34,478 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr5ASSERT_VIOLATIONDATA_RACE (13 of 23 remaining) [2025-04-30 10:31:34,478 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (12 of 23 remaining) [2025-04-30 10:31:34,478 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (11 of 23 remaining) [2025-04-30 10:31:34,478 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (10 of 23 remaining) [2025-04-30 10:31:34,478 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (9 of 23 remaining) [2025-04-30 10:31:34,478 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (8 of 23 remaining) [2025-04-30 10:31:34,478 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr5ASSERT_VIOLATIONDATA_RACE (7 of 23 remaining) [2025-04-30 10:31:34,478 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (6 of 23 remaining) [2025-04-30 10:31:34,478 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 23 remaining) [2025-04-30 10:31:34,478 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 23 remaining) [2025-04-30 10:31:34,478 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 23 remaining) [2025-04-30 10:31:34,479 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (2 of 23 remaining) [2025-04-30 10:31:34,479 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr5ASSERT_VIOLATIONDATA_RACE (1 of 23 remaining) [2025-04-30 10:31:34,479 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (0 of 23 remaining) [2025-04-30 10:31:34,479 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-30 10:31:34,479 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-04-30 10:31:34,530 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2025-04-30 10:31:34,530 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-30 10:31:34,535 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.04 10:31:34 BasicIcfg [2025-04-30 10:31:34,536 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-30 10:31:34,537 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-30 10:31:34,537 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-30 10:31:34,537 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-30 10:31:34,538 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:31:22" (3/4) ... [2025-04-30 10:31:34,538 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-04-30 10:31:34,577 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 6. [2025-04-30 10:31:34,614 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-30 10:31:34,614 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-30 10:31:34,614 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-30 10:31:34,617 INFO L158 Benchmark]: Toolchain (without parser) took 13224.14ms. Allocated memory was 142.6MB in the beginning and 2.6GB in the end (delta: 2.5GB). Free memory was 109.8MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 965.5MB. Max. memory is 16.1GB. [2025-04-30 10:31:34,618 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:31:34,618 INFO L158 Benchmark]: CACSL2BoogieTranslator took 441.58ms. Allocated memory is still 142.6MB. Free memory was 109.8MB in the beginning and 86.5MB in the end (delta: 23.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-04-30 10:31:34,618 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.91ms. Allocated memory is still 142.6MB. Free memory was 86.5MB in the beginning and 85.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:31:34,618 INFO L158 Benchmark]: Boogie Preprocessor took 20.83ms. Allocated memory is still 142.6MB. Free memory was 85.5MB in the beginning and 83.3MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:31:34,618 INFO L158 Benchmark]: RCFGBuilder took 308.02ms. Allocated memory is still 142.6MB. Free memory was 83.3MB in the beginning and 66.5MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-30 10:31:34,619 INFO L158 Benchmark]: TraceAbstraction took 12344.33ms. Allocated memory was 142.6MB in the beginning and 2.6GB in the end (delta: 2.5GB). Free memory was 65.5MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 915.2MB. Max. memory is 16.1GB. [2025-04-30 10:31:34,619 INFO L158 Benchmark]: Witness Printer took 77.64ms. Allocated memory is still 2.6GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-30 10:31:34,620 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 441.58ms. Allocated memory is still 142.6MB. Free memory was 109.8MB in the beginning and 86.5MB in the end (delta: 23.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.91ms. Allocated memory is still 142.6MB. Free memory was 86.5MB in the beginning and 85.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.83ms. Allocated memory is still 142.6MB. Free memory was 85.5MB in the beginning and 83.3MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 308.02ms. Allocated memory is still 142.6MB. Free memory was 83.3MB in the beginning and 66.5MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 12344.33ms. Allocated memory was 142.6MB in the beginning and 2.6GB in the end (delta: 2.5GB). Free memory was 65.5MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 915.2MB. Max. memory is 16.1GB. * Witness Printer took 77.64ms. Allocated memory is still 2.6GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 712]: Data race detected Data race detected The following path leads to a data race: [L685] 0 int threads_alive = 0; VAL [threads_alive=0] [L686] 0 _Bool keep_alive = 1; VAL [keep_alive=1, threads_alive=0] [L687] 0 pthread_mutex_t keep_alive_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; VAL [keep_alive=1, keep_alive_mutex={1:0}, threads_alive=0] [L688] 0 int data = 0; VAL [data=0, keep_alive=1, keep_alive_mutex={1:0}, threads_alive=0] [L689] 0 pthread_mutex_t data_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; VAL [data=0, data_mutex={2:0}, keep_alive=1, keep_alive_mutex={1:0}, threads_alive=0] [L705] 0 int threads_total = __VERIFIER_nondet_int(); VAL [data=0, data_mutex={2:0}, keep_alive=1, keep_alive_mutex={1:0}, threads_alive=0, threads_total=1] [L706] CALL 0 assume_abort_if_not(threads_total >= 0) [L682] COND FALSE 0 !(!cond) VAL [\at(cond, Pre)=1, cond=1, data=0, data_mutex={2:0}, keep_alive=1, keep_alive_mutex={1:0}, threads_alive=0] [L706] RET 0 assume_abort_if_not(threads_total >= 0) [L707] 0 int i = 0; VAL [data=0, data_mutex={2:0}, i=0, keep_alive=1, keep_alive_mutex={1:0}, threads_alive=0, threads_total=1] [L707] COND TRUE 0 i < threads_total VAL [data=0, data_mutex={2:0}, i=0, keep_alive=1, keep_alive_mutex={1:0}, threads_alive=0, threads_total=1] [L708] 0 pthread_t tid; VAL [data=0, data_mutex={2:0}, i=0, keep_alive=1, keep_alive_mutex={1:0}, threads_alive=0, threads_total=1] [L709] FCALL, FORK 0 pthread_create(&tid, ((void *)0), &thread, ((void *)0)) VAL [\at(arg, Pre)={0:0}, data=0, data_mutex={2:0}, i=0, keep_alive=1, keep_alive_mutex={1:0}, threads_alive=0, threads_total=1, tid=-1] [L707] 0 i++ VAL [\at(arg, Pre)={0:0}, data=0, data_mutex={2:0}, i=1, keep_alive=1, keep_alive_mutex={1:0}, threads_alive=0, threads_total=1] [L707] COND FALSE 0 !(i < threads_total) VAL [\at(arg, Pre)={0:0}, data=0, data_mutex={2:0}, i=1, keep_alive=1, keep_alive_mutex={1:0}, threads_alive=0, threads_total=1] [L712] 0 threads_alive != threads_total VAL [\at(arg, Pre)={0:0}, data=0, data_mutex={2:0}, keep_alive=1, keep_alive_mutex={1:0}, threads_alive=0, threads_total=1] [L691] 1 threads_alive++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, data=0, data_mutex={2:0}, keep_alive=1, keep_alive_mutex={1:0}, threads_alive=1] [L712] 0 threads_alive != threads_total VAL [\at(arg, Pre)={0:0}, arg={0:0}, data=0, data_mutex={2:0}, keep_alive=1, keep_alive_mutex={1:0}, threads_alive=1, threads_total=1] Now there is a data race on ~threads_alive~0 between C: threads_alive++ [691] and C: threads_alive != threads_total [712] - UnprovableResult [Line: 714]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 716]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 717]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 691]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 691]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 701]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 701]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 177 locations, 185 edges, 17 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.4s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 120 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 43 mSDsluCounter, 30 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 172 IncrementalHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 30 mSDtfsCounter, 172 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=390occurred in iteration=4, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 228 NumberOfCodeBlocks, 228 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 172 ConstructedInterpolants, 0 QuantifiedInterpolants, 180 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 228 locations, 238 edges, 23 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 10.8s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 263 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 114 mSDsluCounter, 63 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 344 IncrementalHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 63 mSDtfsCounter, 344 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=710occurred in iteration=5, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 285 NumberOfCodeBlocks, 285 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 223 ConstructedInterpolants, 0 QuantifiedInterpolants, 233 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-04-30 10:31:34,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(DATA-RACE)