./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread/stack-2.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-2.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 1c5d098180a5596f0a60d3177354c69a5ee6da68b8191dc75b6c33b291ef0421 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 21:35:19,062 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 21:35:19,117 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:19,122 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 21:35:19,123 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 21:35:19,140 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 21:35:19,142 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 21:35:19,142 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 21:35:19,143 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 21:35:19,143 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 21:35:19,143 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 21:35:19,144 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 21:35:19,144 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 21:35:19,144 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 21:35:19,144 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 21:35:19,144 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 21:35:19,145 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 21:35:19,145 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 21:35:19,145 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 21:35:19,145 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 21:35:19,145 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 21:35:19,145 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 21:35:19,145 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 21:35:19,145 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 21:35:19,145 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 21:35:19,145 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 21:35:19,145 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 21:35:19,145 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 21:35:19,145 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 21:35:19,146 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 21:35:19,146 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 21:35:19,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:35:19,146 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 21:35:19,146 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 21:35:19,146 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 21:35:19,146 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 21:35:19,147 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 21:35:19,147 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 21:35:19,147 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 21:35:19,147 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 21:35:19,147 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 21:35:19,147 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 21:35:19,147 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 -> 1c5d098180a5596f0a60d3177354c69a5ee6da68b8191dc75b6c33b291ef0421 [2025-03-08 21:35:19,360 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 21:35:19,365 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 21:35:19,367 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 21:35:19,368 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 21:35:19,368 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 21:35:19,369 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/stack-2.i [2025-03-08 21:35:20,510 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/142b6fb6e/6795af1cd0364724a27eace27657d00e/FLAG375e0dcd5 [2025-03-08 21:35:20,777 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 21:35:20,779 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack-2.i [2025-03-08 21:35:20,796 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/142b6fb6e/6795af1cd0364724a27eace27657d00e/FLAG375e0dcd5 [2025-03-08 21:35:21,077 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/142b6fb6e/6795af1cd0364724a27eace27657d00e [2025-03-08 21:35:21,079 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 21:35:21,080 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 21:35:21,080 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 21:35:21,081 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 21:35:21,083 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 21:35:21,084 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:35:21" (1/1) ... [2025-03-08 21:35:21,084 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@108676e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:35:21, skipping insertion in model container [2025-03-08 21:35:21,084 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:35:21" (1/1) ... [2025-03-08 21:35:21,114 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 21:35:21,366 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:35:21,377 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 21:35:21,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:35:21,467 INFO L204 MainTranslator]: Completed translation [2025-03-08 21:35:21,468 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:35:21 WrapperNode [2025-03-08 21:35:21,468 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 21:35:21,469 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 21:35:21,469 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 21:35:21,469 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 21:35:21,473 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:21" (1/1) ... [2025-03-08 21:35:21,484 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:21" (1/1) ... [2025-03-08 21:35:21,501 INFO L138 Inliner]: procedures = 277, calls = 37, calls flagged for inlining = 13, calls inlined = 14, statements flattened = 193 [2025-03-08 21:35:21,501 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 21:35:21,502 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 21:35:21,502 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 21:35:21,502 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 21:35:21,508 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:21" (1/1) ... [2025-03-08 21:35:21,508 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:21" (1/1) ... [2025-03-08 21:35:21,511 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:21" (1/1) ... [2025-03-08 21:35:21,514 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:21" (1/1) ... [2025-03-08 21:35:21,522 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:21" (1/1) ... [2025-03-08 21:35:21,524 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:21" (1/1) ... [2025-03-08 21:35:21,525 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:21" (1/1) ... [2025-03-08 21:35:21,525 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:21" (1/1) ... [2025-03-08 21:35:21,527 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 21:35:21,528 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 21:35:21,528 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 21:35:21,528 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 21:35:21,529 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:35:21" (1/1) ... [2025-03-08 21:35:21,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:35:21,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:35:21,551 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:21,555 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:21,569 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-08 21:35:21,570 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-08 21:35:21,570 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-08 21:35:21,570 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-08 21:35:21,570 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-08 21:35:21,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 21:35:21,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 21:35:21,570 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-08 21:35:21,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 21:35:21,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 21:35:21,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 21:35:21,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 21:35:21,571 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:21,675 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 21:35:21,676 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 21:35:21,920 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L986-1: pop_#res#1 := 0; [2025-03-08 21:35:21,920 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L984: havoc pop_#t~mem41#1; [2025-03-08 21:35:21,920 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L984-1: havoc pop_#t~ret40#1; [2025-03-08 21:35:21,921 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 21:35:21,921 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 21:35:21,940 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 21:35:21,940 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 21:35:21,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:35:21 BoogieIcfgContainer [2025-03-08 21:35:21,941 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 21:35:21,943 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 21:35:21,944 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 21:35:21,947 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 21:35:21,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:35:21" (1/3) ... [2025-03-08 21:35:21,947 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bedb8e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:35:21, skipping insertion in model container [2025-03-08 21:35:21,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:35:21" (2/3) ... [2025-03-08 21:35:21,948 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bedb8e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:35:21, skipping insertion in model container [2025-03-08 21:35:21,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:35:21" (3/3) ... [2025-03-08 21:35:21,949 INFO L128 eAbstractionObserver]: Analyzing ICFG stack-2.i [2025-03-08 21:35:21,959 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 21:35:21,960 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG stack-2.i that has 3 procedures, 211 locations, 1 initial locations, 2 loop locations, and 12 error locations. [2025-03-08 21:35:21,960 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 21:35:22,043 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-08 21:35:22,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 217 places, 220 transitions, 454 flow [2025-03-08 21:35:22,134 INFO L124 PetriNetUnfolderBase]: 10/218 cut-off events. [2025-03-08 21:35:22,137 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-08 21:35:22,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 227 conditions, 218 events. 10/218 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 540 event pairs, 0 based on Foata normal form. 0/196 useless extension candidates. Maximal degree in co-relation 183. Up to 3 conditions per place. [2025-03-08 21:35:22,145 INFO L82 GeneralOperation]: Start removeDead. Operand has 217 places, 220 transitions, 454 flow [2025-03-08 21:35:22,148 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 210 places, 213 transitions, 435 flow [2025-03-08 21:35:22,153 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:35:22,161 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;@55833b05, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:35:22,161 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-03-08 21:35:22,176 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 21:35:22,177 INFO L124 PetriNetUnfolderBase]: 0/66 cut-off events. [2025-03-08 21:35:22,177 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 21:35:22,177 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:22,179 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] [2025-03-08 21:35:22,179 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:22,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:22,183 INFO L85 PathProgramCache]: Analyzing trace with hash -185810696, now seen corresponding path program 1 times [2025-03-08 21:35:22,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:22,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533757169] [2025-03-08 21:35:22,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:22,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:22,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-08 21:35:22,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 21:35:22,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:22,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:22,349 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:22,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:22,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533757169] [2025-03-08 21:35:22,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533757169] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:22,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:22,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:35:22,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852003941] [2025-03-08 21:35:22,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:22,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:35:22,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:22,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:35:22,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:35:22,393 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 220 [2025-03-08 21:35:22,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 213 transitions, 435 flow. Second operand has 3 states, 3 states have (on average 202.66666666666666) internal successors, (608), 3 states have internal predecessors, (608), 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:22,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:22,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 220 [2025-03-08 21:35:22,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:22,566 INFO L124 PetriNetUnfolderBase]: 59/830 cut-off events. [2025-03-08 21:35:22,566 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-03-08 21:35:22,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 948 conditions, 830 events. 59/830 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 4180 event pairs, 10 based on Foata normal form. 37/765 useless extension candidates. Maximal degree in co-relation 791. Up to 54 conditions per place. [2025-03-08 21:35:22,574 INFO L140 encePairwiseOnDemand]: 211/220 looper letters, 16 selfloop transitions, 3 changer transitions 0/210 dead transitions. [2025-03-08 21:35:22,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 210 transitions, 470 flow [2025-03-08 21:35:22,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:35:22,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:35:22,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 633 transitions. [2025-03-08 21:35:22,588 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9590909090909091 [2025-03-08 21:35:22,590 INFO L175 Difference]: Start difference. First operand has 210 places, 213 transitions, 435 flow. Second operand 3 states and 633 transitions. [2025-03-08 21:35:22,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 210 transitions, 470 flow [2025-03-08 21:35:22,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 210 transitions, 463 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-08 21:35:22,600 INFO L231 Difference]: Finished difference. Result has 205 places, 205 transitions, 434 flow [2025-03-08 21:35:22,602 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=434, PETRI_PLACES=205, PETRI_TRANSITIONS=205} [2025-03-08 21:35:22,605 INFO L279 CegarLoopForPetriNet]: 210 programPoint places, -5 predicate places. [2025-03-08 21:35:22,606 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 205 transitions, 434 flow [2025-03-08 21:35:22,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 202.66666666666666) internal successors, (608), 3 states have internal predecessors, (608), 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:22,607 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:22,607 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] [2025-03-08 21:35:22,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 21:35:22,607 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:22,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:22,608 INFO L85 PathProgramCache]: Analyzing trace with hash 2109044351, now seen corresponding path program 1 times [2025-03-08 21:35:22,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:22,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051739876] [2025-03-08 21:35:22,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:22,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:22,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-08 21:35:22,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 21:35:22,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:22,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:22,687 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:22,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:22,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051739876] [2025-03-08 21:35:22,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051739876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:22,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:22,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:35:22,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870651747] [2025-03-08 21:35:22,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:22,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:35:22,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:22,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:35:22,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:35:22,716 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 220 [2025-03-08 21:35:22,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 205 transitions, 434 flow. Second operand has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 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:22,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:22,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 220 [2025-03-08 21:35:22,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:23,121 INFO L124 PetriNetUnfolderBase]: 414/3759 cut-off events. [2025-03-08 21:35:23,121 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2025-03-08 21:35:23,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4666 conditions, 3759 events. 414/3759 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 31471 event pairs, 106 based on Foata normal form. 0/3393 useless extension candidates. Maximal degree in co-relation 3845. Up to 583 conditions per place. [2025-03-08 21:35:23,137 INFO L140 encePairwiseOnDemand]: 200/220 looper letters, 33 selfloop transitions, 14 changer transitions 0/225 dead transitions. [2025-03-08 21:35:23,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 225 transitions, 571 flow [2025-03-08 21:35:23,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:35:23,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:35:23,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 608 transitions. [2025-03-08 21:35:23,139 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9212121212121213 [2025-03-08 21:35:23,140 INFO L175 Difference]: Start difference. First operand has 205 places, 205 transitions, 434 flow. Second operand 3 states and 608 transitions. [2025-03-08 21:35:23,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 225 transitions, 571 flow [2025-03-08 21:35:23,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 225 transitions, 565 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:35:23,144 INFO L231 Difference]: Finished difference. Result has 207 places, 219 transitions, 552 flow [2025-03-08 21:35:23,145 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=552, PETRI_PLACES=207, PETRI_TRANSITIONS=219} [2025-03-08 21:35:23,145 INFO L279 CegarLoopForPetriNet]: 210 programPoint places, -3 predicate places. [2025-03-08 21:35:23,145 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 219 transitions, 552 flow [2025-03-08 21:35:23,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 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:23,146 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:23,146 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] [2025-03-08 21:35:23,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 21:35:23,146 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:23,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:23,147 INFO L85 PathProgramCache]: Analyzing trace with hash -95486024, now seen corresponding path program 1 times [2025-03-08 21:35:23,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:23,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523848236] [2025-03-08 21:35:23,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:23,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:23,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 21:35:23,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 21:35:23,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:23,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:23,339 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:23,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:23,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523848236] [2025-03-08 21:35:23,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523848236] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:23,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:23,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:35:23,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399199750] [2025-03-08 21:35:23,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:23,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 21:35:23,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:23,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 21:35:23,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 21:35:23,388 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 220 [2025-03-08 21:35:23,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 219 transitions, 552 flow. Second operand has 5 states, 5 states have (on average 192.2) internal successors, (961), 5 states have internal predecessors, (961), 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:23,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:23,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 220 [2025-03-08 21:35:23,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:24,057 INFO L124 PetriNetUnfolderBase]: 694/6679 cut-off events. [2025-03-08 21:35:24,057 INFO L125 PetriNetUnfolderBase]: For 257/259 co-relation queries the response was YES. [2025-03-08 21:35:24,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8654 conditions, 6679 events. 694/6679 cut-off events. For 257/259 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 67818 event pairs, 261 based on Foata normal form. 11/6059 useless extension candidates. Maximal degree in co-relation 8212. Up to 691 conditions per place. [2025-03-08 21:35:24,092 INFO L140 encePairwiseOnDemand]: 211/220 looper letters, 55 selfloop transitions, 13 changer transitions 0/265 dead transitions. [2025-03-08 21:35:24,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 265 transitions, 788 flow [2025-03-08 21:35:24,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 21:35:24,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-08 21:35:24,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1593 transitions. [2025-03-08 21:35:24,098 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9051136363636364 [2025-03-08 21:35:24,098 INFO L175 Difference]: Start difference. First operand has 207 places, 219 transitions, 552 flow. Second operand 8 states and 1593 transitions. [2025-03-08 21:35:24,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 265 transitions, 788 flow [2025-03-08 21:35:24,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 265 transitions, 760 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:35:24,110 INFO L231 Difference]: Finished difference. Result has 218 places, 230 transitions, 622 flow [2025-03-08 21:35:24,112 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=622, PETRI_PLACES=218, PETRI_TRANSITIONS=230} [2025-03-08 21:35:24,113 INFO L279 CegarLoopForPetriNet]: 210 programPoint places, 8 predicate places. [2025-03-08 21:35:24,113 INFO L471 AbstractCegarLoop]: Abstraction has has 218 places, 230 transitions, 622 flow [2025-03-08 21:35:24,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 192.2) internal successors, (961), 5 states have internal predecessors, (961), 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:24,114 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:24,114 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] [2025-03-08 21:35:24,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 21:35:24,114 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:24,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:24,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1281335326, now seen corresponding path program 1 times [2025-03-08 21:35:24,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:24,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449571699] [2025-03-08 21:35:24,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:24,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:24,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 21:35:24,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 21:35:24,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:24,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:24,586 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:24,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:24,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449571699] [2025-03-08 21:35:24,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449571699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:24,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:24,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:35:24,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662911607] [2025-03-08 21:35:24,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:24,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:35:24,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:24,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:35:24,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:35:24,663 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 220 [2025-03-08 21:35:24,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 230 transitions, 622 flow. Second operand has 6 states, 6 states have (on average 189.83333333333334) internal successors, (1139), 6 states have internal predecessors, (1139), 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:24,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:24,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 220 [2025-03-08 21:35:24,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:24,964 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] L1015-3-->L1015: 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][74], [Black: 225#true, 247#true, 29#L1024-1true, 86#L997-4true, Black: 240#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 236#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), Black: 233#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), Black: 238#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 232#(= ~top~0 0), 230#true, 216#true, 142#L1015true, Black: 220#true]) [2025-03-08 21:35:24,965 INFO L294 olderBase$Statistics]: this new event has 160 ancestors and is cut-off event [2025-03-08 21:35:24,965 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-03-08 21:35:24,965 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2025-03-08 21:35:24,965 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2025-03-08 21:35:25,255 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] L1015-3-->L1015: 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][74], [Black: 222#(= |#race~flag~0| 0), Black: 225#true, 247#true, 29#L1024-1true, 86#L997-4true, Black: 240#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 236#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), Black: 233#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), Black: 238#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 232#(= ~top~0 0), 230#true, 216#true, 142#L1015true]) [2025-03-08 21:35:25,256 INFO L294 olderBase$Statistics]: this new event has 183 ancestors and is cut-off event [2025-03-08 21:35:25,256 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2025-03-08 21:35:25,256 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is cut-off event [2025-03-08 21:35:25,256 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2025-03-08 21:35:25,355 INFO L124 PetriNetUnfolderBase]: 922/6948 cut-off events. [2025-03-08 21:35:25,355 INFO L125 PetriNetUnfolderBase]: For 344/355 co-relation queries the response was YES. [2025-03-08 21:35:25,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9842 conditions, 6948 events. 922/6948 cut-off events. For 344/355 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 68379 event pairs, 387 based on Foata normal form. 3/6322 useless extension candidates. Maximal degree in co-relation 9201. Up to 1293 conditions per place. [2025-03-08 21:35:25,389 INFO L140 encePairwiseOnDemand]: 209/220 looper letters, 35 selfloop transitions, 22 changer transitions 0/263 dead transitions. [2025-03-08 21:35:25,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 263 transitions, 810 flow [2025-03-08 21:35:25,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:35:25,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:35:25,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1186 transitions. [2025-03-08 21:35:25,392 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8984848484848484 [2025-03-08 21:35:25,392 INFO L175 Difference]: Start difference. First operand has 218 places, 230 transitions, 622 flow. Second operand 6 states and 1186 transitions. [2025-03-08 21:35:25,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 263 transitions, 810 flow [2025-03-08 21:35:25,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 263 transitions, 810 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 21:35:25,397 INFO L231 Difference]: Finished difference. Result has 228 places, 251 transitions, 772 flow [2025-03-08 21:35:25,398 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=772, PETRI_PLACES=228, PETRI_TRANSITIONS=251} [2025-03-08 21:35:25,398 INFO L279 CegarLoopForPetriNet]: 210 programPoint places, 18 predicate places. [2025-03-08 21:35:25,398 INFO L471 AbstractCegarLoop]: Abstraction has has 228 places, 251 transitions, 772 flow [2025-03-08 21:35:25,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 189.83333333333334) internal successors, (1139), 6 states have internal predecessors, (1139), 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:25,399 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:25,399 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] [2025-03-08 21:35:25,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 21:35:25,400 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:25,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:25,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1588335207, now seen corresponding path program 1 times [2025-03-08 21:35:25,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:25,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851166845] [2025-03-08 21:35:25,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:25,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:25,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 21:35:25,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 21:35:25,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:25,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:25,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:25,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:25,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851166845] [2025-03-08 21:35:25,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851166845] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:25,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:25,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:35:25,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005364735] [2025-03-08 21:35:25,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:25,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:35:25,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:25,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:35:25,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:35:25,476 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 220 [2025-03-08 21:35:25,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 251 transitions, 772 flow. Second operand has 3 states, 3 states have (on average 194.0) internal successors, (582), 3 states have internal predecessors, (582), 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:25,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:25,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 220 [2025-03-08 21:35:25,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:26,143 INFO L124 PetriNetUnfolderBase]: 821/6878 cut-off events. [2025-03-08 21:35:26,144 INFO L125 PetriNetUnfolderBase]: For 820/914 co-relation queries the response was YES. [2025-03-08 21:35:26,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10321 conditions, 6878 events. 821/6878 cut-off events. For 820/914 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 66335 event pairs, 300 based on Foata normal form. 18/6324 useless extension candidates. Maximal degree in co-relation 6307. Up to 1120 conditions per place. [2025-03-08 21:35:26,180 INFO L140 encePairwiseOnDemand]: 212/220 looper letters, 30 selfloop transitions, 11 changer transitions 0/263 dead transitions. [2025-03-08 21:35:26,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 263 transitions, 894 flow [2025-03-08 21:35:26,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:35:26,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:35:26,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 604 transitions. [2025-03-08 21:35:26,182 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9151515151515152 [2025-03-08 21:35:26,182 INFO L175 Difference]: Start difference. First operand has 228 places, 251 transitions, 772 flow. Second operand 3 states and 604 transitions. [2025-03-08 21:35:26,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 263 transitions, 894 flow [2025-03-08 21:35:26,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 263 transitions, 894 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 21:35:26,190 INFO L231 Difference]: Finished difference. Result has 232 places, 260 transitions, 868 flow [2025-03-08 21:35:26,190 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=772, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=868, PETRI_PLACES=232, PETRI_TRANSITIONS=260} [2025-03-08 21:35:26,191 INFO L279 CegarLoopForPetriNet]: 210 programPoint places, 22 predicate places. [2025-03-08 21:35:26,191 INFO L471 AbstractCegarLoop]: Abstraction has has 232 places, 260 transitions, 868 flow [2025-03-08 21:35:26,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 194.0) internal successors, (582), 3 states have internal predecessors, (582), 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:26,191 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:26,191 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] [2025-03-08 21:35:26,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 21:35:26,192 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:26,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:26,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1457141993, now seen corresponding path program 1 times [2025-03-08 21:35:26,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:26,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918051644] [2025-03-08 21:35:26,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:26,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:26,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 21:35:26,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 21:35:26,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:26,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:26,241 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:26,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:26,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918051644] [2025-03-08 21:35:26,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918051644] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:26,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:26,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:35:26,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806546635] [2025-03-08 21:35:26,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:26,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:35:26,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:26,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:35:26,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:35:26,252 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 220 [2025-03-08 21:35:26,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 260 transitions, 868 flow. Second operand has 3 states, 3 states have (on average 200.66666666666666) internal successors, (602), 3 states have internal predecessors, (602), 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:26,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:26,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 220 [2025-03-08 21:35:26,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:26,824 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] L1015-3-->L1015: 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][194], [Black: 249#(= (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: 222#(= |#race~flag~0| 0), Black: 252#(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|)), 247#true, Black: 225#true, Black: 260#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 29#L1024-1true, 71#L999-1true, 265#(= |#race~flag~0| |t1Thread1of1ForFork1_#t~nondet45#1|), Black: 240#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 236#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), Black: 233#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), Black: 238#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 232#(= ~top~0 0), 230#true, 216#true, 142#L1015true, Black: 251#(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: 250#(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|)), 258#true]) [2025-03-08 21:35:26,825 INFO L294 olderBase$Statistics]: this new event has 191 ancestors and is cut-off event [2025-03-08 21:35:26,825 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2025-03-08 21:35:26,825 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2025-03-08 21:35:26,825 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2025-03-08 21:35:26,826 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] L1015-3-->L1015: 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][194], [Black: 249#(= (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: 222#(= |#race~flag~0| 0), Black: 252#(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|)), 247#true, Black: 225#true, Black: 260#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 29#L1024-1true, 265#(= |#race~flag~0| |t1Thread1of1ForFork1_#t~nondet45#1|), 65#L999true, Black: 240#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 236#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), Black: 233#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), Black: 238#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 232#(= ~top~0 0), 230#true, 216#true, 142#L1015true, Black: 251#(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: 250#(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|)), 258#true]) [2025-03-08 21:35:26,826 INFO L294 olderBase$Statistics]: this new event has 190 ancestors and is cut-off event [2025-03-08 21:35:26,826 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2025-03-08 21:35:26,826 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2025-03-08 21:35:26,826 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2025-03-08 21:35:26,826 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] L1015-3-->L1015: 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][74], [Black: 249#(= (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: 222#(= |#race~flag~0| 0), Black: 252#(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|)), 247#true, Black: 225#true, Black: 260#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 29#L1024-1true, 263#true, 182#L1000-3true, Black: 240#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 236#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), Black: 233#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), Black: 238#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 232#(= ~top~0 0), 230#true, 216#true, 142#L1015true, Black: 251#(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: 250#(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|)), 258#true]) [2025-03-08 21:35:26,826 INFO L294 olderBase$Statistics]: this new event has 192 ancestors and is cut-off event [2025-03-08 21:35:26,826 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2025-03-08 21:35:26,826 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2025-03-08 21:35:26,826 INFO L297 olderBase$Statistics]: existing Event has 169 ancestors and is cut-off event [2025-03-08 21:35:26,826 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] L1015-3-->L1015: 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][74], [Black: 249#(= (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: 222#(= |#race~flag~0| 0), Black: 252#(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|)), 9#L1000true, 247#true, Black: 225#true, Black: 260#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 29#L1024-1true, 263#true, Black: 240#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 236#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), Black: 233#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), Black: 238#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 232#(= ~top~0 0), 230#true, 216#true, 142#L1015true, Black: 251#(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: 250#(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|)), 258#true]) [2025-03-08 21:35:26,826 INFO L294 olderBase$Statistics]: this new event has 193 ancestors and is cut-off event [2025-03-08 21:35:26,826 INFO L297 olderBase$Statistics]: existing Event has 170 ancestors and is cut-off event [2025-03-08 21:35:26,827 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2025-03-08 21:35:26,827 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2025-03-08 21:35:26,827 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] L1015-3-->L1015: 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][74], [Black: 249#(= (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: 222#(= |#race~flag~0| 0), Black: 252#(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|)), 247#true, Black: 225#true, Black: 260#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 29#L1024-1true, 263#true, 155#L994true, Black: 240#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 236#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), Black: 233#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), Black: 238#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 232#(= ~top~0 0), 230#true, 216#true, 142#L1015true, Black: 251#(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: 250#(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|)), 258#true]) [2025-03-08 21:35:26,827 INFO L294 olderBase$Statistics]: this new event has 199 ancestors and is cut-off event [2025-03-08 21:35:26,827 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2025-03-08 21:35:26,827 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2025-03-08 21:35:26,827 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2025-03-08 21:35:26,830 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] L1015-3-->L1015: 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][74], [Black: 222#(= |#race~flag~0| 0), Black: 249#(= (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: 252#(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: 225#true, 247#true, Black: 260#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 29#L1024-1true, 263#true, Black: 240#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 236#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), Black: 233#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), Black: 238#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 232#(= ~top~0 0), 230#true, 216#true, 142#L1015true, 188#L999-2true, Black: 251#(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: 250#(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|)), 258#true]) [2025-03-08 21:35:26,830 INFO L294 olderBase$Statistics]: this new event has 190 ancestors and is cut-off event [2025-03-08 21:35:26,830 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-03-08 21:35:26,830 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is cut-off event [2025-03-08 21:35:26,830 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2025-03-08 21:35:26,831 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] L1015-3-->L1015: 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][74], [Black: 249#(= (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: 222#(= |#race~flag~0| 0), Black: 252#(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|)), 247#true, Black: 225#true, 162#L1026true, Black: 260#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 263#true, Black: 240#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 236#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), Black: 233#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), Black: 238#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 232#(= ~top~0 0), 230#true, 216#true, 142#L1015true, Black: 251#(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: 250#(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|)), 258#true]) [2025-03-08 21:35:26,831 INFO L294 olderBase$Statistics]: this new event has 203 ancestors and is cut-off event [2025-03-08 21:35:26,831 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2025-03-08 21:35:26,832 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2025-03-08 21:35:26,832 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2025-03-08 21:35:26,854 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([572] L1015-3-->L1015: 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][74], [Black: 249#(= (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: 222#(= |#race~flag~0| 0), Black: 252#(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|)), 247#true, Black: 225#true, Black: 260#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 29#L1024-1true, 263#true, Black: 240#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 236#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), Black: 233#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), Black: 238#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 232#(= ~top~0 0), 230#true, 216#true, Black: 251#(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|)), 142#L1015true, 188#L999-2true, 258#true, Black: 250#(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|))]) [2025-03-08 21:35:26,854 INFO L294 olderBase$Statistics]: this new event has 190 ancestors and is cut-off event [2025-03-08 21:35:26,854 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-03-08 21:35:26,854 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is cut-off event [2025-03-08 21:35:26,854 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2025-03-08 21:35:26,854 INFO L297 olderBase$Statistics]: existing Event has 190 ancestors and is cut-off event [2025-03-08 21:35:26,970 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([492] L962-2-->L962-1: Formula: (= |v_#race~top~0_12| 0) InVars {} OutVars{#race~top~0=|v_#race~top~0_12|} AuxVars[] AssignedVars[#race~top~0][103], [Black: 249#(= (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: 222#(= |#race~flag~0| 0), Black: 252#(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: 225#true, 247#true, Black: 260#(= |t1Thread1of1ForFork1_inc_top_#t~nondet32#1| |#race~top~0|), 44#L962-1true, 29#L1024-1true, 263#true, Black: 240#(and (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 236#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0)), Black: 233#(= |t2Thread1of1ForFork0_get_top_#res#1| 0), 74#L954-2true, Black: 238#(and (= ~top~0 0) (= |t2Thread1of1ForFork0_get_top_#res#1| 0) (= |t2Thread1of1ForFork0_pop_#t~ret38#1| 0)), Black: 232#(= ~top~0 0), 230#true, 216#true, Black: 251#(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: 250#(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|)), 258#true]) [2025-03-08 21:35:26,970 INFO L294 olderBase$Statistics]: this new event has 196 ancestors and is cut-off event [2025-03-08 21:35:26,971 INFO L297 olderBase$Statistics]: existing Event has 196 ancestors and is cut-off event [2025-03-08 21:35:26,971 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2025-03-08 21:35:26,971 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2025-03-08 21:35:27,031 INFO L124 PetriNetUnfolderBase]: 816/6992 cut-off events. [2025-03-08 21:35:27,031 INFO L125 PetriNetUnfolderBase]: For 982/1023 co-relation queries the response was YES. [2025-03-08 21:35:27,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10602 conditions, 6992 events. 816/6992 cut-off events. For 982/1023 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 68935 event pairs, 217 based on Foata normal form. 10/6451 useless extension candidates. Maximal degree in co-relation 6243. Up to 685 conditions per place. [2025-03-08 21:35:27,060 INFO L140 encePairwiseOnDemand]: 215/220 looper letters, 16 selfloop transitions, 6 changer transitions 0/267 dead transitions. [2025-03-08 21:35:27,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 267 transitions, 932 flow [2025-03-08 21:35:27,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:35:27,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:35:27,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 617 transitions. [2025-03-08 21:35:27,062 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9348484848484848 [2025-03-08 21:35:27,062 INFO L175 Difference]: Start difference. First operand has 232 places, 260 transitions, 868 flow. Second operand 3 states and 617 transitions. [2025-03-08 21:35:27,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 267 transitions, 932 flow [2025-03-08 21:35:27,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 267 transitions, 910 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:35:27,071 INFO L231 Difference]: Finished difference. Result has 234 places, 264 transitions, 892 flow [2025-03-08 21:35:27,072 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=846, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=892, PETRI_PLACES=234, PETRI_TRANSITIONS=264} [2025-03-08 21:35:27,073 INFO L279 CegarLoopForPetriNet]: 210 programPoint places, 24 predicate places. [2025-03-08 21:35:27,073 INFO L471 AbstractCegarLoop]: Abstraction has has 234 places, 264 transitions, 892 flow [2025-03-08 21:35:27,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 200.66666666666666) internal successors, (602), 3 states have internal predecessors, (602), 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:27,074 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:27,074 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] [2025-03-08 21:35:27,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 21:35:27,074 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:27,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:27,075 INFO L85 PathProgramCache]: Analyzing trace with hash -516759749, now seen corresponding path program 1 times [2025-03-08 21:35:27,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:27,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480228156] [2025-03-08 21:35:27,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:27,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:27,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 21:35:27,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 21:35:27,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:27,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:27,170 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:27,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:27,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480228156] [2025-03-08 21:35:27,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480228156] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:27,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:27,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 21:35:27,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430297189] [2025-03-08 21:35:27,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:27,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:35:27,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:27,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:35:27,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:35:27,186 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 220 [2025-03-08 21:35:27,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 264 transitions, 892 flow. Second operand has 3 states, 3 states have (on average 205.0) internal successors, (615), 3 states have internal predecessors, (615), 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:27,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:27,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 220 [2025-03-08 21:35:27,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:27,280 INFO L124 PetriNetUnfolderBase]: 64/1305 cut-off events. [2025-03-08 21:35:27,280 INFO L125 PetriNetUnfolderBase]: For 171/171 co-relation queries the response was YES. [2025-03-08 21:35:27,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1889 conditions, 1305 events. 64/1305 cut-off events. For 171/171 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 6947 event pairs, 9 based on Foata normal form. 24/1261 useless extension candidates. Maximal degree in co-relation 1783. Up to 86 conditions per place. [2025-03-08 21:35:27,286 INFO L140 encePairwiseOnDemand]: 216/220 looper letters, 7 selfloop transitions, 4 changer transitions 0/206 dead transitions. [2025-03-08 21:35:27,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 206 transitions, 611 flow [2025-03-08 21:35:27,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:35:27,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:35:27,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 622 transitions. [2025-03-08 21:35:27,288 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9424242424242424 [2025-03-08 21:35:27,289 INFO L175 Difference]: Start difference. First operand has 234 places, 264 transitions, 892 flow. Second operand 3 states and 622 transitions. [2025-03-08 21:35:27,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 206 transitions, 611 flow [2025-03-08 21:35:27,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 206 transitions, 521 flow, removed 27 selfloop flow, removed 17 redundant places. [2025-03-08 21:35:27,296 INFO L231 Difference]: Finished difference. Result has 208 places, 204 transitions, 500 flow [2025-03-08 21:35:27,297 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=500, PETRI_PLACES=208, PETRI_TRANSITIONS=204} [2025-03-08 21:35:27,297 INFO L279 CegarLoopForPetriNet]: 210 programPoint places, -2 predicate places. [2025-03-08 21:35:27,297 INFO L471 AbstractCegarLoop]: Abstraction has has 208 places, 204 transitions, 500 flow [2025-03-08 21:35:27,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 205.0) internal successors, (615), 3 states have internal predecessors, (615), 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:27,297 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:27,298 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] [2025-03-08 21:35:27,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 21:35:27,298 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:27,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:27,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1548814345, now seen corresponding path program 1 times [2025-03-08 21:35:27,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:27,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776985162] [2025-03-08 21:35:27,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:27,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:27,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 21:35:27,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 21:35:27,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:27,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:27,343 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:27,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:27,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776985162] [2025-03-08 21:35:27,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776985162] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:27,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:27,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:35:27,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289775996] [2025-03-08 21:35:27,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:27,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:35:27,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:27,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:35:27,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:35:27,377 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 220 [2025-03-08 21:35:27,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 204 transitions, 500 flow. Second operand has 3 states, 3 states have (on average 196.0) internal successors, (588), 3 states have internal predecessors, (588), 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:27,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:27,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 220 [2025-03-08 21:35:27,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:27,457 INFO L124 PetriNetUnfolderBase]: 78/1241 cut-off events. [2025-03-08 21:35:27,457 INFO L125 PetriNetUnfolderBase]: For 144/144 co-relation queries the response was YES. [2025-03-08 21:35:27,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1646 conditions, 1241 events. 78/1241 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 6687 event pairs, 38 based on Foata normal form. 0/1163 useless extension candidates. Maximal degree in co-relation 1027. Up to 171 conditions per place. [2025-03-08 21:35:27,461 INFO L140 encePairwiseOnDemand]: 217/220 looper letters, 21 selfloop transitions, 2 changer transitions 5/204 dead transitions. [2025-03-08 21:35:27,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 204 transitions, 547 flow [2025-03-08 21:35:27,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:35:27,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:35:27,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 595 transitions. [2025-03-08 21:35:27,463 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9015151515151515 [2025-03-08 21:35:27,463 INFO L175 Difference]: Start difference. First operand has 208 places, 204 transitions, 500 flow. Second operand 3 states and 595 transitions. [2025-03-08 21:35:27,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 204 transitions, 547 flow [2025-03-08 21:35:27,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 204 transitions, 543 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 21:35:27,466 INFO L231 Difference]: Finished difference. Result has 208 places, 198 transitions, 488 flow [2025-03-08 21:35:27,467 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=488, PETRI_PLACES=208, PETRI_TRANSITIONS=198} [2025-03-08 21:35:27,469 INFO L279 CegarLoopForPetriNet]: 210 programPoint places, -2 predicate places. [2025-03-08 21:35:27,469 INFO L471 AbstractCegarLoop]: Abstraction has has 208 places, 198 transitions, 488 flow [2025-03-08 21:35:27,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 196.0) internal successors, (588), 3 states have internal predecessors, (588), 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:27,470 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:27,470 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] [2025-03-08 21:35:27,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 21:35:27,470 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:27,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:27,471 INFO L85 PathProgramCache]: Analyzing trace with hash 174486138, now seen corresponding path program 1 times [2025-03-08 21:35:27,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:27,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792774454] [2025-03-08 21:35:27,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:27,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:27,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 21:35:27,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 21:35:27,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:27,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:27,876 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:35:27,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:27,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792774454] [2025-03-08 21:35:27,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792774454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:27,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:27,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:35:27,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739764708] [2025-03-08 21:35:27,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:27,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:35:27,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:27,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:35:27,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:35:27,923 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 220 [2025-03-08 21:35:27,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 198 transitions, 488 flow. Second operand has 6 states, 6 states have (on average 192.83333333333334) internal successors, (1157), 6 states have internal predecessors, (1157), 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:27,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:27,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 220 [2025-03-08 21:35:27,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:28,034 INFO L124 PetriNetUnfolderBase]: 92/1255 cut-off events. [2025-03-08 21:35:28,034 INFO L125 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2025-03-08 21:35:28,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1672 conditions, 1255 events. 92/1255 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 6890 event pairs, 47 based on Foata normal form. 0/1212 useless extension candidates. Maximal degree in co-relation 1585. Up to 190 conditions per place. [2025-03-08 21:35:28,037 INFO L140 encePairwiseOnDemand]: 214/220 looper letters, 0 selfloop transitions, 0 changer transitions 201/201 dead transitions. [2025-03-08 21:35:28,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 201 transitions, 548 flow [2025-03-08 21:35:28,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:35:28,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:35:28,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1166 transitions. [2025-03-08 21:35:28,039 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8833333333333333 [2025-03-08 21:35:28,039 INFO L175 Difference]: Start difference. First operand has 208 places, 198 transitions, 488 flow. Second operand 6 states and 1166 transitions. [2025-03-08 21:35:28,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 201 transitions, 548 flow [2025-03-08 21:35:28,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 201 transitions, 544 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:35:28,042 INFO L231 Difference]: Finished difference. Result has 205 places, 0 transitions, 0 flow [2025-03-08 21:35:28,042 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=205, PETRI_TRANSITIONS=0} [2025-03-08 21:35:28,042 INFO L279 CegarLoopForPetriNet]: 210 programPoint places, -5 predicate places. [2025-03-08 21:35:28,042 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 0 transitions, 0 flow [2025-03-08 21:35:28,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 192.83333333333334) internal successors, (1157), 6 states have internal predecessors, (1157), 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:28,045 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 26 remaining) [2025-03-08 21:35:28,045 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 26 remaining) [2025-03-08 21:35:28,045 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err5ASSERT_VIOLATIONDATA_RACE (23 of 26 remaining) [2025-03-08 21:35:28,045 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err4ASSERT_VIOLATIONDATA_RACE (22 of 26 remaining) [2025-03-08 21:35:28,045 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONDATA_RACE (21 of 26 remaining) [2025-03-08 21:35:28,045 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONDATA_RACE (20 of 26 remaining) [2025-03-08 21:35:28,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONDATA_RACE (19 of 26 remaining) [2025-03-08 21:35:28,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONDATA_RACE (18 of 26 remaining) [2025-03-08 21:35:28,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err5ASSERT_VIOLATIONDATA_RACE (17 of 26 remaining) [2025-03-08 21:35:28,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err4ASSERT_VIOLATIONDATA_RACE (16 of 26 remaining) [2025-03-08 21:35:28,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONDATA_RACE (15 of 26 remaining) [2025-03-08 21:35:28,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONDATA_RACE (14 of 26 remaining) [2025-03-08 21:35:28,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONDATA_RACE (13 of 26 remaining) [2025-03-08 21:35:28,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONDATA_RACE (12 of 26 remaining) [2025-03-08 21:35:28,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err5ASSERT_VIOLATIONDATA_RACE (11 of 26 remaining) [2025-03-08 21:35:28,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err4ASSERT_VIOLATIONDATA_RACE (10 of 26 remaining) [2025-03-08 21:35:28,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONDATA_RACE (9 of 26 remaining) [2025-03-08 21:35:28,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONDATA_RACE (8 of 26 remaining) [2025-03-08 21:35:28,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONDATA_RACE (7 of 26 remaining) [2025-03-08 21:35:28,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONDATA_RACE (6 of 26 remaining) [2025-03-08 21:35:28,047 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err5ASSERT_VIOLATIONDATA_RACE (5 of 26 remaining) [2025-03-08 21:35:28,047 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err4ASSERT_VIOLATIONDATA_RACE (4 of 26 remaining) [2025-03-08 21:35:28,047 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONDATA_RACE (3 of 26 remaining) [2025-03-08 21:35:28,047 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONDATA_RACE (2 of 26 remaining) [2025-03-08 21:35:28,047 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONDATA_RACE (1 of 26 remaining) [2025-03-08 21:35:28,047 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONDATA_RACE (0 of 26 remaining) [2025-03-08 21:35:28,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 21:35:28,047 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:35:28,050 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-08 21:35:28,051 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 21:35:28,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 09:35:28 BasicIcfg [2025-03-08 21:35:28,054 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 21:35:28,055 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 21:35:28,055 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 21:35:28,055 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 21:35:28,056 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:21" (3/4) ... [2025-03-08 21:35:28,057 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 21:35:28,059 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t1 [2025-03-08 21:35:28,059 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t2 [2025-03-08 21:35:28,061 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-08 21:35:28,061 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-08 21:35:28,061 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 21:35:28,061 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 21:35:28,107 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 21:35:28,107 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 21:35:28,107 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 21:35:28,107 INFO L158 Benchmark]: Toolchain (without parser) took 7027.88ms. Allocated memory was 201.3MB in the beginning and 704.6MB in the end (delta: 503.3MB). Free memory was 151.9MB in the beginning and 281.0MB in the end (delta: -129.1MB). Peak memory consumption was 370.6MB. Max. memory is 16.1GB. [2025-03-08 21:35:28,107 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 116.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 21:35:28,108 INFO L158 Benchmark]: CACSL2BoogieTranslator took 388.02ms. Allocated memory is still 201.3MB. Free memory was 151.9MB in the beginning and 122.3MB in the end (delta: 29.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-08 21:35:28,108 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.61ms. Allocated memory is still 201.3MB. Free memory was 122.3MB in the beginning and 119.9MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 21:35:28,108 INFO L158 Benchmark]: Boogie Preprocessor took 25.25ms. Allocated memory is still 201.3MB. Free memory was 119.9MB in the beginning and 118.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 21:35:28,108 INFO L158 Benchmark]: IcfgBuilder took 413.07ms. Allocated memory is still 201.3MB. Free memory was 118.2MB in the beginning and 95.5MB in the end (delta: 22.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 21:35:28,108 INFO L158 Benchmark]: TraceAbstraction took 6111.02ms. Allocated memory was 201.3MB in the beginning and 704.6MB in the end (delta: 503.3MB). Free memory was 95.1MB in the beginning and 285.2MB in the end (delta: -190.1MB). Peak memory consumption was 311.9MB. Max. memory is 16.1GB. [2025-03-08 21:35:28,108 INFO L158 Benchmark]: Witness Printer took 51.91ms. Allocated memory is still 704.6MB. Free memory was 285.2MB in the beginning and 281.0MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 21:35:28,109 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.22ms. Allocated memory is still 201.3MB. Free memory is still 116.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 388.02ms. Allocated memory is still 201.3MB. Free memory was 151.9MB in the beginning and 122.3MB in the end (delta: 29.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.61ms. Allocated memory is still 201.3MB. Free memory was 122.3MB in the beginning and 119.9MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.25ms. Allocated memory is still 201.3MB. Free memory was 119.9MB in the beginning and 118.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 413.07ms. Allocated memory is still 201.3MB. Free memory was 118.2MB in the beginning and 95.5MB in the end (delta: 22.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6111.02ms. Allocated memory was 201.3MB in the beginning and 704.6MB in the end (delta: 503.3MB). Free memory was 95.1MB in the beginning and 285.2MB in the end (delta: -190.1MB). Peak memory consumption was 311.9MB. Max. memory is 16.1GB. * Witness Printer took 51.91ms. Allocated memory is still 704.6MB. Free memory was 285.2MB in the beginning and 281.0MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 962]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 954]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 999]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 969]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 946]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 946]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1010]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 954]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 950]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 950]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 954]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 984]: 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, 378 locations, 397 edges, 26 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.0s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 346 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 177 mSDsluCounter, 125 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 42 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 680 IncrementalHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 83 mSDtfsCounter, 680 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=892occurred 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 774 NumberOfCodeBlocks, 774 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 765 ConstructedInterpolants, 0 QuantifiedInterpolants, 1171 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 3/3 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:28,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE