./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/04-mutex_11-ptr_rc.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/goblint-regression/04-mutex_11-ptr_rc.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 257fb96430b0f36c2bbaa69cb6381ae36a61b3597c5e89eeb3224bf08a96c8c2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 21:56:50,815 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 21:56:50,864 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-08 21:56:50,867 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 21:56:50,867 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 21:56:50,887 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 21:56:50,888 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 21:56:50,888 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 21:56:50,888 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 21:56:50,888 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 21:56:50,888 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 21:56:50,888 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 21:56:50,888 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 21:56:50,889 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 21:56:50,889 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 21:56:50,889 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 21:56:50,889 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 21:56:50,889 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 21:56:50,889 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 21:56:50,889 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 21:56:50,889 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 21:56:50,889 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 21:56:50,889 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 21:56:50,889 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 21:56:50,890 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 21:56:50,890 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 21:56:50,890 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 21:56:50,890 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 21:56:50,890 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 21:56:50,890 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 21:56:50,890 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 21:56:50,890 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:56:50,890 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 21:56:50,890 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 21:56:50,891 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 21:56:50,891 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 21:56:50,891 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 21:56:50,891 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 21:56:50,891 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 21:56:50,891 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 21:56:50,891 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 21:56:50,891 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 21:56:50,891 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 -> 257fb96430b0f36c2bbaa69cb6381ae36a61b3597c5e89eeb3224bf08a96c8c2 [2025-03-08 21:56:51,095 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 21:56:51,100 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 21:56:51,103 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 21:56:51,103 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 21:56:51,104 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 21:56:51,105 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/04-mutex_11-ptr_rc.i [2025-03-08 21:56:52,216 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4191b7c70/1000ca4883a74c07a839bc70f97d404d/FLAG03e2512f0 [2025-03-08 21:56:52,490 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 21:56:52,491 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/04-mutex_11-ptr_rc.i [2025-03-08 21:56:52,506 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4191b7c70/1000ca4883a74c07a839bc70f97d404d/FLAG03e2512f0 [2025-03-08 21:56:52,783 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4191b7c70/1000ca4883a74c07a839bc70f97d404d [2025-03-08 21:56:52,785 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 21:56:52,786 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 21:56:52,787 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 21:56:52,787 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 21:56:52,790 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 21:56:52,790 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:56:52" (1/1) ... [2025-03-08 21:56:52,791 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a436c7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:52, skipping insertion in model container [2025-03-08 21:56:52,791 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:56:52" (1/1) ... [2025-03-08 21:56:52,818 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 21:56:53,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:56:53,160 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 21:56:53,206 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:56:53,244 INFO L204 MainTranslator]: Completed translation [2025-03-08 21:56:53,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:53 WrapperNode [2025-03-08 21:56:53,245 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 21:56:53,246 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 21:56:53,246 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 21:56:53,246 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 21:56:53,253 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:56:53" (1/1) ... [2025-03-08 21:56:53,266 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:56:53" (1/1) ... [2025-03-08 21:56:53,282 INFO L138 Inliner]: procedures = 262, calls = 25, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 52 [2025-03-08 21:56:53,283 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 21:56:53,284 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 21:56:53,284 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 21:56:53,284 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 21:56:53,289 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:53" (1/1) ... [2025-03-08 21:56:53,289 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:53" (1/1) ... [2025-03-08 21:56:53,291 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:53" (1/1) ... [2025-03-08 21:56:53,292 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:53" (1/1) ... [2025-03-08 21:56:53,298 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:53" (1/1) ... [2025-03-08 21:56:53,299 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:53" (1/1) ... [2025-03-08 21:56:53,300 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:53" (1/1) ... [2025-03-08 21:56:53,300 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:53" (1/1) ... [2025-03-08 21:56:53,302 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 21:56:53,302 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 21:56:53,302 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 21:56:53,302 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 21:56:53,303 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:53" (1/1) ... [2025-03-08 21:56:53,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:56:53,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:56:53,331 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:56:53,334 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:56:53,353 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-08 21:56:53,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 21:56:53,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 21:56:53,353 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-08 21:56:53,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 21:56:53,353 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-08 21:56:53,354 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-08 21:56:53,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 21:56:53,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 21:56:53,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 21:56:53,354 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:56:53,456 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 21:56:53,458 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 21:56:53,614 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 21:56:53,614 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 21:56:53,634 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 21:56:53,634 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 21:56:53,635 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:56:53 BoogieIcfgContainer [2025-03-08 21:56:53,635 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 21:56:53,638 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 21:56:53,639 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 21:56:53,642 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 21:56:53,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:56:52" (1/3) ... [2025-03-08 21:56:53,644 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dda1807 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:56:53, skipping insertion in model container [2025-03-08 21:56:53,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:56:53" (2/3) ... [2025-03-08 21:56:53,644 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dda1807 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:56:53, skipping insertion in model container [2025-03-08 21:56:53,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:56:53" (3/3) ... [2025-03-08 21:56:53,645 INFO L128 eAbstractionObserver]: Analyzing ICFG 04-mutex_11-ptr_rc.i [2025-03-08 21:56:53,657 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 21:56:53,659 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 04-mutex_11-ptr_rc.i that has 2 procedures, 81 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-03-08 21:56:53,660 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 21:56:53,721 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-08 21:56:53,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 80 transitions, 167 flow [2025-03-08 21:56:53,797 INFO L124 PetriNetUnfolderBase]: 0/79 cut-off events. [2025-03-08 21:56:53,801 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 21:56:53,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 79 events. 0/79 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 59 event pairs, 0 based on Foata normal form. 0/75 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-03-08 21:56:53,804 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 80 transitions, 167 flow [2025-03-08 21:56:53,806 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 78 places, 74 transitions, 151 flow [2025-03-08 21:56:53,816 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:56:53,828 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;@3be5098d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:56:53,828 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-08 21:56:53,842 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 21:56:53,843 INFO L124 PetriNetUnfolderBase]: 0/45 cut-off events. [2025-03-08 21:56:53,843 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:56:53,843 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:56:53,843 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:56:53,844 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 21:56:53,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:56:53,851 INFO L85 PathProgramCache]: Analyzing trace with hash -580420261, now seen corresponding path program 1 times [2025-03-08 21:56:53,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:56:53,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506395107] [2025-03-08 21:56:53,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:56:53,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:56:53,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-08 21:56:53,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 21:56:53,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:56:53,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:56:54,471 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:56:54,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:56:54,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506395107] [2025-03-08 21:56:54,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506395107] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:56:54,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:56:54,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:56:54,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557025848] [2025-03-08 21:56:54,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:56:54,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:56:54,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:56:54,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:56:54,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:56:54,648 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 80 [2025-03-08 21:56:54,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 74 transitions, 151 flow. Second operand has 6 states, 6 states have (on average 59.333333333333336) internal successors, (356), 6 states have internal predecessors, (356), 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:56:54,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:56:54,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 80 [2025-03-08 21:56:54,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:56:54,824 INFO L124 PetriNetUnfolderBase]: 102/388 cut-off events. [2025-03-08 21:56:54,824 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 21:56:54,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 623 conditions, 388 events. 102/388 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1842 event pairs, 49 based on Foata normal form. 0/364 useless extension candidates. Maximal degree in co-relation 591. Up to 181 conditions per place. [2025-03-08 21:56:54,828 INFO L140 encePairwiseOnDemand]: 69/80 looper letters, 28 selfloop transitions, 22 changer transitions 0/103 dead transitions. [2025-03-08 21:56:54,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 103 transitions, 309 flow [2025-03-08 21:56:54,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:56:54,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:56:54,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 399 transitions. [2025-03-08 21:56:54,841 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.83125 [2025-03-08 21:56:54,843 INFO L175 Difference]: Start difference. First operand has 78 places, 74 transitions, 151 flow. Second operand 6 states and 399 transitions. [2025-03-08 21:56:54,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 103 transitions, 309 flow [2025-03-08 21:56:54,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 103 transitions, 308 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 21:56:54,851 INFO L231 Difference]: Finished difference. Result has 87 places, 95 transitions, 300 flow [2025-03-08 21:56:54,853 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=300, PETRI_PLACES=87, PETRI_TRANSITIONS=95} [2025-03-08 21:56:54,855 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 9 predicate places. [2025-03-08 21:56:54,857 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 95 transitions, 300 flow [2025-03-08 21:56:54,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 59.333333333333336) internal successors, (356), 6 states have internal predecessors, (356), 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:56:54,857 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:56:54,858 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:56:54,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 21:56:54,858 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 21:56:54,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:56:54,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1175805479, now seen corresponding path program 1 times [2025-03-08 21:56:54,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:56:54,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816176217] [2025-03-08 21:56:54,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:56:54,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:56:54,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-08 21:56:54,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 21:56:54,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:56:54,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:56:55,094 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:56:55,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:56:55,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816176217] [2025-03-08 21:56:55,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816176217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:56:55,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:56:55,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:56:55,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821167350] [2025-03-08 21:56:55,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:56:55,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:56:55,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:56:55,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:56:55,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:56:55,210 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 80 [2025-03-08 21:56:55,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 95 transitions, 300 flow. Second operand has 6 states, 6 states have (on average 59.333333333333336) internal successors, (356), 6 states have internal predecessors, (356), 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:56:55,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:56:55,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 80 [2025-03-08 21:56:55,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:56:55,329 INFO L124 PetriNetUnfolderBase]: 133/471 cut-off events. [2025-03-08 21:56:55,330 INFO L125 PetriNetUnfolderBase]: For 121/132 co-relation queries the response was YES. [2025-03-08 21:56:55,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 938 conditions, 471 events. 133/471 cut-off events. For 121/132 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2507 event pairs, 40 based on Foata normal form. 1/453 useless extension candidates. Maximal degree in co-relation 901. Up to 220 conditions per place. [2025-03-08 21:56:55,336 INFO L140 encePairwiseOnDemand]: 69/80 looper letters, 41 selfloop transitions, 26 changer transitions 0/124 dead transitions. [2025-03-08 21:56:55,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 124 transitions, 510 flow [2025-03-08 21:56:55,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:56:55,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:56:55,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 399 transitions. [2025-03-08 21:56:55,341 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.83125 [2025-03-08 21:56:55,341 INFO L175 Difference]: Start difference. First operand has 87 places, 95 transitions, 300 flow. Second operand 6 states and 399 transitions. [2025-03-08 21:56:55,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 124 transitions, 510 flow [2025-03-08 21:56:55,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 124 transitions, 510 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 21:56:55,346 INFO L231 Difference]: Finished difference. Result has 97 places, 116 transitions, 484 flow [2025-03-08 21:56:55,347 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=484, PETRI_PLACES=97, PETRI_TRANSITIONS=116} [2025-03-08 21:56:55,347 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 19 predicate places. [2025-03-08 21:56:55,348 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 116 transitions, 484 flow [2025-03-08 21:56:55,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 59.333333333333336) internal successors, (356), 6 states have internal predecessors, (356), 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:56:55,348 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:56:55,348 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:56:55,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 21:56:55,348 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 21:56:55,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:56:55,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1042349884, now seen corresponding path program 1 times [2025-03-08 21:56:55,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:56:55,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516458736] [2025-03-08 21:56:55,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:56:55,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:56:55,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 21:56:55,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 21:56:55,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:56:55,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:56:55,583 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:56:55,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:56:55,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516458736] [2025-03-08 21:56:55,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516458736] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:56:55,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:56:55,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:56:55,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448570883] [2025-03-08 21:56:55,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:56:55,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:56:55,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:56:55,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:56:55,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:56:55,654 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 80 [2025-03-08 21:56:55,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 116 transitions, 484 flow. Second operand has 6 states, 6 states have (on average 54.333333333333336) internal successors, (326), 6 states have internal predecessors, (326), 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:56:55,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:56:55,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 80 [2025-03-08 21:56:55,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:56:55,835 INFO L124 PetriNetUnfolderBase]: 267/819 cut-off events. [2025-03-08 21:56:55,835 INFO L125 PetriNetUnfolderBase]: For 540/556 co-relation queries the response was YES. [2025-03-08 21:56:55,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2090 conditions, 819 events. 267/819 cut-off events. For 540/556 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4744 event pairs, 81 based on Foata normal form. 2/780 useless extension candidates. Maximal degree in co-relation 2049. Up to 476 conditions per place. [2025-03-08 21:56:55,840 INFO L140 encePairwiseOnDemand]: 65/80 looper letters, 66 selfloop transitions, 53 changer transitions 4/171 dead transitions. [2025-03-08 21:56:55,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 171 transitions, 974 flow [2025-03-08 21:56:55,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:56:55,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:56:55,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 385 transitions. [2025-03-08 21:56:55,842 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8020833333333334 [2025-03-08 21:56:55,842 INFO L175 Difference]: Start difference. First operand has 97 places, 116 transitions, 484 flow. Second operand 6 states and 385 transitions. [2025-03-08 21:56:55,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 171 transitions, 974 flow [2025-03-08 21:56:55,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 171 transitions, 974 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 21:56:55,848 INFO L231 Difference]: Finished difference. Result has 107 places, 163 transitions, 966 flow [2025-03-08 21:56:55,848 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=966, PETRI_PLACES=107, PETRI_TRANSITIONS=163} [2025-03-08 21:56:55,849 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 29 predicate places. [2025-03-08 21:56:55,849 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 163 transitions, 966 flow [2025-03-08 21:56:55,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 54.333333333333336) internal successors, (326), 6 states have internal predecessors, (326), 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:56:55,849 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:56:55,849 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:56:55,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 21:56:55,849 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 21:56:55,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:56:55,850 INFO L85 PathProgramCache]: Analyzing trace with hash -600673628, now seen corresponding path program 1 times [2025-03-08 21:56:55,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:56:55,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921956617] [2025-03-08 21:56:55,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:56:55,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:56:55,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 21:56:55,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 21:56:55,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:56:55,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:56:56,111 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:56:56,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:56:56,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921956617] [2025-03-08 21:56:56,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921956617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:56:56,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:56:56,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:56:56,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903397104] [2025-03-08 21:56:56,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:56:56,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:56:56,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:56:56,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:56:56,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:56:56,211 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 80 [2025-03-08 21:56:56,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 163 transitions, 966 flow. Second operand has 6 states, 6 states have (on average 52.5) internal successors, (315), 6 states have internal predecessors, (315), 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:56:56,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:56:56,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 80 [2025-03-08 21:56:56,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:56:56,386 INFO L124 PetriNetUnfolderBase]: 358/1035 cut-off events. [2025-03-08 21:56:56,386 INFO L125 PetriNetUnfolderBase]: For 1486/1521 co-relation queries the response was YES. [2025-03-08 21:56:56,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3237 conditions, 1035 events. 358/1035 cut-off events. For 1486/1521 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 6346 event pairs, 77 based on Foata normal form. 3/1009 useless extension candidates. Maximal degree in co-relation 3189. Up to 593 conditions per place. [2025-03-08 21:56:56,392 INFO L140 encePairwiseOnDemand]: 65/80 looper letters, 104 selfloop transitions, 61 changer transitions 10/224 dead transitions. [2025-03-08 21:56:56,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 224 transitions, 1662 flow [2025-03-08 21:56:56,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:56:56,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:56:56,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 374 transitions. [2025-03-08 21:56:56,393 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7791666666666667 [2025-03-08 21:56:56,393 INFO L175 Difference]: Start difference. First operand has 107 places, 163 transitions, 966 flow. Second operand 6 states and 374 transitions. [2025-03-08 21:56:56,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 224 transitions, 1662 flow [2025-03-08 21:56:56,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 224 transitions, 1598 flow, removed 32 selfloop flow, removed 0 redundant places. [2025-03-08 21:56:56,403 INFO L231 Difference]: Finished difference. Result has 117 places, 210 transitions, 1488 flow [2025-03-08 21:56:56,403 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=908, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1488, PETRI_PLACES=117, PETRI_TRANSITIONS=210} [2025-03-08 21:56:56,404 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 39 predicate places. [2025-03-08 21:56:56,404 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 210 transitions, 1488 flow [2025-03-08 21:56:56,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 52.5) internal successors, (315), 6 states have internal predecessors, (315), 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:56:56,404 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:56:56,404 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] [2025-03-08 21:56:56,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 21:56:56,404 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-08 21:56:56,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:56:56,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1489320487, now seen corresponding path program 1 times [2025-03-08 21:56:56,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:56:56,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144296052] [2025-03-08 21:56:56,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:56:56,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:56:56,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 21:56:56,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 21:56:56,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:56:56,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 21:56:56,433 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 21:56:56,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 21:56:56,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 21:56:56,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:56:56,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 21:56:56,463 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 21:56:56,463 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 21:56:56,463 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 7 remaining) [2025-03-08 21:56:56,465 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2025-03-08 21:56:56,465 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-03-08 21:56:56,465 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2025-03-08 21:56:56,465 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2025-03-08 21:56:56,465 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2025-03-08 21:56:56,465 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2025-03-08 21:56:56,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 21:56:56,465 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-08 21:56:56,504 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-08 21:56:56,504 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 21:56:56,507 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 09:56:56 BasicIcfg [2025-03-08 21:56:56,507 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 21:56:56,508 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 21:56:56,508 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 21:56:56,508 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 21:56:56,509 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:56:53" (3/4) ... [2025-03-08 21:56:56,509 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-08 21:56:56,549 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 1. [2025-03-08 21:56:56,576 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 21:56:56,576 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 21:56:56,576 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 21:56:56,577 INFO L158 Benchmark]: Toolchain (without parser) took 3790.85ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 103.2MB in the beginning and 191.9MB in the end (delta: -88.7MB). Peak memory consumption was 95.6MB. Max. memory is 16.1GB. [2025-03-08 21:56:56,577 INFO L158 Benchmark]: CDTParser took 1.19ms. Allocated memory is still 201.3MB. Free memory was 125.8MB in the beginning and 125.5MB in the end (delta: 307.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 21:56:56,577 INFO L158 Benchmark]: CACSL2BoogieTranslator took 458.31ms. Allocated memory is still 142.6MB. Free memory was 103.2MB in the beginning and 76.1MB in the end (delta: 27.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 21:56:56,577 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.03ms. Allocated memory is still 142.6MB. Free memory was 76.1MB in the beginning and 73.6MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 21:56:56,577 INFO L158 Benchmark]: Boogie Preprocessor took 17.64ms. Allocated memory is still 142.6MB. Free memory was 73.6MB in the beginning and 72.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 21:56:56,577 INFO L158 Benchmark]: IcfgBuilder took 332.59ms. Allocated memory is still 142.6MB. Free memory was 72.4MB in the beginning and 55.7MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 21:56:56,577 INFO L158 Benchmark]: TraceAbstraction took 2869.48ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 55.7MB in the beginning and 200.3MB in the end (delta: -144.6MB). Peak memory consumption was 36.9MB. Max. memory is 16.1GB. [2025-03-08 21:56:56,578 INFO L158 Benchmark]: Witness Printer took 68.14ms. Allocated memory is still 327.2MB. Free memory was 200.3MB in the beginning and 191.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 21:56:56,578 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.19ms. Allocated memory is still 201.3MB. Free memory was 125.8MB in the beginning and 125.5MB in the end (delta: 307.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 458.31ms. Allocated memory is still 142.6MB. Free memory was 103.2MB in the beginning and 76.1MB in the end (delta: 27.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.03ms. Allocated memory is still 142.6MB. Free memory was 76.1MB in the beginning and 73.6MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.64ms. Allocated memory is still 142.6MB. Free memory was 73.6MB in the beginning and 72.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 332.59ms. Allocated memory is still 142.6MB. Free memory was 72.4MB in the beginning and 55.7MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2869.48ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 55.7MB in the beginning and 200.3MB in the end (delta: -144.6MB). Peak memory consumption was 36.9MB. Max. memory is 16.1GB. * Witness Printer took 68.14ms. Allocated memory is still 327.2MB. Free memory was 200.3MB in the beginning and 191.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 931]: Data race detected Data race detected The following path leads to a data race: [L917] 0 int myglobal; VAL [myglobal={1:0}] [L918] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [mutex1={2:0}, myglobal={1:0}] [L919] 0 pthread_mutex_t mutex2 = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [mutex1={2:0}, mutex2={3:0}, myglobal={1:0}] [L928] 0 pthread_t id; VAL [mutex1={2:0}, mutex2={3:0}, myglobal={1:0}] [L929] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, ((void *)0)) VAL [\old(arg)={0:0}, id=-1, mutex1={2:0}, mutex2={3:0}, myglobal={1:0}] [L921] 1 int *p = &myglobal; VAL [\old(arg)={0:0}, arg={0:0}, mutex1={2:0}, mutex2={3:0}, myglobal={1:0}, p={1:0}] [L923] EXPR 1 \read(*p) VAL [\old(arg)={0:0}, arg={0:0}, mutex1={2:0}, mutex2={3:0}, myglobal={1:0}, p={1:0}] [L923] EXPR 1 *p + 1 VAL [\old(arg)={0:0}, arg={0:0}, mutex1={2:0}, mutex2={3:0}, myglobal={1:0}, p={1:0}] [L931] EXPR 0 \read(myglobal) VAL [\old(arg)={0:0}, arg={0:0}, id=-1, mutex1={2:0}, mutex2={3:0}, myglobal={1:0}, p={1:0}] [L931] 0 myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, id=-1, mutex1={2:0}, mutex2={3:0}, myglobal={1:0}, p={1:0}] [L923] EXPR 1 *p + 1 VAL [\old(arg)={0:0}, arg={0:0}, mutex1={2:0}, mutex2={3:0}, myglobal={1:0}, p={1:0}] [L931] 0 myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, id=-1, mutex1={2:0}, mutex2={3:0}, myglobal={1:0}, p={1:0}] [L923] EXPR 1 *p + 1 VAL [\old(arg)={0:0}, arg={0:0}, mutex1={2:0}, mutex2={3:0}, myglobal={1:0}, p={1:0}] [L931] 0 myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, id=-1, mutex1={2:0}, mutex2={3:0}, myglobal={1:0}, p={1:0}] [L923] EXPR 1 *p + 1 VAL [\old(arg)={0:0}, arg={0:0}, mutex1={2:0}, mutex2={3:0}, myglobal={1:0}, p={1:0}] [L931] 0 myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, id=-1, mutex1={2:0}, mutex2={3:0}, myglobal={1:0}, p={1:0}] [L923] EXPR 1 *p + 1 VAL [\old(arg)={0:0}, arg={0:0}, mutex1={2:0}, mutex2={3:0}, myglobal={1:0}, p={1:0}] [L923] 1 *p = *p + 1 VAL [\old(arg)={0:0}, arg={0:0}, mutex1={2:0}, mutex2={3:0}, myglobal={1:0}, p={1:0}] [L931] 0 myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, id=-1, mutex1={2:0}, mutex2={3:0}, myglobal={1:0}, p={1:0}] Now there is a data race (on the heap) between C: *p = *p + 1 [923] and C: myglobal+1 [931] - UnprovableResult [Line: 931]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 929]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 923]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 923]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 108 locations, 107 edges, 7 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: 2.7s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 287 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 183 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 81 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 819 IncrementalHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 81 mSolverCounterUnsat, 3 mSDtfsCounter, 819 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1488occurred in iteration=4, InterpolantAutomatonStates: 24, 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.2s InterpolantComputationTime, 207 NumberOfCodeBlocks, 207 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 154 ConstructedInterpolants, 0 QuantifiedInterpolants, 478 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-08 21:56:56,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(DATA-RACE)