./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/goblint-regression/04-mutex_45-escape_rc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/goblint-regression/04-mutex_45-escape_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 305ca34367a0384e1cfb307304cf4f5bc67454529c9c0988e189092c0a2626a1 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:26:17,686 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:26:17,741 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-04-30 10:26:17,746 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:26:17,747 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:26:17,767 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:26:17,767 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:26:17,768 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:26:17,768 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:26:17,768 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:26:17,769 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:26:17,769 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:26:17,769 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:26:17,769 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:26:17,769 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:26:17,770 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:26:17,770 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:26:17,770 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:26:17,770 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:26:17,770 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:26:17,770 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:26:17,770 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:26:17,770 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-30 10:26:17,770 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:26:17,770 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:26:17,770 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:26:17,770 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:26:17,770 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:26:17,771 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:26:17,771 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:26:17,771 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:26:17,771 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:26:17,771 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:26:17,771 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:26:17,771 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:26:17,771 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:26:17,771 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:26:17,771 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:26:17,771 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:26:17,771 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:26:17,771 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:26:17,771 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:26:17,771 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:26:17,771 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:26:17,771 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:26:17,771 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 -> 305ca34367a0384e1cfb307304cf4f5bc67454529c9c0988e189092c0a2626a1 [2025-04-30 10:26:17,992 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:26:18,000 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:26:18,001 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:26:18,002 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:26:18,002 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:26:18,003 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/04-mutex_45-escape_rc.i [2025-04-30 10:26:19,314 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d608825d/f133384d63bc4f85a0271e7f1fe973ff/FLAG7108fda07 [2025-04-30 10:26:19,608 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:26:19,608 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/04-mutex_45-escape_rc.i [2025-04-30 10:26:19,620 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d608825d/f133384d63bc4f85a0271e7f1fe973ff/FLAG7108fda07 [2025-04-30 10:26:20,364 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d608825d/f133384d63bc4f85a0271e7f1fe973ff [2025-04-30 10:26:20,366 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:26:20,368 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:26:20,369 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:26:20,369 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:26:20,372 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:26:20,373 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:26:20" (1/1) ... [2025-04-30 10:26:20,374 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d65a4e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:20, skipping insertion in model container [2025-04-30 10:26:20,374 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:26:20" (1/1) ... [2025-04-30 10:26:20,409 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:26:20,785 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:26:20,808 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:26:20,858 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:26:20,905 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:26:20,906 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:20 WrapperNode [2025-04-30 10:26:20,906 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:26:20,907 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:26:20,908 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:26:20,908 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:26:20,912 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:20" (1/1) ... [2025-04-30 10:26:20,930 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:20" (1/1) ... [2025-04-30 10:26:20,948 INFO L138 Inliner]: procedures = 263, calls = 26, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 56 [2025-04-30 10:26:20,950 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:26:20,950 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:26:20,950 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:26:20,951 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:26:20,956 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:20" (1/1) ... [2025-04-30 10:26:20,956 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:20" (1/1) ... [2025-04-30 10:26:20,960 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:20" (1/1) ... [2025-04-30 10:26:20,964 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:20" (1/1) ... [2025-04-30 10:26:20,971 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:20" (1/1) ... [2025-04-30 10:26:20,975 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:20" (1/1) ... [2025-04-30 10:26:20,981 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:20" (1/1) ... [2025-04-30 10:26:20,982 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:20" (1/1) ... [2025-04-30 10:26:20,984 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:20" (1/1) ... [2025-04-30 10:26:20,990 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:26:20,991 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:26:20,991 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:26:20,991 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:26:20,992 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:20" (1/1) ... [2025-04-30 10:26:20,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:26:21,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:26:21,018 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-30 10:26:21,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-30 10:26:21,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-30 10:26:21,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-30 10:26:21,038 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-30 10:26:21,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-30 10:26:21,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-30 10:26:21,038 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-30 10:26:21,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:26:21,038 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-30 10:26:21,038 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-30 10:26:21,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-30 10:26:21,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:26:21,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:26:21,040 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-30 10:26:21,151 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:26:21,153 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:26:21,286 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-30 10:26:21,286 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:26:21,302 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:26:21,302 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-30 10:26:21,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:26:21 BoogieIcfgContainer [2025-04-30 10:26:21,303 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:26:21,304 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:26:21,304 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:26:21,307 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:26:21,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:26:20" (1/3) ... [2025-04-30 10:26:21,308 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6961619b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:26:21, skipping insertion in model container [2025-04-30 10:26:21,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:20" (2/3) ... [2025-04-30 10:26:21,308 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6961619b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:26:21, skipping insertion in model container [2025-04-30 10:26:21,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:26:21" (3/3) ... [2025-04-30 10:26:21,309 INFO L128 eAbstractionObserver]: Analyzing ICFG 04-mutex_45-escape_rc.i [2025-04-30 10:26:21,319 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:26:21,321 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 04-mutex_45-escape_rc.i that has 2 procedures, 85 locations, 83 edges, 1 initial locations, 0 loop locations, and 4 error locations. [2025-04-30 10:26:21,322 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-30 10:26:21,394 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-30 10:26:21,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 84 transitions, 175 flow [2025-04-30 10:26:21,462 INFO L116 PetriNetUnfolderBase]: 0/83 cut-off events. [2025-04-30 10:26:21,463 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:26:21,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 83 events. 0/83 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 60 event pairs, 0 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-04-30 10:26:21,465 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 84 transitions, 175 flow [2025-04-30 10:26:21,467 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 76 transitions, 155 flow [2025-04-30 10:26:21,472 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:26:21,478 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4fcd78fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:26:21,479 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-30 10:26:21,489 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:26:21,489 INFO L116 PetriNetUnfolderBase]: 0/42 cut-off events. [2025-04-30 10:26:21,489 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:26:21,489 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:21,490 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] [2025-04-30 10:26:21,490 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:26:21,493 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:21,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1314129442, now seen corresponding path program 1 times [2025-04-30 10:26:21,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:21,499 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243001932] [2025-04-30 10:26:21,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:21,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:21,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-30 10:26:21,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-30 10:26:21,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:21,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:22,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:26:22,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:22,075 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243001932] [2025-04-30 10:26:22,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243001932] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:22,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:22,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:26:22,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907226223] [2025-04-30 10:26:22,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:22,083 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:26:22,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:22,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:26:22,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:26:22,276 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 84 [2025-04-30 10:26:22,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 76 transitions, 155 flow. Second operand has 6 states, 6 states have (on average 60.5) internal successors, (363), 6 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:26:22,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:22,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 84 [2025-04-30 10:26:22,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:22,462 INFO L116 PetriNetUnfolderBase]: 96/421 cut-off events. [2025-04-30 10:26:22,465 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:26:22,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 645 conditions, 421 events. 96/421 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1994 event pairs, 43 based on Foata normal form. 0/394 useless extension candidates. Maximal degree in co-relation 613. Up to 170 conditions per place. [2025-04-30 10:26:22,474 INFO L140 encePairwiseOnDemand]: 73/84 looper letters, 29 selfloop transitions, 22 changer transitions 0/105 dead transitions. [2025-04-30 10:26:22,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 105 transitions, 315 flow [2025-04-30 10:26:22,476 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:26:22,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:26:22,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 406 transitions. [2025-04-30 10:26:22,488 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8055555555555556 [2025-04-30 10:26:22,489 INFO L175 Difference]: Start difference. First operand has 80 places, 76 transitions, 155 flow. Second operand 6 states and 406 transitions. [2025-04-30 10:26:22,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 105 transitions, 315 flow [2025-04-30 10:26:22,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 105 transitions, 314 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:26:22,500 INFO L231 Difference]: Finished difference. Result has 89 places, 97 transitions, 304 flow [2025-04-30 10:26:22,502 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=304, PETRI_PLACES=89, PETRI_TRANSITIONS=97} [2025-04-30 10:26:22,504 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 9 predicate places. [2025-04-30 10:26:22,505 INFO L485 AbstractCegarLoop]: Abstraction has has 89 places, 97 transitions, 304 flow [2025-04-30 10:26:22,505 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 60.5) internal successors, (363), 6 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:26:22,506 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:22,506 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] [2025-04-30 10:26:22,506 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:26:22,506 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:26:22,507 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:22,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1542875355, now seen corresponding path program 1 times [2025-04-30 10:26:22,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:22,508 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327227505] [2025-04-30 10:26:22,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:22,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:22,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-30 10:26:22,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-30 10:26:22,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:22,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:22,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:26:22,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:22,754 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327227505] [2025-04-30 10:26:22,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327227505] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:22,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:22,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:26:22,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130027388] [2025-04-30 10:26:22,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:22,756 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:26:22,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:22,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:26:22,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:26:22,856 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 84 [2025-04-30 10:26:22,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 97 transitions, 304 flow. Second operand has 6 states, 6 states have (on average 63.333333333333336) internal successors, (380), 6 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:26:22,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:22,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 84 [2025-04-30 10:26:22,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:23,032 INFO L116 PetriNetUnfolderBase]: 139/546 cut-off events. [2025-04-30 10:26:23,033 INFO L117 PetriNetUnfolderBase]: For 129/139 co-relation queries the response was YES. [2025-04-30 10:26:23,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1027 conditions, 546 events. 139/546 cut-off events. For 129/139 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2993 event pairs, 46 based on Foata normal form. 0/519 useless extension candidates. Maximal degree in co-relation 993. Up to 232 conditions per place. [2025-04-30 10:26:23,039 INFO L140 encePairwiseOnDemand]: 73/84 looper letters, 41 selfloop transitions, 26 changer transitions 0/126 dead transitions. [2025-04-30 10:26:23,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 126 transitions, 514 flow [2025-04-30 10:26:23,040 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:26:23,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:26:23,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 423 transitions. [2025-04-30 10:26:23,044 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8392857142857143 [2025-04-30 10:26:23,044 INFO L175 Difference]: Start difference. First operand has 89 places, 97 transitions, 304 flow. Second operand 6 states and 423 transitions. [2025-04-30 10:26:23,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 126 transitions, 514 flow [2025-04-30 10:26:23,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 126 transitions, 514 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:26:23,049 INFO L231 Difference]: Finished difference. Result has 99 places, 118 transitions, 488 flow [2025-04-30 10:26:23,050 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=488, PETRI_PLACES=99, PETRI_TRANSITIONS=118} [2025-04-30 10:26:23,051 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 19 predicate places. [2025-04-30 10:26:23,051 INFO L485 AbstractCegarLoop]: Abstraction has has 99 places, 118 transitions, 488 flow [2025-04-30 10:26:23,051 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 63.333333333333336) internal successors, (380), 6 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:26:23,051 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:23,051 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] [2025-04-30 10:26:23,052 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:26:23,053 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:26:23,053 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:23,053 INFO L85 PathProgramCache]: Analyzing trace with hash -692357665, now seen corresponding path program 1 times [2025-04-30 10:26:23,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:23,054 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540196262] [2025-04-30 10:26:23,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:23,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:23,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-30 10:26:23,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-30 10:26:23,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:23,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:23,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:26:23,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:23,257 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540196262] [2025-04-30 10:26:23,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540196262] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:23,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:23,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:26:23,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330593679] [2025-04-30 10:26:23,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:23,258 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:26:23,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:23,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:26:23,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:26:23,342 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 84 [2025-04-30 10:26:23,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 118 transitions, 488 flow. Second operand has 6 states, 6 states have (on average 55.5) internal successors, (333), 6 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:26:23,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:23,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 84 [2025-04-30 10:26:23,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:23,499 INFO L116 PetriNetUnfolderBase]: 257/842 cut-off events. [2025-04-30 10:26:23,499 INFO L117 PetriNetUnfolderBase]: For 527/544 co-relation queries the response was YES. [2025-04-30 10:26:23,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2079 conditions, 842 events. 257/842 cut-off events. For 527/544 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 5014 event pairs, 71 based on Foata normal form. 2/801 useless extension candidates. Maximal degree in co-relation 2038. Up to 457 conditions per place. [2025-04-30 10:26:23,507 INFO L140 encePairwiseOnDemand]: 69/84 looper letters, 67 selfloop transitions, 53 changer transitions 4/173 dead transitions. [2025-04-30 10:26:23,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 173 transitions, 980 flow [2025-04-30 10:26:23,507 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:26:23,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:26:23,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 392 transitions. [2025-04-30 10:26:23,509 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7777777777777778 [2025-04-30 10:26:23,509 INFO L175 Difference]: Start difference. First operand has 99 places, 118 transitions, 488 flow. Second operand 6 states and 392 transitions. [2025-04-30 10:26:23,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 173 transitions, 980 flow [2025-04-30 10:26:23,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 173 transitions, 980 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:26:23,518 INFO L231 Difference]: Finished difference. Result has 109 places, 165 transitions, 970 flow [2025-04-30 10:26:23,519 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=970, PETRI_PLACES=109, PETRI_TRANSITIONS=165} [2025-04-30 10:26:23,520 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 29 predicate places. [2025-04-30 10:26:23,520 INFO L485 AbstractCegarLoop]: Abstraction has has 109 places, 165 transitions, 970 flow [2025-04-30 10:26:23,520 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 55.5) internal successors, (333), 6 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:26:23,521 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:23,521 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] [2025-04-30 10:26:23,521 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:26:23,521 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:26:23,521 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:23,522 INFO L85 PathProgramCache]: Analyzing trace with hash -421266774, now seen corresponding path program 1 times [2025-04-30 10:26:23,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:23,522 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484343323] [2025-04-30 10:26:23,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:23,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:23,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-30 10:26:23,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-30 10:26:23,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:23,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:23,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:26:23,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:23,766 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484343323] [2025-04-30 10:26:23,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484343323] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:23,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:23,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:26:23,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451997763] [2025-04-30 10:26:23,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:23,766 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:26:23,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:23,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:26:23,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:26:23,873 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 84 [2025-04-30 10:26:23,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 165 transitions, 970 flow. Second operand has 6 states, 6 states have (on average 58.333333333333336) internal successors, (350), 6 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:26:23,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:23,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 84 [2025-04-30 10:26:23,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:24,132 INFO L116 PetriNetUnfolderBase]: 368/1141 cut-off events. [2025-04-30 10:26:24,133 INFO L117 PetriNetUnfolderBase]: For 1471/1504 co-relation queries the response was YES. [2025-04-30 10:26:24,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3388 conditions, 1141 events. 368/1141 cut-off events. For 1471/1504 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 7192 event pairs, 87 based on Foata normal form. 3/1109 useless extension candidates. Maximal degree in co-relation 3344. Up to 612 conditions per place. [2025-04-30 10:26:24,143 INFO L140 encePairwiseOnDemand]: 69/84 looper letters, 103 selfloop transitions, 61 changer transitions 10/226 dead transitions. [2025-04-30 10:26:24,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 226 transitions, 1664 flow [2025-04-30 10:26:24,144 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:26:24,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:26:24,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 409 transitions. [2025-04-30 10:26:24,146 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8115079365079365 [2025-04-30 10:26:24,146 INFO L175 Difference]: Start difference. First operand has 109 places, 165 transitions, 970 flow. Second operand 6 states and 409 transitions. [2025-04-30 10:26:24,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 226 transitions, 1664 flow [2025-04-30 10:26:24,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 226 transitions, 1600 flow, removed 32 selfloop flow, removed 0 redundant places. [2025-04-30 10:26:24,157 INFO L231 Difference]: Finished difference. Result has 119 places, 212 transitions, 1492 flow [2025-04-30 10:26:24,158 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=912, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1492, PETRI_PLACES=119, PETRI_TRANSITIONS=212} [2025-04-30 10:26:24,158 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, 39 predicate places. [2025-04-30 10:26:24,158 INFO L485 AbstractCegarLoop]: Abstraction has has 119 places, 212 transitions, 1492 flow [2025-04-30 10:26:24,159 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 58.333333333333336) internal successors, (350), 6 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:26:24,159 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:24,159 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] [2025-04-30 10:26:24,159 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:26:24,159 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-30 10:26:24,160 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:24,160 INFO L85 PathProgramCache]: Analyzing trace with hash -139071799, now seen corresponding path program 1 times [2025-04-30 10:26:24,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:24,160 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288722683] [2025-04-30 10:26:24,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:24,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:24,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-30 10:26:24,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-30 10:26:24,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:24,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:26:24,190 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-30 10:26:24,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-30 10:26:24,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-30 10:26:24,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:24,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:26:24,231 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-30 10:26:24,231 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-30 10:26:24,232 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (6 of 7 remaining) [2025-04-30 10:26:24,233 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2025-04-30 10:26:24,233 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2025-04-30 10:26:24,233 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-04-30 10:26:24,234 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2025-04-30 10:26:24,234 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2025-04-30 10:26:24,234 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2025-04-30 10:26:24,234 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:26:24,234 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-04-30 10:26:24,283 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-30 10:26:24,283 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-30 10:26:24,286 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.04 10:26:24 BasicIcfg [2025-04-30 10:26:24,287 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-30 10:26:24,287 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-30 10:26:24,287 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-30 10:26:24,287 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-30 10:26:24,288 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:26:21" (3/4) ... [2025-04-30 10:26:24,289 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-04-30 10:26:24,336 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 1. [2025-04-30 10:26:24,363 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-30 10:26:24,364 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-30 10:26:24,364 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-30 10:26:24,366 INFO L158 Benchmark]: Toolchain (without parser) took 3997.00ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 122.2MB in the beginning and 177.5MB in the end (delta: -55.3MB). Peak memory consumption was 130.6MB. Max. memory is 16.1GB. [2025-04-30 10:26:24,366 INFO L158 Benchmark]: CDTParser took 1.53ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:26:24,366 INFO L158 Benchmark]: CACSL2BoogieTranslator took 537.97ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 91.2MB in the end (delta: 30.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-04-30 10:26:24,367 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.55ms. Allocated memory is still 167.8MB. Free memory was 91.2MB in the beginning and 89.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:26:24,367 INFO L158 Benchmark]: Boogie Preprocessor took 40.47ms. Allocated memory is still 167.8MB. Free memory was 89.2MB in the beginning and 87.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:26:24,368 INFO L158 Benchmark]: RCFGBuilder took 311.48ms. Allocated memory is still 167.8MB. Free memory was 87.1MB in the beginning and 71.1MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-30 10:26:24,368 INFO L158 Benchmark]: TraceAbstraction took 2982.86ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 70.4MB in the beginning and 185.9MB in the end (delta: -115.5MB). Peak memory consumption was 71.9MB. Max. memory is 16.1GB. [2025-04-30 10:26:24,368 INFO L158 Benchmark]: Witness Printer took 76.69ms. Allocated memory is still 352.3MB. Free memory was 185.9MB in the beginning and 177.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-30 10:26:24,369 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.53ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 537.97ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 91.2MB in the end (delta: 30.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.55ms. Allocated memory is still 167.8MB. Free memory was 91.2MB in the beginning and 89.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 40.47ms. Allocated memory is still 167.8MB. Free memory was 89.2MB in the beginning and 87.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 311.48ms. Allocated memory is still 167.8MB. Free memory was 87.1MB in the beginning and 71.1MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2982.86ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 70.4MB in the beginning and 185.9MB in the end (delta: -115.5MB). Peak memory consumption was 71.9MB. Max. memory is 16.1GB. * Witness Printer took 76.69ms. Allocated memory is still 352.3MB. Free memory was 185.9MB in the beginning and 177.5MB 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: 922]: Data race detected Data race detected The following path leads to a data race: [L917] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [mutex1={1:0}] [L918] 0 pthread_mutex_t mutex2 = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [mutex1={1:0}, mutex2={2:0}] [L927] 0 pthread_t id; VAL [mutex1={1:0}, mutex2={2:0}] [L928] 0 int i; VAL [i={5:0}, mutex1={1:0}, mutex2={2:0}] [L929] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, (void *) &i) VAL [\at(arg, Pre)={5:0}, i={5:0}, id=-1, mutex1={1:0}, mutex2={2:0}] [L931] EXPR 0 \read(i) VAL [\at(arg, Pre)={5:0}, i={5:0}, id=-1, mutex1={1:0}, mutex2={2:0}] [L931] 0 i++ VAL [\at(arg, Pre)={5:0}, i={5:0}, id=-1, mutex1={1:0}, mutex2={2:0}] [L920] 1 int *p = (int *) arg; VAL [\at(arg, Pre)={5:0}, arg={5:0}, mutex1={1:0}, mutex2={2:0}, p={5:0}] [L922] EXPR 1 \read(*p) VAL [\at(arg, Pre)={5:0}, arg={5:0}, mutex1={1:0}, mutex2={2:0}, p={5:0}] [L922] 1 (*p)++ VAL [\at(arg, Pre)={5:0}, arg={5:0}, mutex1={1:0}, mutex2={2:0}, p={5:0}] [L931] 0 i++ VAL [\at(arg, Pre)={5:0}, arg={5:0}, i={5:0}, id=-1, mutex1={1:0}, mutex2={2:0}, p={5:0}] [L922] 1 (*p)++ VAL [\at(arg, Pre)={5:0}, arg={5:0}, mutex1={1:0}, mutex2={2:0}, p={5:0}] [L931] 0 i++ VAL [\at(arg, Pre)={5:0}, arg={5:0}, i={5:0}, id=-1, mutex1={1:0}, mutex2={2:0}, p={5:0}] [L922] 1 (*p)++ VAL [\at(arg, Pre)={5:0}, arg={5:0}, mutex1={1:0}, mutex2={2:0}, p={5:0}] [L931] 0 i++ VAL [\at(arg, Pre)={5:0}, arg={5:0}, i={5:0}, id=-1, mutex1={1:0}, mutex2={2:0}, p={5:0}] [L922] 1 (*p)++ VAL [\at(arg, Pre)={5:0}, arg={5:0}, mutex1={1:0}, mutex2={2:0}, p={5:0}] [L931] 0 i++ VAL [\at(arg, Pre)={5:0}, arg={5:0}, i={5:0}, id=-1, mutex1={1:0}, mutex2={2:0}, p={5:0}] [L922] 1 (*p)++ VAL [\at(arg, Pre)={5:0}, arg={5:0}, mutex1={1:0}, mutex2={2:0}, p={5:0}] Now there is a data race (on the heap) between C: i++ [931] and C: (*p)++ [922] - 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: 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: 922]: 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, 114 locations, 113 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.8s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 280 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 169 mSDsluCounter, 5 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 71 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 806 IncrementalHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 71 mSolverCounterUnsat, 5 mSDtfsCounter, 806 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=1492occurred 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.1s InterpolantComputationTime, 200 NumberOfCodeBlocks, 200 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 148 ConstructedInterpolants, 0 QuantifiedInterpolants, 472 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-04-30 10:26:24,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(DATA-RACE)