./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread/stack_longest-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/stack_longest-1.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 529fe0895c01c52d9b18b51c32204a307faf547c0c07b22bc1a431308affcf90 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 21:35:31,382 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 21:35:31,445 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-08 21:35:31,453 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 21:35:31,453 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 21:35:31,477 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 21:35:31,478 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 21:35:31,478 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 21:35:31,479 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 21:35:31,479 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 21:35:31,480 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 21:35:31,480 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 21:35:31,480 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 21:35:31,480 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 21:35:31,480 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 21:35:31,480 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 21:35:31,480 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 21:35:31,480 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 21:35:31,480 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 21:35:31,480 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 21:35:31,481 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 21:35:31,481 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 21:35:31,481 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 21:35:31,481 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 21:35:31,481 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 21:35:31,481 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 21:35:31,481 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 21:35:31,481 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 21:35:31,481 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 21:35:31,481 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 21:35:31,481 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 21:35:31,481 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:35:31,481 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 21:35:31,481 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 21:35:31,481 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 21:35:31,482 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 21:35:31,482 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 21:35:31,482 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 21:35:31,482 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 21:35:31,482 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 21:35:31,482 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 21:35:31,482 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 21:35:31,482 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 -> 529fe0895c01c52d9b18b51c32204a307faf547c0c07b22bc1a431308affcf90 [2025-03-08 21:35:31,689 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 21:35:31,697 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 21:35:31,698 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 21:35:31,700 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 21:35:31,700 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 21:35:31,701 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/stack_longest-1.i [2025-03-08 21:35:32,805 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/565822683/d66d672dc4704c40a0969f44e013e8c8/FLAG0f5362ebd [2025-03-08 21:35:33,120 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 21:35:33,120 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack_longest-1.i [2025-03-08 21:35:33,136 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/565822683/d66d672dc4704c40a0969f44e013e8c8/FLAG0f5362ebd [2025-03-08 21:35:33,145 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/565822683/d66d672dc4704c40a0969f44e013e8c8 [2025-03-08 21:35:33,148 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 21:35:33,149 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 21:35:33,149 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 21:35:33,149 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 21:35:33,152 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 21:35:33,153 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:35:33" (1/1) ... [2025-03-08 21:35:33,153 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@438c4220 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:35:33, skipping insertion in model container [2025-03-08 21:35:33,153 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:35:33" (1/1) ... [2025-03-08 21:35:33,180 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 21:35:33,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:35:33,538 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 21:35:33,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:35:33,674 INFO L204 MainTranslator]: Completed translation [2025-03-08 21:35:33,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:35:33 WrapperNode [2025-03-08 21:35:33,675 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 21:35:33,676 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 21:35:33,676 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 21:35:33,676 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 21:35:33,681 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:35:33" (1/1) ... [2025-03-08 21:35:33,704 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:35:33" (1/1) ... [2025-03-08 21:35:33,754 INFO L138 Inliner]: procedures = 277, calls = 832, calls flagged for inlining = 13, calls inlined = 14, statements flattened = 988 [2025-03-08 21:35:33,755 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 21:35:33,759 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 21:35:33,759 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 21:35:33,759 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 21:35:33,764 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:35:33" (1/1) ... [2025-03-08 21:35:33,765 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:35:33" (1/1) ... [2025-03-08 21:35:33,774 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:35:33" (1/1) ... [2025-03-08 21:35:33,776 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:35:33" (1/1) ... [2025-03-08 21:35:33,805 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:35:33" (1/1) ... [2025-03-08 21:35:33,807 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:35:33" (1/1) ... [2025-03-08 21:35:33,810 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:35:33" (1/1) ... [2025-03-08 21:35:33,812 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:35:33" (1/1) ... [2025-03-08 21:35:33,820 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 21:35:33,821 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 21:35:33,821 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 21:35:33,821 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 21:35:33,822 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:35:33" (1/1) ... [2025-03-08 21:35:33,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:35:33,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:35:33,849 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 21:35:33,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 21:35:33,868 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-08 21:35:33,869 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-08 21:35:33,869 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-08 21:35:33,869 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-08 21:35:33,869 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-08 21:35:33,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 21:35:33,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 21:35:33,869 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-08 21:35:33,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 21:35:33,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 21:35:33,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 21:35:33,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 21:35:33,870 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 21:35:33,978 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 21:35:33,980 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 21:35:34,970 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L985-1: pop_#res#1 := 0; [2025-03-08 21:35:34,971 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L983: havoc pop_#t~mem41#1; [2025-03-08 21:35:34,971 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L983-1: havoc pop_#t~ret40#1; [2025-03-08 21:35:34,972 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 21:35:34,972 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 21:35:35,033 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 21:35:35,033 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 21:35:35,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:35:35 BoogieIcfgContainer [2025-03-08 21:35:35,034 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 21:35:35,035 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 21:35:35,035 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 21:35:35,039 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 21:35:35,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:35:33" (1/3) ... [2025-03-08 21:35:35,039 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@597768d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:35:35, skipping insertion in model container [2025-03-08 21:35:35,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:35:33" (2/3) ... [2025-03-08 21:35:35,040 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@597768d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:35:35, skipping insertion in model container [2025-03-08 21:35:35,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:35:35" (3/3) ... [2025-03-08 21:35:35,041 INFO L128 eAbstractionObserver]: Analyzing ICFG stack_longest-1.i [2025-03-08 21:35:35,052 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 21:35:35,054 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG stack_longest-1.i that has 3 procedures, 1006 locations, 1 initial locations, 2 loop locations, and 12 error locations. [2025-03-08 21:35:35,054 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 21:35:35,152 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-08 21:35:35,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1012 places, 1015 transitions, 2044 flow [2025-03-08 21:35:35,529 INFO L124 PetriNetUnfolderBase]: 10/1013 cut-off events. [2025-03-08 21:35:35,532 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-08 21:35:35,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1022 conditions, 1013 events. 10/1013 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 548 event pairs, 0 based on Foata normal form. 0/991 useless extension candidates. Maximal degree in co-relation 924. Up to 3 conditions per place. [2025-03-08 21:35:35,544 INFO L82 GeneralOperation]: Start removeDead. Operand has 1012 places, 1015 transitions, 2044 flow [2025-03-08 21:35:35,556 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1005 places, 1008 transitions, 2025 flow [2025-03-08 21:35:35,565 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:35:35,576 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7074c398, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:35:35,578 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-03-08 21:35:35,754 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 21:35:35,754 INFO L124 PetriNetUnfolderBase]: 0/861 cut-off events. [2025-03-08 21:35:35,754 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 21:35:35,755 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:35,756 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:35:35,757 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-08 21:35:35,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:35,765 INFO L85 PathProgramCache]: Analyzing trace with hash 31792897, now seen corresponding path program 1 times [2025-03-08 21:35:35,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:35,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700711327] [2025-03-08 21:35:35,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:35,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:35,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 840 statements into 1 equivalence classes. [2025-03-08 21:35:36,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 840 of 840 statements. [2025-03-08 21:35:36,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:36,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:36,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:35:36,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:36,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700711327] [2025-03-08 21:35:36,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700711327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:36,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:36,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:35:36,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730743349] [2025-03-08 21:35:36,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:36,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:35:36,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:36,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:35:36,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:35:36,611 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1015 [2025-03-08 21:35:36,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1005 places, 1008 transitions, 2025 flow. Second operand has 3 states, 3 states have (on average 997.6666666666666) internal successors, (2993), 3 states have internal predecessors, (2993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:36,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:36,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1015 [2025-03-08 21:35:36,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:37,005 INFO L124 PetriNetUnfolderBase]: 73/1763 cut-off events. [2025-03-08 21:35:37,006 INFO L125 PetriNetUnfolderBase]: For 53/53 co-relation queries the response was YES. [2025-03-08 21:35:37,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1899 conditions, 1763 events. 73/1763 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 5186 event pairs, 10 based on Foata normal form. 40/1683 useless extension candidates. Maximal degree in co-relation 965. Up to 58 conditions per place. [2025-03-08 21:35:37,022 INFO L140 encePairwiseOnDemand]: 1006/1015 looper letters, 16 selfloop transitions, 3 changer transitions 0/1005 dead transitions. [2025-03-08 21:35:37,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1001 places, 1005 transitions, 2060 flow [2025-03-08 21:35:37,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:35:37,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:35:37,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3018 transitions. [2025-03-08 21:35:37,042 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9911330049261083 [2025-03-08 21:35:37,045 INFO L175 Difference]: Start difference. First operand has 1005 places, 1008 transitions, 2025 flow. Second operand 3 states and 3018 transitions. [2025-03-08 21:35:37,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1001 places, 1005 transitions, 2060 flow [2025-03-08 21:35:37,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 998 places, 1005 transitions, 2053 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-08 21:35:37,068 INFO L231 Difference]: Finished difference. Result has 1000 places, 1000 transitions, 2024 flow [2025-03-08 21:35:37,071 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1015, PETRI_DIFFERENCE_MINUEND_FLOW=1998, PETRI_DIFFERENCE_MINUEND_PLACES=996, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=997, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=994, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2024, PETRI_PLACES=1000, PETRI_TRANSITIONS=1000} [2025-03-08 21:35:37,075 INFO L279 CegarLoopForPetriNet]: 1005 programPoint places, -5 predicate places. [2025-03-08 21:35:37,076 INFO L471 AbstractCegarLoop]: Abstraction has has 1000 places, 1000 transitions, 2024 flow [2025-03-08 21:35:37,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 997.6666666666666) internal successors, (2993), 3 states have internal predecessors, (2993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:37,077 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:37,077 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:35:37,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 21:35:37,078 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-08 21:35:37,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:37,081 INFO L85 PathProgramCache]: Analyzing trace with hash 469939848, now seen corresponding path program 1 times [2025-03-08 21:35:37,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:37,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083435287] [2025-03-08 21:35:37,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:37,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:37,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 848 statements into 1 equivalence classes. [2025-03-08 21:35:37,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 848 of 848 statements. [2025-03-08 21:35:37,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:37,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:37,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:35:37,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:37,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083435287] [2025-03-08 21:35:37,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083435287] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:37,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:37,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:35:37,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833352161] [2025-03-08 21:35:37,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:37,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:35:37,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:37,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:35:37,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:35:37,652 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 980 out of 1015 [2025-03-08 21:35:37,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1000 places, 1000 transitions, 2024 flow. Second operand has 3 states, 3 states have (on average 981.6666666666666) internal successors, (2945), 3 states have internal predecessors, (2945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:37,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:37,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 980 of 1015 [2025-03-08 21:35:37,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:38,587 INFO L124 PetriNetUnfolderBase]: 417/4683 cut-off events. [2025-03-08 21:35:38,588 INFO L125 PetriNetUnfolderBase]: For 83/83 co-relation queries the response was YES. [2025-03-08 21:35:38,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5589 conditions, 4683 events. 417/4683 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 32849 event pairs, 106 based on Foata normal form. 0/4302 useless extension candidates. Maximal degree in co-relation 4573. Up to 580 conditions per place. [2025-03-08 21:35:38,605 INFO L140 encePairwiseOnDemand]: 995/1015 looper letters, 33 selfloop transitions, 14 changer transitions 0/1020 dead transitions. [2025-03-08 21:35:38,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1002 places, 1020 transitions, 2161 flow [2025-03-08 21:35:38,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:35:38,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:35:38,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2993 transitions. [2025-03-08 21:35:38,612 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9829228243021346 [2025-03-08 21:35:38,612 INFO L175 Difference]: Start difference. First operand has 1000 places, 1000 transitions, 2024 flow. Second operand 3 states and 2993 transitions. [2025-03-08 21:35:38,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1002 places, 1020 transitions, 2161 flow [2025-03-08 21:35:38,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1000 places, 1020 transitions, 2155 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:35:38,626 INFO L231 Difference]: Finished difference. Result has 1002 places, 1014 transitions, 2142 flow [2025-03-08 21:35:38,628 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1015, PETRI_DIFFERENCE_MINUEND_FLOW=2018, PETRI_DIFFERENCE_MINUEND_PLACES=998, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1000, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=986, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2142, PETRI_PLACES=1002, PETRI_TRANSITIONS=1014} [2025-03-08 21:35:38,628 INFO L279 CegarLoopForPetriNet]: 1005 programPoint places, -3 predicate places. [2025-03-08 21:35:38,628 INFO L471 AbstractCegarLoop]: Abstraction has has 1002 places, 1014 transitions, 2142 flow [2025-03-08 21:35:38,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 981.6666666666666) internal successors, (2945), 3 states have internal predecessors, (2945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:38,630 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:38,631 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:35:38,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 21:35:38,631 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-08 21:35:38,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:38,634 INFO L85 PathProgramCache]: Analyzing trace with hash -415198203, now seen corresponding path program 1 times [2025-03-08 21:35:38,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:38,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010833631] [2025-03-08 21:35:38,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:38,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:38,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 861 statements into 1 equivalence classes. [2025-03-08 21:35:38,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 861 of 861 statements. [2025-03-08 21:35:38,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:38,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:39,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:35:39,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:39,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010833631] [2025-03-08 21:35:39,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010833631] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:39,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:39,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:35:39,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635104111] [2025-03-08 21:35:39,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:39,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 21:35:39,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:39,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 21:35:39,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:35:39,542 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 985 out of 1015 [2025-03-08 21:35:39,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1002 places, 1014 transitions, 2142 flow. Second operand has 5 states, 5 states have (on average 987.2) internal successors, (4936), 5 states have internal predecessors, (4936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:39,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:39,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 985 of 1015 [2025-03-08 21:35:39,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:41,111 INFO L124 PetriNetUnfolderBase]: 691/7756 cut-off events. [2025-03-08 21:35:41,111 INFO L125 PetriNetUnfolderBase]: For 262/264 co-relation queries the response was YES. [2025-03-08 21:35:41,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9779 conditions, 7756 events. 691/7756 cut-off events. For 262/264 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 70151 event pairs, 263 based on Foata normal form. 17/7141 useless extension candidates. Maximal degree in co-relation 8719. Up to 697 conditions per place. [2025-03-08 21:35:41,139 INFO L140 encePairwiseOnDemand]: 1006/1015 looper letters, 55 selfloop transitions, 13 changer transitions 0/1060 dead transitions. [2025-03-08 21:35:41,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1009 places, 1060 transitions, 2378 flow [2025-03-08 21:35:41,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 21:35:41,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-08 21:35:41,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 7953 transitions. [2025-03-08 21:35:41,150 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9794334975369459 [2025-03-08 21:35:41,150 INFO L175 Difference]: Start difference. First operand has 1002 places, 1014 transitions, 2142 flow. Second operand 8 states and 7953 transitions. [2025-03-08 21:35:41,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1009 places, 1060 transitions, 2378 flow [2025-03-08 21:35:41,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1007 places, 1060 transitions, 2350 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:35:41,170 INFO L231 Difference]: Finished difference. Result has 1013 places, 1025 transitions, 2212 flow [2025-03-08 21:35:41,171 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1015, PETRI_DIFFERENCE_MINUEND_FLOW=2114, PETRI_DIFFERENCE_MINUEND_PLACES=1000, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1014, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1007, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2212, PETRI_PLACES=1013, PETRI_TRANSITIONS=1025} [2025-03-08 21:35:41,172 INFO L279 CegarLoopForPetriNet]: 1005 programPoint places, 8 predicate places. [2025-03-08 21:35:41,172 INFO L471 AbstractCegarLoop]: Abstraction has has 1013 places, 1025 transitions, 2212 flow [2025-03-08 21:35:41,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 987.2) internal successors, (4936), 5 states have internal predecessors, (4936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:41,175 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:41,175 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:35:41,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 21:35:41,176 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-08 21:35:41,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:41,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1600107140, now seen corresponding path program 1 times [2025-03-08 21:35:41,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:41,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287205673] [2025-03-08 21:35:41,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:41,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:41,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 863 statements into 1 equivalence classes. [2025-03-08 21:35:41,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 863 of 863 statements. [2025-03-08 21:35:41,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:41,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:43,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:35:43,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:43,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287205673] [2025-03-08 21:35:43,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287205673] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:43,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:43,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:35:43,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274741501] [2025-03-08 21:35:43,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:43,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:35:43,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:43,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:35:43,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:35:43,736 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 983 out of 1015 [2025-03-08 21:35:43,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1013 places, 1025 transitions, 2212 flow. Second operand has 6 states, 6 states have (on average 984.8333333333334) internal successors, (5909), 6 states have internal predecessors, (5909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:43,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:43,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 983 of 1015 [2025-03-08 21:35:43,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:44,368 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2162] L1014-3-->L1014: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret50#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_22| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_22|) |v_~#m~0.offset_22| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_22|, ~#m~0.offset=|v_~#m~0.offset_22|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_22|, t2Thread1of1ForFork0_#t~ret50#1=|v_t2Thread1of1ForFork0_#t~ret50#1_1|, ~#m~0.offset=|v_~#m~0.offset_22|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret50#1][868], [1011#true, Black: 1027#(= ~top~0 0), Black: 1033#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 1025#true, Black: 1028#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), 125#L1023-1true, 1042#true, Black: 1031#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), Black: 1035#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 382#L1014true, 414#L996-4true, Black: 1015#true, Black: 1020#true]) [2025-03-08 21:35:44,368 INFO L294 olderBase$Statistics]: this new event has 955 ancestors and is cut-off event [2025-03-08 21:35:44,368 INFO L297 olderBase$Statistics]: existing Event has 916 ancestors and is cut-off event [2025-03-08 21:35:44,368 INFO L297 olderBase$Statistics]: existing Event has 934 ancestors and is cut-off event [2025-03-08 21:35:44,368 INFO L297 olderBase$Statistics]: existing Event has 939 ancestors and is cut-off event [2025-03-08 21:35:44,798 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2162] L1014-3-->L1014: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret50#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_22| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_22|) |v_~#m~0.offset_22| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_22|, ~#m~0.offset=|v_~#m~0.offset_22|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_22|, t2Thread1of1ForFork0_#t~ret50#1=|v_t2Thread1of1ForFork0_#t~ret50#1_1|, ~#m~0.offset=|v_~#m~0.offset_22|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret50#1][868], [1011#true, Black: 1027#(= ~top~0 0), Black: 1033#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 1025#true, 1042#true, Black: 1028#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), 125#L1023-1true, Black: 1031#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), Black: 1035#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 382#L1014true, 414#L996-4true, Black: 1017#(= |#race~flag~0| 0), Black: 1020#true]) [2025-03-08 21:35:44,798 INFO L294 olderBase$Statistics]: this new event has 978 ancestors and is cut-off event [2025-03-08 21:35:44,798 INFO L297 olderBase$Statistics]: existing Event has 955 ancestors and is cut-off event [2025-03-08 21:35:44,798 INFO L297 olderBase$Statistics]: existing Event has 979 ancestors and is cut-off event [2025-03-08 21:35:44,798 INFO L297 olderBase$Statistics]: existing Event has 934 ancestors and is cut-off event [2025-03-08 21:35:45,080 INFO L124 PetriNetUnfolderBase]: 918/7715 cut-off events. [2025-03-08 21:35:45,080 INFO L125 PetriNetUnfolderBase]: For 340/350 co-relation queries the response was YES. [2025-03-08 21:35:45,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10586 conditions, 7715 events. 918/7715 cut-off events. For 340/350 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 68213 event pairs, 388 based on Foata normal form. 4/7102 useless extension candidates. Maximal degree in co-relation 9398. Up to 1294 conditions per place. [2025-03-08 21:35:45,107 INFO L140 encePairwiseOnDemand]: 1004/1015 looper letters, 35 selfloop transitions, 22 changer transitions 0/1058 dead transitions. [2025-03-08 21:35:45,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1018 places, 1058 transitions, 2400 flow [2025-03-08 21:35:45,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:35:45,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:35:45,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 5956 transitions. [2025-03-08 21:35:45,115 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9779967159277504 [2025-03-08 21:35:45,115 INFO L175 Difference]: Start difference. First operand has 1013 places, 1025 transitions, 2212 flow. Second operand 6 states and 5956 transitions. [2025-03-08 21:35:45,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1018 places, 1058 transitions, 2400 flow [2025-03-08 21:35:45,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1018 places, 1058 transitions, 2400 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 21:35:45,127 INFO L231 Difference]: Finished difference. Result has 1023 places, 1046 transitions, 2362 flow [2025-03-08 21:35:45,128 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1015, PETRI_DIFFERENCE_MINUEND_FLOW=2212, PETRI_DIFFERENCE_MINUEND_PLACES=1013, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1025, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1015, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2362, PETRI_PLACES=1023, PETRI_TRANSITIONS=1046} [2025-03-08 21:35:45,129 INFO L279 CegarLoopForPetriNet]: 1005 programPoint places, 18 predicate places. [2025-03-08 21:35:45,129 INFO L471 AbstractCegarLoop]: Abstraction has has 1023 places, 1046 transitions, 2362 flow [2025-03-08 21:35:45,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 984.8333333333334) internal successors, (5909), 6 states have internal predecessors, (5909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:45,131 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:45,132 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:35:45,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 21:35:45,132 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-08 21:35:45,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:45,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1863001093, now seen corresponding path program 1 times [2025-03-08 21:35:45,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:45,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867390056] [2025-03-08 21:35:45,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:45,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:45,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 873 statements into 1 equivalence classes. [2025-03-08 21:35:45,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 873 of 873 statements. [2025-03-08 21:35:45,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:45,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:45,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:35:45,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:45,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867390056] [2025-03-08 21:35:45,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867390056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:45,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:45,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:35:45,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863830486] [2025-03-08 21:35:45,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:45,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:35:45,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:45,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:35:45,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:35:45,356 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 986 out of 1015 [2025-03-08 21:35:45,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1023 places, 1046 transitions, 2362 flow. Second operand has 3 states, 3 states have (on average 989.0) internal successors, (2967), 3 states have internal predecessors, (2967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:45,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:45,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 986 of 1015 [2025-03-08 21:35:45,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:46,797 INFO L124 PetriNetUnfolderBase]: 822/7769 cut-off events. [2025-03-08 21:35:46,797 INFO L125 PetriNetUnfolderBase]: For 815/894 co-relation queries the response was YES. [2025-03-08 21:35:46,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11259 conditions, 7769 events. 822/7769 cut-off events. For 815/894 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 67535 event pairs, 300 based on Foata normal form. 16/7218 useless extension candidates. Maximal degree in co-relation 10109. Up to 1129 conditions per place. [2025-03-08 21:35:46,836 INFO L140 encePairwiseOnDemand]: 1007/1015 looper letters, 30 selfloop transitions, 11 changer transitions 0/1058 dead transitions. [2025-03-08 21:35:46,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1025 places, 1058 transitions, 2484 flow [2025-03-08 21:35:46,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:35:46,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:35:46,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2989 transitions. [2025-03-08 21:35:46,840 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9816091954022989 [2025-03-08 21:35:46,840 INFO L175 Difference]: Start difference. First operand has 1023 places, 1046 transitions, 2362 flow. Second operand 3 states and 2989 transitions. [2025-03-08 21:35:46,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1025 places, 1058 transitions, 2484 flow [2025-03-08 21:35:46,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1025 places, 1058 transitions, 2484 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 21:35:46,855 INFO L231 Difference]: Finished difference. Result has 1027 places, 1055 transitions, 2458 flow [2025-03-08 21:35:46,857 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1015, PETRI_DIFFERENCE_MINUEND_FLOW=2362, PETRI_DIFFERENCE_MINUEND_PLACES=1023, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1046, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1035, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2458, PETRI_PLACES=1027, PETRI_TRANSITIONS=1055} [2025-03-08 21:35:46,857 INFO L279 CegarLoopForPetriNet]: 1005 programPoint places, 22 predicate places. [2025-03-08 21:35:46,857 INFO L471 AbstractCegarLoop]: Abstraction has has 1027 places, 1055 transitions, 2458 flow [2025-03-08 21:35:46,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 989.0) internal successors, (2967), 3 states have internal predecessors, (2967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:46,859 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:46,859 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:35:46,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 21:35:46,860 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-08 21:35:46,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:46,862 INFO L85 PathProgramCache]: Analyzing trace with hash -919884939, now seen corresponding path program 1 times [2025-03-08 21:35:46,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:46,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399763516] [2025-03-08 21:35:46,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:46,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:46,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 887 statements into 1 equivalence classes. [2025-03-08 21:35:46,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 887 of 887 statements. [2025-03-08 21:35:46,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:46,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:47,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:35:47,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:47,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399763516] [2025-03-08 21:35:47,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399763516] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:47,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:47,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:35:47,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768012162] [2025-03-08 21:35:47,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:47,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:35:47,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:47,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:35:47,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:35:47,043 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 994 out of 1015 [2025-03-08 21:35:47,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1027 places, 1055 transitions, 2458 flow. Second operand has 3 states, 3 states have (on average 995.6666666666666) internal successors, (2987), 3 states have internal predecessors, (2987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:47,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:47,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 994 of 1015 [2025-03-08 21:35:47,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:47,987 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2162] L1014-3-->L1014: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret50#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_22| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_22|) |v_~#m~0.offset_22| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_22|, ~#m~0.offset=|v_~#m~0.offset_22|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_22|, t2Thread1of1ForFork0_#t~ret50#1=|v_t2Thread1of1ForFork0_#t~ret50#1_1|, ~#m~0.offset=|v_~#m~0.offset_22|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret50#1][868], [Black: 1055#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 1011#true, 1058#true, Black: 1027#(= ~top~0 0), 1025#true, Black: 1033#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 1042#true, 125#L1023-1true, 676#L998-2true, Black: 1028#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), Black: 1031#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), Black: 1035#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 1053#true, 382#L1014true, Black: 1044#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), Black: 1047#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 3)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 1045#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 1015#true, Black: 1046#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 1020#true]) [2025-03-08 21:35:47,988 INFO L294 olderBase$Statistics]: this new event has 961 ancestors and is cut-off event [2025-03-08 21:35:47,988 INFO L297 olderBase$Statistics]: existing Event has 940 ancestors and is cut-off event [2025-03-08 21:35:47,988 INFO L297 olderBase$Statistics]: existing Event has 922 ancestors and is cut-off event [2025-03-08 21:35:47,988 INFO L297 olderBase$Statistics]: existing Event has 922 ancestors and is cut-off event [2025-03-08 21:35:48,419 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([2162] L1014-3-->L1014: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret50#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_22| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_22|) |v_~#m~0.offset_22| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_22|, ~#m~0.offset=|v_~#m~0.offset_22|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_22|, t2Thread1of1ForFork0_#t~ret50#1=|v_t2Thread1of1ForFork0_#t~ret50#1_1|, ~#m~0.offset=|v_~#m~0.offset_22|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret50#1][868], [Black: 1055#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 1011#true, 1058#true, Black: 1027#(= ~top~0 0), 1025#true, Black: 1033#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 1042#true, 125#L1023-1true, 676#L998-2true, Black: 1028#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), Black: 1031#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), Black: 1035#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 1053#true, 382#L1014true, Black: 1044#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), Black: 1047#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 3)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 1045#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 1015#true, Black: 1046#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 1020#true]) [2025-03-08 21:35:48,420 INFO L294 olderBase$Statistics]: this new event has 984 ancestors and is cut-off event [2025-03-08 21:35:48,420 INFO L297 olderBase$Statistics]: existing Event has 940 ancestors and is cut-off event [2025-03-08 21:35:48,420 INFO L297 olderBase$Statistics]: existing Event has 922 ancestors and is cut-off event [2025-03-08 21:35:48,420 INFO L297 olderBase$Statistics]: existing Event has 922 ancestors and is cut-off event [2025-03-08 21:35:48,420 INFO L297 olderBase$Statistics]: existing Event has 961 ancestors and is cut-off event [2025-03-08 21:35:48,420 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2162] L1014-3-->L1014: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret50#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_22| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_22|) |v_~#m~0.offset_22| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_22|, ~#m~0.offset=|v_~#m~0.offset_22|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_22|, t2Thread1of1ForFork0_#t~ret50#1=|v_t2Thread1of1ForFork0_#t~ret50#1_1|, ~#m~0.offset=|v_~#m~0.offset_22|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret50#1][868], [Black: 1055#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 1011#true, 1058#true, 80#L999true, Black: 1027#(= ~top~0 0), 1025#true, Black: 1033#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 1042#true, 125#L1023-1true, Black: 1028#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), Black: 1031#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), Black: 1035#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 1053#true, 382#L1014true, Black: 1044#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), Black: 1047#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 3)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 1045#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 1046#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 1017#(= |#race~flag~0| 0), Black: 1020#true]) [2025-03-08 21:35:48,420 INFO L294 olderBase$Statistics]: this new event has 988 ancestors and is cut-off event [2025-03-08 21:35:48,420 INFO L297 olderBase$Statistics]: existing Event has 926 ancestors and is cut-off event [2025-03-08 21:35:48,420 INFO L297 olderBase$Statistics]: existing Event has 926 ancestors and is cut-off event [2025-03-08 21:35:48,420 INFO L297 olderBase$Statistics]: existing Event has 965 ancestors and is cut-off event [2025-03-08 21:35:48,420 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2162] L1014-3-->L1014: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret50#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_22| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_22|) |v_~#m~0.offset_22| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_22|, ~#m~0.offset=|v_~#m~0.offset_22|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_22|, t2Thread1of1ForFork0_#t~ret50#1=|v_t2Thread1of1ForFork0_#t~ret50#1_1|, ~#m~0.offset=|v_~#m~0.offset_22|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret50#1][868], [Black: 1055#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 1011#true, 1058#true, Black: 1027#(= ~top~0 0), 1025#true, Black: 1033#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 1042#true, 125#L1023-1true, Black: 1028#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), Black: 1031#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), Black: 1035#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 1053#true, 382#L1014true, 195#L999-3true, Black: 1044#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), Black: 1047#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 3)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 1045#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 1046#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 1017#(= |#race~flag~0| 0), Black: 1020#true]) [2025-03-08 21:35:48,421 INFO L294 olderBase$Statistics]: this new event has 987 ancestors and is cut-off event [2025-03-08 21:35:48,421 INFO L297 olderBase$Statistics]: existing Event has 925 ancestors and is cut-off event [2025-03-08 21:35:48,421 INFO L297 olderBase$Statistics]: existing Event has 925 ancestors and is cut-off event [2025-03-08 21:35:48,421 INFO L297 olderBase$Statistics]: existing Event has 964 ancestors and is cut-off event [2025-03-08 21:35:48,421 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2162] L1014-3-->L1014: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret50#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_22| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_22|) |v_~#m~0.offset_22| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_22|, ~#m~0.offset=|v_~#m~0.offset_22|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_22|, t2Thread1of1ForFork0_#t~ret50#1=|v_t2Thread1of1ForFork0_#t~ret50#1_1|, ~#m~0.offset=|v_~#m~0.offset_22|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret50#1][988], [Black: 1055#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 1011#true, Black: 1027#(= ~top~0 0), 1025#true, Black: 1033#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 1042#true, 125#L1023-1true, Black: 1028#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), Black: 1031#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), Black: 1035#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 794#L998-1true, 1053#true, 382#L1014true, Black: 1044#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), Black: 1047#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 3)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 1045#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 1046#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 1017#(= |#race~flag~0| 0), 1060#(= |#race~flag~0| |t1Thread1of1ForFork1_#t~nondet45#1|), Black: 1020#true]) [2025-03-08 21:35:48,421 INFO L294 olderBase$Statistics]: this new event has 986 ancestors and is cut-off event [2025-03-08 21:35:48,421 INFO L297 olderBase$Statistics]: existing Event has 963 ancestors and is cut-off event [2025-03-08 21:35:48,421 INFO L297 olderBase$Statistics]: existing Event has 924 ancestors and is cut-off event [2025-03-08 21:35:48,421 INFO L297 olderBase$Statistics]: existing Event has 924 ancestors and is cut-off event [2025-03-08 21:35:48,421 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2162] L1014-3-->L1014: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret50#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_22| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_22|) |v_~#m~0.offset_22| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_22|, ~#m~0.offset=|v_~#m~0.offset_22|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_22|, t2Thread1of1ForFork0_#t~ret50#1=|v_t2Thread1of1ForFork0_#t~ret50#1_1|, ~#m~0.offset=|v_~#m~0.offset_22|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret50#1][988], [Black: 1055#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 1011#true, Black: 1027#(= ~top~0 0), 1025#true, Black: 1033#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 1042#true, 125#L1023-1true, Black: 1028#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), Black: 1031#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), Black: 1035#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 1053#true, 382#L1014true, 845#L998true, Black: 1044#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), Black: 1047#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 3)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 1045#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 1046#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 1017#(= |#race~flag~0| 0), 1060#(= |#race~flag~0| |t1Thread1of1ForFork1_#t~nondet45#1|), Black: 1020#true]) [2025-03-08 21:35:48,421 INFO L294 olderBase$Statistics]: this new event has 985 ancestors and is cut-off event [2025-03-08 21:35:48,421 INFO L297 olderBase$Statistics]: existing Event has 962 ancestors and is cut-off event [2025-03-08 21:35:48,421 INFO L297 olderBase$Statistics]: existing Event has 923 ancestors and is cut-off event [2025-03-08 21:35:48,421 INFO L297 olderBase$Statistics]: existing Event has 923 ancestors and is cut-off event [2025-03-08 21:35:48,423 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2162] L1014-3-->L1014: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret50#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_22| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_22|) |v_~#m~0.offset_22| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_22|, ~#m~0.offset=|v_~#m~0.offset_22|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_22|, t2Thread1of1ForFork0_#t~ret50#1=|v_t2Thread1of1ForFork0_#t~ret50#1_1|, ~#m~0.offset=|v_~#m~0.offset_22|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret50#1][868], [Black: 1055#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 1011#true, 1058#true, 110#L993true, Black: 1027#(= ~top~0 0), Black: 1033#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 1025#true, 1042#true, 125#L1023-1true, Black: 1028#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), Black: 1031#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), Black: 1035#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 382#L1014true, 1053#true, Black: 1044#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), Black: 1047#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 3)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 1045#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 1017#(= |#race~flag~0| 0), Black: 1046#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 1020#true]) [2025-03-08 21:35:48,423 INFO L294 olderBase$Statistics]: this new event has 994 ancestors and is cut-off event [2025-03-08 21:35:48,423 INFO L297 olderBase$Statistics]: existing Event has 971 ancestors and is cut-off event [2025-03-08 21:35:48,423 INFO L297 olderBase$Statistics]: existing Event has 932 ancestors and is cut-off event [2025-03-08 21:35:48,423 INFO L297 olderBase$Statistics]: existing Event has 932 ancestors and is cut-off event [2025-03-08 21:35:48,423 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([2162] L1014-3-->L1014: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret50#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_22| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_22|) |v_~#m~0.offset_22| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_22|, ~#m~0.offset=|v_~#m~0.offset_22|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_22|, t2Thread1of1ForFork0_#t~ret50#1=|v_t2Thread1of1ForFork0_#t~ret50#1_1|, ~#m~0.offset=|v_~#m~0.offset_22|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret50#1][868], [Black: 1055#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 1011#true, 1058#true, Black: 1027#(= ~top~0 0), Black: 1033#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 1025#true, 1042#true, 125#L1023-1true, Black: 1028#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), Black: 1031#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), Black: 1035#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 382#L1014true, 1053#true, 195#L999-3true, Black: 1044#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), Black: 1047#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 3)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 1045#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 1017#(= |#race~flag~0| 0), Black: 1046#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 1020#true]) [2025-03-08 21:35:48,423 INFO L294 olderBase$Statistics]: this new event has 987 ancestors and is cut-off event [2025-03-08 21:35:48,423 INFO L297 olderBase$Statistics]: existing Event has 925 ancestors and is cut-off event [2025-03-08 21:35:48,423 INFO L297 olderBase$Statistics]: existing Event has 925 ancestors and is cut-off event [2025-03-08 21:35:48,423 INFO L297 olderBase$Statistics]: existing Event has 987 ancestors and is cut-off event [2025-03-08 21:35:48,423 INFO L297 olderBase$Statistics]: existing Event has 964 ancestors and is cut-off event [2025-03-08 21:35:48,424 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([2162] L1014-3-->L1014: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret50#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_22| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_22|) |v_~#m~0.offset_22| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_22|, ~#m~0.offset=|v_~#m~0.offset_22|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_22|, t2Thread1of1ForFork0_#t~ret50#1=|v_t2Thread1of1ForFork0_#t~ret50#1_1|, ~#m~0.offset=|v_~#m~0.offset_22|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret50#1][868], [Black: 1055#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 1011#true, 1058#true, 80#L999true, Black: 1027#(= ~top~0 0), Black: 1033#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 1025#true, 1042#true, 125#L1023-1true, Black: 1028#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), Black: 1031#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), Black: 1035#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 382#L1014true, 1053#true, Black: 1044#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), Black: 1047#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 3)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 1045#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 1017#(= |#race~flag~0| 0), Black: 1046#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 1020#true]) [2025-03-08 21:35:48,424 INFO L294 olderBase$Statistics]: this new event has 988 ancestors and is cut-off event [2025-03-08 21:35:48,424 INFO L297 olderBase$Statistics]: existing Event has 926 ancestors and is cut-off event [2025-03-08 21:35:48,424 INFO L297 olderBase$Statistics]: existing Event has 988 ancestors and is cut-off event [2025-03-08 21:35:48,424 INFO L297 olderBase$Statistics]: existing Event has 926 ancestors and is cut-off event [2025-03-08 21:35:48,424 INFO L297 olderBase$Statistics]: existing Event has 965 ancestors and is cut-off event [2025-03-08 21:35:48,424 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([2162] L1014-3-->L1014: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret50#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_22| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_22|) |v_~#m~0.offset_22| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_22|, ~#m~0.offset=|v_~#m~0.offset_22|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_22|, t2Thread1of1ForFork0_#t~ret50#1=|v_t2Thread1of1ForFork0_#t~ret50#1_1|, ~#m~0.offset=|v_~#m~0.offset_22|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret50#1][988], [Black: 1055#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 1011#true, Black: 1027#(= ~top~0 0), Black: 1033#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 1025#true, 1042#true, 125#L1023-1true, Black: 1028#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), Black: 1031#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), Black: 1035#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 382#L1014true, 1053#true, 845#L998true, Black: 1044#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), Black: 1047#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 3)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 1045#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 1017#(= |#race~flag~0| 0), Black: 1046#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 1020#true, 1060#(= |#race~flag~0| |t1Thread1of1ForFork1_#t~nondet45#1|)]) [2025-03-08 21:35:48,424 INFO L294 olderBase$Statistics]: this new event has 985 ancestors and is cut-off event [2025-03-08 21:35:48,424 INFO L297 olderBase$Statistics]: existing Event has 962 ancestors and is cut-off event [2025-03-08 21:35:48,424 INFO L297 olderBase$Statistics]: existing Event has 923 ancestors and is cut-off event [2025-03-08 21:35:48,424 INFO L297 olderBase$Statistics]: existing Event has 923 ancestors and is cut-off event [2025-03-08 21:35:48,424 INFO L297 olderBase$Statistics]: existing Event has 985 ancestors and is cut-off event [2025-03-08 21:35:48,425 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([2162] L1014-3-->L1014: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret50#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_22| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_22|) |v_~#m~0.offset_22| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_22|, ~#m~0.offset=|v_~#m~0.offset_22|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_22|, t2Thread1of1ForFork0_#t~ret50#1=|v_t2Thread1of1ForFork0_#t~ret50#1_1|, ~#m~0.offset=|v_~#m~0.offset_22|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret50#1][988], [Black: 1055#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 1011#true, Black: 1027#(= ~top~0 0), Black: 1033#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 1025#true, 1042#true, 125#L1023-1true, Black: 1028#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), Black: 1031#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), Black: 1035#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 794#L998-1true, 382#L1014true, 1053#true, Black: 1044#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), Black: 1047#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 3)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 1045#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 1017#(= |#race~flag~0| 0), Black: 1046#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 1020#true, 1060#(= |#race~flag~0| |t1Thread1of1ForFork1_#t~nondet45#1|)]) [2025-03-08 21:35:48,425 INFO L294 olderBase$Statistics]: this new event has 986 ancestors and is cut-off event [2025-03-08 21:35:48,425 INFO L297 olderBase$Statistics]: existing Event has 963 ancestors and is cut-off event [2025-03-08 21:35:48,425 INFO L297 olderBase$Statistics]: existing Event has 924 ancestors and is cut-off event [2025-03-08 21:35:48,425 INFO L297 olderBase$Statistics]: existing Event has 986 ancestors and is cut-off event [2025-03-08 21:35:48,425 INFO L297 olderBase$Statistics]: existing Event has 924 ancestors and is cut-off event [2025-03-08 21:35:48,432 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2162] L1014-3-->L1014: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret50#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_22| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_22|) |v_~#m~0.offset_22| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_22|, ~#m~0.offset=|v_~#m~0.offset_22|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_22|, t2Thread1of1ForFork0_#t~ret50#1=|v_t2Thread1of1ForFork0_#t~ret50#1_1|, ~#m~0.offset=|v_~#m~0.offset_22|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret50#1][868], [Black: 1055#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 1011#true, 1058#true, Black: 1027#(= ~top~0 0), 1025#true, Black: 1033#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 125#L1023-1true, 1042#true, 676#L998-2true, Black: 1028#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), Black: 1031#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), Black: 1035#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 1053#true, 382#L1014true, Black: 1044#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), Black: 1047#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 3)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 1045#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 1017#(= |#race~flag~0| 0), Black: 1046#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 1020#true]) [2025-03-08 21:35:48,432 INFO L294 olderBase$Statistics]: this new event has 985 ancestors and is cut-off event [2025-03-08 21:35:48,432 INFO L297 olderBase$Statistics]: existing Event has 961 ancestors and is cut-off event [2025-03-08 21:35:48,432 INFO L297 olderBase$Statistics]: existing Event has 940 ancestors and is cut-off event [2025-03-08 21:35:48,432 INFO L297 olderBase$Statistics]: existing Event has 984 ancestors and is cut-off event [2025-03-08 21:35:48,436 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2162] L1014-3-->L1014: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret50#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_22| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_22|) |v_~#m~0.offset_22| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_22|, ~#m~0.offset=|v_~#m~0.offset_22|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_22|, t2Thread1of1ForFork0_#t~ret50#1=|v_t2Thread1of1ForFork0_#t~ret50#1_1|, ~#m~0.offset=|v_~#m~0.offset_22|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret50#1][868], [Black: 1055#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 1011#true, 1058#true, Black: 1027#(= ~top~0 0), Black: 1033#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 1025#true, 1042#true, Black: 1028#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), Black: 1031#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), Black: 1035#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 382#L1014true, 1053#true, Black: 1044#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), Black: 1047#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 3)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 1045#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 1017#(= |#race~flag~0| 0), Black: 1046#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), 379#L1025true, Black: 1020#true]) [2025-03-08 21:35:48,436 INFO L294 olderBase$Statistics]: this new event has 998 ancestors and is cut-off event [2025-03-08 21:35:48,436 INFO L297 olderBase$Statistics]: existing Event has 936 ancestors and is cut-off event [2025-03-08 21:35:48,436 INFO L297 olderBase$Statistics]: existing Event has 975 ancestors and is cut-off event [2025-03-08 21:35:48,436 INFO L297 olderBase$Statistics]: existing Event has 936 ancestors and is cut-off event [2025-03-08 21:35:48,493 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([2162] L1014-3-->L1014: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret50#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_22| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_22|) |v_~#m~0.offset_22| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_22|, ~#m~0.offset=|v_~#m~0.offset_22|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_22|, t2Thread1of1ForFork0_#t~ret50#1=|v_t2Thread1of1ForFork0_#t~ret50#1_1|, ~#m~0.offset=|v_~#m~0.offset_22|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret50#1][868], [Black: 1055#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 1011#true, 1058#true, 110#L993true, Black: 1027#(= ~top~0 0), 1025#true, Black: 1033#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 1042#true, 125#L1023-1true, Black: 1028#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), Black: 1031#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), Black: 1035#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 1053#true, 382#L1014true, Black: 1044#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), Black: 1047#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 3)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 1045#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 1046#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 1017#(= |#race~flag~0| 0), Black: 1020#true]) [2025-03-08 21:35:48,493 INFO L294 olderBase$Statistics]: this new event has 994 ancestors and is cut-off event [2025-03-08 21:35:48,493 INFO L297 olderBase$Statistics]: existing Event has 971 ancestors and is cut-off event [2025-03-08 21:35:48,493 INFO L297 olderBase$Statistics]: existing Event has 932 ancestors and is cut-off event [2025-03-08 21:35:48,493 INFO L297 olderBase$Statistics]: existing Event has 932 ancestors and is cut-off event [2025-03-08 21:35:48,493 INFO L297 olderBase$Statistics]: existing Event has 994 ancestors and is cut-off event [2025-03-08 21:35:48,502 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([2162] L1014-3-->L1014: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret50#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_22| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_22|) |v_~#m~0.offset_22| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_22|, ~#m~0.offset=|v_~#m~0.offset_22|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_22|, t2Thread1of1ForFork0_#t~ret50#1=|v_t2Thread1of1ForFork0_#t~ret50#1_1|, ~#m~0.offset=|v_~#m~0.offset_22|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret50#1][868], [Black: 1055#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 1011#true, 1058#true, Black: 1027#(= ~top~0 0), 1025#true, Black: 1033#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 125#L1023-1true, 676#L998-2true, 1042#true, Black: 1028#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), Black: 1031#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), Black: 1035#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 1053#true, 382#L1014true, Black: 1044#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), Black: 1047#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 3)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 1045#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 1046#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 1017#(= |#race~flag~0| 0), Black: 1020#true]) [2025-03-08 21:35:48,502 INFO L294 olderBase$Statistics]: this new event has 985 ancestors and is cut-off event [2025-03-08 21:35:48,502 INFO L297 olderBase$Statistics]: existing Event has 961 ancestors and is cut-off event [2025-03-08 21:35:48,502 INFO L297 olderBase$Statistics]: existing Event has 985 ancestors and is cut-off event [2025-03-08 21:35:48,502 INFO L297 olderBase$Statistics]: existing Event has 940 ancestors and is cut-off event [2025-03-08 21:35:48,502 INFO L297 olderBase$Statistics]: existing Event has 984 ancestors and is cut-off event [2025-03-08 21:35:48,585 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([2162] L1014-3-->L1014: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret50#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_22| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_22|) |v_~#m~0.offset_22| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_22|, ~#m~0.offset=|v_~#m~0.offset_22|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_22|, t2Thread1of1ForFork0_#t~ret50#1=|v_t2Thread1of1ForFork0_#t~ret50#1_1|, ~#m~0.offset=|v_~#m~0.offset_22|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret50#1][868], [Black: 1055#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 1011#true, 1058#true, Black: 1027#(= ~top~0 0), 1025#true, Black: 1033#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 1042#true, Black: 1028#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), Black: 1031#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), Black: 1035#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 1053#true, 382#L1014true, Black: 1044#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), Black: 1047#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 3)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 1045#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 1046#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 1017#(= |#race~flag~0| 0), 379#L1025true, Black: 1020#true]) [2025-03-08 21:35:48,585 INFO L294 olderBase$Statistics]: this new event has 998 ancestors and is cut-off event [2025-03-08 21:35:48,585 INFO L297 olderBase$Statistics]: existing Event has 998 ancestors and is cut-off event [2025-03-08 21:35:48,585 INFO L297 olderBase$Statistics]: existing Event has 936 ancestors and is cut-off event [2025-03-08 21:35:48,585 INFO L297 olderBase$Statistics]: existing Event has 975 ancestors and is cut-off event [2025-03-08 21:35:48,585 INFO L297 olderBase$Statistics]: existing Event has 936 ancestors and is cut-off event [2025-03-08 21:35:48,673 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2082] L961-2-->L961-1: Formula: (= |v_#race~top~0_12| 0) InVars {} OutVars{#race~top~0=|v_#race~top~0_12|} AuxVars[] AssignedVars[#race~top~0][911], [Black: 1055#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 1011#true, 1058#true, Black: 1027#(= ~top~0 0), Black: 1033#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 1025#true, 125#L1023-1true, 1042#true, Black: 1028#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), Black: 1031#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), Black: 1035#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 440#L961-1true, 1053#true, 823#L953-2true, Black: 1044#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), Black: 1047#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 3)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 1045#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 1017#(= |#race~flag~0| 0), Black: 1046#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 1020#true]) [2025-03-08 21:35:48,674 INFO L294 olderBase$Statistics]: this new event has 991 ancestors and is cut-off event [2025-03-08 21:35:48,674 INFO L297 olderBase$Statistics]: existing Event has 991 ancestors and is cut-off event [2025-03-08 21:35:48,674 INFO L297 olderBase$Statistics]: existing Event has 952 ancestors and is cut-off event [2025-03-08 21:35:48,674 INFO L297 olderBase$Statistics]: existing Event has 952 ancestors and is cut-off event [2025-03-08 21:35:48,756 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2082] L961-2-->L961-1: Formula: (= |v_#race~top~0_12| 0) InVars {} OutVars{#race~top~0=|v_#race~top~0_12|} AuxVars[] AssignedVars[#race~top~0][911], [Black: 1055#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 1011#true, 1058#true, Black: 1027#(= ~top~0 0), 1025#true, Black: 1033#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 1042#true, 125#L1023-1true, Black: 1028#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), Black: 1031#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), Black: 1035#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 440#L961-1true, 1053#true, Black: 1044#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), Black: 1047#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 3)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 1045#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 1046#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 1017#(= |#race~flag~0| 0), 264#L953-1true, Black: 1020#true]) [2025-03-08 21:35:48,756 INFO L294 olderBase$Statistics]: this new event has 990 ancestors and is cut-off event [2025-03-08 21:35:48,757 INFO L297 olderBase$Statistics]: existing Event has 951 ancestors and is cut-off event [2025-03-08 21:35:48,757 INFO L297 olderBase$Statistics]: existing Event has 990 ancestors and is cut-off event [2025-03-08 21:35:48,757 INFO L297 olderBase$Statistics]: existing Event has 990 ancestors and is cut-off event [2025-03-08 21:35:48,757 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([2082] L961-2-->L961-1: Formula: (= |v_#race~top~0_12| 0) InVars {} OutVars{#race~top~0=|v_#race~top~0_12|} AuxVars[] AssignedVars[#race~top~0][911], [Black: 1055#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 1011#true, 1058#true, Black: 1027#(= ~top~0 0), 1025#true, Black: 1033#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 1042#true, 125#L1023-1true, Black: 1028#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), Black: 1031#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), Black: 1035#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), 440#L961-1true, 1053#true, 823#L953-2true, Black: 1044#(= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|), Black: 1047#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 3)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 1045#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 1046#(and (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 2)) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4))) |t1Thread1of1ForFork1_push_#t~nondet37#1|) (= (select (select |#race| |t1Thread1of1ForFork1_push_~stack#1.base|) (+ |t1Thread1of1ForFork1_push_~stack#1.offset| (* |t1Thread1of1ForFork1_push_#t~ret36#1| 4) 1)) |t1Thread1of1ForFork1_push_#t~nondet37#1|)), Black: 1017#(= |#race~flag~0| 0), Black: 1020#true]) [2025-03-08 21:35:48,757 INFO L294 olderBase$Statistics]: this new event has 991 ancestors and is cut-off event [2025-03-08 21:35:48,757 INFO L297 olderBase$Statistics]: existing Event has 991 ancestors and is cut-off event [2025-03-08 21:35:48,757 INFO L297 olderBase$Statistics]: existing Event has 952 ancestors and is cut-off event [2025-03-08 21:35:48,757 INFO L297 olderBase$Statistics]: existing Event has 991 ancestors and is cut-off event [2025-03-08 21:35:48,757 INFO L297 olderBase$Statistics]: existing Event has 952 ancestors and is cut-off event [2025-03-08 21:35:48,867 INFO L124 PetriNetUnfolderBase]: 814/8079 cut-off events. [2025-03-08 21:35:48,867 INFO L125 PetriNetUnfolderBase]: For 996/1024 co-relation queries the response was YES. [2025-03-08 21:35:48,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11861 conditions, 8079 events. 814/8079 cut-off events. For 996/1024 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 71037 event pairs, 220 based on Foata normal form. 11/7552 useless extension candidates. Maximal degree in co-relation 10732. Up to 684 conditions per place. [2025-03-08 21:35:48,917 INFO L140 encePairwiseOnDemand]: 1010/1015 looper letters, 16 selfloop transitions, 6 changer transitions 0/1062 dead transitions. [2025-03-08 21:35:48,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1029 places, 1062 transitions, 2522 flow [2025-03-08 21:35:48,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:35:48,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:35:48,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3002 transitions. [2025-03-08 21:35:48,922 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9858784893267651 [2025-03-08 21:35:48,922 INFO L175 Difference]: Start difference. First operand has 1027 places, 1055 transitions, 2458 flow. Second operand 3 states and 3002 transitions. [2025-03-08 21:35:48,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1029 places, 1062 transitions, 2522 flow [2025-03-08 21:35:48,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1027 places, 1062 transitions, 2500 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:35:48,942 INFO L231 Difference]: Finished difference. Result has 1029 places, 1059 transitions, 2482 flow [2025-03-08 21:35:48,943 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1015, PETRI_DIFFERENCE_MINUEND_FLOW=2436, PETRI_DIFFERENCE_MINUEND_PLACES=1025, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1055, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1049, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2482, PETRI_PLACES=1029, PETRI_TRANSITIONS=1059} [2025-03-08 21:35:48,944 INFO L279 CegarLoopForPetriNet]: 1005 programPoint places, 24 predicate places. [2025-03-08 21:35:48,944 INFO L471 AbstractCegarLoop]: Abstraction has has 1029 places, 1059 transitions, 2482 flow [2025-03-08 21:35:48,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 995.6666666666666) internal successors, (2987), 3 states have internal predecessors, (2987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:48,945 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:48,946 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:35:48,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 21:35:48,946 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-08 21:35:48,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:48,948 INFO L85 PathProgramCache]: Analyzing trace with hash 2102108796, now seen corresponding path program 1 times [2025-03-08 21:35:48,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:48,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004323345] [2025-03-08 21:35:48,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:48,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:48,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 894 statements into 1 equivalence classes. [2025-03-08 21:35:49,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 894 of 894 statements. [2025-03-08 21:35:49,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:49,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:49,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:35:49,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:49,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004323345] [2025-03-08 21:35:49,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004323345] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:49,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:49,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 21:35:49,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850416763] [2025-03-08 21:35:49,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:49,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:35:49,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:49,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:35:49,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:35:49,420 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 998 out of 1015 [2025-03-08 21:35:49,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1029 places, 1059 transitions, 2482 flow. Second operand has 3 states, 3 states have (on average 1000.0) internal successors, (3000), 3 states have internal predecessors, (3000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:49,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:49,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 998 of 1015 [2025-03-08 21:35:49,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:49,678 INFO L124 PetriNetUnfolderBase]: 64/2098 cut-off events. [2025-03-08 21:35:49,679 INFO L125 PetriNetUnfolderBase]: For 171/171 co-relation queries the response was YES. [2025-03-08 21:35:49,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2682 conditions, 2098 events. 64/2098 cut-off events. For 171/171 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 6965 event pairs, 9 based on Foata normal form. 24/2054 useless extension candidates. Maximal degree in co-relation 2576. Up to 86 conditions per place. [2025-03-08 21:35:49,686 INFO L140 encePairwiseOnDemand]: 1011/1015 looper letters, 7 selfloop transitions, 4 changer transitions 0/1001 dead transitions. [2025-03-08 21:35:49,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1020 places, 1001 transitions, 2201 flow [2025-03-08 21:35:49,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:35:49,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:35:49,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3007 transitions. [2025-03-08 21:35:49,689 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9875205254515599 [2025-03-08 21:35:49,689 INFO L175 Difference]: Start difference. First operand has 1029 places, 1059 transitions, 2482 flow. Second operand 3 states and 3007 transitions. [2025-03-08 21:35:49,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1020 places, 1001 transitions, 2201 flow [2025-03-08 21:35:49,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1003 places, 1001 transitions, 2111 flow, removed 27 selfloop flow, removed 17 redundant places. [2025-03-08 21:35:49,701 INFO L231 Difference]: Finished difference. Result has 1003 places, 999 transitions, 2090 flow [2025-03-08 21:35:49,702 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1015, PETRI_DIFFERENCE_MINUEND_FLOW=2082, PETRI_DIFFERENCE_MINUEND_PLACES=1001, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=999, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=995, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2090, PETRI_PLACES=1003, PETRI_TRANSITIONS=999} [2025-03-08 21:35:49,704 INFO L279 CegarLoopForPetriNet]: 1005 programPoint places, -2 predicate places. [2025-03-08 21:35:49,704 INFO L471 AbstractCegarLoop]: Abstraction has has 1003 places, 999 transitions, 2090 flow [2025-03-08 21:35:49,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1000.0) internal successors, (3000), 3 states have internal predecessors, (3000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:49,706 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:49,706 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:35:49,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 21:35:49,706 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-08 21:35:49,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:49,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1574843048, now seen corresponding path program 1 times [2025-03-08 21:35:49,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:49,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155673988] [2025-03-08 21:35:49,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:49,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:49,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 924 statements into 1 equivalence classes. [2025-03-08 21:35:49,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 924 of 924 statements. [2025-03-08 21:35:49,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:49,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:49,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:35:49,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:49,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155673988] [2025-03-08 21:35:49,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155673988] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:49,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:49,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:35:49,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520094020] [2025-03-08 21:35:49,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:49,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:35:49,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:49,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:35:49,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:35:49,908 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 986 out of 1015 [2025-03-08 21:35:49,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1003 places, 999 transitions, 2090 flow. Second operand has 3 states, 3 states have (on average 991.0) internal successors, (2973), 3 states have internal predecessors, (2973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:49,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:49,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 986 of 1015 [2025-03-08 21:35:49,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:50,186 INFO L124 PetriNetUnfolderBase]: 79/2072 cut-off events. [2025-03-08 21:35:50,187 INFO L125 PetriNetUnfolderBase]: For 145/145 co-relation queries the response was YES. [2025-03-08 21:35:50,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2485 conditions, 2072 events. 79/2072 cut-off events. For 145/145 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 6966 event pairs, 38 based on Foata normal form. 0/2004 useless extension candidates. Maximal degree in co-relation 1866. Up to 171 conditions per place. [2025-03-08 21:35:50,193 INFO L140 encePairwiseOnDemand]: 1012/1015 looper letters, 21 selfloop transitions, 2 changer transitions 0/999 dead transitions. [2025-03-08 21:35:50,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1004 places, 999 transitions, 2137 flow [2025-03-08 21:35:50,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:35:50,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:35:50,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2980 transitions. [2025-03-08 21:35:50,197 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9786535303776683 [2025-03-08 21:35:50,197 INFO L175 Difference]: Start difference. First operand has 1003 places, 999 transitions, 2090 flow. Second operand 3 states and 2980 transitions. [2025-03-08 21:35:50,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1004 places, 999 transitions, 2137 flow [2025-03-08 21:35:50,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1003 places, 999 transitions, 2133 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 21:35:50,208 INFO L231 Difference]: Finished difference. Result has 1003 places, 998 transitions, 2088 flow [2025-03-08 21:35:50,210 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1015, PETRI_DIFFERENCE_MINUEND_FLOW=2084, PETRI_DIFFERENCE_MINUEND_PLACES=1001, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=998, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=996, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2088, PETRI_PLACES=1003, PETRI_TRANSITIONS=998} [2025-03-08 21:35:50,211 INFO L279 CegarLoopForPetriNet]: 1005 programPoint places, -2 predicate places. [2025-03-08 21:35:50,212 INFO L471 AbstractCegarLoop]: Abstraction has has 1003 places, 998 transitions, 2088 flow [2025-03-08 21:35:50,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 991.0) internal successors, (2973), 3 states have internal predecessors, (2973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:50,213 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:50,213 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:35:50,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 21:35:50,214 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-08 21:35:50,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:50,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1973488693, now seen corresponding path program 1 times [2025-03-08 21:35:50,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:50,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759739153] [2025-03-08 21:35:50,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:50,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:50,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 939 statements into 1 equivalence classes. [2025-03-08 21:35:50,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 939 of 939 statements. [2025-03-08 21:35:50,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:50,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:51,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:35:51,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:51,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759739153] [2025-03-08 21:35:51,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759739153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:51,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:51,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:35:51,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713122589] [2025-03-08 21:35:51,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:51,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:35:51,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:51,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:35:51,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:35:51,489 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 985 out of 1015 [2025-03-08 21:35:51,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1003 places, 998 transitions, 2088 flow. Second operand has 6 states, 6 states have (on average 987.8333333333334) internal successors, (5927), 6 states have internal predecessors, (5927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:51,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:51,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 985 of 1015 [2025-03-08 21:35:51,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:51,795 INFO L124 PetriNetUnfolderBase]: 92/2122 cut-off events. [2025-03-08 21:35:51,795 INFO L125 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2025-03-08 21:35:51,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2540 conditions, 2122 events. 92/2122 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 7438 event pairs, 47 based on Foata normal form. 0/2054 useless extension candidates. Maximal degree in co-relation 2453. Up to 190 conditions per place. [2025-03-08 21:35:51,800 INFO L140 encePairwiseOnDemand]: 1009/1015 looper letters, 0 selfloop transitions, 0 changer transitions 1001/1001 dead transitions. [2025-03-08 21:35:51,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1007 places, 1001 transitions, 2148 flow [2025-03-08 21:35:51,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:35:51,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:35:51,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 5936 transitions. [2025-03-08 21:35:51,805 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9747126436781609 [2025-03-08 21:35:51,805 INFO L175 Difference]: Start difference. First operand has 1003 places, 998 transitions, 2088 flow. Second operand 6 states and 5936 transitions. [2025-03-08 21:35:51,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1007 places, 1001 transitions, 2148 flow [2025-03-08 21:35:51,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1005 places, 1001 transitions, 2144 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:35:51,813 INFO L231 Difference]: Finished difference. Result has 1005 places, 0 transitions, 0 flow [2025-03-08 21:35:51,814 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1015, PETRI_DIFFERENCE_MINUEND_FLOW=2082, PETRI_DIFFERENCE_MINUEND_PLACES=1000, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=997, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=997, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=1005, PETRI_TRANSITIONS=0} [2025-03-08 21:35:51,814 INFO L279 CegarLoopForPetriNet]: 1005 programPoint places, 0 predicate places. [2025-03-08 21:35:51,814 INFO L471 AbstractCegarLoop]: Abstraction has has 1005 places, 0 transitions, 0 flow [2025-03-08 21:35:51,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 987.8333333333334) internal successors, (5927), 6 states have internal predecessors, (5927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:35:51,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 26 remaining) [2025-03-08 21:35:51,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 26 remaining) [2025-03-08 21:35:51,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err5ASSERT_VIOLATIONDATA_RACE (23 of 26 remaining) [2025-03-08 21:35:51,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err4ASSERT_VIOLATIONDATA_RACE (22 of 26 remaining) [2025-03-08 21:35:51,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONDATA_RACE (21 of 26 remaining) [2025-03-08 21:35:51,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONDATA_RACE (20 of 26 remaining) [2025-03-08 21:35:51,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONDATA_RACE (19 of 26 remaining) [2025-03-08 21:35:51,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONDATA_RACE (18 of 26 remaining) [2025-03-08 21:35:51,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err5ASSERT_VIOLATIONDATA_RACE (17 of 26 remaining) [2025-03-08 21:35:51,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err4ASSERT_VIOLATIONDATA_RACE (16 of 26 remaining) [2025-03-08 21:35:51,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONDATA_RACE (15 of 26 remaining) [2025-03-08 21:35:51,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONDATA_RACE (14 of 26 remaining) [2025-03-08 21:35:51,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONDATA_RACE (13 of 26 remaining) [2025-03-08 21:35:51,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONDATA_RACE (12 of 26 remaining) [2025-03-08 21:35:51,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err5ASSERT_VIOLATIONDATA_RACE (11 of 26 remaining) [2025-03-08 21:35:51,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err4ASSERT_VIOLATIONDATA_RACE (10 of 26 remaining) [2025-03-08 21:35:51,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONDATA_RACE (9 of 26 remaining) [2025-03-08 21:35:51,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONDATA_RACE (8 of 26 remaining) [2025-03-08 21:35:51,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONDATA_RACE (7 of 26 remaining) [2025-03-08 21:35:51,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONDATA_RACE (6 of 26 remaining) [2025-03-08 21:35:51,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err5ASSERT_VIOLATIONDATA_RACE (5 of 26 remaining) [2025-03-08 21:35:51,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err4ASSERT_VIOLATIONDATA_RACE (4 of 26 remaining) [2025-03-08 21:35:51,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONDATA_RACE (3 of 26 remaining) [2025-03-08 21:35:51,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONDATA_RACE (2 of 26 remaining) [2025-03-08 21:35:51,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONDATA_RACE (1 of 26 remaining) [2025-03-08 21:35:51,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONDATA_RACE (0 of 26 remaining) [2025-03-08 21:35:51,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 21:35:51,822 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:35:51,825 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-08 21:35:51,825 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 21:35:51,831 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 09:35:51 BasicIcfg [2025-03-08 21:35:51,831 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 21:35:51,832 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 21:35:51,832 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 21:35:51,832 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 21:35:51,832 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:35:35" (3/4) ... [2025-03-08 21:35:51,834 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 21:35:51,836 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t1 [2025-03-08 21:35:51,836 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t2 [2025-03-08 21:35:51,850 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-08 21:35:51,854 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-08 21:35:51,854 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 21:35:51,855 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 21:35:51,950 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 21:35:51,950 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 21:35:51,950 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 21:35:51,951 INFO L158 Benchmark]: Toolchain (without parser) took 18802.17ms. Allocated memory was 142.6MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 109.9MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2025-03-08 21:35:51,951 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 127.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 21:35:51,951 INFO L158 Benchmark]: CACSL2BoogieTranslator took 525.75ms. Allocated memory is still 142.6MB. Free memory was 109.9MB in the beginning and 71.7MB in the end (delta: 38.2MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-08 21:35:51,952 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.41ms. Allocated memory is still 142.6MB. Free memory was 71.7MB in the beginning and 63.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 21:35:51,953 INFO L158 Benchmark]: Boogie Preprocessor took 60.88ms. Allocated memory is still 142.6MB. Free memory was 62.3MB in the beginning and 57.1MB in the end (delta: 5.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 21:35:51,953 INFO L158 Benchmark]: IcfgBuilder took 1212.73ms. Allocated memory is still 142.6MB. Free memory was 57.1MB in the beginning and 102.0MB in the end (delta: -44.9MB). Peak memory consumption was 44.5MB. Max. memory is 16.1GB. [2025-03-08 21:35:51,953 INFO L158 Benchmark]: TraceAbstraction took 16796.08ms. Allocated memory was 142.6MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 102.0MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2025-03-08 21:35:51,953 INFO L158 Benchmark]: Witness Printer took 118.51ms. Allocated memory is still 2.4GB. Free memory was 1.3GB in the beginning and 1.2GB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 21:35:51,955 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.19ms. Allocated memory is still 201.3MB. Free memory is still 127.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 525.75ms. Allocated memory is still 142.6MB. Free memory was 109.9MB in the beginning and 71.7MB in the end (delta: 38.2MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.41ms. Allocated memory is still 142.6MB. Free memory was 71.7MB in the beginning and 63.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.88ms. Allocated memory is still 142.6MB. Free memory was 62.3MB in the beginning and 57.1MB in the end (delta: 5.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 1212.73ms. Allocated memory is still 142.6MB. Free memory was 57.1MB in the beginning and 102.0MB in the end (delta: -44.9MB). Peak memory consumption was 44.5MB. Max. memory is 16.1GB. * TraceAbstraction took 16796.08ms. Allocated memory was 142.6MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 102.0MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 118.51ms. Allocated memory is still 2.4GB. Free memory was 1.3GB in the beginning and 1.2GB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 961]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 953]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 998]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 968]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 945]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 945]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1009]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 953]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 949]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 949]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 953]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 983]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 1173 locations, 1192 edges, 26 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.2s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 16.6s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 332 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 184 mSDsluCounter, 108 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 43 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 591 IncrementalHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 65 mSDtfsCounter, 591 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2482occurred in iteration=6, InterpolantAutomatonStates: 38, 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.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 7929 NumberOfCodeBlocks, 7929 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 7920 ConstructedInterpolants, 0 QuantifiedInterpolants, 9946 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-08 21:35:51,969 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 Result: TRUE