./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/06-symbeq_10-equ_rc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/06-symbeq_10-equ_rc.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 fd55bbfa1518dd7815f07d7de8c2030374bbc7b7998290c12df563b95f65f709 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:20:50,308 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:20:50,363 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-06 09:20:50,366 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:20:50,367 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:20:50,380 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:20:50,381 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:20:50,381 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:20:50,381 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:20:50,381 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:20:50,381 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:20:50,381 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:20:50,381 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:20:50,382 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:20:50,382 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:20:50,382 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:20:50,382 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:20:50,382 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:20:50,382 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:20:50,382 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:20:50,382 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:20:50,382 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:20:50,383 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:20:50,383 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:20:50,383 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:20:50,383 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:20:50,383 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:20:50,383 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:20:50,383 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:20:50,383 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:20:50,383 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:20:50,383 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:20:50,383 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:20:50,383 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:20:50,383 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:20:50,383 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:20:50,383 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:20:50,383 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:20:50,383 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:20:50,383 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:20:50,383 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:20:50,383 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:20:50,383 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-jdk21/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 -> fd55bbfa1518dd7815f07d7de8c2030374bbc7b7998290c12df563b95f65f709 [2025-02-06 09:20:50,624 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:20:50,633 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:20:50,635 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:20:50,636 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:20:50,636 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:20:50,638 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/06-symbeq_10-equ_rc.i [2025-02-06 09:20:51,945 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bcbda4a03/e3be2a552eaf48469750e0653cc332cc/FLAGca380900e [2025-02-06 09:20:52,274 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:20:52,275 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/06-symbeq_10-equ_rc.i [2025-02-06 09:20:52,286 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bcbda4a03/e3be2a552eaf48469750e0653cc332cc/FLAGca380900e [2025-02-06 09:20:52,504 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bcbda4a03/e3be2a552eaf48469750e0653cc332cc [2025-02-06 09:20:52,505 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:20:52,506 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:20:52,507 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:20:52,507 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:20:52,510 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:20:52,511 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:20:52" (1/1) ... [2025-02-06 09:20:52,511 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21ee5f46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:20:52, skipping insertion in model container [2025-02-06 09:20:52,511 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:20:52" (1/1) ... [2025-02-06 09:20:52,532 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:20:52,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:20:52,749 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:20:52,776 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:20:52,812 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:20:52,812 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:20:52 WrapperNode [2025-02-06 09:20:52,812 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:20:52,813 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:20:52,813 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:20:52,813 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:20:52,818 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:20:52" (1/1) ... [2025-02-06 09:20:52,826 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:20:52" (1/1) ... [2025-02-06 09:20:52,841 INFO L138 Inliner]: procedures = 265, calls = 27, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 67 [2025-02-06 09:20:52,842 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:20:52,842 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:20:52,843 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:20:52,843 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:20:52,847 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:20:52" (1/1) ... [2025-02-06 09:20:52,849 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:20:52" (1/1) ... [2025-02-06 09:20:52,853 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:20:52" (1/1) ... [2025-02-06 09:20:52,853 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:20:52" (1/1) ... [2025-02-06 09:20:52,858 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:20:52" (1/1) ... [2025-02-06 09:20:52,859 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:20:52" (1/1) ... [2025-02-06 09:20:52,860 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:20:52" (1/1) ... [2025-02-06 09:20:52,860 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:20:52" (1/1) ... [2025-02-06 09:20:52,862 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:20:52,862 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:20:52,862 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:20:52,863 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:20:52,863 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:20:52" (1/1) ... [2025-02-06 09:20:52,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:20:52,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:20:52,894 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 09:20:52,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 09:20:52,926 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 09:20:52,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 09:20:52,926 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 09:20:52,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:20:52,926 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-06 09:20:52,926 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-06 09:20:52,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 09:20:52,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:20:52,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:20:52,927 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 09:20:53,015 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:20:53,017 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:20:53,193 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:20:53,193 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:20:53,216 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:20:53,217 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:20:53,217 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:20:53 BoogieIcfgContainer [2025-02-06 09:20:53,218 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:20:53,219 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:20:53,220 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:20:53,223 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:20:53,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:20:52" (1/3) ... [2025-02-06 09:20:53,224 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2214ff8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:20:53, skipping insertion in model container [2025-02-06 09:20:53,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:20:52" (2/3) ... [2025-02-06 09:20:53,225 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2214ff8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:20:53, skipping insertion in model container [2025-02-06 09:20:53,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:20:53" (3/3) ... [2025-02-06 09:20:53,226 INFO L128 eAbstractionObserver]: Analyzing ICFG 06-symbeq_10-equ_rc.i [2025-02-06 09:20:53,238 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:20:53,239 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 06-symbeq_10-equ_rc.i that has 2 procedures, 86 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-02-06 09:20:53,239 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:20:53,279 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 09:20:53,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 86 transitions, 176 flow [2025-02-06 09:20:53,349 INFO L124 PetriNetUnfolderBase]: 1/85 cut-off events. [2025-02-06 09:20:53,353 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:20:53,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 85 events. 1/85 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2025-02-06 09:20:53,355 INFO L82 GeneralOperation]: Start removeDead. Operand has 89 places, 86 transitions, 176 flow [2025-02-06 09:20:53,362 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 85 transitions, 173 flow [2025-02-06 09:20:53,372 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:20:53,379 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;@313e7fe2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:20:53,380 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-06 09:20:53,393 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:20:53,393 INFO L124 PetriNetUnfolderBase]: 1/69 cut-off events. [2025-02-06 09:20:53,393 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:20:53,393 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:20:53,394 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] [2025-02-06 09:20:53,394 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-02-06 09:20:53,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:20:53,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1431733065, now seen corresponding path program 1 times [2025-02-06 09:20:53,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:20:53,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271388501] [2025-02-06 09:20:53,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:20:53,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:20:53,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 09:20:53,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 09:20:53,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:20:53,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:20:54,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:20:54,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:20:54,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271388501] [2025-02-06 09:20:54,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271388501] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:20:54,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:20:54,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:20:54,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300742929] [2025-02-06 09:20:54,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:20:54,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:20:54,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:20:54,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:20:54,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:20:54,327 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 86 [2025-02-06 09:20:54,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 85 transitions, 173 flow. Second operand has 6 states, 6 states have (on average 69.5) internal successors, (417), 6 states have internal predecessors, (417), 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-02-06 09:20:54,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:20:54,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 86 [2025-02-06 09:20:54,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:20:54,458 INFO L124 PetriNetUnfolderBase]: 79/332 cut-off events. [2025-02-06 09:20:54,459 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:20:54,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 516 conditions, 332 events. 79/332 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1426 event pairs, 25 based on Foata normal form. 0/312 useless extension candidates. Maximal degree in co-relation 459. Up to 130 conditions per place. [2025-02-06 09:20:54,461 INFO L140 encePairwiseOnDemand]: 75/86 looper letters, 21 selfloop transitions, 22 changer transitions 4/114 dead transitions. [2025-02-06 09:20:54,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 114 transitions, 325 flow [2025-02-06 09:20:54,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:20:54,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:20:54,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 456 transitions. [2025-02-06 09:20:54,472 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8837209302325582 [2025-02-06 09:20:54,473 INFO L175 Difference]: Start difference. First operand has 88 places, 85 transitions, 173 flow. Second operand 6 states and 456 transitions. [2025-02-06 09:20:54,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 114 transitions, 325 flow [2025-02-06 09:20:54,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 114 transitions, 324 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:20:54,479 INFO L231 Difference]: Finished difference. Result has 97 places, 106 transitions, 322 flow [2025-02-06 09:20:54,481 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=322, PETRI_PLACES=97, PETRI_TRANSITIONS=106} [2025-02-06 09:20:54,483 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 9 predicate places. [2025-02-06 09:20:54,483 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 106 transitions, 322 flow [2025-02-06 09:20:54,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 69.5) internal successors, (417), 6 states have internal predecessors, (417), 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-02-06 09:20:54,484 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:20:54,484 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] [2025-02-06 09:20:54,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:20:54,484 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-02-06 09:20:54,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:20:54,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1657911155, now seen corresponding path program 1 times [2025-02-06 09:20:54,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:20:54,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403793162] [2025-02-06 09:20:54,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:20:54,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:20:54,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-06 09:20:54,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-06 09:20:54,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:20:54,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:20:54,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:20:54,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:20:54,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403793162] [2025-02-06 09:20:54,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403793162] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:20:54,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:20:54,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:20:54,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158317345] [2025-02-06 09:20:54,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:20:54,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:20:54,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:20:54,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:20:54,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:20:54,779 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 86 [2025-02-06 09:20:54,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 106 transitions, 322 flow. Second operand has 6 states, 6 states have (on average 66.83333333333333) internal successors, (401), 6 states have internal predecessors, (401), 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-02-06 09:20:54,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:20:54,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 86 [2025-02-06 09:20:54,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:20:54,889 INFO L124 PetriNetUnfolderBase]: 132/465 cut-off events. [2025-02-06 09:20:54,889 INFO L125 PetriNetUnfolderBase]: For 136/144 co-relation queries the response was YES. [2025-02-06 09:20:54,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1058 conditions, 465 events. 132/465 cut-off events. For 136/144 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2211 event pairs, 31 based on Foata normal form. 0/451 useless extension candidates. Maximal degree in co-relation 995. Up to 218 conditions per place. [2025-02-06 09:20:54,892 INFO L140 encePairwiseOnDemand]: 75/86 looper letters, 39 selfloop transitions, 29 changer transitions 7/141 dead transitions. [2025-02-06 09:20:54,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 141 transitions, 612 flow [2025-02-06 09:20:54,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:20:54,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:20:54,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 441 transitions. [2025-02-06 09:20:54,894 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8546511627906976 [2025-02-06 09:20:54,894 INFO L175 Difference]: Start difference. First operand has 97 places, 106 transitions, 322 flow. Second operand 6 states and 441 transitions. [2025-02-06 09:20:54,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 141 transitions, 612 flow [2025-02-06 09:20:54,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 141 transitions, 612 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:20:54,899 INFO L231 Difference]: Finished difference. Result has 107 places, 130 transitions, 576 flow [2025-02-06 09:20:54,900 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=576, PETRI_PLACES=107, PETRI_TRANSITIONS=130} [2025-02-06 09:20:54,900 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 19 predicate places. [2025-02-06 09:20:54,900 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 130 transitions, 576 flow [2025-02-06 09:20:54,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 66.83333333333333) internal successors, (401), 6 states have internal predecessors, (401), 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-02-06 09:20:54,901 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:20:54,901 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] [2025-02-06 09:20:54,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:20:54,901 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-02-06 09:20:54,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:20:54,902 INFO L85 PathProgramCache]: Analyzing trace with hash -634091643, now seen corresponding path program 1 times [2025-02-06 09:20:54,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:20:54,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929483887] [2025-02-06 09:20:54,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:20:54,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:20:54,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 09:20:54,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 09:20:54,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:20:54,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:20:55,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:20:55,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:20:55,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929483887] [2025-02-06 09:20:55,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929483887] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:20:55,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:20:55,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 09:20:55,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121106436] [2025-02-06 09:20:55,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:20:55,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 09:20:55,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:20:55,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 09:20:55,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-02-06 09:20:55,711 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 86 [2025-02-06 09:20:55,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 130 transitions, 576 flow. Second operand has 11 states, 11 states have (on average 61.54545454545455) internal successors, (677), 11 states have internal predecessors, (677), 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-02-06 09:20:55,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:20:55,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 86 [2025-02-06 09:20:55,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:20:56,049 INFO L124 PetriNetUnfolderBase]: 275/886 cut-off events. [2025-02-06 09:20:56,050 INFO L125 PetriNetUnfolderBase]: For 697/697 co-relation queries the response was YES. [2025-02-06 09:20:56,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2615 conditions, 886 events. 275/886 cut-off events. For 697/697 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 5511 event pairs, 60 based on Foata normal form. 11/887 useless extension candidates. Maximal degree in co-relation 1536. Up to 285 conditions per place. [2025-02-06 09:20:56,055 INFO L140 encePairwiseOnDemand]: 70/86 looper letters, 118 selfloop transitions, 38 changer transitions 19/236 dead transitions. [2025-02-06 09:20:56,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 236 transitions, 1588 flow [2025-02-06 09:20:56,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 09:20:56,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 09:20:56,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 743 transitions. [2025-02-06 09:20:56,057 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7854122621564482 [2025-02-06 09:20:56,057 INFO L175 Difference]: Start difference. First operand has 107 places, 130 transitions, 576 flow. Second operand 11 states and 743 transitions. [2025-02-06 09:20:56,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 236 transitions, 1588 flow [2025-02-06 09:20:56,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 236 transitions, 1552 flow, removed 18 selfloop flow, removed 0 redundant places. [2025-02-06 09:20:56,067 INFO L231 Difference]: Finished difference. Result has 125 places, 164 transitions, 1003 flow [2025-02-06 09:20:56,067 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1003, PETRI_PLACES=125, PETRI_TRANSITIONS=164} [2025-02-06 09:20:56,067 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 37 predicate places. [2025-02-06 09:20:56,068 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 164 transitions, 1003 flow [2025-02-06 09:20:56,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 61.54545454545455) internal successors, (677), 11 states have internal predecessors, (677), 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-02-06 09:20:56,068 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:20:56,068 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] [2025-02-06 09:20:56,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:20:56,069 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-02-06 09:20:56,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:20:56,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1295229484, now seen corresponding path program 1 times [2025-02-06 09:20:56,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:20:56,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326844161] [2025-02-06 09:20:56,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:20:56,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:20:56,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 09:20:56,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 09:20:56,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:20:56,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:20:56,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:20:56,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:20:56,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326844161] [2025-02-06 09:20:56,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326844161] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:20:56,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:20:56,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 09:20:56,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528534911] [2025-02-06 09:20:56,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:20:56,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 09:20:56,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:20:56,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 09:20:56,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-02-06 09:20:56,790 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 86 [2025-02-06 09:20:56,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 164 transitions, 1003 flow. Second operand has 11 states, 11 states have (on average 61.54545454545455) internal successors, (677), 11 states have internal predecessors, (677), 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-02-06 09:20:56,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:20:56,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 86 [2025-02-06 09:20:56,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:20:57,152 INFO L124 PetriNetUnfolderBase]: 243/834 cut-off events. [2025-02-06 09:20:57,152 INFO L125 PetriNetUnfolderBase]: For 1312/1356 co-relation queries the response was YES. [2025-02-06 09:20:57,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2877 conditions, 834 events. 243/834 cut-off events. For 1312/1356 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 5120 event pairs, 55 based on Foata normal form. 16/844 useless extension candidates. Maximal degree in co-relation 2217. Up to 266 conditions per place. [2025-02-06 09:20:57,159 INFO L140 encePairwiseOnDemand]: 70/86 looper letters, 103 selfloop transitions, 38 changer transitions 32/234 dead transitions. [2025-02-06 09:20:57,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 234 transitions, 1867 flow [2025-02-06 09:20:57,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 09:20:57,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 09:20:57,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 736 transitions. [2025-02-06 09:20:57,163 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7780126849894292 [2025-02-06 09:20:57,163 INFO L175 Difference]: Start difference. First operand has 125 places, 164 transitions, 1003 flow. Second operand 11 states and 736 transitions. [2025-02-06 09:20:57,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 234 transitions, 1867 flow [2025-02-06 09:20:57,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 234 transitions, 1860 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-02-06 09:20:57,178 INFO L231 Difference]: Finished difference. Result has 140 places, 180 transitions, 1291 flow [2025-02-06 09:20:57,178 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=996, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1291, PETRI_PLACES=140, PETRI_TRANSITIONS=180} [2025-02-06 09:20:57,179 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 52 predicate places. [2025-02-06 09:20:57,180 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 180 transitions, 1291 flow [2025-02-06 09:20:57,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 61.54545454545455) internal successors, (677), 11 states have internal predecessors, (677), 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-02-06 09:20:57,180 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:20:57,180 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] [2025-02-06 09:20:57,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:20:57,181 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-02-06 09:20:57,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:20:57,182 INFO L85 PathProgramCache]: Analyzing trace with hash 288052445, now seen corresponding path program 1 times [2025-02-06 09:20:57,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:20:57,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207567793] [2025-02-06 09:20:57,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:20:57,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:20:57,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 09:20:57,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 09:20:57,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:20:57,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:20:57,205 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 09:20:57,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 09:20:57,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 09:20:57,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:20:57,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:20:57,237 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 09:20:57,237 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 09:20:57,238 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 4 remaining) [2025-02-06 09:20:57,239 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (2 of 4 remaining) [2025-02-06 09:20:57,239 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-02-06 09:20:57,239 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 4 remaining) [2025-02-06 09:20:57,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:20:57,240 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-06 09:20:57,262 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 09:20:57,262 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 09:20:57,265 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 09:20:57 BasicIcfg [2025-02-06 09:20:57,266 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 09:20:57,266 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 09:20:57,266 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 09:20:57,266 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 09:20:57,267 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:20:53" (3/4) ... [2025-02-06 09:20:57,267 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-06 09:20:57,303 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 2. [2025-02-06 09:20:57,329 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 09:20:57,329 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 09:20:57,330 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 09:20:57,330 INFO L158 Benchmark]: Toolchain (without parser) took 4823.71ms. Allocated memory was 142.6MB in the beginning and 209.7MB in the end (delta: 67.1MB). Free memory was 111.0MB in the beginning and 62.1MB in the end (delta: 48.9MB). Peak memory consumption was 111.6MB. Max. memory is 16.1GB. [2025-02-06 09:20:57,330 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 201.3MB. Free memory is still 123.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:20:57,330 INFO L158 Benchmark]: CACSL2BoogieTranslator took 305.41ms. Allocated memory is still 142.6MB. Free memory was 110.5MB in the beginning and 82.9MB in the end (delta: 27.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 09:20:57,331 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.91ms. Allocated memory is still 142.6MB. Free memory was 82.9MB in the beginning and 81.0MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 09:20:57,331 INFO L158 Benchmark]: Boogie Preprocessor took 19.47ms. Allocated memory is still 142.6MB. Free memory was 81.0MB in the beginning and 79.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:20:57,331 INFO L158 Benchmark]: IcfgBuilder took 355.25ms. Allocated memory is still 142.6MB. Free memory was 79.5MB in the beginning and 64.2MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 09:20:57,331 INFO L158 Benchmark]: TraceAbstraction took 4046.29ms. Allocated memory was 142.6MB in the beginning and 209.7MB in the end (delta: 67.1MB). Free memory was 63.7MB in the beginning and 70.5MB in the end (delta: -6.8MB). Peak memory consumption was 52.9MB. Max. memory is 16.1GB. [2025-02-06 09:20:57,331 INFO L158 Benchmark]: Witness Printer took 63.54ms. Allocated memory is still 209.7MB. Free memory was 70.5MB in the beginning and 62.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 09:20:57,332 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.43ms. Allocated memory is still 201.3MB. Free memory is still 123.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 305.41ms. Allocated memory is still 142.6MB. Free memory was 110.5MB in the beginning and 82.9MB in the end (delta: 27.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.91ms. Allocated memory is still 142.6MB. Free memory was 82.9MB in the beginning and 81.0MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.47ms. Allocated memory is still 142.6MB. Free memory was 81.0MB in the beginning and 79.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 355.25ms. Allocated memory is still 142.6MB. Free memory was 79.5MB in the beginning and 64.2MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4046.29ms. Allocated memory was 142.6MB in the beginning and 209.7MB in the end (delta: 67.1MB). Free memory was 63.7MB in the beginning and 70.5MB in the end (delta: -6.8MB). Peak memory consumption was 52.9MB. Max. memory is 16.1GB. * Witness Printer took 63.54ms. Allocated memory is still 209.7MB. Free memory was 70.5MB in the beginning and 62.1MB 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: 996]: Data race detected Data race detected The following path leads to a data race: [L989-L993] 0 struct s { int datum; struct q inside; pthread_mutex_t mutex; } A, B; VAL [A={1:0}, B={2:0}] [L1003] 0 int x = __VERIFIER_nondet_int(); VAL [A={1:0}, B={2:0}, x=0] [L1004] 0 pthread_t id; VAL [A={1:0}, B={2:0}, x=0] [L1005] 0 struct s *s; VAL [A={1:0}, B={2:0}, x=0] [L1006] 0 int *d; VAL [A={1:0}, B={2:0}, x=0] [L1007] 0 pthread_mutex_t *m; VAL [A={1:0}, B={2:0}, x=0] [L1008] COND FALSE 0 !(\read(x)) VAL [A={1:0}, B={2:0}, x=0] [L1012] 0 s = &B VAL [A={1:0}, B={2:0}, s={2:0}, x=0] [L1013] 0 x++ VAL [A={1:0}, B={2:0}, s={2:0}, x=1] [L1015] 0 m = &s->mutex VAL [A={1:0}, B={2:0}, m={2:12}, s={2:0}, x=1] [L1016] 0 d = &s->datum VAL [A={1:0}, B={2:0}, d={2:0}, m={2:12}, s={2:0}, x=1] [L1017] FCALL, FORK 0 pthread_create(&id,((void *)0),t_fun,((void *)0)) VAL [A={1:0}, B={2:0}, \old(arg)={0:0}, d={2:0}, id=-1, m={2:12}, s={2:0}, x=1] [L1019] 0 *d = 8 VAL [A={1:0}, B={2:0}, \old(arg)={0:0}, arg={0:0}, d={2:0}, id=-1, m={2:12}, s={2:0}, x=1] [L996] 1 B.datum = 5 VAL [A={1:0}, B={2:0}, \old(arg)={0:0}, arg={0:0}] [L1019] 0 *d = 8 VAL [A={1:0}, B={2:0}, \old(arg)={0:0}, arg={0:0}, d={2:0}, id=-1, m={2:12}, s={2:0}, x=1] [L996] 1 B.datum = 5 VAL [A={1:0}, B={2:0}, \old(arg)={0:0}, arg={0:0}] Now there is a data race (on the heap) between C: *d = 8 [1019] and C: B.datum = 5 [996] - UnprovableResult [Line: 1019]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1017]: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 104 locations, 4 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: 3.9s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 869 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 717 mSDsluCounter, 518 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 497 mSDsCounter, 72 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2427 IncrementalHoareTripleChecker+Invalid, 2499 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 72 mSolverCounterUnsat, 21 mSDtfsCounter, 2427 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1291occurred in iteration=4, InterpolantAutomatonStates: 34, 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.5s InterpolantComputationTime, 297 NumberOfCodeBlocks, 297 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 231 ConstructedInterpolants, 0 QuantifiedInterpolants, 995 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-02-06 09:20:57,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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)